Searched refs:RADIX_TREE_MAP_SIZE (Results 1 - 7 of 7) sorted by relevance

/linux-master/tools/testing/radix-tree/
H A Dregression2.c10 * 0. The radix tree contains RADIX_TREE_MAP_SIZE items. And the tag of
24 * 4. All items within the index range from 0 to RADIX_TREE_MAP_SIZE - 1 are
25 * released. (Only the item which index is RADIX_TREE_MAP_SIZE exist in the
80 int max_slots = RADIX_TREE_MAP_SIZE;
H A Dtest.c230 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++)
H A Didr-test.c367 for (i = 1; i < RADIX_TREE_MAP_SIZE; i++)
/linux-master/ipc/
H A Dutil.h31 #define IPCMNI_EXTEND_MIN_CYCLE (RADIX_TREE_MAP_SIZE * RADIX_TREE_MAP_SIZE)
46 #define ipc_min_cycle ((int)RADIX_TREE_MAP_SIZE)
H A Dipc_sysctl.c74 int ipc_min_cycle = RADIX_TREE_MAP_SIZE;
/linux-master/lib/
H A Dradix-tree.c165 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE);
185 if (offset < RADIX_TREE_MAP_SIZE) {
193 while (offset < RADIX_TREE_MAP_SIZE) {
200 return RADIX_TREE_MAP_SIZE;
213 return (RADIX_TREE_MAP_SIZE << shift) - 1;
669 while (offset == RADIX_TREE_MAP_SIZE) {
1207 while (++offset < RADIX_TREE_MAP_SIZE) {
1218 if (offset == RADIX_TREE_MAP_SIZE)
1525 while (offset == RADIX_TREE_MAP_SIZE) {
/linux-master/include/linux/
H A Dradix-tree.h64 #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT) macro
65 #define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1)

Completed in 130 milliseconds