Home
last modified time | relevance | path

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

123

/external/llvm/lib/Transforms/InstCombine/
DInstCombineAddSub.cpp38 if (!V->hasOneUse() || !V->getType()->isIntegerTy()) in dyn_castFoldableMul()
142 if (LHS->hasOneUse() && (XorRHS->getValue()+1).isPowerOf2()) { in visitAdd()
248 if (LHS->hasOneUse() && in visitAdd()
282 if (SI && SI->hasOneUse()) { in visitAdd()
306 if (LHSConv->hasOneUse() && in visitAdd()
322 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitAdd()
393 if (LHSConv->hasOneUse() && in visitFAdd()
409 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitFAdd()
474 (GEP2 != 0 && !GEP2->hasAllConstantIndices() && !GEP2->hasOneUse())) in OptimizePointerDifference()
568 if (Op1->hasOneUse()) { in visitSub()
DInstCombineAndOrXor.cpp46 return CI->hasOneUse(); in isFreeToInvert()
142 if (Op->hasOneUse()) { in OptAndOp()
150 if (Op->hasOneUse()){ in OptAndOp()
172 if (Op->hasOneUse()) { in OptAndOp()
250 if (Op->hasOneUse()) { in OptAndOp()
757 LHS->hasOneUse() && RHS->hasOneUse()) { in FoldAndOfICmps()
1045 if (!Op0I->hasOneUse()) break; in visitAnd()
1083 if (Op0I->hasOneUse() && !match(Op0LHS, m_Zero())) { in visitAnd()
1141 if (Op0->hasOneUse() && Op1->hasOneUse()) { in visitAnd()
1165 if (Op0->hasOneUse() && in visitAnd()
[all …]
DInstCombineCasts.cpp101 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0; in PromoteCastOfAllocation()
142 if (!AI.hasOneUse()) { in PromoteCastOfAllocation()
344 if (!I->hasOneUse()) return false; in CanEvaluateTruncated()
465 if (Src->hasOneUse() && in visitTrunc()
488 if (Src->hasOneUse() && isa<IntegerType>(Src->getType()) && in visitTrunc()
657 if (!I->hasOneUse()) return false; in CanEvaluateZExtd()
741 if (CI.hasOneUse() && isa<TruncInst>(CI.use_back())) in visitZExt()
833 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() && in visitZExt()
843 if (SrcI && SrcI->getOpcode() == Instruction::And && SrcI->hasOneUse()) in visitZExt()
854 if (SrcI && SrcI->getOpcode() == Instruction::Xor && SrcI->hasOneUse()) in visitZExt()
[all …]
DInstCombineCompares.cpp623 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) && in FoldGEPICmp()
624 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) && in FoldGEPICmp()
696 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) && in FoldGEPICmp()
697 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) { in FoldGEPICmp()
1002 if (Shr->hasOneUse() && Shr->isExact()) in FoldICmpShrCst()
1005 if (Shr->hasOneUse()) { in FoldICmpShrCst()
1027 if (ICI.isEquality() && LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1076 if (LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1103 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) && in visitICmpInstWithInstAndIntCst()
1104 LHSI->getOperand(0)->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
[all …]
DInstCombineVectorOps.cpp40 if (I->getOpcode() == Instruction::Load && I->hasOneUse()) in CheapToScalarize()
43 if (BO->hasOneUse() && in CheapToScalarize()
48 if (CI->hasOneUse() && in CheapToScalarize()
120 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) { in visitExtractElementInst()
149 if (I->hasOneUse() && in visitExtractElementInst()
195 if (CI->hasOneUse() && EI.hasOneUse() && in visitExtractElementInst()
386 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) { in visitInsertElementInst()
DInstCombineShifts.cpp44 if (Op1->hasOneUse() && match(Op1, m_SRem(m_Value(A), m_Power2(B)))) { in commonShiftTransforms()
104 if (!I->hasOneUse()) return false; in CanEvaluateShifted()
403 if (Op0->hasOneUse()) { in FoldShiftByConstant()
416 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() && in FoldShiftByConstant()
431 if (isLeftShift && Op0BOOp1->hasOneUse() && in FoldShiftByConstant()
435 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse()) { in FoldShiftByConstant()
449 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant()
463 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant()
468 ->getOperand(0)->hasOneUse()) { in FoldShiftByConstant()
DInstCombinePHI.cpp46 if (!I || I->getOpcode() != Opc || !I->hasOneUse() || in FoldPHIArgBinOpIntoPHI()
149 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || in FoldPHIArgGEPIntoPHI()
320 if (!LI || !LI->hasOneUse()) in FoldPHIArgLoadIntoPHI()
437 if (I == 0 || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) in FoldPHIArgOpIntoPHI()
511 if (!PN->hasOneUse()) return false; in DeadPHICycle()
674 !User->hasOneUse() || !isa<TruncInst>(User->use_back()) || in SliceUpIllegalIntegerPHI()
806 PN.getIncomingValue(0)->hasOneUse()) in visitPHINode()
813 if (PN.hasOneUse()) { in visitPHINode()
828 if (PHIUser->hasOneUse() && in visitPHINode()
DInstructionCombining.cpp293 Op0->hasOneUse() && Op1->hasOneUse()) { in SimplifyAssociativeOrCommutative()
404 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) in SimplifyUsingDistributiveLaws()
426 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) in SimplifyUsingDistributiveLaws()
566 if (!SI->hasOneUse()) return 0; in FoldOpIntoSelect()
610 if (!PN->hasOneUse()) { in FoldOpIntoPhi()
803 !Src.hasOneUse()) in shouldMergeGEPs()
1265 BI.getCondition()->hasOneUse()) in visitBranchInst()
1281 BI.getCondition()->hasOneUse()) in visitBranchInst()
1392 if (II->hasOneUse()) { in visitExtractValueInst()
1442 if (L->isSimple() && L->hasOneUse()) { in visitExtractValueInst()
[all …]
DInstCombineMulDivRem.cpp30 if (!V->hasOneUse()) return 0; in simplifyValueKnownNonZero()
132 if (Op0->hasOneUse() && in visitMul()
147 if (Op0->hasOneUse()) { in visitMul()
191 if (BO && BO->hasOneUse() && in visitMul()
321 if (SI->use_empty() && SelectCond->hasOneUse()) in SimplifyDivRemOfSelect()
DInstCombineSelect.cpp215 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && in FoldSelectIntoOp()
250 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && in FoldSelectIntoOp()
363 if (ICI->hasOneUse()) in visitSelectInstWithICmp()
792 if (TI->hasOneUse() && FI->hasOneUse()) { in visitSelectInst()
DInstCombineLoadStoreAlloca.cpp414 if (Op->hasOneUse()) { in visitLoadInst()
598 if (Ptr->hasOneUse()) { in visitStoreInst()
603 if (GEP->getOperand(0)->hasOneUse()) in visitStoreInst()
DInstCombineSimplifyDemanded.cpp152 if (Depth != 0 && !I->hasOneUse()) { in SimplifyDemandedUseBits()
213 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits()
339 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() && in SimplifyDemandedUseBits()
873 if (!V->hasOneUse()) { in SimplifyDemandedVectorElts()
/external/llvm/lib/Transforms/Scalar/
DReassociate.cpp161 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp()
530 if (!Op->hasOneUse()) { in LinearizeExprTree()
549 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); in LinearizeExprTree()
567 if (!Op->hasOneUse()) in LinearizeExprTree()
582 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); in LinearizeExprTree()
880 if (Sub->hasOneUse() && in ShouldBreakUpSubtract()
1497 while (Op->hasOneUse() && Op->use_back()->getOpcode() == Opcode && in EraseInst()
1516 (I->hasOneUse() && in OptimizeInst()
1570 (!I->hasOneUse() || in OptimizeInst()
1587 if (BO->hasOneUse() && BO->use_back()->getOpcode() == Opcode) in OptimizeInst()
[all …]
DCodeGenPrepare.cpp742 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) && in DupRetToEnableTailCallOpts()
1062 if (!LI->hasOneUse() && in MoveExtToFormExtLoad()
1093 if (Src->hasOneUse()) in OptimizeExtUses()
1184 return Cmp->hasOneUse() && in isFormingBranchFromSelectProfitable()
1185 ((isa<LoadInst>(CmpOp0) && CmpOp0->hasOneUse()) || in isFormingBranchFromSelectProfitable()
1186 (isa<LoadInst>(CmpOp1) && CmpOp1->hasOneUse())); in isFormingBranchFromSelectProfitable()
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp396 if (!Op.hasOneUse()) return 0; in isNegatibleForFree()
458 assert(Op.hasOneUse() && "Unknown reuse!"); in GetNegatedExpression()
562 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
579 if (N0.hasOneUse()) { in ReassociateOps()
597 if (N1.hasOneUse()) { in ReassociateOps()
668 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse()) in CommitTargetLoweringOpt()
1283 if (Op.hasOneUse() && in visitTokenFactor()
1351 if (N01C && N00.getOpcode() == ISD::ADD && N00.getNode()->hasOneUse() && in combineShlAddConstant()
1474 if (N0.getOpcode() == ISD::SHL && N0.getNode()->hasOneUse()) { in visitADD()
1478 if (N1.getOpcode() == ISD::SHL && N1.getNode()->hasOneUse()) { in visitADD()
[all …]
DTargetLowering.cpp1154 if (!Op.getNode()->hasOneUse()) in ShrinkDemandedOp()
1203 if (!Op.getNode()->hasOneUse()) { in SimplifyDemandedBits()
1722 if (Op.getOperand(0).getNode()->hasOneUse()) { in SimplifyDemandedBits()
1954 if (N0.hasOneUse() && N0.getOpcode() == ISD::TRUNCATE) in SimplifySetCC()
1957 if (CTPOP.hasOneUse() && CTPOP.getOpcode() == ISD::CTPOP && in SimplifySetCC()
1977 if (DCI.isBeforeLegalize() && N0->hasOneUse() && in SimplifySetCC()
2017 N0.getNode()->hasOneUse() && in SimplifySetCC()
2019 N0.getOperand(0).getNode()->hasOneUse() && in SimplifySetCC()
2329 N0.getOpcode() == ISD::AND && N0.hasOneUse()) { in SimplifySetCC()
2499 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) { in SimplifySetCC()
[all …]
DSelectionDAGDumper.cpp512 if (N->getOperand(i).getNode()->hasOneUse()) in DumpNodes()
529 if (!N->hasOneUse() && N != getRoot().getNode()) in dump()
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp302 if (!N.hasOneUse()) in IsProfitableToFold()
401 if (Callee.getNode() == Chain.getNode() || !Callee.hasOneUse()) in isCalleeLoad()
412 if (!Chain.hasOneUse()) in isCalleeLoad()
423 Callee.getValue(1).hasOneUse()) in isCalleeLoad()
753 !Shift.hasOneUse()) in FoldMaskAndShiftToExtract()
801 if (!N.hasOneUse() || !Shift.hasOneUse()) in FoldMaskedShiftToScaledMask()
861 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse() || in FoldMaskAndShiftToScale()
1077 if (MulVal.getNode()->getOpcode() == ISD::ADD && MulVal.hasOneUse() && in MatchAddressRecursively()
1124 if (!RHS.getNode()->hasOneUse() || in MatchAddressRecursively()
1135 !AM.Base_Reg.getNode()->hasOneUse()) || in MatchAddressRecursively()
[all …]
/external/llvm/lib/Analysis/
DCodeMetrics.cpp138 if (!CS.isNoInline() && F->hasInternalLinkage() && F->hasOneUse()) in analyzeBasicBlock()
/external/llvm/lib/Target/MSP430/
DMSP430ISelDAGToDAG.cpp357 N1.hasOneUse() && in SelectIndexedBinOp()
407 if (Node->hasOneUse()) in Select()
/external/llvm/lib/Transforms/IPO/
DGlobalOpt.cpp353 if (!V->hasOneUse()) in IsSafeComputationToRemove()
406 if (I->hasOneUse()) in CleanupPointerRootUsers()
414 if (I->hasOneUse()) in CleanupPointerRootUsers()
423 if (I->hasOneUse()) in CleanupPointerRootUsers()
1222 if (GEPI->hasAllZeroIndices() && GEPI->hasOneUse()) in ReplaceUsesOfMallocWithGlobal()
2956 bool hasOneUse = Target->hasOneUse() && Aliasee->hasOneUse(); in OptimizeGlobalAliases() local
2979 if (!hasOneUse) in OptimizeGlobalAliases()
/external/llvm/lib/Transforms/Utils/
DLCSSA.cpp152 (I->hasOneUse() && I->use_back()->getParent() == BB && in runOnLoop()
/external/llvm/include/llvm/
DValue.h155 bool hasOneUse() const { in hasOneUse() function
/external/llvm/lib/Target/NVPTX/
DNVPTXLowerAggrCopies.cpp126 if (load->hasOneUse() == false) continue; in runOnFunction()
/external/llvm/lib/Target/MBlaze/
DMBlazeISelDAGToDAG.cpp214 if (Node->hasOneUse()) in Select()

123