128         const DominatorTree *DT, bool UseInstrInfo,  in Query()
130       : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE), IIQ(UseInstrInfo) {}  in Query()
173                             OptimizationRemarkEmitter *ORE, bool UseInstrInfo) {  in computeKnownBits()  argument
175                      Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));  in computeKnownBits()
186                                  bool UseInstrInfo) {  in computeKnownBits()  argument
188       V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));  in computeKnownBits()
194                                bool UseInstrInfo) {  in haveNoCommonBitsSet()  argument
210   computeKnownBits(LHS, LHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo);  in haveNoCommonBitsSet()
211   computeKnownBits(RHS, RHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo);  in haveNoCommonBitsSet()
233                                   const DominatorTree *DT, bool UseInstrInfo) {  in isKnownToBeAPowerOfTwo()  argument
235       V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));  in isKnownToBeAPowerOfTwo()
242                           const DominatorTree *DT, bool UseInstrInfo) {  in isKnownNonZero()  argument
244                           Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));  in isKnownNonZero()
250                               bool UseInstrInfo) {  in isKnownNonNegative()  argument
252       computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo);  in isKnownNonNegative()
258                            const DominatorTree *DT, bool UseInstrInfo) {  in isKnownPositive()  argument
264   return isKnownNonNegative(V, DL, Depth, AC, CxtI, DT, UseInstrInfo) &&  in isKnownPositive()
265          isKnownNonZero(V, DL, Depth, AC, CxtI, DT, UseInstrInfo);  in isKnownPositive()
270                            const DominatorTree *DT, bool UseInstrInfo) {  in isKnownNegative()  argument
272       computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo);  in isKnownNegative()
281                            bool UseInstrInfo) {  in isKnownNonEqual()  argument
284                                  UseInstrInfo, /*ORE=*/nullptr));  in isKnownNonEqual()
293                              const DominatorTree *DT, bool UseInstrInfo) {  in MaskedValueIsZero()  argument
295       V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));  in MaskedValueIsZero()
304                                   const DominatorTree *DT, bool UseInstrInfo) {  in ComputeNumSignBits()  argument
306       V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));  in ComputeNumSignBits()
2158           if (Q.IIQ.UseInstrInfo &&  in isKnownNonZero()
3932     bool UseInstrInfo) {  in computeOverflowForUnsignedMul()  argument
3943                    UseInstrInfo);  in computeOverflowForUnsignedMul()
3945                    UseInstrInfo);  in computeOverflowForUnsignedMul()
3980                                   const DominatorTree *DT, bool UseInstrInfo) {  in computeOverflowForSignedMul()  argument
4010                                           nullptr, UseInstrInfo);  in computeOverflowForSignedMul()
4012                                           nullptr, UseInstrInfo);  in computeOverflowForSignedMul()
4022     bool UseInstrInfo) {  in computeOverflowForUnsignedAdd()  argument
4024                                         nullptr, UseInstrInfo);  in computeOverflowForUnsignedAdd()
4027                                           nullptr, UseInstrInfo);  in computeOverflowForUnsignedAdd()