Home
last modified time | relevance | path

Searched refs:bpf_map__max_entries (Results 1 – 16 of 16) sorted by relevance

/linux/tools/testing/selftests/bpf/prog_tests/
H A Dfor_each.c31 max_entries = bpf_map__max_entries(skel->maps.hashmap); in test_hash_map()
98 max_entries = bpf_map__max_entries(skel->maps.arraymap); in test_array_map()
166 max_entries = bpf_map__max_entries(skel->maps.arraymap); in test_multi_maps()
178 max_entries = bpf_map__max_entries(skel->maps.hashmap); in test_multi_maps()
223 max_entries = bpf_map__max_entries(skel->maps.hashmap); in test_hash_modify()
H A Dringbuf_multi.c56 ASSERT_EQ(bpf_map__max_entries(skel->maps.ringbuf1), page_size, "rb1_size_before"); in test_ringbuf_multi()
58 ASSERT_EQ(bpf_map__max_entries(skel->maps.ringbuf1), 2 * page_size, "rb1_size_after"); in test_ringbuf_multi()
60 ASSERT_EQ(bpf_map__max_entries(skel->maps.ringbuf1), page_size, "rb1_size_final"); in test_ringbuf_multi()
H A Dtailcalls.c58 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
74 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
88 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
108 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
109 j = bpf_map__max_entries(prog_array) - 1 - i; in test_tailcall_1()
125 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
126 j = bpf_map__max_entries(prog_array) - 1 - i; in test_tailcall_1()
141 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_1()
194 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_2()
463 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in test_tailcall_4()
[all …]
H A Dbpf_iter.c883 for (i = 0; i < bpf_map__max_entries(skel->maps.hashmap1); i++) { in test_bpf_hash_map()
966 for (i = 0; i < bpf_map__max_entries(skel->maps.hashmap1); i++) { in test_bpf_percpu_hash_map()
1035 for (i = 0; i < bpf_map__max_entries(skel->maps.arraymap1); i++) { in test_bpf_array_map()
1080 for (i = 0; i < bpf_map__max_entries(skel->maps.arraymap1); i++) { in test_bpf_array_map()
1144 for (i = 0; i < bpf_map__max_entries(skel->maps.arraymap1); i++) { in test_bpf_percpu_array_map()
H A Dbloom_filter_map.c168 map_size = bpf_map__max_entries(skel->maps.map_random_data); in setup_progs()
H A Dsockmap_basic.c72 __u32 i, max_entries = bpf_map__max_entries(src); in compare_cookies()
264 num_elems = bpf_map__max_entries(src); in test_sockmap_copy()
268 num_elems = bpf_map__max_entries(src) - 1; in test_sockmap_copy()
H A Dflow_dissector_classification.c519 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in attach_and_configure_program()
H A Dflow_dissector.c635 for (i = 0; i < bpf_map__max_entries(prog_array); i++) { in init_prog_array()
H A Dsockmap_listen.c1228 for (key = 0; key < bpf_map__max_entries(map); key++) { in test_ops_cleanup()
/linux/tools/testing/selftests/bpf/benchs/
H A Dbench_bpf_hashmap_full_update.c70 max_entries = bpf_map__max_entries(ctx.skel->maps.hash_map_bench); in hashmap_report_final()
/linux/tools/lib/bpf/
H A Dlibbpf.map184 bpf_map__max_entries;
H A Dusdt.c996 if (man->next_free_spec_id >= bpf_map__max_entries(man->specs_map)) in allocate_spec_id()
H A Dlibbpf.c5120 __u32 bpf_map__max_entries(const struct bpf_map *map) in bpf_map__max_entries() function
/linux/samples/bpf/
H A Dmap_perf_test_user.c459 inner_lru_hash_size = bpf_map__max_entries(map); in main()
/linux/tools/bpf/bpftool/
H A Dgen.c508 map_sz = (size_t)roundup(bpf_map__value_size(map), 8) * bpf_map__max_entries(map); in bpf_map_mmap_sz()
/linux/tools/testing/selftests/bpf/
H A Dveristat.c1319 if (bpf_map__max_entries(map) == 0) in fixup_obj_maps()