1// SPDX-License-Identifier: GPL-2.0
  2#include <test_progs.h>
  3#include <network_helpers.h>
  4
  5enum {
  6	QUEUE,
  7	STACK,
  8};
  9
 10static void test_queue_stack_map_by_type(int type)
 11{
 12	const int MAP_SIZE = 32;
 13	__u32 vals[MAP_SIZE], val;
 14	int i, err, prog_fd, map_in_fd, map_out_fd;
 15	char file[32], buf[128];
 16	struct bpf_object *obj;
 17	struct iphdr iph = {};
 18	LIBBPF_OPTS(bpf_test_run_opts, topts,
 19		.data_in = &pkt_v4,
 20		.data_size_in = sizeof(pkt_v4),
 21		.data_out = buf,
 22		.data_size_out = sizeof(buf),
 23		.repeat = 1,
 24	);
 25
 26	/* Fill test values to be used */
 27	for (i = 0; i < MAP_SIZE; i++)
 28		vals[i] = rand();
 29
 30	if (type == QUEUE)
 31		strncpy(file, "./test_queue_map.bpf.o", sizeof(file));
 32	else if (type == STACK)
 33		strncpy(file, "./test_stack_map.bpf.o", sizeof(file));
 34	else
 35		return;
 36
 37	err = bpf_prog_test_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
 38	if (CHECK_FAIL(err))
 39		return;
 40
 41	map_in_fd = bpf_find_map(__func__, obj, "map_in");
 42	if (map_in_fd < 0)
 43		goto out;
 44
 45	map_out_fd = bpf_find_map(__func__, obj, "map_out");
 46	if (map_out_fd < 0)
 47		goto out;
 48
 49	/* Push 32 elements to the input map */
 50	for (i = 0; i < MAP_SIZE; i++) {
 51		err = bpf_map_update_elem(map_in_fd, NULL, &vals[i], 0);
 52		if (CHECK_FAIL(err))
 53			goto out;
 54	}
 55
 56	/* The eBPF program pushes iph.saddr in the output map,
 57	 * pops the input map and saves this value in iph.daddr
 58	 */
 59	for (i = 0; i < MAP_SIZE; i++) {
 60		if (type == QUEUE) {
 61			val = vals[i];
 62			pkt_v4.iph.saddr = vals[i] * 5;
 63		} else if (type == STACK) {
 64			val = vals[MAP_SIZE - 1 - i];
 65			pkt_v4.iph.saddr = vals[MAP_SIZE - 1 - i] * 5;
 66		}
 67
 68		topts.data_size_out = sizeof(buf);
 69		err = bpf_prog_test_run_opts(prog_fd, &topts);
 70		if (err || topts.retval ||
 71		    topts.data_size_out != sizeof(pkt_v4))
 72			break;
 73		memcpy(&iph, buf + sizeof(struct ethhdr), sizeof(iph));
 74		if (iph.daddr != val)
 75			break;
 76	}
 77
 78	ASSERT_OK(err, "bpf_map_pop_elem");
 79	ASSERT_OK(topts.retval, "bpf_map_pop_elem test retval");
 80	ASSERT_EQ(topts.data_size_out, sizeof(pkt_v4),
 81		  "bpf_map_pop_elem data_size_out");
 82	ASSERT_EQ(iph.daddr, val, "bpf_map_pop_elem iph.daddr");
 83
 84	/* Queue is empty, program should return TC_ACT_SHOT */
 85	topts.data_size_out = sizeof(buf);
 86	err = bpf_prog_test_run_opts(prog_fd, &topts);
 87	ASSERT_OK(err, "check-queue-stack-map-empty");
 88	ASSERT_EQ(topts.retval, 2  /* TC_ACT_SHOT */,
 89		  "check-queue-stack-map-empty test retval");
 90	ASSERT_EQ(topts.data_size_out, sizeof(pkt_v4),
 91		  "check-queue-stack-map-empty data_size_out");
 92
 93	/* Check that the program pushed elements correctly */
 94	for (i = 0; i < MAP_SIZE; i++) {
 95		err = bpf_map_lookup_and_delete_elem(map_out_fd, NULL, &val);
 96		ASSERT_OK(err, "bpf_map_lookup_and_delete_elem");
 97		ASSERT_EQ(val, vals[i] * 5, "bpf_map_push_elem val");
 98	}
 
 
 
 
 99out:
100	pkt_v4.iph.saddr = 0;
101	bpf_object__close(obj);
102}
103
104void test_queue_stack_map(void)
105{
106	test_queue_stack_map_by_type(QUEUE);
107	test_queue_stack_map_by_type(STACK);
108}

 1// SPDX-License-Identifier: GPL-2.0
 2#include <test_progs.h>
 
 3
 4enum {
 5	QUEUE,
 6	STACK,
 7};
 8
 9static void test_queue_stack_map_by_type(int type)
