1//===- llvm/Analysis/TargetTransformInfo.cpp ------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#include "llvm/Analysis/TargetTransformInfo.h"
10#include "llvm/ADT/SmallVector.h"
11#include "llvm/Analysis/CFG.h"
12#include "llvm/Analysis/LoopIterator.h"
13#include "llvm/Analysis/TargetLibraryInfo.h"
14#include "llvm/Analysis/TargetTransformInfoImpl.h"
15#include "llvm/IR/CFG.h"
16#include "llvm/IR/Dominators.h"
17#include "llvm/IR/Instruction.h"
18#include "llvm/IR/Instructions.h"
19#include "llvm/IR/IntrinsicInst.h"
20#include "llvm/IR/Module.h"
21#include "llvm/IR/Operator.h"
22#include "llvm/InitializePasses.h"
23#include "llvm/Support/CommandLine.h"
24#include <optional>
25#include <utility>
26
27using namespace llvm;
28using namespace PatternMatch;
29
30#define DEBUG_TYPE "tti"
31
32static cl::opt<bool> EnableReduxCost("costmodel-reduxcost", cl::init(Val: false),
33 cl::Hidden,
34 cl::desc("Recognize reduction patterns."));
35
36static cl::opt<unsigned> CacheLineSize(
37 "cache-line-size", cl::init(Val: 0), cl::Hidden,
38 cl::desc("Use this to override the target cache line size when "
39 "specified by the user."));
40
41static cl::opt<unsigned> MinPageSize(
42 "min-page-size", cl::init(Val: 0), cl::Hidden,
43 cl::desc("Use this to override the target's minimum page size."));
44
45static cl::opt<unsigned> PredictableBranchThreshold(
46 "predictable-branch-threshold", cl::init(Val: 99), cl::Hidden,
47 cl::desc(
48 "Use this to override the target's predictable branch threshold (%)."));
49
50namespace {
51/// No-op implementation of the TTI interface using the utility base
52/// classes.
53///
54/// This is used when no target specific information is available.
55struct NoTTIImpl : TargetTransformInfoImplCRTPBase<NoTTIImpl> {
56 explicit NoTTIImpl(const DataLayout &DL)
57 : TargetTransformInfoImplCRTPBase<NoTTIImpl>(DL) {}
58};
59} // namespace
60
61TargetTransformInfo::TargetTransformInfo(
62 std::unique_ptr<const TargetTransformInfoImplBase> Impl)
63 : TTIImpl(std::move(Impl)) {}
64
65bool HardwareLoopInfo::canAnalyze(LoopInfo &LI) {
66 // If the loop has irreducible control flow, it can not be converted to
67 // Hardware loop.
68 LoopBlocksRPO RPOT(L);
69 RPOT.perform(LI: &LI);
70 if (containsIrreducibleCFG<const BasicBlock *>(RPOTraversal&: RPOT, LI))
71 return false;
72 return true;
73}
74
75IntrinsicCostAttributes::IntrinsicCostAttributes(
76 Intrinsic::ID Id, const CallBase &CI, InstructionCost ScalarizationCost,
77 bool TypeBasedOnly)
78 : II(dyn_cast<IntrinsicInst>(Val: &CI)), RetTy(CI.getType()), IID(Id),
79 ScalarizationCost(ScalarizationCost) {
80
81 if (const auto *FPMO = dyn_cast<FPMathOperator>(Val: &CI))
82 FMF = FPMO->getFastMathFlags();
83
84 if (!TypeBasedOnly)
85 Arguments.insert(I: Arguments.begin(), From: CI.arg_begin(), To: CI.arg_end());
86 FunctionType *FTy = CI.getCalledFunction()->getFunctionType();
87 ParamTys.insert(I: ParamTys.begin(), From: FTy->param_begin(), To: FTy->param_end());
88}
89
90IntrinsicCostAttributes::IntrinsicCostAttributes(Intrinsic::ID Id, Type *RTy,
91 ArrayRef<Type *> Tys,
92 FastMathFlags Flags,
93 const IntrinsicInst *I,
94 InstructionCost ScalarCost)
95 : II(I), RetTy(RTy), IID(Id), FMF(Flags), ScalarizationCost(ScalarCost) {
96 ParamTys.insert(I: ParamTys.begin(), From: Tys.begin(), To: Tys.end());
97}
98
99IntrinsicCostAttributes::IntrinsicCostAttributes(Intrinsic::ID Id, Type *Ty,
100 ArrayRef<const Value *> Args)
101 : RetTy(Ty), IID(Id) {
102
103 Arguments.insert(I: Arguments.begin(), From: Args.begin(), To: Args.end());
104 ParamTys.reserve(N: Arguments.size());
105 for (const Value *Argument : Arguments)
106 ParamTys.push_back(Elt: Argument->getType());
107}
108
109IntrinsicCostAttributes::IntrinsicCostAttributes(Intrinsic::ID Id, Type *RTy,
110 ArrayRef<const Value *> Args,
111 ArrayRef<Type *> Tys,
112 FastMathFlags Flags,
113 const IntrinsicInst *I,
114 InstructionCost ScalarCost)
115 : II(I), RetTy(RTy), IID(Id), FMF(Flags), ScalarizationCost(ScalarCost) {
116 ParamTys.insert(I: ParamTys.begin(), From: Tys.begin(), To: Tys.end());
117 Arguments.insert(I: Arguments.begin(), From: Args.begin(), To: Args.end());
118}
119
120HardwareLoopInfo::HardwareLoopInfo(Loop *L) : L(L) {
121 // Match default options:
122 // - hardware-loop-counter-bitwidth = 32
123 // - hardware-loop-decrement = 1
124 CountType = Type::getInt32Ty(C&: L->getHeader()->getContext());
125 LoopDecrement = ConstantInt::get(Ty: CountType, V: 1);
126}
127
128bool HardwareLoopInfo::isHardwareLoopCandidate(ScalarEvolution &SE,
129 LoopInfo &LI, DominatorTree &DT,
130 bool ForceNestedLoop,
131 bool ForceHardwareLoopPHI) {
132 SmallVector<BasicBlock *, 4> ExitingBlocks;
133 L->getExitingBlocks(ExitingBlocks);
134
135 for (BasicBlock *BB : ExitingBlocks) {
136 // If we pass the updated counter back through a phi, we need to know
137 // which latch the updated value will be coming from.
138 if (!L->isLoopLatch(BB)) {
139 if (ForceHardwareLoopPHI || CounterInReg)
140 continue;
141 }
142
143 const SCEV *EC = SE.getExitCount(L, ExitingBlock: BB);
144 if (isa<SCEVCouldNotCompute>(Val: EC))
145 continue;
146 if (const SCEVConstant *ConstEC = dyn_cast<SCEVConstant>(Val: EC)) {
147 if (ConstEC->getValue()->isZero())
148 continue;
149 } else if (!SE.isLoopInvariant(S: EC, L))
150 continue;
151
152 if (SE.getTypeSizeInBits(Ty: EC->getType()) > CountType->getBitWidth())
153 continue;
154
155 // If this exiting block is contained in a nested loop, it is not eligible
156 // for insertion of the branch-and-decrement since the inner loop would
157 // end up messing up the value in the CTR.
158 if (!IsNestingLegal && LI.getLoopFor(BB) != L && !ForceNestedLoop)
159 continue;
160
161 // We now have a loop-invariant count of loop iterations (which is not the
162 // constant zero) for which we know that this loop will not exit via this
163 // existing block.
164
165 // We need to make sure that this block will run on every loop iteration.
166 // For this to be true, we must dominate all blocks with backedges. Such
167 // blocks are in-loop predecessors to the header block.
168 bool NotAlways = false;
169 for (BasicBlock *Pred : predecessors(BB: L->getHeader())) {
170 if (!L->contains(BB: Pred))
171 continue;
172
173 if (!DT.dominates(A: BB, B: Pred)) {
174 NotAlways = true;
175 break;
176 }
177 }
178
179 if (NotAlways)
180 continue;
181
182 // Make sure this blocks ends with a conditional branch.
183 Instruction *TI = BB->getTerminator();
184 if (!TI)
185 continue;
186
187 if (CondBrInst *BI = dyn_cast<CondBrInst>(Val: TI))
188 ExitBranch = BI;
189 else
190 continue;
191
192 // Note that this block may not be the loop latch block, even if the loop
193 // has a latch block.
194 ExitBlock = BB;
195 ExitCount = EC;
196 break;
197 }
198
199 if (!ExitBlock)
200 return false;
201 return true;
202}
203
204TargetTransformInfo::TargetTransformInfo(const DataLayout &DL)
205 : TTIImpl(std::make_unique<NoTTIImpl>(args: DL)) {}
206
207TargetTransformInfo::~TargetTransformInfo() = default;
208
209TargetTransformInfo::TargetTransformInfo(TargetTransformInfo &&Arg)
210 : TTIImpl(std::move(Arg.TTIImpl)) {}
211
212TargetTransformInfo &TargetTransformInfo::operator=(TargetTransformInfo &&RHS) {
213 TTIImpl = std::move(RHS.TTIImpl);
214 return *this;
215}
216
217unsigned TargetTransformInfo::getInliningThresholdMultiplier() const {
218 return TTIImpl->getInliningThresholdMultiplier();
219}
220
221unsigned
222TargetTransformInfo::getInliningCostBenefitAnalysisSavingsMultiplier() const {
223 return TTIImpl->getInliningCostBenefitAnalysisSavingsMultiplier();
224}
225
226unsigned
227TargetTransformInfo::getInliningCostBenefitAnalysisProfitableMultiplier()
228 const {
229 return TTIImpl->getInliningCostBenefitAnalysisProfitableMultiplier();
230}
231
232int TargetTransformInfo::getInliningLastCallToStaticBonus() const {
233 return TTIImpl->getInliningLastCallToStaticBonus();
234}
235
236unsigned
237TargetTransformInfo::adjustInliningThreshold(const CallBase *CB) const {
238 return TTIImpl->adjustInliningThreshold(CB);
239}
240
241unsigned TargetTransformInfo::getCallerAllocaCost(const CallBase *CB,
242 const AllocaInst *AI) const {
243 return TTIImpl->getCallerAllocaCost(CB, AI);
244}
245
246int TargetTransformInfo::getInlinerVectorBonusPercent() const {
247 return TTIImpl->getInlinerVectorBonusPercent();
248}
249
250InstructionCost TargetTransformInfo::getGEPCost(
251 Type *PointeeType, const Value *Ptr, ArrayRef<const Value *> Operands,
252 Type *AccessType, TTI::TargetCostKind CostKind) const {
253 return TTIImpl->getGEPCost(PointeeType, Ptr, Operands, AccessType, CostKind);
254}
255
256InstructionCost TargetTransformInfo::getPointersChainCost(
257 ArrayRef<const Value *> Ptrs, const Value *Base,
258 const TTI::PointersChainInfo &Info, Type *AccessTy,
259 TTI::TargetCostKind CostKind) const {
260 assert((Base || !Info.isSameBase()) &&
261 "If pointers have same base address it has to be provided.");
262 return TTIImpl->getPointersChainCost(Ptrs, Base, Info, AccessTy, CostKind);
263}
264
265unsigned TargetTransformInfo::getEstimatedNumberOfCaseClusters(
266 const SwitchInst &SI, unsigned &JTSize, ProfileSummaryInfo *PSI,
267 BlockFrequencyInfo *BFI) const {
268 return TTIImpl->getEstimatedNumberOfCaseClusters(SI, JTSize, PSI, BFI);
269}
270
271InstructionCost
272TargetTransformInfo::getInstructionCost(const User *U,
273 ArrayRef<const Value *> Operands,
274 enum TargetCostKind CostKind) const {
275 InstructionCost Cost = TTIImpl->getInstructionCost(U, Operands, CostKind);
276 assert((CostKind == TTI::TCK_RecipThroughput || Cost >= 0) &&
277 "TTI should not produce negative costs!");
278 return Cost;
279}
280
281BranchProbability TargetTransformInfo::getPredictableBranchThreshold() const {
282 return PredictableBranchThreshold.getNumOccurrences() > 0
283 ? BranchProbability(PredictableBranchThreshold, 100)
284 : TTIImpl->getPredictableBranchThreshold();
285}
286
287InstructionCost TargetTransformInfo::getBranchMispredictPenalty() const {
288 return TTIImpl->getBranchMispredictPenalty();
289}
290
291bool TargetTransformInfo::hasBranchDivergence(const Function *F) const {
292 return TTIImpl->hasBranchDivergence(F);
293}
294
295InstructionUniformity
296llvm::TargetTransformInfo::getInstructionUniformity(const Value *V) const {
297 // Calls with the NoDivergenceSource attribute are always uniform.
298 if (const auto *Call = dyn_cast<CallBase>(Val: V)) {
299 if (Call->hasFnAttr(Kind: Attribute::NoDivergenceSource))
300 return InstructionUniformity::AlwaysUniform;
301 }
302 return TTIImpl->getInstructionUniformity(V);
303}
304
305bool llvm::TargetTransformInfo::isValidAddrSpaceCast(unsigned FromAS,
306 unsigned ToAS) const {
307 return TTIImpl->isValidAddrSpaceCast(FromAS, ToAS);
308}
309
310bool llvm::TargetTransformInfo::addrspacesMayAlias(unsigned FromAS,
311 unsigned ToAS) const {
312 return TTIImpl->addrspacesMayAlias(AS0: FromAS, AS1: ToAS);
313}
314
315unsigned TargetTransformInfo::getFlatAddressSpace() const {
316 return TTIImpl->getFlatAddressSpace();
317}
318
319bool TargetTransformInfo::collectFlatAddressOperands(
320 SmallVectorImpl<int> &OpIndexes, Intrinsic::ID IID) const {
321 return TTIImpl->collectFlatAddressOperands(OpIndexes, IID);
322}
323
324bool TargetTransformInfo::isNoopAddrSpaceCast(unsigned FromAS,
325 unsigned ToAS) const {
326 return TTIImpl->isNoopAddrSpaceCast(FromAS, ToAS);
327}
328
329std::pair<KnownBits, KnownBits>
330TargetTransformInfo::computeKnownBitsAddrSpaceCast(unsigned ToAS,
331 const Value &PtrOp) const {
332 return TTIImpl->computeKnownBitsAddrSpaceCast(ToAS, PtrOp);
333}
334
335KnownBits TargetTransformInfo::computeKnownBitsAddrSpaceCast(
336 unsigned FromAS, unsigned ToAS, const KnownBits &FromPtrBits) const {
337 return TTIImpl->computeKnownBitsAddrSpaceCast(FromAS, ToAS, FromPtrBits);
338}
339
340APInt TargetTransformInfo::getAddrSpaceCastPreservedPtrMask(
341 unsigned SrcAS, unsigned DstAS) const {
342 return TTIImpl->getAddrSpaceCastPreservedPtrMask(SrcAS, DstAS);
343}
344
345bool TargetTransformInfo::canHaveNonUndefGlobalInitializerInAddressSpace(
346 unsigned AS) const {
347 return TTIImpl->canHaveNonUndefGlobalInitializerInAddressSpace(AS);
348}
349
350unsigned TargetTransformInfo::getAssumedAddrSpace(const Value *V) const {
351 return TTIImpl->getAssumedAddrSpace(V);
352}
353
354bool TargetTransformInfo::isSingleThreaded() const {
355 return TTIImpl->isSingleThreaded();
356}
357
358std::pair<const Value *, unsigned>
359TargetTransformInfo::getPredicatedAddrSpace(const Value *V) const {
360 return TTIImpl->getPredicatedAddrSpace(V);
361}
362
363Value *TargetTransformInfo::rewriteIntrinsicWithAddressSpace(
364 IntrinsicInst *II, Value *OldV, Value *NewV) const {
365 return TTIImpl->rewriteIntrinsicWithAddressSpace(II, OldV, NewV);
366}
367
368bool TargetTransformInfo::isLoweredToCall(const Function *F) const {
369 return TTIImpl->isLoweredToCall(F);
370}
371
372bool TargetTransformInfo::isHardwareLoopProfitable(
373 Loop *L, ScalarEvolution &SE, AssumptionCache &AC,
374 TargetLibraryInfo *LibInfo, HardwareLoopInfo &HWLoopInfo) const {
375 return TTIImpl->isHardwareLoopProfitable(L, SE, AC, LibInfo, HWLoopInfo);
376}
377
378unsigned TargetTransformInfo::getEpilogueVectorizationMinVF() const {
379 return TTIImpl->getEpilogueVectorizationMinVF();
380}
381
382bool TargetTransformInfo::preferPredicateOverEpilogue(
383 TailFoldingInfo *TFI) const {
384 return TTIImpl->preferPredicateOverEpilogue(TFI);
385}
386
387TailFoldingStyle TargetTransformInfo::getPreferredTailFoldingStyle() const {
388 return TTIImpl->getPreferredTailFoldingStyle();
389}
390
391std::optional<Instruction *>
392TargetTransformInfo::instCombineIntrinsic(InstCombiner &IC,
393 IntrinsicInst &II) const {
394 return TTIImpl->instCombineIntrinsic(IC, II);
395}
396
397std::optional<Value *> TargetTransformInfo::simplifyDemandedUseBitsIntrinsic(
398 InstCombiner &IC, IntrinsicInst &II, APInt DemandedMask, KnownBits &Known,
399 bool &KnownBitsComputed) const {
400 return TTIImpl->simplifyDemandedUseBitsIntrinsic(IC, II, DemandedMask, Known,
401 KnownBitsComputed);
402}
403
404std::optional<Value *> TargetTransformInfo::simplifyDemandedVectorEltsIntrinsic(
405 InstCombiner &IC, IntrinsicInst &II, APInt DemandedElts, APInt &UndefElts,
406 APInt &UndefElts2, APInt &UndefElts3,
407 std::function<void(Instruction *, unsigned, APInt, APInt &)>
408 SimplifyAndSetOp) const {
409 return TTIImpl->simplifyDemandedVectorEltsIntrinsic(
410 IC, II, DemandedElts, UndefElts, UndefElts2, UndefElts3,
411 SimplifyAndSetOp);
412}
413
414void TargetTransformInfo::getUnrollingPreferences(
415 Loop *L, ScalarEvolution &SE, UnrollingPreferences &UP,
416 OptimizationRemarkEmitter *ORE) const {
417 return TTIImpl->getUnrollingPreferences(L, SE, UP, ORE);
418}
419
420void TargetTransformInfo::getPeelingPreferences(Loop *L, ScalarEvolution &SE,
421 PeelingPreferences &PP) const {
422 return TTIImpl->getPeelingPreferences(L, SE, PP);
423}
424
425bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const {
426 return TTIImpl->isLegalAddImmediate(Imm);
427}
428
429bool TargetTransformInfo::isLegalAddScalableImmediate(int64_t Imm) const {
430 return TTIImpl->isLegalAddScalableImmediate(Imm);
431}
432
433bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const {
434 return TTIImpl->isLegalICmpImmediate(Imm);
435}
436
437bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
438 int64_t BaseOffset,
439 bool HasBaseReg, int64_t Scale,
440 unsigned AddrSpace,
441 Instruction *I,
442 int64_t ScalableOffset) const {
443 return TTIImpl->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg,
444 Scale, AddrSpace, I, ScalableOffset);
445}
446
447bool TargetTransformInfo::isLSRCostLess(const LSRCost &C1,
448 const LSRCost &C2) const {
449 return TTIImpl->isLSRCostLess(C1, C2);
450}
451
452bool TargetTransformInfo::isNumRegsMajorCostOfLSR() const {
453 return TTIImpl->isNumRegsMajorCostOfLSR();
454}
455
456bool TargetTransformInfo::shouldDropLSRSolutionIfLessProfitable() const {
457 return TTIImpl->shouldDropLSRSolutionIfLessProfitable();
458}
459
460bool TargetTransformInfo::isProfitableLSRChainElement(Instruction *I) const {
461 return TTIImpl->isProfitableLSRChainElement(I);
462}
463
464bool TargetTransformInfo::canMacroFuseCmp() const {
465 return TTIImpl->canMacroFuseCmp();
466}
467
468bool TargetTransformInfo::canSaveCmp(Loop *L, CondBrInst **BI,
469 ScalarEvolution *SE, LoopInfo *LI,
470 DominatorTree *DT, AssumptionCache *AC,
471 TargetLibraryInfo *LibInfo) const {
472 return TTIImpl->canSaveCmp(L, BI, SE, LI, DT, AC, LibInfo);
473}
474
475TTI::AddressingModeKind
476TargetTransformInfo::getPreferredAddressingMode(const Loop *L,
477 ScalarEvolution *SE) const {
478 return TTIImpl->getPreferredAddressingMode(L, SE);
479}
480
481bool TargetTransformInfo::isLegalMaskedStore(Type *DataType, Align Alignment,
482 unsigned AddressSpace,
483 TTI::MaskKind MaskKind) const {
484 return TTIImpl->isLegalMaskedStore(DataType, Alignment, AddressSpace,
485 MaskKind);
486}
487
488bool TargetTransformInfo::isLegalMaskedLoad(Type *DataType, Align Alignment,
489 unsigned AddressSpace,
490 TTI::MaskKind MaskKind) const {
491 return TTIImpl->isLegalMaskedLoad(DataType, Alignment, AddressSpace,
492 MaskKind);
493}
494
495bool TargetTransformInfo::isLegalNTStore(Type *DataType,
496 Align Alignment) const {
497 return TTIImpl->isLegalNTStore(DataType, Alignment);
498}
499
500bool TargetTransformInfo::isLegalNTLoad(Type *DataType, Align Alignment) const {
501 return TTIImpl->isLegalNTLoad(DataType, Alignment);
502}
503
504bool TargetTransformInfo::isLegalBroadcastLoad(Type *ElementTy,
505 ElementCount NumElements) const {
506 return TTIImpl->isLegalBroadcastLoad(ElementTy, NumElements);
507}
508
509bool TargetTransformInfo::isLegalMaskedGather(Type *DataType,
510 Align Alignment) const {
511 return TTIImpl->isLegalMaskedGather(DataType, Alignment);
512}
513
514bool TargetTransformInfo::isLegalAltInstr(
515 VectorType *VecTy, unsigned Opcode0, unsigned Opcode1,
516 const SmallBitVector &OpcodeMask) const {
517 return TTIImpl->isLegalAltInstr(VecTy, Opcode0, Opcode1, OpcodeMask);
518}
519
520bool TargetTransformInfo::isLegalMaskedScatter(Type *DataType,
521 Align Alignment) const {
522 return TTIImpl->isLegalMaskedScatter(DataType, Alignment);
523}
524
525bool TargetTransformInfo::forceScalarizeMaskedGather(VectorType *DataType,
526 Align Alignment) const {
527 return TTIImpl->forceScalarizeMaskedGather(DataType, Alignment);
528}
529
530bool TargetTransformInfo::forceScalarizeMaskedScatter(VectorType *DataType,
531 Align Alignment) const {
532 return TTIImpl->forceScalarizeMaskedScatter(DataType, Alignment);
533}
534
535bool TargetTransformInfo::isLegalMaskedCompressStore(Type *DataType,
536 Align Alignment) const {
537 return TTIImpl->isLegalMaskedCompressStore(DataType, Alignment);
538}
539
540bool TargetTransformInfo::isLegalMaskedExpandLoad(Type *DataType,
541 Align Alignment) const {
542 return TTIImpl->isLegalMaskedExpandLoad(DataType, Alignment);
543}
544
545bool TargetTransformInfo::isLegalStridedLoadStore(Type *DataType,
546 Align Alignment) const {
547 return TTIImpl->isLegalStridedLoadStore(DataType, Alignment);
548}
549
550bool TargetTransformInfo::isLegalInterleavedAccessType(
551 VectorType *VTy, unsigned Factor, Align Alignment,
552 unsigned AddrSpace) const {
553 return TTIImpl->isLegalInterleavedAccessType(VTy, Factor, Alignment,
554 AddrSpace);
555}
556
557bool TargetTransformInfo::isLegalMaskedVectorHistogram(Type *AddrType,
558 Type *DataType) const {
559 return TTIImpl->isLegalMaskedVectorHistogram(AddrType, DataType);
560}
561
562bool TargetTransformInfo::enableOrderedReductions() const {
563 return TTIImpl->enableOrderedReductions();
564}
565
566bool TargetTransformInfo::hasDivRemOp(Type *DataType, bool IsSigned) const {
567 return TTIImpl->hasDivRemOp(DataType, IsSigned);
568}
569
570bool TargetTransformInfo::hasVolatileVariant(Instruction *I,
571 unsigned AddrSpace) const {
572 return TTIImpl->hasVolatileVariant(I, AddrSpace);
573}
574
575bool TargetTransformInfo::prefersVectorizedAddressing() const {
576 return TTIImpl->prefersVectorizedAddressing();
577}
578
579InstructionCost TargetTransformInfo::getScalingFactorCost(
580 Type *Ty, GlobalValue *BaseGV, StackOffset BaseOffset, bool HasBaseReg,
581 int64_t Scale, unsigned AddrSpace) const {
582 InstructionCost Cost = TTIImpl->getScalingFactorCost(
583 Ty, BaseGV, BaseOffset, HasBaseReg, Scale, AddrSpace);
584 assert(Cost >= 0 && "TTI should not produce negative costs!");
585 return Cost;
586}
587
588bool TargetTransformInfo::LSRWithInstrQueries() const {
589 return TTIImpl->LSRWithInstrQueries();
590}
591
592bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const {
593 return TTIImpl->isTruncateFree(Ty1, Ty2);
594}
595
596bool TargetTransformInfo::isProfitableToHoist(Instruction *I) const {
597 return TTIImpl->isProfitableToHoist(I);
598}
599
600bool TargetTransformInfo::useAA() const { return TTIImpl->useAA(); }
601
602bool TargetTransformInfo::isTypeLegal(Type *Ty) const {
603 return TTIImpl->isTypeLegal(Ty);
604}
605
606unsigned TargetTransformInfo::getRegUsageForType(Type *Ty) const {
607 return TTIImpl->getRegUsageForType(Ty);
608}
609
610bool TargetTransformInfo::shouldBuildLookupTables() const {
611 return TTIImpl->shouldBuildLookupTables();
612}
613
614bool TargetTransformInfo::shouldBuildLookupTablesForConstant(
615 Constant *C) const {
616 return TTIImpl->shouldBuildLookupTablesForConstant(C);
617}
618
619bool TargetTransformInfo::shouldBuildRelLookupTables() const {
620 return TTIImpl->shouldBuildRelLookupTables();
621}
622
623bool TargetTransformInfo::useColdCCForColdCall(Function &F) const {
624 return TTIImpl->useColdCCForColdCall(F);
625}
626
627bool TargetTransformInfo::useFastCCForInternalCall(Function &F) const {
628 return TTIImpl->useFastCCForInternalCall(F);
629}
630
631bool TargetTransformInfo::isTargetIntrinsicTriviallyScalarizable(
632 Intrinsic::ID ID) const {
633 return TTIImpl->isTargetIntrinsicTriviallyScalarizable(ID);
634}
635
636bool TargetTransformInfo::isTargetIntrinsicWithScalarOpAtArg(
637 Intrinsic::ID ID, unsigned ScalarOpdIdx) const {
638 return TTIImpl->isTargetIntrinsicWithScalarOpAtArg(ID, ScalarOpdIdx);
639}
640
641bool TargetTransformInfo::isTargetIntrinsicWithOverloadTypeAtArg(
642 Intrinsic::ID ID, int OpdIdx) const {
643 return TTIImpl->isTargetIntrinsicWithOverloadTypeAtArg(ID, OpdIdx);
644}
645
646bool TargetTransformInfo::isTargetIntrinsicWithStructReturnOverloadAtField(
647 Intrinsic::ID ID, int RetIdx) const {
648 return TTIImpl->isTargetIntrinsicWithStructReturnOverloadAtField(ID, RetIdx);
649}
650
651TargetTransformInfo::VectorInstrContext
652TargetTransformInfo::getVectorInstrContextHint(const Instruction *I) {
653 if (!I)
654 return VectorInstrContext::None;
655
656 // For inserts, check if the value being inserted comes from a single-use
657 // load.
658 if (isa<InsertElementInst>(Val: I) && isa<LoadInst>(Val: I->getOperand(i: 1)) &&
659 I->getOperand(i: 1)->hasOneUse())
660 return VectorInstrContext::Load;
661
662 // For extracts, check if it has a single use that is a store.
663 if (isa<ExtractElementInst>(Val: I) && I->hasOneUse() &&
664 isa<StoreInst>(Val: *I->user_begin()))
665 return VectorInstrContext::Store;
666
667 return VectorInstrContext::None;
668}
669
670InstructionCost TargetTransformInfo::getScalarizationOverhead(
671 VectorType *Ty, const APInt &DemandedElts, bool Insert, bool Extract,
672 TTI::TargetCostKind CostKind, bool ForPoisonSrc, ArrayRef<Value *> VL,
673 TTI::VectorInstrContext VIC) const {
674 return TTIImpl->getScalarizationOverhead(Ty, DemandedElts, Insert, Extract,
675 CostKind, ForPoisonSrc, VL, VIC);
676}
677
678InstructionCost TargetTransformInfo::getOperandsScalarizationOverhead(
679 ArrayRef<Type *> Tys, TTI::TargetCostKind CostKind,
680 TTI::VectorInstrContext VIC) const {
681 return TTIImpl->getOperandsScalarizationOverhead(Tys, CostKind, VIC);
682}
683
684bool TargetTransformInfo::supportsEfficientVectorElementLoadStore() const {
685 return TTIImpl->supportsEfficientVectorElementLoadStore();
686}
687
688bool TargetTransformInfo::supportsTailCalls() const {
689 return TTIImpl->supportsTailCalls();
690}
691
692bool TargetTransformInfo::supportsTailCallFor(const CallBase *CB) const {
693 return TTIImpl->supportsTailCallFor(CB);
694}
695
696bool TargetTransformInfo::enableAggressiveInterleaving(
697 bool LoopHasReductions) const {
698 return TTIImpl->enableAggressiveInterleaving(LoopHasReductions);
699}
700
701TargetTransformInfo::MemCmpExpansionOptions
702TargetTransformInfo::enableMemCmpExpansion(bool OptSize, bool IsZeroCmp) const {
703 return TTIImpl->enableMemCmpExpansion(OptSize, IsZeroCmp);
704}
705
706bool TargetTransformInfo::enableSelectOptimize() const {
707 return TTIImpl->enableSelectOptimize();
708}
709
710bool TargetTransformInfo::shouldTreatInstructionLikeSelect(
711 const Instruction *I) const {
712 return TTIImpl->shouldTreatInstructionLikeSelect(I);
713}
714
715bool TargetTransformInfo::enableInterleavedAccessVectorization() const {
716 return TTIImpl->enableInterleavedAccessVectorization();
717}
718
719bool TargetTransformInfo::enableMaskedInterleavedAccessVectorization() const {
720 return TTIImpl->enableMaskedInterleavedAccessVectorization();
721}
722
723bool TargetTransformInfo::isFPVectorizationPotentiallyUnsafe() const {
724 return TTIImpl->isFPVectorizationPotentiallyUnsafe();
725}
726
727bool
728TargetTransformInfo::allowsMisalignedMemoryAccesses(LLVMContext &Context,
729 unsigned BitWidth,
730 unsigned AddressSpace,
731 Align Alignment,
732 unsigned *Fast) const {
733 return TTIImpl->allowsMisalignedMemoryAccesses(Context, BitWidth,
734 AddressSpace, Alignment, Fast);
735}
736
737TargetTransformInfo::PopcntSupportKind
738TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const {
739 return TTIImpl->getPopcntSupport(IntTyWidthInBit);
740}
741
742bool TargetTransformInfo::haveFastSqrt(Type *Ty) const {
743 return TTIImpl->haveFastSqrt(Ty);
744}
745
746bool TargetTransformInfo::isExpensiveToSpeculativelyExecute(
747 const Instruction *I) const {
748 return TTIImpl->isExpensiveToSpeculativelyExecute(I);
749}
750
751bool TargetTransformInfo::isFCmpOrdCheaperThanFCmpZero(Type *Ty) const {
752 return TTIImpl->isFCmpOrdCheaperThanFCmpZero(Ty);
753}
754
755InstructionCost TargetTransformInfo::getFPOpCost(Type *Ty) const {
756 InstructionCost Cost = TTIImpl->getFPOpCost(Ty);
757 assert(Cost >= 0 && "TTI should not produce negative costs!");
758 return Cost;
759}
760
761InstructionCost TargetTransformInfo::getIntImmCodeSizeCost(unsigned Opcode,
762 unsigned Idx,
763 const APInt &Imm,
764 Type *Ty) const {
765 InstructionCost Cost = TTIImpl->getIntImmCodeSizeCost(Opcode, Idx, Imm, Ty);
766 assert(Cost >= 0 && "TTI should not produce negative costs!");
767 return Cost;
768}
769
770InstructionCost
771TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty,
772 TTI::TargetCostKind CostKind) const {
773 InstructionCost Cost = TTIImpl->getIntImmCost(Imm, Ty, CostKind);
774 assert(Cost >= 0 && "TTI should not produce negative costs!");
775 return Cost;
776}
777
778InstructionCost TargetTransformInfo::getIntImmCostInst(
779 unsigned Opcode, unsigned Idx, const APInt &Imm, Type *Ty,
780 TTI::TargetCostKind CostKind, Instruction *Inst) const {
781 InstructionCost Cost =
782 TTIImpl->getIntImmCostInst(Opcode, Idx, Imm, Ty, CostKind, Inst);
783 assert(Cost >= 0 && "TTI should not produce negative costs!");
784 return Cost;
785}
786
787InstructionCost
788TargetTransformInfo::getIntImmCostIntrin(Intrinsic::ID IID, unsigned Idx,
789 const APInt &Imm, Type *Ty,
790 TTI::TargetCostKind CostKind) const {
791 InstructionCost Cost =
792 TTIImpl->getIntImmCostIntrin(IID, Idx, Imm, Ty, CostKind);
793 assert(Cost >= 0 && "TTI should not produce negative costs!");
794 return Cost;
795}
796
797bool TargetTransformInfo::preferToKeepConstantsAttached(
798 const Instruction &Inst, const Function &Fn) const {
799 return TTIImpl->preferToKeepConstantsAttached(Inst, Fn);
800}
801
802unsigned TargetTransformInfo::getNumberOfRegisters(unsigned ClassID) const {
803 return TTIImpl->getNumberOfRegisters(ClassID);
804}
805
806bool TargetTransformInfo::hasConditionalLoadStoreForType(Type *Ty,
807 bool IsStore) const {
808 return TTIImpl->hasConditionalLoadStoreForType(Ty, IsStore);
809}
810
811unsigned TargetTransformInfo::getRegisterClassForType(bool Vector,
812 Type *Ty) const {
813 return TTIImpl->getRegisterClassForType(Vector, Ty);
814}
815
816const char *TargetTransformInfo::getRegisterClassName(unsigned ClassID) const {
817 return TTIImpl->getRegisterClassName(ClassID);
818}
819
820TypeSize TargetTransformInfo::getRegisterBitWidth(
821 TargetTransformInfo::RegisterKind K) const {
822 return TTIImpl->getRegisterBitWidth(K);
823}
824
825unsigned TargetTransformInfo::getMinVectorRegisterBitWidth() const {
826 return TTIImpl->getMinVectorRegisterBitWidth();
827}
828
829std::optional<unsigned> TargetTransformInfo::getMaxVScale() const {
830 return TTIImpl->getMaxVScale();
831}
832
833std::optional<unsigned> TargetTransformInfo::getVScaleForTuning() const {
834 return TTIImpl->getVScaleForTuning();
835}
836
837bool TargetTransformInfo::shouldMaximizeVectorBandwidth(
838 TargetTransformInfo::RegisterKind K) const {
839 return TTIImpl->shouldMaximizeVectorBandwidth(K);
840}
841
842ElementCount TargetTransformInfo::getMinimumVF(unsigned ElemWidth,
843 bool IsScalable) const {
844 return TTIImpl->getMinimumVF(ElemWidth, IsScalable);
845}
846
847unsigned TargetTransformInfo::getMaximumVF(unsigned ElemWidth,
848 unsigned Opcode) const {
849 return TTIImpl->getMaximumVF(ElemWidth, Opcode);
850}
851
852unsigned TargetTransformInfo::getStoreMinimumVF(unsigned VF, Type *ScalarMemTy,
853 Type *ScalarValTy) const {
854 return TTIImpl->getStoreMinimumVF(VF, ScalarMemTy, ScalarValTy);
855}
856
857bool TargetTransformInfo::shouldConsiderAddressTypePromotion(
858 const Instruction &I, bool &AllowPromotionWithoutCommonHeader) const {
859 return TTIImpl->shouldConsiderAddressTypePromotion(
860 I, AllowPromotionWithoutCommonHeader);
861}
862
863unsigned TargetTransformInfo::getCacheLineSize() const {
864 return CacheLineSize.getNumOccurrences() > 0 ? CacheLineSize
865 : TTIImpl->getCacheLineSize();
866}
867
868std::optional<unsigned>
869TargetTransformInfo::getCacheSize(CacheLevel Level) const {
870 return TTIImpl->getCacheSize(Level);
871}
872
873std::optional<unsigned>
874TargetTransformInfo::getCacheAssociativity(CacheLevel Level) const {
875 return TTIImpl->getCacheAssociativity(Level);
876}
877
878std::optional<unsigned> TargetTransformInfo::getMinPageSize() const {
879 return MinPageSize.getNumOccurrences() > 0 ? MinPageSize
880 : TTIImpl->getMinPageSize();
881}
882
883unsigned TargetTransformInfo::getPrefetchDistance() const {
884 return TTIImpl->getPrefetchDistance();
885}
886
887unsigned TargetTransformInfo::getMinPrefetchStride(
888 unsigned NumMemAccesses, unsigned NumStridedMemAccesses,
889 unsigned NumPrefetches, bool HasCall) const {
890 return TTIImpl->getMinPrefetchStride(NumMemAccesses, NumStridedMemAccesses,
891 NumPrefetches, HasCall);
892}
893
894unsigned TargetTransformInfo::getMaxPrefetchIterationsAhead() const {
895 return TTIImpl->getMaxPrefetchIterationsAhead();
896}
897
898bool TargetTransformInfo::enableWritePrefetching() const {
899 return TTIImpl->enableWritePrefetching();
900}
901
902bool TargetTransformInfo::shouldPrefetchAddressSpace(unsigned AS) const {
903 return TTIImpl->shouldPrefetchAddressSpace(AS);
904}
905
906InstructionCost TargetTransformInfo::getPartialReductionCost(
907 unsigned Opcode, Type *InputTypeA, Type *InputTypeB, Type *AccumType,
908 ElementCount VF, PartialReductionExtendKind OpAExtend,
909 PartialReductionExtendKind OpBExtend, std::optional<unsigned> BinOp,
910 TTI::TargetCostKind CostKind, std::optional<FastMathFlags> FMF) const {
911 return TTIImpl->getPartialReductionCost(Opcode, InputTypeA, InputTypeB,
912 AccumType, VF, OpAExtend, OpBExtend,
913 BinOp, CostKind, FMF);
914}
915
916unsigned TargetTransformInfo::getMaxInterleaveFactor(ElementCount VF) const {
917 return TTIImpl->getMaxInterleaveFactor(VF);
918}
919
920TargetTransformInfo::OperandValueInfo
921TargetTransformInfo::getOperandInfo(const Value *V) {
922 OperandValueKind OpInfo = OK_AnyValue;
923 OperandValueProperties OpProps = OP_None;
924
925 // undef/poison don't materialize constants.
926 if (isa<UndefValue>(Val: V))
927 return {.Kind: OK_AnyValue, .Properties: OP_None};
928
929 if (isa<ConstantInt>(Val: V) || isa<ConstantFP>(Val: V)) {
930 if (const auto *CI = dyn_cast<ConstantInt>(Val: V)) {
931 if (CI->getValue().isPowerOf2())
932 OpProps = OP_PowerOf2;
933 else if (CI->getValue().isNegatedPowerOf2())
934 OpProps = OP_NegatedPowerOf2;
935 }
936 return {.Kind: OK_UniformConstantValue, .Properties: OpProps};
937 }
938
939 // A broadcast shuffle creates a uniform value.
940 // TODO: Add support for non-zero index broadcasts.
941 // TODO: Add support for different source vector width.
942 if (const auto *ShuffleInst = dyn_cast<ShuffleVectorInst>(Val: V))
943 if (ShuffleInst->isZeroEltSplat())
944 OpInfo = OK_UniformValue;
945
946 const Value *Splat = getSplatValue(V);
947
948 // Check for a splat of a constant or for a non uniform vector of constants
949 // and check if the constant(s) are all powers of two.
950 if (Splat) {
951 // Check for a splat of a uniform value. This is not loop aware, so return
952 // true only for the obviously uniform cases (argument, globalvalue)
953 if (isa<Argument>(Val: Splat) || isa<GlobalValue>(Val: Splat)) {
954 OpInfo = OK_UniformValue;
955 } else if (isa<Constant>(Val: Splat)) {
956 OpInfo = OK_UniformConstantValue;
957 if (auto *CI = dyn_cast<ConstantInt>(Val: Splat)) {
958 if (CI->getValue().isPowerOf2())
959 OpProps = OP_PowerOf2;
960 else if (CI->getValue().isNegatedPowerOf2())
961 OpProps = OP_NegatedPowerOf2;
962 }
963 }
964 } else if (const auto *CDS = dyn_cast<ConstantDataSequential>(Val: V)) {
965 OpInfo = OK_NonUniformConstantValue;
966 bool AllPow2 = true, AllNegPow2 = true;
967 for (uint64_t I = 0, E = CDS->getNumElements(); I != E; ++I) {
968 if (auto *CI = dyn_cast<ConstantInt>(Val: CDS->getElementAsConstant(i: I))) {
969 AllPow2 &= CI->getValue().isPowerOf2();
970 AllNegPow2 &= CI->getValue().isNegatedPowerOf2();
971 if (AllPow2 || AllNegPow2)
972 continue;
973 }
974 AllPow2 = AllNegPow2 = false;
975 break;
976 }
977 OpProps = AllPow2 ? OP_PowerOf2 : OpProps;
978 OpProps = AllNegPow2 ? OP_NegatedPowerOf2 : OpProps;
979 } else if (isa<ConstantVector>(Val: V) || isa<ConstantDataVector>(Val: V)) {
980 OpInfo = OK_NonUniformConstantValue;
981 }
982
983 return {.Kind: OpInfo, .Properties: OpProps};
984}
985
986TargetTransformInfo::OperandValueInfo
987TargetTransformInfo::commonOperandInfo(const Value *X, const Value *Y) {
988 OperandValueInfo OpInfoX = getOperandInfo(V: X);
989 if (X == Y)
990 return OpInfoX;
991 return OpInfoX.mergeWith(OpInfoY: getOperandInfo(V: Y));
992}
993
994InstructionCost TargetTransformInfo::getArithmeticInstrCost(
995 unsigned Opcode, Type *Ty, TTI::TargetCostKind CostKind,
996 OperandValueInfo Op1Info, OperandValueInfo Op2Info,
997 ArrayRef<const Value *> Args, const Instruction *CxtI,
998 const TargetLibraryInfo *TLibInfo) const {
999
1000 // Use call cost for frem intructions that have platform specific vector math
1001 // functions, as those will be replaced with calls later by SelectionDAG or
1002 // ReplaceWithVecLib pass.
1003 if (TLibInfo && Opcode == Instruction::FRem) {
1004 VectorType *VecTy = dyn_cast<VectorType>(Val: Ty);
1005 LibFunc Func;
1006 if (VecTy &&
1007 TLibInfo->getLibFunc(Opcode: Instruction::FRem, Ty: Ty->getScalarType(), F&: Func) &&
1008 TLibInfo->isFunctionVectorizable(F: TLibInfo->getName(F: Func),
1009 VF: VecTy->getElementCount()))
1010 return getCallInstrCost(F: nullptr, RetTy: VecTy, Tys: {VecTy, VecTy}, CostKind);
1011 }
1012
1013 InstructionCost Cost = TTIImpl->getArithmeticInstrCost(
1014 Opcode, Ty, CostKind, Opd1Info: Op1Info, Opd2Info: Op2Info, Args, CxtI);
1015 assert(Cost >= 0 && "TTI should not produce negative costs!");
1016 return Cost;
1017}
1018
1019InstructionCost TargetTransformInfo::getAltInstrCost(
1020 VectorType *VecTy, unsigned Opcode0, unsigned Opcode1,
1021 const SmallBitVector &OpcodeMask, TTI::TargetCostKind CostKind) const {
1022 InstructionCost Cost =
1023 TTIImpl->getAltInstrCost(VecTy, Opcode0, Opcode1, OpcodeMask, CostKind);
1024 assert(Cost >= 0 && "TTI should not produce negative costs!");
1025 return Cost;
1026}
1027
1028InstructionCost TargetTransformInfo::getShuffleCost(
1029 ShuffleKind Kind, VectorType *DstTy, VectorType *SrcTy, ArrayRef<int> Mask,
1030 TTI::TargetCostKind CostKind, int Index, VectorType *SubTp,
1031 ArrayRef<const Value *> Args, const Instruction *CxtI) const {
1032 assert((Mask.empty() || DstTy->isScalableTy() ||
1033 Mask.size() == DstTy->getElementCount().getKnownMinValue()) &&
1034 "Expected the Mask to match the return size if given");
1035 assert(SrcTy->getScalarType() == DstTy->getScalarType() &&
1036 "Expected the same scalar types");
1037 InstructionCost Cost = TTIImpl->getShuffleCost(
1038 Kind, DstTy, SrcTy, Mask, CostKind, Index, SubTp, Args, CxtI);
1039 assert(Cost >= 0 && "TTI should not produce negative costs!");
1040 return Cost;
1041}
1042
1043TargetTransformInfo::PartialReductionExtendKind
1044TargetTransformInfo::getPartialReductionExtendKind(Instruction *I) {
1045 if (auto *Cast = dyn_cast<CastInst>(Val: I))
1046 return getPartialReductionExtendKind(CastOpc: Cast->getOpcode());
1047 return PR_None;
1048}
1049
1050TargetTransformInfo::PartialReductionExtendKind
1051TargetTransformInfo::getPartialReductionExtendKind(
1052 Instruction::CastOps CastOpc) {
1053 switch (CastOpc) {
1054 case Instruction::CastOps::ZExt:
1055 return PR_ZeroExtend;
1056 case Instruction::CastOps::SExt:
1057 return PR_SignExtend;
1058 case Instruction::CastOps::FPExt:
1059 return PR_FPExtend;
1060 default:
1061 return PR_None;
1062 }
1063 llvm_unreachable("Unhandled cast opcode");
1064}
1065
1066TTI::CastContextHint
1067TargetTransformInfo::getCastContextHint(const Instruction *I) {
1068 if (!I)
1069 return CastContextHint::None;
1070
1071 auto getLoadStoreKind = [](const Value *V, unsigned LdStOp, unsigned MaskedOp,
1072 unsigned GatScatOp) {
1073 const Instruction *I = dyn_cast<Instruction>(Val: V);
1074 if (!I)
1075 return CastContextHint::None;
1076
1077 if (I->getOpcode() == LdStOp)
1078 return CastContextHint::Normal;
1079
1080 if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Val: I)) {
1081 if (II->getIntrinsicID() == MaskedOp)
1082 return TTI::CastContextHint::Masked;
1083 if (II->getIntrinsicID() == GatScatOp)
1084 return TTI::CastContextHint::GatherScatter;
1085 }
1086
1087 return TTI::CastContextHint::None;
1088 };
1089
1090 switch (I->getOpcode()) {
1091 case Instruction::ZExt:
1092 case Instruction::SExt:
1093 case Instruction::FPExt:
1094 return getLoadStoreKind(I->getOperand(i: 0), Instruction::Load,
1095 Intrinsic::masked_load, Intrinsic::masked_gather);
1096 case Instruction::Trunc:
1097 case Instruction::FPTrunc:
1098 if (I->hasOneUse())
1099 return getLoadStoreKind(*I->user_begin(), Instruction::Store,
1100 Intrinsic::masked_store,
1101 Intrinsic::masked_scatter);
1102 break;
1103 default:
1104 return CastContextHint::None;
1105 }
1106
1107 return TTI::CastContextHint::None;
1108}
1109
1110InstructionCost TargetTransformInfo::getCastInstrCost(
1111 unsigned Opcode, Type *Dst, Type *Src, CastContextHint CCH,
1112 TTI::TargetCostKind CostKind, const Instruction *I) const {
1113 assert((I == nullptr || I->getOpcode() == Opcode) &&
1114 "Opcode should reflect passed instruction.");
1115 InstructionCost Cost =
1116 TTIImpl->getCastInstrCost(Opcode, Dst, Src, CCH, CostKind, I);
1117 assert(Cost >= 0 && "TTI should not produce negative costs!");
1118 return Cost;
1119}
1120
1121InstructionCost TargetTransformInfo::getExtractWithExtendCost(
1122 unsigned Opcode, Type *Dst, VectorType *VecTy, unsigned Index,
1123 TTI::TargetCostKind CostKind) const {
1124 InstructionCost Cost =
1125 TTIImpl->getExtractWithExtendCost(Opcode, Dst, VecTy, Index, CostKind);
1126 assert(Cost >= 0 && "TTI should not produce negative costs!");
1127 return Cost;
1128}
1129
1130InstructionCost TargetTransformInfo::getCFInstrCost(
1131 unsigned Opcode, TTI::TargetCostKind CostKind, const Instruction *I) const {
1132 assert((I == nullptr || I->getOpcode() == Opcode) &&
1133 "Opcode should reflect passed instruction.");
1134 InstructionCost Cost = TTIImpl->getCFInstrCost(Opcode, CostKind, I);
1135 assert(Cost >= 0 && "TTI should not produce negative costs!");
1136 return Cost;
1137}
1138
1139InstructionCost TargetTransformInfo::getCmpSelInstrCost(
1140 unsigned Opcode, Type *ValTy, Type *CondTy, CmpInst::Predicate VecPred,
1141 TTI::TargetCostKind CostKind, OperandValueInfo Op1Info,
1142 OperandValueInfo Op2Info, const Instruction *I) const {
1143 assert((I == nullptr || I->getOpcode() == Opcode) &&
1144 "Opcode should reflect passed instruction.");
1145 InstructionCost Cost = TTIImpl->getCmpSelInstrCost(
1146 Opcode, ValTy, CondTy, VecPred, CostKind, Op1Info, Op2Info, I);
1147 assert(Cost >= 0 && "TTI should not produce negative costs!");
1148 return Cost;
1149}
1150
1151InstructionCost TargetTransformInfo::getVectorInstrCost(
1152 unsigned Opcode, Type *Val, TTI::TargetCostKind CostKind, unsigned Index,
1153 const Value *Op0, const Value *Op1, TTI::VectorInstrContext VIC) const {
1154 assert((Opcode == Instruction::InsertElement ||
1155 Opcode == Instruction::ExtractElement) &&
1156 "Expecting Opcode to be insertelement/extractelement.");
1157 InstructionCost Cost =
1158 TTIImpl->getVectorInstrCost(Opcode, Val, CostKind, Index, Op0, Op1, VIC);
1159 assert(Cost >= 0 && "TTI should not produce negative costs!");
1160 return Cost;
1161}
1162
1163InstructionCost TargetTransformInfo::getVectorInstrCost(
1164 unsigned Opcode, Type *Val, TTI::TargetCostKind CostKind, unsigned Index,
1165 Value *Scalar, ArrayRef<std::tuple<Value *, User *, int>> ScalarUserAndIdx,
1166 TTI::VectorInstrContext VIC) const {
1167 assert((Opcode == Instruction::InsertElement ||
1168 Opcode == Instruction::ExtractElement) &&
1169 "Expecting Opcode to be insertelement/extractelement.");
1170 InstructionCost Cost = TTIImpl->getVectorInstrCost(
1171 Opcode, Val, CostKind, Index, Scalar, ScalarUserAndIdx, VIC);
1172 assert(Cost >= 0 && "TTI should not produce negative costs!");
1173 return Cost;
1174}
1175
1176InstructionCost TargetTransformInfo::getVectorInstrCost(
1177 const Instruction &I, Type *Val, TTI::TargetCostKind CostKind,
1178 unsigned Index, TTI::VectorInstrContext VIC) const {
1179 // FIXME: Assert that Opcode is either InsertElement or ExtractElement.
1180 // This is mentioned in the interface description and respected by all
1181 // callers, but never asserted upon.
1182 InstructionCost Cost =
1183 TTIImpl->getVectorInstrCost(I, Val, CostKind, Index, VIC);
1184 assert(Cost >= 0 && "TTI should not produce negative costs!");
1185 return Cost;
1186}
1187
1188InstructionCost TargetTransformInfo::getIndexedVectorInstrCostFromEnd(
1189 unsigned Opcode, Type *Val, TTI::TargetCostKind CostKind,
1190 unsigned Index) const {
1191 InstructionCost Cost =
1192 TTIImpl->getIndexedVectorInstrCostFromEnd(Opcode, Val, CostKind, Index);
1193 assert(Cost >= 0 && "TTI should not produce negative costs!");
1194 return Cost;
1195}
1196
1197InstructionCost TargetTransformInfo::getInsertExtractValueCost(
1198 unsigned Opcode, TTI::TargetCostKind CostKind) const {
1199 assert((Opcode == Instruction::InsertValue ||
1200 Opcode == Instruction::ExtractValue) &&
1201 "Expecting Opcode to be insertvalue/extractvalue.");
1202 InstructionCost Cost = TTIImpl->getInsertExtractValueCost(Opcode, CostKind);
1203 assert(Cost >= 0 && "TTI should not produce negative costs!");
1204 return Cost;
1205}
1206
1207InstructionCost TargetTransformInfo::getReplicationShuffleCost(
1208 Type *EltTy, int ReplicationFactor, int VF, const APInt &DemandedDstElts,
1209 TTI::TargetCostKind CostKind) const {
1210 InstructionCost Cost = TTIImpl->getReplicationShuffleCost(
1211 EltTy, ReplicationFactor, VF, DemandedDstElts, CostKind);
1212 assert(Cost >= 0 && "TTI should not produce negative costs!");
1213 return Cost;
1214}
1215
1216InstructionCost TargetTransformInfo::getMemoryOpCost(
1217 unsigned Opcode, Type *Src, Align Alignment, unsigned AddressSpace,
1218 TTI::TargetCostKind CostKind, TTI::OperandValueInfo OpInfo,
1219 const Instruction *I) const {
1220 assert((I == nullptr || I->getOpcode() == Opcode) &&
1221 "Opcode should reflect passed instruction.");
1222 InstructionCost Cost = TTIImpl->getMemoryOpCost(
1223 Opcode, Src, Alignment, AddressSpace, CostKind, OpInfo, I);
1224 assert(Cost >= 0 && "TTI should not produce negative costs!");
1225 return Cost;
1226}
1227
1228InstructionCost TargetTransformInfo::getInterleavedMemoryOpCost(
1229 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
1230 Align Alignment, unsigned AddressSpace, TTI::TargetCostKind CostKind,
1231 bool UseMaskForCond, bool UseMaskForGaps) const {
1232 InstructionCost Cost = TTIImpl->getInterleavedMemoryOpCost(
1233 Opcode, VecTy, Factor, Indices, Alignment, AddressSpace, CostKind,
1234 UseMaskForCond, UseMaskForGaps);
1235 assert(Cost >= 0 && "TTI should not produce negative costs!");
1236 return Cost;
1237}
1238
1239InstructionCost
1240TargetTransformInfo::getIntrinsicInstrCost(const IntrinsicCostAttributes &ICA,
1241 TTI::TargetCostKind CostKind) const {
1242 InstructionCost Cost = TTIImpl->getIntrinsicInstrCost(ICA, CostKind);
1243 assert(Cost >= 0 && "TTI should not produce negative costs!");
1244 return Cost;
1245}
1246
1247InstructionCost TargetTransformInfo::getMemIntrinsicInstrCost(
1248 const MemIntrinsicCostAttributes &MICA,
1249 TTI::TargetCostKind CostKind) const {
1250 InstructionCost Cost = TTIImpl->getMemIntrinsicInstrCost(MICA, CostKind);
1251 assert(Cost >= 0 && "TTI should not produce negative costs!");
1252 return Cost;
1253}
1254
1255InstructionCost
1256TargetTransformInfo::getCallInstrCost(Function *F, Type *RetTy,
1257 ArrayRef<Type *> Tys,
1258 TTI::TargetCostKind CostKind) const {
1259 InstructionCost Cost = TTIImpl->getCallInstrCost(F, RetTy, Tys, CostKind);
1260 assert(Cost >= 0 && "TTI should not produce negative costs!");
1261 return Cost;
1262}
1263
1264unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const {
1265 return TTIImpl->getNumberOfParts(Tp);
1266}
1267
1268InstructionCost TargetTransformInfo::getAddressComputationCost(
1269 Type *PtrTy, ScalarEvolution *SE, const SCEV *Ptr,
1270 TTI::TargetCostKind CostKind) const {
1271 InstructionCost Cost =
1272 TTIImpl->getAddressComputationCost(PtrTy, SE, Ptr, CostKind);
1273 assert(Cost >= 0 && "TTI should not produce negative costs!");
1274 return Cost;
1275}
1276
1277InstructionCost TargetTransformInfo::getMemcpyCost(const Instruction *I) const {
1278 InstructionCost Cost = TTIImpl->getMemcpyCost(I);
1279 assert(Cost >= 0 && "TTI should not produce negative costs!");
1280 return Cost;
1281}
1282
1283uint64_t TargetTransformInfo::getMaxMemIntrinsicInlineSizeThreshold() const {
1284 return TTIImpl->getMaxMemIntrinsicInlineSizeThreshold();
1285}
1286
1287InstructionCost TargetTransformInfo::getArithmeticReductionCost(
1288 unsigned Opcode, VectorType *Ty, std::optional<FastMathFlags> FMF,
1289 TTI::TargetCostKind CostKind) const {
1290 InstructionCost Cost =
1291 TTIImpl->getArithmeticReductionCost(Opcode, Ty, FMF, CostKind);
1292 assert(Cost >= 0 && "TTI should not produce negative costs!");
1293 return Cost;
1294}
1295
1296InstructionCost TargetTransformInfo::getMinMaxReductionCost(
1297 Intrinsic::ID IID, VectorType *Ty, FastMathFlags FMF,
1298 TTI::TargetCostKind CostKind) const {
1299 InstructionCost Cost =
1300 TTIImpl->getMinMaxReductionCost(IID, Ty, FMF, CostKind);
1301 assert(Cost >= 0 && "TTI should not produce negative costs!");
1302 return Cost;
1303}
1304
1305InstructionCost TargetTransformInfo::getExtendedReductionCost(
1306 unsigned Opcode, bool IsUnsigned, Type *ResTy, VectorType *Ty,
1307 std::optional<FastMathFlags> FMF, TTI::TargetCostKind CostKind) const {
1308 return TTIImpl->getExtendedReductionCost(Opcode, IsUnsigned, ResTy, Ty, FMF,
1309 CostKind);
1310}
1311
1312InstructionCost TargetTransformInfo::getMulAccReductionCost(
1313 bool IsUnsigned, unsigned RedOpcode, Type *ResTy, VectorType *Ty,
1314 TTI::TargetCostKind CostKind) const {
1315 return TTIImpl->getMulAccReductionCost(IsUnsigned, RedOpcode, ResTy, Ty,
1316 CostKind);
1317}
1318
1319InstructionCost
1320TargetTransformInfo::getCostOfKeepingLiveOverCall(ArrayRef<Type *> Tys) const {
1321 return TTIImpl->getCostOfKeepingLiveOverCall(Tys);
1322}
1323
1324bool TargetTransformInfo::getTgtMemIntrinsic(IntrinsicInst *Inst,
1325 MemIntrinsicInfo &Info) const {
1326 return TTIImpl->getTgtMemIntrinsic(Inst, Info);
1327}
1328
1329unsigned TargetTransformInfo::getAtomicMemIntrinsicMaxElementSize() const {
1330 return TTIImpl->getAtomicMemIntrinsicMaxElementSize();
1331}
1332
1333Value *TargetTransformInfo::getOrCreateResultFromMemIntrinsic(
1334 IntrinsicInst *Inst, Type *ExpectedType, bool CanCreate) const {
1335 return TTIImpl->getOrCreateResultFromMemIntrinsic(Inst, ExpectedType,
1336 CanCreate);
1337}
1338
1339Type *TargetTransformInfo::getMemcpyLoopLoweringType(
1340 LLVMContext &Context, Value *Length, unsigned SrcAddrSpace,
1341 unsigned DestAddrSpace, Align SrcAlign, Align DestAlign,
1342 std::optional<uint32_t> AtomicElementSize) const {
1343 return TTIImpl->getMemcpyLoopLoweringType(Context, Length, SrcAddrSpace,
1344 DestAddrSpace, SrcAlign, DestAlign,
1345 AtomicElementSize);
1346}
1347
1348void TargetTransformInfo::getMemcpyLoopResidualLoweringType(
1349 SmallVectorImpl<Type *> &OpsOut, LLVMContext &Context,
1350 unsigned RemainingBytes, unsigned SrcAddrSpace, unsigned DestAddrSpace,
1351 Align SrcAlign, Align DestAlign,
1352 std::optional<uint32_t> AtomicCpySize) const {
1353 TTIImpl->getMemcpyLoopResidualLoweringType(
1354 OpsOut, Context, RemainingBytes, SrcAddrSpace, DestAddrSpace, SrcAlign,
1355 DestAlign, AtomicCpySize);
1356}
1357
1358bool TargetTransformInfo::areInlineCompatible(const Function *Caller,
1359 const Function *Callee) const {
1360 return TTIImpl->areInlineCompatible(Caller, Callee);
1361}
1362
1363unsigned
1364TargetTransformInfo::getInlineCallPenalty(const Function *F,
1365 const CallBase &Call,
1366 unsigned DefaultCallPenalty) const {
1367 return TTIImpl->getInlineCallPenalty(F, Call, DefaultCallPenalty);
1368}
1369
1370bool TargetTransformInfo::shouldCopyAttributeWhenOutliningFrom(
1371 const Function *Caller, const Attribute &Attr) const {
1372 return TTIImpl->shouldCopyAttributeWhenOutliningFrom(Caller, Attr);
1373}
1374bool TargetTransformInfo::areTypesABICompatible(const Function *Caller,
1375 const Function *Callee,
1376 ArrayRef<Type *> Types) const {
1377 return TTIImpl->areTypesABICompatible(Caller, Callee, Types);
1378}
1379
1380bool TargetTransformInfo::isIndexedLoadLegal(MemIndexedMode Mode,
1381 Type *Ty) const {
1382 return TTIImpl->isIndexedLoadLegal(Mode, Ty);
1383}
1384
1385bool TargetTransformInfo::isIndexedStoreLegal(MemIndexedMode Mode,
1386 Type *Ty) const {
1387 return TTIImpl->isIndexedStoreLegal(Mode, Ty);
1388}
1389
1390unsigned TargetTransformInfo::getLoadStoreVecRegBitWidth(unsigned AS) const {
1391 return TTIImpl->getLoadStoreVecRegBitWidth(AddrSpace: AS);
1392}
1393
1394bool TargetTransformInfo::isLegalToVectorizeLoad(LoadInst *LI) const {
1395 return TTIImpl->isLegalToVectorizeLoad(LI);
1396}
1397
1398bool TargetTransformInfo::isLegalToVectorizeStore(StoreInst *SI) const {
1399 return TTIImpl->isLegalToVectorizeStore(SI);
1400}
1401
1402bool TargetTransformInfo::isLegalToVectorizeLoadChain(
1403 unsigned ChainSizeInBytes, Align Alignment, unsigned AddrSpace) const {
1404 return TTIImpl->isLegalToVectorizeLoadChain(ChainSizeInBytes, Alignment,
1405 AddrSpace);
1406}
1407
1408bool TargetTransformInfo::isLegalToVectorizeStoreChain(
1409 unsigned ChainSizeInBytes, Align Alignment, unsigned AddrSpace) const {
1410 return TTIImpl->isLegalToVectorizeStoreChain(ChainSizeInBytes, Alignment,
1411 AddrSpace);
1412}
1413
1414bool TargetTransformInfo::isLegalToVectorizeReduction(
1415 const RecurrenceDescriptor &RdxDesc, ElementCount VF) const {
1416 return TTIImpl->isLegalToVectorizeReduction(RdxDesc, VF);
1417}
1418
1419bool TargetTransformInfo::isElementTypeLegalForScalableVector(Type *Ty) const {
1420 return TTIImpl->isElementTypeLegalForScalableVector(Ty);
1421}
1422
1423unsigned TargetTransformInfo::getLoadVectorFactor(unsigned VF,
1424 unsigned LoadSize,
1425 unsigned ChainSizeInBytes,
1426 VectorType *VecTy) const {
1427 return TTIImpl->getLoadVectorFactor(VF, LoadSize, ChainSizeInBytes, VecTy);
1428}
1429
1430unsigned TargetTransformInfo::getStoreVectorFactor(unsigned VF,
1431 unsigned StoreSize,
1432 unsigned ChainSizeInBytes,
1433 VectorType *VecTy) const {
1434 return TTIImpl->getStoreVectorFactor(VF, StoreSize, ChainSizeInBytes, VecTy);
1435}
1436
1437bool TargetTransformInfo::preferFixedOverScalableIfEqualCost(
1438 bool IsEpilogue) const {
1439 return TTIImpl->preferFixedOverScalableIfEqualCost(IsEpilogue);
1440}
1441
1442bool TargetTransformInfo::preferInLoopReduction(RecurKind Kind,
1443 Type *Ty) const {
1444 return TTIImpl->preferInLoopReduction(Kind, Ty);
1445}
1446
1447bool TargetTransformInfo::preferAlternateOpcodeVectorization() const {
1448 return TTIImpl->preferAlternateOpcodeVectorization();
1449}
1450
1451bool TargetTransformInfo::preferPredicatedReductionSelect() const {
1452 return TTIImpl->preferPredicatedReductionSelect();
1453}
1454
1455bool TargetTransformInfo::preferEpilogueVectorization(
1456 ElementCount Iters) const {
1457 return TTIImpl->preferEpilogueVectorization(Iters);
1458}
1459
1460bool TargetTransformInfo::shouldConsiderVectorizationRegPressure() const {
1461 return TTIImpl->shouldConsiderVectorizationRegPressure();
1462}
1463
1464TargetTransformInfo::VPLegalization
1465TargetTransformInfo::getVPLegalizationStrategy(const VPIntrinsic &VPI) const {
1466 return TTIImpl->getVPLegalizationStrategy(PI: VPI);
1467}
1468
1469bool TargetTransformInfo::hasArmWideBranch(bool Thumb) const {
1470 return TTIImpl->hasArmWideBranch(Thumb);
1471}
1472
1473APInt TargetTransformInfo::getFeatureMask(const Function &F) const {
1474 return TTIImpl->getFeatureMask(F);
1475}
1476
1477APInt TargetTransformInfo::getPriorityMask(const Function &F) const {
1478 return TTIImpl->getPriorityMask(F);
1479}
1480
1481bool TargetTransformInfo::isMultiversionedFunction(const Function &F) const {
1482 return TTIImpl->isMultiversionedFunction(F);
1483}
1484
1485unsigned TargetTransformInfo::getMaxNumArgs() const {
1486 return TTIImpl->getMaxNumArgs();
1487}
1488
1489bool TargetTransformInfo::shouldExpandReduction(const IntrinsicInst *II) const {
1490 return TTIImpl->shouldExpandReduction(II);
1491}
1492
1493TargetTransformInfo::ReductionShuffle
1494TargetTransformInfo::getPreferredExpandedReductionShuffle(
1495 const IntrinsicInst *II) const {
1496 return TTIImpl->getPreferredExpandedReductionShuffle(II);
1497}
1498
1499unsigned TargetTransformInfo::getGISelRematGlobalCost() const {
1500 return TTIImpl->getGISelRematGlobalCost();
1501}
1502
1503unsigned TargetTransformInfo::getMinTripCountTailFoldingThreshold() const {
1504 return TTIImpl->getMinTripCountTailFoldingThreshold();
1505}
1506
1507bool TargetTransformInfo::supportsScalableVectors() const {
1508 return TTIImpl->supportsScalableVectors();
1509}
1510
1511bool TargetTransformInfo::enableScalableVectorization() const {
1512 return TTIImpl->enableScalableVectorization();
1513}
1514
1515bool TargetTransformInfo::hasActiveVectorLength() const {
1516 return TTIImpl->hasActiveVectorLength();
1517}
1518
1519bool TargetTransformInfo::isProfitableToSinkOperands(
1520 Instruction *I, SmallVectorImpl<Use *> &OpsToSink) const {
1521 return TTIImpl->isProfitableToSinkOperands(I, Ops&: OpsToSink);
1522}
1523
1524bool TargetTransformInfo::isVectorShiftByScalarCheap(Type *Ty) const {
1525 return TTIImpl->isVectorShiftByScalarCheap(Ty);
1526}
1527
1528unsigned
1529TargetTransformInfo::getNumBytesToPadGlobalArray(unsigned Size,
1530 Type *ArrayType) const {
1531 return TTIImpl->getNumBytesToPadGlobalArray(Size, ArrayType);
1532}
1533
1534void TargetTransformInfo::collectKernelLaunchBounds(
1535 const Function &F,
1536 SmallVectorImpl<std::pair<StringRef, int64_t>> &LB) const {
1537 return TTIImpl->collectKernelLaunchBounds(F, LB);
1538}
1539
1540bool TargetTransformInfo::allowVectorElementIndexingUsingGEP() const {
1541 return TTIImpl->allowVectorElementIndexingUsingGEP();
1542}
1543
1544TargetTransformInfoImplBase::~TargetTransformInfoImplBase() = default;
1545
1546TargetIRAnalysis::TargetIRAnalysis() : TTICallback(&getDefaultTTI) {}
1547
1548TargetIRAnalysis::TargetIRAnalysis(
1549 std::function<Result(const Function &)> TTICallback)
1550 : TTICallback(std::move(TTICallback)) {}
1551
1552TargetIRAnalysis::Result TargetIRAnalysis::run(const Function &F,
1553 FunctionAnalysisManager &) {
1554 assert(!F.isIntrinsic() && "Should not request TTI for intrinsics");
1555 return TTICallback(F);
1556}
1557
1558AnalysisKey TargetIRAnalysis::Key;
1559
1560TargetIRAnalysis::Result TargetIRAnalysis::getDefaultTTI(const Function &F) {
1561 return Result(F.getDataLayout());
1562}
1563
1564// Register the basic pass.
1565INITIALIZE_PASS(TargetTransformInfoWrapperPass, "tti",
1566 "Target Transform Information", false, true)
1567char TargetTransformInfoWrapperPass::ID = 0;
1568
1569void TargetTransformInfoWrapperPass::anchor() {}
1570
1571TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass()
1572 : ImmutablePass(ID) {}
1573
1574TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass(
1575 TargetIRAnalysis TIRA)
1576 : ImmutablePass(ID), TIRA(std::move(TIRA)) {}
1577
1578TargetTransformInfo &TargetTransformInfoWrapperPass::getTTI(const Function &F) {
1579 FunctionAnalysisManager DummyFAM;
1580 TTI = TIRA.run(F, DummyFAM);
1581 return *TTI;
1582}
1583
1584ImmutablePass *
1585llvm::createTargetTransformInfoWrapperPass(TargetIRAnalysis TIRA) {
1586 return new TargetTransformInfoWrapperPass(std::move(TIRA));
1587}
1588