bpf/prog_tests/recursion.c

0001 // SPDX-License-Identifier: GPL-2.0
0002 /* Copyright (c) 2021 Facebook */
0003 #include <test_progs.h>
0004 #include "recursion.skel.h"
0005
0006 void test_recursion(void)
0007 {
0008     struct bpf_prog_info prog_info = {};
0009     __u32 prog_info_len = sizeof(prog_info);
0010     struct recursion *skel;
0011     int key = 0;
0012     int err;
0013
0014     skel = recursion__open_and_load();
0015     if (!ASSERT_OK_PTR(skel, "skel_open_and_load"))
0016         return;
0017
0018     err = recursion__attach(skel);
0019     if (!ASSERT_OK(err, "skel_attach"))
0020         goto out;
0021
0022     ASSERT_EQ(skel->bss->pass1, 0, "pass1 == 0");
0023     bpf_map_delete_elem(bpf_map__fd(skel->maps.hash1), &key);
0024     ASSERT_EQ(skel->bss->pass1, 1, "pass1 == 1");
0025     bpf_map_delete_elem(bpf_map__fd(skel->maps.hash1), &key);
0026     ASSERT_EQ(skel->bss->pass1, 2, "pass1 == 2");
0027
0028     ASSERT_EQ(skel->bss->pass2, 0, "pass2 == 0");
0029     bpf_map_delete_elem(bpf_map__fd(skel->maps.hash2), &key);
0030     ASSERT_EQ(skel->bss->pass2, 1, "pass2 == 1");
0031     bpf_map_delete_elem(bpf_map__fd(skel->maps.hash2), &key);
0032     ASSERT_EQ(skel->bss->pass2, 2, "pass2 == 2");
0033
0034     err = bpf_obj_get_info_by_fd(bpf_program__fd(skel->progs.on_delete),
0035                      &prog_info, &prog_info_len);
0036     if (!ASSERT_OK(err, "get_prog_info"))
0037         goto out;
0038     ASSERT_EQ(prog_info.recursion_misses, 2, "recursion_misses");
0039 out:
0040     recursion__destroy(skel);
0041 }