Searched refs:hasOneUser (Results 1 – 15 of 15) sorted by relevance
61 if (!II->hasOneUser()) in BPFIRPeepholeImpl()73 if (!LD->hasOneUser()) in BPFIRPeepholeImpl()
370 if (!I || !I->hasOneUser() || I->getIndices() != FirstIVI->getIndices()) in foldPHIArgInsertValueInstructionIntoPHI()410 if (!I || !I->hasOneUser() || I->getIndices() != FirstEVI->getIndices() || in foldPHIArgExtractValueInstructionIntoPHI()452 if (!I || I->getOpcode() != Opc || !I->hasOneUser() || in foldPHIArgBinOpIntoPHI()554 if (!GEP || !GEP->hasOneUser() || in foldPHIArgGEPIntoPHI()732 if (!LI || !LI->hasOneUser() || LI->isAtomic()) in foldPHIArgLoadIntoPHI()838 if (Zext->getSrcTy() != NarrowType || !Zext->hasOneUser()) in foldPHIArgZextsIntoPHI()933 if (!I || !I->hasOneUser() || !I->isSameOperationAs(FirstInst)) in foldPHIArgOpIntoPHI()1454 Inst0->hasOneUser()) in visitPHINode()
1883 if (!InVal->hasUseList() || !InVal->hasOneUser()) in foldOpIntoPhi()
100 if (I && I->hasOneUser()) { in getCastInstrCost()
621 return U != I && !(U->hasOneUser() && *U->users().begin() == I); in tryReassociateMinOrMax()
1338 while (isa<PHINode>(UI) && UI->hasOneUser() && in isNotUsedOrFoldableInLoop()
457 LLVM_ABI bool hasOneUser() const;
669 if (CI->hasOneUser()) { in getMemCmpOneBlock()
166 bool Value::hasOneUser() const { in hasOneUser() function in Value
375 return any_of(operands(), [](const Value *V) { return V->hasOneUser(); }); in isOnlyUserOfAnyOperand()
1404 if (GEP->hasOneUser() && I) in getInstructionCost()
569 if (!OpInst || !OpInst->hasOneUser() || OpInst->getParent() != II.getParent()) in hoistLaneIntrinsicThroughOperand()
3052 if (I && I->hasOneUser()) { in getCastInstrCost()
5349 if (!RetI->hasOneUser()) in getReductionPatternCost()
3305 OpI && !DeletedInstructions.contains(OpI) && OpI->hasOneUser() && in removeInstructionsAndOperands()5280 if (Op && !DeletedInstructions.count(Op) && Op->hasOneUser() && in ~BoUpSLP()10140 else if (!I->hasOneUser() && !areAllUsersVectorized(I, UserIgnoreList)) in getScalarsVectorizationLegality()