Searched refs:bpf_for (Results 1 - 6 of 6) sorted by relevance

/linux-master/tools/testing/selftests/bpf/progs/
H A Diters_num.c18 bpf_for(i, 0, 0) sum += i;
32 bpf_for(i, INT_MIN, INT_MIN) sum += i;
46 bpf_for(i, INT_MAX, INT_MAX) sum += i;
60 bpf_for(i, -1, -1) sum += i;
74 bpf_for(i, 0, 10) sum += i;
88 bpf_for(i, -10, 0) sum += i;
102 bpf_for(i, INT_MIN, INT_MIN + 2) sum += i;
116 bpf_for(i, INT_MAX - 2, INT_MAX) sum += i;
130 bpf_for(i, -3, 3) sum += i;
H A Diters.c170 bpf_for(i, 5, 10) {
378 bpf_for(i, 0, ARRAY_SIZE(arr)) {
383 bpf_for(i, 0, ARRAY_SIZE(arr)) {
404 bpf_for(row, 0, ARRAY_SIZE(arr2d)) {
405 bpf_for( col, 0, ARRAY_SIZE(arr2d[0])) {
412 bpf_for(row, 0, ARRAY_SIZE(arr2d)) {
415 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) {
420 bpf_for(row, 0, ARRAY_SIZE(arr2d)) {
421 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) {
429 bpf_for(ro
[all...]
H A Dpercpu_alloc_array.c96 bpf_for(i, 0, nr_cpus) {
174 bpf_for(i, 0, nr_cpus) {
H A Dpercpu_alloc_cgrp_local_storage.c97 bpf_for(i, 0, nr_cpus) {
H A Dpyperf.h311 bpf_for(i, 0, STACK_MAX_LEN) {
/linux-master/tools/lib/bpf/
H A Dbpf_helpers.h332 * and bpf_for(i, N, M) is in that bpf_for() provides additional proof to
334 * *`, not just `int`. So for integers bpf_for() is more convenient.
356 #ifndef bpf_for
357 /* bpf_for(i, start, end) implements a for()-like looping construct that sets
364 * and whose values do not change throughout bpf_for() loop execution. They do
370 #define bpf_for(i, start, end) for ( \ macro
387 #endif /* bpf_for */

Completed in 178 milliseconds