38 	assert(!err);  in __multiorder_tag_test()
48 		assert(err == -EEXIST);  in __multiorder_tag_test()
52 		assert(!radix_tree_tag_get(&tree, i, 0));  in __multiorder_tag_test()
53 		assert(!radix_tree_tag_get(&tree, i, 1));  in __multiorder_tag_test()
56 	assert(radix_tree_tag_set(&tree, index, 0));  in __multiorder_tag_test()
59 		assert(radix_tree_tag_get(&tree, i, 0));  in __multiorder_tag_test()
60 		assert(!radix_tree_tag_get(&tree, i, 1));  in __multiorder_tag_test()
63 	assert(tag_tagged_items(&tree, NULL, 0, ~0UL, 10, 0, 1) == 1);  in __multiorder_tag_test()
64 	assert(radix_tree_tag_clear(&tree, index, 0));  in __multiorder_tag_test()
67 		assert(!radix_tree_tag_get(&tree, i, 0));  in __multiorder_tag_test()
68 		assert(radix_tree_tag_get(&tree, i, 1));  in __multiorder_tag_test()
71 	assert(radix_tree_tag_clear(&tree, index, 1));  in __multiorder_tag_test()
73 	assert(!radix_tree_tagged(&tree, 0));  in __multiorder_tag_test()
74 	assert(!radix_tree_tagged(&tree, 1));  in __multiorder_tag_test()
85 	assert(item_insert_order(&tree, 0, order) == 0);  in __multiorder_tag_test2()
86 	assert(item_insert(&tree, index2) == 0);  in __multiorder_tag_test2()
88 	assert(radix_tree_tag_set(&tree, 0, 0));  in __multiorder_tag_test2()
89 	assert(radix_tree_tag_set(&tree, index2, 0));  in __multiorder_tag_test2()
91 	assert(tag_tagged_items(&tree, NULL, 0, ~0UL, 10, 0, 1) == 2);  in __multiorder_tag_test2()
156 	assert(item_insert_order(&tree, index, order) == 0);  in multiorder_check()
160 		assert(item != 0);  in multiorder_check()
161 		assert(item->index == index);  in multiorder_check()
168 		assert(radix_tree_insert(&tree, i, item2) == -EEXIST);  in multiorder_check()
175 		assert(item != 0);  in multiorder_check()
176 		assert(item->index == min);  in multiorder_check()
179 	assert(item_delete(&tree, min) != 0);  in multiorder_check()
194 	assert(item_insert_order(&tree, 0, order) == 0);  in multiorder_shrink()
198 	assert(item_insert(&tree, index) == 0);  in multiorder_shrink()
199 	assert(node != tree.rnode);  in multiorder_shrink()
201 	assert(item_delete(&tree, index) != 0);  in multiorder_shrink()
202 	assert(node == tree.rnode);  in multiorder_shrink()
206 		assert(item != 0);  in multiorder_shrink()
207 		assert(item->index == 0);  in multiorder_shrink()
247 		assert(!err);  in multiorder_iteration()
261 			assert((iter.index | mask) == (index[i] | mask));  in multiorder_iteration()
262 			assert(iter.shift == shift);  in multiorder_iteration()
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()
290 		assert(!item_insert_order(&tree, index[i], order[i]));  in multiorder_tagged_iteration()
292 	assert(!radix_tree_tagged(&tree, 1));  in multiorder_tagged_iteration()
295 		assert(radix_tree_tag_set(&tree, tag_index[i], 1));  in multiorder_tagged_iteration()
314 			assert((iter.index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
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()
322 	assert(tag_tagged_items(&tree, NULL, 0, ~0UL, TAG_ENTRIES, 1, 2) ==  in multiorder_tagged_iteration()
341 			assert((iter.index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
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()
349 	assert(tag_tagged_items(&tree, NULL, 1, ~0UL, MT_NUM_ENTRIES * 2, 1, 0)  in multiorder_tagged_iteration()
353 		assert(iter.index == tag_index[i]);  in multiorder_tagged_iteration()
378 	assert(item == item2);  in multiorder_join1()
396 	assert(item2 == (void *)0x12UL);  in multiorder_join2()
397 	assert(node->exceptional == 1);  in multiorder_join2()
404 	assert(item2 == item1);  in multiorder_join2()
405 	assert(node->exceptional == 0);  in multiorder_join2()
437 	assert(node->exceptional == node->count);  in multiorder_join3()
490 	assert(item_insert_order(&tree, 0, old_order) == 0);  in __multiorder_split()
523 	assert(item == (void *)0x12);  in __multiorder_split2()
524 	assert(node->exceptional > 0);  in __multiorder_split2()
533 	assert(item != (void *)0x12);  in __multiorder_split2()
534 	assert(node->exceptional == 0);  in __multiorder_split2()
550 	assert(item == (void *)0x12);  in __multiorder_split3()
551 	assert(node->exceptional > 0);  in __multiorder_split3()
559 	assert(item == (void *)0x16);  in __multiorder_split3()
560 	assert(node->exceptional > 0);  in __multiorder_split3()
567 	assert(item == (void *)0x12);  in __multiorder_split3()
568 	assert(node->exceptional > 0);  in __multiorder_split3()
580 	assert(item == (void *)0x16);  in __multiorder_split3()
581 	assert(node->count == node->exceptional);  in __multiorder_split3()
586 		assert(node->count == 1);  in __multiorder_split3()
587 		assert(node->exceptional == 0);  in __multiorder_split3()
615 	assert(node->count == node->exceptional * 2);  in multiorder_account()
617 	assert(node->exceptional == 0);  in multiorder_account()
621 	assert(node->count == node->exceptional * 2);  in multiorder_account()
623 	assert(node->exceptional == 0);  in multiorder_account()