1; RUN: opt < %s -rewrite-statepoints-for-gc -S | FileCheck  %s
2
3
4define i64 addrspace(1)* @test(<2 x i64 addrspace(1)*> %vec, i32 %idx) gc "statepoint-example" {
5; CHECK-LABEL: @test
6; CHECK: extractelement
7; CHECK: extractelement
8; CHECK: statepoint
9; CHECK: gc.relocate
10; CHECK-DAG: ; (%base_ee, %obj)
11; CHECK: gc.relocate
12; CHECK-DAG: ; (%base_ee, %base_ee)
13; Note that the second extractelement is actually redundant here.  A correct output would
14; be to reuse the existing obj as a base since it is actually a base pointer.
15entry:
16  %obj = extractelement <2 x i64 addrspace(1)*> %vec, i32 %idx
17  call void @do_safepoint() [ "deopt"() ]
18  ret i64 addrspace(1)* %obj
19}
20
21define i64 addrspace(1)* @test2(<2 x i64 addrspace(1)*>* %ptr, i1 %cnd, i32 %idx1, i32 %idx2) gc "statepoint-example" {
22; CHECK-LABEL: test2
23entry:
24  br i1 %cnd, label %taken, label %untaken
25
26taken:                                            ; preds = %entry
27  %obja = load <2 x i64 addrspace(1)*>, <2 x i64 addrspace(1)*>* %ptr
28  br label %merge
29
30untaken:                                          ; preds = %entry
31  %objb = load <2 x i64 addrspace(1)*>, <2 x i64 addrspace(1)*>* %ptr
32  br label %merge
33
34merge:                                            ; preds = %untaken, %taken
35  %vec = phi <2 x i64 addrspace(1)*> [ %obja, %taken ], [ %objb, %untaken ]
36  br i1 %cnd, label %taken2, label %untaken2
37
38taken2:                                           ; preds = %merge
39  %obj0 = extractelement <2 x i64 addrspace(1)*> %vec, i32 %idx1
40  br label %merge2
41
42untaken2:                                         ; preds = %merge
43  %obj1 = extractelement <2 x i64 addrspace(1)*> %vec, i32 %idx2
44  br label %merge2
45
46merge2:                                           ; preds = %untaken2, %taken2
47; CHECK-LABEL: merge2:
48; CHECK: %obj.base = phi i64 addrspace(1)*
49; CHECK: %obj = phi i64 addrspace(1)*
50; CHECK: statepoint
51; CHECK: gc.relocate
52; CHECK-DAG: ; (%obj.base, %obj)
53; CHECK: gc.relocate
54; CHECK-DAG: ; (%obj.base, %obj.base)
55  %obj = phi i64 addrspace(1)* [ %obj0, %taken2 ], [ %obj1, %untaken2 ]
56  call void @do_safepoint() [ "deopt"() ]
57  ret i64 addrspace(1)* %obj
58}
59
60define i64 addrspace(1)* @test3(i64 addrspace(1)* %ptr) gc "statepoint-example" {
61; CHECK-LABEL: test3
62; CHECK: insertelement
63; CHECK: extractelement
64; CHECK: statepoint
65; CHECK: gc.relocate
66; CHECK-DAG: (%obj.base, %obj)
67entry:
68  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %ptr, i32 0
69  %obj = extractelement <2 x i64 addrspace(1)*> %vec, i32 0
70  call void @do_safepoint() [ "deopt"() ]
71  ret i64 addrspace(1)* %obj
72}
73
74define i64 addrspace(1)* @test4(i64 addrspace(1)* %ptr) gc "statepoint-example" {
75; CHECK-LABEL: test4
76; CHECK: statepoint
77; CHECK: gc.relocate
78; CHECK-DAG: ; (%obj.base, %obj)
79; When we can optimize an extractelement from a known
80; index and avoid introducing new base pointer instructions
81entry:
82  %derived = getelementptr i64, i64 addrspace(1)* %ptr, i64 16
83  %veca = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %derived, i32 0
84  %vec = insertelement <2 x i64 addrspace(1)*> %veca, i64 addrspace(1)* %ptr, i32 1
85  %obj = extractelement <2 x i64 addrspace(1)*> %vec, i32 0
86  call void @do_safepoint() [ "deopt"() ]
87  ret i64 addrspace(1)* %obj
88}
89
90declare void @use(i64 addrspace(1)*) "gc-leaf-function"
91declare void @use_vec(<4 x i64 addrspace(1)*>) "gc-leaf-function"
92
93define void @test5(i1 %cnd, i64 addrspace(1)* %obj) gc "statepoint-example" {
94; CHECK-LABEL: @test5
95; CHECK: gc.relocate
96; CHECK-DAG: (%bdv.base, %bdv)
97; When we fundementally have to duplicate
98entry:
99  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
100  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
101  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i32 0
102  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
103  call void @use(i64 addrspace(1)* %bdv)
104  ret void
105}
106
107define void @test6(i1 %cnd, i64 addrspace(1)* %obj, i64 %idx) gc "statepoint-example" {
108; CHECK-LABEL: @test6
109; CHECK: %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
110; CHECK: %vec.base = insertelement <2 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 0, !is_base_value !0
111; CHECK: %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
112; CHECK: %bdv.base = extractelement <2 x i64 addrspace(1)*> %vec.base, i64 %idx, !is_base_value !0
113; CHECK:  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
114; CHECK: gc.statepoint
115; CHECK: gc.relocate
116; CHECK-DAG: (%bdv.base, %bdv)
117; A more complicated example involving vector and scalar bases.
118; This is derived from a failing test case when we didn't have correct
119; insertelement handling.
120entry:
121  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
122  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
123  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
124  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
125  call void @use(i64 addrspace(1)* %bdv)
126  ret void
127}
128
129define i64 addrspace(1)* @test7(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
130; CHECK-LABEL: @test7
131entry:
132  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj2, i32 0
133  br label %merge1
134
135merge1:                                           ; preds = %merge1, %entry
136; CHECK-LABEL: merge1:
137; CHECK: vec2.base
138; CHECK: vec2
139; CHECK: gep
140; CHECK: vec3.base
141; CHECK: vec3
142  %vec2 = phi <2 x i64 addrspace(1)*> [ %vec, %entry ], [ %vec3, %merge1 ]
143  %gep = getelementptr i64, i64 addrspace(1)* %obj2, i64 1
144  %vec3 = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
145  br i1 %cnd, label %merge1, label %next1
146
147next1:                                            ; preds = %merge1
148; CHECK-LABEL: next1:
149; CHECK: bdv.base =
150; CHECK: bdv =
151  %bdv = extractelement <2 x i64 addrspace(1)*> %vec2, i32 0
152  br label %merge
153
154merge:                                            ; preds = %merge, %next1
155; CHECK-LABEL: merge:
156; CHECK: %objb.base
157; CHECK: %objb
158; CHECK: gc.statepoint
159; CHECK: gc.relocate
160; CHECK-DAG: (%objb.base, %objb)
161  %objb = phi i64 addrspace(1)* [ %obj, %next1 ], [ %bdv, %merge ]
162  br i1 %cnd, label %merge, label %next
163
164next:                                             ; preds = %merge
165  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
166  ret i64 addrspace(1)* %objb
167}
168
169; identify base for shufflevector
170define void @test8(i64 addrspace(1)* %obj, i64 %idx) gc "statepoint-example" {
171; CHECK-LABEL: @test8
172; CHECK: %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
173; CHECK: %gep2 = getelementptr i64, i64 addrspace(1)* %obj, i64 2
174; CHECK: %vec1.base = insertelement <4 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 0, !is_base_value !0
175; CHECK: %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
176; CHECK: %vec2.base = insertelement <4 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 2, !is_base_value !0
177; CHECK: %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep2, i32 2
178; CHECK: %vec.base = shufflevector <4 x i64 addrspace(1)*> %vec1.base, <4 x i64 addrspace(1)*> %vec2.base, <2 x i32> <i32 0, i32 2>, !is_base_value !0
179; CHECK: %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec2, <2 x i32> <i32 0, i32 2>
180; CHECK: %bdv.base = extractelement <2 x i64 addrspace(1)*> %vec.base, i64 %idx, !is_base_value !0
181; CHECK: %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
182; CHECK: gc.statepoint
183; CHECK: gc.relocate
184; CHECK-DAG: (%bdv.base, %bdv)
185entry:
186  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
187  %gep2 = getelementptr i64, i64 addrspace(1)* %obj, i64 2
188  %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
189  %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep2, i32 2
190  %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec2, <2 x i32> <i32 0, i32 2>
191  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
192  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
193  call void @use(i64 addrspace(1)* %bdv)
194  ret void
195}
196
197; Since the same 'base' vector is used in the shuffle operands, we do not need
198; create a shufflevector base.
199define void @test9(<4 x i64 addrspace(1)*> %vec1, i64 %idx) gc "statepoint-example" {
200; CHECK-LABEL: @test9
201; CHECK: %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec1, <2 x i32> <i32 0, i32 2>
202; CHECK: %base_ee = extractelement <4 x i64 addrspace(1)*> %vec1, i64 %idx, !is_base_value !0
203; CHECK: %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
204; CHECK: gc.statepoint
205; CHECK: gc.relocate
206; CHECK-DAG: (%base_ee, %bdv)
207entry:
208 ; shrinking vec1 into vec
209  %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec1, <2 x i32> <i32 0, i32 2>
210  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
211  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
212  call void @use(i64 addrspace(1)* %bdv)
213  ret void
214}
215
216; vector operand of shufflevector is a phi
217define i64 addrspace(1)* @test10(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
218; CHECK-LABEL: @test10
219entry:
220  %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj, i32 0
221  br i1 %cnd, label %here, label %merge
222
223here:
224  %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj2, i32 2
225  br label %merge
226
227merge:                                           ; preds = %merge, %entry, %here
228; CHECK-LABEL: merge:
229; CHECK: %vec.base = phi <4 x i64 addrspace(1)*> [ %vec1.base, %entry ], [ %vec2.base, %here ], [ %vec3.base, %merge ], !is_base_value !0
230; CHECK: vec
231; CHECK: vec3.base = shufflevector <4 x i64 addrspace(1)*> %vec.base, <4 x i64 addrspace(1)*> %vec.base
232; CHECK: vec3
233; CHECK: bdv.base
234; CHECK: bdv
235  %vec = phi <4 x i64 addrspace(1)*> [ %vec1, %entry ], [ %vec2, %here], [ %vec3, %merge]
236  %vec3 = shufflevector <4 x i64 addrspace(1)*> %vec, <4 x i64 addrspace(1)*> %vec, <4 x i32> <i32 2, i32 0, i32 1, i32 3>
237  %bdv = extractelement <4 x i64 addrspace(1)*> %vec3, i32 0
238  br i1 %cnd, label %merge, label %next
239
240next:
241; CHECK-LABEL: next:
242; CHECK: gc.statepoint
243; CHECK: gc.relocate
244; CHECK-DAG: (%bdv.base, %bdv)
245  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
246  ret i64 addrspace(1)* %bdv
247}
248declare void @do_safepoint()
249
250define void @test11(<4 x i64 addrspace(1)*> %vec1) gc "statepoint-example" {
251; CHECK-LABEL: @test11(
252; CHECK: @llvm.experimental.gc.statepoint.p0f_isVoidf{{.*}}<4 x i64 addrspace(1)*> %vec1)
253; CHECK: %vec1.relocated = call coldcc <4 x i8 addrspace(1)*> @llvm.experimental.gc.relocate.v4p1i8
254; CHECK: %vec1.relocated.casted = bitcast <4 x i8 addrspace(1)*> %vec1.relocated to <4 x i64 addrspace(1)*>
255; CHECK: %vec2.remat = getelementptr i64, <4 x i64 addrspace(1)*> %vec1.relocated.casted, i32 1024
256; CHECK: call void @use_vec(<4 x i64 addrspace(1)*> %vec2.remat)
257entry:
258  %vec2 = getelementptr i64, <4 x i64 addrspace(1)*> %vec1, i32 1024
259  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
260  call void @use_vec(<4 x i64 addrspace(1) *> %vec2)
261  ret void
262}
263