Home
last modified time | relevance | path

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

/linux-6.1.9/ipc/
Dutil.h30 #define IPCMNI_EXTEND_MIN_CYCLE (RADIX_TREE_MAP_SIZE * RADIX_TREE_MAP_SIZE)
45 #define ipc_min_cycle ((int)RADIX_TREE_MAP_SIZE)
Dipc_sysctl.c73 int ipc_min_cycle = RADIX_TREE_MAP_SIZE;
/linux-6.1.9/lib/
Dradix-tree.c163 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
183 if (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
191 while (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
198 return RADIX_TREE_MAP_SIZE; in radix_tree_find_next_bit()
211 return (RADIX_TREE_MAP_SIZE << shift) - 1; in shift_maxindex()
667 while (offset == RADIX_TREE_MAP_SIZE) { in radix_tree_free_nodes()
1206 while (++offset < RADIX_TREE_MAP_SIZE) { in radix_tree_next_chunk()
1217 if (offset == RADIX_TREE_MAP_SIZE) in radix_tree_next_chunk()
1524 while (offset == RADIX_TREE_MAP_SIZE) { in idr_get_free()
/linux-6.1.9/include/linux/
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)
/linux-6.1.9/tools/testing/radix-tree/
Dregression2.c80 int max_slots = RADIX_TREE_MAP_SIZE; in regression2_test()
Dtest.c230 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) in verify_node()
Didr-test.c367 for (i = 1; i < RADIX_TREE_MAP_SIZE; i++) in idr_checks()