Lines Matching defs:i
70 #define erase_check_load(mt, i) check_load(mt, set[i], entry[i%2])
71 #define erase_check_insert(mt, i) check_insert(mt, set[i], entry[i%2])
72 #define erase_check_erase(mt, i) check_erase(mt, set[i], entry[i%2])
98 for (int i = 0; i < 4; i++)
99 erase_check_insert(mt, i);
100 for (int i = 0; i < 4; i++)
101 erase_check_load(mt, i);
107 for (int i = 2; i < 4; i++)
108 erase_check_load(mt, i);
119 for (int i = 0; i < 4; i++)
120 erase_check_load(mt, i);
127 for (int i = 2; i < 4; i++)
128 erase_check_load(mt, i);
198 for (int i = 5; i < 25; i++) {
199 erase_check_insert(mt, i);
200 for (int j = i; j >= 0; j--)
205 for (int i = 0; i < 25; i++) {
206 if (i == 14)
207 check_load(mt, set[i], NULL);
209 erase_check_load(mt, i);
212 for (int i = 0; i < 25; i++) {
213 if (i == 16 || i == 14)
214 check_load(mt, set[i], NULL);
216 erase_check_load(mt, i);
222 for (int i = 0; i < 25; i++) {
223 if (i == 16 || i == 14 || i == 13)
224 check_load(mt, set[i], NULL);
226 erase_check_load(mt, i);
230 for (int i = 0; i < 25; i++) {
231 if (i <= 16 && i >= 13)
232 check_load(mt, set[i], NULL);
234 erase_check_load(mt, i);
239 for (int i = 0; i < 25; i++) {
240 if (i <= 17 && i >= 13)
241 check_load(mt, set[i], NULL);
243 erase_check_load(mt, i);
247 for (int i = 0; i < 25; i++) {
248 if (i <= 18 && i >= 13)
249 check_load(mt, set[i], NULL);
251 erase_check_load(mt, i);
256 for (int i = 0; i < 25; i++) {
257 if (i <= 19 && i >= 13)
258 check_load(mt, set[i], NULL);
260 erase_check_load(mt, i);
264 for (int i = 0; i < 25; i++) {
265 if (i <= 20 && i >= 13)
266 check_load(mt, set[i], NULL);
268 erase_check_load(mt, i);
272 for (int i = 0; i < 25; i++) {
273 if (i <= 21 && i >= 13)
274 check_load(mt, set[i], NULL);
276 erase_check_load(mt, i);
281 for (int i = 0; i < 25; i++) {
282 if (i <= 22 && i >= 13)
283 check_load(mt, set[i], NULL);
285 erase_check_load(mt, i);
287 for (int i = 23; i < 25; i++)
288 erase_check_erase(mt, i);
290 for (int i = 0; i < 25; i++) {
291 if (i <= 25 && i >= 13)
292 check_load(mt, set[i], NULL);
294 erase_check_load(mt, i);
299 for (int i = 13; i < ARRAY_SIZE(set); i++)
300 erase_check_insert(mt, i);
303 for (int i = 18; i < ARRAY_SIZE(set); i++) {
304 erase_check_erase(mt, i);
306 if (j < 18 || j > i)
313 for (int i = 0; i < 18; i++) {
314 erase_check_erase(mt, i);
316 if (j < 18 && j > i)
331 #define erase_check_store_range(mt, a, i, ptr) mtree_test_store_range(mt, \
332 a[(i)], a[(i + 1)], ptr)
348 const unsigned long *set, int i, bool null_entry)
592 for (int i = 0; i < size; i += 3) {
597 MA_STATE(mas_start, mt, set[i+1], set[i+1]);
598 MA_STATE(mas_end, mt, set[i+2], set[i+2]);
601 pr_err("%s: %d %s %lu - %lu\n", __func__, i,
602 ec_type_str(set[i]),
603 set[i+1], set[i+2]);
608 switch (set[i]) {
610 if ((s_min == set[i+1]) && (s_max == set[i+2])) {
613 } else if ((s_min != set[i+1]) && (s_max != set[i+2])) {
620 e_entry, e_max, set, i,
625 erase_check_store_range(mt, set, i + 1, value);
628 value = xa_mk_value(set[i + 1]);
649 e_entry, e_max, set, i,
653 erase_check_store_range(mt, set, i + 1, value);
658 check_erase(mt, set[i+1], xa_mk_value(set[i+1]));
33951 int i;
33959 i = 0;
33967 r_start = test->index[index + i];
33968 r_end = test->last[index + i];
33971 if (i == reader->del) {
33981 i = reader->flip;
33982 r_start = test->index[index + i];
33983 r_end = test->last[index + i];
33988 if (!added && (i == reader->add)) {
33994 i = reader->next;
33995 r_start = test->index[index + i];
33996 r_end = test->last[index + i];
34021 if (i == reader->flip) {
34022 alt = xa_mk_value(index + i + RCU_RANGE_COUNT);
34041 } else if (i == reader->mod) {
34042 alt = xa_mk_value(index + i * 2 + 1 +
34063 i++;
34081 int i;
34092 i = 9;
34093 mas_set(&mas, test->index[index + i]);
34096 while (i--) {
34102 r_start = test->index[index + i];
34103 r_end = test->last[index + i];
34106 if (i == reader->del) {
34116 i = reader->mod;
34117 r_start = test->index[index + i];
34118 r_end = test->last[index + i];
34122 if (!added && (i == reader->add)) {
34130 i = reader->flip;
34131 r_start = test->index[index + i];
34132 r_end = test->last[index + i];
34137 if (i == reader->mod)
34139 else if (i == reader->flip)
34148 alt = xa_mk_value(index + i * 2 + 1 +
34151 printk("Error: %p %lu-%lu %p != %lu-%lu %p %p line %d i %d\n",
34153 r_start, r_end, expected, alt, line, i);
34158 if (i == reader->mod) {
34159 alt = xa_mk_value(index + i * 2 + 1 +
34175 } else if (i == reader->flip) {
34176 alt = xa_mk_value(index + i +
34216 int i, j = 10000;
34224 i = count;
34225 while (i--) {
34227 struct rcu_reader_struct *this = &test_reader[i];
34275 int j, i;
34282 for (i = 0; i < count; i++) {
34284 struct rcu_reader_struct *this = &test_reader[i];
34342 unsigned int count, i;
34361 for (i = 0; i < RCU_RANGE_COUNT; i++) {
34367 test.index[i] = seed;
34368 test.last[i] = r;
34372 i = count = ARRAY_SIZE(readers);
34373 while (i--) {
34376 id = i / 2 * 10;
34377 if (i % 2)
34382 rcu_reader_setup(&test_reader[i], id, &test);
34383 if (pthread_create(&readers[i], NULL, *function,
34384 &test_reader[i])) {
34390 for (i = 0; i < ARRAY_SIZE(readers); i++) {
34391 struct rcu_reader_struct *this = &test_reader[i];
34566 int i;
34573 for (i = 0; i < ARRAY_SIZE(readers); i++) {
34574 if (i % 2)
34579 if (pthread_create(&readers[i], NULL, *function, vals)) {
34588 while (i--)
34589 pthread_join(readers[i], NULL);
34618 int range_cnt = 200, i, limit = 10000;
34627 for (i = 0; i < range_cnt; i++) {
34628 mtree_store_range(mt, i * len, i * len + len - 1,
34629 xa_mk_value(i * 100), GFP_KERNEL);
34635 for (i = 0; i < ARRAY_SIZE(readers); i++) {
34636 if (pthread_create(&readers[i], NULL, rcu_slot_store_reader,
34653 while (i--)
34654 pthread_join(readers[i], NULL);
34663 int i;
34671 for (i = 0; i < ARRAY_SIZE(readers); i++) {
34672 if (i % 2)
34677 if (pthread_create(&readers[i], NULL, *function, vals)) {
34693 while (i--)
34694 pthread_join(readers[i], NULL);
34704 unsigned long i, nr_entries = 1000;
34715 for (i = 0; i <= nr_entries; i++) {
34716 mas_writer.index = i * 10;
34717 mas_writer.last = i * 10 + 5;
34718 mas_store_gfp(&mas_writer, xa_mk_value(i), GFP_KERNEL);
34820 for (i = 0; i <= nr_entries; i++) {
34821 mas_writer.index = i * 10;
34822 mas_writer.last = i * 10 + 5;
34823 mas_store_gfp(&mas_writer, xa_mk_value(i), GFP_KERNEL);
34865 unsigned long i, nr_entries = 1000;
34872 for (i = 0; i <= nr_entries; i++)
34873 mtree_store_range(mt, i*10, i*10 + 5,
34874 xa_mk_value(i), GFP_KERNEL);
34893 for (i = 0; i <= nr_entries; i++)
34894 mtree_store_range(mt, i*10, i*10 + 5,
34895 xa_mk_value(i), GFP_KERNEL);
34930 for (i = 0; i <= nr_entries; i++)
34931 mtree_store_range(mt, i*10, i*10 + 5,
34932 xa_mk_value(i), GFP_KERNEL);
35132 unsigned long i, max = 100;
35142 for (i = 0; i <= max; i++)
35143 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35282 unsigned long i, max = 5000;
35287 for (i = 0; i <= max; i++)
35288 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35297 for (i = 1; i <= max; i++)
35298 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35311 for (i = 0; i <= max; i++)
35312 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35324 for (i = 0; i <= max; i++)
35325 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35337 for (i = 0; i <= max; i++)
35338 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35350 for (i = 0; i <= max; i++)
35351 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35363 for (i = 0; i <= max; i++)
35364 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35379 for (i = 0; i <= max; i++)
35380 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35395 for (i = 0; i <= max; i++)
35396 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35407 for (i = 0; i <= max; i++)
35408 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35412 i = 47811;
35414 mas_set(&mas, i);
35416 i++;
35439 for (i = 0; i <= max; i++)
35440 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35450 for (i = 0; i <= 100; i++)
35451 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35460 for (i = 0; i <= max; i++)
35461 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35464 i = 49750; /* 0xC25B */
35466 i = 49835; /* 0xC2AB */
35470 mas_set(&mas, i); /* 0xC2AB */
35474 mas_set_range(&mas, i, mas.last - 1);
35522 i = 49430; /* 0xc116 */
35524 i = 49670; /* 0xC206 */
35526 mas_set(&mas, i);
35528 MT_BUG_ON(mt, mas.index != i);
35532 MT_BUG_ON(mt, mas.index != i + 6);
35535 mas_set_range(&mas, i + 2, i + 7);
35537 MT_BUG_ON(mt, mas.index != i + 2);
35538 MT_BUG_ON(mt, mas.last != i + 7);
35549 i = 44426;
35550 mas_set(&mas, i);
35552 i = 45126;
35553 mas_set(&mas, i);
35555 i = 44790;
35558 i = 48950;
35561 mas_set(&mas, i);
35563 MT_BUG_ON(mt, mas.index != i);
35568 MT_BUG_ON(mt, mas.index != i + 6);
35572 mas_set_range(&mas, i + 2, i + 8);
35585 unsigned long i, max = 100;
35589 for (i = 0; i <= max; i++)
35590 mtree_test_store_range(mt, i * 10, i * 10 + 5, &i);
35706 int i;
35749 for (i = 0; i < mt_slots[type]; i++) {
35750 if (!slots_a[i] && !slots_b[i])
35753 if (!slots_a[i] || !slots_b[i]) {
35759 ((unsigned long *)slots_a)[i] &= MAPLE_NODE_MASK;
35760 ((unsigned long *)slots_b)[i] &= MAPLE_NODE_MASK;
36026 int i, j, ret, count = 0;
36059 for (i = 1; i <= 3; i++) {
36060 ret = build_full_tree(mt, 0, i);
36074 for (i = 1; i <= 3; i++) {
36075 ret = build_full_tree(mt, MT_FLAGS_ALLOC_RANGE, i);
36090 for (i = 0; i < 1000; i += 3) {
36091 if (i & 1) {
36099 for (j = 0; j < i; j++) {
36116 for (i = 0; i < 30; i += 3) {
36131 for (i = 0; i < 1000; i += 3) {
36132 if (i & 1) {
36140 for (j = 0; j < i; j++) {
36202 int i = 0;
36207 mtree_store_range(mt, i, i + 10, xa_mk_value(i), GFP_KERNEL);
36208 i += 9;