61 	struct radix_tree_node *node;  in radix_tree_lookup()  local
66 	node = root->rnode;  in radix_tree_lookup()
70 	while (height && node)  in radix_tree_lookup()
71 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
72 	if (node)  in radix_tree_lookup()
73 		item = node->slots[radix_pos(index, 0)];  in radix_tree_lookup()
83 	struct radix_tree_node *node;  in radix_tree_iter_find()  local
88 	node = root->rnode;  in radix_tree_iter_find()
89 	if (node == NULL)  in radix_tree_iter_find()
101 		*pppslot = node->slots + pos;  in radix_tree_iter_find()
103 		next = node->slots[pos];  in radix_tree_iter_find()
110 			node = next;  in radix_tree_iter_find()
122 	struct radix_tree_node *node;  in radix_tree_delete()  local
128 	node = root->rnode;  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()
140 	if (node)  in radix_tree_delete()
141 		item = node->slots[idx];  in radix_tree_delete()
147 			node->slots[idx] = NULL;  in radix_tree_delete()
148 			node->count--;  in radix_tree_delete()
149 			if (node->count > 0)  in radix_tree_delete()
151 			free(node, M_RADIX);  in radix_tree_delete()
152 			if (node == root->rnode) {  in radix_tree_delete()
158 			node = stack[height];  in radix_tree_delete()
175 	struct radix_tree_node *node;  in radix_tree_insert()  local
185 	node = root->rnode;  in radix_tree_insert()
188 	if (node == NULL) {  in radix_tree_insert()
189 		node = malloc(sizeof(*node), M_RADIX, root->gfp_mask | M_ZERO);  in radix_tree_insert()
190 		if (node == NULL)  in radix_tree_insert()
192 		root->rnode = node;  in radix_tree_insert()
207 		if (node->count != 0) {  in radix_tree_insert()
208 			node = malloc(sizeof(*node), M_RADIX, root->gfp_mask | M_ZERO);  in radix_tree_insert()
209 			if (node == NULL)  in radix_tree_insert()
211 			node->slots[0] = root->rnode;  in radix_tree_insert()
212 			node->count++;  in radix_tree_insert()
213 			root->rnode = node;  in radix_tree_insert()
224 		if (node->slots[idx] == NULL)  in radix_tree_insert()
226 		node = node->slots[idx];  in radix_tree_insert()
231 		temp[idx] = malloc(sizeof(*node), M_RADIX,  in radix_tree_insert()
249 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()
250 		node->count++;  in radix_tree_insert()
251 		node = node->slots[idx];  in radix_tree_insert()
258 	if (node->slots[idx])  in radix_tree_insert()
260 	node->slots[idx] = item;  in radix_tree_insert()
261 	node->count++;  in radix_tree_insert()