1*965a3f91SEduard Zingerman // SPDX-License-Identifier: GPL-2.0
2*965a3f91SEduard Zingerman /* Converted from tools/testing/selftests/bpf/verifier/bpf_get_stack.c */
3*965a3f91SEduard Zingerman
4*965a3f91SEduard Zingerman #include <linux/bpf.h>
5*965a3f91SEduard Zingerman #include <bpf/bpf_helpers.h>
6*965a3f91SEduard Zingerman #include "bpf_misc.h"
7*965a3f91SEduard Zingerman
8*965a3f91SEduard Zingerman #define MAX_ENTRIES 11
9*965a3f91SEduard Zingerman
10*965a3f91SEduard Zingerman struct test_val {
11*965a3f91SEduard Zingerman unsigned int index;
12*965a3f91SEduard Zingerman int foo[MAX_ENTRIES];
13*965a3f91SEduard Zingerman };
14*965a3f91SEduard Zingerman
15*965a3f91SEduard Zingerman struct {
16*965a3f91SEduard Zingerman __uint(type, BPF_MAP_TYPE_ARRAY);
17*965a3f91SEduard Zingerman __uint(max_entries, 1);
18*965a3f91SEduard Zingerman __type(key, int);
19*965a3f91SEduard Zingerman __type(value, struct test_val);
20*965a3f91SEduard Zingerman } map_array_48b SEC(".maps");
21*965a3f91SEduard Zingerman
22*965a3f91SEduard Zingerman struct {
23*965a3f91SEduard Zingerman __uint(type, BPF_MAP_TYPE_HASH);
24*965a3f91SEduard Zingerman __uint(max_entries, 1);
25*965a3f91SEduard Zingerman __type(key, long long);
26*965a3f91SEduard Zingerman __type(value, struct test_val);
27*965a3f91SEduard Zingerman } map_hash_48b SEC(".maps");
28*965a3f91SEduard Zingerman
29*965a3f91SEduard Zingerman SEC("tracepoint")
30*965a3f91SEduard Zingerman __description("bpf_get_stack return R0 within range")
31*965a3f91SEduard Zingerman __success
stack_return_r0_within_range(void)32*965a3f91SEduard Zingerman __naked void stack_return_r0_within_range(void)
33*965a3f91SEduard Zingerman {
34*965a3f91SEduard Zingerman asm volatile (" \
35*965a3f91SEduard Zingerman r6 = r1; \
36*965a3f91SEduard Zingerman r1 = 0; \
37*965a3f91SEduard Zingerman *(u64*)(r10 - 8) = r1; \
38*965a3f91SEduard Zingerman r2 = r10; \
39*965a3f91SEduard Zingerman r2 += -8; \
40*965a3f91SEduard Zingerman r1 = %[map_hash_48b] ll; \
41*965a3f91SEduard Zingerman call %[bpf_map_lookup_elem]; \
42*965a3f91SEduard Zingerman if r0 == 0 goto l0_%=; \
43*965a3f91SEduard Zingerman r7 = r0; \
44*965a3f91SEduard Zingerman r9 = %[__imm_0]; \
45*965a3f91SEduard Zingerman r1 = r6; \
46*965a3f91SEduard Zingerman r2 = r7; \
47*965a3f91SEduard Zingerman r3 = %[__imm_0]; \
48*965a3f91SEduard Zingerman r4 = 256; \
49*965a3f91SEduard Zingerman call %[bpf_get_stack]; \
50*965a3f91SEduard Zingerman r1 = 0; \
51*965a3f91SEduard Zingerman r8 = r0; \
52*965a3f91SEduard Zingerman r8 <<= 32; \
53*965a3f91SEduard Zingerman r8 s>>= 32; \
54*965a3f91SEduard Zingerman if r1 s> r8 goto l0_%=; \
55*965a3f91SEduard Zingerman r9 -= r8; \
56*965a3f91SEduard Zingerman r2 = r7; \
57*965a3f91SEduard Zingerman r2 += r8; \
58*965a3f91SEduard Zingerman r1 = r9; \
59*965a3f91SEduard Zingerman r1 <<= 32; \
60*965a3f91SEduard Zingerman r1 s>>= 32; \
61*965a3f91SEduard Zingerman r3 = r2; \
62*965a3f91SEduard Zingerman r3 += r1; \
63*965a3f91SEduard Zingerman r1 = r7; \
64*965a3f91SEduard Zingerman r5 = %[__imm_0]; \
65*965a3f91SEduard Zingerman r1 += r5; \
66*965a3f91SEduard Zingerman if r3 >= r1 goto l0_%=; \
67*965a3f91SEduard Zingerman r1 = r6; \
68*965a3f91SEduard Zingerman r3 = r9; \
69*965a3f91SEduard Zingerman r4 = 0; \
70*965a3f91SEduard Zingerman call %[bpf_get_stack]; \
71*965a3f91SEduard Zingerman l0_%=: exit; \
72*965a3f91SEduard Zingerman " :
73*965a3f91SEduard Zingerman : __imm(bpf_get_stack),
74*965a3f91SEduard Zingerman __imm(bpf_map_lookup_elem),
75*965a3f91SEduard Zingerman __imm_addr(map_hash_48b),
76*965a3f91SEduard Zingerman __imm_const(__imm_0, sizeof(struct test_val) / 2)
77*965a3f91SEduard Zingerman : __clobber_all);
78*965a3f91SEduard Zingerman }
79*965a3f91SEduard Zingerman
80*965a3f91SEduard Zingerman SEC("iter/task")
81*965a3f91SEduard Zingerman __description("bpf_get_task_stack return R0 range is refined")
82*965a3f91SEduard Zingerman __success
return_r0_range_is_refined(void)83*965a3f91SEduard Zingerman __naked void return_r0_range_is_refined(void)
84*965a3f91SEduard Zingerman {
85*965a3f91SEduard Zingerman asm volatile (" \
86*965a3f91SEduard Zingerman r6 = *(u64*)(r1 + 0); \
87*965a3f91SEduard Zingerman r6 = *(u64*)(r6 + 0); /* ctx->meta->seq */\
88*965a3f91SEduard Zingerman r7 = *(u64*)(r1 + 8); /* ctx->task */\
89*965a3f91SEduard Zingerman r1 = %[map_array_48b] ll; /* fixup_map_array_48b */\
90*965a3f91SEduard Zingerman r2 = 0; \
91*965a3f91SEduard Zingerman *(u64*)(r10 - 8) = r2; \
92*965a3f91SEduard Zingerman r2 = r10; \
93*965a3f91SEduard Zingerman r2 += -8; \
94*965a3f91SEduard Zingerman call %[bpf_map_lookup_elem]; \
95*965a3f91SEduard Zingerman if r0 != 0 goto l0_%=; \
96*965a3f91SEduard Zingerman r0 = 0; \
97*965a3f91SEduard Zingerman exit; \
98*965a3f91SEduard Zingerman l0_%=: if r7 != 0 goto l1_%=; \
99*965a3f91SEduard Zingerman r0 = 0; \
100*965a3f91SEduard Zingerman exit; \
101*965a3f91SEduard Zingerman l1_%=: r1 = r7; \
102*965a3f91SEduard Zingerman r2 = r0; \
103*965a3f91SEduard Zingerman r9 = r0; /* keep buf for seq_write */\
104*965a3f91SEduard Zingerman r3 = 48; \
105*965a3f91SEduard Zingerman r4 = 0; \
106*965a3f91SEduard Zingerman call %[bpf_get_task_stack]; \
107*965a3f91SEduard Zingerman if r0 s> 0 goto l2_%=; \
108*965a3f91SEduard Zingerman r0 = 0; \
109*965a3f91SEduard Zingerman exit; \
110*965a3f91SEduard Zingerman l2_%=: r1 = r6; \
111*965a3f91SEduard Zingerman r2 = r9; \
112*965a3f91SEduard Zingerman r3 = r0; \
113*965a3f91SEduard Zingerman call %[bpf_seq_write]; \
114*965a3f91SEduard Zingerman r0 = 0; \
115*965a3f91SEduard Zingerman exit; \
116*965a3f91SEduard Zingerman " :
117*965a3f91SEduard Zingerman : __imm(bpf_get_task_stack),
118*965a3f91SEduard Zingerman __imm(bpf_map_lookup_elem),
119*965a3f91SEduard Zingerman __imm(bpf_seq_write),
120*965a3f91SEduard Zingerman __imm_addr(map_array_48b)
121*965a3f91SEduard Zingerman : __clobber_all);
122*965a3f91SEduard Zingerman }
123*965a3f91SEduard Zingerman
124*965a3f91SEduard Zingerman char _license[] SEC("license") = "GPL";
125