Home
last modified time | relevance | path

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

1234

/external/llvm/lib/Transforms/InstCombine/
DInstCombineAndOrXor.cpp30 if (!IsFreeToInvert(Operand, Operand->hasOneUse())) in dyn_castNotVal()
171 if (Op->hasOneUse()) { in OptAndOp()
179 if (Op->hasOneUse()){ in OptAndOp()
201 if (Op->hasOneUse()) { in OptAndOp()
277 if (Op->hasOneUse()) { in OptAndOp()
937 LHS->hasOneUse() && RHS->hasOneUse()) { in FoldAndOfICmps()
1239 if (!Op0I->hasOneUse()) break; in visitAnd()
1277 if (Op0I->hasOneUse() && !match(Op0LHS, m_Zero())) { in visitAnd()
1335 if (Op0->hasOneUse() && Op1->hasOneUse()) { in visitAnd()
1359 if (Op0->hasOneUse() && in visitAnd()
[all …]
DInstCombineCompares.cpp658 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) && in FoldGEPICmp()
659 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) && in FoldGEPICmp()
729 if (GEPsInBounds && (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) && in FoldGEPICmp()
730 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) { in FoldGEPICmp()
1018 if (Shr->hasOneUse() && Shr->isExact()) in FoldICmpShrCst()
1021 if (Shr->hasOneUse()) { in FoldICmpShrCst()
1148 if (ICI.isEquality() && LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1197 if (LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1234 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) && in visitICmpInstWithInstAndIntCst()
1235 LHSI->getOperand(0)->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
[all …]
DInstCombinePHI.cpp47 if (!I || I->getOpcode() != Opc || !I->hasOneUse() || in FoldPHIArgBinOpIntoPHI()
150 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || in FoldPHIArgGEPIntoPHI()
320 if (!LI || !LI->hasOneUse()) in FoldPHIArgLoadIntoPHI()
437 if (!I || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) in FoldPHIArgOpIntoPHI()
511 if (!PN->hasOneUse()) return false; in DeadPHICycle()
670 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI()
802 PN.getIncomingValue(0)->hasOneUse()) in visitPHINode()
809 if (PN.hasOneUse()) { in visitPHINode()
824 if (PHIUser->hasOneUse() && in visitPHINode()
DInstCombineCasts.cpp100 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return nullptr; in PromoteCastOfAllocation()
110 if (!AI.hasOneUse() && CastElTyStoreSize < AllocElTyStoreSize) return nullptr; in PromoteCastOfAllocation()
148 if (!AI.hasOneUse()) { in PromoteCastOfAllocation()
351 if (!I->hasOneUse()) return false; in CanEvaluateTruncated()
472 if (Src->hasOneUse() && in visitTrunc()
495 if (Src->hasOneUse() && isa<IntegerType>(Src->getType()) && in visitTrunc()
665 if (!I->hasOneUse()) return false; in CanEvaluateZExtd()
760 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back())) in visitZExt()
854 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() && in visitZExt()
881 if (SrcI && SrcI->hasOneUse() && in visitZExt()
[all …]
DInstCombineAddSub.cpp560 InstQuota = ((!isa<Constant>(V0) && V0->hasOneUse()) && in simplify()
561 (!isa<Constant>(V1) && V1->hasOneUse())) ? 2 : 1; in simplify()
1000 if (!LHS->hasOneUse() && !RHS->hasOneUse()) in checkForNegativeOperand()
1109 if (LHS->hasOneUse() && (XorRHS->getValue()+1).isPowerOf2()) { in visitAdd()
1188 if (LHS->hasOneUse() && in visitAdd()
1222 if (SI && SI->hasOneUse()) { in visitAdd()
1246 if (LHSConv->hasOneUse() && in visitAdd()
1263 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitAdd()
1375 if (LHSConv->hasOneUse() && in visitFAdd()
1392 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitFAdd()
[all …]
DInstCombineVectorOps.cpp47 if (I->getOpcode() == Instruction::Load && I->hasOneUse()) in CheapToScalarize()
50 if (BO->hasOneUse() && in CheapToScalarize()
55 if (CI->hasOneUse() && in CheapToScalarize()
132 if (!PHIUser->hasOneUse() || !(PHIUser->user_back() == PN) || in scalarizePHI()
201 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) { in visitExtractElementInst()
238 if (I->hasOneUse() && in visitExtractElementInst()
284 if (CI->hasOneUse() && (CI->getOpcode() != Instruction::BitCast)) { in visitExtractElementInst()
291 if (SI->hasOneUse()) { in visitExtractElementInst()
511 while (V->hasOneUse() && Depth < 10) { in visitInsertValueInst()
562 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.user_back())) { in visitInsertElementInst()
[all …]
DInstructionCombining.cpp293 Op0->hasOneUse() && Op1->hasOneUse()) { in SimplifyAssociativeOrCommutative()
474 if (!V && LHS->hasOneUse() && RHS->hasOneUse()) in tryFactorization()
494 if (!V && LHS->hasOneUse() && RHS->hasOneUse()) in tryFactorization()
696 if (!SI->hasOneUse()) return nullptr; in FoldOpIntoSelect()
740 if (!PN->hasOneUse()) { in FoldOpIntoPhi()
935 !Src.hasOneUse()) in shouldMergeGEPs()
1029 if (!Op->hasOneUse()) in Descale()
1038 if (!Op->hasOneUse()) in Descale()
1063 if (Amt < logScale || !Op->hasOneUse()) in Descale()
1074 if (!Op->hasOneUse()) in Descale()
[all …]
DInstCombineShifts.cpp46 if (Op1->hasOneUse() && match(Op1, m_SRem(m_Value(A), m_Power2(B)))) { in commonShiftTransforms()
106 if (!I->hasOneUse()) return false; in CanEvaluateShifted()
413 if (Op0->hasOneUse()) { in FoldShiftByConstant()
426 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() && in FoldShiftByConstant()
445 if (isLeftShift && Op0BOOp1->hasOneUse() && in FoldShiftByConstant()
462 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant()
480 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant()
DInstCombineSelect.cpp240 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && in FoldSelectIntoOp()
275 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && in FoldSelectIntoOp()
511 if (ICI->hasOneUse()) in visitSelectInstWithICmp()
1014 if (FCI->hasOneUse() && FCmpInst::isUnordered(FCI->getPredicate())) { in visitSelectInst()
1055 if (FCI->hasOneUse() && FCmpInst::isUnordered(FCI->getPredicate())) { in visitSelectInst()
1076 if (TI->hasOneUse() && FI->hasOneUse()) { in visitSelectInst()
1178 (SI.hasOneUse() && match(*SI.user_begin(), m_Not(m_Value()))); in visitSelectInst()
1217 if (TrueSI->getFalseValue() == FalseVal && TrueSI->hasOneUse()) { in visitSelectInst()
1235 if (FalseSI->getTrueValue() == TrueVal && FalseSI->hasOneUse()) { in visitSelectInst()
DInstCombineMulDivRem.cpp33 if (!V->hasOneUse()) return nullptr; in simplifyValueKnownNonZero()
241 if (Op0->hasOneUse()) { in visitMul()
305 if (BO && BO->hasOneUse() && in visitMul()
395 if (!Op->hasOneUse()) in detectLog2OfHalf()
406 if (!OpLog2Of->hasOneUse()) in detectLog2OfHalf()
495 if (FMulOrDiv->hasOneUse()) { in foldFMulConst()
656 if (Opnd0->hasOneUse()) { in visitFMul()
675 if (Opnd0->hasOneUse() && in visitFMul()
735 if (SI->use_empty() && SelectCond->hasOneUse()) in SimplifyDivRemOfSelect()
1296 if (Op0->hasOneUse() && match(Op0, m_FDiv(m_Value(X), m_Value(Y)))) { in visitFDiv()
[all …]
DInstCombineLoadStoreAlloca.cpp485 if (LI.hasOneUse()) in combineLoadToOperationType()
740 if (Op->hasOneUse()) { in visitLoadInst()
912 if (Ptr->hasOneUse()) { in visitStoreInst()
917 if (GEP->getOperand(0)->hasOneUse()) in visitStoreInst()
DInstCombineSimplifyDemanded.cpp166 if (Depth != 0 && !I->hasOneUse()) { in SimplifyDemandedUseBits()
246 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits()
396 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() && in SimplifyDemandedUseBits()
928 if (!Shr->hasOneUse()) in SimplifyShrShlDemandedBits()
1021 if (!V->hasOneUse()) { in SimplifyDemandedVectorElts()
/external/llvm/lib/Transforms/Scalar/
DReassociate.cpp239 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp()
249 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp()
635 if (!Op->hasOneUse()) { in LinearizeExprTree()
654 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); in LinearizeExprTree()
672 if (!Op->hasOneUse()) in LinearizeExprTree()
689 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); in LinearizeExprTree()
1010 if (Sub->hasOneUse() && in ShouldBreakUpSubtract()
1284 if (!Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1320 if (Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1322 if (Opnd2->getValue()->hasOneUse()) in CombineXorOpnd()
[all …]
DMergedLoadStoreMotion.cpp341 A0->hasOneUse() && (A0->getParent() == L0->getParent()) && in hoistLoad()
342 A1->hasOneUse() && (A1->getParent() == L1->getParent()) && in hoistLoad()
481 if (A0 && A1 && A0->isIdenticalTo(A1) && A0->hasOneUse() && in sinkStore()
482 (A0->getParent() == S0->getParent()) && A1->hasOneUse() && in sinkStore()
DNaryReassociate.cpp214 if (LHS->hasOneUse() && match(LHS, m_Add(m_Value(A), m_Value(B)))) { in tryReassociateAdd()
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp505 if (Op->hasOneUse() || Op->getNumValues() > 1) in deleteAndRecombine()
522 if (!Op.hasOneUse()) return 0; in isNegatibleForFree()
584 assert(Op.hasOneUse() && "Unknown reuse!"); in GetNegatedExpression()
688 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
778 if (N0.hasOneUse()) { in ReassociateOps()
798 if (N1.hasOneUse()) { in ReassociateOps()
1514 if (Op.hasOneUse() && in visitTokenFactor()
2056 N0.getNode()->hasOneUse()) { in visitMUL()
2060 N1.getNode()->hasOneUse()) { in visitMUL()
2073 if (N1IsConst && N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse() && in visitMUL()
[all …]
DTargetLowering.cpp339 if (!Op.getNode()->hasOneUse()) in ShrinkDemandedOp()
391 if (!Op.getNode()->hasOneUse()) { in SimplifyDemandedBits()
664 if (InOp.hasOneUse() && in SimplifyDemandedBits()
666 InnerOp.hasOneUse() && in SimplifyDemandedBits()
978 if (Op.getOperand(0).getNode()->hasOneUse()) { in SimplifyDemandedBits()
1273 if (N0.hasOneUse() && N0.getOpcode() == ISD::TRUNCATE) in SimplifySetCC()
1276 if (CTPOP.hasOneUse() && CTPOP.getOpcode() == ISD::CTPOP && in SimplifySetCC()
1298 DCI.isBeforeLegalize() && N0->hasOneUse()) { in SimplifySetCC()
1355 N0.getNode()->hasOneUse() && in SimplifySetCC()
1357 N0.getOperand(0).getNode()->hasOneUse() && in SimplifySetCC()
[all …]
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp316 if (!N.hasOneUse()) in IsProfitableToFold()
417 if (Callee.getNode() == Chain.getNode() || !Callee.hasOneUse()) in isCalleeLoad()
428 if (!Chain.hasOneUse()) in isCalleeLoad()
444 Callee.getValue(1).hasOneUse()) in isCalleeLoad()
794 !Shift.hasOneUse()) in FoldMaskAndShiftToExtract()
842 if (!N.hasOneUse() || !Shift.hasOneUse()) in FoldMaskedShiftToScaledMask()
902 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse() || in FoldMaskAndShiftToScale()
1127 if (MulVal.getNode()->getOpcode() == ISD::ADD && MulVal.hasOneUse() && in MatchAddressRecursively()
1174 if (!RHS.getNode()->hasOneUse() || in MatchAddressRecursively()
1185 !AM.Base_Reg.getNode()->hasOneUse()) || in MatchAddressRecursively()
[all …]
/external/llvm/lib/Target/AArch64/
DAArch64AddressTypePromotion.cpp184 (Inst->getType() == ConsideredSExtType || Inst->hasOneUse())) in shouldGetThrough()
189 if (!Inst->hasOneUse()) in shouldGetThrough()
DAArch64FastISel.cpp273 if (LI->hasOneUse()) in isIntExtFree()
1115 if (UseAdd && LHS->hasOneUse() && isValueAvailable(LHS)) in emitAddSub()
1120 if (UseAdd && LHS->hasOneUse() && isValueAvailable(LHS)) in emitAddSub()
1154 if (ExtendType != AArch64_AM::InvalidShiftExtend && RHS->hasOneUse() && in emitAddSub()
1176 if (RHS->hasOneUse() && isValueAvailable(RHS)) in emitAddSub()
1196 if (RHS->hasOneUse() && isValueAvailable(RHS)) in emitAddSub()
1516 if (LHS->hasOneUse() && isValueAvailable(LHS)) in emitLogicalOp()
1521 if (LHS->hasOneUse() && isValueAvailable(LHS)) in emitLogicalOp()
1540 if (RHS->hasOneUse() && isValueAvailable(RHS)) in emitLogicalOp()
1561 if (RHS->hasOneUse() && isValueAvailable(RHS)) in emitLogicalOp()
[all …]
/external/llvm/lib/Analysis/
DCodeMetrics.cpp130 if (!CS.isNoInline() && F->hasInternalLinkage() && F->hasOneUse()) in analyzeBasicBlock()
/external/llvm/lib/Target/BPF/
DBPFISelDAGToDAG.cpp139 if (Node->hasOneUse()) in Select()
/external/llvm/lib/CodeGen/
DCodeGenPrepare.cpp769 if (AddI->getParent() != CI->getParent() && !AddI->hasOneUse()) in CombineUAddWithOverflow()
775 if (AddI->hasOneUse()) in CombineUAddWithOverflow()
782 auto *InsertPt = AddI->hasOneUse() ? CI : AddI; in CombineUAddWithOverflow()
1480 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) && in DupRetToEnableTailCallOpts()
2417 if (!ExtOpnd->hasOneUse() && !TLI.isTruncateFree(ExtTy, ExtOpnd->getType())) in getAction()
2480 if (!ExtOpnd->hasOneUse()) { in promoteOperandForOther()
2870 if (I->hasOneUse() || in MatchAddr()
3631 (LI->hasOneUse() || hasSameExtUse(LI, *TLI)))) in ExtLdPromotion()
3679 if (!LI->hasOneUse() && TLI && in MoveExtToFormExtLoad()
3716 if (Src->hasOneUse()) in OptimizeExtUses()
[all …]
/external/llvm/lib/Target/MSP430/
DMSP430ISelDAGToDAG.cpp354 N1.hasOneUse() && in SelectIndexedBinOp()
403 if (Node->hasOneUse()) in Select()
/external/llvm/lib/Target/R600/
DSIFoldOperands.cpp189 !MRI.hasOneUse(MI.getOperand(0).getReg())) in runOnMachineFunction()

1234