Home
last modified time | relevance | path

Searched refs:MAX_ENTRIES (Results 1 – 8 of 8) sorted by relevance

/tools/testing/selftests/bpf/progs/
Dmap_ptr_kern.c8 #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 …]
/tools/testing/selftests/bpf/prog_tests/
Dlookup_and_delete.c8 #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()
/tools/testing/selftests/bpf/verifier/
Darray_access.c49 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),
Dvalue.c63 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 9),
Dsearch_pruning.c68 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
Dvalue_or_null.c139 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES-1, 1),
/tools/bpf/bpftool/Documentation/
Dbpftool-map.rst27 | **entries** *MAX_ENTRIES* **name** *NAME* [**flags** *FLAGS*] [**inner_map** *MAP*] \
73 …*type** *TYPE* **key** *KEY_SIZE* **value** *VALUE_SIZE* **entries** *MAX_ENTRIES* **name** *NAME…
/tools/testing/selftests/bpf/
Dtest_verifier.c135 #define MAX_ENTRIES 11 macro
139 int foo[MAX_ENTRIES];