1212 * `insert_after`. If `insert_after` is NULL, then insert block at the
1313 * head of the linked list.
1414 */
15- static struct mp_block * mem_pool_alloc_block (struct mem_pool * mem_pool , size_t block_alloc , struct mp_block * insert_after )
15+ static struct mp_block * mem_pool_alloc_block (struct mem_pool * pool ,
16+ size_t block_alloc ,
17+ struct mp_block * insert_after )
1618{
1719 struct mp_block * p ;
1820
19- mem_pool -> pool_alloc += sizeof (struct mp_block ) + block_alloc ;
21+ pool -> pool_alloc += sizeof (struct mp_block ) + block_alloc ;
2022 p = xmalloc (st_add (sizeof (struct mp_block ), block_alloc ));
2123
2224 p -> next_free = (char * )p -> space ;
@@ -26,8 +28,8 @@ static struct mp_block *mem_pool_alloc_block(struct mem_pool *mem_pool, size_t b
2628 p -> next_block = insert_after -> next_block ;
2729 insert_after -> next_block = p ;
2830 } else {
29- p -> next_block = mem_pool -> mp_block ;
30- mem_pool -> mp_block = p ;
31+ p -> next_block = pool -> mp_block ;
32+ pool -> mp_block = p ;
3133 }
3234
3335 return p ;
@@ -42,11 +44,11 @@ void mem_pool_init(struct mem_pool *pool, size_t initial_size)
4244 mem_pool_alloc_block (pool , initial_size , NULL );
4345}
4446
45- void mem_pool_discard (struct mem_pool * mem_pool , int invalidate_memory )
47+ void mem_pool_discard (struct mem_pool * pool , int invalidate_memory )
4648{
4749 struct mp_block * block , * block_to_free ;
4850
49- block = mem_pool -> mp_block ;
51+ block = pool -> mp_block ;
5052 while (block )
5153 {
5254 block_to_free = block ;
@@ -58,11 +60,11 @@ void mem_pool_discard(struct mem_pool *mem_pool, int invalidate_memory)
5860 free (block_to_free );
5961 }
6062
61- mem_pool -> mp_block = NULL ;
62- mem_pool -> pool_alloc = 0 ;
63+ pool -> mp_block = NULL ;
64+ pool -> pool_alloc = 0 ;
6365}
6466
65- void * mem_pool_alloc (struct mem_pool * mem_pool , size_t len )
67+ void * mem_pool_alloc (struct mem_pool * pool , size_t len )
6668{
6769 struct mp_block * p = NULL ;
6870 void * r ;
@@ -71,26 +73,26 @@ void *mem_pool_alloc(struct mem_pool *mem_pool, size_t len)
7173 if (len & (sizeof (uintmax_t ) - 1 ))
7274 len += sizeof (uintmax_t ) - (len & (sizeof (uintmax_t ) - 1 ));
7375
74- if (mem_pool -> mp_block &&
75- mem_pool -> mp_block -> end - mem_pool -> mp_block -> next_free >= len )
76- p = mem_pool -> mp_block ;
76+ if (pool -> mp_block &&
77+ pool -> mp_block -> end - pool -> mp_block -> next_free >= len )
78+ p = pool -> mp_block ;
7779
7880 if (!p ) {
79- if (len >= (mem_pool -> block_alloc / 2 ))
80- return mem_pool_alloc_block (mem_pool , len , mem_pool -> mp_block );
81+ if (len >= (pool -> block_alloc / 2 ))
82+ return mem_pool_alloc_block (pool , len , pool -> mp_block );
8183
82- p = mem_pool_alloc_block (mem_pool , mem_pool -> block_alloc , NULL );
84+ p = mem_pool_alloc_block (pool , pool -> block_alloc , NULL );
8385 }
8486
8587 r = p -> next_free ;
8688 p -> next_free += len ;
8789 return r ;
8890}
8991
90- void * mem_pool_calloc (struct mem_pool * mem_pool , size_t count , size_t size )
92+ void * mem_pool_calloc (struct mem_pool * pool , size_t count , size_t size )
9193{
9294 size_t len = st_mult (count , size );
93- void * r = mem_pool_alloc (mem_pool , len );
95+ void * r = mem_pool_alloc (pool , len );
9496 memset (r , 0 , len );
9597 return r ;
9698}
@@ -113,12 +115,12 @@ char *mem_pool_strndup(struct mem_pool *pool, const char *str, size_t len)
113115 return memcpy (ret , str , actual_len );
114116}
115117
116- int mem_pool_contains (struct mem_pool * mem_pool , void * mem )
118+ int mem_pool_contains (struct mem_pool * pool , void * mem )
117119{
118120 struct mp_block * p ;
119121
120122 /* Check if memory is allocated in a block */
121- for (p = mem_pool -> mp_block ; p ; p = p -> next_block )
123+ for (p = pool -> mp_block ; p ; p = p -> next_block )
122124 if ((mem >= ((void * )p -> space )) &&
123125 (mem < ((void * )p -> end )))
124126 return 1 ;
0 commit comments