diff options
| author | Philip Reames <listmail@philipreames.com> | 2015-07-24 19:01:39 +0000 |
|---|---|---|
| committer | Philip Reames <listmail@philipreames.com> | 2015-07-24 19:01:39 +0000 |
| commit | fa2c630f798cd9df7b565f18cdf06821e294512e (patch) | |
| tree | 7304f55778d1c01c0ecd5a67ecfdcebef0d63263 /llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll | |
| parent | 7fb865ea8ea8134d1b8429366bcee361df3e5448 (diff) | |
| download | bcm5719-llvm-fa2c630f798cd9df7b565f18cdf06821e294512e.tar.gz bcm5719-llvm-fa2c630f798cd9df7b565f18cdf06821e294512e.zip | |
[RewriteStatepointsForGC] Adjust naming scheme to be more stable
The names for instructions inserted were previous dependent on iteration order. By deriving the names from the original instructions, we can avoid instability in tests without resorting to ordered traversals. It also makes the IR mildly easier to read at large scale.
llvm-svn: 243140
Diffstat (limited to 'llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll')
| -rw-r--r-- | llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll b/llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll index 879f3f9e24d..2b5b44aa695 100644 --- a/llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll +++ b/llvm/test/Transforms/RewriteStatepointsForGC/base-pointers.ll @@ -55,7 +55,7 @@ define i64 addrspace(1)* @test1(i32 %caller, i8 addrspace(1)* %a, i8 addrspace(1 merge: ; CHECK: merge: -; CHECK-NEXT: %base_phi = phi i64 addrspace(1)* [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_R]], %right ], !is_base_value !0 +; CHECK-NEXT: %value.base = phi i64 addrspace(1)* [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_L]], %left ], [ [[CAST_R]], %right ], !is_base_value !0 %value = phi i64 addrspace(1)* [ %a.cast, %left], [ %a.cast, %left], [ %a.cast, %left], [ %b.cast, %right] %safepoint_token = call i32 (i64, i32, void (i64 addrspace(1)*)*, i32, i32, ...) @llvm.experimental.gc.statepoint.p0f_isVoidp1i64f(i64 0, i32 0, void (i64 addrspace(1)*)* @parse_point, i32 1, i32 0, i64 addrspace(1)* %value, i32 0, i32 5, i32 0, i32 0, i32 0, i32 0, i32 0) @@ -74,16 +74,16 @@ entry: loop: ; preds = %loop, %entry ; CHECK-LABEL: loop -; CHECK: %base_phi = phi i64 addrspace(1)* +; CHECK: %current.base = phi i64 addrspace(1)* ; CHECK-DAG: [ %base_obj, %entry ] ; Given the two selects are equivelent, so are their base phis - ideally, ; we'd have commoned these, but that's a missed optimization, not correctness. -; CHECK-DAG: [ [[DISCARD:%base_select.*.relocated.casted]], %loop ] -; CHECK-NOT: base_phi2 +; CHECK-DAG: [ [[DISCARD:%.*.base.relocated.casted]], %loop ] +; CHECK-NOT: extra.base +; CHECK: next.base = select ; CHECK: next = select -; CHECK: base_select +; CHECK: extra2.base = select ; CHECK: extra2 = select -; CHECK: base_select ; CHECK: statepoint ;; Both 'next' and 'extra2' are live across the backedge safepoint... %current = phi i64 addrspace(1)* [ %obj, %entry ], [ %next, %loop ] @@ -97,4 +97,4 @@ loop: ; preds = %loop, %entry declare void @foo() declare i32 @llvm.experimental.gc.statepoint.p0f_isVoidf(i64, i32, void ()*, i32, i32, ...) -declare i32 @llvm.experimental.gc.statepoint.p0f_isVoidp1i64f(i64, i32, void (i64 addrspace(1)*)*, i32, i32, ...)
\ No newline at end of file +declare i32 @llvm.experimental.gc.statepoint.p0f_isVoidp1i64f(i64, i32, void (i64 addrspace(1)*)*, i32, i32, ...) |
