xref: /OK3568_Linux_fs/kernel/samples/bpf/syscall_tp_user.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /* Copyright (c) 2017 Facebook
3*4882a593Smuzhiyun  */
4*4882a593Smuzhiyun #include <stdio.h>
5*4882a593Smuzhiyun #include <unistd.h>
6*4882a593Smuzhiyun #include <fcntl.h>
7*4882a593Smuzhiyun #include <stdlib.h>
8*4882a593Smuzhiyun #include <string.h>
9*4882a593Smuzhiyun #include <linux/perf_event.h>
10*4882a593Smuzhiyun #include <errno.h>
11*4882a593Smuzhiyun #include <sys/resource.h>
12*4882a593Smuzhiyun #include <bpf/libbpf.h>
13*4882a593Smuzhiyun #include <bpf/bpf.h>
14*4882a593Smuzhiyun 
15*4882a593Smuzhiyun /* This program verifies bpf attachment to tracepoint sys_enter_* and sys_exit_*.
16*4882a593Smuzhiyun  * This requires kernel CONFIG_FTRACE_SYSCALLS to be set.
17*4882a593Smuzhiyun  */
18*4882a593Smuzhiyun 
usage(const char * cmd)19*4882a593Smuzhiyun static void usage(const char *cmd)
20*4882a593Smuzhiyun {
21*4882a593Smuzhiyun 	printf("USAGE: %s [-i num_progs] [-h]\n", cmd);
22*4882a593Smuzhiyun 	printf("       -i num_progs      # number of progs of the test\n");
23*4882a593Smuzhiyun 	printf("       -h                # help\n");
24*4882a593Smuzhiyun }
25*4882a593Smuzhiyun 
verify_map(int map_id)26*4882a593Smuzhiyun static void verify_map(int map_id)
27*4882a593Smuzhiyun {
28*4882a593Smuzhiyun 	__u32 key = 0;
29*4882a593Smuzhiyun 	__u32 val;
30*4882a593Smuzhiyun 
31*4882a593Smuzhiyun 	if (bpf_map_lookup_elem(map_id, &key, &val) != 0) {
32*4882a593Smuzhiyun 		fprintf(stderr, "map_lookup failed: %s\n", strerror(errno));
33*4882a593Smuzhiyun 		return;
34*4882a593Smuzhiyun 	}
35*4882a593Smuzhiyun 	if (val == 0) {
36*4882a593Smuzhiyun 		fprintf(stderr, "failed: map #%d returns value 0\n", map_id);
37*4882a593Smuzhiyun 		return;
38*4882a593Smuzhiyun 	}
39*4882a593Smuzhiyun 	val = 0;
40*4882a593Smuzhiyun 	if (bpf_map_update_elem(map_id, &key, &val, BPF_ANY) != 0) {
41*4882a593Smuzhiyun 		fprintf(stderr, "map_update failed: %s\n", strerror(errno));
42*4882a593Smuzhiyun 		return;
43*4882a593Smuzhiyun 	}
44*4882a593Smuzhiyun }
45*4882a593Smuzhiyun 
test(char * filename,int num_progs)46*4882a593Smuzhiyun static int test(char *filename, int num_progs)
47*4882a593Smuzhiyun {
48*4882a593Smuzhiyun 	int map0_fds[num_progs], map1_fds[num_progs], fd, i, j = 0;
49*4882a593Smuzhiyun 	struct bpf_link *links[num_progs * 4];
50*4882a593Smuzhiyun 	struct bpf_object *objs[num_progs];
51*4882a593Smuzhiyun 	struct bpf_program *prog;
52*4882a593Smuzhiyun 
53*4882a593Smuzhiyun 	for (i = 0; i < num_progs; i++) {
54*4882a593Smuzhiyun 		objs[i] = bpf_object__open_file(filename, NULL);
55*4882a593Smuzhiyun 		if (libbpf_get_error(objs[i])) {
56*4882a593Smuzhiyun 			fprintf(stderr, "opening BPF object file failed\n");
57*4882a593Smuzhiyun 			objs[i] = NULL;
58*4882a593Smuzhiyun 			goto cleanup;
59*4882a593Smuzhiyun 		}
60*4882a593Smuzhiyun 
61*4882a593Smuzhiyun 		/* load BPF program */
62*4882a593Smuzhiyun 		if (bpf_object__load(objs[i])) {
63*4882a593Smuzhiyun 			fprintf(stderr, "loading BPF object file failed\n");
64*4882a593Smuzhiyun 			goto cleanup;
65*4882a593Smuzhiyun 		}
66*4882a593Smuzhiyun 
67*4882a593Smuzhiyun 		map0_fds[i] = bpf_object__find_map_fd_by_name(objs[i],
68*4882a593Smuzhiyun 							      "enter_open_map");
69*4882a593Smuzhiyun 		map1_fds[i] = bpf_object__find_map_fd_by_name(objs[i],
70*4882a593Smuzhiyun 							      "exit_open_map");
71*4882a593Smuzhiyun 		if (map0_fds[i] < 0 || map1_fds[i] < 0) {
72*4882a593Smuzhiyun 			fprintf(stderr, "finding a map in obj file failed\n");
73*4882a593Smuzhiyun 			goto cleanup;
74*4882a593Smuzhiyun 		}
75*4882a593Smuzhiyun 
76*4882a593Smuzhiyun 		bpf_object__for_each_program(prog, objs[i]) {
77*4882a593Smuzhiyun 			links[j] = bpf_program__attach(prog);
78*4882a593Smuzhiyun 			if (libbpf_get_error(links[j])) {
79*4882a593Smuzhiyun 				fprintf(stderr, "bpf_program__attach failed\n");
80*4882a593Smuzhiyun 				links[j] = NULL;
81*4882a593Smuzhiyun 				goto cleanup;
82*4882a593Smuzhiyun 			}
83*4882a593Smuzhiyun 			j++;
84*4882a593Smuzhiyun 		}
85*4882a593Smuzhiyun 		printf("prog #%d: map ids %d %d\n", i, map0_fds[i], map1_fds[i]);
86*4882a593Smuzhiyun 	}
87*4882a593Smuzhiyun 
88*4882a593Smuzhiyun 	/* current load_bpf_file has perf_event_open default pid = -1
89*4882a593Smuzhiyun 	 * and cpu = 0, which permits attached bpf execution on
90*4882a593Smuzhiyun 	 * all cpus for all pid's. bpf program execution ignores
91*4882a593Smuzhiyun 	 * cpu affinity.
92*4882a593Smuzhiyun 	 */
93*4882a593Smuzhiyun 	/* trigger some "open" operations */
94*4882a593Smuzhiyun 	fd = open(filename, O_RDONLY);
95*4882a593Smuzhiyun 	if (fd < 0) {
96*4882a593Smuzhiyun 		fprintf(stderr, "open failed: %s\n", strerror(errno));
97*4882a593Smuzhiyun 		return 1;
98*4882a593Smuzhiyun 	}
99*4882a593Smuzhiyun 	close(fd);
100*4882a593Smuzhiyun 
101*4882a593Smuzhiyun 	/* verify the map */
102*4882a593Smuzhiyun 	for (i = 0; i < num_progs; i++) {
103*4882a593Smuzhiyun 		verify_map(map0_fds[i]);
104*4882a593Smuzhiyun 		verify_map(map1_fds[i]);
105*4882a593Smuzhiyun 	}
106*4882a593Smuzhiyun 
107*4882a593Smuzhiyun cleanup:
108*4882a593Smuzhiyun 	for (j--; j >= 0; j--)
109*4882a593Smuzhiyun 		bpf_link__destroy(links[j]);
110*4882a593Smuzhiyun 
111*4882a593Smuzhiyun 	for (i--; i >= 0; i--)
112*4882a593Smuzhiyun 		bpf_object__close(objs[i]);
113*4882a593Smuzhiyun 	return 0;
114*4882a593Smuzhiyun }
115*4882a593Smuzhiyun 
main(int argc,char ** argv)116*4882a593Smuzhiyun int main(int argc, char **argv)
117*4882a593Smuzhiyun {
118*4882a593Smuzhiyun 	struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
119*4882a593Smuzhiyun 	int opt, num_progs = 1;
120*4882a593Smuzhiyun 	char filename[256];
121*4882a593Smuzhiyun 
122*4882a593Smuzhiyun 	while ((opt = getopt(argc, argv, "i:h")) != -1) {
123*4882a593Smuzhiyun 		switch (opt) {
124*4882a593Smuzhiyun 		case 'i':
125*4882a593Smuzhiyun 			num_progs = atoi(optarg);
126*4882a593Smuzhiyun 			break;
127*4882a593Smuzhiyun 		case 'h':
128*4882a593Smuzhiyun 		default:
129*4882a593Smuzhiyun 			usage(argv[0]);
130*4882a593Smuzhiyun 			return 0;
131*4882a593Smuzhiyun 		}
132*4882a593Smuzhiyun 	}
133*4882a593Smuzhiyun 
134*4882a593Smuzhiyun 	setrlimit(RLIMIT_MEMLOCK, &r);
135*4882a593Smuzhiyun 	snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
136*4882a593Smuzhiyun 
137*4882a593Smuzhiyun 	return test(filename, num_progs);
138*4882a593Smuzhiyun }
139