151 	struct item *item2 = item_create(min, order);  in multiorder_check()
159 		struct item *item = item_lookup(&tree, i);  in multiorder_check()  local
160 		assert(item != 0);  in multiorder_check()
161 		assert(item->index == index);  in multiorder_check()
174 		struct item *item = item_lookup(&tree, i);  in multiorder_check()  local
175 		assert(item != 0);  in multiorder_check()
176 		assert(item->index == min);  in multiorder_check()
205 		struct item *item = item_lookup(&tree, i);  in multiorder_shrink()  local
206 		assert(item != 0);  in multiorder_shrink()
207 		assert(item->index == 0);  in multiorder_shrink()
259 			struct item *item = *slot;  in multiorder_iteration()  local
263 			assert(!radix_tree_is_internal_node(item));  in multiorder_iteration()
264 			assert((item->index | mask) == (index[i] | mask));  in multiorder_iteration()
265 			assert(item->order == order[i]);  in multiorder_iteration()
309 			struct item *item = *slot;  in multiorder_tagged_iteration()  local
315 			assert(!radix_tree_is_internal_node(item));  in multiorder_tagged_iteration()
316 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
317 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
336 			struct item *item = *slot;  in multiorder_tagged_iteration()  local
342 			assert(!radix_tree_is_internal_node(item));  in multiorder_tagged_iteration()
343 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
344 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
368 	void *item, *item2 = item_create(index + 1, order1);  in multiorder_join1()  local
372 	item = radix_tree_lookup(&tree, index);  in multiorder_join1()
374 	loc = find_item(&tree, item);  in multiorder_join1()
376 		free(item);  in multiorder_join1()
377 	item = radix_tree_lookup(&tree, index + 1);  in multiorder_join1()
378 	assert(item == item2);  in multiorder_join1()
487 	struct item *item;  in __multiorder_split()  local
496 	item = radix_tree_tag_set(&tree, 0, 2);  in __multiorder_split()
509 	free(item);  in __multiorder_split()
518 	void *item;  in __multiorder_split2()  local
522 	item = __radix_tree_lookup(&tree, 0, &node, NULL);  in __multiorder_split2()
523 	assert(item == (void *)0x12);  in __multiorder_split2()
532 	item = __radix_tree_lookup(&tree, 0, &node, NULL);  in __multiorder_split2()
533 	assert(item != (void *)0x12);  in __multiorder_split2()
545 	void *item;  in __multiorder_split3()  local
549 	item = __radix_tree_lookup(&tree, 0, &node, NULL);  in __multiorder_split3()
550 	assert(item == (void *)0x12);  in __multiorder_split3()
558 	item = __radix_tree_lookup(&tree, 0, &node, NULL);  in __multiorder_split3()
559 	assert(item == (void *)0x16);  in __multiorder_split3()
566 	item = __radix_tree_lookup(&tree, 0, &node, NULL);  in __multiorder_split3()
567 	assert(item == (void *)0x12);  in __multiorder_split3()
579 	item = __radix_tree_lookup(&tree, 1 << new_order, &node, NULL);  in __multiorder_split3()
580 	assert(item == (void *)0x16);  in __multiorder_split3()
650 	struct item *item;  in iterator_func()  local
656 			item = radix_tree_deref_slot(slot);  in iterator_func()
658 			if (!item)  in iterator_func()
660 			if (radix_tree_deref_retry(item)) {  in iterator_func()
665 			item_sanity(item, iter.index);  in iterator_func()