1 // SPDX-License-Identifier: GPL-2.0 1 // SPDX-License-Identifier: GPL-2.0
2 #include <stdio.h> 2 #include <stdio.h>
3 #include <unistd.h> 3 #include <unistd.h>
>> 4 #include <linux/bpf.h>
4 #include <string.h> 5 #include <string.h>
5 #include <assert.h> 6 #include <assert.h>
6 #include <bpf/libbpf.h> !! 7 #include <sys/resource.h>
7 #include <bpf/bpf.h> !! 8 #include "libbpf.h"
>> 9 #include "bpf_load.h"
8 #include "trace_helpers.h" 10 #include "trace_helpers.h"
9 11
10 int main(int ac, char **argv) 12 int main(int ac, char **argv)
11 { 13 {
12 struct bpf_object *obj = NULL; !! 14 struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
13 struct bpf_link *links[20]; <<
14 long key, next_key, value; 15 long key, next_key, value;
15 struct bpf_program *prog; <<
16 int map_fd, i, j = 0; <<
17 char filename[256]; 16 char filename[256];
18 struct ksym *sym; 17 struct ksym *sym;
>> 18 int i;
>> 19
>> 20 snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
>> 21 setrlimit(RLIMIT_MEMLOCK, &r);
19 22
20 if (load_kallsyms()) { 23 if (load_kallsyms()) {
21 printf("failed to process /pro 24 printf("failed to process /proc/kallsyms\n");
22 return 2; 25 return 2;
23 } 26 }
24 27
25 snprintf(filename, sizeof(filename), " !! 28 if (load_bpf_file(filename)) {
26 obj = bpf_object__open_file(filename, !! 29 printf("%s", bpf_log_buf);
27 if (libbpf_get_error(obj)) { !! 30 return 1;
28 fprintf(stderr, "ERROR: openin <<
29 obj = NULL; <<
30 goto cleanup; <<
31 } <<
32 <<
33 /* load BPF program */ <<
34 if (bpf_object__load(obj)) { <<
35 fprintf(stderr, "ERROR: loadin <<
36 goto cleanup; <<
37 } <<
38 <<
39 map_fd = bpf_object__find_map_fd_by_na <<
40 if (map_fd < 0) { <<
41 fprintf(stderr, "ERROR: findin <<
42 goto cleanup; <<
43 } <<
44 <<
45 bpf_object__for_each_program(prog, obj <<
46 links[j] = bpf_program__attach <<
47 if (libbpf_get_error(links[j]) <<
48 fprintf(stderr, "bpf_p <<
49 links[j] = NULL; <<
50 goto cleanup; <<
51 } <<
52 j++; <<
53 } 31 }
54 32
55 for (i = 0; i < 5; i++) { 33 for (i = 0; i < 5; i++) {
56 key = 0; 34 key = 0;
57 printf("kprobing funcs:"); 35 printf("kprobing funcs:");
58 while (bpf_map_get_next_key(ma !! 36 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) {
59 bpf_map_lookup_elem(ma !! 37 bpf_map_lookup_elem(map_fd[0], &next_key, &value);
60 assert(next_key == val 38 assert(next_key == value);
61 sym = ksym_search(valu 39 sym = ksym_search(value);
62 key = next_key; <<
63 if (!sym) { <<
64 printf("ksym n <<
65 continue; <<
66 } <<
67 <<
68 printf(" %s", sym->nam 40 printf(" %s", sym->name);
>> 41 key = next_key;
69 } 42 }
70 if (key) 43 if (key)
71 printf("\n"); 44 printf("\n");
72 key = 0; 45 key = 0;
73 while (bpf_map_get_next_key(ma !! 46 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0)
74 bpf_map_delete_elem(ma !! 47 bpf_map_delete_elem(map_fd[0], &next_key);
75 sleep(1); 48 sleep(1);
76 } 49 }
77 50
78 cleanup: <<
79 for (j--; j >= 0; j--) <<
80 bpf_link__destroy(links[j]); <<
81 <<
82 bpf_object__close(obj); <<
83 return 0; 51 return 0;
84 } 52 }
85 53
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.