100     if (!OldLHS->hasOneUse() && !OldRHS->hasOneUse())  in SimplifyBSwap()
105     if (!OldLHS->hasOneUse())  in SimplifyBSwap()
1013       (ZeroICmp->hasOneUse() || UnsignedICmp->hasOneUse())) {  in foldUnsignedUnderflowCheck()
1118   if (!Cmp0->hasOneUse() || !Cmp1->hasOneUse())  in foldEqOfParts()
1198     if (!Cmp1->hasOneUse())  in foldAndOrOfICmpsWithConstEq()
1290   if (PredL == ICmpInst::ICMP_EQ && PredL == PredR && LHS->hasOneUse() &&  in foldAndOfICmps()
1291       RHS->hasOneUse()) {  in foldAndOfICmps()
1542       !InstCombiner::isFreeToInvert(A, A->hasOneUse()) &&  in matchDeMorgansLaws()
1543       !InstCombiner::isFreeToInvert(B, B->hasOneUse())) {  in matchDeMorgansLaws()
1691   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldAndToXor()
1709   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldOrToXor()
1717   if (Op0->hasOneUse() || Op1->hasOneUse())  in foldOrToXor()
1893       if (Op0->hasOneUse() && C->isPowerOf2() && (*AddC & (*C - 1)) == 0) {  in visitAnd()
2001         if (Op1->hasOneUse() || isFreeToInvert(C, C->hasOneUse()))  in visitAnd()
2007         if (Op0->hasOneUse() || isFreeToInvert(C, C->hasOneUse()))  in visitAnd()
2391       PredL == PredR && LHSC && RHSC && LHS->hasOneUse() && RHS->hasOneUse() &&  in foldOrOfICmps()
2447   if (LHS->hasOneUse() || RHS->hasOneUse()) {  in foldOrOfICmps()
2756     if (Op0->hasOneUse() || Op1->hasOneUse()) {  in visitOr()
2812     if (Op1->hasOneUse() && match(A, m_Not(m_Specific(Op0)))) {  in visitOr()
2816     if (Op1->hasOneUse() && match(B, m_Not(m_Specific(Op0)))) {  in visitOr()
2827           Op1->hasOneUse() && (B->getOpcode() == Instruction::Or ||  in visitOr()
2891   if (Op0->hasOneUse() && !match(Op1, m_ConstantInt()) &&  in visitOr()
2903     if (Op0->hasOneUse() && Op1->hasOneUse() &&  in visitOr()
2945       (Ov->hasOneUse() || (MulIsNotZero->hasOneUse() && Mul->hasOneUse())) &&  in visitOr()
3016   if (!Op0->hasOneUse() && !Op1->hasOneUse())  in foldXorToXor()
3058   if ((LHS->hasOneUse() || RHS->hasOneUse()) &&  in foldXorOfICmps()
3103       if (X && Y && (Y->hasOneUse() || canFreelyInvertAllUsersOf(Y, &I))) {  in foldXorOfICmps()
3107         if (!Y->hasOneUse()) {  in foldXorOfICmps()
3163   if (D->hasOneUse() && match(M, m_Constant(C))) {  in visitMaskedMerge()
3192   if (InstCombiner::isFreeToInvert(X, X->hasOneUse())) {  in sinkNotIntoXor()
3194   } else if (InstCombiner::isFreeToInvert(Y, Y->hasOneUse())) {  in sinkNotIntoXor()
3259   if (!InstCombiner::isFreeToInvert(Y, Y->hasOneUse()))  in sinkNotIntoOtherHandOfAndOrOr()
3349                          NotVal->getOperand(0)->hasOneUse()) &&  in visitXor()
3351                          NotVal->getOperand(1)->hasOneUse())) {  in visitXor()
3405       if (isa<Constant>(X) || NotVal->hasOneUse())  in visitXor()
3483         Op0->hasOneUse()) {  in visitXor()
3606   if (match(Op1, m_AllOnes()) && Op0->hasOneUse()) {  in visitXor()
3612       if (match(LHS, m_Not(m_Value(X))) && !isFreeToInvert(X, X->hasOneUse())) {  in visitXor()
3620       if (match(RHS, m_Not(m_Value(Y))) && !isFreeToInvert(Y, Y->hasOneUse())) {  in visitXor()
3651       bool InvertibleT = (CmpT && CmpT->hasOneUse()) || isa<Constant>(TV);  in visitXor()
3652       bool InvertibleF = (CmpF && CmpF->hasOneUse()) || isa<Constant>(FV);  in visitXor()