Home
last modified time | relevance | path

Searched refs:bpf_for (Results 1 – 4 of 4) sorted by relevance

/linux-6.6.21/tools/testing/selftests/bpf/progs/
Diters.c169 bpf_for(i, 5, 10) { in iter_bpf_for_macro()
377 bpf_for(i, 0, ARRAY_SIZE(arr)) { in iter_array_fill()
382 bpf_for(i, 0, ARRAY_SIZE(arr)) { in iter_array_fill()
403 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
404 bpf_for( col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
411 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
414 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
419 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
420 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
428 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
[all …]
Diters_num.c18 bpf_for(i, 0, 0) sum += i; in num_empty_zero()
32 bpf_for(i, INT_MIN, INT_MIN) sum += i; in num_empty_int_min()
46 bpf_for(i, INT_MAX, INT_MAX) sum += i; in num_empty_int_max()
60 bpf_for(i, -1, -1) sum += i; in num_empty_minus_one()
74 bpf_for(i, 0, 10) sum += i; in num_simple_sum()
88 bpf_for(i, -10, 0) sum += i; in num_neg_sum()
102 bpf_for(i, INT_MIN, INT_MIN + 2) sum += i; in num_very_neg_sum()
116 bpf_for(i, INT_MAX - 2, INT_MAX) sum += i; in num_very_big_sum()
130 bpf_for(i, -3, 3) sum += i; in num_neg_pos_sum()
Dpyperf.h310 bpf_for(i, 0, STACK_MAX_LEN) {
/linux-6.6.21/tools/lib/bpf/
Dbpf_helpers.h348 #ifndef bpf_for
362 #define bpf_for(i, start, end) for ( \ macro