1; RUN: opt < %s -rewrite-statepoints-for-gc -spp-rematerialization-threshold=0 -S | FileCheck %s
2; RUN: opt < %s -passes=rewrite-statepoints-for-gc -spp-rematerialization-threshold=0 -S | FileCheck %s
3
4
5declare void @foo()
6
7declare void @use(...) "gc-leaf-function"
8
9define i64 addrspace(1)* @test1(i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2, i1 %condition) gc "statepoint-example" {
10; CHECK-LABEL: @test1
11; CHECK-DAG: %obj.relocated
12; CHECK-DAG: %obj2.relocated
13entry:
14  call void @foo() [ "deopt"() ]
15  br label %joint
16
17joint:                                            ; preds = %joint2, %entry
18; CHECK-LABEL: joint:
19; CHECK: %phi1 = phi i64 addrspace(1)* [ %obj.relocated.casted, %entry ], [ %obj3, %joint2 ]
20  %phi1 = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj3, %joint2 ]
21  br i1 %condition, label %use, label %joint2
22
23use:                                              ; preds = %joint
24  br label %joint2
25
26joint2:                                           ; preds = %use, %joint
27; CHECK-LABEL: joint2:
28; CHECK: %phi2 = phi i64 addrspace(1)* [ %obj.relocated.casted, %use ], [ %obj2.relocated.casted, %joint ]
29; CHECK: %obj3 = getelementptr i64, i64 addrspace(1)* %obj2.relocated.casted, i32 1
30  %phi2 = phi i64 addrspace(1)* [ %obj, %use ], [ %obj2, %joint ]
31  %obj3 = getelementptr i64, i64 addrspace(1)* %obj2, i32 1
32  br label %joint
33}
34
35declare i64 addrspace(1)* @generate_obj() "gc-leaf-function"
36
37declare void @consume_obj(i64 addrspace(1)*) "gc-leaf-function"
38
39declare i1 @rt() "gc-leaf-function"
40
41define void @test2() gc "statepoint-example" {
42; CHECK-LABEL: @test2
43entry:
44  %obj_init = call i64 addrspace(1)* @generate_obj()
45  %obj = getelementptr i64, i64 addrspace(1)* %obj_init, i32 42
46  br label %loop
47
48loop:                                             ; preds = %loop.backedge, %entry
49; CHECK: loop:
50; CHECK-DAG: [ %obj_init.relocated.casted, %loop.backedge ]
51; CHECK-DAG: [ %obj_init, %entry ]
52; CHECK-DAG: [ %obj.relocated.casted, %loop.backedge ]
53; CHECK-DAG: [ %obj, %entry ]
54; CHECK-NOT: %location = getelementptr i64, i64 addrspace(1)* %obj, i32 %index
55  %index = phi i32 [ 0, %entry ], [ %index.inc, %loop.backedge ]
56  %location = getelementptr i64, i64 addrspace(1)* %obj, i32 %index
57  call void @consume_obj(i64 addrspace(1)* %location)
58  %index.inc = add i32 %index, 1
59  %condition = call i1 @rt()
60  br i1 %condition, label %loop_x, label %loop_y
61
62loop_x:                                           ; preds = %loop
63  br label %loop.backedge
64
65loop.backedge:                                    ; preds = %loop_y, %loop_x
66  call void @do_safepoint() [ "deopt"() ]
67  br label %loop
68
69loop_y:                                           ; preds = %loop
70  br label %loop.backedge
71}
72
73declare void @some_call(i8 addrspace(1)*) "gc-leaf-function"
74
75define void @relocate_merge(i1 %cnd, i8 addrspace(1)* %arg) gc "statepoint-example" {
76; CHECK-LABEL: @relocate_merge
77
78bci_0:
79  br i1 %cnd, label %if_branch, label %else_branch
80
81if_branch:                                        ; preds = %bci_0
82; CHECK-LABEL: if_branch:
83; CHECK: gc.statepoint
84; CHECK: gc.relocate
85  call void @foo() [ "deopt"() ]
86  br label %join
87
88else_branch:                                      ; preds = %bci_0
89; CHECK-LABEL: else_branch:
90; CHECK: gc.statepoint
91; CHECK: gc.relocate
92; We need to end up with a single relocation phi updated from both paths
93  call void @foo() [ "deopt"() ]
94  br label %join
95
96join:                                             ; preds = %else_branch, %if_branch
97; CHECK-LABEL: join:
98; CHECK: phi i8 addrspace(1)*
99; CHECK-DAG: [ %arg.relocated, %if_branch ]
100; CHECK-DAG: [ %arg.relocated2, %else_branch ]
101; CHECK-NOT: phi
102  call void @some_call(i8 addrspace(1)* %arg)
103  ret void
104}
105
106; Make sure a use in a statepoint gets properly relocated at a previous one.
107; This is basically just making sure that statepoints aren't accidentally
108; treated specially.
109define void @test3(i64 addrspace(1)* %obj) gc "statepoint-example" {
110; CHECK-LABEL: @test3
111; CHECK: gc.statepoint
112; CHECK-NEXT: gc.relocate
113; CHECK-NEXT: bitcast
114; CHECK-NEXT: gc.statepoint
115entry:
116  call void undef(i64 undef) [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
117  %0 = call i32 undef(i64 addrspace(1)* %obj) [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
118  ret void
119}
120
121; Check specifically for the case where the result of a statepoint needs to
122; be relocated itself
123define void @test4() gc "statepoint-example" {
124; CHECK-LABEL: @test4
125; CHECK: gc.statepoint
126; CHECK: gc.result
127; CHECK: gc.statepoint
128; CHECK: [[RELOCATED:%[^ ]+]] = call {{.*}}gc.relocate
129; CHECK: @use(i8 addrspace(1)* [[RELOCATED]])
130  %1 = call i8 addrspace(1)* undef() [ "deopt"() ]
131  %2 = call i8 addrspace(1)* undef() [ "deopt"() ]
132  call void (...) @use(i8 addrspace(1)* %1)
133  unreachable
134}
135
136; Test updating a phi where not all inputs are live to begin with
137define void @test5(i8 addrspace(1)* %arg) gc "statepoint-example" {
138; CHECK-LABEL: test5
139entry:
140  %0 = call i8 addrspace(1)* undef() [ "deopt"() ]
141  switch i32 undef, label %kill [
142    i32 10, label %merge
143    i32 13, label %merge
144  ]
145
146kill:                                             ; preds = %entry
147  br label %merge
148
149merge:                                            ; preds = %kill, %entry, %entry
150; CHECK: merge:
151; CHECK: %test = phi i8 addrspace(1)
152; CHECK-DAG: [ null, %kill ]
153; CHECK-DAG: [ %arg.relocated, %entry ]
154; CHECK-DAG: [ %arg.relocated, %entry ]
155  %test = phi i8 addrspace(1)* [ null, %kill ], [ %arg, %entry ], [ %arg, %entry ]
156  call void (...) @use(i8 addrspace(1)* %test)
157  unreachable
158}
159
160; Check to make sure we handle values live over an entry statepoint
161define void @test6(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i8 addrspace(1)* %arg3) gc "statepoint-example" {
162; CHECK-LABEL: @test6
163entry:
164  br i1 undef, label %gc.safepoint_poll.exit2, label %do_safepoint
165
166do_safepoint:                                     ; preds = %entry
167; CHECK-LABEL: do_safepoint:
168; CHECK: gc.statepoint
169; CHECK: arg1.relocated =
170; CHECK: arg2.relocated =
171; CHECK: arg3.relocated =
172  call void @foo() [ "deopt"(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i8 addrspace(1)* %arg3) ]
173  br label %gc.safepoint_poll.exit2
174
175gc.safepoint_poll.exit2:                          ; preds = %do_safepoint, %entry
176; CHECK-LABEL: gc.safepoint_poll.exit2:
177; CHECK: phi i8 addrspace(1)*
178; CHECK-DAG: [ %arg3, %entry ]
179; CHECK-DAG: [ %arg3.relocated, %do_safepoint ]
180; CHECK: phi i8 addrspace(1)*
181; CHECK-DAG: [ %arg2, %entry ]
182; CHECK-DAG: [ %arg2.relocated, %do_safepoint ]
183; CHECK: phi i8 addrspace(1)*
184; CHECK-DAG: [ %arg1, %entry ]
185; CHECK-DAG:  [ %arg1.relocated, %do_safepoint ]
186  call void (...) @use(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i8 addrspace(1)* %arg3)
187  ret void
188}
189
190; Check relocation in a loop nest where a relocation happens in the outer
191; but not the inner loop
192define void @test_outer_loop(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i1 %cmp) gc "statepoint-example" {
193; CHECK-LABEL: @test_outer_loop
194
195bci_0:
196  br label %outer-loop
197
198outer-loop:                                       ; preds = %outer-inc, %bci_0
199; CHECK-LABEL: outer-loop:
200; CHECK: phi i8 addrspace(1)* [ %arg2, %bci_0 ], [ %arg2.relocated, %outer-inc ]
201; CHECK: phi i8 addrspace(1)* [ %arg1, %bci_0 ], [ %arg1.relocated, %outer-inc ]
202  br label %inner-loop
203
204inner-loop:                                       ; preds = %inner-loop, %outer-loop
205  br i1 %cmp, label %inner-loop, label %outer-inc
206
207outer-inc:                                        ; preds = %inner-loop
208; CHECK-LABEL: outer-inc:
209; CHECK: %arg1.relocated
210; CHECK: %arg2.relocated
211  call void @foo() [ "deopt"(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2) ]
212  br label %outer-loop
213}
214
215; Check that both inner and outer loops get phis when relocation is in
216;  inner loop
217define void @test_inner_loop(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i1 %cmp) gc "statepoint-example" {
218; CHECK-LABEL: @test_inner_loop
219
220bci_0:
221  br label %outer-loop
222
223outer-loop:                                       ; preds = %outer-inc, %bci_0
224; CHECK-LABEL: outer-loop:
225; CHECK: phi i8 addrspace(1)* [ %arg2, %bci_0 ], [ %arg2.relocated, %outer-inc ]
226; CHECK: phi i8 addrspace(1)* [ %arg1, %bci_0 ], [ %arg1.relocated, %outer-inc ]
227  br label %inner-loop
228; CHECK-LABEL: inner-loop
229; CHECK: phi i8 addrspace(1)*
230; CHECK-DAG: %outer-loop ]
231; CHECK-DAG: [ %arg2.relocated, %inner-loop ]
232; CHECK: phi i8 addrspace(1)*
233; CHECK-DAG: %outer-loop ]
234; CHECK-DAG: [ %arg1.relocated, %inner-loop ]
235; CHECK: gc.statepoint
236; CHECK: %arg1.relocated
237; CHECK: %arg2.relocated
238
239inner-loop:                                       ; preds = %inner-loop, %outer-loop
240  call void @foo() [ "deopt"(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2) ]
241  br i1 %cmp, label %inner-loop, label %outer-inc
242
243outer-inc:                                        ; preds = %inner-loop
244; CHECK-LABEL: outer-inc:
245; This test shows why updating just those uses of the original value being
246; relocated dominated by the inserted relocation is not always sufficient.
247  br label %outer-loop
248}
249
250define i64 addrspace(1)* @test7(i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2, i1 %condition) gc "statepoint-example" {
251; CHECK-LABEL: @test7
252entry:
253  br i1 %condition, label %branch2, label %join
254
255branch2:                                          ; preds = %entry
256  br i1 %condition, label %callbb, label %join2
257
258callbb:                                           ; preds = %branch2
259  call void @foo() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
260  br label %join
261
262join:                                             ; preds = %callbb, %entry
263; CHECK-LABEL: join:
264; CHECK: phi i64 addrspace(1)* [ %obj.relocated.casted, %callbb ], [ %obj, %entry ]
265; CHECK: phi i64 addrspace(1)*
266; CHECK-DAG: [ %obj, %entry ]
267; CHECK-DAG: [ %obj2.relocated.casted, %callbb ]
268  %phi1 = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj2, %callbb ]
269  br label %join2
270
271join2:                                            ; preds = %join, %branch2
272; CHECK-LABEL: join2:
273; CHECK: phi2 = phi i64 addrspace(1)*
274; CHECK-DAG: %join ]
275; CHECK-DAG:  [ %obj2, %branch2 ]
276  %phi2 = phi i64 addrspace(1)* [ %obj, %join ], [ %obj2, %branch2 ]
277  ret i64 addrspace(1)* %phi2
278}
279
280declare void @do_safepoint()
281