19 	struct item *item = item_create(index, order);  in item_insert_order()  local
23 		xas_store(&xas, item);  in item_insert_order()
30 	free(item);  in item_insert_order()
37 	struct item *item;  in multiorder_iteration()  local
57 		xas_for_each(&xas, item, ULONG_MAX) {  in multiorder_iteration()
64 			assert(!radix_tree_is_internal_node(item));  in multiorder_iteration()
65 			assert((item->index | mask) == (index[i] | mask));  in multiorder_iteration()
66 			assert(item->order == order[i]);  in multiorder_iteration()
77 	struct item *item;  in multiorder_tagged_iteration()  local
108 		xas_for_each_marked(&xas, item, ULONG_MAX, XA_MARK_1) {  in multiorder_tagged_iteration()
115 			assert(!xa_is_internal(item));  in multiorder_tagged_iteration()
116 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
117 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
136 		xas_for_each_marked(&xas, item, ULONG_MAX, XA_MARK_2) {  in multiorder_tagged_iteration()
142 			assert(!xa_is_internal(item));  in multiorder_tagged_iteration()
143 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
144 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
153 	xas_for_each_marked(&xas, item, ULONG_MAX, XA_MARK_0) {  in multiorder_tagged_iteration()
183 	struct item *item;  in iterator_func()  local
187 		xas_for_each(&xas, item, ULONG_MAX) {  in iterator_func()
188 			if (xas_retry(&xas, item))  in iterator_func()
191 			item_sanity(item, xas.xa_index);  in iterator_func()