From 52da61fb5cb061c702bc9c45e73dc22ab1489c8e Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Mon, 5 Feb 2007 23:31:26 +0000 Subject: Simplify use of DFBlocks, this makes no noticable performance difference, but paves the way to eliminate BBNumbers. llvm-svn: 33938 --- llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp') diff --git a/llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp b/llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp index 39a4c897cfe..7a5828d0d65 100644 --- a/llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp +++ b/llvm/lib/Transforms/Utils/PromoteMemoryToRegister.cpp @@ -272,7 +272,7 @@ void PromoteMem2Reg::run() { // unsigned CurrentVersion = 0; SmallPtrSet InsertedPHINodes; - std::vector DFBlocks; + std::vector > DFBlocks; while (!DefiningBlocks.empty()) { BasicBlock *BB = DefiningBlocks.back(); DefiningBlocks.pop_back(); @@ -289,13 +289,13 @@ void PromoteMem2Reg::run() { // processing blocks in order of the occurance in the function. for (DominanceFrontier::DomSetType::const_iterator P = S.begin(), PE = S.end(); P != PE; ++P) - DFBlocks.push_back(BBNumbers.getNumber(*P)); + DFBlocks.push_back(std::make_pair(BBNumbers.getNumber(*P), *P)); // Sort by which the block ordering in the function. std::sort(DFBlocks.begin(), DFBlocks.end()); for (unsigned i = 0, e = DFBlocks.size(); i != e; ++i) { - BasicBlock *BB = BBNumbers.getBlock(DFBlocks[i]); + BasicBlock *BB = DFBlocks[i].second; if (QueuePhiNode(BB, AllocaNum, CurrentVersion, InsertedPHINodes)) DefiningBlocks.push_back(BB); } -- cgit v1.2.3