Skip to content

Commit d6f6a4d

Browse files
committed
[LV] Use getCallWideningDecision in more places (NFC)
1 parent a1e041b commit d6f6a4d

File tree

1 file changed

+3
-4
lines changed

1 file changed

+3
-4
lines changed

llvm/lib/Transforms/Vectorize/LoopVectorize.cpp

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1202,7 +1202,7 @@ class LoopVectorizationCostModel {
12021202
CallWideningDecision getCallWideningDecision(CallInst *CI,
12031203
ElementCount VF) const {
12041204
assert(!VF.isScalar() && "Expected vector VF");
1205-
return CallWideningDecisions.at(std::make_pair(CI, VF));
1205+
return CallWideningDecisions.at({CI, VF});
12061206
}
12071207

12081208
/// Return True if instruction \p I is an optimizable truncate whose operand
@@ -2815,7 +2815,7 @@ LoopVectorizationCostModel::getVectorCallCost(CallInst *CI,
28152815
// We only need to calculate a cost if the VF is scalar; for actual vectors
28162816
// we should already have a pre-calculated cost at each VF.
28172817
if (!VF.isScalar())
2818-
return CallWideningDecisions.at(std::make_pair(CI, VF)).Cost;
2818+
return getCallWideningDecision(CI, VF).Cost;
28192819

28202820
Type *RetTy = CI->getType();
28212821
if (RecurrenceDescriptor::isFMulAddIntrinsic(CI))
@@ -3214,8 +3214,7 @@ bool LoopVectorizationCostModel::isScalarWithPredication(
32143214
case Instruction::Call:
32153215
if (VF.isScalar())
32163216
return true;
3217-
return CallWideningDecisions.at(std::make_pair(cast<CallInst>(I), VF))
3218-
.Kind == CM_Scalarize;
3217+
return getCallWideningDecision(cast<CallInst>(I), VF).Kind == CM_Scalarize;
32193218
case Instruction::Load:
32203219
case Instruction::Store: {
32213220
auto *Ptr = getLoadStorePointerOperand(I);

0 commit comments

Comments
 (0)