313 static inline unsigned long radix_tree_maxindex(unsigned int height)  in radix_tree_maxindex()  argument
315 	return height_to_maxindex[height];  in radix_tree_maxindex()
325 	unsigned int height;  in radix_tree_extend()  local
329 	height = root->height + 1;  in radix_tree_extend()
330 	while (index > radix_tree_maxindex(height))  in radix_tree_extend()
331 		height++;  in radix_tree_extend()
334 		root->height = height;  in radix_tree_extend()
350 		newheight = root->height+1;  in radix_tree_extend()
363 		root->height = newheight;  in radix_tree_extend()
364 	} while (height > root->height);  in radix_tree_extend()
389 	unsigned int height, shift, offset;  in __radix_tree_create()  local
393 	if (index > radix_tree_maxindex(root->height)) {  in __radix_tree_create()
401 	height = root->height;  in __radix_tree_create()
402 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __radix_tree_create()
405 	while (height > 0) {  in __radix_tree_create()
410 			slot->path = height;  in __radix_tree_create()
425 		height--;  in __radix_tree_create()
490 	unsigned int height, shift;  in __radix_tree_lookup()  local
509 	height = node->path & RADIX_TREE_HEIGHT_MASK;  in __radix_tree_lookup()
510 	if (index > radix_tree_maxindex(height))  in __radix_tree_lookup()
513 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __radix_tree_lookup()
523 		height--;  in __radix_tree_lookup()
524 	} while (height > 0);  in __radix_tree_lookup()
590 	unsigned int height, shift;  in radix_tree_tag_set()  local
593 	height = root->height;  in radix_tree_tag_set()
594 	BUG_ON(index > radix_tree_maxindex(height));  in radix_tree_tag_set()
597 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_set()
599 	while (height > 0) {  in radix_tree_tag_set()
608 		height--;  in radix_tree_tag_set()
638 	unsigned int height, shift;  in radix_tree_tag_clear()  local
641 	height = root->height;  in radix_tree_tag_clear()
642 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_clear()
645 	shift = height * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_clear()
700 	unsigned int height, shift;  in radix_tree_tag_get()  local
715 	height = node->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_tag_get()
716 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_get()
719 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_get()
730 		if (height == 1)  in radix_tree_tag_get()
734 		height--;  in radix_tree_tag_get()
752 	unsigned long index, offset, height;  in radix_tree_next_chunk()  local
783 	height = rnode->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_next_chunk()
784 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_next_chunk()
888 	unsigned int height = root->height;  in radix_tree_range_tag_if_tagged()  local
895 	last_index = min(last_index, radix_tree_maxindex(height));  in radix_tree_range_tag_if_tagged()
904 	if (height == 0) {  in radix_tree_range_tag_if_tagged()
910 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_range_tag_if_tagged()
1159 	unsigned int shift, height;  in __locate()  local
1162 	height = slot->path & RADIX_TREE_HEIGHT_MASK;  in __locate()
1163 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __locate()
1165 	for ( ; height > 1; height--) {  in __locate()
1253 	while (root->height > 0) {  in radix_tree_shrink()
1277 		if (root->height > 1) {  in radix_tree_shrink()
1282 		root->height--;  in radix_tree_shrink()
1302 		if (root->height == 0)  in radix_tree_shrink()
1332 				if (root->height == 0)  in __radix_tree_delete_node()
1347 			root->height = 0;  in __radix_tree_delete_node()
1448 static __init unsigned long __maxindex(unsigned int height)  in __maxindex()  argument
1450 	unsigned int width = height * RADIX_TREE_MAP_SHIFT;  in __maxindex()