Home
last modified time | relevance | path

Searched refs:hasOneUse (Results 1 – 25 of 175) sorted by relevance

1234567

/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DGuardUtils.cpp76 if (!Cond->hasOneUse()) in parseWidenableBranch()
102 A->hasOneUse()) { in parseWidenableBranch()
109 B->hasOneUse()) { in parseWidenableBranch()
157 if (!Condition->hasOneUse()) in extractWidenableCondition()
164 if (isWidenableCondition(Check) && Check->hasOneUse()) { in extractWidenableCondition()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSelect.cpp301 (!TI->hasOneUse() || !FI->hasOneUse())) in foldSelectOpOp()
303 } else if (!TI->hasOneUse() || !FI->hasOneUse()) { in foldSelectOpOp()
358 if (TI->hasOneUse() || FI->hasOneUse()) { in foldSelectOpOp()
444 !TI->hasOneUse() || !FI->hasOneUse()) in foldSelectOpOp()
776 (IC->hasOneUse() + BinOp->hasOneUse())) in foldSelectICmpAndBinOp()
1167 if (II->hasOneUse() && SelectArg->hasOneUse() && in foldSelectCttzCtlz()
1185 if (!Cmp.hasOneUse() && !RHS->hasOneUse()) in canonicalizeSPF()
2434 (Cond->hasOneUse() || TVal->hasOneUse() || FVal->hasOneUse())) in foldVectorSelect()
2443 (Cond->hasOneUse() || FVal->hasOneUse())) in foldVectorSelect()
3055 (CondVal->hasOneUse() || TrueVal->hasOneUse()) && in foldSelectOfBools()
[all …]
H A DInstCombineAndOrXor.cpp1107 if (!Cmp0->hasOneUse() || !Cmp1->hasOneUse()) in foldEqOfParts()
1406 if (LHS->hasOneUse() && RHS->hasOneUse()) { in foldLogicOfFCmps()
1778 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldAndToXor()
1796 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldOrToXor()
1804 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldOrToXor()
3117 !(LHS->hasOneUse() || RHS->hasOneUse())) in foldAndOrOfICmpEqConstantAndICmp()
3313 (RHS->hasOneUse() || LHS->hasOneUse())) { in foldAndOrOfICmps()
3486 if (Op0->hasOneUse() || Op1->hasOneUse()) { in visitOr()
3509 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitOr()
3776 (Ov->hasOneUse() || (MulIsNotZero->hasOneUse() && Mul->hasOneUse())) && in visitOr()
[all …]
H A DInstCombineVectorOps.cpp260 if (X->hasOneUse() && Ext.getVectorOperand()->hasOneUse()) { in foldBitcastExtElt()
296 if (!X->hasOneUse() || !Ext.getVectorOperand()->hasOneUse()) in foldBitcastExtElt()
1509 if (!Vec->hasOneUse()) in narrowInsElt()
1647 (VecOp->hasOneUse() || ScalarOp->hasOneUse()) && in visitInsertElementInst()
1685 if (!Insert.hasOneUse()) in visitInsertElementInst()
1764 if (!I->hasOneUse()) in canEvaluateShuffled()
2319 if (!B0->hasOneUse() && !B1->hasOneUse()) in foldSelectShuffle()
2465 (!S0->hasOneUse() && !S1->hasOneUse())) in foldShuffleOfUnaryOps()
2522 if (!Cast0->hasOneUse() && !Cast1->hasOneUse()) in foldCastShuffle()
2554 if (!Op0->hasOneUse()) in foldIdentityExtractShuffle()
[all …]
H A DInstCombineCompares.cpp3637 unsigned OneUses = IIOp0->hasOneUse() + IIOp1->hasOneUse(); in foldICmpIntrinsicWithIntrinsic()
4773 (BO0->hasOneUse() || BO1->hasOneUse()) && !I.isUnsigned()) { in foldICmpBinOp()
4927 (BO0->hasOneUse() || BO1->hasOneUse()) && in foldICmpBinOp()
5340 (Op0->hasOneUse() || Op1->hasOneUse())) { in foldICmpEquality()
5419 (I.getOperand(0)->hasOneUse() || I.getOperand(1)->hasOneUse())) { in foldICmpEquality()
6712 (LHS->hasOneUse() || RHS->hasOneUse())) in foldVectorCmp()
6732 V1Ty == V2->getType() && (LHS->hasOneUse() || RHS->hasOneUse())) { in foldVectorCmp()
7006 if (I.hasOneUse()) in visitICmpInst()
7082 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitICmpInst()
7171 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitICmpInst()
[all …]
H A DInstructionCombining.cpp673 if (!V && (LHS->hasOneUse() || RHS->hasOneUse())) in tryFactorization()
693 if (!V && (LHS->hasOneUse() || RHS->hasOneUse())) in tryFactorization()
1306 if (LHS->hasOneUse() && RHS->hasOneUse()) { in SimplifySelectsFeedingBinaryOp()
1571 if (!PN->hasOneUse()) { in foldOpIntoPhi()
1675 if (!Phi0 || !Phi1 || !Phi0->hasOneUse() || !Phi1->hasOneUse() || in foldBinopWithPhiOperands()
1799 !Src.hasOneUse()) in shouldMergeGEPs()
1822 LHS->hasOneUse() && RHS->hasOneUse() && in foldVectorBinop()
1856 (LHS->hasOneUse() || RHS->hasOneUse() || in foldVectorBinop()
1886 (LHS->hasOneUse() || RHS->hasOneUse() || LHS == RHS)) { in foldVectorBinop()
2072 (Op0->hasOneUse() || Op1->hasOneUse()))) { in narrowMathIfNoOverflow()
[all …]
H A DInstCombineAddSub.cpp758 if (!LHS->hasOneUse() && !RHS->hasOneUse()) in checkForNegativeOperand()
948 if (Op0->hasOneUse() && *C2 == -(*C)) { in foldAddWithConstant()
964 if (C->isOne() && Op0->hasOneUse()) { in foldAddWithConstant()
1377 if (!Op0 || !Op1 || !(Op0->hasOneUse() || Op1->hasOneUse())) in factorizeMathWithShlOps()
1536 (LHS->hasOneUse() || RHS->hasOneUse())) { in visitAdd()
1793 if (!Op0->hasOneUse() || !Op1->hasOneUse()) in factorizeFAddFSub()
1898 if (LHSConv->hasOneUse() && in visitFAdd()
1918 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitFAdd()
2087 (Op0->hasOneUse() || Op1->hasOneUse())) { in foldSubOfMinMax()
2403 (Op0->hasOneUse() || Op1->hasOneUse())) in visitSub()
[all …]
H A DInstCombineShifts.cpp203 !Trunc->hasOneUse()) in dropRedundantMaskingOfLeftShiftInput()
317 if (!Masked->hasOneUse()) in dropRedundantMaskingOfLeftShiftInput()
353 !BinInst->hasOneUse()) in foldShiftOfShiftedBinOp()
809 if (!Op0->hasOneUse()) in FoldShiftByConstant()
914 if (!Add->hasOneUse()) { in foldLShrOverflowBit()
937 if (!Add->hasOneUse()) { in foldLShrOverflowBit()
1285 if (Op0->hasOneUse()) { in visitLShr()
1301 if (Op0->hasOneUse()) { in visitLShr()
1349 Op0->hasOneUse()) { in visitLShr()
1428 if (Op0->hasOneUse()) { in visitLShr()
[all …]
H A DInstCombineCasts.cpp169 if (CSrc->hasOneUse()) in commonCastTransforms()
244 if (!V->hasOneUse()) in canNotEvaluateInType()
792 if (Src->hasOneUse()) { in visitTrunc()
810 if (Src->hasOneUse() && in visitTrunc()
1135 if (SrcOp->hasOneUse()) in visitZExt()
1239 if (Zext.hasOneUse() && in visitZExt()
1281 if (Cmp->hasOneUse() && in transformSExtICmp()
1452 if (Src->hasOneUse() && in visitSExt()
1682 if (BO && BO->hasOneUse()) { in visitFPTrunc()
1813 if (!Src->hasOneUse()) in visitFPTrunc()
[all …]
H A DInstCombineMulDivRem.cpp51 if (!V->hasOneUse()) return nullptr; in simplifyValueKnownNonZero()
258 if (Op0->hasOneUse() && match(Op1, m_NegatedPower2())) { in visitMul()
384 if (Div && Div->hasOneUse() && in visitMul()
429 (Op0->hasOneUse() || Op1->hasOneUse() || X == Y)) { in visitMul()
439 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitMul()
562 (Op0->hasOneUse() || Op1->hasOneUse())) { in foldFPSignBitOps()
875 if (SI->use_empty() && SelectCond->hasOneUse()) in simplifyDivRemOfSelectWithZeroOp()
970 if (IsSigned && HasNSW && (Op0->hasOneUse() || Op1->hasOneUse())) { in foldIDivShl()
1188 if (!IsSigned && Op1->hasOneUse() && in commonIDivTransforms()
1344 X->getType() == Y->getType() && (N->hasOneUse() || D->hasOneUse())) { in narrowUDivURem()
[all …]
H A DInstCombineCalls.cpp108 if (!Src->hasOneUse()) in hasUndefSource()
652 if (Op0->hasOneUse() && in foldCtpop()
1164 if (!MinMax2->hasOneUse() || !AddSub->hasOneUse()) in matchSAddSubSat()
1295 (!LHS->hasOneUse() && !RHS->hasOneUse())) in factorizeMinMaxTree()
1306 if (LHS->hasOneUse()) { in factorizeMinMaxTree()
1633 (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) { in visitCallInst()
1639 I0->hasOneUse()) { in visitCallInst()
1654 (I0->hasOneUse() || I1->hasOneUse()) && X->getType() == Y->getType()) { in visitCallInst()
1687 (I0->hasOneUse() || I1->hasOneUse())) { in visitCallInst()
1770 if (I0->hasOneUse() && !I1->hasOneUse()) in visitCallInst()
[all …]
H A DInstCombinePHI.cpp109 if (!PN.hasOneUse()) in foldIntegerTypedPHI()
180 if (!LoadI->hasOneUse()) in foldIntegerTypedPHI()
266 (LoadI && LoadI->hasOneUse())) && in foldIntegerTypedPHI()
980 if (!PN->hasOneUse()) return false; in isDeadPHICycle()
1160 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI()
1424 if (PN.hasOneUse()) { in visitPHINode()
1442 if (PHIUser->hasOneUse() && in visitPHINode()
1469 if (U->hasOneUse() && match(U, m_c_Or(m_Specific(&PN), m_Value()))) { in visitPHINode()
H A DInstCombineNegator.cpp153 if (!V->hasOneUse() && !IsTrulyNegation) in visitImpl()
230 (I->hasOneUse() || match(I->getOperand(0), m_ImmConstant()))) { in visitImpl()
241 if (!V->hasOneUse()) in visitImpl()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVMergeBaseOffset.cpp101 if (!MRI->hasOneUse(HiDestReg)) in INITIALIZE_PASS()
184 if (!Reg.isVirtual() || !MRI->hasOneUse(Reg)) in foldLargeOffset()
210 !MRI->hasOneUse(OffsetLui.getOperand(0).getReg())) in foldLargeOffset()
265 if (!Rs1.isVirtual() || !MRI->hasOneUse(Rs1)) in foldShiftedOffset()
302 if (!MRI->hasOneUse(DestReg)) in detectAndFoldOffset()
318 if (MRI->hasOneUse(TailDestReg)) { in detectAndFoldOffset()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp1407 N0->hasOneUse() && N1->hasOneUse() && in reassociateReduction()
2882 N0->hasOneUse() && N1->hasOneUse()) { in visitADDLike()
5781 if (!N0.hasOneUse() && !N1.hasOneUse()) in hoistLogicOpWithSameOpcodeHands()
5808 if (!N0.hasOneUse() && !N1.hasOneUse()) in hoistLogicOpWithSameOpcodeHands()
5832 if (!N0.hasOneUse() || !N1.hasOneUse()) in hoistLogicOpWithSameOpcodeHands()
5841 if (!N0.hasOneUse() || !N1.hasOneUse()) in hoistLogicOpWithSameOpcodeHands()
5852 if (!N0.hasOneUse() || !N1.hasOneUse()) in hoistLogicOpWithSameOpcodeHands()
6023 N0.hasOneUse() && N1.hasOneUse()) { in foldLogicOfSetCCs()
7410 if (!N0->hasOneUse() || !N1->hasOneUse()) in MatchBSwapHWordLow()
13023 if (!N0.hasOneUse() || !N1.hasOneUse()) in CombineZExtLogicopShiftLoad()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DRelLookupTableConverter.cpp33 !GV.hasOneUse()) in shouldConvertToRelLookupTable()
38 if (!GEP || !GEP->hasOneUse() || in shouldConvertToRelLookupTable()
43 if (!Load || !Load->hasOneUse() || in shouldConvertToRelLookupTable()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp174 if (BO && BO->hasOneUse() && in isReassociableOp()
542 if (!Op->hasOneUse()) { in LinearizeExprTree()
581 if (!Op->hasOneUse()) in LinearizeExprTree()
1082 if (Sub->hasOneUse() && in ShouldBreakUpSubtract()
1354 if (!Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1388 if (Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1390 if (Opnd2->getValue()->hasOneUse()) in CombineXorOpnd()
2234 (I->hasOneUse() && in OptimizeInst()
2293 (!I->hasOneUse() || in OptimizeInst()
2320 (!I->hasOneUse() || in OptimizeInst()
[all …]
H A DMergedLoadStoreMotion.cpp236 return GEP0 && GEP1 && GEP0->isIdenticalTo(GEP1) && GEP0->hasOneUse() && in canSinkStoresAndGEPs()
237 (GEP0->getParent() == S0->getParent()) && GEP1->hasOneUse() && in canSinkStoresAndGEPs()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86PartialReduction.cpp140 if (!isa<Constant>(LHS) && !LHS->hasOneUse()) in tryMAddReplacement()
142 if (!isa<Constant>(RHS) && !RHS->hasOneUse()) in tryMAddReplacement()
363 if (!BO || BO->getOpcode() != Instruction::Add || !BO->hasOneUse()) in matchAddReduction()
418 if (!Phi->hasOneUse()) in isReachableFromPHI()
425 while (U->hasOneUse() && U->getOpcode() == BO->getOpcode()) in isReachableFromPHI()
H A DX86ISelDAGToDAG.cpp630 if (!N.hasOneUse()) in IsProfitableToFold()
842 if (!Chain.hasOneUse()) in isCalleeLoad()
1993 !Shift.hasOneUse()) in foldMaskAndShiftToExtract()
2063 if (!N.hasOneUse() || !Shift.hasOneUse()) in foldMaskedShiftToScaledMask()
2225 !Shift.hasOneUse() || !N.hasOneUse()) in foldMaskedShiftToBEXTR()
2326 Src.hasOneUse()) { in matchIndexRecursively()
2355 Src.hasOneUse()) { in matchIndexRecursively()
3386 if (!Load.hasOneUse()) in isFusableLoadOpStorePattern()
4052 if (!N0->hasOneUse()) in matchBEXTRFromAndImm()
4603 if (!Op.hasOneUse()) in tryVPTERNLOG()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp487 if (I->hasOneUse() && in getArithmeticInstrCost()
500 if ((I->hasOneUse() && I->getOpcode() == Instruction::Xor) && in getArithmeticInstrCost()
822 if (Ld->hasOneUse()) in getCastInstrCost()
830 if (Ld->hasOneUse()) in getCastInstrCost()
977 if (!Ld->hasOneUse() && Ld->getParent() == I->getParent() && in getCmpSelInstrCost()
1070 if (!Ld->hasOneUse()) in isFoldableLoad()
1078 if (UserI->hasOneUse()) { in isFoldableLoad()
1211 if (Opcode == Instruction::Load && I->hasOneUse()) { in getMemoryOpCost()
1215 (!LdUser->hasOneUse() || !isa<StoreInst>(*LdUser->user_begin()))) in getMemoryOpCost()
1220 if (StoredVal->hasOneUse() && isBswapIntrinsicCall(StoredVal)) in getMemoryOpCost()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedAccessPass.cpp483 if (!SVI || !SVI->hasOneUse() || isa<ScalableVectorType>(SVI->getType())) in lowerInterleavedStore()
507 if (!LI || !LI->hasOneUse() || !LI->isSimple()) in lowerDeinterleaveIntrinsic()
524 if (!II->hasOneUse()) in lowerInterleaveIntrinsic()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULowerKernelAttributes.cpp109 if (!U->hasOneUse()) in processUse()
123 if (!BCI->hasOneUse()) in processUse()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVectorCombine.cpp139 if (!Load || !Load->isSimple() || !Load->hasOneUse() || in canWidenLoad()
161 !Scalar->hasOneUse()) in vectorizeLoadInsert()
445 : !Ext0->hasOneUse() || !Ext1->hasOneUse(); in isExtractExtractCheap()
453 !Ext0->hasOneUse() * Extract0Cost + in isExtractExtractCheap()
454 !Ext1->hasOneUse() * Extract1Cost; in isExtractExtractCheap()
588 if (I.hasOneUse()) in foldExtractExtract()
663 if (Extract->hasOneUse()) in foldInsExtFNeg()
821 (SplatCost * !Op0->hasOneUse()) + (SplatCost * !Op1->hasOneUse()); in scalarizeVPIntrinsic()
945 (IsConst0 ? 0 : !Ins0->hasOneUse() * InsertCost) + in scalarizeBinopOrCmp()
946 (IsConst1 ? 0 : !Ins1->hasOneUse() * InsertCost); in scalarizeBinopOrCmp()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DInstructionWorklist.h117 if (I->hasOneUse()) in handleUseCountDecrement()

1234567