1// SPDX-License-Identifier: GPL-2.0
 2#include <stdio.h>
 3#include <unistd.h>
 4#include <string.h>
 5#include <assert.h>
 
 6#include <bpf/libbpf.h>
 7#include <bpf/bpf.h>
 8#include "trace_helpers.h"
 9
10int main(int ac, char **argv)
11{
 
12	struct bpf_object *obj = NULL;
13	struct bpf_link *links[20];
14	long key, next_key, value;
15	struct bpf_program *prog;
16	int map_fd, i, j = 0;
17	char filename[256];
18	struct ksym *sym;
19
20	if (load_kallsyms()) {
21		printf("failed to process /proc/kallsyms\n");
22		return 2;
23	}
24
25	snprintf(filename, sizeof(filename), "%s.bpf.o", argv[0]);
26	obj = bpf_object__open_file(filename, NULL);
27	if (libbpf_get_error(obj)) {
28		fprintf(stderr, "ERROR: opening BPF object file failed\n");
29		obj = NULL;
30		goto cleanup;
31	}
32
33	/* load BPF program */
34	if (bpf_object__load(obj)) {
35		fprintf(stderr, "ERROR: loading BPF object file failed\n");
36		goto cleanup;
37	}
38
39	map_fd = bpf_object__find_map_fd_by_name(obj, "my_map");
40	if (map_fd < 0) {
41		fprintf(stderr, "ERROR: finding a map in obj file failed\n");
42		goto cleanup;
43	}
44
45	bpf_object__for_each_program(prog, obj) {
46		links[j] = bpf_program__attach(prog);
47		if (libbpf_get_error(links[j])) {
48			fprintf(stderr, "bpf_program__attach failed\n");
49			links[j] = NULL;
50			goto cleanup;
 
 
 
 
 
 
 
 
51		}
52		j++;
53	}
54
55	for (i = 0; i < 5; i++) {
56		key = 0;
57		printf("kprobing funcs:");
58		while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) {
59			bpf_map_lookup_elem(map_fd, &next_key, &value);
60			assert(next_key == value);
61			sym = ksym_search(value);
62			key = next_key;
63			if (!sym) {
64				printf("ksym not found. Is kallsyms loaded?\n");
65				continue;
66			}
67
68			printf(" %s", sym->name);
69		}
70		if (key)
71			printf("\n");
72		key = 0;
73		while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0)
74			bpf_map_delete_elem(map_fd, &next_key);
75		sleep(1);
76	}
77
78cleanup:
79	for (j--; j >= 0; j--)
80		bpf_link__destroy(links[j]);
81
82	bpf_object__close(obj);
83	return 0;
84}

 1// SPDX-License-Identifier: GPL-2.0
 2#include <stdio.h>
 3#include <unistd.h>
 4#include <string.h>
 5#include <assert.h>
 6#include <sys/resource.h>
 7#include <bpf/libbpf.h>
 8#include <bpf/bpf.h>
 9#include "trace_helpers.h"
10
11int main(int ac, char **argv)
12{
13	char filename[256], symbol[256];
14	struct bpf_object *obj = NULL;
15	struct bpf_link *links[20];
16	long key, next_key, value;
17	struct bpf_program *prog;
18	int map_fd, i, j = 0;
19	const char *section;
20	struct ksym *sym;
21
22	if (load_kallsyms()) {
23		printf("failed to process /proc/kallsyms\n");
24		return 2;
25	}
26
27	snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
28	obj = bpf_object__open_file(filename, NULL);
29	if (libbpf_get_error(obj)) {
30		fprintf(stderr, "ERROR: opening BPF object file failed\n");
31		obj = NULL;
32		goto cleanup;
33	}
34
35	/* load BPF program */
36	if (bpf_object__load(obj)) {
37		fprintf(stderr, "ERROR: loading BPF object file failed\n");
38		goto cleanup;
39	}
40
41	map_fd = bpf_object__find_map_fd_by_name(obj, "my_map");
42	if (map_fd < 0) {
43		fprintf(stderr, "ERROR: finding a map in obj file failed\n");
44		goto cleanup;
45	}
46
47	bpf_object__for_each_program(prog, obj) {
48		section = bpf_program__section_name(prog);
49		if (sscanf(section, "kprobe/%s", symbol) != 1)
50			continue;
51
52		/* Attach prog only when symbol exists */
53		if (ksym_get_addr(symbol)) {
54			links[j] = bpf_program__attach(prog);
55			if (libbpf_get_error(links[j])) {
56				fprintf(stderr, "bpf_program__attach failed\n");
57				links[j] = NULL;
58				goto cleanup;
59			}
60			j++;
61		}
 
62	}
63
64	for (i = 0; i < 5; i++) {
65		key = 0;
66		printf("kprobing funcs:");
67		while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) {
68			bpf_map_lookup_elem(map_fd, &next_key, &value);
69			assert(next_key == value);
70			sym = ksym_search(value);
71			key = next_key;
72			if (!sym) {
73				printf("ksym not found. Is kallsyms loaded?\n");
74				continue;
75			}
76
77			printf(" %s", sym->name);
78		}
79		if (key)
80			printf("\n");
81		key = 0;
82		while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0)
83			bpf_map_delete_elem(map_fd, &next_key);
84		sleep(1);
85	}
86
87cleanup:
88	for (j--; j >= 0; j--)
89		bpf_link__destroy(links[j]);
90
91	bpf_object__close(obj);
92	return 0;
93}