| /linux/tools/testing/selftests/bpf/progs/ |
| H A 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);
116 VERIFY(hash->n_buckets == MAX_ENTRIES); in check_hash()
142 __uint(max_entries, MAX_ENTRIES);
166 VERIFY(n_lookups == MAX_ENTRIES); in check_array()
[all...] |
| H A D | free_timer.c | 8 #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()
|
| H A 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()
|
| H A D | verifier_value.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
123 __imm_const(max_entries, MAX_ENTRIES) in __flag()
|
| H A D | verifier_array_access.c | 8 #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()
|
| H A D | verifier_value_or_null.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
209 __imm_const(__imm_0, MAX_ENTRIES-1), in __flag()
|
| H A D | verifier_search_pruning.c | 9 #define MAX_ENTRIES 11 macro
13 int foo[MAX_ENTRIES];
124 __imm_const(max_entries, MAX_ENTRIES), in __flag()
|
| H A D | verifier_value_adj_spill.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_bpf_get_stack.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_and.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_value_illegal_alu.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_map_ptr.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_regalloc.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_map_ptr_mixing.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_stack_ptr.c | 9 #define MAX_ENTRIES 11 macro
13 int foo[MAX_ENTRIES];
|
| /linux/samples/bpf/ |
| H A 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()
|
| H A 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()
|
| H A D | map_perf_test.bpf.c | 14 #define MAX_ENTRIES 1000 macro
21 __uint(max_entries, MAX_ENTRIES);
43 __uint(max_entries, MAX_ENTRIES);
62 __uint(max_entries, MAX_ENTRIES);
69 __uint(max_entries, MAX_ENTRIES);
77 __uint(max_entries, MAX_ENTRIES);
93 __uint(max_entries, MAX_ENTRIES);
100 __uint(max_entries, MAX_ENTRIES);
|
| H A D | offwaketime.bpf.c | 18 #define MAX_ENTRIES 10000 macro
31 __uint(max_entries, MAX_ENTRIES);
38 __uint(max_entries, MAX_ENTRIES);
50 __uint(max_entries, MAX_ENTRIES);
57 __uint(max_entries, MAX_ENTRIES);
|
| H A D | tracex5_user.c | 14 #define MAX_ENTRIES 6000 /* MIPS n64 syscalls start at 5000 */ macro
16 #define MAX_ENTRIES 1024 macro
|
| /linux/tools/perf/util/bpf_skel/ |
| H A D | syscall_summary.bpf.c | 20 #define MAX_ENTRIES (128 * 1024) macro
26 __uint(max_entries, MAX_ENTRIES);
33 __uint(max_entries, MAX_ENTRIES);
|
| H A D | kwork_top.bpf.c | 20 #define MAX_ENTRIES 102400 macro
63 __uint(max_entries, MAX_ENTRIES);
70 __uint(max_entries, MAX_ENTRIES);
77 __uint(max_entries, MAX_ENTRIES);
|
| H A D | bperf_follower.bpf.c | 8 #define MAX_ENTRIES 102400 macro
28 __uint(max_entries, MAX_ENTRIES);
|
| /linux/tools/testing/selftests/bpf/prog_tests/ |
| H A 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/tools/testing/selftests/bpf/map_tests/ |
| H A D | map_percpu_stats.c | 16 #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()
|