57 	struct radix_tree_node *node;  in radix_tree_lookup()  local
62 	node = root->rnode;  in radix_tree_lookup()
66 	while (height && node)  in radix_tree_lookup()
67 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
68 	if (node)  in radix_tree_lookup()
69 		item = node->slots[radix_pos(index, 0)];  in radix_tree_lookup()
79 	struct radix_tree_node *node;  in radix_tree_iter_find()  local
84 	node = root->rnode;  in radix_tree_iter_find()
85 	if (node == NULL)  in radix_tree_iter_find()
97 		*pppslot = node->slots + pos;  in radix_tree_iter_find()
99 		next = node->slots[pos];  in radix_tree_iter_find()
106 			node = next;  in radix_tree_iter_find()
118 	struct radix_tree_node *node;  in radix_tree_delete()  local
124 	node = root->rnode;  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()
136 	if (node)  in radix_tree_delete()
137 		item = node->slots[idx];  in radix_tree_delete()
143 			node->slots[idx] = NULL;  in radix_tree_delete()
144 			node->count--;  in radix_tree_delete()
145 			if (node->count > 0)  in radix_tree_delete()
147 			kfree(node);  in radix_tree_delete()
148 			if (node == root->rnode) {  in radix_tree_delete()
154 			node = stack[height];  in radix_tree_delete()
171 	struct radix_tree_node *node;  in radix_tree_insert()  local
181 	node = root->rnode;  in radix_tree_insert()
184 	if (node == NULL) {  in radix_tree_insert()
185 		node = kmalloc(sizeof(*node), M_DRM, root->gfp_mask | M_ZERO);  in radix_tree_insert()
186 		if (node == NULL)  in radix_tree_insert()
188 		root->rnode = node;  in radix_tree_insert()
203 		if (node->count != 0) {  in radix_tree_insert()
204 			node = kmalloc(sizeof(*node), M_DRM, root->gfp_mask | M_ZERO);  in radix_tree_insert()
205 			if (node == NULL)  in radix_tree_insert()
207 			node->slots[0] = root->rnode;  in radix_tree_insert()
208 			node->count++;  in radix_tree_insert()
209 			root->rnode = node;  in radix_tree_insert()
220 		if (node->slots[idx] == NULL)  in radix_tree_insert()
222 		node = node->slots[idx];  in radix_tree_insert()
227 		temp[idx] = kmalloc(sizeof(*node), M_DRM,  in radix_tree_insert()
245 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()
246 		node->count++;  in radix_tree_insert()
247 		node = node->slots[idx];  in radix_tree_insert()
254 	if (node->slots[idx])  in radix_tree_insert()
256 	node->slots[idx] = item;  in radix_tree_insert()
257 	node->count++;  in radix_tree_insert()