49 	unsigned int	height;		/* Height from the bottom */  member
65  * path as height 0 holds only 1 entry.
244  *	radix tree with height HEIGHT.
246 static inline unsigned long radix_tree_maxindex(unsigned int height)  in radix_tree_maxindex()  argument
248 	return height_to_maxindex[height];  in radix_tree_maxindex()
258 	unsigned int height;  in radix_tree_extend()  local
261 	/* Figure out what the height should be.  */  in radix_tree_extend()
262 	height = root->height + 1;  in radix_tree_extend()
263 	while (index > radix_tree_maxindex(height))  in radix_tree_extend()
264 		height++;  in radix_tree_extend()
267 		root->height = height;  in radix_tree_extend()
282 		/* Increase the height.  */  in radix_tree_extend()
283 		newheight = root->height+1;  in radix_tree_extend()
284 		node->height = newheight;  in radix_tree_extend()
295 		root->height = newheight;  in radix_tree_extend()
296 	} while (height > root->height);  in radix_tree_extend()
313 	unsigned int height, shift;  in radix_tree_insert()  local
320 	if (index > radix_tree_maxindex(root->height)) {  in radix_tree_insert()
328 	height = root->height;  in radix_tree_insert()
329 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_insert()
332 	while (height > 0) {  in radix_tree_insert()
337 			slot->height = height;  in radix_tree_insert()
351 		height--;  in radix_tree_insert()
379 	unsigned int height, shift;  in radix_tree_lookup_element()  local
393 	height = node->height;  in radix_tree_lookup_element()
394 	if (index > radix_tree_maxindex(height))  in radix_tree_lookup_element()
397 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_lookup_element()
407 		height--;  in radix_tree_lookup_element()
408 	} while (height > 0);  in radix_tree_lookup_element()
466 	unsigned int height, shift;  in radix_tree_tag_set()  local
469 	height = root->height;  in radix_tree_tag_set()
470 	BUG_ON(index > radix_tree_maxindex(height));  in radix_tree_tag_set()
473 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_set()
475 	while (height > 0) {  in radix_tree_tag_set()
484 		height--;  in radix_tree_tag_set()
514 	unsigned int height, shift;  in radix_tree_tag_clear()  local
517 	height = root->height;  in radix_tree_tag_clear()
518 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_clear()
521 	shift = height * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_clear()
576 	unsigned int height, shift;  in radix_tree_tag_get()  local
591 	height = node->height;  in radix_tree_tag_get()
592 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_get()
595 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_get()
606 		if (height == 1)  in radix_tree_tag_get()
610 		height--;  in radix_tree_tag_get()
647 	unsigned int height = root->height;  in radix_tree_range_tag_if_tagged()  local
654 	last_index = min(last_index, radix_tree_maxindex(height));  in radix_tree_range_tag_if_tagged()
663 	if (height == 0) {  in radix_tree_range_tag_if_tagged()
669 	shift = (height - 1) * RADIX_TREE_MAP_SHIFT;  in radix_tree_range_tag_if_tagged()
825 	unsigned int shift, height;  in __lookup()  local
828 	height = slot->height;  in __lookup()
829 	if (height == 0)  in __lookup()
831 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __lookup()
833 	for ( ; height > 1; height--) {  in __lookup()
911 	max_index = radix_tree_maxindex(node->height);  in radix_tree_gang_lookup()
984 	max_index = radix_tree_maxindex(node->height);  in radix_tree_gang_lookup_slot()
1015 	unsigned int shift, height;  in __lookup_tag()  local
1017 	height = slot->height;  in __lookup_tag()
1018 	if (height == 0)  in __lookup_tag()
1020 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __lookup_tag()
1022 	while (height > 0) {  in __lookup_tag()
1036 		height--;  in __lookup_tag()
1037 		if (height == 0) {	/* Bottom level: grab some items */  in __lookup_tag()
1110 	max_index = radix_tree_maxindex(node->height);  in radix_tree_gang_lookup_tag()
1180 	max_index = radix_tree_maxindex(node->height);  in radix_tree_gang_lookup_tag_slot()
1210 	unsigned int shift, height;  in __locate()  local
1213 	height = slot->height;  in __locate()
1214 	shift = (height-1) * RADIX_TREE_MAP_SHIFT;  in __locate()
1216 	for ( ; height > 1; height--) {  in __locate()
1276 		max_index = radix_tree_maxindex(node->height);  in radix_tree_locate_item()
1295  *	radix_tree_shrink    -    shrink height of a radix tree to minimal
1300 	/* try to shrink tree height */  in radix_tree_shrink()
1301 	while (root->height > 0) {  in radix_tree_shrink()
1325 		if (root->height > 1) {  in radix_tree_shrink()
1330 		root->height--;  in radix_tree_shrink()
1350 		if (root->height == 0)  in radix_tree_shrink()
1372 	unsigned int height, shift;  in radix_tree_delete()  local
1376 	height = root->height;  in radix_tree_delete()
1377 	if (index > radix_tree_maxindex(height))  in radix_tree_delete()
1381 	if (height == 0) {  in radix_tree_delete()
1387 	shift = height * RADIX_TREE_MAP_SHIFT;  in radix_tree_delete()
1438 	root->height = 0;  in radix_tree_delete()
1465 static __init unsigned long __maxindex(unsigned int height)  in __maxindex()  argument
1467 	unsigned int width = height * RADIX_TREE_MAP_SHIFT;  in __maxindex()