133 	int idx;  in radix_tree_delete()  local
147 	idx = radix_pos(index, 0);  in radix_tree_delete()
149 		item = node->slots[idx];  in radix_tree_delete()
155 			node->slots[idx] = NULL;  in radix_tree_delete()
167 			idx = radix_pos(index, height);  in radix_tree_delete()
186 	int idx;  in radix_tree_insert()  local
240 		idx = radix_pos(index, height);  in radix_tree_insert()
241 		if (node->slots[idx] == NULL)  in radix_tree_insert()
243 		node = node->slots[idx];  in radix_tree_insert()
247 	for (idx = 0; idx != height; idx++) {  in radix_tree_insert()
248 		temp[idx] = malloc(sizeof(*node), M_RADIX,  in radix_tree_insert()
250 		if (temp[idx] == NULL) {  in radix_tree_insert()
251 			while (idx--)  in radix_tree_insert()
252 				free(temp[idx], M_RADIX);  in radix_tree_insert()
260 		idx = radix_pos(index, height);  in radix_tree_insert()
261 		node->slots[idx] = temp[height - 1];  in radix_tree_insert()
263 		node = node->slots[idx];  in radix_tree_insert()
269 	idx = radix_pos(index, 0);  in radix_tree_insert()
270 	if (node->slots[idx])  in radix_tree_insert()
272 	node->slots[idx] = item;  in radix_tree_insert()
285 	int idx;  in radix_tree_store()  local
344 		idx = radix_pos(index, height);  in radix_tree_store()
345 		if (node->slots[idx] == NULL)  in radix_tree_store()
347 		node = node->slots[idx];  in radix_tree_store()
351 	for (idx = 0; idx != height; idx++) {  in radix_tree_store()
352 		temp[idx] = malloc(sizeof(*node), M_RADIX,  in radix_tree_store()
354 		if (temp[idx] == NULL) {  in radix_tree_store()
355 			while (idx--)  in radix_tree_store()
356 				free(temp[idx], M_RADIX);  in radix_tree_store()
364 		idx = radix_pos(index, height);  in radix_tree_store()
365 		node->slots[idx] = temp[height - 1];  in radix_tree_store()
367 		node = node->slots[idx];  in radix_tree_store()
373 	idx = radix_pos(index, 0);  in radix_tree_store()
375 	pitem = node->slots[idx];  in radix_tree_store()
376 	node->slots[idx] = *ppitem;  in radix_tree_store()