45 	return ((1UL << (root->height * RADIX_TREE_MAP_SHIFT)) - 1UL);  in radix_max()
49 radix_pos(long id, int height)  in radix_pos()  argument
51 	return (id >> (RADIX_TREE_MAP_SHIFT * height)) & RADIX_TREE_MAP_MASK;  in radix_pos()
59 	int height;  in radix_tree_lookup()  local
63 	height = root->height - 1;  in radix_tree_lookup()
66 	while (height && node)  in radix_tree_lookup()
67 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
81 	int height;  in radix_tree_iter_find()  local
87 	height = root->height - 1;  in radix_tree_iter_find()
88 	if (height == -1 || index > radix_max(root))  in radix_tree_iter_find()
91 		unsigned long mask = RADIX_TREE_MAP_MASK << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
92 		unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
93 		int pos = radix_pos(index, height);  in radix_tree_iter_find()
107 			height--;  in radix_tree_iter_find()
109 	} while (height != -1);  in radix_tree_iter_find()
120 	int height;  in radix_tree_delete()  local
125 	height = root->height - 1;  in radix_tree_delete()
131 	while (height && node) {  in radix_tree_delete()
132 		stack[height] = node;  in radix_tree_delete()
133 		node = node->slots[radix_pos(index, height--)];  in radix_tree_delete()
150 				root->height = 0;  in radix_tree_delete()
153 			height++;  in radix_tree_delete()
154 			node = stack[height];  in radix_tree_delete()
155 			idx = radix_pos(index, height);  in radix_tree_delete()
173 	int height;  in radix_tree_insert()  local
189 		root->height++;  in radix_tree_insert()
196 		if (root->height == RADIX_TREE_MAX_HEIGHT)  in radix_tree_insert()
211 		root->height++;  in radix_tree_insert()
215 	height = root->height - 1;  in radix_tree_insert()
218 	for ( ; height != 0; height--) {  in radix_tree_insert()
219 		idx = radix_pos(index, height);  in radix_tree_insert()
226 	for (idx = 0; idx != height; idx++) {  in radix_tree_insert()
236 				root->height = 0;  in radix_tree_insert()
243 	for ( ; height != 0; height--) {  in radix_tree_insert()
244 		idx = radix_pos(index, height);  in radix_tree_insert()
245 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()