Lines Matching refs:index
15 static int item_insert_order(struct xarray *xa, unsigned long index, 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()
41 int index[NUM_ENTRIES] = {0, 2, 4, 8, 16, 32, 34, 36, 64, 72, 128}; 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()
62 assert((xas.xa_index | mask) == (index[i] | mask)); in multiorder_iteration()
65 assert((item->index | mask) == (index[i] | mask)); in multiorder_iteration()
81 int index[MT_NUM_ENTRIES] = {0, 2, 4, 16, 32, 40, 64, 72, 128}; in multiorder_tagged_iteration() local
90 assert(!item_insert_order(xa, index[i], order[i])); in multiorder_tagged_iteration()
101 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
103 if (j <= (index[k] | ((1 << order[k]) - 1))) in multiorder_tagged_iteration()
110 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
116 assert((item->index | mask) == (tag_index[i] | mask)); in multiorder_tagged_iteration()
129 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
131 if (j <= (index[k] | ((1 << order[k]) - 1))) in multiorder_tagged_iteration()
137 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
143 assert((item->index | mask) == (tag_index[i] | mask)); in multiorder_tagged_iteration()
227 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - in load_creator() local
229 item_insert_order(tree, index, order); in load_creator()
230 xa_set_mark(tree, index, XA_MARK_1); in load_creator()
231 item_delete_rcu(tree, index); in load_creator()
242 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - 1; in load_worker() local
247 struct item *item = xa_load(ptr, index); in load_worker()
249 item = xa_find(ptr, &find_index, index, XA_MARK_1); in load_worker()