Lines Matching refs:UseInstrInfo
116 const DominatorTree *DT, bool UseInstrInfo, in Query()
118 : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE), IIQ(UseInstrInfo) {} in Query()
217 OptimizationRemarkEmitter *ORE, bool UseInstrInfo) { in computeKnownBits() argument
219 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
226 OptimizationRemarkEmitter *ORE, bool UseInstrInfo) { in computeKnownBits() argument
228 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
242 bool UseInstrInfo) { in computeKnownBits() argument
244 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
252 bool UseInstrInfo) { in computeKnownBits() argument
255 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
261 bool UseInstrInfo) { in haveNoCommonBitsSet() argument
277 computeKnownBits(LHS, LHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo); in haveNoCommonBitsSet()
278 computeKnownBits(RHS, RHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo); in haveNoCommonBitsSet()
300 const DominatorTree *DT, bool UseInstrInfo) { in isKnownToBeAPowerOfTwo() argument
302 V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in isKnownToBeAPowerOfTwo()
312 const DominatorTree *DT, bool UseInstrInfo) { in isKnownNonZero() argument
314 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in isKnownNonZero()
320 bool UseInstrInfo) { in isKnownNonNegative() argument
322 computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo); in isKnownNonNegative()
328 const DominatorTree *DT, bool UseInstrInfo) { in isKnownPositive() argument
334 return isKnownNonNegative(V, DL, Depth, AC, CxtI, DT, UseInstrInfo) && in isKnownPositive()
335 isKnownNonZero(V, DL, Depth, AC, CxtI, DT, UseInstrInfo); in isKnownPositive()
340 const DominatorTree *DT, bool UseInstrInfo) { in isKnownNegative() argument
342 computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo); in isKnownNegative()
352 bool UseInstrInfo) { in isKnownNonEqual() argument
355 UseInstrInfo, /*ORE=*/nullptr)); in isKnownNonEqual()
364 const DominatorTree *DT, bool UseInstrInfo) { in MaskedValueIsZero() argument
366 V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in MaskedValueIsZero()
388 const DominatorTree *DT, bool UseInstrInfo) { in ComputeNumSignBits() argument
390 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in ComputeNumSignBits()
2515 if (Q.IIQ.UseInstrInfo && isNonZeroRecurrence(PN)) in isKnownNonZero()
4691 OptimizationRemarkEmitter *ORE = nullptr, bool UseInstrInfo = true) { in computeConstantRangeIncludingKnownBits() argument
4693 V, DL, Depth, AC, CxtI, DT, ORE, UseInstrInfo); in computeConstantRangeIncludingKnownBits()
4695 ConstantRange CR2 = computeConstantRange(V, UseInstrInfo); in computeConstantRangeIncludingKnownBits()
4704 bool UseInstrInfo) { in computeOverflowForUnsignedMul() argument
4706 nullptr, UseInstrInfo); in computeOverflowForUnsignedMul()
4708 nullptr, UseInstrInfo); in computeOverflowForUnsignedMul()
4718 const DominatorTree *DT, bool UseInstrInfo) { in computeOverflowForSignedMul() argument
4748 nullptr, UseInstrInfo); in computeOverflowForSignedMul()
4750 nullptr, UseInstrInfo); in computeOverflowForSignedMul()
4760 bool UseInstrInfo) { in computeOverflowForUnsignedAdd() argument
4763 nullptr, UseInstrInfo); in computeOverflowForUnsignedAdd()
4766 nullptr, UseInstrInfo); in computeOverflowForUnsignedAdd()
6999 ConstantRange llvm::computeConstantRange(const Value *V, bool UseInstrInfo, in computeConstantRange() argument
7012 InstrInfoQuery IIQ(UseInstrInfo); in computeConstantRange()
7047 ConstantRange RHS = computeConstantRange(Cmp->getOperand(1), UseInstrInfo, in computeConstantRange()