bpf/prog_tests/queue_stack_map.c

0001 // SPDX-License-Identifier: GPL-2.0
0002 #include <test_progs.h>
0003 #include <network_helpers.h>
0004
0005 enum {
0006     QUEUE,
0007     STACK,
0008 };
0009
0010 static void test_queue_stack_map_by_type(int type)
0011 {
0012     const int MAP_SIZE = 32;
0013     __u32 vals[MAP_SIZE], val;
0014     int i, err, prog_fd, map_in_fd, map_out_fd;
0015     char file[32], buf[128];
0016     struct bpf_object *obj;
0017     struct iphdr iph;
0018     LIBBPF_OPTS(bpf_test_run_opts, topts,
0019         .data_in = &pkt_v4,
0020         .data_size_in = sizeof(pkt_v4),
0021         .data_out = buf,
0022         .data_size_out = sizeof(buf),
0023         .repeat = 1,
0024     );
0025
0026     /* Fill test values to be used */
0027     for (i = 0; i < MAP_SIZE; i++)
0028         vals[i] = rand();
0029
0030     if (type == QUEUE)
0031         strncpy(file, "./test_queue_map.o", sizeof(file));
0032     else if (type == STACK)
0033         strncpy(file, "./test_stack_map.o", sizeof(file));
0034     else
0035         return;
0036
0037     err = bpf_prog_test_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
0038     if (CHECK_FAIL(err))
0039         return;
0040
0041     map_in_fd = bpf_find_map(__func__, obj, "map_in");
0042     if (map_in_fd < 0)
0043         goto out;
0044
0045     map_out_fd = bpf_find_map(__func__, obj, "map_out");
0046     if (map_out_fd < 0)
0047         goto out;
0048
0049     /* Push 32 elements to the input map */
0050     for (i = 0; i < MAP_SIZE; i++) {
0051         err = bpf_map_update_elem(map_in_fd, NULL, &vals[i], 0);
0052         if (CHECK_FAIL(err))
0053             goto out;
0054     }
0055
0056     /* The eBPF program pushes iph.saddr in the output map,
0057      * pops the input map and saves this value in iph.daddr
0058      */
0059     for (i = 0; i < MAP_SIZE; i++) {
0060         if (type == QUEUE) {
0061             val = vals[i];
0062             pkt_v4.iph.saddr = vals[i] * 5;
0063         } else if (type == STACK) {
0064             val = vals[MAP_SIZE - 1 - i];
0065             pkt_v4.iph.saddr = vals[MAP_SIZE - 1 - i] * 5;
0066         }
0067
0068         topts.data_size_out = sizeof(buf);
0069         err = bpf_prog_test_run_opts(prog_fd, &topts);
0070         if (err || topts.retval ||
0071             topts.data_size_out != sizeof(pkt_v4))
0072             break;
0073         memcpy(&iph, buf + sizeof(struct ethhdr), sizeof(iph));
0074         if (iph.daddr != val)
0075             break;
0076     }
0077
0078     ASSERT_OK(err, "bpf_map_pop_elem");
0079     ASSERT_OK(topts.retval, "bpf_map_pop_elem test retval");
0080     ASSERT_EQ(topts.data_size_out, sizeof(pkt_v4),
0081           "bpf_map_pop_elem data_size_out");
0082     ASSERT_EQ(iph.daddr, val, "bpf_map_pop_elem iph.daddr");
0083
0084     /* Queue is empty, program should return TC_ACT_SHOT */
0085     topts.data_size_out = sizeof(buf);
0086     err = bpf_prog_test_run_opts(prog_fd, &topts);
0087     ASSERT_OK(err, "check-queue-stack-map-empty");
0088     ASSERT_EQ(topts.retval, 2  /* TC_ACT_SHOT */,
0089           "check-queue-stack-map-empty test retval");
0090     ASSERT_EQ(topts.data_size_out, sizeof(pkt_v4),
0091           "check-queue-stack-map-empty data_size_out");
0092
0093     /* Check that the program pushed elements correctly */
0094     for (i = 0; i < MAP_SIZE; i++) {
0095         err = bpf_map_lookup_and_delete_elem(map_out_fd, NULL, &val);
0096         ASSERT_OK(err, "bpf_map_lookup_and_delete_elem");
0097         ASSERT_EQ(val, vals[i] * 5, "bpf_map_push_elem val");
0098     }
0099 out:
0100     pkt_v4.iph.saddr = 0;
0101     bpf_object__close(obj);
0102 }
0103
0104 void test_queue_stack_map(void)
0105 {
0106     test_queue_stack_map_by_type(QUEUE);
0107     test_queue_stack_map_by_type(STACK);
0108 }