test_select_reuseport.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700
  1. // SPDX-License-Identifier: GPL-2.0
  2. /* Copyright (c) 2018 Facebook */
  3. #include <stdlib.h>
  4. #include <unistd.h>
  5. #include <stdbool.h>
  6. #include <string.h>
  7. #include <errno.h>
  8. #include <assert.h>
  9. #include <fcntl.h>
  10. #include <linux/bpf.h>
  11. #include <linux/err.h>
  12. #include <linux/types.h>
  13. #include <linux/if_ether.h>
  14. #include <sys/types.h>
  15. #include <sys/epoll.h>
  16. #include <sys/socket.h>
  17. #include <netinet/in.h>
  18. #include <bpf/bpf.h>
  19. #include <bpf/libbpf.h>
  20. #include "bpf_rlimit.h"
  21. #include "bpf_util.h"
  22. #include "test_select_reuseport_common.h"
  23. #define MIN_TCPHDR_LEN 20
  24. #define UDPHDR_LEN 8
  25. #define TCP_SYNCOOKIE_SYSCTL "/proc/sys/net/ipv4/tcp_syncookies"
  26. #define TCP_FO_SYSCTL "/proc/sys/net/ipv4/tcp_fastopen"
  27. #define REUSEPORT_ARRAY_SIZE 32
  28. static int result_map, tmp_index_ovr_map, linum_map, data_check_map;
  29. static __u32 expected_results[NR_RESULTS];
  30. static int sk_fds[REUSEPORT_ARRAY_SIZE];
  31. static int reuseport_array, outer_map;
  32. static int select_by_skb_data_prog;
  33. static int saved_tcp_syncookie;
  34. static struct bpf_object *obj;
  35. static int saved_tcp_fo;
  36. static __u32 index_zero;
  37. static int epfd;
  38. static union sa46 {
  39. struct sockaddr_in6 v6;
  40. struct sockaddr_in v4;
  41. sa_family_t family;
  42. } srv_sa;
  43. #define CHECK(condition, tag, format...) ({ \
  44. int __ret = !!(condition); \
  45. if (__ret) { \
  46. printf("%s(%d):FAIL:%s ", __func__, __LINE__, tag); \
  47. printf(format); \
  48. exit(-1); \
  49. } \
  50. })
  51. static void create_maps(void)
  52. {
  53. struct bpf_create_map_attr attr = {};
  54. /* Creating reuseport_array */
  55. attr.name = "reuseport_array";
  56. attr.map_type = BPF_MAP_TYPE_REUSEPORT_SOCKARRAY;
  57. attr.key_size = sizeof(__u32);
  58. attr.value_size = sizeof(__u32);
  59. attr.max_entries = REUSEPORT_ARRAY_SIZE;
  60. reuseport_array = bpf_create_map_xattr(&attr);
  61. CHECK(reuseport_array == -1, "creating reuseport_array",
  62. "reuseport_array:%d errno:%d\n", reuseport_array, errno);
  63. /* Creating outer_map */
  64. attr.name = "outer_map";
  65. attr.map_type = BPF_MAP_TYPE_ARRAY_OF_MAPS;
  66. attr.key_size = sizeof(__u32);
  67. attr.value_size = sizeof(__u32);
  68. attr.max_entries = 1;
  69. attr.inner_map_fd = reuseport_array;
  70. outer_map = bpf_create_map_xattr(&attr);
  71. CHECK(outer_map == -1, "creating outer_map",
  72. "outer_map:%d errno:%d\n", outer_map, errno);
  73. }
  74. static void prepare_bpf_obj(void)
  75. {
  76. struct bpf_program *prog;
  77. struct bpf_map *map;
  78. int err;
  79. struct bpf_object_open_attr attr = {
  80. .file = "test_select_reuseport_kern.o",
  81. .prog_type = BPF_PROG_TYPE_SK_REUSEPORT,
  82. };
  83. obj = bpf_object__open_xattr(&attr);
  84. CHECK(IS_ERR_OR_NULL(obj), "open test_select_reuseport_kern.o",
  85. "obj:%p PTR_ERR(obj):%ld\n", obj, PTR_ERR(obj));
  86. prog = bpf_program__next(NULL, obj);
  87. CHECK(!prog, "get first bpf_program", "!prog\n");
  88. bpf_program__set_type(prog, attr.prog_type);
  89. map = bpf_object__find_map_by_name(obj, "outer_map");
  90. CHECK(!map, "find outer_map", "!map\n");
  91. err = bpf_map__reuse_fd(map, outer_map);
  92. CHECK(err, "reuse outer_map", "err:%d\n", err);
  93. err = bpf_object__load(obj);
  94. CHECK(err, "load bpf_object", "err:%d\n", err);
  95. select_by_skb_data_prog = bpf_program__fd(prog);
  96. CHECK(select_by_skb_data_prog == -1, "get prog fd",
  97. "select_by_skb_data_prog:%d\n", select_by_skb_data_prog);
  98. map = bpf_object__find_map_by_name(obj, "result_map");
  99. CHECK(!map, "find result_map", "!map\n");
  100. result_map = bpf_map__fd(map);
  101. CHECK(result_map == -1, "get result_map fd",
  102. "result_map:%d\n", result_map);
  103. map = bpf_object__find_map_by_name(obj, "tmp_index_ovr_map");
  104. CHECK(!map, "find tmp_index_ovr_map", "!map\n");
  105. tmp_index_ovr_map = bpf_map__fd(map);
  106. CHECK(tmp_index_ovr_map == -1, "get tmp_index_ovr_map fd",
  107. "tmp_index_ovr_map:%d\n", tmp_index_ovr_map);
  108. map = bpf_object__find_map_by_name(obj, "linum_map");
  109. CHECK(!map, "find linum_map", "!map\n");
  110. linum_map = bpf_map__fd(map);
  111. CHECK(linum_map == -1, "get linum_map fd",
  112. "linum_map:%d\n", linum_map);
  113. map = bpf_object__find_map_by_name(obj, "data_check_map");
  114. CHECK(!map, "find data_check_map", "!map\n");
  115. data_check_map = bpf_map__fd(map);
  116. CHECK(data_check_map == -1, "get data_check_map fd",
  117. "data_check_map:%d\n", data_check_map);
  118. }
  119. static void sa46_init_loopback(union sa46 *sa, sa_family_t family)
  120. {
  121. memset(sa, 0, sizeof(*sa));
  122. sa->family = family;
  123. if (sa->family == AF_INET6)
  124. sa->v6.sin6_addr = in6addr_loopback;
  125. else
  126. sa->v4.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
  127. }
  128. static void sa46_init_inany(union sa46 *sa, sa_family_t family)
  129. {
  130. memset(sa, 0, sizeof(*sa));
  131. sa->family = family;
  132. if (sa->family == AF_INET6)
  133. sa->v6.sin6_addr = in6addr_any;
  134. else
  135. sa->v4.sin_addr.s_addr = INADDR_ANY;
  136. }
  137. static int read_int_sysctl(const char *sysctl)
  138. {
  139. char buf[16];
  140. int fd, ret;
  141. fd = open(sysctl, 0);
  142. CHECK(fd == -1, "open(sysctl)", "sysctl:%s fd:%d errno:%d\n",
  143. sysctl, fd, errno);
  144. ret = read(fd, buf, sizeof(buf));
  145. CHECK(ret <= 0, "read(sysctl)", "sysctl:%s ret:%d errno:%d\n",
  146. sysctl, ret, errno);
  147. close(fd);
  148. return atoi(buf);
  149. }
  150. static void write_int_sysctl(const char *sysctl, int v)
  151. {
  152. int fd, ret, size;
  153. char buf[16];
  154. fd = open(sysctl, O_RDWR);
  155. CHECK(fd == -1, "open(sysctl)", "sysctl:%s fd:%d errno:%d\n",
  156. sysctl, fd, errno);
  157. size = snprintf(buf, sizeof(buf), "%d", v);
  158. ret = write(fd, buf, size);
  159. CHECK(ret != size, "write(sysctl)",
  160. "sysctl:%s ret:%d size:%d errno:%d\n", sysctl, ret, size, errno);
  161. close(fd);
  162. }
  163. static void restore_sysctls(void)
  164. {
  165. write_int_sysctl(TCP_FO_SYSCTL, saved_tcp_fo);
  166. write_int_sysctl(TCP_SYNCOOKIE_SYSCTL, saved_tcp_syncookie);
  167. }
  168. static void enable_fastopen(void)
  169. {
  170. int fo;
  171. fo = read_int_sysctl(TCP_FO_SYSCTL);
  172. write_int_sysctl(TCP_FO_SYSCTL, fo | 7);
  173. }
  174. static void enable_syncookie(void)
  175. {
  176. write_int_sysctl(TCP_SYNCOOKIE_SYSCTL, 2);
  177. }
  178. static void disable_syncookie(void)
  179. {
  180. write_int_sysctl(TCP_SYNCOOKIE_SYSCTL, 0);
  181. }
  182. static __u32 get_linum(void)
  183. {
  184. __u32 linum;
  185. int err;
  186. err = bpf_map_lookup_elem(linum_map, &index_zero, &linum);
  187. CHECK(err == -1, "lookup_elem(linum_map)", "err:%d errno:%d\n",
  188. err, errno);
  189. return linum;
  190. }
  191. static void check_data(int type, sa_family_t family, const struct cmd *cmd,
  192. int cli_fd)
  193. {
  194. struct data_check expected = {}, result;
  195. union sa46 cli_sa;
  196. socklen_t addrlen;
  197. int err;
  198. addrlen = sizeof(cli_sa);
  199. err = getsockname(cli_fd, (struct sockaddr *)&cli_sa,
  200. &addrlen);
  201. CHECK(err == -1, "getsockname(cli_fd)", "err:%d errno:%d\n",
  202. err, errno);
  203. err = bpf_map_lookup_elem(data_check_map, &index_zero, &result);
  204. CHECK(err == -1, "lookup_elem(data_check_map)", "err:%d errno:%d\n",
  205. err, errno);
  206. if (type == SOCK_STREAM) {
  207. expected.len = MIN_TCPHDR_LEN;
  208. expected.ip_protocol = IPPROTO_TCP;
  209. } else {
  210. expected.len = UDPHDR_LEN;
  211. expected.ip_protocol = IPPROTO_UDP;
  212. }
  213. if (family == AF_INET6) {
  214. expected.eth_protocol = htons(ETH_P_IPV6);
  215. expected.bind_inany = !srv_sa.v6.sin6_addr.s6_addr32[3] &&
  216. !srv_sa.v6.sin6_addr.s6_addr32[2] &&
  217. !srv_sa.v6.sin6_addr.s6_addr32[1] &&
  218. !srv_sa.v6.sin6_addr.s6_addr32[0];
  219. memcpy(&expected.skb_addrs[0], cli_sa.v6.sin6_addr.s6_addr32,
  220. sizeof(cli_sa.v6.sin6_addr));
  221. memcpy(&expected.skb_addrs[4], &in6addr_loopback,
  222. sizeof(in6addr_loopback));
  223. expected.skb_ports[0] = cli_sa.v6.sin6_port;
  224. expected.skb_ports[1] = srv_sa.v6.sin6_port;
  225. } else {
  226. expected.eth_protocol = htons(ETH_P_IP);
  227. expected.bind_inany = !srv_sa.v4.sin_addr.s_addr;
  228. expected.skb_addrs[0] = cli_sa.v4.sin_addr.s_addr;
  229. expected.skb_addrs[1] = htonl(INADDR_LOOPBACK);
  230. expected.skb_ports[0] = cli_sa.v4.sin_port;
  231. expected.skb_ports[1] = srv_sa.v4.sin_port;
  232. }
  233. if (memcmp(&result, &expected, offsetof(struct data_check,
  234. equal_check_end))) {
  235. printf("unexpected data_check\n");
  236. printf(" result: (0x%x, %u, %u)\n",
  237. result.eth_protocol, result.ip_protocol,
  238. result.bind_inany);
  239. printf("expected: (0x%x, %u, %u)\n",
  240. expected.eth_protocol, expected.ip_protocol,
  241. expected.bind_inany);
  242. CHECK(1, "data_check result != expected",
  243. "bpf_prog_linum:%u\n", get_linum());
  244. }
  245. CHECK(!result.hash, "data_check result.hash empty",
  246. "result.hash:%u", result.hash);
  247. expected.len += cmd ? sizeof(*cmd) : 0;
  248. if (type == SOCK_STREAM)
  249. CHECK(expected.len > result.len, "expected.len > result.len",
  250. "expected.len:%u result.len:%u bpf_prog_linum:%u\n",
  251. expected.len, result.len, get_linum());
  252. else
  253. CHECK(expected.len != result.len, "expected.len != result.len",
  254. "expected.len:%u result.len:%u bpf_prog_linum:%u\n",
  255. expected.len, result.len, get_linum());
  256. }
  257. static void check_results(void)
  258. {
  259. __u32 results[NR_RESULTS];
  260. __u32 i, broken = 0;
  261. int err;
  262. for (i = 0; i < NR_RESULTS; i++) {
  263. err = bpf_map_lookup_elem(result_map, &i, &results[i]);
  264. CHECK(err == -1, "lookup_elem(result_map)",
  265. "i:%u err:%d errno:%d\n", i, err, errno);
  266. }
  267. for (i = 0; i < NR_RESULTS; i++) {
  268. if (results[i] != expected_results[i]) {
  269. broken = i;
  270. break;
  271. }
  272. }
  273. if (i == NR_RESULTS)
  274. return;
  275. printf("unexpected result\n");
  276. printf(" result: [");
  277. printf("%u", results[0]);
  278. for (i = 1; i < NR_RESULTS; i++)
  279. printf(", %u", results[i]);
  280. printf("]\n");
  281. printf("expected: [");
  282. printf("%u", expected_results[0]);
  283. for (i = 1; i < NR_RESULTS; i++)
  284. printf(", %u", expected_results[i]);
  285. printf("]\n");
  286. CHECK(expected_results[broken] != results[broken],
  287. "unexpected result",
  288. "expected_results[%u] != results[%u] bpf_prog_linum:%u\n",
  289. broken, broken, get_linum());
  290. }
  291. static int send_data(int type, sa_family_t family, void *data, size_t len,
  292. enum result expected)
  293. {
  294. union sa46 cli_sa;
  295. int fd, err;
  296. fd = socket(family, type, 0);
  297. CHECK(fd == -1, "socket()", "fd:%d errno:%d\n", fd, errno);
  298. sa46_init_loopback(&cli_sa, family);
  299. err = bind(fd, (struct sockaddr *)&cli_sa, sizeof(cli_sa));
  300. CHECK(fd == -1, "bind(cli_sa)", "err:%d errno:%d\n", err, errno);
  301. err = sendto(fd, data, len, MSG_FASTOPEN, (struct sockaddr *)&srv_sa,
  302. sizeof(srv_sa));
  303. CHECK(err != len && expected >= PASS,
  304. "sendto()", "family:%u err:%d errno:%d expected:%d\n",
  305. family, err, errno, expected);
  306. return fd;
  307. }
  308. static void do_test(int type, sa_family_t family, struct cmd *cmd,
  309. enum result expected)
  310. {
  311. int nev, srv_fd, cli_fd;
  312. struct epoll_event ev;
  313. struct cmd rcv_cmd;
  314. ssize_t nread;
  315. cli_fd = send_data(type, family, cmd, cmd ? sizeof(*cmd) : 0,
  316. expected);
  317. nev = epoll_wait(epfd, &ev, 1, expected >= PASS ? 5 : 0);
  318. CHECK((nev <= 0 && expected >= PASS) ||
  319. (nev > 0 && expected < PASS),
  320. "nev <> expected",
  321. "nev:%d expected:%d type:%d family:%d data:(%d, %d)\n",
  322. nev, expected, type, family,
  323. cmd ? cmd->reuseport_index : -1,
  324. cmd ? cmd->pass_on_failure : -1);
  325. check_results();
  326. check_data(type, family, cmd, cli_fd);
  327. if (expected < PASS)
  328. return;
  329. CHECK(expected != PASS_ERR_SK_SELECT_REUSEPORT &&
  330. cmd->reuseport_index != ev.data.u32,
  331. "check cmd->reuseport_index",
  332. "cmd:(%u, %u) ev.data.u32:%u\n",
  333. cmd->pass_on_failure, cmd->reuseport_index, ev.data.u32);
  334. srv_fd = sk_fds[ev.data.u32];
  335. if (type == SOCK_STREAM) {
  336. int new_fd = accept(srv_fd, NULL, 0);
  337. CHECK(new_fd == -1, "accept(srv_fd)",
  338. "ev.data.u32:%u new_fd:%d errno:%d\n",
  339. ev.data.u32, new_fd, errno);
  340. nread = recv(new_fd, &rcv_cmd, sizeof(rcv_cmd), MSG_DONTWAIT);
  341. CHECK(nread != sizeof(rcv_cmd),
  342. "recv(new_fd)",
  343. "ev.data.u32:%u nread:%zd sizeof(rcv_cmd):%zu errno:%d\n",
  344. ev.data.u32, nread, sizeof(rcv_cmd), errno);
  345. close(new_fd);
  346. } else {
  347. nread = recv(srv_fd, &rcv_cmd, sizeof(rcv_cmd), MSG_DONTWAIT);
  348. CHECK(nread != sizeof(rcv_cmd),
  349. "recv(sk_fds)",
  350. "ev.data.u32:%u nread:%zd sizeof(rcv_cmd):%zu errno:%d\n",
  351. ev.data.u32, nread, sizeof(rcv_cmd), errno);
  352. }
  353. close(cli_fd);
  354. }
  355. static void test_err_inner_map(int type, sa_family_t family)
  356. {
  357. struct cmd cmd = {
  358. .reuseport_index = 0,
  359. .pass_on_failure = 0,
  360. };
  361. printf("%s: ", __func__);
  362. expected_results[DROP_ERR_INNER_MAP]++;
  363. do_test(type, family, &cmd, DROP_ERR_INNER_MAP);
  364. printf("OK\n");
  365. }
  366. static void test_err_skb_data(int type, sa_family_t family)
  367. {
  368. printf("%s: ", __func__);
  369. expected_results[DROP_ERR_SKB_DATA]++;
  370. do_test(type, family, NULL, DROP_ERR_SKB_DATA);
  371. printf("OK\n");
  372. }
  373. static void test_err_sk_select_port(int type, sa_family_t family)
  374. {
  375. struct cmd cmd = {
  376. .reuseport_index = REUSEPORT_ARRAY_SIZE,
  377. .pass_on_failure = 0,
  378. };
  379. printf("%s: ", __func__);
  380. expected_results[DROP_ERR_SK_SELECT_REUSEPORT]++;
  381. do_test(type, family, &cmd, DROP_ERR_SK_SELECT_REUSEPORT);
  382. printf("OK\n");
  383. }
  384. static void test_pass(int type, sa_family_t family)
  385. {
  386. struct cmd cmd;
  387. int i;
  388. printf("%s: ", __func__);
  389. cmd.pass_on_failure = 0;
  390. for (i = 0; i < REUSEPORT_ARRAY_SIZE; i++) {
  391. expected_results[PASS]++;
  392. cmd.reuseport_index = i;
  393. do_test(type, family, &cmd, PASS);
  394. }
  395. printf("OK\n");
  396. }
  397. static void test_syncookie(int type, sa_family_t family)
  398. {
  399. int err, tmp_index = 1;
  400. struct cmd cmd = {
  401. .reuseport_index = 0,
  402. .pass_on_failure = 0,
  403. };
  404. if (type != SOCK_STREAM)
  405. return;
  406. printf("%s: ", __func__);
  407. /*
  408. * +1 for TCP-SYN and
  409. * +1 for the TCP-ACK (ack the syncookie)
  410. */
  411. expected_results[PASS] += 2;
  412. enable_syncookie();
  413. /*
  414. * Simulate TCP-SYN and TCP-ACK are handled by two different sk:
  415. * TCP-SYN: select sk_fds[tmp_index = 1] tmp_index is from the
  416. * tmp_index_ovr_map
  417. * TCP-ACK: select sk_fds[reuseport_index = 0] reuseport_index
  418. * is from the cmd.reuseport_index
  419. */
  420. err = bpf_map_update_elem(tmp_index_ovr_map, &index_zero,
  421. &tmp_index, BPF_ANY);
  422. CHECK(err == -1, "update_elem(tmp_index_ovr_map, 0, 1)",
  423. "err:%d errno:%d\n", err, errno);
  424. do_test(type, family, &cmd, PASS);
  425. err = bpf_map_lookup_elem(tmp_index_ovr_map, &index_zero,
  426. &tmp_index);
  427. CHECK(err == -1 || tmp_index != -1,
  428. "lookup_elem(tmp_index_ovr_map)",
  429. "err:%d errno:%d tmp_index:%d\n",
  430. err, errno, tmp_index);
  431. disable_syncookie();
  432. printf("OK\n");
  433. }
  434. static void test_pass_on_err(int type, sa_family_t family)
  435. {
  436. struct cmd cmd = {
  437. .reuseport_index = REUSEPORT_ARRAY_SIZE,
  438. .pass_on_failure = 1,
  439. };
  440. printf("%s: ", __func__);
  441. expected_results[PASS_ERR_SK_SELECT_REUSEPORT] += 1;
  442. do_test(type, family, &cmd, PASS_ERR_SK_SELECT_REUSEPORT);
  443. printf("OK\n");
  444. }
  445. static void prepare_sk_fds(int type, sa_family_t family, bool inany)
  446. {
  447. const int first = REUSEPORT_ARRAY_SIZE - 1;
  448. int i, err, optval = 1;
  449. struct epoll_event ev;
  450. socklen_t addrlen;
  451. if (inany)
  452. sa46_init_inany(&srv_sa, family);
  453. else
  454. sa46_init_loopback(&srv_sa, family);
  455. addrlen = sizeof(srv_sa);
  456. /*
  457. * The sk_fds[] is filled from the back such that the order
  458. * is exactly opposite to the (struct sock_reuseport *)reuse->socks[].
  459. */
  460. for (i = first; i >= 0; i--) {
  461. sk_fds[i] = socket(family, type, 0);
  462. CHECK(sk_fds[i] == -1, "socket()", "sk_fds[%d]:%d errno:%d\n",
  463. i, sk_fds[i], errno);
  464. err = setsockopt(sk_fds[i], SOL_SOCKET, SO_REUSEPORT,
  465. &optval, sizeof(optval));
  466. CHECK(err == -1, "setsockopt(SO_REUSEPORT)",
  467. "sk_fds[%d] err:%d errno:%d\n",
  468. i, err, errno);
  469. if (i == first) {
  470. err = setsockopt(sk_fds[i], SOL_SOCKET,
  471. SO_ATTACH_REUSEPORT_EBPF,
  472. &select_by_skb_data_prog,
  473. sizeof(select_by_skb_data_prog));
  474. CHECK(err == -1, "setsockopt(SO_ATTACH_REUEPORT_EBPF)",
  475. "err:%d errno:%d\n", err, errno);
  476. }
  477. err = bind(sk_fds[i], (struct sockaddr *)&srv_sa, addrlen);
  478. CHECK(err == -1, "bind()", "sk_fds[%d] err:%d errno:%d\n",
  479. i, err, errno);
  480. if (type == SOCK_STREAM) {
  481. err = listen(sk_fds[i], 10);
  482. CHECK(err == -1, "listen()",
  483. "sk_fds[%d] err:%d errno:%d\n",
  484. i, err, errno);
  485. }
  486. err = bpf_map_update_elem(reuseport_array, &i, &sk_fds[i],
  487. BPF_NOEXIST);
  488. CHECK(err == -1, "update_elem(reuseport_array)",
  489. "sk_fds[%d] err:%d errno:%d\n", i, err, errno);
  490. if (i == first) {
  491. socklen_t addrlen = sizeof(srv_sa);
  492. err = getsockname(sk_fds[i], (struct sockaddr *)&srv_sa,
  493. &addrlen);
  494. CHECK(err == -1, "getsockname()",
  495. "sk_fds[%d] err:%d errno:%d\n", i, err, errno);
  496. }
  497. }
  498. epfd = epoll_create(1);
  499. CHECK(epfd == -1, "epoll_create(1)",
  500. "epfd:%d errno:%d\n", epfd, errno);
  501. ev.events = EPOLLIN;
  502. for (i = 0; i < REUSEPORT_ARRAY_SIZE; i++) {
  503. ev.data.u32 = i;
  504. err = epoll_ctl(epfd, EPOLL_CTL_ADD, sk_fds[i], &ev);
  505. CHECK(err, "epoll_ctl(EPOLL_CTL_ADD)", "sk_fds[%d]\n", i);
  506. }
  507. }
  508. static void setup_per_test(int type, unsigned short family, bool inany)
  509. {
  510. int ovr = -1, err;
  511. prepare_sk_fds(type, family, inany);
  512. err = bpf_map_update_elem(tmp_index_ovr_map, &index_zero, &ovr,
  513. BPF_ANY);
  514. CHECK(err == -1, "update_elem(tmp_index_ovr_map, 0, -1)",
  515. "err:%d errno:%d\n", err, errno);
  516. }
  517. static void cleanup_per_test(void)
  518. {
  519. int i, err, zero = 0;
  520. memset(expected_results, 0, sizeof(expected_results));
  521. for (i = 0; i < NR_RESULTS; i++) {
  522. err = bpf_map_update_elem(result_map, &i, &zero, BPF_ANY);
  523. CHECK(err, "reset elem in result_map",
  524. "i:%u err:%d errno:%d\n", i, err, errno);
  525. }
  526. err = bpf_map_update_elem(linum_map, &zero, &zero, BPF_ANY);
  527. CHECK(err, "reset line number in linum_map", "err:%d errno:%d\n",
  528. err, errno);
  529. for (i = 0; i < REUSEPORT_ARRAY_SIZE; i++)
  530. close(sk_fds[i]);
  531. close(epfd);
  532. err = bpf_map_delete_elem(outer_map, &index_zero);
  533. CHECK(err == -1, "delete_elem(outer_map)",
  534. "err:%d errno:%d\n", err, errno);
  535. }
  536. static void cleanup(void)
  537. {
  538. close(outer_map);
  539. close(reuseport_array);
  540. bpf_object__close(obj);
  541. }
  542. static void test_all(void)
  543. {
  544. /* Extra SOCK_STREAM to test bind_inany==true */
  545. const int types[] = { SOCK_STREAM, SOCK_DGRAM, SOCK_STREAM };
  546. const char * const type_strings[] = { "TCP", "UDP", "TCP" };
  547. const char * const family_strings[] = { "IPv6", "IPv4" };
  548. const unsigned short families[] = { AF_INET6, AF_INET };
  549. const bool bind_inany[] = { false, false, true };
  550. int t, f, err;
  551. for (f = 0; f < ARRAY_SIZE(families); f++) {
  552. unsigned short family = families[f];
  553. for (t = 0; t < ARRAY_SIZE(types); t++) {
  554. bool inany = bind_inany[t];
  555. int type = types[t];
  556. printf("######## %s/%s %s ########\n",
  557. family_strings[f], type_strings[t],
  558. inany ? " INANY " : "LOOPBACK");
  559. setup_per_test(type, family, inany);
  560. test_err_inner_map(type, family);
  561. /* Install reuseport_array to the outer_map */
  562. err = bpf_map_update_elem(outer_map, &index_zero,
  563. &reuseport_array, BPF_ANY);
  564. CHECK(err == -1, "update_elem(outer_map)",
  565. "err:%d errno:%d\n", err, errno);
  566. test_err_skb_data(type, family);
  567. test_err_sk_select_port(type, family);
  568. test_pass(type, family);
  569. test_syncookie(type, family);
  570. test_pass_on_err(type, family);
  571. cleanup_per_test();
  572. printf("\n");
  573. }
  574. }
  575. }
  576. int main(int argc, const char **argv)
  577. {
  578. create_maps();
  579. prepare_bpf_obj();
  580. saved_tcp_fo = read_int_sysctl(TCP_FO_SYSCTL);
  581. saved_tcp_syncookie = read_int_sysctl(TCP_SYNCOOKIE_SYSCTL);
  582. enable_fastopen();
  583. disable_syncookie();
  584. atexit(restore_sysctls);
  585. test_all();
  586. cleanup();
  587. return 0;
  588. }