6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-09-24 23:28:41 +00:00
Code Issues Projects Releases Wiki Activity

SLPVectorizer: vectorize compares and selects.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@184282 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nadav Rotem
2013-06-19 05:49:52 +00:00
parent 69466952ed
commit eb30e5115e
2 changed files with 107 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

78
lib/Transforms/Vectorize/VecUtils.cpp
View File

@@ -384,6 +384,9 @@ void BoUpSLP::getTreeUses_rec(ArrayRef<Value *> VL, unsigned Depth) {
case Instruction::Trunc:
case Instruction::FPTrunc:
case Instruction::BitCast:
case Instruction::Select:
case Instruction::ICmp:
case Instruction::FCmp:
case Instruction::Add:
case Instruction::FAdd:
case Instruction::Sub:
@@ -541,6 +544,18 @@ int BoUpSLP::getTreeCost_rec(ArrayRef<Value *> VL, unsigned Depth) {
Cost += (VecCost - ScalarCost);
return Cost;
}
case Instruction::FCmp:
case Instruction::ICmp: {
// Check that all of the compares have the same predicate.
CmpInst::Predicate P0 = dyn_cast<CmpInst>(VL0)->getPredicate();
for (unsigned i = 1, e = VL.size(); i < e; ++i) {
CmpInst *Cmp = cast<CmpInst>(VL[i]);
if (Cmp->getPredicate() != P0)
return getScalarizationCost(VecTy);
}
// Fall through.
}
case Instruction::Select:
case Instruction::Add:
case Instruction::FAdd:
case Instruction::Sub:
@@ -572,10 +587,19 @@ int BoUpSLP::getTreeCost_rec(ArrayRef<Value *> VL, unsigned Depth) {
}
// Calculate the cost of this instruction.
int ScalarCost = VecTy->getNumElements() *
int ScalarCost = 0;
int VecCost = 0;
if (Opcode == Instruction::FCmp || Opcode == Instruction::ICmp ||
Opcode == Instruction::Select) {
VectorType *MaskTy = VectorType::get(Builder.getInt1Ty(), VL.size());
ScalarCost = VecTy->getNumElements() *
TTI->getCmpSelInstrCost(Opcode, ScalarTy, Builder.getInt1Ty());
VecCost = TTI->getCmpSelInstrCost(Opcode, VecTy, MaskTy);
} else {
ScalarCost = VecTy->getNumElements() *
TTI->getArithmeticInstrCost(Opcode, ScalarTy);
int VecCost = TTI->getArithmeticInstrCost(Opcode, VecTy);
VecCost = TTI->getArithmeticInstrCost(Opcode, VecTy);
}
Cost += (VecCost - ScalarCost);
return Cost;
}
@@ -772,6 +796,54 @@ Value *BoUpSLP::vectorizeTree_rec(ArrayRef<Value *> VL, int VF) {
return V;
}
case Instruction::FCmp:
case Instruction::ICmp: {
// Check that all of the compares have the same predicate.
CmpInst::Predicate P0 = dyn_cast<CmpInst>(VL0)->getPredicate();
for (unsigned i = 1, e = VF; i < e; ++i) {
CmpInst *Cmp = cast<CmpInst>(VL[i]);
if (Cmp->getPredicate() != P0)
return Scalarize(VL, VecTy);
}
ValueList LHSV, RHSV;
for (int i = 0; i < VF; ++i) {
LHSV.push_back(cast<Instruction>(VL[i])->getOperand(0));
RHSV.push_back(cast<Instruction>(VL[i])->getOperand(1));
}
Value *L = vectorizeTree_rec(LHSV, VF);
Value *R = vectorizeTree_rec(RHSV, VF);
Value *V;
if (VL0->getOpcode() == Instruction::FCmp)
V = Builder.CreateFCmp(P0, L, R);
else
V = Builder.CreateICmp(P0, L, R);
for (int i = 0; i < VF; ++i)
VectorizedValues[VL[i]] = V;
return V;
}
case Instruction::Select: {
ValueList TrueVec, FalseVec, CondVec;
for (int i = 0; i < VF; ++i) {
CondVec.push_back(cast<Instruction>(VL[i])->getOperand(0));
TrueVec.push_back(cast<Instruction>(VL[i])->getOperand(1));
FalseVec.push_back(cast<Instruction>(VL[i])->getOperand(2));
}
Value *True = vectorizeTree_rec(TrueVec, VF);
Value *False = vectorizeTree_rec(FalseVec, VF);
Value *Cond = vectorizeTree_rec(CondVec, VF);
Value *V = Builder.CreateSelect(Cond, True, False);
for (int i = 0; i < VF; ++i)
VectorizedValues[VL[i]] = V;
return V;
}
case Instruction::Add:
case Instruction::FAdd:
case Instruction::Sub: