70     if (!OldLHS->hasOneUse() && !OldRHS->hasOneUse())  in SimplifyBSwap()
75     if (!OldLHS->hasOneUse())  in SimplifyBSwap()
956       (ZeroICmp->hasOneUse() || UnsignedICmp->hasOneUse())) {  in foldUnsignedUnderflowCheck()
1052   if (!Cmp0->hasOneUse() || !Cmp1->hasOneUse())  in foldEqOfParts()
1129     if (!Cmp1->hasOneUse())  in foldAndOrOfICmpsWithConstEq()
1179     if (!(ICmp1->hasOneUse() && ICmp2->hasOneUse()) || CR1.isWrappedSet() ||  in foldAndOrOfICmpsUsingRanges()
1332       !InstCombiner::isFreeToInvert(A, A->hasOneUse()) &&  in matchDeMorgansLaws()
1333       !InstCombiner::isFreeToInvert(B, B->hasOneUse())) {  in matchDeMorgansLaws()
1443   if ((Cast0->hasOneUse() || Cast1->hasOneUse()) &&  in foldCastedBitwiseLogic()
1494   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldAndToXor()
1512   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldOrToXor()
1520   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldOrToXor()
1605     if (CountUses && !Op->hasOneUse())  in foldComplexAndOrPatterns()
1612       return !CountUses || X->hasOneUse();  in foldComplexAndOrPatterns()
1661     if (Opcode == Instruction::Or && Op0->hasOneUse() &&  in foldComplexAndOrPatterns()
1841       if (Op0->hasOneUse() && C->isPowerOf2() && (*AddC & (*C - 1)) == 0) {  in visitAnd()
2045         if (Op1->hasOneUse() || isFreeToInvert(C, C->hasOneUse()))  in visitAnd()
2051         if (Op0->hasOneUse() || isFreeToInvert(C, C->hasOneUse()))  in visitAnd()
2496       !(LHS->hasOneUse() || RHS->hasOneUse()))  in foldAndOrOfICmpEqZeroAndICmp()
2630       PredL == PredR && LHS->hasOneUse() && RHS->hasOneUse()) {  in foldAndOrOfICmps()
2669       (RHS->hasOneUse() || LHS->hasOneUse())) {  in foldAndOrOfICmps()
2836     if (Op0->hasOneUse() || Op1->hasOneUse()) {  in visitOr()
2902     if ((Op0->hasOneUse() || Op1->hasOneUse()) &&  in visitOr()
2906     if (Op1->hasOneUse() && match(A, m_Not(m_Specific(Op0)))) {  in visitOr()
2910     if (Op1->hasOneUse() && match(B, m_Not(m_Specific(Op0)))) {  in visitOr()
2921           Op1->hasOneUse() && (B->getOpcode() == Instruction::Or ||  in visitOr()
3010   if (Op0->hasOneUse() && !match(Op1, m_ConstantInt()) &&  in visitOr()
3022     if (Op0->hasOneUse() && Op1->hasOneUse() &&  in visitOr()
3063       (Ov->hasOneUse() || (MulIsNotZero->hasOneUse() && Mul->hasOneUse())) &&  in visitOr()
3163   if (!Op0->hasOneUse() && !Op1->hasOneUse())  in foldXorToXor()
3209       (LHS->hasOneUse() || RHS->hasOneUse())) {  in foldXorOfICmps()
3261       if (X && Y && (Y->hasOneUse() || canFreelyInvertAllUsersOf(Y, &I))) {  in foldXorOfICmps()
3265         if (!Y->hasOneUse()) {  in foldXorOfICmps()
3321   if (D->hasOneUse() && match(M, m_Constant(C))) {  in visitMaskedMerge()
3350   if (InstCombiner::isFreeToInvert(X, X->hasOneUse())) {  in sinkNotIntoXor()
3352   } else if (InstCombiner::isFreeToInvert(Y, Y->hasOneUse())) {  in sinkNotIntoXor()
3417   if (!InstCombiner::isFreeToInvert(Y, Y->hasOneUse()))  in sinkNotIntoOtherHandOfAndOrOr()
3481                          NotVal->getOperand(0)->hasOneUse()) &&  in foldNot()
3483                          NotVal->getOperand(1)->hasOneUse())) {  in foldNot()
3537       if (isa<Constant>(X) || NotVal->hasOneUse())  in foldNot()
3557   if (II && II->hasOneUse()) {  in foldNot()
3559         isFreeToInvert(X, X->hasOneUse()) &&  in foldNot()
3560         isFreeToInvert(Y, Y->hasOneUse())) {  in foldNot()
3575   if (NotOp->hasOneUse()) {  in foldNot()
3589       bool InvertibleT = (CmpT && CmpT->hasOneUse()) || isa<Constant>(TV);  in foldNot()
3590       bool InvertibleF = (CmpF && CmpF->hasOneUse()) || isa<Constant>(FV);  in foldNot()
3749         Op0->hasOneUse()) {  in visitXor()