[llvm] [LV] Use getCallWideningDecision in more places (NFC) (PR #134236)
via llvm-commits
llvm-commits at lists.llvm.org
Thu Apr 3 04:45:46 PDT 2025
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-vectorizers
Author: Ramkumar Ramachandra (artagnon)
<details>
<summary>Changes</summary>
---
Full diff: https://github.com/llvm/llvm-project/pull/134236.diff
1 Files Affected:
- (modified) llvm/lib/Transforms/Vectorize/LoopVectorize.cpp (+3-4)
``````````diff
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index 55cc801e91452..4133e78d210bb 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -1202,7 +1202,7 @@ class LoopVectorizationCostModel {
CallWideningDecision getCallWideningDecision(CallInst *CI,
ElementCount VF) const {
assert(!VF.isScalar() && "Expected vector VF");
- return CallWideningDecisions.at(std::make_pair(CI, VF));
+ return CallWideningDecisions.at({CI, VF});
}
/// Return True if instruction \p I is an optimizable truncate whose operand
@@ -2815,7 +2815,7 @@ LoopVectorizationCostModel::getVectorCallCost(CallInst *CI,
// We only need to calculate a cost if the VF is scalar; for actual vectors
// we should already have a pre-calculated cost at each VF.
if (!VF.isScalar())
- return CallWideningDecisions.at(std::make_pair(CI, VF)).Cost;
+ return getCallWideningDecision(CI, VF).Cost;
Type *RetTy = CI->getType();
if (RecurrenceDescriptor::isFMulAddIntrinsic(CI))
@@ -3214,8 +3214,7 @@ bool LoopVectorizationCostModel::isScalarWithPredication(
case Instruction::Call:
if (VF.isScalar())
return true;
- return CallWideningDecisions.at(std::make_pair(cast<CallInst>(I), VF))
- .Kind == CM_Scalarize;
+ return getCallWideningDecision(cast<CallInst>(I), VF).Kind == CM_Scalarize;
case Instruction::Load:
case Instruction::Store: {
auto *Ptr = getLoadStorePointerOperand(I);
``````````
</details>
https://github.com/llvm/llvm-project/pull/134236
More information about the llvm-commits
mailing list