Lines Matching refs:height
50 unsigned int height; /* Height from the bottom */
210 * radix tree with height HEIGHT.
212 static inline unsigned long radix_tree_maxindex(unsigned int height)
214 return height_to_maxindex[height];
223 unsigned int height;
226 /* Figure out what the height should be. */
227 height = root->height + 1;
228 while (index > radix_tree_maxindex(height))
229 height++;
232 root->height = height;
241 /* Increase the height. */
250 newheight = root->height+1;
251 node->height = newheight;
254 root->height = newheight;
255 } while (height > root->height);
272 unsigned int height, shift;
279 if (index > radix_tree_maxindex(root->height)) {
286 height = root->height;
287 shift = (height-1) * RADIX_TREE_MAP_SHIFT;
290 while (height > 0) {
295 slot->height = height;
308 height--;
345 unsigned int height, shift;
358 height = node->height;
359 if (index > radix_tree_maxindex(height))
362 shift = (height-1) * RADIX_TREE_MAP_SHIFT;
372 height--;
373 } while (height > 0);
393 unsigned int height, shift;
406 height = node->height;
407 if (index > radix_tree_maxindex(height))
410 shift = (height-1) * RADIX_TREE_MAP_SHIFT;
420 height--;
421 } while (height > 0);
443 unsigned int height, shift;
446 height = root->height;
447 BUG_ON(index > radix_tree_maxindex(height));
450 shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
452 while (height > 0) {
461 height--;
491 unsigned int height, shift;
493 height = root->height;
494 if (index > radix_tree_maxindex(height))
497 shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
501 while (height > 0) {
513 height--;
552 unsigned int height, shift;
567 height = node->height;
568 if (index > radix_tree_maxindex(height))
571 shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
587 if (height == 1) {
595 height--;
606 unsigned int shift, height;
609 height = slot->height;
610 if (height == 0)
612 shift = (height-1) * RADIX_TREE_MAP_SHIFT;
614 for ( ; height > 1; height--) {
690 max_index = radix_tree_maxindex(node->height);
716 unsigned int shift, height;
718 height = slot->height;
719 if (height == 0)
721 shift = (height-1) * RADIX_TREE_MAP_SHIFT;
723 while (height > 0) {
737 height--;
738 if (height == 0) { /* Bottom level: grab some items */
814 max_index = radix_tree_maxindex(node->height);
836 * radix_tree_shrink - shrink height of a radix tree to minimal
841 /* try to shrink tree height */
842 while (root->height > 0 &&
856 if (root->height == 1)
859 root->height--;
883 unsigned int height, shift;
887 height = root->height;
888 if (index > radix_tree_maxindex(height))
892 if (height == 0 && root->rnode) {
899 shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
912 height--;
913 } while (height > 0);
950 root->height = 0;
977 static __init unsigned long __maxindex(unsigned int height)
979 unsigned int tmp = height * RADIX_TREE_MAP_SHIFT;