From: Bill Wendling Date: Thu, 19 Apr 2012 23:31:07 +0000 (+0000) Subject: Put this expensive check below the less expensive ones. X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=dc21604d4af9cbe27d7fa067f7411e334ba5186e;p=oota-llvm.git Put this expensive check below the less expensive ones. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@155166 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/Transforms/Scalar/LoopUnswitch.cpp b/lib/Transforms/Scalar/LoopUnswitch.cpp index 00ecc749af0..04b825b168f 100644 --- a/lib/Transforms/Scalar/LoopUnswitch.cpp +++ b/lib/Transforms/Scalar/LoopUnswitch.cpp @@ -409,15 +409,6 @@ bool LoopUnswitch::processCurrentLoop() { if (!currentLoop->isSafeToClone()) return false; - // Loops with invokes, whose unwind edge escapes the loop, cannot be - // unswitched because splitting their edges are non-trivial and don't preserve - // loop simplify information. - for (Loop::block_iterator I = currentLoop->block_begin(), - E = currentLoop->block_end(); I != E; ++I) - if (const InvokeInst *II = dyn_cast((*I)->getTerminator())) - if (!currentLoop->contains(II->getUnwindDest())) - return false; - // Without dedicated exits, splitting the exit edge may fail. if (!currentLoop->hasDedicatedExits()) return false; @@ -429,6 +420,15 @@ bool LoopUnswitch::processCurrentLoop() { if (!BranchesInfo.countLoop(currentLoop)) return false; + // Loops with invokes, whose unwind edge escapes the loop, cannot be + // unswitched because splitting their edges are non-trivial and don't preserve + // loop simplify information. + for (Loop::block_iterator I = currentLoop->block_begin(), + E = currentLoop->block_end(); I != E; ++I) + if (const InvokeInst *II = dyn_cast((*I)->getTerminator())) + if (!currentLoop->contains(II->getUnwindDest())) + return false; + // Loop over all of the basic blocks in the loop. If we find an interior // block that is branching on a loop-invariant condition, we can unswitch this // loop.