Lines Matching refs:hasOneUse

108     if (!Src->hasOneUse())  in hasUndefSource()
112   return isa<AllocaInst>(Src) && Src->hasOneUse();  in hasUndefSource()
508   if (II.hasOneUse() && match(Op1, m_Zero()) &&  in foldCttzCtlz()
651   if (Op0->hasOneUse() &&  in foldCtpop()
1154   if (!MinMax2->hasOneUse() || !AddSub->hasOneUse())  in matchSAddSubSat()
1192   if (!match(I1, m_APInt(C1)) || !I0->hasOneUse())  in foldClampRangeOfTwo()
1296       (!LHS->hasOneUse() && !RHS->hasOneUse()))  in factorizeMinMaxTree()
1307   if (LHS->hasOneUse()) {  in factorizeMinMaxTree()
1322     assert(RHS->hasOneUse() && "Expected one-use operand");  in factorizeMinMaxTree()
1373   if (none_of(II->args(), [](Value *V) { return V->hasOneUse(); }))  in foldShuffledIntrinsicOperands()
1719         (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) {  in visitCallInst()
1725         I0->hasOneUse()) {  in visitCallInst()
1740         (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) {  in visitCallInst()
1747         I0->hasOneUse()) {  in visitCallInst()
1773           (I0->hasOneUse() || I1->hasOneUse())) {  in visitCallInst()
1830           !isFreeToInvert(A, A->hasOneUse())) {  in visitCallInst()
1831         if (Value *NotY = getFreelyInverted(Y, Y->hasOneUse(), &Builder)) {  in visitCallInst()
1863       if (I0->hasOneUse() && !I1->hasOneUse())  in visitCallInst()
2318         (Arg0->hasOneUse() || Arg1->hasOneUse())) {  in visitCallInst()
2398         return Op0->hasOneUse() ||  in visitCallInst()
2441     if (!NegatedOp->hasOneUse())  in visitCallInst()
3697       (!Underlying->hasOneUse() || Underlying->user_back() != TrampMem))  in findInitTrampolineFromAlloca()