Home
last modified time | relevance | path

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

12

/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);
142 __uint(max_entries, MAX_ENTRIES);
166 VERIFY(n_lookups == MAX_ENTRIES); in check_array()
167 VERIFY(n_keys == MAX_ENTRIES); in check_array()
174 __uint(max_entries, MAX_ENTRIES);
258 MAX_ENTRIES)); in check_stack_trace()
[all …]
A Dfree_timer.c8 #define MAX_ENTRIES 8 macro
18 __uint(max_entries, MAX_ENTRIES);
60 bpf_loop(MAX_ENTRIES, start_cb, NULL, 0); in BPF_PROG()
67 bpf_loop(MAX_ENTRIES, overwrite_cb, NULL, 0); in BPF_PROG()
A Dbpf_hashmap_full_update_bench.c10 #define MAX_ENTRIES 1000 macro
16 __uint(max_entries, MAX_ENTRIES);
34 u32 key = cpu + MAX_ENTRIES; in benchmark()
A Dverifier_value.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
123 __imm_const(max_entries, MAX_ENTRIES) in __flag()
A Dverifier_value_adj_spill.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_bpf_get_stack.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_value_or_null.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
209 __imm_const(__imm_0, MAX_ENTRIES-1), in __flag()
A Dverifier_and.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_array_access.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
127 __imm_const(max_entries, MAX_ENTRIES), in __flag()
160 __imm_const(max_entries, MAX_ENTRIES), in __flag()
185 __imm_const(__imm_0, (MAX_ENTRIES + 1) << 2), in an_array_with_a_constant_2()
214 __imm_const(__imm_0, MAX_ENTRIES + 1), in __flag()
275 __imm_const(max_entries, MAX_ENTRIES), in __flag()
307 __imm_const(__imm_0, MAX_ENTRIES + 1), in __flag()
A Dverifier_search_pruning.c9 #define MAX_ENTRIES 11 macro
13 int foo[MAX_ENTRIES];
124 __imm_const(max_entries, MAX_ENTRIES), in __flag()
A Dverifier_value_illegal_alu.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_map_ptr.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_regalloc.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_map_ptr_mixing.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
A Dverifier_stack_ptr.c9 #define MAX_ENTRIES 11 macro
13 int foo[MAX_ENTRIES];
A Dverifier_helper_access_var_len.c8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
/tools/perf/util/bpf_skel/
A Dsyscall_summary.bpf.c20 #define MAX_ENTRIES (128 * 1024) macro
26 __uint(max_entries, MAX_ENTRIES);
33 __uint(max_entries, MAX_ENTRIES);
A Dkwork_top.bpf.c20 #define MAX_ENTRIES 102400 macro
63 __uint(max_entries, MAX_ENTRIES);
70 __uint(max_entries, MAX_ENTRIES);
77 __uint(max_entries, MAX_ENTRIES);
A Dbperf_follower.bpf.c8 #define MAX_ENTRIES 102400 macro
28 __uint(max_entries, MAX_ENTRIES);
A Dlock_data.h33 #define MAX_ENTRIES 16384 macro
A Doff_cpu.bpf.c19 #define MAX_ENTRIES 102400 macro
48 __uint(max_entries, MAX_ENTRIES);
80 __uint(max_entries, MAX_ENTRIES);
A Dlock_contention.bpf.c33 __uint(max_entries, MAX_ENTRIES);
73 __uint(max_entries, MAX_ENTRIES);
89 __uint(max_entries, MAX_ENTRIES);
96 __uint(max_entries, MAX_ENTRIES);
103 __uint(max_entries, MAX_ENTRIES);
/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()
A Dverifier.c109 #define MAX_ENTRIES 11 macro
113 int foo[MAX_ENTRIES];
/tools/testing/selftests/bpf/map_tests/
A Dmap_percpu_stats.c16 #define MAX_ENTRIES 16384 macro
65 static __u8 values[(8 << 10) * MAX_ENTRIES]; in delete_and_lookup_batch()
97 keys = calloc(MAX_MAP_KEY_SIZE, MAX_ENTRIES); in delete_all_elements()
347 max_entries = MAX_ENTRIES; in map_create_opts()

Completed in 31 milliseconds

12