Lines Matching +full:128 +full:k
41 int index[NUM_ENTRIES] = {0, 2, 4, 8, 16, 32, 34, 36, 64, 72, 128}; in multiorder_iteration()
81 int index[MT_NUM_ENTRIES] = {0, 2, 4, 16, 32, 40, 64, 72, 128}; in multiorder_tagged_iteration()
85 int tag_index[TAG_ENTRIES] = {0, 4, 16, 40, 64, 72, 128}; 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()