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 #define DEBUG_TYPE "tti"
11 #include "llvm/Analysis/TargetTransformInfo.h"
12 #include "llvm/IR/DataLayout.h"
13 #include "llvm/IR/Instruction.h"
14 #include "llvm/IR/Instructions.h"
15 #include "llvm/IR/IntrinsicInst.h"
16 #include "llvm/IR/Operator.h"
17 #include "llvm/Support/CallSite.h"
18 #include "llvm/Support/ErrorHandling.h"
19 
20 using namespace llvm;
21 
22 // Setup the analysis group to manage the TargetTransformInfo passes.
23 INITIALIZE_ANALYSIS_GROUP(TargetTransformInfo, "Target Information", NoTTI)
24 char TargetTransformInfo::ID = 0;
25 
26 TargetTransformInfo::~TargetTransformInfo() {
27 }
28 
29 void TargetTransformInfo::pushTTIStack(Pass *P) {
30   TopTTI = this;
31   PrevTTI = &P->getAnalysis<TargetTransformInfo>();
32 
33   // Walk up the chain and update the top TTI pointer.
34   for (TargetTransformInfo *PTTI = PrevTTI; PTTI; PTTI = PTTI->PrevTTI)
35     PTTI->TopTTI = this;
36 }
37 
38 void TargetTransformInfo::popTTIStack() {
39   TopTTI = 0;
40 
41   // Walk up the chain and update the top TTI pointer.
42   for (TargetTransformInfo *PTTI = PrevTTI; PTTI; PTTI = PTTI->PrevTTI)
43     PTTI->TopTTI = PrevTTI;
44 
45   PrevTTI = 0;
46 }
47 
48 void TargetTransformInfo::getAnalysisUsage(AnalysisUsage &AU) const {
49   AU.addRequired<TargetTransformInfo>();
50 }
51 
52 unsigned TargetTransformInfo::getOperationCost(unsigned Opcode, Type *Ty,
53                                                Type *OpTy) const {
54   return PrevTTI->getOperationCost(Opcode, Ty, OpTy);
55 }
56 
57 unsigned TargetTransformInfo::getGEPCost(
58     const Value *Ptr, ArrayRef<const Value *> Operands) const {
59   return PrevTTI->getGEPCost(Ptr, Operands);
60 }
61 
62 unsigned TargetTransformInfo::getCallCost(FunctionType *FTy,
63                                           int NumArgs) const {
64   return PrevTTI->getCallCost(FTy, NumArgs);
65 }
66 
67 unsigned TargetTransformInfo::getCallCost(const Function *F,
68                                           int NumArgs) const {
69   return PrevTTI->getCallCost(F, NumArgs);
70 }
71 
72 unsigned TargetTransformInfo::getCallCost(
73     const Function *F, ArrayRef<const Value *> Arguments) const {
74   return PrevTTI->getCallCost(F, Arguments);
75 }
76 
77 unsigned TargetTransformInfo::getIntrinsicCost(
78     Intrinsic::ID IID, Type *RetTy, ArrayRef<Type *> ParamTys) const {
79   return PrevTTI->getIntrinsicCost(IID, RetTy, ParamTys);
80 }
81 
82 unsigned TargetTransformInfo::getIntrinsicCost(
83     Intrinsic::ID IID, Type *RetTy, ArrayRef<const Value *> Arguments) const {
84   return PrevTTI->getIntrinsicCost(IID, RetTy, Arguments);
85 }
86 
87 unsigned TargetTransformInfo::getUserCost(const User *U) const {
88   return PrevTTI->getUserCost(U);
89 }
90 
91 bool TargetTransformInfo::hasBranchDivergence() const {
92   return PrevTTI->hasBranchDivergence();
93 }
94 
95 bool TargetTransformInfo::isLoweredToCall(const Function *F) const {
96   return PrevTTI->isLoweredToCall(F);
97 }
98 
99 void TargetTransformInfo::getUnrollingPreferences(Loop *L,
100                             UnrollingPreferences &UP) const {
101   PrevTTI->getUnrollingPreferences(L, UP);
102 }
103 
104 bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const {
105   return PrevTTI->isLegalAddImmediate(Imm);
106 }
107 
108 bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const {
109   return PrevTTI->isLegalICmpImmediate(Imm);
110 }
111 
112 bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
113                                                 int64_t BaseOffset,
114                                                 bool HasBaseReg,
115                                                 int64_t Scale) const {
116   return PrevTTI->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg,
117                                         Scale);
118 }
119 
120 int TargetTransformInfo::getScalingFactorCost(Type *Ty, GlobalValue *BaseGV,
121                                               int64_t BaseOffset,
122                                               bool HasBaseReg,
123                                               int64_t Scale) const {
124   return PrevTTI->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg,
125                                        Scale);
126 }
127 
128 bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const {
129   return PrevTTI->isTruncateFree(Ty1, Ty2);
130 }
131 
132 bool TargetTransformInfo::isTypeLegal(Type *Ty) const {
133   return PrevTTI->isTypeLegal(Ty);
134 }
135 
136 unsigned TargetTransformInfo::getJumpBufAlignment() const {
137   return PrevTTI->getJumpBufAlignment();
138 }
139 
140 unsigned TargetTransformInfo::getJumpBufSize() const {
141   return PrevTTI->getJumpBufSize();
142 }
143 
144 bool TargetTransformInfo::shouldBuildLookupTables() const {
145   return PrevTTI->shouldBuildLookupTables();
146 }
147 
148 TargetTransformInfo::PopcntSupportKind
149 TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const {
150   return PrevTTI->getPopcntSupport(IntTyWidthInBit);
151 }
152 
153 bool TargetTransformInfo::haveFastSqrt(Type *Ty) const {
154   return PrevTTI->haveFastSqrt(Ty);
155 }
156 
157 unsigned TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty) const {
158   return PrevTTI->getIntImmCost(Imm, Ty);
159 }
160 
161 unsigned TargetTransformInfo::getIntImmCost(unsigned Opcode, const APInt &Imm,
162                                             Type *Ty) const {
163   return PrevTTI->getIntImmCost(Opcode, Imm, Ty);
164 }
165 
166 unsigned TargetTransformInfo::getIntImmCost(Intrinsic::ID IID, const APInt &Imm,
167                                             Type *Ty) const {
168   return PrevTTI->getIntImmCost(IID, Imm, Ty);
169 }
170 
171 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const {
172   return PrevTTI->getNumberOfRegisters(Vector);
173 }
174 
175 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const {
176   return PrevTTI->getRegisterBitWidth(Vector);
177 }
178 
179 unsigned TargetTransformInfo::getMaximumUnrollFactor() const {
180   return PrevTTI->getMaximumUnrollFactor();
181 }
182 
183 unsigned TargetTransformInfo::getArithmeticInstrCost(unsigned Opcode,
184                                                 Type *Ty,
185                                                 OperandValueKind Op1Info,
186                                                 OperandValueKind Op2Info) const {
187   return PrevTTI->getArithmeticInstrCost(Opcode, Ty, Op1Info, Op2Info);
188 }
189 
190 unsigned TargetTransformInfo::getShuffleCost(ShuffleKind Kind, Type *Tp,
191                                              int Index, Type *SubTp) const {
192   return PrevTTI->getShuffleCost(Kind, Tp, Index, SubTp);
193 }
194 
195 unsigned TargetTransformInfo::getCastInstrCost(unsigned Opcode, Type *Dst,
196                                                Type *Src) const {
197   return PrevTTI->getCastInstrCost(Opcode, Dst, Src);
198 }
199 
200 unsigned TargetTransformInfo::getCFInstrCost(unsigned Opcode) const {
201   return PrevTTI->getCFInstrCost(Opcode);
202 }
203 
204 unsigned TargetTransformInfo::getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
205                                                  Type *CondTy) const {
206   return PrevTTI->getCmpSelInstrCost(Opcode, ValTy, CondTy);
207 }
208 
209 unsigned TargetTransformInfo::getVectorInstrCost(unsigned Opcode, Type *Val,
210                                                  unsigned Index) const {
211   return PrevTTI->getVectorInstrCost(Opcode, Val, Index);
212 }
213 
214 unsigned TargetTransformInfo::getMemoryOpCost(unsigned Opcode, Type *Src,
215                                               unsigned Alignment,
216                                               unsigned AddressSpace) const {
217   return PrevTTI->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
218   ;
219 }
220 
221 unsigned
222 TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID,
223                                            Type *RetTy,
224                                            ArrayRef<Type *> Tys) const {
225   return PrevTTI->getIntrinsicInstrCost(ID, RetTy, Tys);
226 }
227 
228 unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const {
229   return PrevTTI->getNumberOfParts(Tp);
230 }
231 
232 unsigned TargetTransformInfo::getAddressComputationCost(Type *Tp,
233                                                         bool IsComplex) const {
234   return PrevTTI->getAddressComputationCost(Tp, IsComplex);
235 }
236 
237 unsigned TargetTransformInfo::getReductionCost(unsigned Opcode, Type *Ty,
238                                                bool IsPairwise) const {
239   return PrevTTI->getReductionCost(Opcode, Ty, IsPairwise);
240 }
241 
242 namespace {
243 
244 struct NoTTI LLVM_FINAL : ImmutablePass, TargetTransformInfo {
245   const DataLayout *DL;
246 
247   NoTTI() : ImmutablePass(ID), DL(0) {
248     initializeNoTTIPass(*PassRegistry::getPassRegistry());
249   }
250 
251   virtual void initializePass() LLVM_OVERRIDE {
252     // Note that this subclass is special, and must *not* call initializeTTI as
253     // it does not chain.
254     TopTTI = this;
255     PrevTTI = 0;
256     DL = getAnalysisIfAvailable<DataLayout>();
257   }
258 
259   virtual void getAnalysisUsage(AnalysisUsage &AU) const LLVM_OVERRIDE {
260     // Note that this subclass is special, and must *not* call
261     // TTI::getAnalysisUsage as it breaks the recursion.
262   }
263 
264   /// Pass identification.
265   static char ID;
266 
267   /// Provide necessary pointer adjustments for the two base classes.
268   virtual void *getAdjustedAnalysisPointer(const void *ID) LLVM_OVERRIDE {
269     if (ID == &TargetTransformInfo::ID)
270       return (TargetTransformInfo*)this;
271     return this;
272   }
273 
274   unsigned getOperationCost(unsigned Opcode, Type *Ty,
275                             Type *OpTy) const LLVM_OVERRIDE {
276     switch (Opcode) {
277     default:
278       // By default, just classify everything as 'basic'.
279       return TCC_Basic;
280 
281     case Instruction::GetElementPtr:
282       llvm_unreachable("Use getGEPCost for GEP operations!");
283 
284     case Instruction::BitCast:
285       assert(OpTy && "Cast instructions must provide the operand type");
286       if (Ty == OpTy || (Ty->isPointerTy() && OpTy->isPointerTy()))
287         // Identity and pointer-to-pointer casts are free.
288         return TCC_Free;
289 
290       // Otherwise, the default basic cost is used.
291       return TCC_Basic;
292 
293     case Instruction::IntToPtr: {
294       if (!DL)
295         return TCC_Basic;
296 
297       // An inttoptr cast is free so long as the input is a legal integer type
298       // which doesn't contain values outside the range of a pointer.
299       unsigned OpSize = OpTy->getScalarSizeInBits();
300       if (DL->isLegalInteger(OpSize) &&
301           OpSize <= DL->getPointerTypeSizeInBits(Ty))
302         return TCC_Free;
303 
304       // Otherwise it's not a no-op.
305       return TCC_Basic;
306     }
307     case Instruction::PtrToInt: {
308       if (!DL)
309         return TCC_Basic;
310 
311       // A ptrtoint cast is free so long as the result is large enough to store
312       // the pointer, and a legal integer type.
313       unsigned DestSize = Ty->getScalarSizeInBits();
314       if (DL->isLegalInteger(DestSize) &&
315           DestSize >= DL->getPointerTypeSizeInBits(OpTy))
316         return TCC_Free;
317 
318       // Otherwise it's not a no-op.
319       return TCC_Basic;
320     }
321     case Instruction::Trunc:
322       // trunc to a native type is free (assuming the target has compare and
323       // shift-right of the same width).
324       if (DL && DL->isLegalInteger(DL->getTypeSizeInBits(Ty)))
325         return TCC_Free;
326 
327       return TCC_Basic;
328     }
329   }
330 
331   unsigned getGEPCost(const Value *Ptr,
332                       ArrayRef<const Value *> Operands) const LLVM_OVERRIDE {
333     // In the basic model, we just assume that all-constant GEPs will be folded
334     // into their uses via addressing modes.
335     for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
336       if (!isa<Constant>(Operands[Idx]))
337         return TCC_Basic;
338 
339     return TCC_Free;
340   }
341 
342   unsigned getCallCost(FunctionType *FTy, int NumArgs = -1) const LLVM_OVERRIDE
343   {
344     assert(FTy && "FunctionType must be provided to this routine.");
345 
346     // The target-independent implementation just measures the size of the
347     // function by approximating that each argument will take on average one
348     // instruction to prepare.
349 
350     if (NumArgs < 0)
351       // Set the argument number to the number of explicit arguments in the
352       // function.
353       NumArgs = FTy->getNumParams();
354 
355     return TCC_Basic * (NumArgs + 1);
356   }
357 
358   unsigned getCallCost(const Function *F, int NumArgs = -1) const LLVM_OVERRIDE
359   {
360     assert(F && "A concrete function must be provided to this routine.");
361 
362     if (NumArgs < 0)
363       // Set the argument number to the number of explicit arguments in the
364       // function.
365       NumArgs = F->arg_size();
366 
367     if (Intrinsic::ID IID = (Intrinsic::ID)F->getIntrinsicID()) {
368       FunctionType *FTy = F->getFunctionType();
369       SmallVector<Type *, 8> ParamTys(FTy->param_begin(), FTy->param_end());
370       return TopTTI->getIntrinsicCost(IID, FTy->getReturnType(), ParamTys);
371     }
372 
373     if (!TopTTI->isLoweredToCall(F))
374       return TCC_Basic; // Give a basic cost if it will be lowered directly.
375 
376     return TopTTI->getCallCost(F->getFunctionType(), NumArgs);
377   }
378 
379   unsigned getCallCost(const Function *F,
380                        ArrayRef<const Value *> Arguments) const LLVM_OVERRIDE {
381     // Simply delegate to generic handling of the call.
382     // FIXME: We should use instsimplify or something else to catch calls which
383     // will constant fold with these arguments.
384     return TopTTI->getCallCost(F, Arguments.size());
385   }
386 
387   unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
388                             ArrayRef<Type *> ParamTys) const LLVM_OVERRIDE {
389     switch (IID) {
390     default:
391       // Intrinsics rarely (if ever) have normal argument setup constraints.
392       // Model them as having a basic instruction cost.
393       // FIXME: This is wrong for libc intrinsics.
394       return TCC_Basic;
395 
396     case Intrinsic::dbg_declare:
397     case Intrinsic::dbg_value:
398     case Intrinsic::invariant_start:
399     case Intrinsic::invariant_end:
400     case Intrinsic::lifetime_start:
401     case Intrinsic::lifetime_end:
402     case Intrinsic::objectsize:
403     case Intrinsic::ptr_annotation:
404     case Intrinsic::var_annotation:
405       // These intrinsics don't actually represent code after lowering.
406       return TCC_Free;
407     }
408   }
409 
410   unsigned
411   getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
412                    ArrayRef<const Value *> Arguments) const LLVM_OVERRIDE {
413     // Delegate to the generic intrinsic handling code. This mostly provides an
414     // opportunity for targets to (for example) special case the cost of
415     // certain intrinsics based on constants used as arguments.
416     SmallVector<Type *, 8> ParamTys;
417     ParamTys.reserve(Arguments.size());
418     for (unsigned Idx = 0, Size = Arguments.size(); Idx != Size; ++Idx)
419       ParamTys.push_back(Arguments[Idx]->getType());
420     return TopTTI->getIntrinsicCost(IID, RetTy, ParamTys);
421   }
422 
423   unsigned getUserCost(const User *U) const LLVM_OVERRIDE {
424     if (isa<PHINode>(U))
425       return TCC_Free; // Model all PHI nodes as free.
426 
427     if (const GEPOperator *GEP = dyn_cast<GEPOperator>(U))
428       // In the basic model we just assume that all-constant GEPs will be
429       // folded into their uses via addressing modes.
430       return GEP->hasAllConstantIndices() ? TCC_Free : TCC_Basic;
431 
432     if (ImmutableCallSite CS = U) {
433       const Function *F = CS.getCalledFunction();
434       if (!F) {
435         // Just use the called value type.
436         Type *FTy = CS.getCalledValue()->getType()->getPointerElementType();
437         return TopTTI->getCallCost(cast<FunctionType>(FTy), CS.arg_size());
438       }
439 
440       SmallVector<const Value *, 8> Arguments;
441       for (ImmutableCallSite::arg_iterator AI = CS.arg_begin(),
442                                            AE = CS.arg_end();
443            AI != AE; ++AI)
444         Arguments.push_back(*AI);
445 
446       return TopTTI->getCallCost(F, Arguments);
447     }
448 
449     if (const CastInst *CI = dyn_cast<CastInst>(U)) {
450       // Result of a cmp instruction is often extended (to be used by other
451       // cmp instructions, logical or return instructions). These are usually
452       // nop on most sane targets.
453       if (isa<CmpInst>(CI->getOperand(0)))
454         return TCC_Free;
455     }
456 
457     // Otherwise delegate to the fully generic implementations.
458     return getOperationCost(Operator::getOpcode(U), U->getType(),
459                             U->getNumOperands() == 1 ?
460                                 U->getOperand(0)->getType() : 0);
461   }
462 
463   bool hasBranchDivergence() const LLVM_OVERRIDE { return false; }
464 
465   bool isLoweredToCall(const Function *F) const LLVM_OVERRIDE {
466     // FIXME: These should almost certainly not be handled here, and instead
467     // handled with the help of TLI or the target itself. This was largely
468     // ported from existing analysis heuristics here so that such refactorings
469     // can take place in the future.
470 
471     if (F->isIntrinsic())
472       return false;
473 
474     if (F->hasLocalLinkage() || !F->hasName())
475       return true;
476 
477     StringRef Name = F->getName();
478 
479     // These will all likely lower to a single selection DAG node.
480     if (Name == "copysign" || Name == "copysignf" || Name == "copysignl" ||
481         Name == "fabs" || Name == "fabsf" || Name == "fabsl" || Name == "sin" ||
482         Name == "sinf" || Name == "sinl" || Name == "cos" || Name == "cosf" ||
483         Name == "cosl" || Name == "sqrt" || Name == "sqrtf" || Name == "sqrtl")
484       return false;
485 
486     // These are all likely to be optimized into something smaller.
487     if (Name == "pow" || Name == "powf" || Name == "powl" || Name == "exp2" ||
488         Name == "exp2l" || Name == "exp2f" || Name == "floor" || Name ==
489         "floorf" || Name == "ceil" || Name == "round" || Name == "ffs" ||
490         Name == "ffsl" || Name == "abs" || Name == "labs" || Name == "llabs")
491       return false;
492 
493     return true;
494   }
495 
496   void getUnrollingPreferences(Loop *,
497                                UnrollingPreferences &) const LLVM_OVERRIDE
498   { }
499 
500   bool isLegalAddImmediate(int64_t Imm) const LLVM_OVERRIDE {
501     return false;
502   }
503 
504   bool isLegalICmpImmediate(int64_t Imm) const LLVM_OVERRIDE {
505     return false;
506   }
507 
508   bool isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
509                              bool HasBaseReg, int64_t Scale) const LLVM_OVERRIDE
510   {
511     // Guess that reg+reg addressing is allowed. This heuristic is taken from
512     // the implementation of LSR.
513     return !BaseGV && BaseOffset == 0 && Scale <= 1;
514   }
515 
516   int getScalingFactorCost(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
517                            bool HasBaseReg, int64_t Scale) const LLVM_OVERRIDE {
518     // Guess that all legal addressing mode are free.
519     if(isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg, Scale))
520       return 0;
521     return -1;
522   }
523 
524   bool isTruncateFree(Type *Ty1, Type *Ty2) const LLVM_OVERRIDE {
525     return false;
526   }
527 
528   bool isTypeLegal(Type *Ty) const LLVM_OVERRIDE {
529     return false;
530   }
531 
532   unsigned getJumpBufAlignment() const LLVM_OVERRIDE {
533     return 0;
534   }
535 
536   unsigned getJumpBufSize() const LLVM_OVERRIDE {
537     return 0;
538   }
539 
540   bool shouldBuildLookupTables() const LLVM_OVERRIDE {
541     return true;
542   }
543 
544   PopcntSupportKind
545   getPopcntSupport(unsigned IntTyWidthInBit) const LLVM_OVERRIDE {
546     return PSK_Software;
547   }
548 
549   bool haveFastSqrt(Type *Ty) const LLVM_OVERRIDE {
550     return false;
551   }
552 
553   unsigned getIntImmCost(const APInt &Imm, Type *Ty) const LLVM_OVERRIDE {
554     return TCC_Basic;
555   }
556 
557   unsigned getIntImmCost(unsigned Opcode, const APInt &Imm,
558                          Type *Ty) const LLVM_OVERRIDE {
559     return TCC_Free;
560   }
561 
562   unsigned getIntImmCost(Intrinsic::ID IID, const APInt &Imm,
563                          Type *Ty) const LLVM_OVERRIDE {
564     return TCC_Free;
565   }
566 
567   unsigned getNumberOfRegisters(bool Vector) const LLVM_OVERRIDE {
568     return 8;
569   }
570 
571   unsigned  getRegisterBitWidth(bool Vector) const LLVM_OVERRIDE {
572     return 32;
573   }
574 
575   unsigned getMaximumUnrollFactor() const LLVM_OVERRIDE {
576     return 1;
577   }
578 
579   unsigned getArithmeticInstrCost(unsigned Opcode, Type *Ty, OperandValueKind,
580                                   OperandValueKind) const LLVM_OVERRIDE {
581     return 1;
582   }
583 
584   unsigned getShuffleCost(ShuffleKind Kind, Type *Ty,
585                           int Index = 0, Type *SubTp = 0) const LLVM_OVERRIDE {
586     return 1;
587   }
588 
589   unsigned getCastInstrCost(unsigned Opcode, Type *Dst,
590                             Type *Src) const LLVM_OVERRIDE {
591     return 1;
592   }
593 
594   unsigned getCFInstrCost(unsigned Opcode) const LLVM_OVERRIDE {
595     return 1;
596   }
597 
598   unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
599                               Type *CondTy = 0) const LLVM_OVERRIDE {
600     return 1;
601   }
602 
603   unsigned getVectorInstrCost(unsigned Opcode, Type *Val,
604                               unsigned Index = -1) const LLVM_OVERRIDE {
605     return 1;
606   }
607 
608   unsigned getMemoryOpCost(unsigned Opcode,
609                            Type *Src,
610                            unsigned Alignment,
611                            unsigned AddressSpace) const LLVM_OVERRIDE {
612     return 1;
613   }
614 
615   unsigned getIntrinsicInstrCost(Intrinsic::ID ID,
616                                  Type *RetTy,
617                                  ArrayRef<Type*> Tys) const LLVM_OVERRIDE {
618     return 1;
619   }
620 
621   unsigned getNumberOfParts(Type *Tp) const LLVM_OVERRIDE {
622     return 0;
623   }
624 
625   unsigned getAddressComputationCost(Type *Tp, bool) const LLVM_OVERRIDE {
626     return 0;
627   }
628 
629   unsigned getReductionCost(unsigned, Type *, bool) const LLVM_OVERRIDE {
630     return 1;
631   }
632 };
633 
634 } // end anonymous namespace
635 
636 INITIALIZE_AG_PASS(NoTTI, TargetTransformInfo, "notti",
637                    "No target information", true, true, true)
638 char NoTTI::ID = 0;
639 
640 ImmutablePass *llvm::createNoTargetTransformInfoPass() {
641   return new NoTTI();
642 }
643