1bd4aed0eSJiong Wang // SPDX-License-Identifier: GPL-2.0
2bd4aed0eSJiong Wang 
3bd4aed0eSJiong Wang #include <linux/bpf.h>
43e689141SToke Høiland-Jørgensen #include <bpf/bpf_helpers.h>
5bd4aed0eSJiong Wang 
6bd4aed0eSJiong Wang /* Permit pretty deep stack traces */
7bd4aed0eSJiong Wang #define MAX_STACK_RAWTP 100
8bd4aed0eSJiong Wang struct stack_trace_t {
9bd4aed0eSJiong Wang 	int pid;
10bd4aed0eSJiong Wang 	int kern_stack_size;
11bd4aed0eSJiong Wang 	int user_stack_size;
12bd4aed0eSJiong Wang 	int user_stack_buildid_size;
13bd4aed0eSJiong Wang 	__u64 kern_stack[MAX_STACK_RAWTP];
14bd4aed0eSJiong Wang 	__u64 user_stack[MAX_STACK_RAWTP];
15bd4aed0eSJiong Wang 	struct bpf_stack_build_id user_stack_buildid[MAX_STACK_RAWTP];
16bd4aed0eSJiong Wang };
17bd4aed0eSJiong Wang 
18df0b7792SAndrii Nakryiko struct {
19bc7430ccSAndrii Nakryiko 	__uint(type, BPF_MAP_TYPE_PERF_EVENT_ARRAY);
20bc7430ccSAndrii Nakryiko 	__uint(max_entries, 2);
21bc7430ccSAndrii Nakryiko 	__uint(key_size, sizeof(int));
22bc7430ccSAndrii Nakryiko 	__uint(value_size, sizeof(__u32));
23bc7430ccSAndrii Nakryiko } perfmap SEC(".maps");
24bd4aed0eSJiong Wang 
25df0b7792SAndrii Nakryiko struct {
26bc7430ccSAndrii Nakryiko 	__uint(type, BPF_MAP_TYPE_PERCPU_ARRAY);
27bc7430ccSAndrii Nakryiko 	__uint(max_entries, 1);
28bc7430ccSAndrii Nakryiko 	__type(key, __u32);
29bc7430ccSAndrii Nakryiko 	__type(value, struct stack_trace_t);
30bc7430ccSAndrii Nakryiko } stackdata_map SEC(".maps");
31bd4aed0eSJiong Wang 
32bd4aed0eSJiong Wang /* Allocate per-cpu space twice the needed. For the code below
33bd4aed0eSJiong Wang  *   usize = bpf_get_stack(ctx, raw_data, max_len, BPF_F_USER_STACK);
34bd4aed0eSJiong Wang  *   if (usize < 0)
35bd4aed0eSJiong Wang  *     return 0;
36bd4aed0eSJiong Wang  *   ksize = bpf_get_stack(ctx, raw_data + usize, max_len - usize, 0);
37bd4aed0eSJiong Wang  *
38bd4aed0eSJiong Wang  * If we have value_size = MAX_STACK_RAWTP * sizeof(__u64),
39bd4aed0eSJiong Wang  * verifier will complain that access "raw_data + usize"
40bd4aed0eSJiong Wang  * with size "max_len - usize" may be out of bound.
41bd4aed0eSJiong Wang  * The maximum "raw_data + usize" is "raw_data + max_len"
42bd4aed0eSJiong Wang  * and the maximum "max_len - usize" is "max_len", verifier
43bd4aed0eSJiong Wang  * concludes that the maximum buffer access range is
44bd4aed0eSJiong Wang  * "raw_data[0...max_len * 2 - 1]" and hence reject the program.
45bd4aed0eSJiong Wang  *
46bd4aed0eSJiong Wang  * Doubling the to-be-used max buffer size can fix this verifier
47bd4aed0eSJiong Wang  * issue and avoid complicated C programming massaging.
48bd4aed0eSJiong Wang  * This is an acceptable workaround since there is one entry here.
49bd4aed0eSJiong Wang  */
50df0b7792SAndrii Nakryiko struct {
51bc7430ccSAndrii Nakryiko 	__uint(type, BPF_MAP_TYPE_PERCPU_ARRAY);
52bc7430ccSAndrii Nakryiko 	__uint(max_entries, 1);
53bc7430ccSAndrii Nakryiko 	__type(key, __u32);
54a53ba15dSAndrii Nakryiko 	__type(value, __u64[2 * MAX_STACK_RAWTP]);
55bc7430ccSAndrii Nakryiko } rawdata_map SEC(".maps");
56bd4aed0eSJiong Wang 
5758b80815SAndrii Nakryiko SEC("raw_tracepoint/sys_enter")
bpf_prog1(void * ctx)58bd4aed0eSJiong Wang int bpf_prog1(void *ctx)
59bd4aed0eSJiong Wang {
60fea549b0SAlexei Starovoitov 	int max_len, max_buildid_len, total_size;
61bd4aed0eSJiong Wang 	struct stack_trace_t *data;
62fea549b0SAlexei Starovoitov 	long usize, ksize;
63bd4aed0eSJiong Wang 	void *raw_data;
64bd4aed0eSJiong Wang 	__u32 key = 0;
65bd4aed0eSJiong Wang 
66bd4aed0eSJiong Wang 	data = bpf_map_lookup_elem(&stackdata_map, &key);
67bd4aed0eSJiong Wang 	if (!data)
68bd4aed0eSJiong Wang 		return 0;
69bd4aed0eSJiong Wang 
70bd4aed0eSJiong Wang 	max_len = MAX_STACK_RAWTP * sizeof(__u64);
71bd4aed0eSJiong Wang 	max_buildid_len = MAX_STACK_RAWTP * sizeof(struct bpf_stack_build_id);
72bd4aed0eSJiong Wang 	data->pid = bpf_get_current_pid_tgid();
73bd4aed0eSJiong Wang 	data->kern_stack_size = bpf_get_stack(ctx, data->kern_stack,
74bd4aed0eSJiong Wang 					      max_len, 0);
75bd4aed0eSJiong Wang 	data->user_stack_size = bpf_get_stack(ctx, data->user_stack, max_len,
76bd4aed0eSJiong Wang 					    BPF_F_USER_STACK);
77bd4aed0eSJiong Wang 	data->user_stack_buildid_size = bpf_get_stack(
78bd4aed0eSJiong Wang 		ctx, data->user_stack_buildid, max_buildid_len,
79bd4aed0eSJiong Wang 		BPF_F_USER_STACK | BPF_F_USER_BUILD_ID);
80bd4aed0eSJiong Wang 	bpf_perf_event_output(ctx, &perfmap, 0, data, sizeof(*data));
81bd4aed0eSJiong Wang 
82bd4aed0eSJiong Wang 	/* write both kernel and user stacks to the same buffer */
83bd4aed0eSJiong Wang 	raw_data = bpf_map_lookup_elem(&rawdata_map, &key);
84bd4aed0eSJiong Wang 	if (!raw_data)
85bd4aed0eSJiong Wang 		return 0;
86bd4aed0eSJiong Wang 
87bd4aed0eSJiong Wang 	usize = bpf_get_stack(ctx, raw_data, max_len, BPF_F_USER_STACK);
88bd4aed0eSJiong Wang 	if (usize < 0)
89bd4aed0eSJiong Wang 		return 0;
90bd4aed0eSJiong Wang 
91bd4aed0eSJiong Wang 	ksize = bpf_get_stack(ctx, raw_data + usize, max_len - usize, 0);
92bd4aed0eSJiong Wang 	if (ksize < 0)
93bd4aed0eSJiong Wang 		return 0;
94bd4aed0eSJiong Wang 
95bd4aed0eSJiong Wang 	total_size = usize + ksize;
96bd4aed0eSJiong Wang 	if (total_size > 0 && total_size <= max_len)
97bd4aed0eSJiong Wang 		bpf_perf_event_output(ctx, &perfmap, 0, raw_data, total_size);
98bd4aed0eSJiong Wang 
99bd4aed0eSJiong Wang 	return 0;
100bd4aed0eSJiong Wang }
101bd4aed0eSJiong Wang 
102bd4aed0eSJiong Wang char _license[] SEC("license") = "GPL";
103