318 static inline unsigned long radix_tree_maxindex(unsigned int height)  in radix_tree_maxindex()  argument
320 	return height_to_maxindex[height];  in radix_tree_maxindex()
330 	unsigned int height;  in radix_tree_extend()  local
334 	height = root->height + 1;  in radix_tree_extend()
335 	while (index > radix_tree_maxindex(height))  in radix_tree_extend()
336 		height++;  in radix_tree_extend()
339 		root->height = height;  in radix_tree_extend()
355 		newheight = root->height+1;  in radix_tree_extend()
368 		root->height = newheight;  in radix_tree_extend()
369 	} while (height > root->height);  in radix_tree_extend()
394 	unsigned int height, shift, offset;  in __radix_tree_create()  local
398 	if (index > radix_tree_maxindex(root->height)) {  in __radix_tree_create()
406 	height = root->height;  in __radix_tree_create()
407 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __radix_tree_create()
410 	while (height > 0) {  in __radix_tree_create()
415 			slot->path = height;  in __radix_tree_create()
430 		height--;  in __radix_tree_create()
495 	unsigned int height, shift;  in __radix_tree_lookup()  local
514 	height = node->path & RADIX_TREE_HEIGHT_MASK;  in __radix_tree_lookup()
515 	if (index > radix_tree_maxindex(height))  in __radix_tree_lookup()
518 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __radix_tree_lookup()
528 		height--;  in __radix_tree_lookup()
529 	} while (height > 0);  in __radix_tree_lookup()
595 	unsigned int height, shift;  in radix_tree_tag_set()  local
598 	height = root->height;  in radix_tree_tag_set()
599 	BUG_ON(index > radix_tree_maxindex(height));  in radix_tree_tag_set()
602 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_set()
604 	while (height > 0) {  in radix_tree_tag_set()
613 		height--;  in radix_tree_tag_set()
643 	unsigned int height, shift;  in radix_tree_tag_clear()  local
646 	height = root->height;  in radix_tree_tag_clear()
647 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_clear()
650 	shift = height * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_clear()
705 	unsigned int height, shift;  in radix_tree_tag_get()  local
720 	height = node->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_tag_get()
721 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_get()
724 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_get()
735 		if (height == 1)  in radix_tree_tag_get()
739 		height--;  in radix_tree_tag_get()
757 	unsigned long index, offset, height;  in radix_tree_next_chunk()  local
788 	height = rnode->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_next_chunk()
789 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_next_chunk()
893 	unsigned int height = root->height;  in radix_tree_range_tag_if_tagged()  local
900 	last_index = min(last_index, radix_tree_maxindex(height));  in radix_tree_range_tag_if_tagged()
909 	if (height == 0) {  in radix_tree_range_tag_if_tagged()
915 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_range_tag_if_tagged()
1164 	unsigned int shift, height;  in __locate()  local
1167 	height = slot->path & RADIX_TREE_HEIGHT_MASK;  in __locate()
1168 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __locate()
1170 	for ( ; height > 1; height--) {  in __locate()
1258 	while (root->height > 0) {  in radix_tree_shrink()
1282 		if (root->height > 1) {  in radix_tree_shrink()
1287 		root->height--;  in radix_tree_shrink()
1307 		if (root->height == 0)  in radix_tree_shrink()
1337 				if (root->height == 0)  in __radix_tree_delete_node()
1352 			root->height = 0;  in __radix_tree_delete_node()
1453 static __init unsigned long __maxindex(unsigned int height)  in __maxindex()  argument
1455 	unsigned int width = height * RADIX_TREE_MAP_SHIFT;  in __maxindex()