Lines Matching refs:RADIX_TREE_MAP_SIZE
110 (ptr < parent->slots + RADIX_TREE_MAP_SIZE); in is_sibling_entry()
217 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
237 if (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
245 while (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
252 return RADIX_TREE_MAP_SIZE; in radix_tree_find_next_bit()
265 return (RADIX_TREE_MAP_SIZE << shift) - 1; in shift_maxindex()
291 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) { in dump_node()
340 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) in dump_ida_node()
550 nr = nr * RADIX_TREE_MAP_SIZE + 1; in radix_tree_split_preload()
575 for (subtree_height = 0; nr_subtrees > RADIX_TREE_MAP_SIZE; in radix_tree_maybe_preload_order()
885 while (offset == RADIX_TREE_MAP_SIZE) { in radix_tree_free_nodes()
1110 while (offset < RADIX_TREE_MAP_SIZE) { in replace_sibling_entries()
1317 for (end = offset + 1; end < RADIX_TREE_MAP_SIZE; end++) { in radix_tree_split()
1364 BUG_ON(n > RADIX_TREE_MAP_SIZE); in radix_tree_split()
1371 while (offset == RADIX_TREE_MAP_SIZE) { in radix_tree_split()
1648 if (offset == RADIX_TREE_MAP_SIZE) in __radix_tree_next_slot()
1663 if (offset == RADIX_TREE_MAP_SIZE) in __radix_tree_next_slot()
1765 while (++offset < RADIX_TREE_MAP_SIZE) { in radix_tree_next_chunk()
1778 if (offset == RADIX_TREE_MAP_SIZE) in radix_tree_next_chunk()
2177 while (offset == RADIX_TREE_MAP_SIZE) { in idr_get_free()