1 ; RUN: opt %s -rewrite-statepoints-for-gc -rs4gc-use-deopt-bundles -S 2>&1 | FileCheck %s
3 ; The rewriting needs to make %obj loop variant by inserting a phi
4 ; of the original value and it's relocation.
6 declare i64 addrspace(1)* @generate_obj() "gc-leaf-function"
8 declare void @use_obj(i64 addrspace(1)*) "gc-leaf-function"
10 define void @def_use_safepoint() gc "statepoint-example" {
11 ; CHECK-LABEL: def_use_safepoint
12 ; CHECK: phi i64 addrspace(1)*
13 ; CHECK-DAG: [ %obj.relocated.casted, %loop ]
14 ; CHECK-DAG: [ %obj, %entry ]
16 %obj = call i64 addrspace(1)* @generate_obj()
19 loop: ; preds = %loop, %entry
20 call void @use_obj(i64 addrspace(1)* %obj)
21 call void @do_safepoint() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
25 declare void @do_safepoint()
27 declare void @parse_point(i64 addrspace(1)*)
29 define i64 addrspace(1)* @test1(i32 %caller, i8 addrspace(1)* %a, i8 addrspace(1)* %b, i32 %unknown) gc "statepoint-example" {
32 br i1 undef, label %left, label %right
34 left: ; preds = %entry
36 ; CHECK-NEXT: %a.cast = bitcast i8 addrspace(1)* %a to i64 addrspace(1)*
37 ; CHECK-NEXT: [[CAST_L:%.*]] = bitcast i8 addrspace(1)* %a to i64 addrspace(1)*
38 ; Our safepoint placement pass calls removeUnreachableBlocks, which does a bunch
39 ; of simplifications to branch instructions. This bug is visible only when
40 ; there are multiple branches into the same block from the same predecessor, and
41 ; the following ceremony is to make that artefact survive a call to
42 ; removeUnreachableBlocks. As an example, "br i1 undef, label %merge, label %merge"
43 ; will get simplified to "br label %merge" by removeUnreachableBlocks.
44 %a.cast = bitcast i8 addrspace(1)* %a to i64 addrspace(1)*
45 switch i32 %unknown, label %right [
52 right: ; preds = %left, %left, %entry
54 ; CHECK-NEXT: %b.cast = bitcast i8 addrspace(1)* %b to i64 addrspace(1)*
55 ; CHECK-NEXT: [[CAST_R:%.*]] = bitcast i8 addrspace(1)* %b to i64 addrspace(1)*
56 %b.cast = bitcast i8 addrspace(1)* %b to i64 addrspace(1)*
59 merge: ; preds = %right, %left, %left, %left
61 ; CHECK-NEXT: %value.base = phi i64 addrspace(1)* [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_R]], %right ], !is_base_value !0
62 %value = phi i64 addrspace(1)* [ %a.cast, %left ], [ %a.cast, %left ], [ %a.cast, %left ], [ %b.cast, %right ]
63 call void @parse_point(i64 addrspace(1)* %value) [ "deopt"(i32 0, i32 0, i32 0, i32 0, i32 0) ]
64 ret i64 addrspace(1)* %value
67 ;; The purpose of this test is to ensure that when two live values share a
68 ;; base defining value with inherent conflicts, we end up with a *single*
69 ;; base phi/select per such node. This is testing an optimization, not a
70 ;; fundemental correctness criteria
71 define void @test2(i1 %cnd, i64 addrspace(1)* %base_obj, i64 addrspace(1)* %base_arg2) gc "statepoint-example" {
74 %obj = getelementptr i64, i64 addrspace(1)* %base_obj, i32 1
77 ; CHECK: %current.base = phi i64 addrspace(1)*
78 ; CHECK-DAG: [ %base_obj, %entry ]
80 ; Given the two selects are equivelent, so are their base phis - ideally,
81 ; we'd have commoned these, but that's a missed optimization, not correctness.
82 ; CHECK-DAG: [ [[DISCARD:%.*.base.relocated.casted]], %loop ]
83 ; CHECK-NOT: extra.base
84 ; CHECK: next = select
85 ; CHECK: extra2.base = select
86 ; CHECK: extra2 = select
88 ;; Both 'next' and 'extra2' are live across the backedge safepoint...
90 loop: ; preds = %loop, %entry
91 %current = phi i64 addrspace(1)* [ %obj, %entry ], [ %next, %loop ]
92 %extra = phi i64 addrspace(1)* [ %obj, %entry ], [ %extra2, %loop ]
93 %nexta = getelementptr i64, i64 addrspace(1)* %current, i32 1
94 %next = select i1 %cnd, i64 addrspace(1)* %nexta, i64 addrspace(1)* %base_arg2
95 %extra2 = select i1 %cnd, i64 addrspace(1)* %nexta, i64 addrspace(1)* %base_arg2
96 call void @foo() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
100 define i64 addrspace(1)* @test3(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
101 ; CHECK-LABEL: @test3
103 br i1 %cnd, label %merge, label %taken
105 taken: ; preds = %entry
108 merge: ; preds = %taken, %entry
109 ; CHECK-LABEL: merge:
110 ; CHECK-NEXT: %bdv = phi
111 ; CHECK-NEXT: gc.statepoint
112 %bdv = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj2, %taken ]
113 call void @foo() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
114 ret i64 addrspace(1)* %bdv
117 define i64 addrspace(1)* @test4(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
118 ; CHECK-LABEL: @test4
120 br i1 %cnd, label %merge, label %taken
122 taken: ; preds = %entry
125 merge: ; preds = %taken, %entry
126 ; CHECK-LABEL: merge:
127 ; CHECK-NEXT: %bdv = phi
128 ; CHECK-NEXT: gc.statepoint
129 %bdv = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj, %taken ]
130 call void @foo() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
131 ret i64 addrspace(1)* %bdv
134 define i64 addrspace(1)* @test5(i1 %cnd, i64 addrspace(1)* %obj, i64 addrspace(1)* %obj2) gc "statepoint-example" {
135 ; CHECK-LABEL: @test5
139 merge: ; preds = %merge, %entry
140 ; CHECK-LABEL: merge:
141 ; CHECK-NEXT: %bdv = phi
143 %bdv = phi i64 addrspace(1)* [ %obj, %entry ], [ %obj2, %merge ]
144 br i1 %cnd, label %merge, label %next
146 next: ; preds = %merge
147 call void @foo() [ "deopt"(i32 0, i32 -1, i32 0, i32 0, i32 0) ]
148 ret i64 addrspace(1)* %bdv