summaryrefslogtreecommitdiffstats
path: root/tools/testing/selftests/bpf/progs/uretprobe_stack.c
blob: 9fdcf396b8f467e5a9267a93bad019ce74f1d9da (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// SPDX-License-Identifier: GPL-2.0
/* Copyright (c) 2024 Meta Platforms, Inc. and affiliates. */
#include <vmlinux.h>
#include <bpf/bpf_helpers.h>
#include <bpf/bpf_tracing.h>
#include <bpf/usdt.bpf.h>

char _license[] SEC("license") = "GPL";

__u64 entry_stack1[32], exit_stack1[32];
__u64 entry_stack1_recur[32], exit_stack1_recur[32];
__u64 entry_stack2[32];
__u64 entry_stack3[32];
__u64 entry_stack4[32], exit_stack4[32];
__u64 usdt_stack[32];

int entry1_len, exit1_len;
int entry1_recur_len, exit1_recur_len;
int entry2_len, exit2_len;
int entry3_len, exit3_len;
int entry4_len, exit4_len;
int usdt_len;

#define SZ sizeof(usdt_stack)

SEC("uprobe//proc/self/exe:target_1")
int BPF_UPROBE(uprobe_1)
{
	/* target_1 is recursive wit depth of 2, so we capture two separate
	 * stack traces, depending on which occurence it is
	 */
	static bool recur = false;

	if (!recur)
		entry1_len = bpf_get_stack(ctx, &entry_stack1, SZ, BPF_F_USER_STACK);
	else
		entry1_recur_len = bpf_get_stack(ctx, &entry_stack1_recur, SZ, BPF_F_USER_STACK);

	recur = true;
	return 0;
}

SEC("uretprobe//proc/self/exe:target_1")
int BPF_URETPROBE(uretprobe_1)
{
	/* see above, target_1 is recursive */
	static bool recur = false;

	/* NOTE: order of returns is reversed to order of entries */
	if (!recur)
		exit1_recur_len = bpf_get_stack(ctx, &exit_stack1_recur, SZ, BPF_F_USER_STACK);
	else
		exit1_len = bpf_get_stack(ctx, &exit_stack1, SZ, BPF_F_USER_STACK);

	recur = true;
	return 0;
}

SEC("uprobe//proc/self/exe:target_2")
int BPF_UPROBE(uprobe_2)
{
	entry2_len = bpf_get_stack(ctx, &entry_stack2, SZ, BPF_F_USER_STACK);
	return 0;
}

/* no uretprobe for target_2 */

SEC("uprobe//proc/self/exe:target_3")
int BPF_UPROBE(uprobe_3)
{
	entry3_len = bpf_get_stack(ctx, &entry_stack3, SZ, BPF_F_USER_STACK);
	return 0;
}

/* no uretprobe for target_3 */

SEC("uprobe//proc/self/exe:target_4")
int BPF_UPROBE(uprobe_4)
{
	entry4_len = bpf_get_stack(ctx, &entry_stack4, SZ, BPF_F_USER_STACK);
	return 0;
}

SEC("uretprobe//proc/self/exe:target_4")
int BPF_URETPROBE(uretprobe_4)
{
	exit4_len = bpf_get_stack(ctx, &exit_stack4, SZ, BPF_F_USER_STACK);
	return 0;
}

SEC("usdt//proc/self/exe:uretprobe_stack:target")
int BPF_USDT(usdt_probe)
{
	usdt_len = bpf_get_stack(ctx, &usdt_stack, SZ, BPF_F_USER_STACK);
	return 0;
}