Home
last modified time | relevance | path

Searched refs:max_entries (Results 1 – 25 of 296) sorted by relevance

12345678910>>...12

/linux/tools/testing/selftests/bpf/map_tests/
A Dhtab_map_batch_ops.c27 for (i = 0; i < max_entries; i++) { in map_batch_update()
51 for (i = 0; i < max_entries; i++) { in map_batch_verify()
70 for (i = 0; i < max_entries; i++) { in map_batch_verify()
81 const __u32 max_entries = 10; in __test_map_lookup_and_delete_batch() local
82 value pcpu_values[max_entries]; in __test_map_lookup_and_delete_batch()
98 xattr.max_entries = max_entries; in __test_map_lookup_and_delete_batch()
114 count = max_entries; in __test_map_lookup_and_delete_batch()
132 count = max_entries; in __test_map_lookup_and_delete_batch()
191 while (total < max_entries) { in __test_map_lookup_and_delete_batch()
192 if (max_entries - total < step) in __test_map_lookup_and_delete_batch()
[all …]
A Dlpm_trie_map_batch_ops.c32 for (i = 0; i < max_entries; i++) { in map_batch_update()
51 for (i = 0; i < max_entries; i++) { in map_batch_verify()
59 for (i = 0; i < max_entries; i++) { in map_batch_verify()
77 const __u32 max_entries = 10; in test_lpm_trie_map_batch_ops() local
85 xattr.max_entries = max_entries; in test_lpm_trie_map_batch_ops()
91 values = malloc(max_entries * sizeof(int)); in test_lpm_trie_map_batch_ops()
92 visited = malloc(max_entries * sizeof(int)); in test_lpm_trie_map_batch_ops()
97 for (step = 1; step < max_entries; step++) { in test_lpm_trie_map_batch_ops()
128 while (total < max_entries) { in test_lpm_trie_map_batch_ops()
129 if (max_entries - total < step) in test_lpm_trie_map_batch_ops()
[all …]
A Darray_map_batch_ops.c24 for (i = 0; i < max_entries; i++) { in map_batch_update()
46 for (i = 0; i < max_entries; i++) { in map_batch_verify()
63 for (i = 0; i < max_entries; i++) { in map_batch_verify()
80 const __u32 max_entries = 10; in __test_map_lookup_and_update_batch() local
89 xattr.max_entries = max_entries; in __test_map_lookup_and_update_batch()
98 keys = calloc(max_entries, sizeof(*keys)); in __test_map_lookup_and_update_batch()
99 values = calloc(max_entries, value_size); in __test_map_lookup_and_update_batch()
100 visited = calloc(max_entries, sizeof(*visited)); in __test_map_lookup_and_update_batch()
106 for (step = 1; step < max_entries; step++) { in __test_map_lookup_and_update_batch()
109 memset(keys, 0, max_entries * sizeof(*keys)); in __test_map_lookup_and_update_batch()
[all …]
/linux/tools/testing/selftests/bpf/progs/
A Dmap_ptr_kern.c34 __u32 max_entries; member
44 VERIFY(map->max_entries == max_entries); in check_bpf_map_fields()
56 VERIFY(indirect->max_entries == direct->max_entries); in check_bpf_map_ptr()
67 max_entries)); in check()
101 __uint(max_entries, MAX_ENTRIES);
137 __uint(max_entries, MAX_ENTRIES);
169 __uint(max_entries, MAX_ENTRIES);
186 __uint(max_entries, MAX_ENTRIES);
203 __uint(max_entries, MAX_ENTRIES);
339 __uint(max_entries, 1);
[all …]
A Dtest_btf_map_in_map.c8 __uint(max_entries, 1);
16 __uint(max_entries, 2);
23 __uint(max_entries, 3);
31 __uint(max_entries, 1);
47 __uint(max_entries, 3);
56 __uint(max_entries, 5);
63 __uint(max_entries, 3);
83 __uint(max_entries, 5);
99 __uint(max_entries, 1);
106 __uint(max_entries, 2);
[all …]
A Dlsm.c14 __uint(max_entries, 1);
21 __uint(max_entries, 1);
28 __uint(max_entries, 1);
35 __uint(max_entries, 1);
42 __uint(max_entries, 1);
49 __uint(max_entries, 1);
56 __uint(max_entries, 1);
63 __uint(max_entries, 1);
73 __uint(max_entries, 1);
A Dsockmap_verdict_prog.c7 __uint(max_entries, 20);
14 __uint(max_entries, 20);
21 __uint(max_entries, 20);
28 __uint(max_entries, 20);
A Dtest_stacktrace_build_id.c13 __uint(max_entries, 1);
20 __uint(max_entries, 16384);
29 __uint(max_entries, 128);
37 __uint(max_entries, 128);
A Dtest_stacktrace_map.c13 __uint(max_entries, 1);
20 __uint(max_entries, 16384);
29 __uint(max_entries, 16384);
36 __uint(max_entries, 16384);
A Dtest_sockmap_kern.h33 __uint(max_entries, 20);
40 __uint(max_entries, 20);
47 __uint(max_entries, 20);
54 __uint(max_entries, 1);
61 __uint(max_entries, 1);
68 __uint(max_entries, 6);
75 __uint(max_entries, 1);
82 __uint(max_entries, 3);
89 __uint(max_entries, 20);
A Dtest_pinning.c8 __uint(max_entries, 1);
16 __uint(max_entries, 1);
23 __uint(max_entries, 1);
A Dtest_select_reuseport_kern.c24 __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);
/linux/drivers/md/persistent-data/
A Ddm-array.c25 __le32 max_entries; member
151 uint32_t max_entries, in alloc_ablock() argument
161 (*ab)->max_entries = cpu_to_le32(max_entries); in alloc_ablock()
348 uint32_t max_entries, in insert_new_ablock() argument
405 unsigned max_entries; member
521 resize->max_entries, in grow_add_tail_block()
759 size -= max_entries; in dm_array_new()
779 unsigned entry, max_entries; in dm_array_get_value() local
788 entry = index % max_entries; in dm_array_get_value()
807 unsigned max_entries; in array_set_value() local
[all …]
A Ddm-btree-remove.c177 uint32_t max_entries = le32_to_cpu(left->header.max_entries); in shift() local
180 BUG_ON(max_entries != r_max_entries); in shift()
181 BUG_ON(nr_left - count > max_entries); in shift()
182 BUG_ON(nr_right + count > max_entries); in shift()
274 uint32_t max_entries = le32_to_cpu(left->header.max_entries); in delete_center_node() local
277 BUG_ON(nr_left + shift > max_entries); in delete_center_node()
306 uint32_t max_entries = le32_to_cpu(left->header.max_entries); in redistribute3() local
312 BUG_ON(target_left > max_entries); in redistribute3()
313 BUG_ON(target_right > max_entries); in redistribute3()
360 BUG_ON(left->header.max_entries != center->header.max_entries); in __rebalance3()
[all …]
/linux/tools/testing/selftests/bpf/prog_tests/
A Dbtf.c75 __u32 max_entries; member
143 .max_entries = 4,
198 .max_entries = 4,
223 .max_entries = 4,
264 .max_entries = 4,
309 .max_entries = 1,
331 .max_entries = 1,
353 .max_entries = 1,
375 .max_entries = 1,
4109 create_attr.max_entries = test->max_entries; in do_test_raw()
[all …]
A Dfor_each.c12 int i, err, hashmap_fd, max_entries, percpu_map_fd; in test_hash_map() local
23 max_entries = bpf_map__max_entries(skel->maps.hashmap); in test_hash_map()
24 for (i = 0; i < max_entries; i++) { in test_hash_map()
53 ASSERT_EQ(skel->bss->hashmap_elems, max_entries, "hashmap_elems"); in test_hash_map()
72 __u32 key, num_cpus, max_entries, retval; in test_array_map() local
84 max_entries = bpf_map__max_entries(skel->maps.arraymap); in test_array_map()
85 for (i = 0; i < max_entries; i++) { in test_array_map()
89 if (i != max_entries - 1) in test_array_map()
A Dtailcalls.c40 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
56 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
72 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
93 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
94 j = bpf_map__def(prog_array)->max_entries - 1 - i; in test_tailcall_1()
110 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
111 j = bpf_map__def(prog_array)->max_entries - 1 - i; in test_tailcall_1()
128 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_1()
178 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_2()
356 for (i = 0; i < bpf_map__def(prog_array)->max_entries; i++) { in test_tailcall_4()
[all …]
/linux/kernel/bpf/
A Darraymap.c85 u32 elem_size, index_mask, max_entries; in array_map_alloc() local
92 max_entries = attr->max_entries; in array_map_alloc()
98 mask64 = fls_long(max_entries - 1); in array_map_alloc()
107 max_entries = index_mask + 1; in array_map_alloc()
109 if (max_entries < attr->max_entries) in array_map_alloc()
175 if (map->max_entries != 1) in array_map_direct_value_addr()
191 if (map->max_entries != 1) in array_map_direct_value_meta()
465 map->max_entries != 1) in array_map_check_btf()
509 meta0->max_entries == meta1->max_entries; in array_map_meta_equal()
525 if (info->index >= map->max_entries) in bpf_array_map_seq_start()
[all …]
A Dreuseport_array.c57 if (unlikely(index >= array->map.max_entries)) in reuseport_array_lookup_elem()
71 if (index >= map->max_entries) in reuseport_array_delete_elem()
128 for (i = 0; i < map->max_entries; i++) { in reuseport_array_free()
161 array_size += (u64)attr->max_entries * sizeof(struct sock *); in reuseport_array_alloc()
255 if (index >= map->max_entries) in bpf_fd_reuseport_array_update_elem()
332 if (index >= array->map.max_entries) { in reuseport_array_get_next_key()
337 if (index == array->map.max_entries - 1) in reuseport_array_get_next_key()
/linux/samples/bpf/
A Dmap_perf_test_kern.c23 __uint(max_entries, MAX_ENTRIES);
30 __uint(max_entries, 10000);
37 __uint(max_entries, 10000);
45 __uint(max_entries, MAX_ENTRIES);
52 __uint(max_entries, MAX_NR_CPUS);
64 __uint(max_entries, MAX_ENTRIES);
71 __uint(max_entries, MAX_ENTRIES);
79 __uint(max_entries, MAX_ENTRIES);
87 __uint(max_entries, 10000);
95 __uint(max_entries, MAX_ENTRIES);
[all …]
A Dtest_map_in_map_kern.c25 __uint(max_entries, MAX_NR_PORTS);
33 __uint(max_entries, 1);
41 __uint(max_entries, 1);
49 __uint(max_entries, 1);
55 __uint(max_entries, MAX_NR_PORTS);
63 __uint(max_entries, 1);
71 __uint(max_entries, 1);
/linux/tools/lib/perf/
A Dcpumap.c109 int max_entries = 0; in perf_cpu_map__read() local
125 if (new_max >= max_entries) { in perf_cpu_map__read()
126 max_entries = new_max + MAX_NR_CPUS / 2; in perf_cpu_map__read()
127 tmp = realloc(tmp_cpus, max_entries * sizeof(int)); in perf_cpu_map__read()
136 if (nr_cpus == max_entries) { in perf_cpu_map__read()
137 max_entries += MAX_NR_CPUS; in perf_cpu_map__read()
138 tmp = realloc(tmp_cpus, max_entries * sizeof(int)); in perf_cpu_map__read()
183 int max_entries = 0; in perf_cpu_map__new() local
226 if (nr_cpus == max_entries) { in perf_cpu_map__new()
227 max_entries += MAX_NR_CPUS; in perf_cpu_map__new()
[all …]
/linux/fs/ext4/
A Dmigrate.c104 for (i = 0; i < max_entries; i++) { in update_ind_extent_range()
133 for (i = 0; i < max_entries; i++) { in update_dind_extent_range()
141 lb->curr_block += max_entries; in update_dind_extent_range()
163 for (i = 0; i < max_entries; i++) { in update_tind_extent_range()
171 lb->curr_block += max_entries * max_entries; in update_tind_extent_range()
194 for (i = 0; i < max_entries; i++) { in free_dind_blocks()
233 for (i = 0; i < max_entries; i++) { in free_tind_blocks()
419 unsigned long max_entries; in ext4_ext_migrate() local
510 max_entries = inode->i_sb->s_blocksize >> 2; in ext4_ext_migrate()
526 lb.curr_block += max_entries; in ext4_ext_migrate()
[all …]
/linux/net/xdp/
A Dxskmap.c68 if (attr->max_entries == 0 || attr->key_size != 4 || in xsk_map_alloc()
74 size = struct_size(m, xsk_map, attr->max_entries); in xsk_map_alloc()
100 if (index >= m->map.max_entries) { in xsk_map_get_next_key()
105 if (index == m->map.max_entries - 1) in xsk_map_get_next_key()
117 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 5); in xsk_map_gen_lookup()
135 if (key >= map->max_entries) in __xsk_map_lookup_elem()
164 if (unlikely(i >= m->map.max_entries)) in xsk_map_update_elem()
219 if (k >= map->max_entries) in xsk_map_delete_elem()
252 return meta0->max_entries == meta1->max_entries && in xsk_map_meta_equal()
/linux/tools/lib/bpf/
A Dlibbpf_probes.c204 int key_size, value_size, max_entries, map_flags; in bpf_probe_map_type() local
211 max_entries = 1; in bpf_probe_map_type()
227 max_entries = 0; in bpf_probe_map_type()
239 max_entries = 0; in bpf_probe_map_type()
248 max_entries = 4096; in bpf_probe_map_type()
294 attr.max_entries = max_entries; in bpf_probe_map_type()

Completed in 44 milliseconds

12345678910>>...12