1; RUN: llc < %s -asm-verbose=false -disable-wasm-fallthrough-return-opt | FileCheck %s
2
3target datalayout = "e-m:e-p:32:32-i64:64-n32:64-S128"
4target triple = "wasm32-unknown-unknown"
5
6declare void @ext_func(i64* %ptr)
7declare void @ext_func_i32(i32* %ptr)
8
9; CHECK-LABEL: alloca32:
10; Check that there is an extra local for the stack pointer.
11; CHECK: .local i32{{$}}
12define void @alloca32() noredzone {
13 ; CHECK: i32.const $push[[L4:.+]]=, __stack_pointer{{$}}
14 ; CHECK: i32.const $push[[L1:.+]]=, __stack_pointer{{$}}
15 ; CHECK-NEXT: i32.load $push[[L2:.+]]=, 0($pop[[L1]])
16 ; CHECK-NEXT: i32.const $push[[L3:.+]]=, 16
17 ; CHECK-NEXT: i32.sub $push[[L8:.+]]=, $pop[[L2]], $pop[[L3]]
18 ; CHECK-NEXT: i32.store $push[[L10:.+]]=, 0($pop[[L4]]), $pop[[L8]]{{$}}
19 ; CHECK-NEXT: tee_local $push[[L9:.+]]=, $[[SP:.+]]=, $pop[[L10]]{{$}}
20 %retval = alloca i32
21 ; CHECK: i32.const $push[[L0:.+]]=, 0
22 ; CHECK: i32.store {{.*}}=, 12($pop[[L9]]), $pop[[L0]]
23 store i32 0, i32* %retval
24 ; CHECK: i32.const $push[[L6:.+]]=, __stack_pointer
25 ; CHECK-NEXT: i32.const $push[[L5:.+]]=, 16
26 ; CHECK-NEXT: i32.add $push[[L7:.+]]=, $[[SP]], $pop[[L5]]
27 ; CHECK-NEXT: i32.store $drop=, 0($pop[[L6]]), $pop[[L7]]
28 ret void
29}
30
31; CHECK-LABEL: alloca3264:
32; CHECK: .local i32{{$}}
33define void @alloca3264() {
34 ; CHECK: i32.const $push[[L2:.+]]=, __stack_pointer
35 ; CHECK-NEXT: i32.load $push[[L3:.+]]=, 0($pop[[L2]])
36 ; CHECK-NEXT: i32.const $push[[L4:.+]]=, 16
37 ; CHECK-NEXT: i32.sub $push[[L6:.+]]=, $pop[[L3]], $pop[[L4]]
38 ; CHECK-NEXT: tee_local $push[[L5:.+]]=, $[[SP:.+]]=, $pop[[L6]]
39 %r1 = alloca i32
40 %r2 = alloca double
41 ; CHECK-NEXT: i32.const $push[[L0:.+]]=, 0
42 ; CHECK-NEXT: i32.store $drop=, 12($pop[[L5]]), $pop[[L0]]
43 store i32 0, i32* %r1
44 ; CHECK-NEXT: i64.const $push[[L1:.+]]=, 0
45 ; CHECK-NEXT: i64.store $drop=, 0($[[SP]]), $pop[[L1]]
46 store double 0.0, double* %r2
47 ; CHECK-NEXT: return
48 ret void
49}
50
51; CHECK-LABEL: allocarray:
52; CHECK: .local i32{{$}}
53define void @allocarray() {
54 ; CHECK: i32.const $push[[L7:.+]]=, __stack_pointer
55 ; CHECK: i32.const $push[[L4:.+]]=, __stack_pointer
56 ; CHECK-NEXT: i32.load $push[[L5:.+]]=, 0($pop[[L4]])
57 ; CHECK-NEXT: i32.const $push[[L6:.+]]=, 144{{$}}
58 ; CHECK-NEXT: i32.sub $push[[L11:.+]]=, $pop[[L5]], $pop[[L6]]
59 ; CHECK-NEXT: i32.store ${{.+}}=, 0($pop[[L7]]), $pop[[L11]]
60 %r = alloca [33 x i32]
61
62 ; CHECK:      i32.const $push{{.+}}=, 24
63 ; CHECK-NEXT: i32.add $push[[L3:.+]]=, $[[SP]], $pop{{.+}}
64 ; CHECK-NEXT: i32.const $push[[L1:.+]]=, 1{{$}}
65 ; CHECK-NEXT: i32.store $push[[L0:.+]]=, 0($pop[[L3]]), $pop[[L1]]{{$}}
66 ; CHECK-NEXT: i32.store $drop=, 12(${{.+}}), $pop[[L0]]{{$}}
67 %p = getelementptr [33 x i32], [33 x i32]* %r, i32 0, i32 0
68 store i32 1, i32* %p
69 %p2 = getelementptr [33 x i32], [33 x i32]* %r, i32 0, i32 3
70 store i32 1, i32* %p2
71
72 ; CHECK: i32.const $push[[L10:.+]]=, __stack_pointer
73 ; CHECK-NEXT: i32.const $push[[L8:.+]]=, 144
74 ; CHECK-NEXT: i32.add $push[[L19:.+]]=, $[[SP]], $pop[[L8]]
75 ; CHECK-NEXT: i32.store $drop=, 0($pop[[L10]]), $pop[[L9]]
76 ret void
77}
78
79; CHECK-LABEL: non_mem_use
80define void @non_mem_use(i8** %addr) {
81 ; CHECK: i32.const $push[[L1:.+]]=, 48
82 ; CHECK-NEXT: i32.sub $push[[L11:.+]]=, {{.+}}, $pop[[L1]]
83 ; CHECK-NEXT: i32.store $[[SP:.+]]=, {{.+}}, $pop[[L11]]
84 %buf = alloca [27 x i8], align 16
85 %r = alloca i64
86 %r2 = alloca i64
87 ; %r is at SP+8
88 ; CHECK: tee_local $push[[L12:.+]]=, $[[SP:.+]]=, $pop{{.+}}
89 ; CHECK: i32.const $push[[OFF:.+]]=, 8
90 ; CHECK-NEXT: i32.add $push[[ARG1:.+]]=, $pop[[L12]], $pop[[OFF]]
91 ; CHECK-NEXT: call ext_func@FUNCTION, $pop[[ARG1]]
92 call void @ext_func(i64* %r)
93 ; %r2 is at SP+0, no add needed
94 ; CHECK-NEXT: call ext_func@FUNCTION, $[[SP]]
95 call void @ext_func(i64* %r2)
96 ; Use as a value, but in a store
97 ; %buf is at SP+16
98 ; CHECK: i32.const $push[[OFF:.+]]=, 16
99 ; CHECK-NEXT: i32.add $push[[VAL:.+]]=, $[[SP]], $pop[[OFF]]
100 ; CHECK-NEXT: i32.store {{.*}}=, 0($0), $pop[[VAL]]
101 %gep = getelementptr inbounds [27 x i8], [27 x i8]* %buf, i32 0, i32 0
102 store i8* %gep, i8** %addr
103 ret void
104}
105
106; CHECK-LABEL: allocarray_inbounds:
107; CHECK: .local i32{{$}}
108define void @allocarray_inbounds() {
109 ; CHECK: i32.const $push[[L6:.+]]=, __stack_pointer
110 ; CHECK: i32.const $push[[L3:.+]]=, __stack_pointer
111 ; CHECK-NEXT: i32.load $push[[L4:.+]]=, 0($pop[[L3]])
112 ; CHECK-NEXT: i32.const $push[[L5:.+]]=, 32{{$}}
113 ; CHECK-NEXT: i32.sub $push[[L10:.+]]=, $pop[[L4]], $pop[[L5]]
114 ; CHECK-NEXT: i32.store ${{.+}}=, 0($pop[[L6]]), $pop[[L10]]{{$}}
115 %r = alloca [5 x i32]
116 ; CHECK: i32.const $push[[L3:.+]]=, 1
117 ; CHECK-DAG: i32.store $push{{.*}}=, 24(${{.+}}), $pop[[L3]]
118 %p = getelementptr inbounds [5 x i32], [5 x i32]* %r, i32 0, i32 0
119 store i32 1, i32* %p
120 ; This store should have both the GEP and the FI folded into it.
121 ; CHECK-DAG: i32.store {{.*}}=, 12(${{.+}}), $pop
122 %p2 = getelementptr inbounds [5 x i32], [5 x i32]* %r, i32 0, i32 3
123 store i32 1, i32* %p2
124 call void @ext_func(i64* null);
125 ; CHECK: i32.const $push[[L6:.+]]=, __stack_pointer
126 ; CHECK-NEXT: i32.const $push[[L5:.+]]=, 32
127 ; CHECK-NEXT: i32.add $push[[L7:.+]]=, ${{.+}}, $pop[[L5]]
128 ; CHECK-NEXT: i32.store $drop=, 0($pop[[L6]]), $pop[[L7]]
129 ret void
130}
131
132; CHECK-LABEL: dynamic_alloca:
133define void @dynamic_alloca(i32 %alloc) {
134 ; CHECK: i32.const $push[[L7:.+]]=, __stack_pointer
135 ; CHECK: i32.const $push[[L1:.+]]=, __stack_pointer
136 ; CHECK-NEXT: i32.load $push[[L13:.+]]=, 0($pop[[L1]])
137 ; CHECK-NEXT: tee_local $push[[L12:.+]]=, [[SP:.+]], $pop[[L13]]{{$}}
138 ; Target independent codegen bumps the stack pointer.
139 ; CHECK: i32.sub
140 ; Check that SP is written back to memory after decrement
141 ; CHECK: i32.store $drop=, 0($pop{{.+}}),
142 %r = alloca i32, i32 %alloc
143 ; Target-independent codegen also calculates the store addr
144 ; CHECK: call ext_func_i32@FUNCTION
145 call void @ext_func_i32(i32* %r)
146 ; CHECK: i32.const $push[[L3:.+]]=, __stack_pointer
147 ; CHECK: i32.store $drop=, 0($pop[[L3]]), $pop{{.+}}
148 ret void
149}
150
151; CHECK-LABEL: dynamic_alloca_redzone:
152define void @dynamic_alloca_redzone(i32 %alloc) {
153 ; CHECK: i32.const $push[[L8:.+]]=, __stack_pointer
154 ; CHECK-NEXT: i32.load $push[[L13:.+]]=, 0($pop[[L1]])
155 ; CHECK-NEXT: tee_local $push[[L12:.+]]=, [[SP:.+]], $pop[[L13]]{{$}}
156 ; CHECK-NEXT: copy_local [[FP:.+]]=, $pop[[L12]]{{$}}
157 ; Target independent codegen bumps the stack pointer
158 ; CHECK: i32.sub
159 %r = alloca i32, i32 %alloc
160 ; CHECK-NEXT: tee_local       $push[[L8:.+]]=, $0=, $pop
161 ; CHECK-NEXT: copy_local      $drop=, $pop[[L8]]{{$}}
162 ; CHECK-NEXT: i32.const       $push[[L6:.+]]=, 0{{$}}
163 ; CHECK-NEXT: i32.store       $drop=, 0($0), $pop[[L6]]{{$}}
164 store i32 0, i32* %r
165 ; CHECK-NEXT: return
166 ret void
167}
168
169; CHECK-LABEL: dynamic_static_alloca:
170define void @dynamic_static_alloca(i32 %alloc) noredzone {
171 ; Decrement SP in the prolog by the static amount and writeback to memory.
172 ; CHECK: i32.const $push[[L7:.+]]=, __stack_pointer
173 ; CHECK: i32.const $push[[L8:.+]]=, __stack_pointer
174 ; CHECK: i32.const $push[[L9:.+]]=, __stack_pointer
175 ; CHECK-NEXT: i32.load $push[[L10:.+]]=, 0($pop[[L9]])
176 ; CHECK-NEXT: i32.const $push[[L11:.+]]=, 16
177 ; CHECK-NEXT: i32.sub $push[[L20:.+]]=, $pop[[L10]], $pop[[L11]]
178 ; CHECK-NEXT: tee_local $push[[L19:.+]]=, $[[FP:.+]]=, $pop[[L20]]
179 ; CHECK:      i32.store $push[[L0:.+]]=, 0($pop{{.+}}), $pop{{.+}}
180 ; Decrement SP in the body by the dynamic amount.
181 ; CHECK: i32.sub
182 ; Writeback to memory.
183 ; CHECK: i32.store $drop=, 0($pop{{.+}}), $pop{{.+}}
184 %r1 = alloca i32
185 %r = alloca i32, i32 %alloc
186 store i32 0, i32* %r
187 ; CHEC: i32.store $drop=, 0($pop{{.+}}), $pop{{.+}}
188 ret void
189}
190
191; The use of the alloca in a phi causes a CopyToReg DAG node to be generated,
192; which has to have special handling because CopyToReg can't have a FI operand
193; CHECK-LABEL: copytoreg_fi:
194define void @copytoreg_fi(i1 %cond, i32* %b) {
195entry:
196 ; CHECK: i32.const $push[[L1:.+]]=, 16
197 ; CHECK-NEXT: i32.sub $push[[L3:.+]]=, {{.+}}, $pop[[L1]]
198 %addr = alloca i32
199 ; CHECK: i32.const $push[[OFF:.+]]=, 12
200 ; CHECK-NEXT: i32.add $push[[ADDR:.+]]=, $pop[[L3]], $pop[[OFF]]
201 ; CHECK-NEXT: copy_local [[COPY:.+]]=, $pop[[ADDR]]
202 br label %body
203body:
204 %a = phi i32* [%addr, %entry], [%b, %body]
205 store i32 1, i32* %a
206 ; CHECK: i32.store {{.*}}, 0([[COPY]]),
207 br i1 %cond, label %body, label %exit
208exit:
209 ret void
210}
211
212declare void @use_i8_star(i8*)
213declare i8* @llvm.frameaddress(i32)
214
215; Test __builtin_frame_address(0).
216; CHECK-LABEL: frameaddress_0:
217; CHECK: i32.const $push[[L0:.+]]=, __stack_pointer
218; CHECK-NEXT: i32.load $push[[L3:.+]]=, 0($pop[[L0]])
219; CHECK-NEXT: copy_local $push[[L4:.+]]=, $pop[[L3]]{{$}}
220; CHECK-NEXT: tee_local $push[[L2:.+]]=, $[[FP:.+]]=, $pop[[L4]]{{$}}
221; CHECK-NEXT: call use_i8_star@FUNCTION, $pop[[L2]]
222; CHECK-NEXT: i32.const $push[[L1:.+]]=, __stack_pointer
223; CHECK-NEXT: i32.store $drop=, 0($pop[[L1]]), $[[FP]]
224define void @frameaddress_0() {
225  %t = call i8* @llvm.frameaddress(i32 0)
226  call void @use_i8_star(i8* %t)
227  ret void
228}
229
230; Test __builtin_frame_address(1).
231
232; CHECK-LABEL: frameaddress_1:
233; CHECK-NEXT: i32.const $push0=, 0{{$}}
234; CHECK-NEXT: call use_i8_star@FUNCTION, $pop0{{$}}
235; CHECK-NEXT: return{{$}}
236define void @frameaddress_1() {
237  %t = call i8* @llvm.frameaddress(i32 1)
238  call void @use_i8_star(i8* %t)
239  ret void
240}
241
242; Test a stack address passed to an inline asm.
243; CHECK-LABEL: inline_asm:
244; CHECK:       __stack_pointer
245; CHECK:       #APP
246; CHECK-NEXT:  # %{{[0-9]+}}{{$}}
247; CHECK-NEXT:  #NO_APP
248define void @inline_asm() {
249  %tmp = alloca i8
250  call void asm sideeffect "# %0", "r"(i8* %tmp)
251  ret void
252}
253
254; TODO: test over-aligned alloca
255