}
std::pair<unsigned, MVT>
-VectorTargetTransformImpl::getTypeLegalizationCost(LLVMContext &C,
- EVT Ty) const {
+VectorTargetTransformImpl::getTypeLegalizationCost(Type *Ty) const {
+
+ LLVMContext &C = Ty->getContext();
+ EVT MTy = TLI->getValueType(Ty);
+
unsigned Cost = 1;
// We keep legalizing the type until we find a legal kind. We assume that
// the only operation that costs anything is the split. After splitting
// we need to handle two types.
while (true) {
- TargetLowering::LegalizeKind LK = TLI->getTypeConversion(C, Ty);
+ TargetLowering::LegalizeKind LK = TLI->getTypeConversion(C, MTy);
if (LK.first == TargetLowering::TypeLegal)
- return std::make_pair(Cost, Ty.getSimpleVT());
+ return std::make_pair(Cost, MTy.getSimpleVT());
if (LK.first == TargetLowering::TypeSplitVector ||
LK.first == TargetLowering::TypeExpandInteger)
Cost *= 2;
// Keep legalizing the type.
- Ty = LK.second;
+ MTy = LK.second;
}
}
int ISD = InstructionOpcodeToISD(Opcode);
assert(ISD && "Invalid opcode");
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(Ty->getContext(), TLI->getValueType(Ty));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Ty);
if (!TLI->isOperationExpand(ISD, LT.second)) {
// The operation is legal. Assume it costs 1. Multiply
int ISD = InstructionOpcodeToISD(Opcode);
assert(ISD && "Invalid opcode");
- std::pair<unsigned, MVT> SrcLT =
- getTypeLegalizationCost(Src->getContext(), TLI->getValueType(Src));
-
- std::pair<unsigned, MVT> DstLT =
- getTypeLegalizationCost(Dst->getContext(), TLI->getValueType(Dst));
+ std::pair<unsigned, MVT> SrcLT = getTypeLegalizationCost(Src);
+ std::pair<unsigned, MVT> DstLT = getTypeLegalizationCost(Dst);
// Handle scalar conversions.
if (!Src->isVectorTy() && !Dst->isVectorTy()) {
ISD = ISD::VSELECT;
}
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(ValTy->getContext(), TLI->getValueType(ValTy));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(ValTy);
if (!TLI->isOperationExpand(ISD, LT.second)) {
// The operation is legal. Assume it costs 1. Multiply
VectorTargetTransformImpl::getMemoryOpCost(unsigned Opcode, Type *Src,
unsigned Alignment,
unsigned AddressSpace) const {
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(Src->getContext(), TLI->getValueType(Src));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Src);
// Assume that all loads of legal types cost 1.
return LT.first;
unsigned
VectorTargetTransformImpl::getNumberOfParts(Type *Tp) const {
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(Tp->getContext(), TLI->getValueType(Tp));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Tp);
return LT.first;
}
X86VectorTargetTransformInfo::getArithmeticInstrCost(unsigned Opcode,
Type *Ty) const {
// Legalize the type.
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(Ty->getContext(), TLI->getValueType(Ty));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Ty);
int ISD = InstructionOpcodeToISD(Opcode);
assert(ISD && "Invalid opcode");
if (Index != -1U) {
// Legalize the type.
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(Val->getContext(), TLI->getValueType(Val));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Val);
// This type is legalized to a scalar type.
if (!LT.second.isVector())
Type *ValTy,
Type *CondTy) const {
// Legalize the type.
- std::pair<unsigned, MVT> LT =
- getTypeLegalizationCost(ValTy->getContext(), TLI->getValueType(ValTy));
+ std::pair<unsigned, MVT> LT = getTypeLegalizationCost(ValTy);
MVT MTy = LT.second;