Lines Matching +full:3 +full:k
42 int order[NUM_ENTRIES] = {1, 1, 2, 3, 4, 1, 0, 1, 3, 0, 7}; in multiorder_iteration()
82 int order[MT_NUM_ENTRIES] = {1, 0, 2, 4, 3, 1, 3, 0, 7}; in multiorder_tagged_iteration()
98 int k; in multiorder_tagged_iteration() local
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()
112 mask = (1UL << order[k]) - 1; in multiorder_tagged_iteration()
117 assert(item->order == order[k]); in multiorder_tagged_iteration()
126 int mask, k; in multiorder_tagged_iteration() local
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()
139 mask = (1 << order[k]) - 1; in multiorder_tagged_iteration()
144 assert(item->order == order[k]); in multiorder_tagged_iteration()
223 item_insert_order(tree, 3 << RADIX_TREE_MAP_SHIFT, 0); in load_creator()
227 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - in load_creator()
241 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - 1; in load_worker()