[llvm] 0d1d95e - [Transforms] Use a range-based for loop (NFC) (#105769)

[via llvm-commits]

Author: Kazu Hirata
Date: 2024-08-23T05:56:27-07:00
New Revision: 0d1d95ecc8cb0fc716f6535c5ceb403d42ef4862

URL: https://github.com/llvm/llvm-project/commit/0d1d95ecc8cb0fc716f6535c5ceb403d42ef4862
DIFF: https://github.com/llvm/llvm-project/commit/0d1d95ecc8cb0fc716f6535c5ceb403d42ef4862.diff

LOG: [Transforms] Use a range-based for loop (NFC) (#105769)

Added: 
    

Modified: 
    llvm/lib/Transforms/Scalar/PlaceSafepoints.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Transforms/Scalar/PlaceSafepoints.cpp b/llvm/lib/Transforms/Scalar/PlaceSafepoints.cpp
index bf86be0dd387f0..aa059cd99cc1ba 100644
--- a/llvm/lib/Transforms/Scalar/PlaceSafepoints.cpp
+++ b/llvm/lib/Transforms/Scalar/PlaceSafepoints.cpp
@@ -331,12 +331,9 @@ bool PlaceSafepointsPass::runImpl(Function &F, const TargetLibraryInfo &TLI) {
         // and b) edges to distinct loop headers.  We need to insert pools on
         // each.
         SetVector<BasicBlock *> Headers;
-        for (unsigned i = 0; i < Term->getNumSuccessors(); i++) {
-          BasicBlock *Succ = Term->getSuccessor(i);
-          if (DT.dominates(Succ, Term->getParent())) {
+        for (BasicBlock *Succ : successors(Term->getParent()))
+          if (DT.dominates(Succ, Term->getParent()))
             Headers.insert(Succ);
-          }
-        }
         assert(!Headers.empty() && "poll location is not a loop latch?");
 
         // The split loop structure here is so that we only need to recalculate