Home
last modified time | relevance | path

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

/linux-6.15/tools/testing/selftests/bpf/progs/
H A Diters.c170 bpf_for(i, 5, 10) { in iter_bpf_for_macro()
378 bpf_for(i, 0, ARRAY_SIZE(arr)) { in iter_array_fill()
1545 bpf_for(i, 0, n) { in iter_arr_with_actual_elem_count()
1596 bpf_for(i, 0, upper) { in iter_subprog_check_stacksafe()
1640 bpf_for(i, 0, 10) in clean_live_states()
1641 bpf_for(j, 0, 10) in clean_live_states()
1642 bpf_for(k, 0, 10) in clean_live_states()
1643 bpf_for(l, 0, 10) in clean_live_states()
1644 bpf_for(m, 0, 10) in clean_live_states()
1645 bpf_for(n, 0, 10) in clean_live_states()
[all …]
H A 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()
H A Ddynptr_success.c574 bpf_for(i, 0, size) { in bpf_memcmp()
622 bpf_for(i, 0, chunks) { in test_dynptr_copy_xdp()
632 bpf_for(i, 0, chunks) { in test_dynptr_copy_xdp()
643 bpf_for(i, 0, chunks) { in test_dynptr_copy_xdp()
653 bpf_for(i, 0, chunks) { in test_dynptr_copy_xdp()
667 bpf_for(i, 0, chunks - 1) { in test_dynptr_copy_xdp()
H A Dpercpu_alloc_array.c96 bpf_for(i, 0, nr_cpus) { in BPF_PROG()
174 bpf_for(i, 0, nr_cpus) { in BPF_PROG()
H A Dfree_timer.c26 bpf_for(i, 0, 1024 * 1024) sum += i; in timer_cb()
H A Dpercpu_alloc_cgrp_local_storage.c97 bpf_for(i, 0, nr_cpus) { in BPF_PROG()
H A Dtest_usdt.c103 bpf_for(i, 0, 12) { in BPF_USDT()
H A Dverifier_spin_lock.c548 bpf_for(i, 0, 10) { in bpf_loop_inside_locked_region()
H A Dpyperf.h311 bpf_for(i, 0, STACK_MAX_LEN) {
H A Dcpumask_success.c874 bpf_for(i, 0, nr_cpus) { in BPF_PROG()
/linux-6.15/tools/testing/selftests/sched_ext/
H A Dcreate_dsq.bpf.c37 bpf_for(i, 0, 1024) { in BPF_STRUCT_OPS_SLEEPABLE()
45 bpf_for(i, 0, 1024) { in BPF_STRUCT_OPS_SLEEPABLE()
H A Dnuma.bpf.c78 bpf_for(node, 0, __COMPAT_scx_bpf_nr_node_ids()) { in BPF_STRUCT_OPS_SLEEPABLE()
/linux-6.15/tools/sched_ext/
H A Dscx_central.bpf.c188 bpf_for(cpu, 0, nr_cpu_ids) { in BPF_STRUCT_OPS()
267 bpf_for(i, 0, nr_cpu_ids) { in central_timerfn()
H A Dscx_qmap.bpf.c574 bpf_for(i, 0, 5) { in BPF_STRUCT_OPS()
633 bpf_for(cpu, 0, scx_bpf_nr_cpu_ids()) { in print_cpus()
697 bpf_for(i, 0, nr_cpu_ids) { in monitor_cpuperf()
H A Dscx_flatcg.bpf.c207 bpf_for(level, 0, cgrp->level + 1) { in cgrp_refresh_hweight()
454 bpf_for(idx, 0, cgrp->level) { in update_active_weight_sums()
/linux-6.15/tools/lib/bpf/
H A Dbpf_helpers.h370 #ifndef bpf_for
384 #define bpf_for(i, start, end) for ( \ macro
/linux-6.15/drivers/hid/bpf/progs/
H A Dhid_bpf_async.h111 bpf_for(i, 0, HID_BPF_ASYNC_MAX_CTX) { in hid_bpf_async_find_empty_key()