Lines Matching defs:order
3 * multiorder.c: Multi-order radix tree entry testing
16 unsigned order)
18 XA_STATE_ORDER(xas, xa, index, order);
19 struct item *item = item_create(index, order);
42 int order[NUM_ENTRIES] = {1, 1, 2, 3, 4, 1, 0, 1, 3, 0, 7};
47 err = item_insert_order(xa, index[i], order[i]);
53 if (j <= (index[i] | ((1 << order[i]) - 1)))
58 int height = order[i] / XA_CHUNK_SHIFT;
60 unsigned long mask = (1UL << order[i]) - 1;
66 assert(item->order == order[i]);
82 int order[MT_NUM_ENTRIES] = {1, 0, 2, 4, 3, 1, 3, 0, 7};
90 assert(!item_insert_order(xa, index[i], order[i]));
103 if (j <= (index[k] | ((1 << order[k]) - 1)))
112 mask = (1UL << order[k]) - 1;
117 assert(item->order == order[k]);
131 if (j <= (index[k] | ((1 << order[k]) - 1)))
139 mask = (1 << order[k]) - 1;
144 assert(item->order == order[k]);
166 /* 'order' is set up to ensure we have sibling entries */
167 unsigned int order = RADIX_TREE_MAP_SHIFT - 1;
172 item_insert_order(tree, 0, order);
217 /* 'order' is set up to ensure we have sibling entries */
218 unsigned int order;
226 for (order = 1; order < RADIX_TREE_MAP_SHIFT; order++) {
228 (1 << order);
229 item_insert_order(tree, index, order);