10{
11	const int MAP_SIZE = 32;
12	__u32 vals[MAP_SIZE], duration, retval, size, val;
13	int i, err, prog_fd, map_in_fd, map_out_fd;
14	char file[32], buf[128];
15	struct bpf_object *obj;
16	struct iphdr *iph = (void *)buf + sizeof(struct ethhdr);
 
 
 
 
 
 
 
17
18	/* Fill test values to be used */
19	for (i = 0; i < MAP_SIZE; i++)
20		vals[i] = rand();
21
22	if (type == QUEUE)
23		strncpy(file, "./test_queue_map.o", sizeof(file));
24	else if (type == STACK)
25		strncpy(file, "./test_stack_map.o", sizeof(file));
26	else
27		return;
28
29	err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
30	if (CHECK_FAIL(err))
31		return;
32
33	map_in_fd = bpf_find_map(__func__, obj, "map_in");
34	if (map_in_fd < 0)
35		goto out;
36
37	map_out_fd = bpf_find_map(__func__, obj, "map_out");
38	if (map_out_fd < 0)
39		goto out;
40
41	/* Push 32 elements to the input map */
42	for (i = 0; i < MAP_SIZE; i++) {
43		err = bpf_map_update_elem(map_in_fd, NULL, &vals[i], 0);
44		if (CHECK_FAIL(err))
45			goto out;
46	}
47
48	/* The eBPF program pushes iph.saddr in the output map,
49	 * pops the input map and saves this value in iph.daddr
50	 */
51	for (i = 0; i < MAP_SIZE; i++) {
52		if (type == QUEUE) {
53			val = vals[i];
54			pkt_v4.iph.saddr = vals[i] * 5;
55		} else if (type == STACK) {
56			val = vals[MAP_SIZE - 1 - i];
57			pkt_v4.iph.saddr = vals[MAP_SIZE - 1 - i] * 5;
58		}
59
60		err = bpf_prog_test_run(prog_fd, 1, &pkt_v4, sizeof(pkt_v4),
61					buf, &size, &retval, &duration);
62		if (err || retval || size != sizeof(pkt_v4) ||
63		    iph->daddr != val)
 
 
 
64			break;
65	}
66
67	CHECK(err || retval || size != sizeof(pkt_v4) || iph->daddr != val,
68	      "bpf_map_pop_elem",
69	      "err %d errno %d retval %d size %d iph->daddr %u\n",
70	      err, errno, retval, size, iph->daddr);
 
71
72	/* Queue is empty, program should return TC_ACT_SHOT */
73	err = bpf_prog_test_run(prog_fd, 1, &pkt_v4, sizeof(pkt_v4),
74				buf, &size, &retval, &duration);
75	CHECK(err || retval != 2 /* TC_ACT_SHOT */|| size != sizeof(pkt_v4),
76	      "check-queue-stack-map-empty",
77	      "err %d errno %d retval %d size %d\n",
78	      err, errno, retval, size);
 
79
80	/* Check that the program pushed elements correctly */
81	for (i = 0; i < MAP_SIZE; i++) {
82		err = bpf_map_lookup_and_delete_elem(map_out_fd, NULL, &val);
83		if (err || val != vals[i] * 5)
84			break;
85	}
86
87	CHECK(i != MAP_SIZE && (err || val != vals[i] * 5),
88	      "bpf_map_push_elem", "err %d value %u\n", err, val);
89
90out:
91	pkt_v4.iph.saddr = 0;
92	bpf_object__close(obj);
93}
94
95void test_queue_stack_map(void)
96{
97	test_queue_stack_map_by_type(QUEUE);
98	test_queue_stack_map_by_type(STACK);
99}