git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@312853
91177308-0d34-0410-b5e6-
96231b3b80d8
int PairwiseRdxCost;
int SplittingRdxCost;
- bool IsUnsigned = true;
switch (ReductionData.getKind()) {
case RK_Arithmetic:
PairwiseRdxCost =
break;
case RK_Min:
case RK_Max:
- IsUnsigned = false;
case RK_UMin:
case RK_UMax: {
Type *VecCondTy = CmpInst::makeCmpResultType(VecTy);
+ bool IsUnsigned = ReductionData.getKind() == RK_UMin ||
+ ReductionData.getKind() == RK_UMax;
PairwiseRdxCost =
TTI->getMinMaxReductionCost(VecTy, VecCondTy,
/*IsPairwiseForm=*/true, IsUnsigned);