| /linux-master/tools/testing/selftests/bpf/prog_tests/ |
| H A D | verifier.c | 88 #define MAX_ENTRIES 11 macro
92 int foo[MAX_ENTRIES];
|
| /linux-master/tools/perf/util/bpf_skel/ |
| H A D | lock_contention.bpf.c | 27 __uint(max_entries, MAX_ENTRIES);
35 __uint(max_entries, MAX_ENTRIES);
51 __uint(max_entries, MAX_ENTRIES);
58 __uint(max_entries, MAX_ENTRIES);
65 __uint(max_entries, MAX_ENTRIES);
|
| H A D | lock_data.h | 26 #define MAX_ENTRIES 16384 macro
|
| H A D | kwork_top.bpf.c | 20 #define MAX_ENTRIES 102400 macro
61 __uint(max_entries, MAX_ENTRIES);
68 __uint(max_entries, MAX_ENTRIES);
75 __uint(max_entries, MAX_ENTRIES);
|
| /linux-master/tools/testing/selftests/bpf/ |
| H A D | test_verifier.c | 178 #define MAX_ENTRIES 11 macro
182 int foo[MAX_ENTRIES];
|
| /linux-master/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));
83 MAX_ENTRIES));
101 __uint(max_entries, MAX_ENTRIES);
116 VERIFY(hash->n_buckets == MAX_ENTRIES);
142 __uint(max_entries, MAX_ENTRIES);
166 VERIFY(n_lookups == MAX_ENTRIES);
[all...] |
| H A D | verifier_value_illegal_alu.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];
|
| H A D | verifier_helper_value_access.c | 20 #define MAX_ENTRIES 11 macro
24 int foo[MAX_ENTRIES];
|
| H A D | verifier_value_ptr_arith.c | 9 #define MAX_ENTRIES 11 macro
13 int foo[MAX_ENTRIES];
|
| H A D | verifier_value.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
123 __imm_const(max_entries, MAX_ENTRIES)
|
| H A D | verifier_value_adj_spill.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| 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),
|
| H A D | verifier_regalloc.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_search_pruning.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
123 __imm_const(max_entries, MAX_ENTRIES),
|
| H A D | verifier_ref_tracking.c | 44 #define MAX_ENTRIES 11 macro
48 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_map_ptr.c | 8 #define MAX_ENTRIES 11 macro
12 int foo[MAX_ENTRIES];
|
| H A D | verifier_helper_access_var_len.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];
|
| /linux-master/tools/perf/ |
| H A D | builtin-lock.c | 66 static unsigned long bpf_map_entries = MAX_ENTRIES;
|
| /linux-master/tools/testing/selftests/bpf/map_tests/ |
| H A D | map_percpu_stats.c | 16 #define MAX_ENTRIES 16384 macro
64 static __u8 values[(8 << 10) * MAX_ENTRIES];
96 keys = calloc(MAX_MAP_KEY_SIZE, MAX_ENTRIES);
346 max_entries = MAX_ENTRIES;
|
| /linux-master/lib/ |
| H A D | test_rhashtable.c | 27 #define MAX_ENTRIES 1000000 macro
693 entries = min(parm_entries, MAX_ENTRIES);
|
| /linux-master/samples/bpf/ |
| H A D | tracex5_user.c | 14 #define MAX_ENTRIES 6000 /* MIPS n64 syscalls start at 5000 */ macro
16 #define MAX_ENTRIES 1024 macro
|
| 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);
|