16 			unsigned order)  in item_insert_order()  argument
18 	XA_STATE_ORDER(xas, xa, index, order);  in item_insert_order()
19 	struct item *item = item_create(index, order);  in item_insert_order()
42 	int order[NUM_ENTRIES] = {1, 1, 2, 3,  4,  1,  0,  1,  3,  0, 7};  in multiorder_iteration()  local
47 		err = item_insert_order(xa, index[i], order[i]);  in multiorder_iteration()
53 			if (j <= (index[i] | ((1 << order[i]) - 1)))  in multiorder_iteration()
58 			int height = order[i] / XA_CHUNK_SHIFT;  in multiorder_iteration()
60 			unsigned long mask = (1UL << order[i]) - 1;  in multiorder_iteration()
66 			assert(item->order == order[i]);  in multiorder_iteration()
82 	int order[MT_NUM_ENTRIES] = {1, 0, 2, 4,  3,  1,  3,  0,   7};  in multiorder_tagged_iteration()  local
90 		assert(!item_insert_order(xa, index[i], order[i]));  in multiorder_tagged_iteration()
103 			if (j <= (index[k] | ((1 << order[k]) - 1)))  in multiorder_tagged_iteration()
112 			mask = (1UL << order[k]) - 1;  in multiorder_tagged_iteration()
117 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
131 			if (j <= (index[k] | ((1 << order[k]) - 1)))  in multiorder_tagged_iteration()
139 			mask = (1 << order[k]) - 1;  in multiorder_tagged_iteration()
144 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
167 	unsigned int order = RADIX_TREE_MAP_SHIFT - 1;  in creator_func()  local
172 		item_insert_order(tree, 0, order);  in creator_func()
218 	unsigned int order;  in load_creator()  local
226 		for (order = 1; order < RADIX_TREE_MAP_SHIFT; order++) {  in load_creator()
228 						(1 << order);  in load_creator()
229 			item_insert_order(tree, index, order);  in load_creator()