Searched refs:first_avail (Results 1 - 4 of 4) sorted by relevance

/freebsd-11-stable/contrib/apr-util/buckets/
H A Dapr_buckets_alloc.c100 list = (apr_bucket_alloc_t *)block->first_avail;
105 block->first_avail += APR_ALIGN_DEFAULT(sizeof(*list));
170 endp = active->first_avail + SMALL_NODE_SIZE;
179 endp = active->first_avail + SMALL_NODE_SIZE;
181 node = (node_header_t *)active->first_avail;
185 active->first_avail = endp;
193 node = (node_header_t *)memnode->first_avail;
/freebsd-11-stable/contrib/apr/memory/unix/
H A Dapr_pools.c427 node->first_avail = (char *)node + APR_MEMNODE_T_SIZE;
429 APR_VALGRIND_UNDEFINED(node->first_avail, size - APR_MEMNODE_T_SIZE);
751 #define node_free_space(node_) ((apr_size_t)(node_->endp - node_->first_avail))
842 mem = active->first_avail;
843 active->first_avail += size;
863 mem = node->first_avail;
864 node->first_avail += size;
870 free_index = (APR_ALIGN(active->endp - active->first_avail + 1,
964 active->first_avail = pool->self_first_avail;
1092 pool = (apr_pool_t *)node->first_avail;
[all...]
/freebsd-11-stable/contrib/apr/include/
H A Dapr_allocator.h46 * @note The next, ref and first_avail fields are available for use by the
51 * The ref and first_avail fields will be properly restored by
59 char *first_avail; /**< pointer to first free memory */ member in struct:apr_memnode_t
/freebsd-11-stable/contrib/serf/buckets/
H A Dallocator.c197 || active->first_avail + STANDARD_NODE_SIZE >= active->endp) {
212 node = (node_header_t *)active->first_avail;
214 active->first_avail += STANDARD_NODE_SIZE;
224 node = (node_header_t *)memnode->first_avail;

Completed in 117 milliseconds