Home
last modified time | relevance | path

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

/linux/tools/testing/selftests/bpf/progs/
A Dmap_ptr_kern.c8 #define MAX_ENTRIES 8 macro
9 #define HALF_ENTRIES (MAX_ENTRIES >> 1)
75 MAX_ENTRIES)); in check_default()
83 MAX_ENTRIES)); in check_default_noinline()
101 __uint(max_entries, MAX_ENTRIES);
137 __uint(max_entries, MAX_ENTRIES);
161 VERIFY(n_lookups == MAX_ENTRIES); in check_array()
162 VERIFY(n_keys == MAX_ENTRIES); in check_array()
169 __uint(max_entries, MAX_ENTRIES);
253 MAX_ENTRIES)); in check_stack_trace()
[all …]
/linux/samples/bpf/
A Dlathist_kern.c13 #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()
A Dmap_perf_test_kern.c16 #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);
A Dlathist_user.c12 #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()
A Doffwaketime_kern.c23 #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);
A Dtracex5_user.c14 #define MAX_ENTRIES 6000 /* MIPS n64 syscalls start at 5000 */ macro
16 #define MAX_ENTRIES 1024 macro
/linux/tools/testing/selftests/bpf/prog_tests/
A 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()
/linux/tools/testing/selftests/bpf/verifier/
A 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),
A Dvalue.c63 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 9),
A Dvalue_or_null.c139 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES-1, 1),
A Dsearch_pruning.c68 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
/linux/tools/bpf/bpftool/Documentation/
A 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…
/linux/lib/
A Dtest_rhashtable.c26 #define MAX_ENTRIES 1000000 macro
708 entries = min(parm_entries, MAX_ENTRIES); in test_rht_init()
/linux/tools/testing/selftests/bpf/
A Dtest_verifier.c133 #define MAX_ENTRIES 11 macro
137 int foo[MAX_ENTRIES];

Completed in 25 milliseconds