113     if (!Src->hasOneUse())  in hasUndefSource()
117   return isa<AllocaInst>(Src) && Src->hasOneUse();  in hasUndefSource()
629   if (Op0->hasOneUse() &&  in foldCtpop()
902   if (!MinMax2->hasOneUse() || !AddSub->hasOneUse())  in matchSAddSubSat()
940   if (!match(I1, m_APInt(C1)) || !I0->hasOneUse())  in foldClampRangeOfTwo()
1034       (!LHS->hasOneUse() && !RHS->hasOneUse()))  in factorizeMinMaxTree()
1045   if (LHS->hasOneUse()) {  in factorizeMinMaxTree()
1060     assert(RHS->hasOneUse() && "Expected one-use operand");  in factorizeMinMaxTree()
1111   if (none_of(II->args(), [](Value *V) { return V->hasOneUse(); }))  in foldShuffledIntrinsicOperands()
1310         (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) {  in visitCallInst()
1316         I0->hasOneUse()) {  in visitCallInst()
1332         (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) {  in visitCallInst()
1339         I0->hasOneUse()) {  in visitCallInst()
1352           (I0->hasOneUse() || I1->hasOneUse())) {  in visitCallInst()
1369           !isFreeToInvert(A, A->hasOneUse()) &&  in visitCallInst()
1370           isFreeToInvert(Y, Y->hasOneUse())) {  in visitCallInst()
1395       if (I0->hasOneUse() && !I1->hasOneUse())  in visitCallInst()
1746         (Arg0->hasOneUse() || Arg1->hasOneUse())) {  in visitCallInst()
2808       (!Underlying->hasOneUse() || Underlying->user_back() != TrampMem))  in findInitTrampolineFromAlloca()