/linux-6.6.21/tools/testing/selftests/bpf/progs/ |
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() 167 VERIFY(n_keys == MAX_ENTRIES); in check_array() [all …]
|
D | verifier_array_access.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES]; 113 __imm_const(max_entries, MAX_ENTRIES), in __flag() 146 __imm_const(max_entries, MAX_ENTRIES), in __flag() 171 __imm_const(__imm_0, (MAX_ENTRIES + 1) << 2), in an_array_with_a_constant_2() 200 __imm_const(__imm_0, MAX_ENTRIES + 1), in __flag() 261 __imm_const(max_entries, MAX_ENTRIES), in __flag() 293 __imm_const(__imm_0, MAX_ENTRIES + 1), in __flag()
|
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()
|
D | verifier_value.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES]; 123 __imm_const(max_entries, MAX_ENTRIES) in __flag()
|
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()
|
D | verifier_search_pruning.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES]; 123 __imm_const(max_entries, MAX_ENTRIES), in __flag()
|
D | verifier_value_adj_spill.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_and.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_bpf_get_stack.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_value_illegal_alu.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_map_ptr.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_regalloc.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_map_ptr_mixing.c | 8 #define MAX_ENTRIES 11 macro 12 int foo[MAX_ENTRIES];
|
D | verifier_stack_ptr.c | 9 #define MAX_ENTRIES 11 macro 13 int foo[MAX_ENTRIES];
|
/linux-6.6.21/samples/bpf/ |
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()
|
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()
|
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);
|
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);
|
D | tracex5_user.c | 14 #define MAX_ENTRIES 6000 /* MIPS n64 syscalls start at 5000 */ macro 16 #define MAX_ENTRIES 1024 macro
|
/linux-6.6.21/tools/testing/selftests/bpf/prog_tests/ |
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()
|
D | verifier.c | 81 #define MAX_ENTRIES 11 macro 85 int foo[MAX_ENTRIES];
|
/linux-6.6.21/tools/perf/util/bpf_skel/ |
D | lock_contention.bpf.c | 34 __uint(max_entries, MAX_ENTRIES); 42 __uint(max_entries, MAX_ENTRIES); 50 __uint(max_entries, MAX_ENTRIES); 57 __uint(max_entries, MAX_ENTRIES); 64 __uint(max_entries, MAX_ENTRIES);
|
D | off_cpu.bpf.c | 19 #define MAX_ENTRIES 102400 macro 39 __uint(max_entries, MAX_ENTRIES); 53 __uint(max_entries, MAX_ENTRIES);
|
D | lock_data.h | 19 #define MAX_ENTRIES 16384 macro
|
/linux-6.6.21/tools/testing/selftests/bpf/map_tests/ |
D | map_percpu_stats.c | 16 #define MAX_ENTRIES 16384 macro 64 static __u8 values[(8 << 10) * MAX_ENTRIES]; in delete_and_lookup_batch() 96 keys = calloc(MAX_MAP_KEY_SIZE, MAX_ENTRIES); in delete_all_elements() 313 max_entries = MAX_ENTRIES; in map_create_opts()
|