1 //===- llvm/Analysis/TargetTransformInfo.h ----------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass exposes codegen information to IR-level passes. Every
11 // transformation that uses codegen information is broken into three parts:
12 // 1. The IR-level analysis pass.
13 // 2. The IR-level transformation interface which provides the needed
15 // 3. Codegen-level implementation which uses target-specific hooks.
17 // This file defines #2, which is the interface that IR-level transformations
18 // use for querying the codegen.
20 //===----------------------------------------------------------------------===//
22 #ifndef LLVM_ANALYSIS_TARGETTRANSFORMINFO_H
23 #define LLVM_ANALYSIS_TARGETTRANSFORMINFO_H
25 #include "llvm/IR/Intrinsics.h"
26 #include "llvm/Pass.h"
27 #include "llvm/Support/DataTypes.h"
37 /// TargetTransformInfo - This pass provides access to the codegen
38 /// interfaces that are needed for IR-level transformations.
39 class TargetTransformInfo {
41 /// \brief The TTI instance one level down the stack.
43 /// This is used to implement the default behavior all of the methods which
44 /// is to delegate up through the stack of TTIs until one can answer the
46 TargetTransformInfo *PrevTTI;
48 /// \brief The top of the stack of TTI analyses available.
50 /// This is a convenience routine maintained as TTI analyses become available
51 /// that complements the PrevTTI delegation chain. When one part of an
52 /// analysis pass wants to query another part of the analysis pass it can use
53 /// this to start back at the top of the stack.
54 TargetTransformInfo *TopTTI;
56 /// All pass subclasses must in their initializePass routine call
57 /// pushTTIStack with themselves to update the pointers tracking the previous
58 /// TTI instance in the analysis group's stack, and the top of the analysis
60 void pushTTIStack(Pass *P);
62 /// All pass subclasses must in their finalizePass routine call popTTIStack
63 /// to update the pointers tracking the previous TTI instance in the analysis
64 /// group's stack, and the top of the analysis group's stack.
67 /// All pass subclasses must call TargetTransformInfo::getAnalysisUsage.
68 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
71 /// This class is intended to be subclassed by real implementations.
72 virtual ~TargetTransformInfo() = 0;
74 /// \name Generic Target Information
77 /// \brief Underlying constants for 'cost' values in this interface.
79 /// Many APIs in this interface return a cost. This enum defines the
80 /// fundamental values that should be used to interpret (and produce) those
81 /// costs. The costs are returned as an unsigned rather than a member of this
82 /// enumeration because it is expected that the cost of one IR instruction
83 /// may have a multiplicative factor to it or otherwise won't fit directly
84 /// into the enum. Moreover, it is common to sum or average costs which works
85 /// better as simple integral values. Thus this enum only provides constants.
87 /// Note that these costs should usually reflect the intersection of code-size
88 /// cost and execution cost. A free instruction is typically one that folds
89 /// into another instruction. For example, reg-to-reg moves can often be
90 /// skipped by renaming the registers in the CPU, but they still are encoded
91 /// and thus wouldn't be considered 'free' here.
92 enum TargetCostConstants {
93 TCC_Free = 0, ///< Expected to fold away in lowering.
94 TCC_Basic = 1, ///< The cost of a typical 'add' instruction.
96 TCC_Expensive = 4 ///< The cost of a 'div' instruction on x86.
99 /// \brief Estimate the cost of a specific operation when lowered.
101 /// Note that this is designed to work on an arbitrary synthetic opcode, and
102 /// thus work for hypothetical queries before an instruction has even been
103 /// formed. However, this does *not* work for GEPs, and must not be called
104 /// for a GEP instruction. Instead, use the dedicated getGEPCost interface as
105 /// analyzing a GEP's cost required more information.
107 /// Typically only the result type is required, and the operand type can be
108 /// omitted. However, if the opcode is one of the cast instructions, the
109 /// operand type is required.
111 /// The returned cost is defined in terms of \c TargetCostConstants, see its
112 /// comments for a detailed explanation of the cost values.
113 virtual unsigned getOperationCost(unsigned Opcode, Type *Ty,
114 Type *OpTy = 0) const;
116 /// \brief Estimate the cost of a GEP operation when lowered.
118 /// The contract for this function is the same as \c getOperationCost except
119 /// that it supports an interface that provides extra information specific to
120 /// the GEP operation.
121 virtual unsigned getGEPCost(const Value *Ptr,
122 ArrayRef<const Value *> Operands) const;
124 /// \brief Estimate the cost of a function call when lowered.
126 /// The contract for this is the same as \c getOperationCost except that it
127 /// supports an interface that provides extra information specific to call
130 /// This is the most basic query for estimating call cost: it only knows the
131 /// function type and (potentially) the number of arguments at the call site.
132 /// The latter is only interesting for varargs function types.
133 virtual unsigned getCallCost(FunctionType *FTy, int NumArgs = -1) const;
135 /// \brief Estimate the cost of calling a specific function when lowered.
137 /// This overload adds the ability to reason about the particular function
138 /// being called in the event it is a library call with special lowering.
139 virtual unsigned getCallCost(const Function *F, int NumArgs = -1) const;
141 /// \brief Estimate the cost of calling a specific function when lowered.
143 /// This overload allows specifying a set of candidate argument values.
144 virtual unsigned getCallCost(const Function *F,
145 ArrayRef<const Value *> Arguments) const;
147 /// \brief Estimate the cost of an intrinsic when lowered.
149 /// Mirrors the \c getCallCost method but uses an intrinsic identifier.
150 virtual unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
151 ArrayRef<Type *> ParamTys) const;
153 /// \brief Estimate the cost of an intrinsic when lowered.
155 /// Mirrors the \c getCallCost method but uses an intrinsic identifier.
156 virtual unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
157 ArrayRef<const Value *> Arguments) const;
159 /// \brief Estimate the cost of a given IR user when lowered.
161 /// This can estimate the cost of either a ConstantExpr or Instruction when
162 /// lowered. It has two primary advantages over the \c getOperationCost and
163 /// \c getGEPCost above, and one significant disadvantage: it can only be
164 /// used when the IR construct has already been formed.
166 /// The advantages are that it can inspect the SSA use graph to reason more
167 /// accurately about the cost. For example, all-constant-GEPs can often be
168 /// folded into a load or other instruction, but if they are used in some
169 /// other context they may not be folded. This routine can distinguish such
172 /// The returned cost is defined in terms of \c TargetCostConstants, see its
173 /// comments for a detailed explanation of the cost values.
174 virtual unsigned getUserCost(const User *U) const;
176 /// \brief hasBranchDivergence - Return true if branch divergence exists.
177 /// Branch divergence has a significantly negative impact on GPU performance
178 /// when threads in the same wavefront take different paths due to conditional
180 virtual bool hasBranchDivergence() const;
182 /// \brief Test whether calls to a function lower to actual program function
185 /// The idea is to test whether the program is likely to require a 'call'
186 /// instruction or equivalent in order to call the given function.
188 /// FIXME: It's not clear that this is a good or useful query API. Client's
189 /// should probably move to simpler cost metrics using the above.
190 /// Alternatively, we could split the cost interface into distinct code-size
191 /// and execution-speed costs. This would allow modelling the core of this
192 /// query more accurately as the a call is a single small instruction, but
193 /// incurs significant execution cost.
194 virtual bool isLoweredToCall(const Function *F) const;
196 /// Parameters that control the generic loop unrolling transformation.
197 struct UnrollingPreferences {
198 /// The cost threshold for the unrolled loop, compared to
199 /// CodeMetrics.NumInsts aggregated over all basic blocks in the loop body.
200 /// The unrolling factor is set such that the unrolled loop body does not
201 /// exceed this cost. Set this to UINT_MAX to disable the loop body cost
204 /// The cost threshold for the unrolled loop when optimizing for size (set
205 /// to UINT_MAX to disable).
206 unsigned OptSizeThreshold;
207 /// A forced unrolling factor (the number of concatenated bodies of the
208 /// original loop in the unrolled loop body). When set to 0, the unrolling
209 /// transformation will select an unrolling factor based on the current cost
210 /// threshold and other factors.
212 /// Allow partial unrolling (unrolling of loops to expand the size of the
213 /// loop body, not only to eliminate small constant-trip-count loops).
215 /// Allow runtime unrolling (unrolling of loops to expand the size of the
216 /// loop body even when the number of loop iterations is not known at compile
221 /// \brief Get target-customized preferences for the generic loop unrolling
222 /// transformation. The caller will initialize UP with the current
223 /// target-independent defaults.
224 virtual void getUnrollingPreferences(Loop *L, UnrollingPreferences &UP) const;
228 /// \name Scalar Target Information
231 /// \brief Flags indicating the kind of support for population count.
233 /// Compared to the SW implementation, HW support is supposed to
234 /// significantly boost the performance when the population is dense, and it
235 /// may or may not degrade performance if the population is sparse. A HW
236 /// support is considered as "Fast" if it can outperform, or is on a par
237 /// with, SW implementation when the population is sparse; otherwise, it is
238 /// considered as "Slow".
239 enum PopcntSupportKind {
245 /// \brief Return true if the specified immediate is legal add immediate, that
246 /// is the target has add instructions which can add a register with the
247 /// immediate without having to materialize the immediate into a register.
248 virtual bool isLegalAddImmediate(int64_t Imm) const;
250 /// \brief Return true if the specified immediate is legal icmp immediate,
251 /// that is the target has icmp instructions which can compare a register
252 /// against the immediate without having to materialize the immediate into a
254 virtual bool isLegalICmpImmediate(int64_t Imm) const;
256 /// \brief Return true if the addressing mode represented by AM is legal for
257 /// this target, for a load/store of the specified type.
258 /// The type may be VoidTy, in which case only return true if the addressing
259 /// mode is legal for a load/store of any legal type.
260 /// TODO: Handle pre/postinc as well.
261 virtual bool isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
262 int64_t BaseOffset, bool HasBaseReg,
263 int64_t Scale) const;
265 /// \brief Return the cost of the scaling factor used in the addressing
266 /// mode represented by AM for this target, for a load/store
267 /// of the specified type.
268 /// If the AM is supported, the return value must be >= 0.
269 /// If the AM is not supported, it returns a negative value.
270 /// TODO: Handle pre/postinc as well.
271 virtual int getScalingFactorCost(Type *Ty, GlobalValue *BaseGV,
272 int64_t BaseOffset, bool HasBaseReg,
273 int64_t Scale) const;
275 /// \brief Return true if it's free to truncate a value of type Ty1 to type
276 /// Ty2. e.g. On x86 it's free to truncate a i32 value in register EAX to i16
277 /// by referencing its sub-register AX.
278 virtual bool isTruncateFree(Type *Ty1, Type *Ty2) const;
280 /// \brief Return true if this type is legal.
281 virtual bool isTypeLegal(Type *Ty) const;
283 /// \brief Returns the target's jmp_buf alignment in bytes.
284 virtual unsigned getJumpBufAlignment() const;
286 /// \brief Returns the target's jmp_buf size in bytes.
287 virtual unsigned getJumpBufSize() const;
289 /// \brief Return true if switches should be turned into lookup tables for the
291 virtual bool shouldBuildLookupTables() const;
293 /// \brief Return hardware support for population count.
294 virtual PopcntSupportKind getPopcntSupport(unsigned IntTyWidthInBit) const;
296 /// \brief Return true if the hardware has a fast square-root instruction.
297 virtual bool haveFastSqrt(Type *Ty) const;
299 /// \brief Return the expected cost of materializing for the given integer
300 /// immediate of the specified type.
301 virtual unsigned getIntImmCost(const APInt &Imm, Type *Ty) const;
303 /// \brief Return the expected cost of materialization for the given integer
304 /// immediate of the specified type for a given instruction. The cost can be
305 /// zero if the immediate can be folded into the specified instruction.
306 virtual unsigned getIntImmCost(unsigned Opcode, const APInt &Imm,
308 virtual unsigned getIntImmCost(Intrinsic::ID IID, const APInt &Imm,
312 /// \name Vector Target Information
315 /// \brief The various kinds of shuffle patterns for vector queries.
317 SK_Broadcast, ///< Broadcast element 0 to all other elements.
318 SK_Reverse, ///< Reverse the order of the vector.
319 SK_InsertSubvector, ///< InsertSubvector. Index indicates start offset.
320 SK_ExtractSubvector ///< ExtractSubvector Index indicates start offset.
323 /// \brief Additional information about an operand's possible values.
324 enum OperandValueKind {
325 OK_AnyValue, // Operand can have any value.
326 OK_UniformValue, // Operand is uniform (splat of a value).
327 OK_UniformConstantValue // Operand is uniform constant.
330 /// \return The number of scalar or vector registers that the target has.
331 /// If 'Vectors' is true, it returns the number of vector registers. If it is
332 /// set to false, it returns the number of scalar registers.
333 virtual unsigned getNumberOfRegisters(bool Vector) const;
335 /// \return The width of the largest scalar or vector register type.
336 virtual unsigned getRegisterBitWidth(bool Vector) const;
338 /// \return The maximum unroll factor that the vectorizer should try to
339 /// perform for this target. This number depends on the level of parallelism
340 /// and the number of execution units in the CPU.
341 virtual unsigned getMaximumUnrollFactor() const;
343 /// \return The expected cost of arithmetic ops, such as mul, xor, fsub, etc.
344 virtual unsigned getArithmeticInstrCost(unsigned Opcode, Type *Ty,
345 OperandValueKind Opd1Info = OK_AnyValue,
346 OperandValueKind Opd2Info = OK_AnyValue) const;
348 /// \return The cost of a shuffle instruction of kind Kind and of type Tp.
349 /// The index and subtype parameters are used by the subvector insertion and
350 /// extraction shuffle kinds.
351 virtual unsigned getShuffleCost(ShuffleKind Kind, Type *Tp, int Index = 0,
352 Type *SubTp = 0) const;
354 /// \return The expected cost of cast instructions, such as bitcast, trunc,
356 virtual unsigned getCastInstrCost(unsigned Opcode, Type *Dst,
359 /// \return The expected cost of control-flow related instructions such as
361 virtual unsigned getCFInstrCost(unsigned Opcode) const;
363 /// \returns The expected cost of compare and select instructions.
364 virtual unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
365 Type *CondTy = 0) const;
367 /// \return The expected cost of vector Insert and Extract.
368 /// Use -1 to indicate that there is no information on the index value.
369 virtual unsigned getVectorInstrCost(unsigned Opcode, Type *Val,
370 unsigned Index = -1) const;
372 /// \return The cost of Load and Store instructions.
373 virtual unsigned getMemoryOpCost(unsigned Opcode, Type *Src,
375 unsigned AddressSpace) const;
377 /// \brief Calculate the cost of performing a vector reduction.
379 /// This is the cost of reducing the vector value of type \p Ty to a scalar
380 /// value using the operation denoted by \p Opcode. The form of the reduction
381 /// can either be a pairwise reduction or a reduction that splits the vector
382 /// at every reduction level.
386 /// ((v0+v1), (v2, v3), undef, undef)
389 /// ((v0+v2), (v1+v3), undef, undef)
390 virtual unsigned getReductionCost(unsigned Opcode, Type *Ty,
391 bool IsPairwiseForm) const;
393 /// \returns The cost of Intrinsic instructions.
394 virtual unsigned getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy,
395 ArrayRef<Type *> Tys) const;
397 /// \returns The number of pieces into which the provided type must be
398 /// split during legalization. Zero is returned when the answer is unknown.
399 virtual unsigned getNumberOfParts(Type *Tp) const;
401 /// \returns The cost of the address computation. For most targets this can be
402 /// merged into the instruction indexing mode. Some targets might want to
403 /// distinguish between address computation for memory operations on vector
404 /// types and scalar types. Such targets should override this function.
405 /// The 'IsComplex' parameter is a hint that the address computation is likely
406 /// to involve multiple instructions and as such unlikely to be merged into
407 /// the address indexing mode.
408 virtual unsigned getAddressComputationCost(Type *Ty,
409 bool IsComplex = false) const;
413 /// Analysis group identification.
417 /// \brief Create the base case instance of a pass in the TTI analysis group.
419 /// This class provides the base case for the stack of TTI analyzes. It doesn't
420 /// delegate to anything and uses the STTI and VTTI objects passed in to
421 /// satisfy the queries.
422 ImmutablePass *createNoTargetTransformInfoPass();
424 } // End llvm namespace