16 #ifndef LLVM_LIB_TARGET_HEXAGON_HEXAGONTARGETTRANSFORMINFO_H 17 #define LLVM_LIB_TARGET_HEXAGON_HEXAGONTARGETTRANSFORMINFO_H 30 class ScalarEvolution;
47 bool isTypeForHVX(
Type *VecTy)
const;
52 unsigned getTypeNumElements(
Type *Ty)
const;
57 ST(*TM->getSubtargetImpl(F)), TLI(*ST.getTargetLowering()) {}
113 unsigned ScalarizationCostPassed = UINT_MAX);
119 unsigned AddressSpace);
123 bool VariableMask,
unsigned Alignment);
126 unsigned AddressSpace,
bool UseMaskForCond =
false,
127 bool UseMaskForGaps =
false);
153 #endif // LLVM_LIB_TARGET_HEXAGON_HEXAGONTARGETTRANSFORMINFO_H unsigned getOperandsScalarizationOverhead(ArrayRef< const Value *> Args, unsigned VF)
unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract)
unsigned getArithmeticInstrCost(unsigned Opcode, Type *Ty, TTI::OperandValueKind Opd1Info=TTI::OK_AnyValue, TTI::OperandValueKind Opd2Info=TTI::OK_AnyValue, TTI::OperandValueProperties Opd1PropInfo=TTI::OP_None, TTI::OperandValueProperties Opd2PropInfo=TTI::OP_None, ArrayRef< const Value *> Args=ArrayRef< const Value *>())
int getUserCost(const User *U, ArrayRef< const Value *> Operands)
bool shouldBuildLookupTables() const
unsigned getMinimumVF(unsigned ElemWidth) const
This class represents lattice values for constants.
The main scalar evolution driver.
unsigned getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef< unsigned > Indices, unsigned Alignment, unsigned AddressSpace, bool UseMaskForCond=false, bool UseMaskForGaps=false)
bool hasBranchDivergence()
Base class which can be used to help build a TTI implementation.
HexagonTTIImpl(const HexagonTargetMachine *TM, const Function &F)
unsigned getGatherScatterOpCost(unsigned Opcode, Type *DataTy, Value *Ptr, bool VariableMask, unsigned Alignment)
unsigned getCFInstrCost(unsigned Opcode)
unsigned getMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment, unsigned AddressSpace, const Instruction *I=nullptr)
unsigned getMinVectorRegisterBitWidth() const
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory)...
unsigned getAddressComputationCost(Type *Tp, ScalarEvolution *SE, const SCEV *S)
The instances of the Type class are immutable: once they are created, they are never changed...
unsigned getRegisterBitWidth(bool Vector) const
unsigned getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index, Type *SubTp)
This file provides a helper that implements much of the TTI interface in terms of the target-independ...
unsigned getCallInstrCost(Function *F, Type *RetTy, ArrayRef< Type *> Tys)
unsigned getVectorInstrCost(unsigned Opcode, Type *Val, unsigned Index)
bool shouldFavorPostInc() const
Bias LSR towards creating post-increment opportunities.
bool enableAggressiveInterleaving(bool LoopHasReductions)
unsigned getCacheLineSize() const
bool enableInterleavedAccessVectorization()
unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy, Type *CondTy, const Instruction *I)
unsigned getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy, ArrayRef< Value *> Args, FastMathFlags FMF, unsigned VF)
unsigned getPrefetchDistance() const
— Vector TTI end —
bool prefersVectorizedAddressing()
This class represents an analyzed expression in the program.
unsigned getNumberOfRegisters(bool vector) const
— Vector TTI begin —
Represents a single loop in the control flow graph.
unsigned getMaxInterleaveFactor(unsigned VF)
unsigned getCastInstrCost(unsigned Opcode, Type *Dst, Type *Src, const Instruction *I=nullptr)
unsigned getMaskedMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment, unsigned AddressSpace)
bool supportsEfficientVectorElementLoadStore()
LLVM Value Representation.
static const Function * getParent(const Value *V)
void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, TTI::UnrollingPreferences &UP)
Convenience struct for specifying and reasoning about fast-math flags.
TTI::PopcntSupportKind getPopcntSupport(unsigned IntTyWidthInBit) const
bool shouldMaximizeVectorBandwidth(bool OptSize) const
constexpr char Args[]
Key for Kernel::Metadata::mArgs.