Lines Matching refs:list
34 /** A list of free memory from which new buckets or private bucket
46 apr_bucket_alloc_t *list = data;
48 apr_allocator_free(list->allocator, list->blocks);
51 if (list->pool && list->allocator != apr_pool_allocator_get(list->pool)) {
52 apr_allocator_destroy(list->allocator);
62 apr_bucket_alloc_t *list;
73 list = apr_bucket_alloc_create_ex(allocator);
74 list->pool = p;
75 apr_pool_cleanup_register(list->pool, list, alloc_cleanup,
78 return list;
84 apr_bucket_alloc_t *list;
91 list = (apr_bucket_alloc_t *)block->first_avail;
92 list->pool = NULL;
93 list->allocator = allocator;
94 list->freelist = NULL;
95 list->blocks = block;
96 block->first_avail += APR_ALIGN_DEFAULT(sizeof(*list));
98 return list;
101 APU_DECLARE_NONSTD(void) apr_bucket_alloc_destroy(apr_bucket_alloc_t *list)
103 if (list->pool) {
104 apr_pool_cleanup_kill(list->pool, list, alloc_cleanup);
107 apr_allocator_free(list->allocator, list->blocks);
110 if (list->pool && list->allocator != apr_pool_allocator_get(list->pool)) {
111 apr_allocator_destroy(list->allocator);
117 apr_bucket_alloc_t *list)
120 apr_memnode_t *active = list->blocks;
125 if (list->freelist) {
126 node = list->freelist;
127 list->freelist = node->next;
132 list->blocks = apr_allocator_alloc(list->allocator, ALLOC_AMT);
133 if (!list->blocks) {
136 list->blocks->next = active;
137 active = list->blocks;
141 node->alloc = list;
148 apr_memnode_t *memnode = apr_allocator_alloc(list->allocator, size);
153 node->alloc = list;
166 apr_bucket_alloc_t *list = node->alloc;
167 node_header_t *curr = list->freelist;
183 apr_bucket_alloc_t *list = node->alloc;
187 node->next = list->freelist;
188 list->freelist = node;
191 apr_allocator_free(list->allocator, node->memnode);