Searched refs:hasNUsesOrMore (Results 1 – 15 of 15) sorted by relevance
107 } while (CE->hasNUsesOrMore(1)); // We need to check because a recursive in replaceConstantExprOp()
616 if (LHS->hasNUsesOrMore(3) || in tryReassociateMinOrMax()
1665 if (PHI->hasNUsesOrMore(1)) in performFusion()1948 if (PHI->hasNUsesOrMore(1)) in fuseGuardedLoops()
436 Compare->hasNUsesOrMore(2)) { in findLoopComponents()
442 bool hasNUsesOrMore(unsigned N) const;501 /// hasNUsesOrMore to check for specific values.
517 assert((hasNUsesOrMore(16) || llvm::is_contained(predecessors(this), Pred)) && in removePredecessor()
153 bool Value::hasNUsesOrMore(unsigned N) const { in hasNUsesOrMore() function in Value
248 bool hasNUsesOrMore(unsigned Num) const { in hasNUsesOrMore() function
195 if (Exit != ExactFPMathInst || Exit->hasNUsesOrMore(3)) in checkOrderedReduction()
359 !BO->hasNUsesOrMore(UsesLimit) && in isCommutative() 378 !BO->hasNUsesOrMore(UsesLimit) && in isCommutative() 1091 return !I->mayReadOrWriteMemory() && !I->hasNUsesOrMore(UsesLimit) && in isUsedOutsideBlock() 1470 if (V1->hasNUsesOrMore(UsesLimit) || V2->hasNUsesOrMore(UsesLimit)) in getShallowScore() 5895 if (U && Scalar->hasNUsesOrMore(UsesLimit)) in buildExternalUses() 5916 if (V->hasNUsesOrMore(UsesLimit)) in collectUserStores() 6273 return P.first->hasNUsesOrMore(P.second + 1) && in areAltOperandsProfitable() 10159 !V->hasNUsesOrMore(UsesLimit) && in isTreeTinyAndNotFullyVectorizable() 13945 Scalar->hasNUsesOrMore(UsesLimi in vectorizeTree() [all...]
1515 if (!PN.hasNUsesOrMore(3)) { in visitPHINode()
2531 !Op0->hasNUsesOrMore(3) && isFreeToInvert(Y, Y->hasOneUse())) { in visitSub()2537 !Op1->hasNUsesOrMore(3) && isFreeToInvert(Y, Y->hasOneUse())) { in visitSub()
4796 IC.getFreelyInverted(Op1, !Op1->hasNUsesOrMore(3), &IC.Builder)) in foldICmpAndXX()4855 IC.getFreelyInverted(Op1, !Op1->hasNUsesOrMore(3), &IC.Builder)) in foldICmpOrXX()6181 if (MulVal->hasNUsesOrMore(2)) in processUMulZExtIdiom()6254 if (MulVal->hasNUsesOrMore(2)) { in processUMulZExtIdiom()
1926 if (!match(Op1, m_ZExt(m_Value(X))) || Op1->hasNUsesOrMore(3)) in narrowMaskedBinOp()
1679 Add->hasNUsesOrMore(EdgeCase ? 1 : 2))) in combineToUAddWithOverflow()1748 Sub->hasNUsesOrMore(1))) in combineToUSubWithOverflow()7413 if (!I->hasNUsesOrMore(1)) { in tryToSinkFreeOperands()