1 ; RUN: opt %s -rewrite-statepoints-for-gc -S 2>&1 | FileCheck %s
7 define i64 addrspace(1)* @test1(i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2, i1 %condition) gc "statepoint-example" {
10 ; CHECK-DAG: %obj.relocated
11 ; CHECK-DAG: %obj2.relocated
12 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 0)
17 ; CHECK: %phi1 = phi i64 addrspace(1)* [ %obj.relocated.casted, %entry ], [ %obj3, %joint2 ]
18 %phi1 = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj3, %joint2 ]
19 br i1 %condition, label %use, label %joint2
25 ; CHECK-LABEL: joint2:
26 ; CHECK: %phi2 = phi i64 addrspace(1)* [ %obj.relocated.casted, %use ], [ %obj2.relocated.casted, %joint ]
27 ; CHECK: %obj3 = getelementptr i64, i64 addrspace(1)* %obj2.relocated.casted, i32 1
28 %phi2 = phi i64 addrspace(1)* [ %obj, %use ], [ %obj2, %joint ]
29 %obj3 = getelementptr i64, i64 addrspace(1)* %obj2, i32 1
33 declare i64 addrspace(1)* @generate_obj()
35 declare void @consume_obj(i64 addrspace(1)*)
39 define void @test2() gc "statepoint-example" {
42 %obj_init = call i64 addrspace(1)* @generate_obj()
43 %obj = getelementptr i64, i64 addrspace(1)* %obj_init, i32 42
48 ; CHECK-DAG: [ %obj_init.relocated.casted, %loop.backedge ]
49 ; CHECK-DAG: [ %obj_init, %entry ]
50 ; CHECK-DAG: [ %obj.relocated.casted, %loop.backedge ]
51 ; CHECK-DAG: [ %obj, %entry ]
52 %index = phi i32 [ 0, %entry ], [ %index.inc, %loop.backedge ]
53 ; CHECK-NOT: %location = getelementptr i64, i64 addrspace(1)* %obj, i32 %index
54 %location = getelementptr i64, i64 addrspace(1)* %obj, i32 %index
55 call void @consume_obj(i64 addrspace(1)* %location)
56 %index.inc = add i32 %index, 1
57 %condition = call i1 @rt()
58 br i1 %condition, label %loop_x, label %loop_y
61 br label %loop.backedge
64 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @do_safepoint, i32 0, i32 0, i32 0, i32 0)
68 br label %loop.backedge
71 declare void @some_call(i8 addrspace(1)*)
73 define void @relocate_merge(i1 %cnd, i8 addrspace(1)* %arg) gc "statepoint-example" {
74 ; CHECK-LABEL: @relocate_merge
76 br i1 %cnd, label %if_branch, label %else_branch
79 ; CHECK-LABEL: if_branch:
80 ; CHECK: gc.statepoint
82 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 0)
86 ; CHECK-LABEL: else_branch:
87 ; CHECK: gc.statepoint
89 %safepoint_token1 = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 0)
93 ; We need to end up with a single relocation phi updated from both paths
95 ; CHECK: phi i8 addrspace(1)*
96 ; CHECK-DAG: [ %arg.relocated, %if_branch ]
97 ; CHECK-DAG: [ %arg.relocated4, %else_branch ]
99 call void (i8 addrspace(1)*) @some_call(i8 addrspace(1)* %arg)
103 ; Make sure a use in a statepoint gets properly relocated at a previous one.
104 ; This is basically just making sure that statepoints aren't accidentally
106 define void @test3(i64 addrspace(1)* %obj) gc "statepoint-example" {
108 ; CHECK-LABEL: @test3
109 ; CHECK: gc.statepoint
110 ; CHECK-NEXT: gc.relocate
111 ; CHECK-NEXT: bitcast
112 ; CHECK-NEXT: gc.statepoint
113 %safepoint_token = call i32 (void (i64)*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidi64f(void (i64)* undef, i32 1, i32 0, i64 undef, i32 0, i32 5, i32 0, i32 -1, i32 0, i32 0, i32 0)
114 %safepoint_token1 = call i32 (i32 (i64 addrspace(1)*)*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_i32p1i64f(i32 (i64 addrspace(1)*)* undef, i32 1, i32 0, i64 addrspace(1)* %obj, i32 0, i32 5, i32 0, i32 -1, i32 0, i32 0, i32 0)
118 ; Check specifically for the case where the result of a statepoint needs to
119 ; be relocated itself
120 define void @test4() gc "statepoint-example" {
121 ; CHECK-LABEL: @test4
122 ; CHECK: gc.statepoint
124 ; CHECK: gc.statepoint
126 ; CHECK: @use(i8 addrspace(1)* %res.relocated)
127 %safepoint_token2 = tail call i32 (i8 addrspace(1)* ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_p1i8f(i8 addrspace(1)* ()* undef, i32 0, i32 0, i32 0, i32 0)
128 %res = call i8 addrspace(1)* @llvm.experimental.gc.result.ptr.p1i8(i32 %safepoint_token2)
129 call i32 (i8 addrspace(1)* ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_p1i8f(i8 addrspace(1)* ()* undef, i32 0, i32 0, i32 0, i32 0)
130 call void (...) @use(i8 addrspace(1)* %res)
135 ; Test updating a phi where not all inputs are live to begin with
136 define void @test5(i8 addrspace(1)* %arg) gc "statepoint-example" {
139 call i32 (i8 addrspace(1)* ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_p1i8f(i8 addrspace(1)* ()* undef, i32 0, i32 0, i32 0, i32 0)
140 switch i32 undef, label %kill [
150 ; CHECK: %test = phi i8 addrspace(1)
151 ; CHECK-DAG: [ null, %kill ]
152 ; CHECK-DAG: [ %arg.relocated, %entry ]
153 ; CHECK-DAG: [ %arg.relocated, %entry ]
154 %test = phi i8 addrspace(1)* [ null, %kill ], [ %arg, %entry ], [ %arg, %entry ]
155 call void (...) @use(i8 addrspace(1)* %test)
160 ; Check to make sure we handle values live over an entry statepoint
161 define void @test6(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2,
162 i8 addrspace(1)* %arg3) gc "statepoint-example" {
163 ; CHECK-LABEL: @test6
165 br i1 undef, label %gc.safepoint_poll.exit2, label %do_safepoint
168 ; CHECK-LABEL: do_safepoint:
169 ; CHECK: gc.statepoint
170 ; CHECK: arg1.relocated =
171 ; CHECK: arg2.relocated =
172 ; CHECK: arg3.relocated =
173 call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 3, i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i8 addrspace(1)* %arg3)
174 br label %gc.safepoint_poll.exit2
176 gc.safepoint_poll.exit2:
177 ; CHECK-LABEL: gc.safepoint_poll.exit2:
178 ; CHECK: phi i8 addrspace(1)*
179 ; CHECK-DAG: [ %arg3, %entry ]
180 ; CHECK-DAG: [ %arg3.relocated, %do_safepoint ]
181 ; CHECK: phi i8 addrspace(1)*
182 ; CHECK-DAG: [ %arg2, %entry ]
183 ; CHECK-DAG: [ %arg2.relocated, %do_safepoint ]
184 ; CHECK: phi i8 addrspace(1)*
185 ; CHECK-DAG: [ %arg1, %entry ]
186 ; CHECK-DAG: [ %arg1.relocated, %do_safepoint ]
187 call void (...) @use(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2, i8 addrspace(1)* %arg3)
191 ; Check relocation in a loop nest where a relocation happens in the outer
192 ; but not the inner loop
193 define void @test_outer_loop(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2,
194 i1 %cmp) gc "statepoint-example" {
195 ; CHECK-LABEL: @test_outer_loop
200 ; CHECK-LABEL: outer-loop:
201 ; CHECK: phi i8 addrspace(1)* [ %arg2, %bci_0 ], [ %arg2.relocated, %outer-inc ]
202 ; CHECK: phi i8 addrspace(1)* [ %arg1, %bci_0 ], [ %arg1.relocated, %outer-inc ]
206 br i1 %cmp, label %inner-loop, label %outer-inc
209 ; CHECK-LABEL: outer-inc:
210 ; CHECK: %arg1.relocated
211 ; CHECK: %arg2.relocated
212 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 2, i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2)
216 ; Check that both inner and outer loops get phis when relocation is in
218 define void @test_inner_loop(i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2,
219 i1 %cmp) gc "statepoint-example" {
220 ; CHECK-LABEL: @test_inner_loop
225 ; CHECK-LABEL: outer-loop:
226 ; CHECK: phi i8 addrspace(1)* [ %arg2, %bci_0 ], [ %arg2.relocated, %outer-inc ]
227 ; CHECK: phi i8 addrspace(1)* [ %arg1, %bci_0 ], [ %arg1.relocated, %outer-inc ]
231 ; CHECK-LABEL: inner-loop
232 ; CHECK: phi i8 addrspace(1)*
233 ; CHECK-DAG: %outer-loop ]
234 ; CHECK-DAG: [ %arg2.relocated, %inner-loop ]
235 ; CHECKL phi i8 addrspace(1)*
236 ; CHECK-DAG: %outer-loop ]
237 ; CHECK-DAG: [ %arg1.relocated, %inner-loop ]
238 ; CHECK: gc.statepoint
239 ; CHECK: %arg1.relocated
240 ; CHECK: %arg2.relocated
241 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 2, i8 addrspace(1)* %arg1, i8 addrspace(1)* %arg2)
242 br i1 %cmp, label %inner-loop, label %outer-inc
245 ; CHECK-LABEL: outer-inc:
250 ; This test shows why updating just those uses of the original value being
251 ; relocated dominated by the inserted relocation is not always sufficient.
252 define i64 addrspace(1)* @test7(i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2, i1 %condition) gc "statepoint-example" {
253 ; CHECK-LABEL: @test7
255 br i1 %condition, label %branch2, label %join
258 br i1 %condition, label %callbb, label %join2
261 %safepoint_token = call i32 (void ()*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()* @foo, i32 0, i32 0, i32 0, i32 5, i32 0, i32 -1, i32 0, i32 0, i32 0)
266 ; CHECK: phi i64 addrspace(1)* [ %obj.relocated.casted, %callbb ], [ %obj, %entry ]
267 ; CHECK: phi i64 addrspace(1)*
268 ; CHECK-DAG: [ %obj, %entry ]
269 ; CHECK-DAG: [ %obj2.relocated.casted, %callbb ]
270 ; This is a phi outside the dominator region of the new defs inserted by
271 ; the safepoint, BUT we can't stop the search here or we miss the second
273 %phi1 = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj2, %callbb ]
277 ; CHECK-LABEL: join2:
278 ; CHECK: phi2 = phi i64 addrspace(1)*
280 ; CHECK-DAG: [ %obj2, %branch2 ]
281 %phi2 = phi i64 addrspace(1)* [ %obj, %join ], [ %obj2, %branch2 ]
282 ret i64 addrspace(1)* %phi2
286 declare void @do_safepoint()
288 declare i32 @llvm.experimental.gc.statepoint.p0f_isVoidf(void ()*, i32, i32, ...)
289 declare i32 @llvm.experimental.gc.statepoint.p0f_p1i8f(i8 addrspace(1)* ()*, i32, i32, ...)
290 declare i32 @llvm.experimental.gc.statepoint.p0f_isVoidi64f(void (i64)*, i32, i32, ...)
291 declare i32 @llvm.experimental.gc.statepoint.p0f_i32p1i64f(i32 (i64 addrspace(1)*)*, i32, i32, ...)
292 declare i8 addrspace(1)* @llvm.experimental.gc.result.ptr.p1i8(i32) #3