memory/unix/apr_pools.c

591     apr_memnode_t        *active;
821     apr_memnode_t *active, *node;
838     active = pool->active;
840     /* If the active node has enough bytes left, use it. */
841     if (size <= node_free_space(active)) {
842         mem = active->first_avail;
843         active->first_avail += size;
847     node = active->next;
866     list_insert(node, active);
868     pool->active = node;
870     free_index = (APR_ALIGN(active->endp - active->first_avail + 1,
873     active->free_index = free_index;
874     node = active->next;
883     list_remove(active);
884     list_insert(active, node);
931     apr_memnode_t *active;
961      * it the active node and free the rest of the nodes.
963     active = pool->active = pool->self;
964     active->first_avail = pool->self_first_avail;
968     if (active->next == active) {
973     *active->ref = NULL;
974     allocator_free(pool->allocator, active->next);
975     active->next = active;
976     active->ref = &active->next;
983     apr_memnode_t *active;
1028     active = pool->self;
1029     *active->ref = NULL;
1043     allocator_free(allocator, active);
1109     pool->active = pool->self = node;
1200     pool->active = pool->self = node;
1256     apr_memnode_t *node, *active;
1263     active = ps->node;
1265     cur_len = strp - active->first_avail;
1276     node = active->next;
1280         list_insert(node, active);
1284         pool->active = node;
1286         free_index = (APR_ALIGN(active->endp - active->first_avail + 1,
1289         active->free_index = free_index;
1290         node = active->next;
1297             list_remove(active);
1298             list_insert(active, node);
1301         node = pool->active;
1308             active->next = ps->free;
1309             ps->free = active;
1317     memcpy(node->first_avail, active->first_avail, cur_len);
1318     APR_VALGRIND_NOACCESS(active->first_avail,
1319                           active->endp - active->first_avail);
1362     apr_memnode_t *active, *node;
1366     ps.node = active = pool->active;
1433     active = pool->active;
1438     list_insert(node, active);
1440     pool->active = node;
1442     free_index = (APR_ALIGN(active->endp - active->first_avail + 1,
1445     active->free_index = free_index;
1446     node = active->next;
1458     list_remove(active);
1459     list_insert(active, node);
1472     APR_VALGRIND_NOACCESS(pool->active->first_avail,
1473                           pool->active->endp - pool->active->first_avail);
2769                         need_timeout = 1;		/* subprocess is still active */