1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun * Copyright (c) 2017 Facebook
4*4882a593Smuzhiyun */
5*4882a593Smuzhiyun #include <sys/resource.h>
6*4882a593Smuzhiyun #include <sys/socket.h>
7*4882a593Smuzhiyun #include <arpa/inet.h>
8*4882a593Smuzhiyun #include <stdint.h>
9*4882a593Smuzhiyun #include <assert.h>
10*4882a593Smuzhiyun #include <errno.h>
11*4882a593Smuzhiyun #include <stdlib.h>
12*4882a593Smuzhiyun #include <stdio.h>
13*4882a593Smuzhiyun #include <bpf/bpf.h>
14*4882a593Smuzhiyun #include <bpf/libbpf.h>
15*4882a593Smuzhiyun
16*4882a593Smuzhiyun static int map_fd[7];
17*4882a593Smuzhiyun
18*4882a593Smuzhiyun #define PORT_A (map_fd[0])
19*4882a593Smuzhiyun #define PORT_H (map_fd[1])
20*4882a593Smuzhiyun #define REG_RESULT_H (map_fd[2])
21*4882a593Smuzhiyun #define INLINE_RESULT_H (map_fd[3])
22*4882a593Smuzhiyun #define A_OF_PORT_A (map_fd[4]) /* Test case #0 */
23*4882a593Smuzhiyun #define H_OF_PORT_A (map_fd[5]) /* Test case #1 */
24*4882a593Smuzhiyun #define H_OF_PORT_H (map_fd[6]) /* Test case #2 */
25*4882a593Smuzhiyun
26*4882a593Smuzhiyun static const char * const test_names[] = {
27*4882a593Smuzhiyun "Array of Array",
28*4882a593Smuzhiyun "Hash of Array",
29*4882a593Smuzhiyun "Hash of Hash",
30*4882a593Smuzhiyun };
31*4882a593Smuzhiyun
32*4882a593Smuzhiyun #define NR_TESTS (sizeof(test_names) / sizeof(*test_names))
33*4882a593Smuzhiyun
check_map_id(int inner_map_fd,int map_in_map_fd,uint32_t key)34*4882a593Smuzhiyun static void check_map_id(int inner_map_fd, int map_in_map_fd, uint32_t key)
35*4882a593Smuzhiyun {
36*4882a593Smuzhiyun struct bpf_map_info info = {};
37*4882a593Smuzhiyun uint32_t info_len = sizeof(info);
38*4882a593Smuzhiyun int ret, id;
39*4882a593Smuzhiyun
40*4882a593Smuzhiyun ret = bpf_obj_get_info_by_fd(inner_map_fd, &info, &info_len);
41*4882a593Smuzhiyun assert(!ret);
42*4882a593Smuzhiyun
43*4882a593Smuzhiyun ret = bpf_map_lookup_elem(map_in_map_fd, &key, &id);
44*4882a593Smuzhiyun assert(!ret);
45*4882a593Smuzhiyun assert(id == info.id);
46*4882a593Smuzhiyun }
47*4882a593Smuzhiyun
populate_map(uint32_t port_key,int magic_result)48*4882a593Smuzhiyun static void populate_map(uint32_t port_key, int magic_result)
49*4882a593Smuzhiyun {
50*4882a593Smuzhiyun int ret;
51*4882a593Smuzhiyun
52*4882a593Smuzhiyun ret = bpf_map_update_elem(PORT_A, &port_key, &magic_result, BPF_ANY);
53*4882a593Smuzhiyun assert(!ret);
54*4882a593Smuzhiyun
55*4882a593Smuzhiyun ret = bpf_map_update_elem(PORT_H, &port_key, &magic_result,
56*4882a593Smuzhiyun BPF_NOEXIST);
57*4882a593Smuzhiyun assert(!ret);
58*4882a593Smuzhiyun
59*4882a593Smuzhiyun ret = bpf_map_update_elem(A_OF_PORT_A, &port_key, &PORT_A, BPF_ANY);
60*4882a593Smuzhiyun assert(!ret);
61*4882a593Smuzhiyun check_map_id(PORT_A, A_OF_PORT_A, port_key);
62*4882a593Smuzhiyun
63*4882a593Smuzhiyun ret = bpf_map_update_elem(H_OF_PORT_A, &port_key, &PORT_A, BPF_NOEXIST);
64*4882a593Smuzhiyun assert(!ret);
65*4882a593Smuzhiyun check_map_id(PORT_A, H_OF_PORT_A, port_key);
66*4882a593Smuzhiyun
67*4882a593Smuzhiyun ret = bpf_map_update_elem(H_OF_PORT_H, &port_key, &PORT_H, BPF_NOEXIST);
68*4882a593Smuzhiyun assert(!ret);
69*4882a593Smuzhiyun check_map_id(PORT_H, H_OF_PORT_H, port_key);
70*4882a593Smuzhiyun }
71*4882a593Smuzhiyun
test_map_in_map(void)72*4882a593Smuzhiyun static void test_map_in_map(void)
73*4882a593Smuzhiyun {
74*4882a593Smuzhiyun struct sockaddr_in6 in6 = { .sin6_family = AF_INET6 };
75*4882a593Smuzhiyun uint32_t result_key = 0, port_key;
76*4882a593Smuzhiyun int result, inline_result;
77*4882a593Smuzhiyun int magic_result = 0xfaceb00c;
78*4882a593Smuzhiyun int ret;
79*4882a593Smuzhiyun int i;
80*4882a593Smuzhiyun
81*4882a593Smuzhiyun port_key = rand() & 0x00FF;
82*4882a593Smuzhiyun populate_map(port_key, magic_result);
83*4882a593Smuzhiyun
84*4882a593Smuzhiyun in6.sin6_addr.s6_addr16[0] = 0xdead;
85*4882a593Smuzhiyun in6.sin6_addr.s6_addr16[1] = 0xbeef;
86*4882a593Smuzhiyun in6.sin6_port = port_key;
87*4882a593Smuzhiyun
88*4882a593Smuzhiyun for (i = 0; i < NR_TESTS; i++) {
89*4882a593Smuzhiyun printf("%s: ", test_names[i]);
90*4882a593Smuzhiyun
91*4882a593Smuzhiyun in6.sin6_addr.s6_addr16[7] = i;
92*4882a593Smuzhiyun ret = connect(-1, (struct sockaddr *)&in6, sizeof(in6));
93*4882a593Smuzhiyun assert(ret == -1 && errno == EBADF);
94*4882a593Smuzhiyun
95*4882a593Smuzhiyun ret = bpf_map_lookup_elem(REG_RESULT_H, &result_key, &result);
96*4882a593Smuzhiyun assert(!ret);
97*4882a593Smuzhiyun
98*4882a593Smuzhiyun ret = bpf_map_lookup_elem(INLINE_RESULT_H, &result_key,
99*4882a593Smuzhiyun &inline_result);
100*4882a593Smuzhiyun assert(!ret);
101*4882a593Smuzhiyun
102*4882a593Smuzhiyun if (result != magic_result || inline_result != magic_result) {
103*4882a593Smuzhiyun printf("Error. result:%d inline_result:%d\n",
104*4882a593Smuzhiyun result, inline_result);
105*4882a593Smuzhiyun exit(1);
106*4882a593Smuzhiyun }
107*4882a593Smuzhiyun
108*4882a593Smuzhiyun bpf_map_delete_elem(REG_RESULT_H, &result_key);
109*4882a593Smuzhiyun bpf_map_delete_elem(INLINE_RESULT_H, &result_key);
110*4882a593Smuzhiyun
111*4882a593Smuzhiyun printf("Pass\n");
112*4882a593Smuzhiyun }
113*4882a593Smuzhiyun }
114*4882a593Smuzhiyun
main(int argc,char ** argv)115*4882a593Smuzhiyun int main(int argc, char **argv)
116*4882a593Smuzhiyun {
117*4882a593Smuzhiyun struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
118*4882a593Smuzhiyun struct bpf_link *link = NULL;
119*4882a593Smuzhiyun struct bpf_program *prog;
120*4882a593Smuzhiyun struct bpf_object *obj;
121*4882a593Smuzhiyun char filename[256];
122*4882a593Smuzhiyun
123*4882a593Smuzhiyun if (setrlimit(RLIMIT_MEMLOCK, &r)) {
124*4882a593Smuzhiyun perror("setrlimit(RLIMIT_MEMLOCK)");
125*4882a593Smuzhiyun return 1;
126*4882a593Smuzhiyun }
127*4882a593Smuzhiyun
128*4882a593Smuzhiyun snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
129*4882a593Smuzhiyun obj = bpf_object__open_file(filename, NULL);
130*4882a593Smuzhiyun if (libbpf_get_error(obj)) {
131*4882a593Smuzhiyun fprintf(stderr, "ERROR: opening BPF object file failed\n");
132*4882a593Smuzhiyun return 0;
133*4882a593Smuzhiyun }
134*4882a593Smuzhiyun
135*4882a593Smuzhiyun prog = bpf_object__find_program_by_name(obj, "trace_sys_connect");
136*4882a593Smuzhiyun if (!prog) {
137*4882a593Smuzhiyun printf("finding a prog in obj file failed\n");
138*4882a593Smuzhiyun goto cleanup;
139*4882a593Smuzhiyun }
140*4882a593Smuzhiyun
141*4882a593Smuzhiyun /* load BPF program */
142*4882a593Smuzhiyun if (bpf_object__load(obj)) {
143*4882a593Smuzhiyun fprintf(stderr, "ERROR: loading BPF object file failed\n");
144*4882a593Smuzhiyun goto cleanup;
145*4882a593Smuzhiyun }
146*4882a593Smuzhiyun
147*4882a593Smuzhiyun map_fd[0] = bpf_object__find_map_fd_by_name(obj, "port_a");
148*4882a593Smuzhiyun map_fd[1] = bpf_object__find_map_fd_by_name(obj, "port_h");
149*4882a593Smuzhiyun map_fd[2] = bpf_object__find_map_fd_by_name(obj, "reg_result_h");
150*4882a593Smuzhiyun map_fd[3] = bpf_object__find_map_fd_by_name(obj, "inline_result_h");
151*4882a593Smuzhiyun map_fd[4] = bpf_object__find_map_fd_by_name(obj, "a_of_port_a");
152*4882a593Smuzhiyun map_fd[5] = bpf_object__find_map_fd_by_name(obj, "h_of_port_a");
153*4882a593Smuzhiyun map_fd[6] = bpf_object__find_map_fd_by_name(obj, "h_of_port_h");
154*4882a593Smuzhiyun if (map_fd[0] < 0 || map_fd[1] < 0 || map_fd[2] < 0 ||
155*4882a593Smuzhiyun map_fd[3] < 0 || map_fd[4] < 0 || map_fd[5] < 0 || map_fd[6] < 0) {
156*4882a593Smuzhiyun fprintf(stderr, "ERROR: finding a map in obj file failed\n");
157*4882a593Smuzhiyun goto cleanup;
158*4882a593Smuzhiyun }
159*4882a593Smuzhiyun
160*4882a593Smuzhiyun link = bpf_program__attach(prog);
161*4882a593Smuzhiyun if (libbpf_get_error(link)) {
162*4882a593Smuzhiyun fprintf(stderr, "ERROR: bpf_program__attach failed\n");
163*4882a593Smuzhiyun link = NULL;
164*4882a593Smuzhiyun goto cleanup;
165*4882a593Smuzhiyun }
166*4882a593Smuzhiyun
167*4882a593Smuzhiyun test_map_in_map();
168*4882a593Smuzhiyun
169*4882a593Smuzhiyun cleanup:
170*4882a593Smuzhiyun bpf_link__destroy(link);
171*4882a593Smuzhiyun bpf_object__close(obj);
172*4882a593Smuzhiyun return 0;
173*4882a593Smuzhiyun }
174