1 /* Copyright (c) 2017 Facebook
3 * This program is free software; you can redistribute it and/or
4 * modify it under the terms of version 2 of the GNU General Public
5 * License as published by the Free Software Foundation.
14 #include <linux/types.h>
15 typedef __u16 __sum16;
16 #include <arpa/inet.h>
17 #include <linux/if_ether.h>
18 #include <linux/if_packet.h>
20 #include <linux/ipv6.h>
21 #include <linux/tcp.h>
24 #include <sys/resource.h>
25 #include <sys/types.h>
28 #include <linux/bpf.h>
29 #include <linux/err.h>
31 #include <bpf/libbpf.h>
32 #include "test_iptunnel_common.h"
34 #include "bpf_endian.h"
36 static int error_cnt, pass_cnt;
38 #define MAGIC_BYTES 123
40 /* ipv4 test vector */
46 .eth.h_proto = bpf_htons(ETH_P_IP),
49 .iph.tot_len = bpf_htons(MAGIC_BYTES),
53 /* ipv6 test vector */
59 .eth.h_proto = bpf_htons(ETH_P_IPV6),
61 .iph.payload_len = bpf_htons(MAGIC_BYTES),
65 #define CHECK(condition, tag, format...) ({ \
66 int __ret = !!(condition); \
69 printf("%s:FAIL:%s ", __func__, tag); \
73 printf("%s:PASS:%s %d nsec\n", __func__, tag, duration);\
78 static int bpf_find_map(const char *test, struct bpf_object *obj,
83 map = bpf_object__find_map_by_name(obj, name);
85 printf("%s:FAIL:map '%s' not found\n", test, name);
89 return bpf_map__fd(map);
92 static void test_pkt_access(void)
94 const char *file = "./test_pkt_access.o";
95 struct bpf_object *obj;
96 __u32 duration, retval;
99 err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
105 err = bpf_prog_test_run(prog_fd, 100000, &pkt_v4, sizeof(pkt_v4),
106 NULL, NULL, &retval, &duration);
107 CHECK(err || errno || retval, "ipv4",
108 "err %d errno %d retval %d duration %d\n",
109 err, errno, retval, duration);
111 err = bpf_prog_test_run(prog_fd, 100000, &pkt_v6, sizeof(pkt_v6),
112 NULL, NULL, &retval, &duration);
113 CHECK(err || errno || retval, "ipv6",
114 "err %d errno %d retval %d duration %d\n",
115 err, errno, retval, duration);
116 bpf_object__close(obj);
119 static void test_xdp(void)
121 struct vip key4 = {.protocol = 6, .family = AF_INET};
122 struct vip key6 = {.protocol = 6, .family = AF_INET6};
123 struct iptnl_info value4 = {.family = AF_INET};
124 struct iptnl_info value6 = {.family = AF_INET6};
125 const char *file = "./test_xdp.o";
126 struct bpf_object *obj;
128 struct ipv6hdr *iph6 = (void *)buf + sizeof(struct ethhdr);
129 struct iphdr *iph = (void *)buf + sizeof(struct ethhdr);
130 __u32 duration, retval, size;
131 int err, prog_fd, map_fd;
133 err = bpf_prog_load(file, BPF_PROG_TYPE_XDP, &obj, &prog_fd);
139 map_fd = bpf_find_map(__func__, obj, "vip2tnl");
142 bpf_map_update_elem(map_fd, &key4, &value4, 0);
143 bpf_map_update_elem(map_fd, &key6, &value6, 0);
145 err = bpf_prog_test_run(prog_fd, 1, &pkt_v4, sizeof(pkt_v4),
146 buf, &size, &retval, &duration);
148 CHECK(err || errno || retval != XDP_TX || size != 74 ||
149 iph->protocol != IPPROTO_IPIP, "ipv4",
150 "err %d errno %d retval %d size %d\n",
151 err, errno, retval, size);
153 err = bpf_prog_test_run(prog_fd, 1, &pkt_v6, sizeof(pkt_v6),
154 buf, &size, &retval, &duration);
155 CHECK(err || errno || retval != XDP_TX || size != 114 ||
156 iph6->nexthdr != IPPROTO_IPV6, "ipv6",
157 "err %d errno %d retval %d size %d\n",
158 err, errno, retval, size);
160 bpf_object__close(obj);
163 #define MAGIC_VAL 0x1234
164 #define NUM_ITER 100000
167 static void test_l4lb(void)
169 unsigned int nr_cpus = bpf_num_possible_cpus();
170 const char *file = "./test_l4lb.o";
171 struct vip key = {.protocol = 6};
175 } value = {.vip_num = VIP_NUM};
176 __u32 stats_key = VIP_NUM;
181 struct real_definition {
187 } real_def = {.dst = MAGIC_VAL};
188 __u32 ch_key = 11, real_num = 3;
189 __u32 duration, retval, size;
190 int err, i, prog_fd, map_fd;
191 __u64 bytes = 0, pkts = 0;
192 struct bpf_object *obj;
194 u32 *magic = (u32 *)buf;
196 err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
202 map_fd = bpf_find_map(__func__, obj, "vip_map");
205 bpf_map_update_elem(map_fd, &key, &value, 0);
207 map_fd = bpf_find_map(__func__, obj, "ch_rings");
210 bpf_map_update_elem(map_fd, &ch_key, &real_num, 0);
212 map_fd = bpf_find_map(__func__, obj, "reals");
215 bpf_map_update_elem(map_fd, &real_num, &real_def, 0);
217 err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v4, sizeof(pkt_v4),
218 buf, &size, &retval, &duration);
219 CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 54 ||
220 *magic != MAGIC_VAL, "ipv4",
221 "err %d errno %d retval %d size %d magic %x\n",
222 err, errno, retval, size, *magic);
224 err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v6, sizeof(pkt_v6),
225 buf, &size, &retval, &duration);
226 CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 74 ||
227 *magic != MAGIC_VAL, "ipv6",
228 "err %d errno %d retval %d size %d magic %x\n",
229 err, errno, retval, size, *magic);
231 map_fd = bpf_find_map(__func__, obj, "stats");
234 bpf_map_lookup_elem(map_fd, &stats_key, stats);
235 for (i = 0; i < nr_cpus; i++) {
236 bytes += stats[i].bytes;
237 pkts += stats[i].pkts;
239 if (bytes != MAGIC_BYTES * NUM_ITER * 2 || pkts != NUM_ITER * 2) {
241 printf("test_l4lb:FAIL:stats %lld %lld\n", bytes, pkts);
244 bpf_object__close(obj);
247 static void test_tcp_estats(void)
249 const char *file = "./test_tcp_estats.o";
251 struct bpf_object *obj;
254 err = bpf_prog_load(file, BPF_PROG_TYPE_TRACEPOINT, &obj, &prog_fd);
255 CHECK(err, "", "err %d errno %d\n", err, errno);
261 bpf_object__close(obj);
264 static inline __u64 ptr_to_u64(const void *ptr)
266 return (__u64) (unsigned long) ptr;
269 static void test_bpf_obj_id(void)
271 const __u64 array_magic_value = 0xfaceb00c;
272 const __u32 array_key = 0;
273 const int nr_iters = 2;
274 const char *file = "./test_obj_id.o";
275 const char *jit_sysctl = "/proc/sys/net/core/bpf_jit_enable";
277 struct bpf_object *objs[nr_iters];
278 int prog_fds[nr_iters], map_fds[nr_iters];
279 /* +1 to test for the info_len returned by kernel */
280 struct bpf_prog_info prog_infos[nr_iters + 1];
281 struct bpf_map_info map_infos[nr_iters + 1];
282 char jited_insns[128], xlated_insns[128], zeros[128];
283 __u32 i, next_id, info_len, nr_id_found, duration = 0;
284 int sysctl_fd, jit_enabled = 0, err = 0;
287 sysctl_fd = open(jit_sysctl, 0, O_RDONLY);
288 if (sysctl_fd != -1) {
291 if (read(sysctl_fd, &tmpc, sizeof(tmpc)) == 1)
292 jit_enabled = (tmpc != '0');
296 err = bpf_prog_get_fd_by_id(0);
297 CHECK(err >= 0 || errno != ENOENT,
298 "get-fd-by-notexist-prog-id", "err %d errno %d\n", err, errno);
300 err = bpf_map_get_fd_by_id(0);
301 CHECK(err >= 0 || errno != ENOENT,
302 "get-fd-by-notexist-map-id", "err %d errno %d\n", err, errno);
304 for (i = 0; i < nr_iters; i++)
307 /* Check bpf_obj_get_info_by_fd() */
308 bzero(zeros, sizeof(zeros));
309 for (i = 0; i < nr_iters; i++) {
310 err = bpf_prog_load(file, BPF_PROG_TYPE_SOCKET_FILTER,
311 &objs[i], &prog_fds[i]);
312 /* test_obj_id.o is a dumb prog. It should never fail
319 /* Insert a magic value to the map */
320 map_fds[i] = bpf_find_map(__func__, objs[i], "test_map_id");
321 assert(map_fds[i] >= 0);
322 err = bpf_map_update_elem(map_fds[i], &array_key,
323 &array_magic_value, 0);
326 /* Check getting map info */
327 info_len = sizeof(struct bpf_map_info) * 2;
328 bzero(&map_infos[i], info_len);
329 err = bpf_obj_get_info_by_fd(map_fds[i], &map_infos[i],
332 map_infos[i].type != BPF_MAP_TYPE_ARRAY ||
333 map_infos[i].key_size != sizeof(__u32) ||
334 map_infos[i].value_size != sizeof(__u64) ||
335 map_infos[i].max_entries != 1 ||
336 map_infos[i].map_flags != 0 ||
337 info_len != sizeof(struct bpf_map_info),
339 "err %d errno %d type %d(%d) info_len %u(%lu) key_size %u value_size %u max_entries %u map_flags %X\n",
341 map_infos[i].type, BPF_MAP_TYPE_ARRAY,
342 info_len, sizeof(struct bpf_map_info),
343 map_infos[i].key_size,
344 map_infos[i].value_size,
345 map_infos[i].max_entries,
346 map_infos[i].map_flags))
349 /* Check getting prog info */
350 info_len = sizeof(struct bpf_prog_info) * 2;
351 bzero(&prog_infos[i], info_len);
352 bzero(jited_insns, sizeof(jited_insns));
353 bzero(xlated_insns, sizeof(xlated_insns));
354 prog_infos[i].jited_prog_insns = ptr_to_u64(jited_insns);
355 prog_infos[i].jited_prog_len = sizeof(jited_insns);
356 prog_infos[i].xlated_prog_insns = ptr_to_u64(xlated_insns);
357 prog_infos[i].xlated_prog_len = sizeof(xlated_insns);
358 err = bpf_obj_get_info_by_fd(prog_fds[i], &prog_infos[i],
361 prog_infos[i].type != BPF_PROG_TYPE_SOCKET_FILTER ||
362 info_len != sizeof(struct bpf_prog_info) ||
363 (jit_enabled && !prog_infos[i].jited_prog_len) ||
365 !memcmp(jited_insns, zeros, sizeof(zeros))) ||
366 !prog_infos[i].xlated_prog_len ||
367 !memcmp(xlated_insns, zeros, sizeof(zeros)),
369 "err %d errno %d i %d type %d(%d) info_len %u(%lu) jit_enabled %d jited_prog_len %u xlated_prog_len %u jited_prog %d xlated_prog %d\n",
371 prog_infos[i].type, BPF_PROG_TYPE_SOCKET_FILTER,
372 info_len, sizeof(struct bpf_prog_info),
374 prog_infos[i].jited_prog_len,
375 prog_infos[i].xlated_prog_len,
376 !!memcmp(jited_insns, zeros, sizeof(zeros)),
377 !!memcmp(xlated_insns, zeros, sizeof(zeros))))
382 /* Check bpf_prog_get_next_id() */
385 while (!bpf_prog_get_next_id(next_id, &next_id)) {
386 struct bpf_prog_info prog_info = {};
389 info_len = sizeof(prog_info);
391 prog_fd = bpf_prog_get_fd_by_id(next_id);
392 if (prog_fd < 0 && errno == ENOENT)
393 /* The bpf_prog is in the dead row */
395 if (CHECK(prog_fd < 0, "get-prog-fd(next_id)",
396 "prog_fd %d next_id %d errno %d\n",
397 prog_fd, next_id, errno))
400 for (i = 0; i < nr_iters; i++)
401 if (prog_infos[i].id == next_id)
409 err = bpf_obj_get_info_by_fd(prog_fd, &prog_info, &info_len);
410 prog_infos[i].jited_prog_insns = 0;
411 prog_infos[i].xlated_prog_insns = 0;
412 CHECK(err || info_len != sizeof(struct bpf_prog_info) ||
413 memcmp(&prog_info, &prog_infos[i], info_len),
414 "get-prog-info(next_id->fd)",
415 "err %d errno %d info_len %u(%lu) memcmp %d\n",
416 err, errno, info_len, sizeof(struct bpf_prog_info),
417 memcmp(&prog_info, &prog_infos[i], info_len));
421 CHECK(nr_id_found != nr_iters,
422 "check total prog id found by get_next_id",
423 "nr_id_found %u(%u)\n",
424 nr_id_found, nr_iters);
426 /* Check bpf_map_get_next_id() */
429 while (!bpf_map_get_next_id(next_id, &next_id)) {
430 struct bpf_map_info map_info = {};
433 info_len = sizeof(map_info);
435 map_fd = bpf_map_get_fd_by_id(next_id);
436 if (map_fd < 0 && errno == ENOENT)
437 /* The bpf_map is in the dead row */
439 if (CHECK(map_fd < 0, "get-map-fd(next_id)",
440 "map_fd %d next_id %u errno %d\n",
441 map_fd, next_id, errno))
444 for (i = 0; i < nr_iters; i++)
445 if (map_infos[i].id == next_id)
453 err = bpf_map_lookup_elem(map_fd, &array_key, &array_value);
456 err = bpf_obj_get_info_by_fd(map_fd, &map_info, &info_len);
457 CHECK(err || info_len != sizeof(struct bpf_map_info) ||
458 memcmp(&map_info, &map_infos[i], info_len) ||
459 array_value != array_magic_value,
460 "check get-map-info(next_id->fd)",
461 "err %d errno %d info_len %u(%lu) memcmp %d array_value %llu(%llu)\n",
462 err, errno, info_len, sizeof(struct bpf_map_info),
463 memcmp(&map_info, &map_infos[i], info_len),
464 array_value, array_magic_value);
468 CHECK(nr_id_found != nr_iters,
469 "check total map id found by get_next_id",
470 "nr_id_found %u(%u)\n",
471 nr_id_found, nr_iters);
474 for (i = 0; i < nr_iters; i++)
475 bpf_object__close(objs[i]);
478 static void test_pkt_md_access(void)
480 const char *file = "./test_pkt_md_access.o";
481 struct bpf_object *obj;
482 __u32 duration, retval;
485 err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
491 err = bpf_prog_test_run(prog_fd, 10, &pkt_v4, sizeof(pkt_v4),
492 NULL, NULL, &retval, &duration);
493 CHECK(err || retval, "",
494 "err %d errno %d retval %d duration %d\n",
495 err, errno, retval, duration);
497 bpf_object__close(obj);
502 struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY };
504 setrlimit(RLIMIT_MEMLOCK, &rinf);
511 test_pkt_md_access();
513 printf("Summary: %d PASSED, %d FAILED\n", pass_cnt, error_cnt);
514 return error_cnt ? EXIT_FAILURE : EXIT_SUCCESS;