diff options
author | Kazu Hirata <kazu@google.com> | 2021-02-07 09:49:36 -0800 |
---|---|---|
committer | Kazu Hirata <kazu@google.com> | 2021-02-07 09:49:36 -0800 |
commit | be23012d5a84fefdb6d0a267f9ffb4bafb4804d7 (patch) | |
tree | 286d9b13a8c93c76ae9566fd8e81380116f9c358 /llvm/lib/Transforms/Utils/LoopSimplify.cpp | |
parent | 92a6055835e26254429b5c1bfc889ab1bb711d1d (diff) | |
download | llvm-be23012d5a84fefdb6d0a267f9ffb4bafb4804d7.zip llvm-be23012d5a84fefdb6d0a267f9ffb4bafb4804d7.tar.gz llvm-be23012d5a84fefdb6d0a267f9ffb4bafb4804d7.tar.bz2 |
[Transforms/Utils] Use range-based for loops (NFC)
Diffstat (limited to 'llvm/lib/Transforms/Utils/LoopSimplify.cpp')
-rw-r--r-- | llvm/lib/Transforms/Utils/LoopSimplify.cpp | 18 |
1 files changed, 5 insertions, 13 deletions
diff --git a/llvm/lib/Transforms/Utils/LoopSimplify.cpp b/llvm/lib/Transforms/Utils/LoopSimplify.cpp index 2e10433..6adfeaf 100644 --- a/llvm/lib/Transforms/Utils/LoopSimplify.cpp +++ b/llvm/lib/Transforms/Utils/LoopSimplify.cpp @@ -127,9 +127,7 @@ BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, // Compute the set of predecessors of the loop that are not in the loop. SmallVector<BasicBlock*, 8> OutsideBlocks; - for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); - PI != PE; ++PI) { - BasicBlock *P = *PI; + for (BasicBlock *P : predecessors(Header)) { if (!L->contains(P)) { // Coming in from outside the loop? // If the loop is branched to from an indirect terminator, we won't // be able to fully transform the loop, because it prohibits @@ -381,9 +379,7 @@ static BasicBlock *insertUniqueBackedgeBlock(Loop *L, BasicBlock *Preheader, // Figure out which basic blocks contain back-edges to the loop header. std::vector<BasicBlock*> BackedgeBlocks; - for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ - BasicBlock *P = *I; - + for (BasicBlock *P : predecessors(Header)) { // Indirect edges cannot be split, so we must fail if we find one. if (P->getTerminator()->isIndirectTerminator()) return nullptr; @@ -505,12 +501,9 @@ ReprocessLoop: if (*BB == L->getHeader()) continue; SmallPtrSet<BasicBlock*, 4> BadPreds; - for (pred_iterator PI = pred_begin(*BB), - PE = pred_end(*BB); PI != PE; ++PI) { - BasicBlock *P = *PI; + for (BasicBlock *P : predecessors(*BB)) if (!L->contains(P)) BadPreds.insert(P); - } // Delete each unique out-of-loop (and thus dead) predecessor. for (BasicBlock *P : BadPreds) { @@ -904,9 +897,8 @@ static void verifyLoop(Loop *L) { // Indirectbr can interfere with preheader and unique backedge insertion. if (!L->getLoopPreheader() || !L->getLoopLatch()) { bool HasIndBrPred = false; - for (pred_iterator PI = pred_begin(L->getHeader()), - PE = pred_end(L->getHeader()); PI != PE; ++PI) - if (isa<IndirectBrInst>((*PI)->getTerminator())) { + for (BasicBlock *Pred : predecessors(L->getHeader())) + if (isa<IndirectBrInst>(Pred->getTerminator())) { HasIndBrPred = true; break; } |