// SPDX-License-Identifier: GPL-2.0 #include <bpf/btf.h>#include <test_btf.h>#include <linux/btf.h>#include <test_progs.h>#include <network_helpers.h>#include "linked_list.skel.h" #include "linked_list_fail.skel.h" #include "linked_list_peek.skel.h" static char log_buf[1024 * 1024];static struct {const char *prog_name;const char *err_msg;#define TEST(test, off) \#test "_missing_lock_push_front" , \"bpf_spin_lock at off=" #off " must be held for bpf_list_head" }, \#test "_missing_lock_push_back" , \"bpf_spin_lock at off=" #off " must be held for bpf_list_head" }, \#test "_missing_lock_pop_front" , \"bpf_spin_lock at off=" #off " must be held for bpf_list_head" }, \#test "_missing_lock_pop_back" , \"bpf_spin_lock at off=" #off " must be held for bpf_list_head" },#undef TEST#define TEST(test, op) \#test "_kptr_incorrect_lock_" #op , \"held lock and object are not in the same allocation\n" \"bpf_spin_lock at off=40 must be held for bpf_list_head" }, \#test "_global_incorrect_lock_" #op , \"held lock and object are not in the same allocation\n" \"bpf_spin_lock at off=16 must be held for bpf_list_head" }, \#test "_map_incorrect_lock_" #op , \"held lock and object are not in the same allocation\n" \"bpf_spin_lock at off=0 must be held for bpf_list_head" }, \#test "_inner_map_incorrect_lock_" #op , \"held lock and object are not in the same allocation\n" \"bpf_spin_lock at off=0 must be held for bpf_list_head" },#undef TEST"map_compat_kprobe" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"map_compat_kretprobe" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"map_compat_tp" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"map_compat_perf" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"map_compat_raw_tp" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"map_compat_raw_tp_w" , "tracing progs cannot use bpf_{list_head,rb_root} yet" },"obj_type_id_oor" , "local type ID argument must be in range [0, U32_MAX]" },"obj_new_no_composite" , "bpf_obj_new/bpf_percpu_obj_new type ID argument must be of a struct" },"obj_new_no_struct" , "bpf_obj_new/bpf_percpu_obj_new type ID argument must be of a struct" },"obj_drop_non_zero_off" , "R1 must have zero offset when passed to release func" },"new_null_ret" , "R0 invalid mem access 'ptr_or_null_'" },"obj_new_acq" , "Unreleased reference id=" },"use_after_drop" , "invalid mem access 'scalar'" },"ptr_walk_scalar" , "type=rdonly_untrusted_mem expected=percpu_ptr_" },"direct_read_lock" , "direct access to bpf_spin_lock is disallowed" },"direct_write_lock" , "direct access to bpf_spin_lock is disallowed" },"direct_read_head" , "direct access to bpf_list_head is disallowed" },"direct_write_head" , "direct access to bpf_list_head is disallowed" },"direct_read_node" , "direct access to bpf_list_node is disallowed" },"direct_write_node" , "direct access to bpf_list_node is disallowed" },"use_after_unlock_push_front" , "invalid mem access 'scalar'" },"use_after_unlock_push_back" , "invalid mem access 'scalar'" },"double_push_front" , "arg#1 expected pointer to allocated object" },"double_push_back" , "arg#1 expected pointer to allocated object" },"no_node_value_type" , "bpf_list_node not found at offset=0" },"incorrect_value_type" ,"operation on bpf_list_head expects arg#1 bpf_list_node at offset=48 in struct foo, " "but arg is at offset=0 in struct bar" },"incorrect_node_var_off" , "variable ptr_ access var_off=(0x0; 0xffffffff) disallowed" },"incorrect_node_off1" , "bpf_list_node not found at offset=49" },"incorrect_node_off2" , "arg#1 offset=0, but expected bpf_list_node at offset=48 in struct foo" },"no_head_type" , "bpf_list_head not found at offset=0" },"incorrect_head_var_off1" , "R1 doesn't have constant offset" },"incorrect_head_var_off2" , "variable ptr_ access var_off=(0x0; 0xffffffff) disallowed" },"incorrect_head_off1" , "bpf_list_head not found at offset=25" },"incorrect_head_off2" , "bpf_list_head not found at offset=1" },"pop_front_off" , "off 48 doesn't point to 'struct bpf_spin_lock' that is at 40" },"pop_back_off" , "off 48 doesn't point to 'struct bpf_spin_lock' that is at 40" },static void test_linked_list_fail_prog(const char *prog_name, const char *err_msg)sizeof (log_buf),struct linked_list_fail *skel;struct bpf_program *prog;int ret;if (!ASSERT_OK_PTR(skel, "linked_list_fail__open_opts" ))return ;if (!ASSERT_OK_PTR(prog, "bpf_object__find_program_by_name" ))goto end;true );if (!ASSERT_ERR(ret, "linked_list_fail__load must fail" ))goto end;if (!ASSERT_OK_PTR(strstr(log_buf, err_msg), "expected error message" )) {"Expected: %s\n" , err_msg);"Verifier: %s\n" , log_buf);static void clear_fields(struct bpf_map *map)char buf[24];int key = 0;sizeof (buf));sizeof (key), buf, sizeof (buf), 0), "check_and_free_fields" );enum {static void test_linked_list_success(int mode, bool leave_in_map)sizeof (pkt_v4),struct linked_list *skel;int ret;if (!ASSERT_OK_PTR(skel, "linked_list__open_and_load" ))return ;if (mode == LIST_IN_LIST)goto lil;if (mode == PUSH_POP_MULT)goto ppm;"map_list_push_pop" );"map_list_push_pop retval" );if (!leave_in_map)"inner_map_list_push_pop" );"inner_map_list_push_pop retval" );if (!leave_in_map)"global_list_push_pop" );"global_list_push_pop retval" );if (!leave_in_map)d), &opts);"global_list_push_pop_nested" );"global_list_push_pop_nested retval" );if (!leave_in_map)), &opts);"global_list_array_push_pop" );"global_list_array_push_pop retval" );if (!leave_in_map)if (mode == PUSH_POP)goto end;), &opts);"map_list_push_pop_multiple" );"map_list_push_pop_multiple retval" );if (!leave_in_map)ltiple), &opts);"inner_map_list_push_pop_multiple" );"inner_map_list_push_pop_multiple retval" );if (!leave_in_map)ple), &opts);"global_list_push_pop_multiple" );"global_list_push_pop_multiple retval" );if (!leave_in_map)if (mode == PUSH_POP_MULT)goto end;"map_list_in_list" );"map_list_in_list retval" );if (!leave_in_map)"inner_map_list_in_list" );"inner_map_list_in_list retval" );if (!leave_in_map)"global_list_in_list" );"global_list_in_list retval" );if (!leave_in_map)#define SPIN_LOCK 2#define LIST_HEAD 3#define LIST_NODE 4static struct btf *init_btf(void )int id, lid, hid, nid;struct btf *btf;if (!ASSERT_OK_PTR(btf, "btf__new_empty" ))return NULL;"int" , 4, BTF_INT_SIGNED);if (!ASSERT_EQ(id, 1, "btf__add_int" ))goto end;"bpf_spin_lock" , 4);if (!ASSERT_EQ(lid, SPIN_LOCK, "btf__add_struct bpf_spin_lock" ))goto end;"bpf_list_head" , 16);if (!ASSERT_EQ(hid, LIST_HEAD, "btf__add_struct bpf_list_head" ))goto end;"bpf_list_node" , 24);if (!ASSERT_EQ(nid, LIST_NODE, "btf__add_struct bpf_list_node" ))goto end;return btf;return NULL;static void list_and_rb_node_same_struct(bool refcount_field)int bpf_rb_node_btf_id, bpf_refcount_btf_id = 0, foo_btf_id;struct btf *btf;int id, err;if (!ASSERT_OK_PTR(btf, "init_btf" ))return ;"bpf_rb_node" , 32);if (!ASSERT_GT(bpf_rb_node_btf_id, 0, "btf__add_struct bpf_rb_node" ))return ;if (refcount_field) {"bpf_refcount" , 4);if (!ASSERT_GT(bpf_refcount_btf_id, 0, "btf__add_struct bpf_refcount" ))return ;"bar" , refcount_field ? 60 : 56);if (!ASSERT_GT(id, 0, "btf__add_struct bar" ))return ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))return ;"c" , bpf_rb_node_btf_id, 192, 0);if (!ASSERT_OK(err, "btf__add_field bar::c" ))return ;if (refcount_field) {"ref" , bpf_refcount_btf_id, 448, 0);if (!ASSERT_OK(err, "btf__add_field bar::ref" ))return ;"foo" , 20);if (!ASSERT_GT(foo_btf_id, 0, "btf__add_struct foo" ))return ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))return ;"b" , SPIN_LOCK, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))return ;"contains:bar:a" , foo_btf_id, 0);if (!ASSERT_GT(id, 0, "btf__add_decl_tag contains:bar:a" ))return ;"check btf" );static void test_btf(void )struct btf *btf = NULL;int id, err;while (test__start_subtest("btf: too many locks" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 24);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_struct foo::a" ))break ;"b" , SPIN_LOCK, 32, 0);if (!ASSERT_OK(err, "btf__add_struct foo::a" ))break ;"c" , LIST_HEAD, 64, 0);if (!ASSERT_OK(err, "btf__add_struct foo::a" ))break ;"check btf" );break ;while (test__start_subtest("btf: missing lock" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 16);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_struct foo::a" ))break ;"contains:baz:a" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:baz:a" ))break ;"baz" , 16);if (!ASSERT_EQ(id, 7, "btf__add_struct baz" ))break ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field baz::a" ))break ;"check btf" );break ;while (test__start_subtest("btf: bad offset" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 36);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"c" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::c" ))break ;"contains:foo:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:foo:b" ))break ;"check btf" );break ;while (test__start_subtest("btf: missing contains:" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 24);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_HEAD, 64, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"check btf" );break ;while (test__start_subtest("btf: missing struct" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 24);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_HEAD, 64, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:bar:bar" , 5, 1);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:bar" ))break ;"check btf" );break ;while (test__start_subtest("btf: missing node" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 24);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_HEAD, 64, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:foo:c" , 5, 1);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:foo:c" ))break ;"check btf" );break ;while (test__start_subtest("btf: node incorrect type" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 20);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , SPIN_LOCK, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:bar:a" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:a" ))break ;"bar" , 4);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , SPIN_LOCK, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"check btf" );break ;while (test__start_subtest("btf: multiple bpf_list_node with name b" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 52);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"b" , LIST_NODE, 256, 0);if (!ASSERT_OK(err, "btf__add_field foo::c" ))break ;"d" , SPIN_LOCK, 384, 0);if (!ASSERT_OK(err, "btf__add_field foo::d" ))break ;"contains:foo:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:foo:b" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning | owned AA cycle" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 44);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field foo::c" ))break ;"contains:foo:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:foo:b" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning | owned ABA cycle" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 44);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field foo::c" ))break ;"contains:bar:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:b" ))break ;"bar" , 44);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field bar::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field bar::c" ))break ;"contains:foo:b" , 7, 0);if (!ASSERT_EQ(id, 8, "btf__add_decl_tag contains:foo:b" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning -> owned" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 28);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , SPIN_LOCK, 192, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:bar:a" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:a" ))break ;"bar" , 24);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning -> owning | owned -> owned" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 28);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , SPIN_LOCK, 192, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:bar:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:b" ))break ;"bar" , 44);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field bar::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field bar::c" ))break ;"contains:baz:a" , 7, 0);if (!ASSERT_EQ(id, 8, "btf__add_decl_tag contains:baz:a" ))break ;"baz" , 24);if (!ASSERT_EQ(id, 9, "btf__add_struct baz" ))break ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field baz:a" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning | owned -> owning | owned -> owned" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 44);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field foo::c" ))break ;"contains:bar:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:b" ))break ;"bar" , 44);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar:a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field bar:b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field bar:c" ))break ;"contains:baz:a" , 7, 0);if (!ASSERT_EQ(id, 8, "btf__add_decl_tag contains:baz:a" ))break ;"baz" , 24);if (!ASSERT_EQ(id, 9, "btf__add_struct baz" ))break ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field baz:a" ))break ;"check btf" );break ;while (test__start_subtest("btf: owning -> owning | owned -> owning | owned -> owned" )) {if (!ASSERT_OK_PTR(btf, "init_btf" ))break ;"foo" , 20);if (!ASSERT_EQ(id, 5, "btf__add_struct foo" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field foo::a" ))break ;"b" , SPIN_LOCK, 128, 0);if (!ASSERT_OK(err, "btf__add_field foo::b" ))break ;"contains:bar:b" , 5, 0);if (!ASSERT_EQ(id, 6, "btf__add_decl_tag contains:bar:b" ))break ;"bar" , 44);if (!ASSERT_EQ(id, 7, "btf__add_struct bar" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field bar::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field bar::c" ))break ;"contains:baz:b" , 7, 0);if (!ASSERT_EQ(id, 8, "btf__add_decl_tag" ))break ;"baz" , 44);if (!ASSERT_EQ(id, 9, "btf__add_struct baz" ))break ;"a" , LIST_HEAD, 0, 0);if (!ASSERT_OK(err, "btf__add_field bar::a" ))break ;"b" , LIST_NODE, 128, 0);if (!ASSERT_OK(err, "btf__add_field bar::b" ))break ;"c" , SPIN_LOCK, 320, 0);if (!ASSERT_OK(err, "btf__add_field bar::c" ))break ;"contains:bam:a" , 9, 0);if (!ASSERT_EQ(id, 10, "btf__add_decl_tag contains:bam:a" ))break ;"bam" , 24);if (!ASSERT_EQ(id, 11, "btf__add_struct bam" ))break ;"a" , LIST_NODE, 0, 0);if (!ASSERT_OK(err, "btf__add_field bam::a" ))break ;"check btf" );break ;while (test__start_subtest("btf: list_node and rb_node in same struct" )) {true );break ;while (test__start_subtest("btf: list_node and rb_node in same struct, no bpf_refcount" )) {false );break ;void test_linked_list(void )int i;for (i = 0; i < ARRAY_SIZE(linked_list_fail_tests); i++) {if (!test__start_subtest(linked_list_fail_tests[i].prog_name))continue ;false );true );false );true );false );true );false );void test_linked_list_peek(void )
Messung V0.5 C=94 H=89 G=91
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
