Searched refs:RADIX_TREE_MAP_SIZE (Results 1 – 7 of 7) sorted by relevance
30 #define IPCMNI_EXTEND_MIN_CYCLE (RADIX_TREE_MAP_SIZE * RADIX_TREE_MAP_SIZE)45 #define ipc_min_cycle ((int)RADIX_TREE_MAP_SIZE)
118 int ipc_min_cycle = RADIX_TREE_MAP_SIZE;
163 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()1205 while (++offset < RADIX_TREE_MAP_SIZE) { in radix_tree_next_chunk()1216 if (offset == RADIX_TREE_MAP_SIZE) in radix_tree_next_chunk()1523 while (offset == RADIX_TREE_MAP_SIZE) { in idr_get_free()
62 #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT) macro63 #define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1)
80 int max_slots = RADIX_TREE_MAP_SIZE; in regression2_test()
230 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) in verify_node()
358 for (i = 1; i < RADIX_TREE_MAP_SIZE; i++) in idr_checks()