Lines Matching defs:GROUP_SIZE
58 * that given key. The result is a GROUP_SIZE+-way associative cache
455 #define GROUP_SIZE \
459 * up to GROUP_SIZE * MAX_GROUP_CHAIN_LENGTH entries.
472 - sizeof(entry_t) * GROUP_SIZE];
475 entry_t entries[GROUP_SIZE];
528 /* The dictionary, GROUP_SIZE * (group_count + spare_group_count)
910 return &cache->directory[idx / GROUP_SIZE].entries[idx % GROUP_SIZE];
921 return (apr_uint32_t)group_index * GROUP_SIZE
1024 apr_uint32_t group_index = idx / GROUP_SIZE;
1028 = (apr_uint32_t) ((last_group - cache->directory) * GROUP_SIZE
1115 apr_uint32_t group_index = idx / GROUP_SIZE;
1123 assert(idx == group_index * GROUP_SIZE + group->header.used);
1268 if (group->header.used == GROUP_SIZE)
1284 assert(group->header.used == GROUP_SIZE);
1294 if ( group->header.used == GROUP_SIZE
1313 if (group->header.used == GROUP_SIZE)
1324 int to_remove = rand() % (GROUP_SIZE * group->header.chain_length);
1326 = get_group(cache, group_index, to_remove / GROUP_SIZE);
1328 entry = &to_shrink->entries[to_remove % GROUP_SIZE];
1330 for (i = 0; i < GROUP_SIZE; ++i)
1348 for (i = 0; i < GROUP_SIZE; ++i)
1760 >= (APR_UINT32_MAX / GROUP_SIZE)
1761 ? (APR_UINT32_MAX / GROUP_SIZE) - 1
2886 segment->group_count * GROUP_SIZE * sizeof(entry_t);
2889 info->total_entries += segment->group_count * GROUP_SIZE;