Lines Matching refs:it
34 struct bpf_iter_num it;
39 bpf_iter_num_new(&it, 0, 1000);
40 while ((v = bpf_iter_num_next(&it))) {
43 bpf_iter_num_destroy(&it);
54 struct bpf_iter_num it;
60 "r1 = %[it];" /* iterator state */
66 "r1 = %[it];"
72 "r1 = %[it];"
80 : [it]"r"(&it),
96 struct bpf_iter_num it;
101 bpf_iter_num_new(&it, 0, 3);
102 while ((v = bpf_iter_num_next(&it))) {
105 bpf_iter_num_destroy(&it);
114 __attribute__((cleanup(bpf_iter_num_destroy))) struct bpf_iter_num it;
119 bpf_iter_num_new(&it, 0, 3);
120 while ((v = bpf_iter_num_next(&it))) {
132 struct bpf_iter_num it;
137 bpf_iter_num_new(&it, 5, 10);
138 for (v = bpf_iter_num_next(&it); v; v = bpf_iter_num_next(&it)) {
141 bpf_iter_num_destroy(&it);
180 struct bpf_iter_num it;
185 bpf_iter_num_new(&it, 0, 2);
188 v = bpf_iter_num_next(&it);
191 bpf_iter_num_destroy(&it);
200 struct bpf_iter_num it;
205 bpf_iter_num_new(&it, 100, 200);
206 v = bpf_iter_num_next(&it);
208 v = bpf_iter_num_next(&it);
210 v = bpf_iter_num_next(&it);
212 v = bpf_iter_num_next(&it);
214 bpf_iter_num_destroy(&it);
223 struct bpf_iter_num it;
228 bpf_iter_num_new(&it, 0, 3);
229 while ((v = bpf_iter_num_next(&it))) {
232 bpf_iter_num_destroy(&it);
234 bpf_iter_num_new(&it, 5, 10);
235 for (v = bpf_iter_num_next(&it); v; v = bpf_iter_num_next(&it)) {
238 bpf_iter_num_destroy(&it);
240 bpf_iter_num_new(&it, 0, 2);
243 v = bpf_iter_num_next(&it);
246 bpf_iter_num_destroy(&it);
248 bpf_iter_num_new(&it, 100, 200);
249 v = bpf_iter_num_next(&it);
251 v = bpf_iter_num_next(&it);
253 v = bpf_iter_num_next(&it);
255 v = bpf_iter_num_next(&it);
257 bpf_iter_num_destroy(&it);
266 struct bpf_iter_num it;
271 bpf_iter_num_new(&it, 0, 10);
272 while ((v = bpf_iter_num_next(&it))) {
280 bpf_iter_num_destroy(&it);
291 struct bpf_iter_num it;
293 /* Make i's initial value unknowable for verifier to prevent it from
300 bpf_iter_num_new(&it, 0, 10);
301 while ((v = bpf_iter_num_next(&it))) {
324 bpf_iter_num_destroy(&it);
335 struct bpf_iter_num it;
341 bpf_iter_num_new(&it, 0, 10);
343 while ((v = bpf_iter_num_next(&it))) {
364 bpf_iter_num_destroy(&it);
635 * it's all zeros; if we don't do that, we'll make BPF verifier track
661 static __noinline void fill(struct bpf_iter_num *it, int *arr, __u32 n, int mul)
665 while ((t = bpf_iter_num_next(it))) {
673 static __noinline int sum(struct bpf_iter_num *it, int *arr, __u32 n)
677 while ((t = bpf_iter_num_next(it))) {
692 struct bpf_iter_num it;
699 bpf_iter_num_new(&it, 0, n);
700 fill(&it, arr1, n, 2);
701 bpf_iter_num_destroy(&it);
705 bpf_iter_num_new(&it, 0, n);
706 fill(&it, arr2, n, 10);
707 bpf_iter_num_destroy(&it);
711 bpf_iter_num_new(&it, 0, n);
712 sum1 = sum(&it, arr1, n);
713 bpf_iter_num_destroy(&it);
717 bpf_iter_num_new(&it, 0, n);
718 sum2 = sum(&it, arr2, n);
719 bpf_iter_num_destroy(&it);