[llvm] [SimplifyCFG] Use range-based for loops (NFC) (PR #107180)
Kazu Hirata via llvm-commits
llvm-commits at lists.llvm.org
Tue Sep 3 20:38:20 PDT 2024
https://github.com/kazutakahirata created https://github.com/llvm/llvm-project/pull/107180
None
>From b25fe817397755a4de30b4fb3b03342e83d10d5b Mon Sep 17 00:00:00 2001
From: Kazu Hirata <kazu at google.com>
Date: Tue, 3 Sep 2024 20:34:04 -0700
Subject: [PATCH] [SimplifyCFG] Use range-based for loops (NFC)
---
llvm/lib/Transforms/Utils/SimplifyCFG.cpp | 12 ++++++------
1 file changed, 6 insertions(+), 6 deletions(-)
diff --git a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp
index 15de40c7b09962..f9db996cdc3583 100644
--- a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp
+++ b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp
@@ -1000,20 +1000,20 @@ bool SimplifyCFGOpt::simplifyEqualityComparisonWithOnlyPredecessor(
// which value (or set of values) this is.
ConstantInt *TIV = nullptr;
BasicBlock *TIBB = TI->getParent();
- for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
- if (PredCases[i].Dest == TIBB) {
+ for (const auto &[Value, Dest] : PredCases)
+ if (Dest == TIBB) {
if (TIV)
return false; // Cannot handle multiple values coming to this block.
- TIV = PredCases[i].Value;
+ TIV = Value;
}
assert(TIV && "No edge from pred to succ?");
// Okay, we found the one constant that our value can be if we get into TI's
// BB. Find out which successor will unconditionally be branched to.
BasicBlock *TheRealDest = nullptr;
- for (unsigned i = 0, e = ThisCases.size(); i != e; ++i)
- if (ThisCases[i].Value == TIV) {
- TheRealDest = ThisCases[i].Dest;
+ for (const auto &[Value, Dest] : ThisCases)
+ if (Value == TIV) {
+ TheRealDest = Dest;
break;
}
More information about the llvm-commits
mailing list