Alexei Starovoitov | 9d8b612 | 2016-03-08 15:07:52 -0800 | [diff] [blame] | 1 | #include <stdio.h> |
| 2 | #include <unistd.h> |
| 3 | #include <linux/bpf.h> |
| 4 | #include <string.h> |
| 5 | #include <assert.h> |
| 6 | #include <sys/resource.h> |
| 7 | #include "libbpf.h" |
| 8 | #include "bpf_load.h" |
| 9 | |
| 10 | int main(int ac, char **argv) |
| 11 | { |
| 12 | struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY}; |
| 13 | long key, next_key, value; |
| 14 | char filename[256]; |
| 15 | struct ksym *sym; |
| 16 | int i; |
| 17 | |
| 18 | snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]); |
| 19 | setrlimit(RLIMIT_MEMLOCK, &r); |
| 20 | |
| 21 | if (load_kallsyms()) { |
| 22 | printf("failed to process /proc/kallsyms\n"); |
| 23 | return 2; |
| 24 | } |
| 25 | |
| 26 | if (load_bpf_file(filename)) { |
| 27 | printf("%s", bpf_log_buf); |
| 28 | return 1; |
| 29 | } |
| 30 | |
| 31 | for (i = 0; i < 5; i++) { |
| 32 | key = 0; |
| 33 | printf("kprobing funcs:"); |
Joe Stringer | d40fc18 | 2016-12-14 14:43:38 -0800 | [diff] [blame] | 34 | while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { |
| 35 | bpf_map_lookup_elem(map_fd[0], &next_key, &value); |
Alexei Starovoitov | 9d8b612 | 2016-03-08 15:07:52 -0800 | [diff] [blame] | 36 | assert(next_key == value); |
| 37 | sym = ksym_search(value); |
| 38 | printf(" %s", sym->name); |
| 39 | key = next_key; |
| 40 | } |
| 41 | if (key) |
| 42 | printf("\n"); |
| 43 | key = 0; |
Joe Stringer | d40fc18 | 2016-12-14 14:43:38 -0800 | [diff] [blame] | 44 | while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) |
| 45 | bpf_map_delete_elem(map_fd[0], &next_key); |
Alexei Starovoitov | 9d8b612 | 2016-03-08 15:07:52 -0800 | [diff] [blame] | 46 | sleep(1); |
| 47 | } |
| 48 | |
| 49 | return 0; |
| 50 | } |