Lines Matching refs:UseInstrInfo

125         const DominatorTree *DT, bool UseInstrInfo,  in Query()
127 : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE), IIQ(UseInstrInfo) {} in Query()
226 OptimizationRemarkEmitter *ORE, bool UseInstrInfo) { in computeKnownBits() argument
228 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
235 OptimizationRemarkEmitter *ORE, bool UseInstrInfo) { in computeKnownBits() argument
237 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
251 bool UseInstrInfo) { in computeKnownBits() argument
253 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
261 bool UseInstrInfo) { in computeKnownBits() argument
264 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
270 bool UseInstrInfo) { in haveNoCommonBitsSet() argument
312 computeKnownBits(LHS, LHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo); in haveNoCommonBitsSet()
313 computeKnownBits(RHS, RHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo); in haveNoCommonBitsSet()
330 const DominatorTree *DT, bool UseInstrInfo) { in isKnownToBeAPowerOfTwo() argument
332 V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in isKnownToBeAPowerOfTwo()
342 const DominatorTree *DT, bool UseInstrInfo) { in isKnownNonZero() argument
344 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in isKnownNonZero()
350 bool UseInstrInfo) { in isKnownNonNegative() argument
352 computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo); in isKnownNonNegative()
358 const DominatorTree *DT, bool UseInstrInfo) { in isKnownPositive() argument
364 return isKnownNonNegative(V, DL, Depth, AC, CxtI, DT, UseInstrInfo) && in isKnownPositive()
365 isKnownNonZero(V, DL, Depth, AC, CxtI, DT, UseInstrInfo); in isKnownPositive()
370 const DominatorTree *DT, bool UseInstrInfo) { in isKnownNegative() argument
372 computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo); in isKnownNegative()
382 bool UseInstrInfo) { in isKnownNonEqual() argument
385 UseInstrInfo, /*ORE=*/nullptr)); in isKnownNonEqual()
394 const DominatorTree *DT, bool UseInstrInfo) { in MaskedValueIsZero() argument
396 V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in MaskedValueIsZero()
418 const DominatorTree *DT, bool UseInstrInfo) { in ComputeNumSignBits() argument
420 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); in ComputeNumSignBits()
2669 if (Q.IIQ.UseInstrInfo && isNonZeroRecurrence(PN)) in isKnownNonZero()
4834 OptimizationRemarkEmitter *ORE = nullptr, bool UseInstrInfo = true) { in computeConstantRangeIncludingKnownBits() argument
4836 V, DL, Depth, AC, CxtI, DT, ORE, UseInstrInfo); in computeConstantRangeIncludingKnownBits()
4838 ConstantRange CR2 = computeConstantRange(V, UseInstrInfo); in computeConstantRangeIncludingKnownBits()
4847 bool UseInstrInfo) { in computeOverflowForUnsignedMul() argument
4849 nullptr, UseInstrInfo); in computeOverflowForUnsignedMul()
4851 nullptr, UseInstrInfo); in computeOverflowForUnsignedMul()
4861 const DominatorTree *DT, bool UseInstrInfo) { in computeOverflowForSignedMul() argument
4891 nullptr, UseInstrInfo); in computeOverflowForSignedMul()
4893 nullptr, UseInstrInfo); in computeOverflowForSignedMul()
4903 bool UseInstrInfo) { in computeOverflowForUnsignedAdd() argument
4906 nullptr, UseInstrInfo); in computeOverflowForUnsignedAdd()
4909 nullptr, UseInstrInfo); in computeOverflowForUnsignedAdd()
7221 bool UseInstrInfo, AssumptionCache *AC, in computeConstantRange() argument
7234 InstrInfoQuery IIQ(UseInstrInfo); in computeConstantRange()
7274 UseInstrInfo, AC, I, DT, Depth + 1); in computeConstantRange()