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"
91
92define void @test5(i1 %cnd, i64 addrspace(1)* %obj) gc "statepoint-example" {
93; CHECK-LABEL: @test5
94; CHECK: gc.relocate
95; CHECK-DAG: (%bdv.base, %bdv)
96; When we fundementally have to duplicate
97entry:
98  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
99  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
100  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i32 0
101  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
102  call void @use(i64 addrspace(1)* %bdv)
103  ret void
104}
105
106define void @test6(i1 %cnd, i64 addrspace(1)* %obj, i64 %idx) gc "statepoint-example" {
107; CHECK-LABEL: @test6
108; CHECK: %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
109; CHECK: %vec.base = insertelement <2 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 0, !is_base_value !0
110; CHECK: %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
111; CHECK: %bdv.base = extractelement <2 x i64 addrspace(1)*> %vec.base, i64 %idx, !is_base_value !0
112; CHECK:  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
113; CHECK: gc.statepoint
114; CHECK: gc.relocate
115; CHECK-DAG: (%bdv.base, %bdv)
116; A more complicated example involving vector and scalar bases.
117; This is derived from a failing test case when we didn't have correct
118; insertelement handling.
119entry:
120  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
121  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
122  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
123  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
124  call void @use(i64 addrspace(1)* %bdv)
125  ret void
126}
127
128define i64 addrspace(1)* @test7(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
129; CHECK-LABEL: @test7
130entry:
131  %vec = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj2, i32 0
132  br label %merge1
133
134merge1:                                           ; preds = %merge1, %entry
135; CHECK-LABEL: merge1:
136; CHECK: vec2.base
137; CHECK: vec2
138; CHECK: gep
139; CHECK: vec3.base
140; CHECK: vec3
141  %vec2 = phi <2 x i64 addrspace(1)*> [ %vec, %entry ], [ %vec3, %merge1 ]
142  %gep = getelementptr i64, i64 addrspace(1)* %obj2, i64 1
143  %vec3 = insertelement <2 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
144  br i1 %cnd, label %merge1, label %next1
145
146next1:                                            ; preds = %merge1
147; CHECK-LABEL: next1:
148; CHECK: bdv.base =
149; CHECK: bdv =
150  %bdv = extractelement <2 x i64 addrspace(1)*> %vec2, i32 0
151  br label %merge
152
153merge:                                            ; preds = %merge, %next1
154; CHECK-LABEL: merge:
155; CHECK: %objb.base
156; CHECK: %objb
157; CHECK: gc.statepoint
158; CHECK: gc.relocate
159; CHECK-DAG: (%objb.base, %objb)
160  %objb = phi i64 addrspace(1)* [ %obj, %next1 ], [ %bdv, %merge ]
161  br i1 %cnd, label %merge, label %next
162
163next:                                             ; preds = %merge
164  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
165  ret i64 addrspace(1)* %objb
166}
167
168; identify base for shufflevector
169define void @test8(i64 addrspace(1)* %obj, i64 %idx) gc "statepoint-example" {
170; CHECK-LABEL: @test8
171; CHECK: %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
172; CHECK: %gep2 = getelementptr i64, i64 addrspace(1)* %obj, i64 2
173; CHECK: %vec1.base = insertelement <4 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 0, !is_base_value !0
174; CHECK: %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
175; CHECK: %vec2.base = insertelement <4 x i64 addrspace(1)*> zeroinitializer, i64 addrspace(1)* %obj, i32 2, !is_base_value !0
176; CHECK: %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep2, i32 2
177; 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
178; CHECK: %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec2, <2 x i32> <i32 0, i32 2>
179; CHECK: %bdv.base = extractelement <2 x i64 addrspace(1)*> %vec.base, i64 %idx, !is_base_value !0
180; CHECK: %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
181; CHECK: gc.statepoint
182; CHECK: gc.relocate
183; CHECK-DAG: (%bdv.base, %bdv)
184entry:
185  %gep = getelementptr i64, i64 addrspace(1)* %obj, i64 1
186  %gep2 = getelementptr i64, i64 addrspace(1)* %obj, i64 2
187  %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep, i32 0
188  %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %gep2, i32 2
189  %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec2, <2 x i32> <i32 0, i32 2>
190  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
191  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
192  call void @use(i64 addrspace(1)* %bdv)
193  ret void
194}
195
196; Since the same 'base' vector is used in the shuffle operands, we do not need
197; create a shufflevector base.
198define void @test9(<4 x i64 addrspace(1)*> %vec1, i64 %idx) gc "statepoint-example" {
199; CHECK-LABEL: @test9
200; CHECK: %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec1, <2 x i32> <i32 0, i32 2>
201; CHECK: %base_ee = extractelement <4 x i64 addrspace(1)*> %vec1, i64 %idx, !is_base_value !0
202; CHECK: %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
203; CHECK: gc.statepoint
204; CHECK: gc.relocate
205; CHECK-DAG: (%base_ee, %bdv)
206entry:
207 ; shrinking vec1 into vec
208  %vec = shufflevector <4 x i64 addrspace(1)*> %vec1, <4 x i64 addrspace(1)*> %vec1, <2 x i32> <i32 0, i32 2>
209  %bdv = extractelement <2 x i64 addrspace(1)*> %vec, i64 %idx
210  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
211  call void @use(i64 addrspace(1)* %bdv)
212  ret void
213}
214
215; vector operand of shufflevector is a phi
216define i64 addrspace(1)* @test10(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
217; CHECK-LABEL: @test10
218entry:
219  %vec1 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj, i32 0
220  br i1 %cnd, label %here, label %merge
221
222here:
223  %vec2 = insertelement <4 x i64 addrspace(1)*> undef, i64 addrspace(1)* %obj2, i32 2
224  br label %merge
225
226merge:                                           ; preds = %merge, %entry, %here
227; CHECK-LABEL: merge:
228; CHECK: %vec.base = phi <4 x i64 addrspace(1)*> [ %vec1.base, %entry ], [ %vec2.base, %here ], [ %vec3.base, %merge ], !is_base_value !0
229; CHECK: vec
230; CHECK: vec3.base = shufflevector <4 x i64 addrspace(1)*> %vec.base, <4 x i64 addrspace(1)*> %vec.base
231; CHECK: vec3
232; CHECK: bdv.base
233; CHECK: bdv
234  %vec = phi <4 x i64 addrspace(1)*> [ %vec1, %entry ], [ %vec2, %here], [ %vec3, %merge]
235  %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>
236  %bdv = extractelement <4 x i64 addrspace(1)*> %vec3, i32 0
237  br i1 %cnd, label %merge, label %next
238
239next:
240; CHECK-LABEL: next:
241; CHECK: gc.statepoint
242; CHECK: gc.relocate
243; CHECK-DAG: (%bdv.base, %bdv)
244  call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
245  ret i64 addrspace(1)* %bdv
246}
247declare void @do_safepoint()
248