test_progs.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526
  1. /* Copyright (c) 2017 Facebook
  2. *
  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.
  6. */
  7. #include <stdio.h>
  8. #include <unistd.h>
  9. #include <errno.h>
  10. #include <string.h>
  11. #include <assert.h>
  12. #include <stdlib.h>
  13. #include <linux/types.h>
  14. typedef __u16 __sum16;
  15. #include <arpa/inet.h>
  16. #include <linux/if_ether.h>
  17. #include <linux/if_packet.h>
  18. #include <linux/ip.h>
  19. #include <linux/ipv6.h>
  20. #include <linux/tcp.h>
  21. #include <sys/wait.h>
  22. #include <sys/resource.h>
  23. #include <sys/types.h>
  24. #include <fcntl.h>
  25. #include <linux/bpf.h>
  26. #include <linux/err.h>
  27. #include <bpf/bpf.h>
  28. #include <bpf/libbpf.h>
  29. #include "test_iptunnel_common.h"
  30. #include "bpf_util.h"
  31. #include "bpf_endian.h"
  32. static int error_cnt, pass_cnt;
  33. #define MAGIC_BYTES 123
  34. /* ipv4 test vector */
  35. static struct {
  36. struct ethhdr eth;
  37. struct iphdr iph;
  38. struct tcphdr tcp;
  39. } __packed pkt_v4 = {
  40. .eth.h_proto = bpf_htons(ETH_P_IP),
  41. .iph.ihl = 5,
  42. .iph.protocol = 6,
  43. .iph.tot_len = bpf_htons(MAGIC_BYTES),
  44. .tcp.urg_ptr = 123,
  45. };
  46. /* ipv6 test vector */
  47. static struct {
  48. struct ethhdr eth;
  49. struct ipv6hdr iph;
  50. struct tcphdr tcp;
  51. } __packed pkt_v6 = {
  52. .eth.h_proto = bpf_htons(ETH_P_IPV6),
  53. .iph.nexthdr = 6,
  54. .iph.payload_len = bpf_htons(MAGIC_BYTES),
  55. .tcp.urg_ptr = 123,
  56. };
  57. #define CHECK(condition, tag, format...) ({ \
  58. int __ret = !!(condition); \
  59. if (__ret) { \
  60. error_cnt++; \
  61. printf("%s:FAIL:%s ", __func__, tag); \
  62. printf(format); \
  63. } else { \
  64. pass_cnt++; \
  65. printf("%s:PASS:%s %d nsec\n", __func__, tag, duration);\
  66. } \
  67. __ret; \
  68. })
  69. static int bpf_prog_load(const char *file, enum bpf_prog_type type,
  70. struct bpf_object **pobj, int *prog_fd)
  71. {
  72. struct bpf_program *prog;
  73. struct bpf_object *obj;
  74. int err;
  75. obj = bpf_object__open(file);
  76. if (IS_ERR(obj)) {
  77. error_cnt++;
  78. return -ENOENT;
  79. }
  80. prog = bpf_program__next(NULL, obj);
  81. if (!prog) {
  82. bpf_object__close(obj);
  83. error_cnt++;
  84. return -ENOENT;
  85. }
  86. bpf_program__set_type(prog, type);
  87. err = bpf_object__load(obj);
  88. if (err) {
  89. bpf_object__close(obj);
  90. error_cnt++;
  91. return -EINVAL;
  92. }
  93. *pobj = obj;
  94. *prog_fd = bpf_program__fd(prog);
  95. return 0;
  96. }
  97. static int bpf_find_map(const char *test, struct bpf_object *obj,
  98. const char *name)
  99. {
  100. struct bpf_map *map;
  101. map = bpf_object__find_map_by_name(obj, name);
  102. if (!map) {
  103. printf("%s:FAIL:map '%s' not found\n", test, name);
  104. error_cnt++;
  105. return -1;
  106. }
  107. return bpf_map__fd(map);
  108. }
  109. static void test_pkt_access(void)
  110. {
  111. const char *file = "./test_pkt_access.o";
  112. struct bpf_object *obj;
  113. __u32 duration, retval;
  114. int err, prog_fd;
  115. err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
  116. if (err)
  117. return;
  118. err = bpf_prog_test_run(prog_fd, 100000, &pkt_v4, sizeof(pkt_v4),
  119. NULL, NULL, &retval, &duration);
  120. CHECK(err || errno || retval, "ipv4",
  121. "err %d errno %d retval %d duration %d\n",
  122. err, errno, retval, duration);
  123. err = bpf_prog_test_run(prog_fd, 100000, &pkt_v6, sizeof(pkt_v6),
  124. NULL, NULL, &retval, &duration);
  125. CHECK(err || errno || retval, "ipv6",
  126. "err %d errno %d retval %d duration %d\n",
  127. err, errno, retval, duration);
  128. bpf_object__close(obj);
  129. }
  130. static void test_xdp(void)
  131. {
  132. struct vip key4 = {.protocol = 6, .family = AF_INET};
  133. struct vip key6 = {.protocol = 6, .family = AF_INET6};
  134. struct iptnl_info value4 = {.family = AF_INET};
  135. struct iptnl_info value6 = {.family = AF_INET6};
  136. const char *file = "./test_xdp.o";
  137. struct bpf_object *obj;
  138. char buf[128];
  139. struct ipv6hdr *iph6 = (void *)buf + sizeof(struct ethhdr);
  140. struct iphdr *iph = (void *)buf + sizeof(struct ethhdr);
  141. __u32 duration, retval, size;
  142. int err, prog_fd, map_fd;
  143. err = bpf_prog_load(file, BPF_PROG_TYPE_XDP, &obj, &prog_fd);
  144. if (err)
  145. return;
  146. map_fd = bpf_find_map(__func__, obj, "vip2tnl");
  147. if (map_fd < 0)
  148. goto out;
  149. bpf_map_update_elem(map_fd, &key4, &value4, 0);
  150. bpf_map_update_elem(map_fd, &key6, &value6, 0);
  151. err = bpf_prog_test_run(prog_fd, 1, &pkt_v4, sizeof(pkt_v4),
  152. buf, &size, &retval, &duration);
  153. CHECK(err || errno || retval != XDP_TX || size != 74 ||
  154. iph->protocol != IPPROTO_IPIP, "ipv4",
  155. "err %d errno %d retval %d size %d\n",
  156. err, errno, retval, size);
  157. err = bpf_prog_test_run(prog_fd, 1, &pkt_v6, sizeof(pkt_v6),
  158. buf, &size, &retval, &duration);
  159. CHECK(err || errno || retval != XDP_TX || size != 114 ||
  160. iph6->nexthdr != IPPROTO_IPV6, "ipv6",
  161. "err %d errno %d retval %d size %d\n",
  162. err, errno, retval, size);
  163. out:
  164. bpf_object__close(obj);
  165. }
  166. #define MAGIC_VAL 0x1234
  167. #define NUM_ITER 100000
  168. #define VIP_NUM 5
  169. static void test_l4lb(void)
  170. {
  171. unsigned int nr_cpus = bpf_num_possible_cpus();
  172. const char *file = "./test_l4lb.o";
  173. struct vip key = {.protocol = 6};
  174. struct vip_meta {
  175. __u32 flags;
  176. __u32 vip_num;
  177. } value = {.vip_num = VIP_NUM};
  178. __u32 stats_key = VIP_NUM;
  179. struct vip_stats {
  180. __u64 bytes;
  181. __u64 pkts;
  182. } stats[nr_cpus];
  183. struct real_definition {
  184. union {
  185. __be32 dst;
  186. __be32 dstv6[4];
  187. };
  188. __u8 flags;
  189. } real_def = {.dst = MAGIC_VAL};
  190. __u32 ch_key = 11, real_num = 3;
  191. __u32 duration, retval, size;
  192. int err, i, prog_fd, map_fd;
  193. __u64 bytes = 0, pkts = 0;
  194. struct bpf_object *obj;
  195. char buf[128];
  196. u32 *magic = (u32 *)buf;
  197. err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
  198. if (err)
  199. return;
  200. map_fd = bpf_find_map(__func__, obj, "vip_map");
  201. if (map_fd < 0)
  202. goto out;
  203. bpf_map_update_elem(map_fd, &key, &value, 0);
  204. map_fd = bpf_find_map(__func__, obj, "ch_rings");
  205. if (map_fd < 0)
  206. goto out;
  207. bpf_map_update_elem(map_fd, &ch_key, &real_num, 0);
  208. map_fd = bpf_find_map(__func__, obj, "reals");
  209. if (map_fd < 0)
  210. goto out;
  211. bpf_map_update_elem(map_fd, &real_num, &real_def, 0);
  212. err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v4, sizeof(pkt_v4),
  213. buf, &size, &retval, &duration);
  214. CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 54 ||
  215. *magic != MAGIC_VAL, "ipv4",
  216. "err %d errno %d retval %d size %d magic %x\n",
  217. err, errno, retval, size, *magic);
  218. err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v6, sizeof(pkt_v6),
  219. buf, &size, &retval, &duration);
  220. CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 74 ||
  221. *magic != MAGIC_VAL, "ipv6",
  222. "err %d errno %d retval %d size %d magic %x\n",
  223. err, errno, retval, size, *magic);
  224. map_fd = bpf_find_map(__func__, obj, "stats");
  225. if (map_fd < 0)
  226. goto out;
  227. bpf_map_lookup_elem(map_fd, &stats_key, stats);
  228. for (i = 0; i < nr_cpus; i++) {
  229. bytes += stats[i].bytes;
  230. pkts += stats[i].pkts;
  231. }
  232. if (bytes != MAGIC_BYTES * NUM_ITER * 2 || pkts != NUM_ITER * 2) {
  233. error_cnt++;
  234. printf("test_l4lb:FAIL:stats %lld %lld\n", bytes, pkts);
  235. }
  236. out:
  237. bpf_object__close(obj);
  238. }
  239. static void test_tcp_estats(void)
  240. {
  241. const char *file = "./test_tcp_estats.o";
  242. int err, prog_fd;
  243. struct bpf_object *obj;
  244. __u32 duration = 0;
  245. err = bpf_prog_load(file, BPF_PROG_TYPE_TRACEPOINT, &obj, &prog_fd);
  246. CHECK(err, "", "err %d errno %d\n", err, errno);
  247. if (err)
  248. return;
  249. bpf_object__close(obj);
  250. }
  251. static inline __u64 ptr_to_u64(const void *ptr)
  252. {
  253. return (__u64) (unsigned long) ptr;
  254. }
  255. static void test_bpf_obj_id(void)
  256. {
  257. const __u64 array_magic_value = 0xfaceb00c;
  258. const __u32 array_key = 0;
  259. const int nr_iters = 2;
  260. const char *file = "./test_obj_id.o";
  261. const char *jit_sysctl = "/proc/sys/net/core/bpf_jit_enable";
  262. struct bpf_object *objs[nr_iters];
  263. int prog_fds[nr_iters], map_fds[nr_iters];
  264. /* +1 to test for the info_len returned by kernel */
  265. struct bpf_prog_info prog_infos[nr_iters + 1];
  266. struct bpf_map_info map_infos[nr_iters + 1];
  267. char jited_insns[128], xlated_insns[128];
  268. __u32 i, next_id, info_len, nr_id_found, duration = 0;
  269. int sysctl_fd, jit_enabled = 0, err = 0;
  270. __u64 array_value;
  271. sysctl_fd = open(jit_sysctl, 0, O_RDONLY);
  272. if (sysctl_fd != -1) {
  273. char tmpc;
  274. if (read(sysctl_fd, &tmpc, sizeof(tmpc)) == 1)
  275. jit_enabled = (tmpc != '0');
  276. close(sysctl_fd);
  277. }
  278. err = bpf_prog_get_fd_by_id(0);
  279. CHECK(err >= 0 || errno != ENOENT,
  280. "get-fd-by-notexist-prog-id", "err %d errno %d\n", err, errno);
  281. err = bpf_map_get_fd_by_id(0);
  282. CHECK(err >= 0 || errno != ENOENT,
  283. "get-fd-by-notexist-map-id", "err %d errno %d\n", err, errno);
  284. for (i = 0; i < nr_iters; i++)
  285. objs[i] = NULL;
  286. /* Check bpf_obj_get_info_by_fd() */
  287. for (i = 0; i < nr_iters; i++) {
  288. err = bpf_prog_load(file, BPF_PROG_TYPE_SOCKET_FILTER,
  289. &objs[i], &prog_fds[i]);
  290. /* test_obj_id.o is a dumb prog. It should never fail
  291. * to load.
  292. */
  293. assert(!err);
  294. /* Check getting prog info */
  295. info_len = sizeof(struct bpf_prog_info) * 2;
  296. bzero(&prog_infos[i], info_len);
  297. prog_infos[i].jited_prog_insns = ptr_to_u64(jited_insns);
  298. prog_infos[i].jited_prog_len = sizeof(jited_insns);
  299. prog_infos[i].xlated_prog_insns = ptr_to_u64(xlated_insns);
  300. prog_infos[i].xlated_prog_len = sizeof(xlated_insns);
  301. err = bpf_obj_get_info_by_fd(prog_fds[i], &prog_infos[i],
  302. &info_len);
  303. if (CHECK(err ||
  304. prog_infos[i].type != BPF_PROG_TYPE_SOCKET_FILTER ||
  305. info_len != sizeof(struct bpf_prog_info) ||
  306. (jit_enabled && !prog_infos[i].jited_prog_len) ||
  307. !prog_infos[i].xlated_prog_len,
  308. "get-prog-info(fd)",
  309. "err %d errno %d i %d type %d(%d) info_len %u(%lu) jit_enabled %d jited_prog_len %u xlated_prog_len %u\n",
  310. err, errno, i,
  311. prog_infos[i].type, BPF_PROG_TYPE_SOCKET_FILTER,
  312. info_len, sizeof(struct bpf_prog_info),
  313. jit_enabled,
  314. prog_infos[i].jited_prog_len,
  315. prog_infos[i].xlated_prog_len))
  316. goto done;
  317. map_fds[i] = bpf_find_map(__func__, objs[i], "test_map_id");
  318. assert(map_fds[i] >= 0);
  319. err = bpf_map_update_elem(map_fds[i], &array_key,
  320. &array_magic_value, 0);
  321. assert(!err);
  322. /* Check getting map info */
  323. info_len = sizeof(struct bpf_map_info) * 2;
  324. bzero(&map_infos[i], info_len);
  325. err = bpf_obj_get_info_by_fd(map_fds[i], &map_infos[i],
  326. &info_len);
  327. if (CHECK(err ||
  328. map_infos[i].type != BPF_MAP_TYPE_ARRAY ||
  329. map_infos[i].key_size != sizeof(__u32) ||
  330. map_infos[i].value_size != sizeof(__u64) ||
  331. map_infos[i].max_entries != 1 ||
  332. map_infos[i].map_flags != 0 ||
  333. info_len != sizeof(struct bpf_map_info),
  334. "get-map-info(fd)",
  335. "err %d errno %d type %d(%d) info_len %u(%lu) key_size %u value_size %u max_entries %u map_flags %X\n",
  336. err, errno,
  337. map_infos[i].type, BPF_MAP_TYPE_ARRAY,
  338. info_len, sizeof(struct bpf_map_info),
  339. map_infos[i].key_size,
  340. map_infos[i].value_size,
  341. map_infos[i].max_entries,
  342. map_infos[i].map_flags))
  343. goto done;
  344. }
  345. /* Check bpf_prog_get_next_id() */
  346. nr_id_found = 0;
  347. next_id = 0;
  348. while (!bpf_prog_get_next_id(next_id, &next_id)) {
  349. struct bpf_prog_info prog_info = {};
  350. int prog_fd;
  351. info_len = sizeof(prog_info);
  352. prog_fd = bpf_prog_get_fd_by_id(next_id);
  353. if (prog_fd < 0 && errno == ENOENT)
  354. /* The bpf_prog is in the dead row */
  355. continue;
  356. if (CHECK(prog_fd < 0, "get-prog-fd(next_id)",
  357. "prog_fd %d next_id %d errno %d\n",
  358. prog_fd, next_id, errno))
  359. break;
  360. for (i = 0; i < nr_iters; i++)
  361. if (prog_infos[i].id == next_id)
  362. break;
  363. if (i == nr_iters)
  364. continue;
  365. nr_id_found++;
  366. err = bpf_obj_get_info_by_fd(prog_fd, &prog_info, &info_len);
  367. prog_infos[i].jited_prog_insns = 0;
  368. prog_infos[i].xlated_prog_insns = 0;
  369. CHECK(err || info_len != sizeof(struct bpf_prog_info) ||
  370. memcmp(&prog_info, &prog_infos[i], info_len),
  371. "get-prog-info(next_id->fd)",
  372. "err %d errno %d info_len %u(%lu) memcmp %d\n",
  373. err, errno, info_len, sizeof(struct bpf_prog_info),
  374. memcmp(&prog_info, &prog_infos[i], info_len));
  375. close(prog_fd);
  376. }
  377. CHECK(nr_id_found != nr_iters,
  378. "check total prog id found by get_next_id",
  379. "nr_id_found %u(%u)\n",
  380. nr_id_found, nr_iters);
  381. /* Check bpf_map_get_next_id() */
  382. nr_id_found = 0;
  383. next_id = 0;
  384. while (!bpf_map_get_next_id(next_id, &next_id)) {
  385. struct bpf_map_info map_info = {};
  386. int map_fd;
  387. info_len = sizeof(map_info);
  388. map_fd = bpf_map_get_fd_by_id(next_id);
  389. if (map_fd < 0 && errno == ENOENT)
  390. /* The bpf_map is in the dead row */
  391. continue;
  392. if (CHECK(map_fd < 0, "get-map-fd(next_id)",
  393. "map_fd %d next_id %u errno %d\n",
  394. map_fd, next_id, errno))
  395. break;
  396. for (i = 0; i < nr_iters; i++)
  397. if (map_infos[i].id == next_id)
  398. break;
  399. if (i == nr_iters)
  400. continue;
  401. nr_id_found++;
  402. err = bpf_map_lookup_elem(map_fd, &array_key, &array_value);
  403. assert(!err);
  404. err = bpf_obj_get_info_by_fd(map_fd, &map_info, &info_len);
  405. CHECK(err || info_len != sizeof(struct bpf_map_info) ||
  406. memcmp(&map_info, &map_infos[i], info_len) ||
  407. array_value != array_magic_value,
  408. "check get-map-info(next_id->fd)",
  409. "err %d errno %d info_len %u(%lu) memcmp %d array_value %llu(%llu)\n",
  410. err, errno, info_len, sizeof(struct bpf_map_info),
  411. memcmp(&map_info, &map_infos[i], info_len),
  412. array_value, array_magic_value);
  413. close(map_fd);
  414. }
  415. CHECK(nr_id_found != nr_iters,
  416. "check total map id found by get_next_id",
  417. "nr_id_found %u(%u)\n",
  418. nr_id_found, nr_iters);
  419. done:
  420. for (i = 0; i < nr_iters; i++)
  421. bpf_object__close(objs[i]);
  422. }
  423. static void test_pkt_md_access(void)
  424. {
  425. const char *file = "./test_pkt_md_access.o";
  426. struct bpf_object *obj;
  427. __u32 duration, retval;
  428. int err, prog_fd;
  429. err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd);
  430. if (err)
  431. return;
  432. err = bpf_prog_test_run(prog_fd, 10, &pkt_v4, sizeof(pkt_v4),
  433. NULL, NULL, &retval, &duration);
  434. CHECK(err || retval, "",
  435. "err %d errno %d retval %d duration %d\n",
  436. err, errno, retval, duration);
  437. bpf_object__close(obj);
  438. }
  439. int main(void)
  440. {
  441. struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY };
  442. setrlimit(RLIMIT_MEMLOCK, &rinf);
  443. test_pkt_access();
  444. test_xdp();
  445. test_l4lb();
  446. test_tcp_estats();
  447. test_bpf_obj_id();
  448. test_pkt_md_access();
  449. printf("Summary: %d PASSED, %d FAILED\n", pass_cnt, error_cnt);
  450. return error_cnt ? EXIT_FAILURE : EXIT_SUCCESS;
  451. }