[llvm] [Transforms] Use range-based for loops (NFC) (PR #98725)
Kazu Hirata via llvm-commits
llvm-commits at lists.llvm.org
Sat Jul 13 01:28:43 PDT 2024
https://github.com/kazutakahirata created https://github.com/llvm/llvm-project/pull/98725
None
>From 13acb842a706b1933c39b25dd166a0c2d39c905d Mon Sep 17 00:00:00 2001
From: Kazu Hirata <kazu at google.com>
Date: Sat, 13 Jul 2024 00:55:07 -0700
Subject: [PATCH] [Transforms] Use range-based for loops (NFC)
---
llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp | 4 ++--
llvm/lib/Transforms/Scalar/Reassociate.cpp | 12 ++++++------
llvm/lib/Transforms/Utils/InlineFunction.cpp | 7 +++----
3 files changed, 11 insertions(+), 12 deletions(-)
diff --git a/llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp b/llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp
index 1c4a0d92dcde9..99cba5e1206fe 100644
--- a/llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp
+++ b/llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp
@@ -5953,8 +5953,8 @@ void LSRInstance::RewriteForPHI(
// formulae will not be implemented completely and some instructions
// will not be eliminated.
if (needUpdateFixups) {
- for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx)
- for (LSRFixup &Fixup : Uses[LUIdx].Fixups)
+ for (LSRUse &LU : Uses)
+ for (LSRFixup &Fixup : LU.Fixups)
// If fixup is supposed to rewrite some operand in the phi
// that was just updated, it may be already moved to
// another phi node. Such fixup requires update.
diff --git a/llvm/lib/Transforms/Scalar/Reassociate.cpp b/llvm/lib/Transforms/Scalar/Reassociate.cpp
index f7268e8b17d2f..e742d2ed12af1 100644
--- a/llvm/lib/Transforms/Scalar/Reassociate.cpp
+++ b/llvm/lib/Transforms/Scalar/Reassociate.cpp
@@ -596,8 +596,8 @@ void ReassociatePass::RewriteExprTree(BinaryOperator *I,
/// of leaf nodes as inner nodes cannot occur by remembering all of the future
/// leaves and refusing to reuse any of them as inner nodes.
SmallPtrSet<Value*, 8> NotRewritable;
- for (unsigned i = 0, e = Ops.size(); i != e; ++i)
- NotRewritable.insert(Ops[i].Op);
+ for (const ValueEntry &Op : Ops)
+ NotRewritable.insert(Op.Op);
// ExpressionChangedStart - Non-null if the rewritten expression differs from
// the original in some non-trivial way, requiring the clearing of optional
@@ -762,8 +762,8 @@ void ReassociatePass::RewriteExprTree(BinaryOperator *I,
}
// Throw away any left over nodes from the original expression.
- for (unsigned i = 0, e = NodesToRewrite.size(); i != e; ++i)
- RedoInsts.insert(NodesToRewrite[i]);
+ for (BinaryOperator *BO : NodesToRewrite)
+ RedoInsts.insert(BO);
}
/// Insert instructions before the instruction pointed to by BI,
@@ -1988,8 +1988,8 @@ void ReassociatePass::EraseInst(Instruction *I) {
I->eraseFromParent();
// Optimize its operands.
SmallPtrSet<Instruction *, 8> Visited; // Detect self-referential nodes.
- for (unsigned i = 0, e = Ops.size(); i != e; ++i)
- if (Instruction *Op = dyn_cast<Instruction>(Ops[i])) {
+ for (Value *V : Ops)
+ if (Instruction *Op = dyn_cast<Instruction>(V)) {
// If this is a node in an expression tree, climb to the expression root
// and add that since that's where optimization actually happens.
unsigned Opcode = Op->getOpcode();
diff --git a/llvm/lib/Transforms/Utils/InlineFunction.cpp b/llvm/lib/Transforms/Utils/InlineFunction.cpp
index 6cb6540d1a7b6..9c9fc7a49a9d1 100644
--- a/llvm/lib/Transforms/Utils/InlineFunction.cpp
+++ b/llvm/lib/Transforms/Utils/InlineFunction.cpp
@@ -1815,10 +1815,9 @@ static void fixupLineNumbers(Function *Fn, Function::iterator FI,
// Iterate over all instructions, updating metadata and debug-info records.
for (; FI != Fn->end(); ++FI) {
- for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); BI != BE;
- ++BI) {
- UpdateInst(*BI);
- for (DbgRecord &DVR : BI->getDbgRecordRange()) {
+ for (Instruction &I : *FI) {
+ UpdateInst(I);
+ for (DbgRecord &DVR : I.getDbgRecordRange()) {
UpdateDVR(&DVR);
}
}
More information about the llvm-commits
mailing list