PageRenderTime 28ms CodeModel.GetById 25ms RepoModel.GetById 1ms app.codeStats 0ms

/tools/testing/selftests/bpf/test_sockmap_kern.h

https://gitlab.com/kush/linux
C Header | 458 lines | 392 code | 52 blank | 14 comment | 65 complexity | 1253997434294f4ae7d89a630cdd706c MD5 | raw file
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /* Copyright (c) 2017-2018 Covalent IO, Inc. http://covalent.io */
  3. #include <stddef.h>
  4. #include <string.h>
  5. #include <linux/bpf.h>
  6. #include <linux/if_ether.h>
  7. #include <linux/if_packet.h>
  8. #include <linux/ip.h>
  9. #include <linux/ipv6.h>
  10. #include <linux/in.h>
  11. #include <linux/udp.h>
  12. #include <linux/tcp.h>
  13. #include <linux/pkt_cls.h>
  14. #include <sys/socket.h>
  15. #include "bpf_helpers.h"
  16. #include "bpf_endian.h"
  17. /* Sockmap sample program connects a client and a backend together
  18. * using cgroups.
  19. *
  20. * client:X <---> frontend:80 client:X <---> backend:80
  21. *
  22. * For simplicity we hard code values here and bind 1:1. The hard
  23. * coded values are part of the setup in sockmap.sh script that
  24. * is associated with this BPF program.
  25. *
  26. * The bpf_printk is verbose and prints information as connections
  27. * are established and verdicts are decided.
  28. */
  29. #define bpf_printk(fmt, ...) \
  30. ({ \
  31. char ____fmt[] = fmt; \
  32. bpf_trace_printk(____fmt, sizeof(____fmt), \
  33. ##__VA_ARGS__); \
  34. })
  35. struct bpf_map_def SEC("maps") sock_map = {
  36. .type = TEST_MAP_TYPE,
  37. .key_size = sizeof(int),
  38. .value_size = sizeof(int),
  39. .max_entries = 20,
  40. };
  41. struct bpf_map_def SEC("maps") sock_map_txmsg = {
  42. .type = TEST_MAP_TYPE,
  43. .key_size = sizeof(int),
  44. .value_size = sizeof(int),
  45. .max_entries = 20,
  46. };
  47. struct bpf_map_def SEC("maps") sock_map_redir = {
  48. .type = TEST_MAP_TYPE,
  49. .key_size = sizeof(int),
  50. .value_size = sizeof(int),
  51. .max_entries = 20,
  52. };
  53. struct bpf_map_def SEC("maps") sock_apply_bytes = {
  54. .type = BPF_MAP_TYPE_ARRAY,
  55. .key_size = sizeof(int),
  56. .value_size = sizeof(int),
  57. .max_entries = 1
  58. };
  59. struct bpf_map_def SEC("maps") sock_cork_bytes = {
  60. .type = BPF_MAP_TYPE_ARRAY,
  61. .key_size = sizeof(int),
  62. .value_size = sizeof(int),
  63. .max_entries = 1
  64. };
  65. struct bpf_map_def SEC("maps") sock_bytes = {
  66. .type = BPF_MAP_TYPE_ARRAY,
  67. .key_size = sizeof(int),
  68. .value_size = sizeof(int),
  69. .max_entries = 6
  70. };
  71. struct bpf_map_def SEC("maps") sock_redir_flags = {
  72. .type = BPF_MAP_TYPE_ARRAY,
  73. .key_size = sizeof(int),
  74. .value_size = sizeof(int),
  75. .max_entries = 1
  76. };
  77. struct bpf_map_def SEC("maps") sock_skb_opts = {
  78. .type = BPF_MAP_TYPE_ARRAY,
  79. .key_size = sizeof(int),
  80. .value_size = sizeof(int),
  81. .max_entries = 1
  82. };
  83. SEC("sk_skb1")
  84. int bpf_prog1(struct __sk_buff *skb)
  85. {
  86. return skb->len;
  87. }
  88. SEC("sk_skb2")
  89. int bpf_prog2(struct __sk_buff *skb)
  90. {
  91. __u32 lport = skb->local_port;
  92. __u32 rport = skb->remote_port;
  93. int len, *f, ret, zero = 0;
  94. __u64 flags = 0;
  95. if (lport == 10000)
  96. ret = 10;
  97. else
  98. ret = 1;
  99. len = (__u32)skb->data_end - (__u32)skb->data;
  100. f = bpf_map_lookup_elem(&sock_skb_opts, &zero);
  101. if (f && *f) {
  102. ret = 3;
  103. flags = *f;
  104. }
  105. bpf_printk("sk_skb2: redirect(%iB) flags=%i\n",
  106. len, flags);
  107. #ifdef SOCKMAP
  108. return bpf_sk_redirect_map(skb, &sock_map, ret, flags);
  109. #else
  110. return bpf_sk_redirect_hash(skb, &sock_map, &ret, flags);
  111. #endif
  112. }
  113. SEC("sockops")
  114. int bpf_sockmap(struct bpf_sock_ops *skops)
  115. {
  116. __u32 lport, rport;
  117. int op, err = 0, index, key, ret;
  118. op = (int) skops->op;
  119. switch (op) {
  120. case BPF_SOCK_OPS_PASSIVE_ESTABLISHED_CB:
  121. lport = skops->local_port;
  122. rport = skops->remote_port;
  123. if (lport == 10000) {
  124. ret = 1;
  125. #ifdef SOCKMAP
  126. err = bpf_sock_map_update(skops, &sock_map, &ret,
  127. BPF_NOEXIST);
  128. #else
  129. err = bpf_sock_hash_update(skops, &sock_map, &ret,
  130. BPF_NOEXIST);
  131. #endif
  132. bpf_printk("passive(%i -> %i) map ctx update err: %d\n",
  133. lport, bpf_ntohl(rport), err);
  134. }
  135. break;
  136. case BPF_SOCK_OPS_ACTIVE_ESTABLISHED_CB:
  137. lport = skops->local_port;
  138. rport = skops->remote_port;
  139. if (bpf_ntohl(rport) == 10001) {
  140. ret = 10;
  141. #ifdef SOCKMAP
  142. err = bpf_sock_map_update(skops, &sock_map, &ret,
  143. BPF_NOEXIST);
  144. #else
  145. err = bpf_sock_hash_update(skops, &sock_map, &ret,
  146. BPF_NOEXIST);
  147. #endif
  148. bpf_printk("active(%i -> %i) map ctx update err: %d\n",
  149. lport, bpf_ntohl(rport), err);
  150. }
  151. break;
  152. default:
  153. break;
  154. }
  155. return 0;
  156. }
  157. SEC("sk_msg1")
  158. int bpf_prog4(struct sk_msg_md *msg)
  159. {
  160. int *bytes, zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5;
  161. int *start, *end, *start_push, *end_push, *start_pop, *pop;
  162. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  163. if (bytes)
  164. bpf_msg_apply_bytes(msg, *bytes);
  165. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  166. if (bytes)
  167. bpf_msg_cork_bytes(msg, *bytes);
  168. start = bpf_map_lookup_elem(&sock_bytes, &zero);
  169. end = bpf_map_lookup_elem(&sock_bytes, &one);
  170. if (start && end)
  171. bpf_msg_pull_data(msg, *start, *end, 0);
  172. start_push = bpf_map_lookup_elem(&sock_bytes, &two);
  173. end_push = bpf_map_lookup_elem(&sock_bytes, &three);
  174. if (start_push && end_push)
  175. bpf_msg_push_data(msg, *start_push, *end_push, 0);
  176. start_pop = bpf_map_lookup_elem(&sock_bytes, &four);
  177. pop = bpf_map_lookup_elem(&sock_bytes, &five);
  178. if (start_pop && pop)
  179. bpf_msg_pop_data(msg, *start_pop, *pop, 0);
  180. return SK_PASS;
  181. }
  182. SEC("sk_msg2")
  183. int bpf_prog5(struct sk_msg_md *msg)
  184. {
  185. int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5;
  186. int *start, *end, *start_push, *end_push, *start_pop, *pop;
  187. int *bytes, len1, len2 = 0, len3, len4;
  188. int err1 = -1, err2 = -1;
  189. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  190. if (bytes)
  191. err1 = bpf_msg_apply_bytes(msg, *bytes);
  192. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  193. if (bytes)
  194. err2 = bpf_msg_cork_bytes(msg, *bytes);
  195. len1 = (__u64)msg->data_end - (__u64)msg->data;
  196. start = bpf_map_lookup_elem(&sock_bytes, &zero);
  197. end = bpf_map_lookup_elem(&sock_bytes, &one);
  198. if (start && end) {
  199. int err;
  200. bpf_printk("sk_msg2: pull(%i:%i)\n",
  201. start ? *start : 0, end ? *end : 0);
  202. err = bpf_msg_pull_data(msg, *start, *end, 0);
  203. if (err)
  204. bpf_printk("sk_msg2: pull_data err %i\n",
  205. err);
  206. len2 = (__u64)msg->data_end - (__u64)msg->data;
  207. bpf_printk("sk_msg2: length update %i->%i\n",
  208. len1, len2);
  209. }
  210. start_push = bpf_map_lookup_elem(&sock_bytes, &two);
  211. end_push = bpf_map_lookup_elem(&sock_bytes, &three);
  212. if (start_push && end_push) {
  213. int err;
  214. bpf_printk("sk_msg2: push(%i:%i)\n",
  215. start_push ? *start_push : 0,
  216. end_push ? *end_push : 0);
  217. err = bpf_msg_push_data(msg, *start_push, *end_push, 0);
  218. if (err)
  219. bpf_printk("sk_msg2: push_data err %i\n", err);
  220. len3 = (__u64)msg->data_end - (__u64)msg->data;
  221. bpf_printk("sk_msg2: length push_update %i->%i\n",
  222. len2 ? len2 : len1, len3);
  223. }
  224. start_pop = bpf_map_lookup_elem(&sock_bytes, &four);
  225. pop = bpf_map_lookup_elem(&sock_bytes, &five);
  226. if (start_pop && pop) {
  227. int err;
  228. bpf_printk("sk_msg2: pop(%i@%i)\n",
  229. start_pop, pop);
  230. err = bpf_msg_pop_data(msg, *start_pop, *pop, 0);
  231. if (err)
  232. bpf_printk("sk_msg2: pop_data err %i\n", err);
  233. len4 = (__u64)msg->data_end - (__u64)msg->data;
  234. bpf_printk("sk_msg2: length pop_data %i->%i\n",
  235. len1 ? len1 : 0, len4);
  236. }
  237. bpf_printk("sk_msg2: data length %i err1 %i err2 %i\n",
  238. len1, err1, err2);
  239. return SK_PASS;
  240. }
  241. SEC("sk_msg3")
  242. int bpf_prog6(struct sk_msg_md *msg)
  243. {
  244. int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5, key = 0;
  245. int *bytes, *start, *end, *start_push, *end_push, *start_pop, *pop, *f;
  246. __u64 flags = 0;
  247. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  248. if (bytes)
  249. bpf_msg_apply_bytes(msg, *bytes);
  250. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  251. if (bytes)
  252. bpf_msg_cork_bytes(msg, *bytes);
  253. start = bpf_map_lookup_elem(&sock_bytes, &zero);
  254. end = bpf_map_lookup_elem(&sock_bytes, &one);
  255. if (start && end)
  256. bpf_msg_pull_data(msg, *start, *end, 0);
  257. start_push = bpf_map_lookup_elem(&sock_bytes, &two);
  258. end_push = bpf_map_lookup_elem(&sock_bytes, &three);
  259. if (start_push && end_push)
  260. bpf_msg_push_data(msg, *start_push, *end_push, 0);
  261. start_pop = bpf_map_lookup_elem(&sock_bytes, &four);
  262. pop = bpf_map_lookup_elem(&sock_bytes, &five);
  263. if (start_pop && pop)
  264. bpf_msg_pop_data(msg, *start_pop, *pop, 0);
  265. f = bpf_map_lookup_elem(&sock_redir_flags, &zero);
  266. if (f && *f) {
  267. key = 2;
  268. flags = *f;
  269. }
  270. #ifdef SOCKMAP
  271. return bpf_msg_redirect_map(msg, &sock_map_redir, key, flags);
  272. #else
  273. return bpf_msg_redirect_hash(msg, &sock_map_redir, &key, flags);
  274. #endif
  275. }
  276. SEC("sk_msg4")
  277. int bpf_prog7(struct sk_msg_md *msg)
  278. {
  279. int *bytes, *start, *end, *start_push, *end_push, *start_pop, *pop, *f;
  280. int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5;
  281. int len1, len2 = 0, len3, len4;
  282. int err1 = 0, err2 = 0, key = 0;
  283. __u64 flags = 0;
  284. int err;
  285. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  286. if (bytes)
  287. err1 = bpf_msg_apply_bytes(msg, *bytes);
  288. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  289. if (bytes)
  290. err2 = bpf_msg_cork_bytes(msg, *bytes);
  291. len1 = (__u64)msg->data_end - (__u64)msg->data;
  292. start = bpf_map_lookup_elem(&sock_bytes, &zero);
  293. end = bpf_map_lookup_elem(&sock_bytes, &one);
  294. if (start && end) {
  295. bpf_printk("sk_msg2: pull(%i:%i)\n",
  296. start ? *start : 0, end ? *end : 0);
  297. err = bpf_msg_pull_data(msg, *start, *end, 0);
  298. if (err)
  299. bpf_printk("sk_msg2: pull_data err %i\n",
  300. err);
  301. len2 = (__u64)msg->data_end - (__u64)msg->data;
  302. bpf_printk("sk_msg2: length update %i->%i\n",
  303. len1, len2);
  304. }
  305. start_push = bpf_map_lookup_elem(&sock_bytes, &two);
  306. end_push = bpf_map_lookup_elem(&sock_bytes, &three);
  307. if (start_push && end_push) {
  308. bpf_printk("sk_msg4: push(%i:%i)\n",
  309. start_push ? *start_push : 0,
  310. end_push ? *end_push : 0);
  311. err = bpf_msg_push_data(msg, *start_push, *end_push, 0);
  312. if (err)
  313. bpf_printk("sk_msg4: push_data err %i\n",
  314. err);
  315. len3 = (__u64)msg->data_end - (__u64)msg->data;
  316. bpf_printk("sk_msg4: length push_update %i->%i\n",
  317. len2 ? len2 : len1, len3);
  318. }
  319. start_pop = bpf_map_lookup_elem(&sock_bytes, &four);
  320. pop = bpf_map_lookup_elem(&sock_bytes, &five);
  321. if (start_pop && pop) {
  322. int err;
  323. bpf_printk("sk_msg4: pop(%i@%i)\n",
  324. start_pop, pop);
  325. err = bpf_msg_pop_data(msg, *start_pop, *pop, 0);
  326. if (err)
  327. bpf_printk("sk_msg4: pop_data err %i\n", err);
  328. len4 = (__u64)msg->data_end - (__u64)msg->data;
  329. bpf_printk("sk_msg4: length pop_data %i->%i\n",
  330. len1 ? len1 : 0, len4);
  331. }
  332. f = bpf_map_lookup_elem(&sock_redir_flags, &zero);
  333. if (f && *f) {
  334. key = 2;
  335. flags = *f;
  336. }
  337. bpf_printk("sk_msg3: redirect(%iB) flags=%i err=%i\n",
  338. len1, flags, err1 ? err1 : err2);
  339. #ifdef SOCKMAP
  340. err = bpf_msg_redirect_map(msg, &sock_map_redir, key, flags);
  341. #else
  342. err = bpf_msg_redirect_hash(msg, &sock_map_redir, &key, flags);
  343. #endif
  344. bpf_printk("sk_msg3: err %i\n", err);
  345. return err;
  346. }
  347. SEC("sk_msg5")
  348. int bpf_prog8(struct sk_msg_md *msg)
  349. {
  350. void *data_end = (void *)(long) msg->data_end;
  351. void *data = (void *)(long) msg->data;
  352. int ret = 0, *bytes, zero = 0;
  353. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  354. if (bytes) {
  355. ret = bpf_msg_apply_bytes(msg, *bytes);
  356. if (ret)
  357. return SK_DROP;
  358. } else {
  359. return SK_DROP;
  360. }
  361. return SK_PASS;
  362. }
  363. SEC("sk_msg6")
  364. int bpf_prog9(struct sk_msg_md *msg)
  365. {
  366. void *data_end = (void *)(long) msg->data_end;
  367. void *data = (void *)(long) msg->data;
  368. int ret = 0, *bytes, zero = 0;
  369. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  370. if (bytes) {
  371. if (((__u64)data_end - (__u64)data) >= *bytes)
  372. return SK_PASS;
  373. ret = bpf_msg_cork_bytes(msg, *bytes);
  374. if (ret)
  375. return SK_DROP;
  376. }
  377. return SK_PASS;
  378. }
  379. SEC("sk_msg7")
  380. int bpf_prog10(struct sk_msg_md *msg)
  381. {
  382. int *bytes, *start, *end, *start_push, *end_push, *start_pop, *pop;
  383. int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5;
  384. bytes = bpf_map_lookup_elem(&sock_apply_bytes, &zero);
  385. if (bytes)
  386. bpf_msg_apply_bytes(msg, *bytes);
  387. bytes = bpf_map_lookup_elem(&sock_cork_bytes, &zero);
  388. if (bytes)
  389. bpf_msg_cork_bytes(msg, *bytes);
  390. start = bpf_map_lookup_elem(&sock_bytes, &zero);
  391. end = bpf_map_lookup_elem(&sock_bytes, &one);
  392. if (start && end)
  393. bpf_msg_pull_data(msg, *start, *end, 0);
  394. start_push = bpf_map_lookup_elem(&sock_bytes, &two);
  395. end_push = bpf_map_lookup_elem(&sock_bytes, &three);
  396. if (start_push && end_push)
  397. bpf_msg_push_data(msg, *start_push, *end_push, 0);
  398. start_pop = bpf_map_lookup_elem(&sock_bytes, &four);
  399. pop = bpf_map_lookup_elem(&sock_bytes, &five);
  400. if (start_pop && pop)
  401. bpf_msg_pop_data(msg, *start_pop, *pop, 0);
  402. bpf_printk("return sk drop\n");
  403. return SK_DROP;
  404. }
  405. int _version SEC("version") = 1;
  406. char _license[] SEC("license") = "GPL";