From 58d7fbf250659246fcca9417a91170a681b1850a Mon Sep 17 00:00:00 2001 From: Devang Patel Date: Fri, 20 Apr 2007 20:04:37 +0000 Subject: [PATCH] Avoid recursion. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36272 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Utils/LoopSimplify.cpp | 19 +++++++++++++------ 1 file changed, 13 insertions(+), 6 deletions(-) diff --git a/lib/Transforms/Utils/LoopSimplify.cpp b/lib/Transforms/Utils/LoopSimplify.cpp index 7d34b95cba5..d27bc8c7ad2 100644 --- a/lib/Transforms/Utils/LoopSimplify.cpp +++ b/lib/Transforms/Utils/LoopSimplify.cpp @@ -407,13 +407,20 @@ BasicBlock *LoopSimplify::RewriteLoopExitBlock(Loop *L, BasicBlock *Exit) { /// AddBlockAndPredsToSet - Add the specified block, and all of its /// predecessors, to the specified set, if it's not already in there. Stop /// predecessor traversal when we reach StopBlock. -static void AddBlockAndPredsToSet(BasicBlock *BB, BasicBlock *StopBlock, +static void AddBlockAndPredsToSet(BasicBlock *InputBB, BasicBlock *StopBlock, std::set &Blocks) { - if (!Blocks.insert(BB).second) return; // already processed. - if (BB == StopBlock) return; // Stop here! - - for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) - AddBlockAndPredsToSet(*I, StopBlock, Blocks); + std::vector WorkList; + WorkList.push_back(InputBB); + do { + BasicBlock *BB = WorkList.back(); WorkList.pop_back(); + if (Blocks.insert(BB).second && BB != StopBlock) + // If BB is not already processed and it is not a stop block then + // insert its predecessor in the work list + for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { + BasicBlock *WBB = *I; + WorkList.push_back(WBB); + } + } while(!WorkList.empty()); } /// FindPHIToPartitionLoops - The first part of loop-nestification is to find a