1140     bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));  in computeKnownBitsFromOperator()
1187           Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(RHS)))  in computeKnownBitsFromOperator()
1286     bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));  in computeKnownBitsFromOperator()
1328     bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));  in computeKnownBitsFromOperator()
1334     bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));  in computeKnownBitsFromOperator()
1516         if (OverflowOp && Q.IIQ.hasNoSignedWrap(OverflowOp)) {  in computeKnownBitsFromOperator()
2069             Q.IIQ.hasNoSignedWrap(BO)) &&  in isPowerOfTwoRecurrence()
2084     return OrZero || Q.IIQ.hasNoUnsignedWrap(BO) || Q.IIQ.hasNoSignedWrap(BO);  in isPowerOfTwoRecurrence()
2160         Q.IIQ.hasNoSignedWrap(VOBO)) {  in isKnownToBeAPowerOfTwo()
2413            (BO->hasNoSignedWrap() && match(Step, m_APInt(StepC)) &&  in isNonZeroRecurrence()
2416     return (BO->hasNoUnsignedWrap() || BO->hasNoSignedWrap()) &&  in isNonZeroRecurrence()
2419     return BO->hasNoUnsignedWrap() || BO->hasNoSignedWrap();  in isNonZeroRecurrence()
2656     if ((Q.IIQ.hasNoSignedWrap(BO) || Q.IIQ.hasNoUnsignedWrap(BO)) &&  in isKnownNonZero()
2756         (!OBO1->hasNoSignedWrap() || !OBO2->hasNoSignedWrap()))  in getInvertibleOperands()
2772         (!OBO1->hasNoSignedWrap() || !OBO2->hasNoSignedWrap()))  in getInvertibleOperands()
2853            (OBO->hasNoUnsignedWrap() || OBO->hasNoSignedWrap()) &&  in isNonEqualMul()
2866            (OBO->hasNoUnsignedWrap() || OBO->hasNoSignedWrap()) &&  in isNonEqualShl()
4920   if (Add && Add->hasNoSignedWrap()) {  in computeOverflowForSignedAdd()
6890       bool HasNSW = IIQ.hasNoSignedWrap(&BO);  in setLimitsForBinOp()
6970       } else if (BO.hasNoSignedWrap()) { // TODO: What if both nuw+nsw?  in setLimitsForBinOp()
7165         IIQ.hasNoSignedWrap(cast<Instruction>(RHS)))  in setLimitsForSelectPattern()