| /linux-6.1.9/tools/testing/selftests/bpf/progs/ |
| D | map_ptr_kern.c | 8 #define MAX_ENTRIES 8 macro
9 #define HALF_ENTRIES (MAX_ENTRIES >> 1)
11 _Static_assert(MAX_ENTRIES < LOOP_BOUND, "MAX_ENTRIES must be < LOOP_BOUND");
75 MAX_ENTRIES)); in check_default()
83 MAX_ENTRIES)); in check_default_noinline()
101 __uint(max_entries, MAX_ENTRIES);
114 VERIFY(hash->n_buckets == MAX_ENTRIES); in check_hash()
137 __uint(max_entries, MAX_ENTRIES);
161 VERIFY(n_lookups == MAX_ENTRIES); in check_array()
162 VERIFY(n_keys == MAX_ENTRIES); in check_array()
[all …]
|
| D | bpf_hashmap_full_update_bench.c | 10 #define MAX_ENTRIES 1000 macro
16 __uint(max_entries, MAX_ENTRIES);
34 u32 key = cpu + MAX_ENTRIES; in benchmark()
|
| /linux-6.1.9/samples/bpf/ |
| D | lathist_kern.c | 13 #define MAX_ENTRIES 20 macro
68 __uint(max_entries, MAX_CPU * MAX_ENTRIES);
86 if (delta > MAX_ENTRIES - 1) in bpf_prog2()
87 delta = MAX_ENTRIES - 1; in bpf_prog2()
89 key = cpu * MAX_ENTRIES + delta; in bpf_prog2()
|
| D | lathist_user.c | 12 #define MAX_ENTRIES 20 macro
17 long data[MAX_ENTRIES];
52 for (i = 1; i <= MAX_ENTRIES; i++) { in print_hist()
70 for (i = 0; i < MAX_ENTRIES; i++) { in get_data()
71 key = c * MAX_ENTRIES + i; in get_data()
|
| D | map_perf_test_kern.c | 16 #define MAX_ENTRIES 1000 macro
23 __uint(max_entries, MAX_ENTRIES);
45 __uint(max_entries, MAX_ENTRIES);
64 __uint(max_entries, MAX_ENTRIES);
71 __uint(max_entries, MAX_ENTRIES);
79 __uint(max_entries, MAX_ENTRIES);
95 __uint(max_entries, MAX_ENTRIES);
102 __uint(max_entries, MAX_ENTRIES);
|
| D | offwaketime_kern.c | 23 #define MAX_ENTRIES 10000 macro
36 __uint(max_entries, MAX_ENTRIES);
43 __uint(max_entries, MAX_ENTRIES);
55 __uint(max_entries, MAX_ENTRIES);
62 __uint(max_entries, MAX_ENTRIES);
|
| D | tracex5_user.c | 14 #define MAX_ENTRIES 6000 /* MIPS n64 syscalls start at 5000 */ macro
16 #define MAX_ENTRIES 1024 macro
|
| /linux-6.1.9/tools/testing/selftests/bpf/prog_tests/ |
| D | lookup_and_delete.c | 8 #define MAX_ENTRIES 2 macro
18 for (key = 1; key < MAX_ENTRIES + 1; key++) { in fill_values()
35 for (key = 1; key < MAX_ENTRIES + 1; key++) { in fill_values_percpu()
58 err = bpf_map__set_max_entries(skel->maps.hash_map, MAX_ENTRIES); in setup_prog()
|
| /linux-6.1.9/tools/perf/util/bpf_skel/ |
| D | lock_contention.bpf.c | 12 #define MAX_ENTRIES 10240 macro
38 __uint(max_entries, MAX_ENTRIES);
54 __uint(max_entries, MAX_ENTRIES);
|
| D | off_cpu.bpf.c | 19 #define MAX_ENTRIES 102400 macro
39 __uint(max_entries, MAX_ENTRIES);
53 __uint(max_entries, MAX_ENTRIES);
|
| /linux-6.1.9/tools/testing/selftests/bpf/verifier/ |
| D | array_access.c | 49 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 3),
73 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
96 BPF_ST_MEM(BPF_DW, BPF_REG_0, (MAX_ENTRIES + 1) << 2,
113 BPF_MOV64_IMM(BPF_REG_1, MAX_ENTRIES + 1),
154 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
179 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES + 1),
|
| D | value.c | 63 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 9),
|
| D | value_or_null.c | 139 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES-1, 1),
|
| D | search_pruning.c | 68 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
|
| /linux-6.1.9/tools/bpf/bpftool/Documentation/ |
| D | bpftool-map.rst | 30 | **entries** *MAX_ENTRIES* **name** *NAME* [**flags** *FLAGS*] [**inner_map** *MAP*] \
76 …*type** *TYPE* **key** *KEY_SIZE* **value** *VALUE_SIZE* **entries** *MAX_ENTRIES* **name** *NAME…
|
| /linux-6.1.9/lib/ |
| D | test_rhashtable.c | 26 #define MAX_ENTRIES 1000000 macro
694 entries = min(parm_entries, MAX_ENTRIES); in test_rht_init()
|
| /linux-6.1.9/tools/testing/selftests/bpf/ |
| D | test_verifier.c | 180 #define MAX_ENTRIES 11 macro
184 int foo[MAX_ENTRIES];
|