Lines Matching +full:8 +full:v
36 int *v, i = zero; /* obscure initial value of i */
41 while ((v = bpf_iter_num_next(&it))) {
98 int *v;
103 while ((v = bpf_iter_num_next(&it))) {
104 bpf_printk("ITER_BASIC: E1 VAL: v=%d", *v);
116 int *v;
121 while ((v = bpf_iter_num_next(&it))) {
122 bpf_printk("ITER_BASIC: E1 VAL: v=%d", *v);
134 int *v;
139 for (v = bpf_iter_num_next(&it); v; v = bpf_iter_num_next(&it)) {
140 bpf_printk("ITER_BASIC: E2 VAL: v=%d", *v);
151 int *v;
155 bpf_for_each(num, v, 5, 10) {
156 bpf_printk("ITER_BASIC: E2 VAL: v=%d", *v);
171 bpf_printk("ITER_BASIC: E2 VAL: v=%d", i);
182 int *v, i;
189 v = bpf_iter_num_next(&it);
190 bpf_printk("ITER_BASIC: E3 VAL: i=%d v=%d", i, v ? *v : -1);
202 int *v;
207 v = bpf_iter_num_next(&it);
208 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
209 v = bpf_iter_num_next(&it);
210 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
211 v = bpf_iter_num_next(&it);
212 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
213 v = bpf_iter_num_next(&it);
214 bpf_printk("ITER_BASIC: E4 VAL: v=%d\n", v ? *v : -1);
225 int *v, i;
230 while ((v = bpf_iter_num_next(&it))) {
231 bpf_printk("ITER_BASIC: E1 VAL: v=%d", *v);
236 for (v = bpf_iter_num_next(&it); v; v = bpf_iter_num_next(&it)) {
237 bpf_printk("ITER_BASIC: E2 VAL: v=%d", *v);
244 v = bpf_iter_num_next(&it);
245 bpf_printk("ITER_BASIC: E3 VAL: i=%d v=%d", i, v ? *v : -1);
250 v = bpf_iter_num_next(&it);
251 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
252 v = bpf_iter_num_next(&it);
253 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
254 v = bpf_iter_num_next(&it);
255 bpf_printk("ITER_BASIC: E4 VAL: v=%d", v ? *v : -1);
256 v = bpf_iter_num_next(&it);
257 bpf_printk("ITER_BASIC: E4 VAL: v=%d\n", v ? *v : -1);
268 int *v, i = 0, sum = 0;
273 while ((v = bpf_iter_num_next(&it))) {
274 bpf_printk("ITER_SIMPLE: i=%d v=%d", i, *v);
275 sum += *v;
293 int *v, sum = 0;
302 while ((v = bpf_iter_num_next(&it))) {
321 bpf_printk("ITER_OBFUSCATE_COUNTER: i=%d v=%d x=%d", i, *v, x);
337 int *v, *elem = NULL;
344 while ((v = bpf_iter_num_next(&it))) {
345 bpf_printk("ITER_SEARCH_LOOP: v=%d", *v);
347 if (*v == 2) {
349 elem = v;
743 * bpf_iter_num_new(&fp[-8], 0, 10)
744 * while (bpf_iter_num_next(&fp[-8])) {
750 * bpf_probe_read_user(r7, 8, 0xdeadbeef); // this is not safe
752 * bpf_iter_num_destroy(&fp[-8])
763 "r1 += -8;"
769 "r1 += -8;"
778 "r2 = 8;"
784 "r1 += -8;"
818 * bpf_iter_num_new(&fp[-8], 0, 10)
819 * while (bpf_iter_num_next(&fp[-8])) {
830 * bpf_iter_num_destroy(&fp[-8])
840 "r1 += -8;"
846 "r1 += -8;\n"
863 "r1 += -8;"
901 * i = iter_new(); // fp[-8]
943 "r1 += -8;"
951 "r1 += -8;"
972 "r1 += -8;"
981 "r1 += -8;"
1027 * i = iter_new(); // fp[-8]
1047 * i = iter_new(); // fp[-8]
1086 "r1 += -8;"
1094 "r1 += -8;"
1115 "r1 += -8;"
1124 "r1 += -8;"
1129 "r1 += -8;"
1137 "r1 += -8;"
1158 "r1 += -8;"
1188 * i = iter_new(); // fp[-8]
1196 * i = iter_new(); // fp[-8]
1229 "r1 += -8;"
1235 "r1 += -8;"
1239 "r1 += -8;"
1251 "r1 += -8;"
1258 "r1 += -8;"
1271 "r1 += -8;"
1305 * bpf_iter_num_new(&fp[-8], 0, 10)
1306 * while (bpf_iter_num_next(&fp[-8])) {
1315 * bpf_iter_num_destroy(&fp[-8])
1320 "r1 += -8;"
1326 "r1 += -8;"
1339 "r1 += -8;"
1361 * bpf_iter_num_new(&fp[-8], 0, 10)
1362 * while (bpf_iter_num_next(&fp[-8])) {
1367 * bpf_iter_num_destroy(&fp[-8])
1374 "r1 += -8;"
1380 "r1 += -8;"
1389 "r1 += -8;"
1450 "r1 += -8;"
1456 "r1 += -8;"
1517 "r1 += -8;"