Searched refs:hasNUses (Results 1 – 19 of 19) sorted by relevance
137 if (!isa<Constant>(LHS) && !LHS->hasNUses(2)) in tryMAddReplacement()384 if (i != 0 && !BO->hasNUses(2)) in matchAddReduction()448 if (!PN->hasNUses(PN == Root ? 2 : 1)) in collectLeaves()460 if (BO->hasNUses(BO == Root ? 2 : 1)) { in collectLeaves()467 if (BO->hasNUses(BO == Root ? 3 : 2)) { in collectLeaves()491 if (!V->hasNUses(I == Root ? 2 : 1)) in collectLeaves()
1209 if (!isCorrectOpcode(RdxInstr) || !LoopExitInstr->hasNUses(2)) in getReductionOpChain()1214 if (!Phi->hasNUses(ExpectedUses + ExtraPhiUses)) in getReductionOpChain()1222 if (!Cur || !isCorrectOpcode(Cur) || !Cur->hasNUses(ExpectedUses)) in getReductionOpChain()
452 if ((Compare->getOperand(0) != Increment || !Increment->hasNUses(2)) && in findLoopComponents()453 !Increment->hasNUses(1)) { in findLoopComponents()
1849 if (LoadOp0->hasNUses(0)) { in emitSIMDTiling()1853 if (LoadOp1 != LoadOp0 && LoadOp1->hasNUses(0)) { in emitSIMDTiling()
948 if (I->hasNUses(0)) { in hasAllGatScatUsers()1103 if (Offs->hasNUses(0)) in optimiseOffsets()1107 if (IncInstruction->hasNUses(0)) in optimiseOffsets()
372 if (Inst->hasNUses(2) && in isSSATMinMaxPattern()
461 if (I->hasNUses(0)) in bypassSlowDivision()
1602 Arg.hasNUses(0)) in AddAlignmentAssumptions()2078 !II->hasNUses(0) || in inlineRetainOrClaimRVCalls()
2085 if (ExpandInst->hasNUses(0) && in createWideIV()
3111 if (Inst->hasNUses(Count)) { in SpeculativelyExecuteBB()4295 if (!QBI->getParent()->hasNUses(2)) in mergeConditionalStores()
437 bool hasNUses(unsigned N) const;
257 bool hasNUses(unsigned Num) const { in hasNUses() function
149 bool Value::hasNUses(unsigned N) const { in hasNUses() function in Value
4314 if (Op0->hasNUses(2)) in canonicalizeAbs()4321 Op1->hasNUses(2) && *ShAmt == Ty->getScalarSizeInBits() - 1 && in canonicalizeAbs()
777 if (I.hasNoNaNs() && I.hasNoSignedZeros() && Op0 == Op1 && Op0->hasNUses(2)) { in foldFMulReassoc()
2568 Op1->hasNUses(2) && *ShAmt == BitWidth - 1 && in visitSub()
2064 (LHS == RHS && LHS->hasNUses(2)))) in foldVectorBinop()
457 bool HasUseTax = Ext0 == Ext1 ? !Ext0->hasNUses(2) in isExtractExtractCheap()
7525 if (!LI || !LI->isSimple() || !LI->hasNUses(VL.size())) in canReuseExtract()16938 return Sel->hasNUses(2) && Sel->getCondition()->hasOneUse(); in hasRequiredNumberOfUses()16939 return I->hasNUses(2); in hasRequiredNumberOfUses()