Home
last modified time | relevance | path

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

/linux/tools/testing/selftests/bpf/progs/
H A Diters.c168 bpf_for(i, 5, 10) { in iter_bpf_for_macro()
376 bpf_for(i, 0, ARRAY_SIZE(arr)) { in iter_array_fill()
381 bpf_for(i, 0, ARRAY_SIZE(arr)) { in iter_array_fill()
402 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
403 bpf_for( col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
410 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
413 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
418 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
419 bpf_for(col, 0, ARRAY_SIZE(arr2d[0])) { in iter_nested_iters()
427 bpf_for(ro in iter_nested_iters()
[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 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 Ddmabuf_iter.c89 bpf_for(i, len, DMA_BUF_NAME_LEN) in iter_dmabuf_for_each()
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 Dbpf_qdisc_fifo.c93 bpf_for(i, 0, sch->q.qlen) { in BPF_PROG()
H A Dmem_rdonly_untrusted.c73 bpf_for(i, 0, 1000 * 1000 * 1000) { in offset_not_tracked()
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 Dbpf_qdisc_fq.c604 bpf_for(i, 0, sch->limit) { in BPF_PROG()
/linux/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/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()
653 bpf_for(cpu, 0, scx_bpf_nr_cpu_ids()) { in print_cpus()
717 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/tools/lib/bpf/
H A Dbpf_helpers.h371 * and bpf_for(i, N, M) is in that bpf_for() provides additional proof to
373 * *`, not just `int`. So for integers bpf_for() is more convenient.
395 #ifndef bpf_for
396 /* bpf_for(i, start, end) implements a for()-like looping construct that sets
403 * and whose values do not change throughout bpf_for() loop execution. They do
409 #define bpf_for(i, start, end) for ( \ macro
426 #endif /* bpf_for */
/linux/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()