471     InstQuota = ((!isa<Constant>(V0) && V0->hasOneUse()) &&  in simplify()
472                  (!isa<Constant>(V1) && V1->hasOneUse())) ? 2 : 1;  in simplify()
759   if (!LHS->hasOneUse() && !RHS->hasOneUse())  in checkForNegativeOperand()
936     if (Op0->hasOneUse() && *C2 == -(*C)) {  in foldAddWithConstant()
952   if (C->isOne() && Op0->hasOneUse()) {  in foldAddWithConstant()
1247   if (!Op0 || !Op1 || !(Op0->hasOneUse() || Op1->hasOneUse()))  in factorizeMathWithShlOps()
1352         (LHS->hasOneUse() || RHS->hasOneUse())) {  in visitAdd()
1391     if (SI && SI->hasOneUse()) {  in visitAdd()
1497   if (!Op0->hasOneUse() || !Op1->hasOneUse())  in factorizeFAddFSub()
1602         if (LHSConv->hasOneUse() &&  in visitFAdd()
1621             (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&  in visitFAdd()
1723         ((NumNonConstantIndices1 > 0 && !GEP1->hasOneUse()) ||  in OptimizePointerDifference()
1724          (NumNonConstantIndices2 > 0 && !GEP2->hasOneUse()))) {  in OptimizePointerDifference()
1768       (Op0->hasOneUse() || Op1->hasOneUse())) {  in foldSubOfMinMax()
1917   if (isFreeToInvert(Op0, Op0->hasOneUse()) &&  in visitSub()
1918       isFreeToInvert(Op1, Op1->hasOneUse()) &&  in visitSub()
2018         (Op0->hasOneUse() || Op1->hasOneUse()))  in visitSub()
2035         (Op0->hasOneUse() || Op1->hasOneUse()))  in visitSub()
2120       (Op1->hasOneUse() || isa<Constant>(Y)))  in visitSub()
2133       !Op0->hasNUsesOrMore(3) && isFreeToInvert(Y, Y->hasOneUse())) {  in visitSub()
2139       !Op1->hasNUsesOrMore(3) && isFreeToInvert(Y, Y->hasOneUse())) {  in visitSub()