Lines Matching defs:height
49 return ((1UL << (root->height * RADIX_TREE_MAP_SHIFT)) - 1UL);
53 radix_pos(long id, int height)
55 return (id >> (RADIX_TREE_MAP_SHIFT * height)) & RADIX_TREE_MAP_MASK;
65 root->height = 0;
74 int height;
78 height = root->height - 1;
81 while (height && node)
82 node = node->slots[radix_pos(index, height--)];
96 int height;
102 height = root->height - 1;
103 if (height == -1 || index > radix_max(root))
106 unsigned long mask = RADIX_TREE_MAP_MASK << (RADIX_TREE_MAP_SHIFT * height);
107 unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height);
108 int pos = radix_pos(index, height);
122 height--;
124 } while (height != -1);
135 int height;
140 height = root->height - 1;
146 while (height && node) {
147 stack[height] = node;
148 node = node->slots[radix_pos(index, height--)];
154 * If we removed something reduce the height of the tree.
165 root->height = 0;
168 height++;
169 node = stack[height];
170 idx = radix_pos(index, height);
188 int height;
204 root->height++;
210 if (root->height == RADIX_TREE_MAX_HEIGHT) {
235 root->height++;
238 /* get radix tree height index */
239 height = root->height - 1;
242 for ( ; height != 0; height--) {
243 idx = radix_pos(index, height);
250 for (idx = 0; idx != height; idx++) {
262 for ( ; height != 0; height--) {
263 idx = radix_pos(index, height);
264 node->slots[idx] = temp[height - 1];
287 int height;
308 root->height++;
314 if (root->height == RADIX_TREE_MAX_HEIGHT) {
339 root->height++;
342 /* get radix tree height index */
343 height = root->height - 1;
346 for ( ; height != 0; height--) {
347 idx = radix_pos(index, height);
354 for (idx = 0; idx != height; idx++) {
366 for ( ; height != 0; height--) {
367 idx = radix_pos(index, height);
368 node->slots[idx] = temp[height - 1];