Lines Matching refs:i
25 __u64 i; member
57 ctx->i = 0; in unsafe_on_zero_iter_cb()
65 struct num_context loop_ctx = { .i = 32 }; in unsafe_on_zero_iter()
68 return choice_arr[loop_ctx.i]; in unsafe_on_zero_iter()
73 ++ctx->i; in widening_cb()
81 struct num_context loop_ctx = { .i = 0, .j = 1 }; in widening()
100 struct num_context loop_ctx = { .i = 0 }; in loop_detection()
108 switch (ctx->i) { in oob_state_machine()
110 ctx->i = 1; in oob_state_machine()
113 ctx->i = 32; in oob_state_machine()
128 struct num_context loop_ctx = { .i = 0 }; in unsafe_for_each_map_elem()
131 return choice_arr[loop_ctx.i]; in unsafe_for_each_map_elem()
143 struct num_context loop_ctx = { .i = 0 }; in unsafe_ringbuf_drain()
146 return choice_arr[loop_ctx.i]; in unsafe_ringbuf_drain()
159 struct num_context loop_ctx = { .i = 0 }; in unsafe_find_vma()
162 return choice_arr[loop_ctx.i]; in unsafe_find_vma()
167 ctx->i++; in iter_limit_cb()
175 struct num_context ctx = { .i = 0 }; in bpf_loop_iter_limit_ok()
178 return choice_arr[ctx.i]; in bpf_loop_iter_limit_ok()
185 struct num_context ctx = { .i = 0 }; in bpf_loop_iter_limit_overflow()
188 return choice_arr[ctx.i]; in bpf_loop_iter_limit_overflow()
193 ctx->i += 100; in iter_limit_level2a_cb()
199 ctx->i += 10; in iter_limit_level2b_cb()
205 ctx->i += 1; in iter_limit_level1_cb()
219 struct num_context ctx1 = { .i = 0 }; in bpf_loop_iter_limit_nested()
220 struct num_context ctx2 = { .i = 0 }; in bpf_loop_iter_limit_nested()
225 a = ctx1.i; in bpf_loop_iter_limit_nested()
226 b = ctx2.i; in bpf_loop_iter_limit_nested()
460 unsigned long i; in cond_break1() local
463 for (i = zero; i < ARR_SZ && can_loop; i++) in cond_break1()
464 sum += i; in cond_break1()
465 for (i = zero; i < ARR_SZ; i++) { in cond_break1()
466 barrier_var(i); in cond_break1()
467 sum += i + arr[i]; in cond_break1()
478 int i, j; in cond_break2() local
481 for (i = zero; i < 1000 && can_loop; i++) in cond_break2()
483 sum += i + j; in cond_break2()
491 int i, sum = 0; in loop() local
493 for (i = zero; i <= 1000000 && can_loop; i++) in loop()
494 sum += i; in loop()
560 __u64 i = 0; in __flag() local
564 if (i < ARR2_SZ) in __flag()
565 sum += arr2[i++]; in __flag()
577 long i = 0; in __flag() local
581 if (i < ARR2_SZ && i >= 0) in __flag()
582 sum += arr2[i++]; in __flag()
596 __u64 i = 0; in __flag() local
600 if (i < limit) in __flag()
601 sum += arr2[i++]; in __flag()
616 long i; in test1() local
618 for (i = 0; i < ARR_LONG_SZ && can_loop; i++) in test1()
619 arr_long[i] = i; in test1()
627 __u64 i; in test2() local
629 for (i = zero; i < ARR_LONG_SZ && can_loop; i++) { in test2()
630 barrier_var(i); in test2()
631 arr_long[i] = i; in test2()
646 __u64 i; in test3() local
648 for (i = zero; i < ARR_LONG_SZ && can_loop; i++) { in test3()
649 barrier_var(i); in test3()
650 arr_foo[i].a = i; in test3()
651 arr_foo[i].b = i; in test3()
660 long i; in test4() local
662 for (i = zero + ARR_LONG_SZ - 1; i < ARR_LONG_SZ && i >= 0 && can_loop; i--) { in test4()
663 barrier_var(i); in test4()
664 arr_foo[i].a = i; in test4()
665 arr_foo[i].b = i; in test4()