From 67cfbaac8973f1f0cf85bd2e90c74b42792ceada Mon Sep 17 00:00:00 2001 From: Michael Zolotukhin Date: Tue, 15 May 2018 18:40:29 +0000 Subject: [PATCH] [MemorySSA] Don't sort IDF blocks. Summary: After r332167 we started to sort the IDF blocks inside IDF calculation, so there is no need to re-sort them on the user site. The test changes are due to a slightly different order we're using now (originally we used DFSInNumber and now the blocks are sorted by a pair (LevelFromRoot, DFSInNumber)). Reviewers: dberlin, mgrang Subscribers: Prazek, hiraditya, george.burgess.iv, llvm-commits Differential Revision: https://reviews.llvm.org/D46899 llvm-svn: 332385 --- llvm/include/llvm/Analysis/MemorySSA.h | 3 +- llvm/lib/Analysis/MemorySSA.cpp | 13 ++----- llvm/test/Analysis/MemorySSA/cyclicphi.ll | 24 ++++++------- llvm/test/Analysis/MemorySSA/invariant-groups.ll | 42 +++++++++++----------- llvm/test/Analysis/MemorySSA/many-dom-backedge.ll | 20 +++++------ llvm/test/Analysis/MemorySSA/many-doms.ll | 18 +++++----- llvm/test/Analysis/MemorySSA/multi-edges.ll | 8 ++--- .../Analysis/MemorySSA/multiple-backedges-hal.ll | 10 +++--- llvm/test/Analysis/MemorySSA/phi-translation.ll | 30 ++++++++-------- 9 files changed, 79 insertions(+), 89 deletions(-) diff --git a/llvm/include/llvm/Analysis/MemorySSA.h b/llvm/include/llvm/Analysis/MemorySSA.h index c78a175..3a5349a 100644 --- a/llvm/include/llvm/Analysis/MemorySSA.h +++ b/llvm/include/llvm/Analysis/MemorySSA.h @@ -776,8 +776,7 @@ private: MemoryPhi *createMemoryPhi(BasicBlock *BB); MemoryUseOrDef *createNewAccess(Instruction *); MemoryAccess *findDominatingDef(BasicBlock *, enum InsertionPlace); - void placePHINodes(const SmallPtrSetImpl &, - const DenseMap &); + void placePHINodes(const SmallPtrSetImpl &); MemoryAccess *renameBlock(BasicBlock *, MemoryAccess *, bool); void renameSuccessorPhis(BasicBlock *, MemoryAccess *, bool); void renamePass(DomTreeNode *, MemoryAccess *IncomingVal, diff --git a/llvm/lib/Analysis/MemorySSA.cpp b/llvm/lib/Analysis/MemorySSA.cpp index f2fd204..6d313bc 100644 --- a/llvm/lib/Analysis/MemorySSA.cpp +++ b/llvm/lib/Analysis/MemorySSA.cpp @@ -1319,19 +1319,13 @@ void MemorySSA::OptimizeUses::optimizeUses() { } void MemorySSA::placePHINodes( - const SmallPtrSetImpl &DefiningBlocks, - const DenseMap &BBNumbers) { + const SmallPtrSetImpl &DefiningBlocks) { // Determine where our MemoryPhi's should go ForwardIDFCalculator IDFs(*DT); IDFs.setDefiningBlocks(DefiningBlocks); SmallVector IDFBlocks; IDFs.calculate(IDFBlocks); - llvm::sort(IDFBlocks.begin(), IDFBlocks.end(), - [&BBNumbers](const BasicBlock *A, const BasicBlock *B) { - return BBNumbers.lookup(A) < BBNumbers.lookup(B); - }); - // Now place MemoryPhi nodes. for (auto &BB : IDFBlocks) createMemoryPhi(BB); @@ -1347,8 +1341,6 @@ void MemorySSA::buildMemorySSA() { BasicBlock &StartingPoint = F.getEntryBlock(); LiveOnEntryDef.reset(new MemoryDef(F.getContext(), nullptr, nullptr, &StartingPoint, NextID++)); - DenseMap BBNumbers; - unsigned NextBBNum = 0; // We maintain lists of memory accesses per-block, trading memory for time. We // could just look up the memory access for every possible instruction in the @@ -1357,7 +1349,6 @@ void MemorySSA::buildMemorySSA() { // Go through each block, figure out where defs occur, and chain together all // the accesses. for (BasicBlock &B : F) { - BBNumbers[&B] = NextBBNum++; bool InsertIntoDef = false; AccessList *Accesses = nullptr; DefsList *Defs = nullptr; @@ -1379,7 +1370,7 @@ void MemorySSA::buildMemorySSA() { if (InsertIntoDef) DefiningBlocks.insert(&B); } - placePHINodes(DefiningBlocks, BBNumbers); + placePHINodes(DefiningBlocks); // Now do regular SSA renaming on the MemoryDef/MemoryUse. Visited will get // filled in with all blocks. diff --git a/llvm/test/Analysis/MemorySSA/cyclicphi.ll b/llvm/test/Analysis/MemorySSA/cyclicphi.ll index 6e91db9..39b35b0 100644 --- a/llvm/test/Analysis/MemorySSA/cyclicphi.ll +++ b/llvm/test/Analysis/MemorySSA/cyclicphi.ll @@ -11,7 +11,7 @@ define hidden void @quux(%struct.hoge *%f) align 2 { br label %bb26 bb26: ; preds = %bb77, %0 -; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3}) +; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK-NEXT: br i1 undef, label %bb68, label %bb77 br i1 undef, label %bb68, label %bb77 @@ -19,14 +19,14 @@ bb68: ; preds = %bb26 ; CHECK: MemoryUse(liveOnEntry) ; CHECK-NEXT: %tmp69 = load i64, i64* null, align 8 %tmp69 = load i64, i64* null, align 8 -; CHECK: 1 = MemoryDef(2) +; CHECK: 1 = MemoryDef(3) ; CHECK-NEXT: store i64 %tmp69, i64* %tmp, align 8 store i64 %tmp69, i64* %tmp, align 8 br label %bb77 bb77: ; preds = %bb68, %bb26 -; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1}) -; CHECK: MemoryUse(3) +; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) +; CHECK: MemoryUse(2) ; CHECK-NEXT: %tmp78 = load i64*, i64** %tmp25, align 8 %tmp78 = load i64*, i64** %tmp25, align 8 %tmp79 = getelementptr inbounds i64, i64* %tmp78, i64 undef @@ -41,21 +41,21 @@ define void @quux_skip(%struct.hoge* noalias %f, i64* noalias %g) align 2 { br label %bb26 bb26: ; preds = %bb77, %0 -; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3}) +; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK-NEXT: br i1 undef, label %bb68, label %bb77 br i1 undef, label %bb68, label %bb77 bb68: ; preds = %bb26 -; CHECK: MemoryUse(2) +; CHECK: MemoryUse(3) ; CHECK-NEXT: %tmp69 = load i64, i64* %g, align 8 %tmp69 = load i64, i64* %g, align 8 -; CHECK: 1 = MemoryDef(2) +; CHECK: 1 = MemoryDef(3) ; CHECK-NEXT: store i64 %tmp69, i64* %g, align 8 store i64 %tmp69, i64* %g, align 8 br label %bb77 bb77: ; preds = %bb68, %bb26 -; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1}) +; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK: MemoryUse(liveOnEntry) ; CHECK-NEXT: %tmp78 = load i64*, i64** %tmp25, align 8 %tmp78 = load i64*, i64** %tmp25, align 8 @@ -101,23 +101,23 @@ define void @quux_nodominate(%struct.hoge* noalias %f, i64* noalias %g) align 2 br label %bb26 bb26: ; preds = %bb77, %0 -; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3}) +; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: MemoryUse(liveOnEntry) ; CHECK-NEXT: load i64*, i64** %tmp25, align 8 load i64*, i64** %tmp25, align 8 br i1 undef, label %bb68, label %bb77 bb68: ; preds = %bb26 -; CHECK: MemoryUse(2) +; CHECK: MemoryUse(3) ; CHECK-NEXT: %tmp69 = load i64, i64* %g, align 8 %tmp69 = load i64, i64* %g, align 8 -; CHECK: 1 = MemoryDef(2) +; CHECK: 1 = MemoryDef(3) ; CHECK-NEXT: store i64 %tmp69, i64* %g, align 8 store i64 %tmp69, i64* %g, align 8 br label %bb77 bb77: ; preds = %bb68, %bb26 -; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1}) +; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK-NEXT: br label %bb26 br label %bb26 } diff --git a/llvm/test/Analysis/MemorySSA/invariant-groups.ll b/llvm/test/Analysis/MemorySSA/invariant-groups.ll index a2535d5..14f83cb 100644 --- a/llvm/test/Analysis/MemorySSA/invariant-groups.ll +++ b/llvm/test/Analysis/MemorySSA/invariant-groups.ll @@ -151,28 +151,28 @@ entry: Loop.Body: ; 5 = MemoryPhi({entry,3},{Loop.Body,4},{Loop.End,6}) -; CHECK: MemoryUse(5) +; CHECK: MemoryUse(6) ; CHECK-NEXT: %0 = load i8 %0 = load i8, i8* %after, !invariant.group !0 ; FIXME: MemoryUse(1) -; CHECK: MemoryUse(5) +; CHECK: MemoryUse(6) ; CHECK-NEXT: %1 = load i8 %1 = load i8, i8* %p, !invariant.group !0 -; CHECK: 4 = MemoryDef(5) +; CHECK: 4 = MemoryDef(6) store i8 4, i8* %after, !invariant.group !0 br i1 undef, label %Loop.End, label %Loop.Body Loop.End: ; 6 = MemoryPhi({entry,3},{Loop.Body,4}) -; CHECK: MemoryUse(6) +; CHECK: MemoryUse(5) ; CHECK-NEXT: %2 = load %2 = load i8, i8* %after, align 4, !invariant.group !0 ; FIXME: MemoryUse(1) -; CHECK: MemoryUse(6) +; CHECK: MemoryUse(5) ; CHECK-NEXT: %3 = load %3 = load i8, i8* %p, align 4, !invariant.group !0 br i1 undef, label %Ret, label %Loop.Body @@ -197,16 +197,16 @@ entry: br i1 undef, label %Loop.Body, label %Loop.End Loop.Body: -; CHECK: 7 = MemoryPhi({entry,3},{Loop.Body,4},{Loop.next,5},{Loop.End,6}) -; CHECK: MemoryUse(7) +; CHECK: 8 = MemoryPhi({entry,3},{Loop.Body,4},{Loop.next,5},{Loop.End,6}) +; CHECK: MemoryUse(8) ; CHECK-NEXT: %0 = load i8 %0 = load i8, i8* %after, !invariant.group !0 -; CHECK: 4 = MemoryDef(7) +; CHECK: 4 = MemoryDef(8) ; CHECK-NEXT: call void @clobber8 call void @clobber8(i8* %after) -; FIXME: MemoryUse(7) +; FIXME: MemoryUse(8) ; CHECK: MemoryUse(4) ; CHECK-NEXT: %1 = load i8 %1 = load i8, i8* %after, !invariant.group !0 @@ -217,7 +217,7 @@ Loop.next: ; CHECK-NEXT: call void @clobber8 call void @clobber8(i8* %after) -; FIXME: MemoryUse(7) +; FIXME: MemoryUse(8) ; CHECK: MemoryUse(5) ; CHECK-NEXT: %2 = load i8 %2 = load i8, i8* %after, !invariant.group !0 @@ -225,16 +225,16 @@ Loop.next: br i1 undef, label %Loop.End, label %Loop.Body Loop.End: -; CHECK: 8 = MemoryPhi({entry,3},{Loop.next,5}) -; CHECK: MemoryUse(8) +; CHECK: 7 = MemoryPhi({entry,3},{Loop.next,5}) +; CHECK: MemoryUse(7) ; CHECK-NEXT: %3 = load %3 = load i8, i8* %after, align 4, !invariant.group !0 -; CHECK: 6 = MemoryDef(8) +; CHECK: 6 = MemoryDef(7) ; CHECK-NEXT: call void @clobber8 call void @clobber8(i8* %after) -; FIXME: MemoryUse(8) +; FIXME: MemoryUse(7) ; CHECK: MemoryUse(6) ; CHECK-NEXT: %4 = load %4 = load i8, i8* %after, align 4, !invariant.group !0 @@ -263,28 +263,28 @@ Loop.Pre: %0 = load i8, i8* %after, !invariant.group !0 br label %Loop.Body Loop.Body: -; CHECK: 5 = MemoryPhi({Loop.Pre,3},{Loop.Body,4},{Loop.End,6}) -; CHECK-NEXT: MemoryUse(5) +; CHECK: 6 = MemoryPhi({Loop.Pre,3},{Loop.Body,4},{Loop.End,5}) +; CHECK-NEXT: MemoryUse(6) ; CHECK-NEXT: %1 = load i8 %1 = load i8, i8* %after, !invariant.group !0 ; FIXME: MemoryUse(2) -; CHECK: MemoryUse(5) +; CHECK: MemoryUse(6) ; CHECK-NEXT: %2 = load i8 %2 = load i8, i8* %p, !invariant.group !0 -; CHECK: 4 = MemoryDef(5) +; CHECK: 4 = MemoryDef(6) store i8 4, i8* %after, !invariant.group !0 br i1 undef, label %Loop.End, label %Loop.Body Loop.End: -; CHECK: 6 = MemoryPhi({entry,3},{Loop.Body,4}) -; CHECK-NEXT: MemoryUse(6) +; CHECK: 5 = MemoryPhi({entry,3},{Loop.Body,4}) +; CHECK-NEXT: MemoryUse(5) ; CHECK-NEXT: %3 = load %3 = load i8, i8* %after, align 4, !invariant.group !0 ; FIXME: MemoryUse(2) -; CHECK: MemoryUse(6) +; CHECK: MemoryUse(5) ; CHECK-NEXT: %4 = load %4 = load i8, i8* %p, align 4, !invariant.group !0 br i1 undef, label %Ret, label %Loop.Body diff --git a/llvm/test/Analysis/MemorySSA/many-dom-backedge.ll b/llvm/test/Analysis/MemorySSA/many-dom-backedge.ll index c2216a4..3d76f4a 100644 --- a/llvm/test/Analysis/MemorySSA/many-dom-backedge.ll +++ b/llvm/test/Analysis/MemorySSA/many-dom-backedge.ll @@ -11,7 +11,7 @@ entry: br label %loopbegin loopbegin: -; CHECK: 8 = MemoryPhi({entry,liveOnEntry},{sw.epilog,6}) +; CHECK: 9 = MemoryPhi({entry,liveOnEntry},{sw.epilog,6}) ; CHECK-NEXT: %n = %n = phi i32 [ 0, %entry ], [ %1, %sw.epilog ] %m = alloca i32, align 4 @@ -23,42 +23,42 @@ loopbegin: ] sw.bb: -; CHECK: 1 = MemoryDef(8) +; CHECK: 1 = MemoryDef(9) ; CHECK-NEXT: store i32 1 store i32 1, i32* %m, align 4 br label %sw.epilog sw.bb1: -; CHECK: 2 = MemoryDef(8) +; CHECK: 2 = MemoryDef(9) ; CHECK-NEXT: store i32 2 store i32 2, i32* %m, align 4 br label %sw.epilog sw.bb2: -; CHECK: 3 = MemoryDef(8) +; CHECK: 3 = MemoryDef(9) ; CHECK-NEXT: store i32 3 store i32 3, i32* %m, align 4 br label %sw.epilog sw.bb3: -; CHECK: 9 = MemoryPhi({loopbegin,8},{sw.almostexit,6}) -; CHECK: 4 = MemoryDef(9) +; CHECK: 10 = MemoryPhi({loopbegin,9},{sw.almostexit,6}) +; CHECK: 4 = MemoryDef(10) ; CHECK-NEXT: store i32 4 store i32 4, i32* %m, align 4 br label %sw.epilog sw.default: -; CHECK: 5 = MemoryDef(8) +; CHECK: 5 = MemoryDef(9) ; CHECK-NEXT: store i32 5 store i32 5, i32* %m, align 4 br label %sw.epilog sw.epilog: -; CHECK: 10 = MemoryPhi({sw.default,5},{sw.bb3,4},{sw.bb,1},{sw.bb1,2},{sw.bb2,3}) -; CHECK-NEXT: MemoryUse(10) +; CHECK: 8 = MemoryPhi({sw.default,5},{sw.bb3,4},{sw.bb,1},{sw.bb1,2},{sw.bb2,3}) +; CHECK-NEXT: MemoryUse(8) ; CHECK-NEXT: %0 = %0 = load i32, i32* %m, align 4 -; CHECK: 6 = MemoryDef(10) +; CHECK: 6 = MemoryDef(8) ; CHECK-NEXT: %1 = %1 = load volatile i32, i32* %p, align 4 %2 = icmp eq i32 %0, %1 diff --git a/llvm/test/Analysis/MemorySSA/many-doms.ll b/llvm/test/Analysis/MemorySSA/many-doms.ll index 1f57cbf..d2e6c6f 100644 --- a/llvm/test/Analysis/MemorySSA/many-doms.ll +++ b/llvm/test/Analysis/MemorySSA/many-doms.ll @@ -10,7 +10,7 @@ entry: br label %loopbegin loopbegin: -; CHECK: 7 = MemoryPhi({entry,liveOnEntry},{sw.epilog,6}) +; CHECK: 8 = MemoryPhi({entry,liveOnEntry},{sw.epilog,6}) ; CHECK-NEXT: %n = %n = phi i32 [ 0, %entry ], [ %1, %sw.epilog ] %m = alloca i32, align 4 @@ -22,41 +22,41 @@ loopbegin: ] sw.bb: -; CHECK: 1 = MemoryDef(7) +; CHECK: 1 = MemoryDef(8) ; CHECK-NEXT: store i32 1 store i32 1, i32* %m, align 4 br label %sw.epilog sw.bb1: -; CHECK: 2 = MemoryDef(7) +; CHECK: 2 = MemoryDef(8) ; CHECK-NEXT: store i32 2 store i32 2, i32* %m, align 4 br label %sw.epilog sw.bb2: -; CHECK: 3 = MemoryDef(7) +; CHECK: 3 = MemoryDef(8) ; CHECK-NEXT: store i32 3 store i32 3, i32* %m, align 4 br label %sw.epilog sw.bb3: -; CHECK: 4 = MemoryDef(7) +; CHECK: 4 = MemoryDef(8) ; CHECK-NEXT: store i32 4 store i32 4, i32* %m, align 4 br label %sw.epilog sw.default: -; CHECK: 5 = MemoryDef(7) +; CHECK: 5 = MemoryDef(8) ; CHECK-NEXT: store i32 5 store i32 5, i32* %m, align 4 br label %sw.epilog sw.epilog: -; CHECK: 8 = MemoryPhi({sw.default,5},{sw.bb,1},{sw.bb1,2},{sw.bb2,3},{sw.bb3,4}) -; CHECK-NEXT: MemoryUse(8) +; CHECK: 7 = MemoryPhi({sw.default,5},{sw.bb,1},{sw.bb1,2},{sw.bb2,3},{sw.bb3,4}) +; CHECK-NEXT: MemoryUse(7) ; CHECK-NEXT: %0 = %0 = load i32, i32* %m, align 4 -; CHECK: 6 = MemoryDef(8) +; CHECK: 6 = MemoryDef(7) ; CHECK-NEXT: %1 = %1 = load volatile i32, i32* %p, align 4 %2 = icmp eq i32 %0, %1 diff --git a/llvm/test/Analysis/MemorySSA/multi-edges.ll b/llvm/test/Analysis/MemorySSA/multi-edges.ll index 5d47728..c13fc01 100644 --- a/llvm/test/Analysis/MemorySSA/multi-edges.ll +++ b/llvm/test/Analysis/MemorySSA/multi-edges.ll @@ -13,15 +13,15 @@ entry: br i1 %a, label %Loop.Body, label %Loop.End Loop.Body: -; CHECK: 3 = MemoryPhi({entry,1},{Loop.End,4}) -; CHECK-NEXT: 2 = MemoryDef(3) +; CHECK: 4 = MemoryPhi({entry,1},{Loop.End,3}) +; CHECK-NEXT: 2 = MemoryDef(4) ; CHECK-NEXT: store i32 5 store i32 5, i32* %0, align 4 br i1 %a, label %Loop.End, label %Loop.End ; WhyDoWeEvenHaveThatLever.gif Loop.End: -; CHECK: 4 = MemoryPhi({entry,1},{Loop.Body,2},{Loop.Body,2}) -; CHECK-NEXT: MemoryUse(4) +; CHECK: 3 = MemoryPhi({entry,1},{Loop.Body,2},{Loop.Body,2}) +; CHECK-NEXT: MemoryUse(3) ; CHECK-NEXT: %1 = load %1 = load i32, i32* %0, align 4 %2 = icmp eq i32 5, %1 diff --git a/llvm/test/Analysis/MemorySSA/multiple-backedges-hal.ll b/llvm/test/Analysis/MemorySSA/multiple-backedges-hal.ll index 005a37c..473b368 100644 --- a/llvm/test/Analysis/MemorySSA/multiple-backedges-hal.ll +++ b/llvm/test/Analysis/MemorySSA/multiple-backedges-hal.ll @@ -42,22 +42,22 @@ Entry: br label %OuterLoop OuterLoop: -; CHECK: 4 = MemoryPhi({Entry,1},{InnerLoop.Tail,3}) +; CHECK: 5 = MemoryPhi({Entry,1},{InnerLoop.Tail,3}) ; CHECK-NEXT: %Val.Outer = %Val.Outer = call i8 @getValue() -; CHECK: 2 = MemoryDef(4) +; CHECK: 2 = MemoryDef(5) ; CHECK-NEXT: store i8 %Val.Outer store i8 %Val.Outer, i8* %Arg call void @doThingWithoutReading() br label %InnerLoop InnerLoop: -; CHECK: 5 = MemoryPhi({OuterLoop,2},{InnerLoop,3}) -; CHECK-NEXT: ; MemoryUse(5) +; CHECK: 4 = MemoryPhi({OuterLoop,2},{InnerLoop,3}) +; CHECK-NEXT: ; MemoryUse(4) ; CHECK-NEXT: %StartingAccess = load %StartingAccess = load i8, i8* %Arg, align 4 %Val.Inner = call i8 @getValue() -; CHECK: 3 = MemoryDef(5) +; CHECK: 3 = MemoryDef(4) ; CHECK-NEXT: store i8 %Val.Inner store i8 %Val.Inner, i8* %Arg call void @doThingWithoutReading() diff --git a/llvm/test/Analysis/MemorySSA/phi-translation.ll b/llvm/test/Analysis/MemorySSA/phi-translation.ll index c91faf2..3e94acd 100644 --- a/llvm/test/Analysis/MemorySSA/phi-translation.ll +++ b/llvm/test/Analysis/MemorySSA/phi-translation.ll @@ -45,15 +45,15 @@ if.then: br i1 %val2, label %phi.2, label %phi.3 phi.3: -; CHECK: 5 = MemoryPhi({entry,1},{if.then,2}) -; CHECK: 3 = MemoryDef(5) +; CHECK: 7 = MemoryPhi({entry,1},{if.then,2}) +; CHECK: 3 = MemoryDef(7) ; CHECK-NEXT: store i8 3, i8* %local2 store i8 3, i8* %local2 br i1 %val3, label %phi.2, label %phi.1 phi.2: -; CHECK: 6 = MemoryPhi({if.then,2},{phi.3,3}) -; CHECK: 4 = MemoryDef(6) +; CHECK: 5 = MemoryPhi({if.then,2},{phi.3,3}) +; CHECK: 4 = MemoryDef(5) ; CHECK-NEXT: store i8 4, i8* %local2 store i8 4, i8* %local2 br label %phi.1 @@ -61,7 +61,7 @@ phi.2: phi.1: ; Order matters here; phi.2 needs to come before phi.3, because that's the order ; they're visited in. -; CHECK: 7 = MemoryPhi({phi.2,4},{phi.3,3}) +; CHECK: 6 = MemoryPhi({phi.2,4},{phi.3,3}) ; CHECK: MemoryUse(1) ; CHECK-NEXT: load i8, i8* %local load i8, i8* %local @@ -120,15 +120,15 @@ define void @looped(i8* noalias %p1, i8* noalias %p2) { br label %loop.1 loop.1: -; CHECK: 5 = MemoryPhi({%0,1},{loop.3,4}) -; CHECK: 2 = MemoryDef(5) +; CHECK: 6 = MemoryPhi({%0,1},{loop.3,4}) +; CHECK: 2 = MemoryDef(6) ; CHECK-NEXT: store i8 0, i8* %p2 store i8 0, i8* %p2 br i1 undef, label %loop.2, label %loop.3 loop.2: -; CHECK: 6 = MemoryPhi({loop.1,2},{loop.3,4}) -; CHECK: 3 = MemoryDef(6) +; CHECK: 5 = MemoryPhi({loop.1,2},{loop.3,4}) +; CHECK: 3 = MemoryDef(5) ; CHECK-NEXT: store i8 1, i8* %p2 store i8 1, i8* %p2 br label %loop.3 @@ -149,12 +149,12 @@ define void @looped_visitedonlyonce(i8* noalias %p1, i8* noalias %p2) { br label %while.cond while.cond: -; CHECK: 4 = MemoryPhi({%0,liveOnEntry},{if.end,3}) +; CHECK: 5 = MemoryPhi({%0,liveOnEntry},{if.end,3}) ; CHECK-NEXT: br i1 undef, label %if.then, label %if.end br i1 undef, label %if.then, label %if.end if.then: -; CHECK: 1 = MemoryDef(4) +; CHECK: 1 = MemoryDef(5) ; CHECK-NEXT: store i8 0, i8* %p1 store i8 0, i8* %p1 br i1 undef, label %if.end, label %if.then2 @@ -166,14 +166,14 @@ if.then2: br label %if.end if.end: -; CHECK: 5 = MemoryPhi({while.cond,4},{if.then,1},{if.then2,2}) -; CHECK: MemoryUse(5) +; CHECK: 4 = MemoryPhi({while.cond,5},{if.then,1},{if.then2,2}) +; CHECK: MemoryUse(4) ; CHECK-NEXT: load i8, i8* %p1 load i8, i8* %p1 -; CHECK: 3 = MemoryDef(5) +; CHECK: 3 = MemoryDef(4) ; CHECK-NEXT: store i8 2, i8* %p2 store i8 2, i8* %p2 -; CHECK: MemoryUse(5) +; CHECK: MemoryUse(4) ; CHECK-NEXT: load i8, i8* %p1 load i8, i8* %p1 br label %while.cond -- 2.7.4