/linux-master/kernel/bpf/ |
H A D | arraymap.c | 26 for (i = 0; i < array->map.max_entries; i++) { 37 for (i = 0; i < array->map.max_entries; i++) { 58 if (attr->max_entries == 0 || attr->key_size != 4 || 84 u32 elem_size, index_mask, max_entries; local 91 max_entries = attr->max_entries; 93 /* On 32 bit archs roundup_pow_of_two() with max_entries that has 97 mask64 = fls_long(max_entries - 1); 106 max_entries = index_mask + 1; 108 if (max_entries < att [all...] |
H A D | reuseport_array.c | 55 if (unlikely(index >= array->map.max_entries)) 69 if (index >= map->max_entries) 126 for (i = 0; i < map->max_entries; i++) { 155 array = bpf_map_area_alloc(struct_size(array, ptrs, attr->max_entries), numa_node); 246 if (index >= map->max_entries) 323 if (index >= array->map.max_entries) { 328 if (index == array->map.max_entries - 1) 339 return struct_size(array, ptrs, map->max_entries);
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | test_skmsg_load_helpers.c | 8 __uint(max_entries, 2); 15 __uint(max_entries, 2);
|
H A D | timer_mim_reject.c | 17 __uint(max_entries, 1024); 28 __uint(max_entries, 2);
|
H A D | for_each_array_map_elem.c | 10 __uint(max_entries, 3); 17 __uint(max_entries, 1);
|
H A D | test_queue_stack_map.h | 13 __uint(max_entries, 32); 21 __uint(max_entries, 32);
|
H A D | test_helper_restricted.c | 16 __uint(max_entries, 1); 23 __uint(max_entries, 1);
|
H A D | tailcall_bpf2bpf4.c | 7 __uint(max_entries, 1); 14 __uint(max_entries, 3);
|
H A D | bpf_iter_bpf_array_map.c | 17 __uint(max_entries, 3); 24 __uint(max_entries, 10);
|
H A D | test_kfunc_dynptr_param.c | 23 __uint(max_entries, 4096); 28 __uint(max_entries, 1);
|
H A D | test_map_lock.c | 16 __uint(max_entries, 1); 28 __uint(max_entries, 1);
|
H A D | test_log_fixup.c | 40 __uint(max_entries, 1); 47 __uint(max_entries, 1);
|
H A D | verifier_map_ptr.c | 17 __uint(max_entries, 1); 29 __uint(max_entries, 1);
|
H A D | verifier_value.c | 17 __uint(max_entries, 1); 109 if r1 >= %[max_entries] goto l0_%=; \ 123 __imm_const(max_entries, MAX_ENTRIES)
|
H A D | linked_list.h | 32 __uint(max_entries, 1); 40 __uint(max_entries, 1);
|
H A D | map_in_map_btf.c | 24 __uint(max_entries, 1); 31 __uint(max_entries, 1);
|
H A D | test_select_reuseport_kern.c | 24 __uint(max_entries, 1); 31 __uint(max_entries, NR_RESULTS); 38 __uint(max_entries, 1); 45 __uint(max_entries, 1); 52 __uint(max_entries, 1);
|
H A D | syscall.c | 21 int max_entries; member in struct:args 40 __uint(max_entries, 1); 47 __uint(max_entries, 1); 54 __uint(max_entries, 1); 131 map_create_attr.max_entries = ctx->max_entries; 181 attr->max_entries = 1;
|
/linux-master/arch/openrisc/kernel/ |
H A D | stacktrace.c | 38 if (trace->nr_entries < trace->max_entries) 64 if (trace->nr_entries < trace->max_entries)
|
/linux-master/arch/sh/kernel/ |
H A D | stacktrace.c | 33 if (trace->nr_entries < trace->max_entries) 65 if (trace->nr_entries < trace->max_entries)
|
/linux-master/tools/perf/util/bpf_skel/ |
H A D | bperf_follower.bpf.c | 12 __uint(max_entries, 1); 19 __uint(max_entries, 1);
|
H A D | bperf_leader.bpf.c | 18 __uint(max_entries, 1); 25 __uint(max_entries, 1);
|
/linux-master/samples/bpf/ |
H A D | syscall_tp_kern.c | 36 __uint(max_entries, 1); 43 __uint(max_entries, 1);
|
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | syscall.c | 9 int max_entries; member in struct:args 19 .max_entries = 1024,
|
/linux-master/fs/ext4/ |
H A D | migrate.c | 96 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; local 103 for (i = 0; i < max_entries; i++) { 125 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; local 132 for (i = 0; i < max_entries; i++) { 140 lb->curr_block += max_entries; 155 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; local 162 for (i = 0; i < max_entries; i++) { 170 lb->curr_block += max_entries * max_entries; 185 unsigned long max_entries local 225 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; local 417 unsigned long max_entries; local [all...] |