test_progs.c 14 KB

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