RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00
Code Issues Projects Releases Wiki Activity

[TTI] add wrapper for matching vector reduction to reduce code duplication; NFC

Browse Source 
I'm not sure what this means, but the order in which we try
the matches makes a difference on at least 1 regression test...
This commit is contained in:
Sanjay Patel 2020-09-23 13:46:26 -04:00
parent 1b69800394
commit d2248cc89c
3 changed files with 28 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/llvm/Analysis/TargetTransformInfo.h
View File

@ -876,6 +876,10 @@ public:
static ReductionKind matchVectorSplittingReduction(
const ExtractElementInst *ReduxRoot, unsigned &Opcode, VectorType *&Ty);
static ReductionKind matchVectorReduction(const ExtractElementInst *ReduxRoot,
unsigned &Opcode, VectorType *&Ty,
bool &IsPairwise);
/// Additional information about an operand's possible values.
enum OperandValueKind {
OK_AnyValue, // Operand can have any value.

42
include/llvm/Analysis/TargetTransformInfoImpl.h
View File

@ -1004,41 +1004,23 @@ public:
if (CI)
Idx = CI->getZExtValue();
// Try to match a reduction sequence (series of shufflevector and
// vector adds followed by a extractelement).
unsigned ReduxOpCode;
VectorType *ReduxType;
switch (TTI::matchVectorSplittingReduction(EEI, ReduxOpCode,
ReduxType)) {
// Try to match a reduction (a series of shufflevector and vector ops
// followed by an extractelement).
unsigned RdxOpcode;
VectorType *RdxType;
bool IsPairwise;
switch (TTI::matchVectorReduction(EEI, RdxOpcode, RdxType, IsPairwise)) {
case TTI::RK_Arithmetic:
return TargetTTI->getArithmeticReductionCost(ReduxOpCode, ReduxType,
/*IsPairwiseForm=*/false,
CostKind);
return TargetTTI->getArithmeticReductionCost(RdxOpcode, RdxType,
IsPairwise, CostKind);
case TTI::RK_MinMax:
return TargetTTI->getMinMaxReductionCost(
ReduxType, cast<VectorType>(CmpInst::makeCmpResultType(ReduxType)),
/*IsPairwiseForm=*/false, /*IsUnsigned=*/false, CostKind);
RdxType, cast<VectorType>(CmpInst::makeCmpResultType(RdxType)),
IsPairwise, /*IsUnsigned=*/false, CostKind);
case TTI::RK_UnsignedMinMax:
return TargetTTI->getMinMaxReductionCost(
ReduxType, cast<VectorType>(CmpInst::makeCmpResultType(ReduxType)),
/*IsPairwiseForm=*/false, /*IsUnsigned=*/true, CostKind);
case TTI::RK_None:
break;
}
switch (TTI::matchPairwiseReduction(EEI, ReduxOpCode, ReduxType)) {
case TTI::RK_Arithmetic:
return TargetTTI->getArithmeticReductionCost(ReduxOpCode, ReduxType,
/*IsPairwiseForm=*/true, CostKind);
case TTI::RK_MinMax:
return TargetTTI->getMinMaxReductionCost(
ReduxType, cast<VectorType>(CmpInst::makeCmpResultType(ReduxType)),
/*IsPairwiseForm=*/true, /*IsUnsigned=*/false, CostKind);
case TTI::RK_UnsignedMinMax:
return TargetTTI->getMinMaxReductionCost(
ReduxType, cast<VectorType>(CmpInst::makeCmpResultType(ReduxType)),
/*IsPairwiseForm=*/true, /*IsUnsigned=*/true, CostKind);
RdxType, cast<VectorType>(CmpInst::makeCmpResultType(RdxType)),
IsPairwise, /*IsUnsigned=*/true, CostKind);
case TTI::RK_None:
break;
}

12
lib/Analysis/TargetTransformInfo.cpp
View File

@ -1308,6 +1308,18 @@ TTI::ReductionKind TTI::matchVectorSplittingReduction(
return RD->Kind;
}
TTI::ReductionKind
TTI::matchVectorReduction(const ExtractElementInst *Root, unsigned &Opcode,
VectorType *&Ty, bool &IsPairwise) {
TTI::ReductionKind RdxKind = matchVectorSplittingReduction(Root, Opcode, Ty);
if (RdxKind != TTI::ReductionKind::RK_None) {
IsPairwise = false;
return RdxKind;
}
IsPairwise = true;
return matchPairwiseReduction(Root, Opcode, Ty);
}
int TargetTransformInfo::getInstructionThroughput(const Instruction *I) const {
TTI::TargetCostKind CostKind = TTI::TCK_RecipThroughput;