/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 257 Value *FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS, Instruction *CxtI); 386 bool WillNotOverflowSignedAdd(Value *LHS, Value *RHS, Instruction &CxtI); 387 bool WillNotOverflowSignedSub(Value *LHS, Value *RHS, Instruction &CxtI); 388 bool WillNotOverflowUnsignedSub(Value *LHS, Value *RHS, Instruction &CxtI); 389 bool WillNotOverflowSignedMul(Value *LHS, Value *RHS, Instruction &CxtI); 472 unsigned Depth, Instruction *CxtI) const { 473 return llvm::computeKnownBits(V, KnownZero, KnownOne, DL, Depth, AC, CxtI, 478 Instruction *CxtI = nullptr) const { 479 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, AC, CxtI, DT); 482 Instruction *CxtI 490 computeOverflowForUnsignedMul(Value *LHS, Value *RHS, const Instruction *CxtI) argument 494 computeOverflowForUnsignedAdd(Value *LHS, Value *RHS, const Instruction *CxtI) argument [all...] |
H A D | InstCombineShifts.cpp | 71 InstCombiner &IC, Instruction *CxtI) { 136 0, CxtI)) 161 0, CxtI)) 70 CanEvaluateShifted(Value *V, unsigned NumBits, bool isLeftShift, InstCombiner &IC, Instruction *CxtI) argument
|
H A D | InstCombineSimplifyDemanded.cpp | 119 Instruction *CxtI) { 159 computeKnownBits(V, KnownZero, KnownOne, Depth, CxtI); 174 CxtI); 176 CxtI); 198 CxtI); 200 CxtI); 225 CxtI); 227 CxtI); 238 computeKnownBits(I, KnownZero, KnownOne, Depth, CxtI); 251 computeKnownBits(I, KnownZero, KnownOne, Depth, CxtI); 116 SimplifyDemandedUseBits(Value *V, APInt DemandedMask, APInt &KnownZero, APInt &KnownOne, unsigned Depth, Instruction *CxtI) argument [all...] |
H A D | InstCombineMulDivRem.cpp | 29 Instruction &CxtI) { 51 IC.getAssumptionCache(), &CxtI, 55 if (Value *V2 = simplifyValueKnownNonZero(I->getOperand(0), IC, CxtI)) { 129 Instruction &CxtI) { 141 ComputeNumSignBits(LHS, 0, &CxtI) + ComputeNumSignBits(RHS, 0, &CxtI); 160 ComputeSignBit(LHS, LHSNonNegative, LHSNegative, /*Depth=*/0, &CxtI); 161 ComputeSignBit(RHS, RHSNonNegative, RHSNegative, /*Depth=*/0, &CxtI); 28 simplifyValueKnownNonZero(Value *V, InstCombiner &IC, Instruction &CxtI) argument 128 WillNotOverflowSignedMul(Value *LHS, Value *RHS, Instruction &CxtI) argument
|
H A D | InstCombineAddSub.cpp | 894 Instruction &CxtI) { 912 if (ComputeNumSignBits(LHS, 0, &CxtI) > 1 && 913 ComputeNumSignBits(RHS, 0, &CxtI) > 1) 919 computeKnownBits(LHS, LHSKnownZero, LHSKnownOne, 0, &CxtI); 923 computeKnownBits(RHS, RHSKnownZero, RHSKnownOne, 0, &CxtI); 946 Instruction &CxtI) { 949 if (ComputeNumSignBits(LHS, 0, &CxtI) > 1 && 950 ComputeNumSignBits(RHS, 0, &CxtI) > 1) 956 computeKnownBits(LHS, LHSKnownZero, LHSKnownOne, 0, &CxtI); 960 computeKnownBits(RHS, RHSKnownZero, RHSKnownOne, 0, &CxtI); 893 WillNotOverflowSignedAdd(Value *LHS, Value *RHS, Instruction &CxtI) argument 945 WillNotOverflowSignedSub(Value *LHS, Value *RHS, Instruction &CxtI) argument 974 WillNotOverflowUnsignedSub(Value *LHS, Value *RHS, Instruction &CxtI) argument [all...] |
H A D | InstCombineAndOrXor.cpp | 1692 Instruction *CxtI) { 1712 isKnownToBeAPowerOfTwo(LAnd->getOperand(1), DL, false, 0, AC, CxtI, 1714 isKnownToBeAPowerOfTwo(RAnd->getOperand(1), DL, false, 0, AC, CxtI, 1720 CxtI, DT) && 1722 CxtI, DT)) { 1691 FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS, Instruction *CxtI) argument
|
H A D | InstCombineCasts.cpp | 333 Instruction *CxtI) { 362 return CanEvaluateTruncated(I->getOperand(0), Ty, IC, CxtI) && 363 CanEvaluateTruncated(I->getOperand(1), Ty, IC, CxtI); 372 if (IC.MaskedValueIsZero(I->getOperand(0), Mask, 0, CxtI) && 373 IC.MaskedValueIsZero(I->getOperand(1), Mask, 0, CxtI)) { 374 return CanEvaluateTruncated(I->getOperand(0), Ty, IC, CxtI) && 375 CanEvaluateTruncated(I->getOperand(1), Ty, IC, CxtI); 386 return CanEvaluateTruncated(I->getOperand(0), Ty, IC, CxtI); 397 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth), 0, CxtI) && 399 return CanEvaluateTruncated(I->getOperand(0), Ty, IC, CxtI); 332 CanEvaluateTruncated(Value *V, Type *Ty, InstCombiner &IC, Instruction *CxtI) argument 649 CanEvaluateZExtd(Value *V, Type *Ty, unsigned &BitsToClear, InstCombiner &IC, Instruction *CxtI) argument [all...] |
/external/llvm/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 368 Instruction *CxtI = nullptr); 394 Instruction *CxtI = nullptr); 399 LVILatticeVal getValueAt(Value *V, Instruction *CxtI); 404 Instruction *CxtI = nullptr); 937 Instruction *CxtI) { 962 // See note on the use of the CxtI with mergeAssumeBlockValueConstantRange, 964 mergeAssumeBlockValueConstantRange(Val, InBlock, CxtI); 992 mergeAssumeBlockValueConstantRange(Val, Result, CxtI); 997 Instruction *CxtI) { 1006 mergeAssumeBlockValueConstantRange(V, Result, CxtI); 935 getEdgeValue(Value *Val, BasicBlock *BBFrom, BasicBlock *BBTo, LVILatticeVal &Result, Instruction *CxtI) argument 996 getValueInBlock(Value *V, BasicBlock *BB, Instruction *CxtI) argument 1012 getValueAt(Value *V, Instruction *CxtI) argument 1024 getValueOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB, Instruction *CxtI) argument 1144 getConstant(Value *V, BasicBlock *BB, Instruction *CxtI) argument 1162 getConstantOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB, Instruction *CxtI) argument 1250 getPredicateOnEdge(unsigned Pred, Value *V, Constant *C, BasicBlock *FromBB, BasicBlock *ToBB, Instruction *CxtI) argument 1261 getPredicateAt(unsigned Pred, Value *V, Constant *C, Instruction *CxtI) argument [all...] |
H A D | InstructionSimplify.cpp | 52 const Instruction *CxtI; member in struct:__anon10349::Query 57 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {} 589 const Instruction *CxtI) { 590 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), 782 const Instruction *CxtI) { 783 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), 962 const Instruction *CxtI) { 963 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), 971 const Instruction *CxtI) { 972 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), 586 SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 779 SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 958 SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 967 SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 976 SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 985 SimplifyMulInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1089 SimplifySDivInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1107 SimplifyUDivInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1134 SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1214 SimplifySRemInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1232 SimplifyURemInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1259 SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1383 SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1407 SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1441 SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1642 SimplifyAndInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1830 SimplifyOrInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1887 SimplifyXorInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3024 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, Instruction *CxtI) argument 3140 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3235 SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3328 SimplifyGEPInst(ArrayRef<Value *> Ops, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3366 SimplifyInsertValueInst( Value *Agg, Value *Val, ArrayRef<unsigned> Idxs, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3415 SimplifyTruncInst(Value *Op, Type *Ty, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3511 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3519 SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3537 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3613 SimplifyCall(Value *V, User::op_iterator ArgBegin, User::op_iterator ArgEnd, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3621 SimplifyCall(Value *V, ArrayRef<Value *> Args, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument [all...] |
H A D | ValueTracking.cpp | 97 const Instruction *CxtI; member in struct:__anon10382::Query 100 Query(AssumptionCache *AC = nullptr, const Instruction *CxtI = nullptr, 102 : AC(AC), CxtI(CxtI), DT(DT) {} 105 : ExclInvs(Q.ExclInvs), AC(Q.AC), CxtI(Q.CxtI), DT(Q.DT) { 113 static const Instruction *safeCxtI(const Value *V, const Instruction *CxtI) { argument 116 if (CxtI && CxtI->getParent()) 117 return CxtI; 131 computeKnownBits(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 143 ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 154 isKnownToBeAPowerOfTwo(Value *V, const DataLayout &DL, bool OrZero, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 165 isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 174 MaskedValueIsZero(Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 184 ComputeNumSignBits(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 466 isValidAssumeForContext(const Instruction *I, const Instruction *CxtI, const DominatorTree *DT) argument 2948 computeOverflowForUnsignedMul(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 2998 computeOverflowForUnsignedAdd(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 130 Instruction *CxtI = nullptr); 133 Instruction *CxtI = nullptr); 346 Instruction *CxtI) { 388 Constant *PredCst = LVI->getConstantOnEdge(V, P, BB, CxtI); 405 BB, CxtI); 424 WantInteger, CxtI); 426 WantInteger, CxtI); 467 WantInteger, CxtI); 485 WantInteger, CxtI); 521 CxtI 344 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, ConstantPreference Preference, Instruction *CxtI) argument 1119 ProcessThreadableEdges(Value *Cond, BasicBlock *BB, ConstantPreference Preference, Instruction *CxtI) argument [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 949 const Instruction *CxtI, 957 computeKnownBits(V, KnownZero, KnownOne, DL, 0, AC, CxtI, DT); 947 getOrEnforceKnownAlignment(Value *V, unsigned PrefAlign, const DataLayout &DL, const Instruction *CxtI, AssumptionCache *AC, const DominatorTree *DT) argument
|