Lines Matching refs:index
83 * XXX: to be index 0, so MIN_ALLOC must be at least two pages.
126 /** largest used index into free[], always < MAX_INDEX */
182 apr_size_t index;
185 for (index = 0; index < MAX_INDEX; index++) {
186 ref = &allocator->free[index];
191 2 * GUARDPAGE_SIZE + ((node->index+1) << BOUNDARY_INDEX));
284 apr_size_t size, i, index;
294 /* Find the index for this node size by
297 index = (size >> BOUNDARY_INDEX) - 1;
299 if (index > APR_UINT32_MAX) {
306 if (index <= allocator->max_index) {
316 * allocator->free[index] first and if no
323 ref = &allocator->free[index];
324 i = index;
333 * the highest available index, find the new highest
334 * available index
346 allocator->current_free_index += node->index + 1;
364 /* If we found nothing, seek the sink (at index 0), if
377 while ((node = *ref) != NULL && index > node->index)
383 allocator->current_free_index += node->index + 1;
422 node->index = index;
438 apr_size_t index, max_index;
455 index = node->index;
458 (node->index+1) << BOUNDARY_INDEX);
461 && index + 1 > current_free_index) {
465 else if (index < MAX_INDEX) {
469 if ((node->next = allocator->free[index]) == NULL
470 && index > max_index) {
471 max_index = index;
473 allocator->free[index] = node;
474 if (current_free_index >= index + 1)
475 current_free_index -= index + 1;
481 * just add it to the sink (at index 0).
485 if (current_free_index >= index + 1)
486 current_free_index -= index + 1;
505 2 * GUARDPAGE_SIZE + ((node->index+1) << BOUNDARY_INDEX));
562 apr_size_t index;
1748 if (node == NULL || node->index == 64) {
1761 node->index = 0;
1764 node->beginp[node->index] = mem;
1765 node->endp[node->index] = (char *)mem + size;
1766 node->index++;
1817 apr_size_t index;
1850 for (index = 0; index < node->index; index++) {
1851 memset(node->beginp[index], POOL_POISON_BYTE,
1852 (char *)node->endp[index] - (char *)node->beginp[index]);
1853 free(node->beginp[index]);
2194 if (node == NULL || node->index == 64) {
2204 node->index = 0;
2207 node->beginp[node->index] = ps.mem;
2208 node->endp[node->index] = ps.mem + ps.size;
2209 node->index++;
2233 apr_size_t index;
2238 for (index = 0; index < node->index; index++) {
2239 if (node->beginp[index] <= *pmem
2240 && node->endp[index] > *pmem) {
2266 apr_size_t index;
2271 for (index = 0; index < node->index; index++) {
2272 *psize += (char *)node->endp[index] - (char *)node->beginp[index];