49 	return ((1UL << (root->height * RADIX_TREE_MAP_SHIFT)) - 1UL);  in radix_max()
53 radix_pos(long id, int height)  in radix_pos()  argument
55 	return (id >> (RADIX_TREE_MAP_SHIFT * height)) & RADIX_TREE_MAP_MASK;  in radix_pos()
63 	int height;  in radix_tree_lookup()  local
67 	height = root->height - 1;  in radix_tree_lookup()
70 	while (height && node)  in radix_tree_lookup()
71 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
85 	int height;  in radix_tree_iter_find()  local
91 	height = root->height - 1;  in radix_tree_iter_find()
92 	if (height == -1 || index > radix_max(root))  in radix_tree_iter_find()
95 		unsigned long mask = RADIX_TREE_MAP_MASK << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
96 		unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
97 		int pos = radix_pos(index, height);  in radix_tree_iter_find()
111 			height--;  in radix_tree_iter_find()
113 	} while (height != -1);  in radix_tree_iter_find()
124 	int height;  in radix_tree_delete()  local
129 	height = root->height - 1;  in radix_tree_delete()
135 	while (height && node) {  in radix_tree_delete()
136 		stack[height] = node;  in radix_tree_delete()
137 		node = node->slots[radix_pos(index, height--)];  in radix_tree_delete()
154 				root->height = 0;  in radix_tree_delete()
157 			height++;  in radix_tree_delete()
158 			node = stack[height];  in radix_tree_delete()
159 			idx = radix_pos(index, height);  in radix_tree_delete()
177 	int height;  in radix_tree_insert()  local
193 		root->height++;  in radix_tree_insert()
200 		if (root->height == RADIX_TREE_MAX_HEIGHT)  in radix_tree_insert()
215 		root->height++;  in radix_tree_insert()
219 	height = root->height - 1;  in radix_tree_insert()
222 	for ( ; height != 0; height--) {  in radix_tree_insert()
223 		idx = radix_pos(index, height);  in radix_tree_insert()
230 	for (idx = 0; idx != height; idx++) {  in radix_tree_insert()
240 				root->height = 0;  in radix_tree_insert()
247 	for ( ; height != 0; height--) {  in radix_tree_insert()
248 		idx = radix_pos(index, height);  in radix_tree_insert()
249 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()