Searched refs:hasNUsesOrMore (Results 1 – 14 of 14) sorted by relevance
155 } while (CE->hasNUsesOrMore(1)); // We need to check because a recursive in replaceConstantExprOp()
1632 ElidesXor |= !V->hasNUsesOrMore(3); in foldSPFofSPF()1636 if (isFreeToInvert(V, !V->hasNUsesOrMore(3))) { in foldSPFofSPF()2183 if (MinMax2->hasNUsesOrMore(3) || AddSub->hasNUsesOrMore(3)) in matchSAddSubSat()2236 if (!LHS->hasNUsesOrMore(3) && RHS->hasNUsesOrMore(3)) { in factorizeMinMaxTree()2250 } else if (!RHS->hasNUsesOrMore(3)) { in factorizeMinMaxTree()2596 if (match(X, m_Not(m_Value(A))) && !X->hasNUsesOrMore(3) && in visitSelectInst()
2045 if (isFreeToInvert(LHS, !LHS->hasNUsesOrMore(3)) && in visitSub()2046 !NotA->hasNUsesOrMore(4)) { in visitSub()
1697 if (!match(Op1, m_ZExt(m_Value(X))) || Op1->hasNUsesOrMore(3)) in narrowMaskedBinOp()3273 if (isFreeToInvert(LHS, !LHS->hasNUsesOrMore(3)) && in visitXor()3274 isFreeToInvert(RHS, !RHS->hasNUsesOrMore(3))) { in visitXor()
4599 if (MulVal->hasNUsesOrMore(2)) in processUMulZExtIdiom()4727 if (MulVal->hasNUsesOrMore(2)) { in processUMulZExtIdiom()
310 assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs. in removePredecessor()
136 bool Value::hasNUsesOrMore(unsigned N) const { in hasNUsesOrMore() function in Value
440 if (I->hasNUsesOrMore(1)) in Cleanup()
394 bool hasNUsesOrMore(unsigned N) const;
1235 if (PHI->hasNUsesOrMore(1)) in performFusion()1487 if (PHI->hasNUsesOrMore(1)) in fuseGuardedLoops()
858 if (I->hasNUsesOrMore(IL_MaxRerollIterations + 1)) in findRootsRecursive()
445 bool hasNUsesOrMore(unsigned N) const;
442 if (STy->getNumElements() > 16 && GV->hasNUsesOrMore(16)) in CanDoGlobalSRA()2726 return V.hasNUsesOrMore(N); in hasMoreThanOneUseOtherThanLLVMUsed()
6334 if (!I->hasNUsesOrMore(1)) { in tryToSinkFreeOperands()