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()
65 		root->height = 0;  in radix_tree_clean_root_node()
74 	int height;  in radix_tree_lookup()  local
78 	height = root->height - 1;  in radix_tree_lookup()
81 	while (height && node)  in radix_tree_lookup()
82 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
96 	int height;  in radix_tree_iter_find()  local
102 	height = root->height - 1;  in radix_tree_iter_find()
103 	if (height == -1 || index > radix_max(root))  in radix_tree_iter_find()
106 		unsigned long mask = RADIX_TREE_MAP_MASK << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
107 		unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height);  in radix_tree_iter_find()
108 		int pos = radix_pos(index, height);  in radix_tree_iter_find()
122 			height--;  in radix_tree_iter_find()
124 	} while (height != -1);  in radix_tree_iter_find()
135 	int height;  in radix_tree_delete()  local
140 	height = root->height - 1;  in radix_tree_delete()
146 	while (height && node) {  in radix_tree_delete()
147 		stack[height] = node;  in radix_tree_delete()
148 		node = node->slots[radix_pos(index, height--)];  in radix_tree_delete()
165 				root->height = 0;  in radix_tree_delete()
168 			height++;  in radix_tree_delete()
169 			node = stack[height];  in radix_tree_delete()
170 			idx = radix_pos(index, height);  in radix_tree_delete()
188 	int height;  in radix_tree_insert()  local
204 		root->height++;  in radix_tree_insert()
210 		if (root->height == RADIX_TREE_MAX_HEIGHT) {  in radix_tree_insert()
235 		root->height++;  in radix_tree_insert()
239 	height = root->height - 1;  in radix_tree_insert()
242 	for ( ; height != 0; height--) {  in radix_tree_insert()
243 		idx = radix_pos(index, height);  in radix_tree_insert()
250 	for (idx = 0; idx != height; idx++) {  in radix_tree_insert()
262 	for ( ; height != 0; height--) {  in radix_tree_insert()
263 		idx = radix_pos(index, height);  in radix_tree_insert()
264 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()
287 	int height;  in radix_tree_store()  local
308 		root->height++;  in radix_tree_store()
314 		if (root->height == RADIX_TREE_MAX_HEIGHT) {  in radix_tree_store()
339 		root->height++;  in radix_tree_store()
343 	height = root->height - 1;  in radix_tree_store()
346 	for ( ; height != 0; height--) {  in radix_tree_store()
347 		idx = radix_pos(index, height);  in radix_tree_store()
354 	for (idx = 0; idx != height; idx++) {  in radix_tree_store()
366 	for ( ; height != 0; height--) {  in radix_tree_store()
367 		idx = radix_pos(index, height);  in radix_tree_store()
368 		node->slots[idx] = temp[height - 1];  in radix_tree_store()