Lines Matching refs:TD
45 const DataLayout *TD; member
50 const DominatorTree *dt) : TD(td), TLI(tli), DT(dt) {} in Query()
598 Q.TD, Q.TLI); in SimplifyAddInst()
654 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyAddInst() argument
656 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifyAddInst()
670 static Constant *stripAndComputeConstantOffsets(const DataLayout *TD, in stripAndComputeConstantOffsets() argument
676 if (!TD) in stripAndComputeConstantOffsets()
679 Type *IntPtrTy = TD->getIntPtrType(V->getType())->getScalarType(); in stripAndComputeConstantOffsets()
688 if (!GEP->isInBounds() || !GEP->accumulateConstantOffset(*TD, Offset)) in stripAndComputeConstantOffsets()
713 static Constant *computePointerDifference(const DataLayout *TD, in computePointerDifference() argument
715 Constant *LHSOffset = stripAndComputeConstantOffsets(TD, LHS); in computePointerDifference()
716 Constant *RHSOffset = stripAndComputeConstantOffsets(TD, RHS); in computePointerDifference()
738 Ops, Q.TD, Q.TLI); in SimplifySubInst()
832 if (Constant *Result = computePointerDifference(Q.TD, X, Y)) in SimplifySubInst()
858 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifySubInst() argument
860 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifySubInst()
872 Ops, Q.TD, Q.TLI); in SimplifyFAddInst()
914 Ops, Q.TD, Q.TLI); in SimplifyFSubInst()
952 Ops, Q.TD, Q.TLI); in SimplifyFMulInst()
978 Ops, Q.TD, Q.TLI); in SimplifyMulInst()
1036 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyFAddInst() argument
1038 return ::SimplifyFAddInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFAddInst()
1042 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyFSubInst() argument
1044 return ::SimplifyFSubInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFSubInst()
1049 const DataLayout *TD, in SimplifyFMulInst() argument
1052 return ::SimplifyFMulInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFMulInst()
1055 Value *llvm::SimplifyMulInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyMulInst() argument
1058 return ::SimplifyMulInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyMulInst()
1068 return ConstantFoldInstOperands(Opcode, C0->getType(), Ops, Q.TD, Q.TLI); in SimplifyDiv()
1143 Value *llvm::SimplifySDivInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifySDivInst() argument
1146 return ::SimplifySDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifySDivInst()
1159 Value *llvm::SimplifyUDivInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyUDivInst() argument
1162 return ::SimplifyUDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyUDivInst()
1178 Value *llvm::SimplifyFDivInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyFDivInst() argument
1181 return ::SimplifyFDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyFDivInst()
1191 return ConstantFoldInstOperands(Opcode, C0->getType(), Ops, Q.TD, Q.TLI); in SimplifyRem()
1248 Value *llvm::SimplifySRemInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifySRemInst() argument
1251 return ::SimplifySRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifySRemInst()
1264 Value *llvm::SimplifyURemInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyURemInst() argument
1267 return ::SimplifyURemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyURemInst()
1283 Value *llvm::SimplifyFRemInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyFRemInst() argument
1286 return ::SimplifyFRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyFRemInst()
1296 return ConstantFoldInstOperands(Opcode, C0->getType(), Ops, Q.TD, Q.TLI); in SimplifyShift()
1352 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyShlInst() argument
1354 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifyShlInst()
1383 const DataLayout *TD, in SimplifyLShrInst() argument
1386 return ::SimplifyLShrInst(Op0, Op1, isExact, Query (TD, TLI, DT), in SimplifyLShrInst()
1419 const DataLayout *TD, in SimplifyAShrInst() argument
1422 return ::SimplifyAShrInst(Op0, Op1, isExact, Query (TD, TLI, DT), in SimplifyAShrInst()
1434 Ops, Q.TD, Q.TLI); in SimplifyAndInst()
1519 Value *llvm::SimplifyAndInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyAndInst() argument
1522 return ::SimplifyAndInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyAndInst()
1533 Ops, Q.TD, Q.TLI); in SimplifyOrInst()
1613 Value *llvm::SimplifyOrInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyOrInst() argument
1616 return ::SimplifyOrInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyOrInst()
1627 Ops, Q.TD, Q.TLI); in SimplifyXorInst()
1673 Value *llvm::SimplifyXorInst(Value *Op0, Value *Op1, const DataLayout *TD, in SimplifyXorInst() argument
1676 return ::SimplifyXorInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyXorInst()
1731 static Constant *computePointerICmp(const DataLayout *TD, in computePointerICmp() argument
1773 Constant *LHSOffset = stripAndComputeConstantOffsets(TD, LHS); in computePointerICmp()
1774 Constant *RHSOffset = stripAndComputeConstantOffsets(TD, RHS); in computePointerICmp()
1818 getObjectSize(LHS, LHSSize, TD, TLI) && in computePointerICmp()
1819 getObjectSize(RHS, RHSSize, TD, TLI)) { in computePointerICmp()
1855 return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.TD, Q.TLI); in SimplifyICmpInst()
1919 if (isKnownNonZero(LHS, Q.TD)) in SimplifyICmpInst()
1924 if (isKnownNonZero(LHS, Q.TD)) in SimplifyICmpInst()
1928 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.TD); in SimplifyICmpInst()
1935 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.TD); in SimplifyICmpInst()
1938 if (LHSKnownNonNegative && isKnownNonZero(LHS, Q.TD)) in SimplifyICmpInst()
1942 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.TD); in SimplifyICmpInst()
1949 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.TD); in SimplifyICmpInst()
1952 if (LHSKnownNonNegative && isKnownNonZero(LHS, Q.TD)) in SimplifyICmpInst()
2035 if (MaxRecurse && Q.TD && isa<PtrToIntInst>(LI) && in SimplifyICmpInst()
2036 Q.TD->getTypeSizeInBits(SrcTy) == DstTy->getPrimitiveSizeInBits()) { in SimplifyICmpInst()
2256 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.TD); in SimplifyICmpInst()
2266 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.TD); in SimplifyICmpInst()
2285 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.TD); in SimplifyICmpInst()
2295 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.TD); in SimplifyICmpInst()
2538 if (Constant *C = computePointerICmp(Q.TD, Q.TLI, Pred, LHS, RHS)) in SimplifyICmpInst()
2578 const DataLayout *TD, in SimplifyICmpInst() argument
2581 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyICmpInst()
2594 return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.TD, Q.TLI); in SimplifyFCmpInst()
2675 const DataLayout *TD, in SimplifyFCmpInst() argument
2678 return ::SimplifyFCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyFCmpInst()
2710 const DataLayout *TD, in SimplifySelectInst() argument
2713 return ::SimplifySelectInst(Cond, TrueVal, FalseVal, Query (TD, TLI, DT), in SimplifySelectInst()
2743 if (Q.TD) { in SimplifyGEPInst()
2745 if (Ty->isSized() && Q.TD->getTypeAllocSize(Ty) == 0) in SimplifyGEPInst()
2758 Value *llvm::SimplifyGEPInst(ArrayRef<Value *> Ops, const DataLayout *TD, in SimplifyGEPInst() argument
2761 return ::SimplifyGEPInst(Ops, Query (TD, TLI, DT), RecursionLimit); in SimplifyGEPInst()
2795 const DataLayout *TD, in SimplifyInsertValueInst() argument
2798 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query (TD, TLI, DT), in SimplifyInsertValueInst()
2838 return ConstantFoldInstOperands(Instruction::Trunc, Ty, C, Q.TD, Q.TLI); in SimplifyTruncInst()
2843 Value *llvm::SimplifyTruncInst(Value *Op, Type *Ty, const DataLayout *TD, in SimplifyTruncInst() argument
2846 return ::SimplifyTruncInst(Op, Ty, Query (TD, TLI, DT), RecursionLimit); in SimplifyTruncInst()
2891 return ConstantFoldInstOperands(Opcode, LHS->getType(), COps, Q.TD, in SimplifyBinOp()
2917 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyBinOp() argument
2919 return ::SimplifyBinOp(Opcode, LHS, RHS, Query (TD, TLI, DT), RecursionLimit); in SimplifyBinOp()
2932 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyCmpInst() argument
2934 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyCmpInst()
3006 User::op_iterator ArgEnd, const DataLayout *TD, in SimplifyCall() argument
3009 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(TD, TLI, DT), in SimplifyCall()
3014 const DataLayout *TD, const TargetLibraryInfo *TLI, in SimplifyCall() argument
3016 return ::SimplifyCall(V, Args.begin(), Args.end(), Query(TD, TLI, DT), in SimplifyCall()
3022 Value *llvm::SimplifyInstruction(Instruction *I, const DataLayout *TD, in SimplifyInstruction() argument
3029 Result = ConstantFoldInstruction(I, TD, TLI); in SimplifyInstruction()
3033 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3039 TD, TLI, DT); in SimplifyInstruction()
3043 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3049 TD, TLI, DT); in SimplifyInstruction()
3053 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3056 Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3059 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3062 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3065 Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3068 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3071 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3074 Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3080 TD, TLI, DT); in SimplifyInstruction()
3085 TD, TLI, DT); in SimplifyInstruction()
3090 TD, TLI, DT); in SimplifyInstruction()
3093 Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3096 Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3099 Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3103 I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3107 I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3111 I->getOperand(2), TD, TLI, DT); in SimplifyInstruction()
3115 Result = SimplifyGEPInst(Ops, TD, TLI, DT); in SimplifyInstruction()
3122 IV->getIndices(), TD, TLI, DT); in SimplifyInstruction()
3126 Result = SimplifyPHINode(cast<PHINode>(I), Query (TD, TLI, DT)); in SimplifyInstruction()
3131 TD, TLI, DT); in SimplifyInstruction()
3135 Result = SimplifyTruncInst(I->getOperand(0), I->getType(), TD, TLI, DT); in SimplifyInstruction()
3157 const DataLayout *TD, in replaceAndRecursivelySimplifyImpl() argument
3187 SimpleV = SimplifyInstruction(I, TD, TLI, DT); in replaceAndRecursivelySimplifyImpl()
3212 const DataLayout *TD, in recursivelySimplifyInstruction() argument
3215 return replaceAndRecursivelySimplifyImpl(I, 0, TD, TLI, DT); in recursivelySimplifyInstruction()
3219 const DataLayout *TD, in replaceAndRecursivelySimplify() argument
3224 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TD, TLI, DT); in replaceAndRecursivelySimplify()