1 //===- llvm/Analysis/TargetTransformInfo.cpp ------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "llvm/Analysis/TargetTransformInfo.h" 11 #include "llvm/Analysis/TargetTransformInfoImpl.h" 12 #include "llvm/IR/CallSite.h" 13 #include "llvm/IR/DataLayout.h" 14 #include "llvm/IR/Instruction.h" 15 #include "llvm/IR/Instructions.h" 16 #include "llvm/IR/IntrinsicInst.h" 17 #include "llvm/IR/Module.h" 18 #include "llvm/IR/Operator.h" 19 #include "llvm/Support/ErrorHandling.h" 20 #include <utility> 21 22 using namespace llvm; 23 24 #define DEBUG_TYPE "tti" 25 26 namespace { 27 /// \brief No-op implementation of the TTI interface using the utility base 28 /// classes. 29 /// 30 /// This is used when no target specific information is available. 31 struct NoTTIImpl : TargetTransformInfoImplCRTPBase<NoTTIImpl> { 32 explicit NoTTIImpl(const DataLayout &DL) 33 : TargetTransformInfoImplCRTPBase<NoTTIImpl>(DL) {} 34 }; 35 } 36 37 TargetTransformInfo::TargetTransformInfo(const DataLayout &DL) 38 : TTIImpl(new Model<NoTTIImpl>(NoTTIImpl(DL))) {} 39 40 TargetTransformInfo::~TargetTransformInfo() {} 41 42 TargetTransformInfo::TargetTransformInfo(TargetTransformInfo &&Arg) 43 : TTIImpl(std::move(Arg.TTIImpl)) {} 44 45 TargetTransformInfo &TargetTransformInfo::operator=(TargetTransformInfo &&RHS) { 46 TTIImpl = std::move(RHS.TTIImpl); 47 return *this; 48 } 49 50 int TargetTransformInfo::getOperationCost(unsigned Opcode, Type *Ty, 51 Type *OpTy) const { 52 int Cost = TTIImpl->getOperationCost(Opcode, Ty, OpTy); 53 assert(Cost >= 0 && "TTI should not produce negative costs!"); 54 return Cost; 55 } 56 57 int TargetTransformInfo::getCallCost(FunctionType *FTy, int NumArgs) const { 58 int Cost = TTIImpl->getCallCost(FTy, NumArgs); 59 assert(Cost >= 0 && "TTI should not produce negative costs!"); 60 return Cost; 61 } 62 63 int TargetTransformInfo::getCallCost(const Function *F, 64 ArrayRef<const Value *> Arguments) const { 65 int Cost = TTIImpl->getCallCost(F, Arguments); 66 assert(Cost >= 0 && "TTI should not produce negative costs!"); 67 return Cost; 68 } 69 70 unsigned TargetTransformInfo::getInliningThresholdMultiplier() const { 71 return TTIImpl->getInliningThresholdMultiplier(); 72 } 73 74 int TargetTransformInfo::getGEPCost(Type *PointeeType, const Value *Ptr, 75 ArrayRef<const Value *> Operands) const { 76 return TTIImpl->getGEPCost(PointeeType, Ptr, Operands); 77 } 78 79 int TargetTransformInfo::getIntrinsicCost( 80 Intrinsic::ID IID, Type *RetTy, ArrayRef<const Value *> Arguments) const { 81 int Cost = TTIImpl->getIntrinsicCost(IID, RetTy, Arguments); 82 assert(Cost >= 0 && "TTI should not produce negative costs!"); 83 return Cost; 84 } 85 86 int TargetTransformInfo::getUserCost(const User *U) const { 87 int Cost = TTIImpl->getUserCost(U); 88 assert(Cost >= 0 && "TTI should not produce negative costs!"); 89 return Cost; 90 } 91 92 bool TargetTransformInfo::hasBranchDivergence() const { 93 return TTIImpl->hasBranchDivergence(); 94 } 95 96 bool TargetTransformInfo::isSourceOfDivergence(const Value *V) const { 97 return TTIImpl->isSourceOfDivergence(V); 98 } 99 100 bool TargetTransformInfo::isLoweredToCall(const Function *F) const { 101 return TTIImpl->isLoweredToCall(F); 102 } 103 104 void TargetTransformInfo::getUnrollingPreferences( 105 Loop *L, UnrollingPreferences &UP) const { 106 return TTIImpl->getUnrollingPreferences(L, UP); 107 } 108 109 bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const { 110 return TTIImpl->isLegalAddImmediate(Imm); 111 } 112 113 bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const { 114 return TTIImpl->isLegalICmpImmediate(Imm); 115 } 116 117 bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV, 118 int64_t BaseOffset, 119 bool HasBaseReg, 120 int64_t Scale, 121 unsigned AddrSpace) const { 122 return TTIImpl->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg, 123 Scale, AddrSpace); 124 } 125 126 bool TargetTransformInfo::isLegalMaskedStore(Type *DataType) const { 127 return TTIImpl->isLegalMaskedStore(DataType); 128 } 129 130 bool TargetTransformInfo::isLegalMaskedLoad(Type *DataType) const { 131 return TTIImpl->isLegalMaskedLoad(DataType); 132 } 133 134 bool TargetTransformInfo::isLegalMaskedGather(Type *DataType) const { 135 return TTIImpl->isLegalMaskedGather(DataType); 136 } 137 138 bool TargetTransformInfo::isLegalMaskedScatter(Type *DataType) const { 139 return TTIImpl->isLegalMaskedGather(DataType); 140 } 141 142 int TargetTransformInfo::getScalingFactorCost(Type *Ty, GlobalValue *BaseGV, 143 int64_t BaseOffset, 144 bool HasBaseReg, 145 int64_t Scale, 146 unsigned AddrSpace) const { 147 int Cost = TTIImpl->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg, 148 Scale, AddrSpace); 149 assert(Cost >= 0 && "TTI should not produce negative costs!"); 150 return Cost; 151 } 152 153 bool TargetTransformInfo::isFoldableMemAccessOffset(Instruction *I, 154 int64_t Offset) const { 155 return TTIImpl->isFoldableMemAccessOffset(I, Offset); 156 } 157 158 bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const { 159 return TTIImpl->isTruncateFree(Ty1, Ty2); 160 } 161 162 bool TargetTransformInfo::isProfitableToHoist(Instruction *I) const { 163 return TTIImpl->isProfitableToHoist(I); 164 } 165 166 bool TargetTransformInfo::isTypeLegal(Type *Ty) const { 167 return TTIImpl->isTypeLegal(Ty); 168 } 169 170 unsigned TargetTransformInfo::getJumpBufAlignment() const { 171 return TTIImpl->getJumpBufAlignment(); 172 } 173 174 unsigned TargetTransformInfo::getJumpBufSize() const { 175 return TTIImpl->getJumpBufSize(); 176 } 177 178 bool TargetTransformInfo::shouldBuildLookupTables() const { 179 return TTIImpl->shouldBuildLookupTables(); 180 } 181 bool TargetTransformInfo::shouldBuildLookupTablesForConstant(Constant *C) const { 182 return TTIImpl->shouldBuildLookupTablesForConstant(C); 183 } 184 185 bool TargetTransformInfo::enableAggressiveInterleaving(bool LoopHasReductions) const { 186 return TTIImpl->enableAggressiveInterleaving(LoopHasReductions); 187 } 188 189 bool TargetTransformInfo::enableInterleavedAccessVectorization() const { 190 return TTIImpl->enableInterleavedAccessVectorization(); 191 } 192 193 bool TargetTransformInfo::isFPVectorizationPotentiallyUnsafe() const { 194 return TTIImpl->isFPVectorizationPotentiallyUnsafe(); 195 } 196 197 bool TargetTransformInfo::allowsMisalignedMemoryAccesses(LLVMContext &Context, 198 unsigned BitWidth, 199 unsigned AddressSpace, 200 unsigned Alignment, 201 bool *Fast) const { 202 return TTIImpl->allowsMisalignedMemoryAccesses(Context, BitWidth, AddressSpace, 203 Alignment, Fast); 204 } 205 206 TargetTransformInfo::PopcntSupportKind 207 TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const { 208 return TTIImpl->getPopcntSupport(IntTyWidthInBit); 209 } 210 211 bool TargetTransformInfo::haveFastSqrt(Type *Ty) const { 212 return TTIImpl->haveFastSqrt(Ty); 213 } 214 215 int TargetTransformInfo::getFPOpCost(Type *Ty) const { 216 int Cost = TTIImpl->getFPOpCost(Ty); 217 assert(Cost >= 0 && "TTI should not produce negative costs!"); 218 return Cost; 219 } 220 221 int TargetTransformInfo::getIntImmCodeSizeCost(unsigned Opcode, unsigned Idx, 222 const APInt &Imm, 223 Type *Ty) const { 224 int Cost = TTIImpl->getIntImmCodeSizeCost(Opcode, Idx, Imm, Ty); 225 assert(Cost >= 0 && "TTI should not produce negative costs!"); 226 return Cost; 227 } 228 229 int TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty) const { 230 int Cost = TTIImpl->getIntImmCost(Imm, Ty); 231 assert(Cost >= 0 && "TTI should not produce negative costs!"); 232 return Cost; 233 } 234 235 int TargetTransformInfo::getIntImmCost(unsigned Opcode, unsigned Idx, 236 const APInt &Imm, Type *Ty) const { 237 int Cost = TTIImpl->getIntImmCost(Opcode, Idx, Imm, Ty); 238 assert(Cost >= 0 && "TTI should not produce negative costs!"); 239 return Cost; 240 } 241 242 int TargetTransformInfo::getIntImmCost(Intrinsic::ID IID, unsigned Idx, 243 const APInt &Imm, Type *Ty) const { 244 int Cost = TTIImpl->getIntImmCost(IID, Idx, Imm, Ty); 245 assert(Cost >= 0 && "TTI should not produce negative costs!"); 246 return Cost; 247 } 248 249 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const { 250 return TTIImpl->getNumberOfRegisters(Vector); 251 } 252 253 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const { 254 return TTIImpl->getRegisterBitWidth(Vector); 255 } 256 257 unsigned TargetTransformInfo::getCacheLineSize() const { 258 return TTIImpl->getCacheLineSize(); 259 } 260 261 unsigned TargetTransformInfo::getPrefetchDistance() const { 262 return TTIImpl->getPrefetchDistance(); 263 } 264 265 unsigned TargetTransformInfo::getMinPrefetchStride() const { 266 return TTIImpl->getMinPrefetchStride(); 267 } 268 269 unsigned TargetTransformInfo::getMaxPrefetchIterationsAhead() const { 270 return TTIImpl->getMaxPrefetchIterationsAhead(); 271 } 272 273 unsigned TargetTransformInfo::getMaxInterleaveFactor(unsigned VF) const { 274 return TTIImpl->getMaxInterleaveFactor(VF); 275 } 276 277 int TargetTransformInfo::getArithmeticInstrCost( 278 unsigned Opcode, Type *Ty, OperandValueKind Opd1Info, 279 OperandValueKind Opd2Info, OperandValueProperties Opd1PropInfo, 280 OperandValueProperties Opd2PropInfo) const { 281 int Cost = TTIImpl->getArithmeticInstrCost(Opcode, Ty, Opd1Info, Opd2Info, 282 Opd1PropInfo, Opd2PropInfo); 283 assert(Cost >= 0 && "TTI should not produce negative costs!"); 284 return Cost; 285 } 286 287 int TargetTransformInfo::getShuffleCost(ShuffleKind Kind, Type *Ty, int Index, 288 Type *SubTp) const { 289 int Cost = TTIImpl->getShuffleCost(Kind, Ty, Index, SubTp); 290 assert(Cost >= 0 && "TTI should not produce negative costs!"); 291 return Cost; 292 } 293 294 int TargetTransformInfo::getCastInstrCost(unsigned Opcode, Type *Dst, 295 Type *Src) const { 296 int Cost = TTIImpl->getCastInstrCost(Opcode, Dst, Src); 297 assert(Cost >= 0 && "TTI should not produce negative costs!"); 298 return Cost; 299 } 300 301 int TargetTransformInfo::getExtractWithExtendCost(unsigned Opcode, Type *Dst, 302 VectorType *VecTy, 303 unsigned Index) const { 304 int Cost = TTIImpl->getExtractWithExtendCost(Opcode, Dst, VecTy, Index); 305 assert(Cost >= 0 && "TTI should not produce negative costs!"); 306 return Cost; 307 } 308 309 int TargetTransformInfo::getCFInstrCost(unsigned Opcode) const { 310 int Cost = TTIImpl->getCFInstrCost(Opcode); 311 assert(Cost >= 0 && "TTI should not produce negative costs!"); 312 return Cost; 313 } 314 315 int TargetTransformInfo::getCmpSelInstrCost(unsigned Opcode, Type *ValTy, 316 Type *CondTy) const { 317 int Cost = TTIImpl->getCmpSelInstrCost(Opcode, ValTy, CondTy); 318 assert(Cost >= 0 && "TTI should not produce negative costs!"); 319 return Cost; 320 } 321 322 int TargetTransformInfo::getVectorInstrCost(unsigned Opcode, Type *Val, 323 unsigned Index) const { 324 int Cost = TTIImpl->getVectorInstrCost(Opcode, Val, Index); 325 assert(Cost >= 0 && "TTI should not produce negative costs!"); 326 return Cost; 327 } 328 329 int TargetTransformInfo::getMemoryOpCost(unsigned Opcode, Type *Src, 330 unsigned Alignment, 331 unsigned AddressSpace) const { 332 int Cost = TTIImpl->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace); 333 assert(Cost >= 0 && "TTI should not produce negative costs!"); 334 return Cost; 335 } 336 337 int TargetTransformInfo::getMaskedMemoryOpCost(unsigned Opcode, Type *Src, 338 unsigned Alignment, 339 unsigned AddressSpace) const { 340 int Cost = 341 TTIImpl->getMaskedMemoryOpCost(Opcode, Src, Alignment, AddressSpace); 342 assert(Cost >= 0 && "TTI should not produce negative costs!"); 343 return Cost; 344 } 345 346 int TargetTransformInfo::getGatherScatterOpCost(unsigned Opcode, Type *DataTy, 347 Value *Ptr, bool VariableMask, 348 unsigned Alignment) const { 349 int Cost = TTIImpl->getGatherScatterOpCost(Opcode, DataTy, Ptr, VariableMask, 350 Alignment); 351 assert(Cost >= 0 && "TTI should not produce negative costs!"); 352 return Cost; 353 } 354 355 int TargetTransformInfo::getInterleavedMemoryOpCost( 356 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, 357 unsigned Alignment, unsigned AddressSpace) const { 358 int Cost = TTIImpl->getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices, 359 Alignment, AddressSpace); 360 assert(Cost >= 0 && "TTI should not produce negative costs!"); 361 return Cost; 362 } 363 364 int TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy, 365 ArrayRef<Type *> Tys, 366 FastMathFlags FMF) const { 367 int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Tys, FMF); 368 assert(Cost >= 0 && "TTI should not produce negative costs!"); 369 return Cost; 370 } 371 372 int TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy, 373 ArrayRef<Value *> Args, 374 FastMathFlags FMF) const { 375 int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Args, FMF); 376 assert(Cost >= 0 && "TTI should not produce negative costs!"); 377 return Cost; 378 } 379 380 int TargetTransformInfo::getCallInstrCost(Function *F, Type *RetTy, 381 ArrayRef<Type *> Tys) const { 382 int Cost = TTIImpl->getCallInstrCost(F, RetTy, Tys); 383 assert(Cost >= 0 && "TTI should not produce negative costs!"); 384 return Cost; 385 } 386 387 unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const { 388 return TTIImpl->getNumberOfParts(Tp); 389 } 390 391 int TargetTransformInfo::getAddressComputationCost(Type *Tp, 392 bool IsComplex) const { 393 int Cost = TTIImpl->getAddressComputationCost(Tp, IsComplex); 394 assert(Cost >= 0 && "TTI should not produce negative costs!"); 395 return Cost; 396 } 397 398 int TargetTransformInfo::getReductionCost(unsigned Opcode, Type *Ty, 399 bool IsPairwiseForm) const { 400 int Cost = TTIImpl->getReductionCost(Opcode, Ty, IsPairwiseForm); 401 assert(Cost >= 0 && "TTI should not produce negative costs!"); 402 return Cost; 403 } 404 405 unsigned 406 TargetTransformInfo::getCostOfKeepingLiveOverCall(ArrayRef<Type *> Tys) const { 407 return TTIImpl->getCostOfKeepingLiveOverCall(Tys); 408 } 409 410 bool TargetTransformInfo::getTgtMemIntrinsic(IntrinsicInst *Inst, 411 MemIntrinsicInfo &Info) const { 412 return TTIImpl->getTgtMemIntrinsic(Inst, Info); 413 } 414 415 Value *TargetTransformInfo::getOrCreateResultFromMemIntrinsic( 416 IntrinsicInst *Inst, Type *ExpectedType) const { 417 return TTIImpl->getOrCreateResultFromMemIntrinsic(Inst, ExpectedType); 418 } 419 420 bool TargetTransformInfo::areInlineCompatible(const Function *Caller, 421 const Function *Callee) const { 422 return TTIImpl->areInlineCompatible(Caller, Callee); 423 } 424 425 unsigned TargetTransformInfo::getLoadStoreVecRegBitWidth(unsigned AS) const { 426 return TTIImpl->getLoadStoreVecRegBitWidth(AS); 427 } 428 429 bool TargetTransformInfo::isLegalToVectorizeLoad(LoadInst *LI) const { 430 return TTIImpl->isLegalToVectorizeLoad(LI); 431 } 432 433 bool TargetTransformInfo::isLegalToVectorizeStore(StoreInst *SI) const { 434 return TTIImpl->isLegalToVectorizeStore(SI); 435 } 436 437 bool TargetTransformInfo::isLegalToVectorizeLoadChain( 438 unsigned ChainSizeInBytes, unsigned Alignment, unsigned AddrSpace) const { 439 return TTIImpl->isLegalToVectorizeLoadChain(ChainSizeInBytes, Alignment, 440 AddrSpace); 441 } 442 443 bool TargetTransformInfo::isLegalToVectorizeStoreChain( 444 unsigned ChainSizeInBytes, unsigned Alignment, unsigned AddrSpace) const { 445 return TTIImpl->isLegalToVectorizeStoreChain(ChainSizeInBytes, Alignment, 446 AddrSpace); 447 } 448 449 unsigned TargetTransformInfo::getLoadVectorFactor(unsigned VF, 450 unsigned LoadSize, 451 unsigned ChainSizeInBytes, 452 VectorType *VecTy) const { 453 return TTIImpl->getLoadVectorFactor(VF, LoadSize, ChainSizeInBytes, VecTy); 454 } 455 456 unsigned TargetTransformInfo::getStoreVectorFactor(unsigned VF, 457 unsigned StoreSize, 458 unsigned ChainSizeInBytes, 459 VectorType *VecTy) const { 460 return TTIImpl->getStoreVectorFactor(VF, StoreSize, ChainSizeInBytes, VecTy); 461 } 462 463 TargetTransformInfo::Concept::~Concept() {} 464 465 TargetIRAnalysis::TargetIRAnalysis() : TTICallback(&getDefaultTTI) {} 466 467 TargetIRAnalysis::TargetIRAnalysis( 468 std::function<Result(const Function &)> TTICallback) 469 : TTICallback(std::move(TTICallback)) {} 470 471 TargetIRAnalysis::Result TargetIRAnalysis::run(const Function &F, 472 FunctionAnalysisManager &) { 473 return TTICallback(F); 474 } 475 476 char TargetIRAnalysis::PassID; 477 478 TargetIRAnalysis::Result TargetIRAnalysis::getDefaultTTI(const Function &F) { 479 return Result(F.getParent()->getDataLayout()); 480 } 481 482 // Register the basic pass. 483 INITIALIZE_PASS(TargetTransformInfoWrapperPass, "tti", 484 "Target Transform Information", false, true) 485 char TargetTransformInfoWrapperPass::ID = 0; 486 487 void TargetTransformInfoWrapperPass::anchor() {} 488 489 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass() 490 : ImmutablePass(ID) { 491 initializeTargetTransformInfoWrapperPassPass( 492 *PassRegistry::getPassRegistry()); 493 } 494 495 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass( 496 TargetIRAnalysis TIRA) 497 : ImmutablePass(ID), TIRA(std::move(TIRA)) { 498 initializeTargetTransformInfoWrapperPassPass( 499 *PassRegistry::getPassRegistry()); 500 } 501 502 TargetTransformInfo &TargetTransformInfoWrapperPass::getTTI(const Function &F) { 503 FunctionAnalysisManager DummyFAM; 504 TTI = TIRA.run(F, DummyFAM); 505 return *TTI; 506 } 507 508 ImmutablePass * 509 llvm::createTargetTransformInfoWrapperPass(TargetIRAnalysis TIRA) { 510 return new TargetTransformInfoWrapperPass(std::move(TIRA)); 511 } 512