/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineAndOrXor.cpp | 46 return CI->hasOneUse(); in isFreeToInvert() 142 if (Op->hasOneUse()) { in OptAndOp() 150 if (Op->hasOneUse()){ in OptAndOp() 172 if (Op->hasOneUse()) { in OptAndOp() 248 if (Op->hasOneUse()) { in OptAndOp() 747 LHS->hasOneUse() && RHS->hasOneUse()) { in FoldAndOfICmps() 1037 if (!Op0I->hasOneUse()) break; in visitAnd() 1075 if (Op0I->hasOneUse() && !match(Op0LHS, m_Zero())) { in visitAnd() 1133 if (Op0->hasOneUse() && Op1->hasOneUse()) { in visitAnd() 1157 if (Op0->hasOneUse() && in visitAnd() [all …]
|
D | InstCombineCasts.cpp | 101 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0; in PromoteCastOfAllocation() 111 if (!AI.hasOneUse() && CastElTyStoreSize < AllocElTyStoreSize) return 0; in PromoteCastOfAllocation() 148 if (!AI.hasOneUse()) { in PromoteCastOfAllocation() 353 if (!I->hasOneUse()) return false; in CanEvaluateTruncated() 474 if (Src->hasOneUse() && in visitTrunc() 497 if (Src->hasOneUse() && isa<IntegerType>(Src->getType()) && in visitTrunc() 666 if (!I->hasOneUse()) return false; in CanEvaluateZExtd() 760 if (CI.hasOneUse() && isa<TruncInst>(CI.use_back())) in visitZExt() 852 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() && in visitZExt() 862 if (SrcI && SrcI->getOpcode() == Instruction::And && SrcI->hasOneUse()) in visitZExt() [all …]
|
D | InstCombineCompares.cpp | 656 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) && in FoldGEPICmp() 657 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) && in FoldGEPICmp() 728 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) && in FoldGEPICmp() 729 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) { in FoldGEPICmp() 1033 if (Shr->hasOneUse() && Shr->isExact()) in FoldICmpShrCst() 1036 if (Shr->hasOneUse()) { in FoldICmpShrCst() 1058 if (ICI.isEquality() && LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst() 1107 if (LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst() 1144 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) && in visitICmpInstWithInstAndIntCst() 1145 LHSI->getOperand(0)->hasOneUse()) { in visitICmpInstWithInstAndIntCst() [all …]
|
D | InstCombinePHI.cpp | 46 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()
|
D | InstructionCombining.cpp | 314 Op0->hasOneUse() && Op1->hasOneUse()) { in SimplifyAssociativeOrCommutative() 425 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) in SimplifyUsingDistributiveLaws() 447 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) in SimplifyUsingDistributiveLaws() 587 if (!SI->hasOneUse()) return 0; in FoldOpIntoSelect() 631 if (!PN->hasOneUse()) { in FoldOpIntoPhi() 824 !Src.hasOneUse()) in shouldMergeGEPs() 918 if (!Op->hasOneUse()) in Descale() 927 if (!Op->hasOneUse()) in Descale() 952 if (Amt < logScale || !Op->hasOneUse()) in Descale() 963 if (!Op->hasOneUse()) in Descale() [all …]
|
D | InstCombineAddSub.cpp | 545 InstQuota = ((!isa<Constant>(V0) && V0->hasOneUse()) && in simplify() 546 (!isa<Constant>(V1) && V1->hasOneUse())) ? 2 : 1; in simplify() 865 if (!V->hasOneUse() || !V->getType()->isIntegerTy()) in dyn_castFoldableMul() 969 if (LHS->hasOneUse() && (XorRHS->getValue()+1).isPowerOf2()) { in visitAdd() 1080 if (LHS->hasOneUse() && in visitAdd() 1114 if (SI && SI->hasOneUse()) { in visitAdd() 1138 if (LHSConv->hasOneUse() && in visitAdd() 1154 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitAdd() 1220 if (LHSConv->hasOneUse() && in visitFAdd() 1236 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) && in visitFAdd() [all …]
|
D | InstCombineVectorOps.cpp | 42 if (I->getOpcode() == Instruction::Load && I->hasOneUse()) in CheapToScalarize() 45 if (BO->hasOneUse() && in CheapToScalarize() 50 if (CI->hasOneUse() && in CheapToScalarize() 127 if (!PHIUser->hasOneUse() || !(PHIUser->use_back() == PN) || in scalarizePHI() 196 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) { in visitExtractElementInst() 233 if (I->hasOneUse() && in visitExtractElementInst() 279 if (CI->hasOneUse() && (CI->getOpcode() != Instruction::BitCast)) { in visitExtractElementInst() 474 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) { in visitInsertElementInst() 510 if (!I->hasOneUse()) in CanEvaluateShuffled()
|
D | InstCombineShifts.cpp | 44 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() 448 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant() 462 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && in FoldShiftByConstant()
|
D | InstCombineMulDivRem.cpp | 30 if (!V->hasOneUse()) return 0; in simplifyValueKnownNonZero() 163 if (Op0->hasOneUse() && in visitMul() 178 if (Op0->hasOneUse()) { in visitMul() 222 if (BO && BO->hasOneUse() && in visitMul() 296 if (!Op->hasOneUse()) in detectLog2OfHalf() 307 if (!OpLog2Of->hasOneUse()) in detectLog2OfHalf() 516 if (Opnd0->hasOneUse()) { in visitFMul() 539 if (Opnd0->hasOneUse() && in visitFMul() 628 if (SI->use_empty() && SelectCond->hasOneUse()) in SimplifyDivRemOfSelect() 1081 if (Op0->hasOneUse() && match(Op0, m_FDiv(m_Value(X), m_Value(Y)))) { in visitFDiv() [all …]
|
D | InstCombineSelect.cpp | 216 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && in FoldSelectIntoOp() 251 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && in FoldSelectIntoOp() 430 if (ICI->hasOneUse()) in visitSelectInstWithICmp() 868 if (TI->hasOneUse() && FI->hasOneUse()) { in visitSelectInst()
|
D | InstCombineSimplifyDemanded.cpp | 153 if (Depth != 0 && !I->hasOneUse()) { in SimplifyDemandedUseBits() 227 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits() 353 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() && in SimplifyDemandedUseBits() 880 if (!Shr->hasOneUse()) in SimplifyShrShlDemandedBits() 973 if (!V->hasOneUse()) { in SimplifyDemandedVectorElts()
|
D | InstCombineLoadStoreAlloca.cpp | 403 if (Op->hasOneUse()) { in visitLoadInst() 587 if (Ptr->hasOneUse()) { in visitStoreInst() 592 if (GEP->getOperand(0)->hasOneUse()) in visitStoreInst()
|
/external/llvm/lib/Transforms/Scalar/ |
D | Reassociate.cpp | 237 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp() 566 if (!Op->hasOneUse()) { in LinearizeExprTree() 585 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); in LinearizeExprTree() 603 if (!Op->hasOneUse()) in LinearizeExprTree() 618 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); in LinearizeExprTree() 916 if (Sub->hasOneUse() && in ShouldBreakUpSubtract() 1157 if (!Opnd1->getValue()->hasOneUse()) in CombineXorOpnd() 1193 if (Opnd1->getValue()->hasOneUse()) in CombineXorOpnd() 1195 if (Opnd2->getValue()->hasOneUse()) in CombineXorOpnd() 1798 while (Op->hasOneUse() && Op->use_back()->getOpcode() == Opcode && in EraseInst() [all …]
|
D | CodeGenPrepare.cpp | 764 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) && in DupRetToEnableTailCallOpts() 1207 if (I->hasOneUse() || in MatchAddr() 1705 if (!LI->hasOneUse() && in MoveExtToFormExtLoad() 1736 if (Src->hasOneUse()) in OptimizeExtUses() 1827 return Cmp->hasOneUse() && in isFormingBranchFromSelectProfitable() 1828 ((isa<LoadInst>(CmpOp0) && CmpOp0->hasOneUse()) || in isFormingBranchFromSelectProfitable() 1829 (isa<LoadInst>(CmpOp1) && CmpOp1->hasOneUse())); in isFormingBranchFromSelectProfitable()
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | DAGCombiner.cpp | 414 if (!Op.hasOneUse()) return 0; in isNegatibleForFree() 476 assert(Op.hasOneUse() && "Unknown reuse!"); in GetNegatedExpression() 580 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC() 597 if (N0.hasOneUse()) { in ReassociateOps() 615 if (N1.hasOneUse()) { in ReassociateOps() 686 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse()) in CommitTargetLoweringOpt() 1301 if (Op.hasOneUse() && in visitTokenFactor() 1369 if (N01C && N00.getOpcode() == ISD::ADD && N00.getNode()->hasOneUse() && in combineShlAddConstant() 1498 if (N0.getOpcode() == ISD::SHL && N0.getNode()->hasOneUse()) { in visitADD() 1502 if (N1.getOpcode() == ISD::SHL && N1.getNode()->hasOneUse()) { in visitADD() [all …]
|
D | TargetLowering.cpp | 315 if (!Op.getNode()->hasOneUse()) in ShrinkDemandedOp() 367 if (!Op.getNode()->hasOneUse()) { in SimplifyDemandedBits() 886 if (Op.getOperand(0).getNode()->hasOneUse()) { in SimplifyDemandedBits() 1118 if (N0.hasOneUse() && N0.getOpcode() == ISD::TRUNCATE) in SimplifySetCC() 1121 if (CTPOP.hasOneUse() && CTPOP.getOpcode() == ISD::CTPOP && in SimplifySetCC() 1141 if (DCI.isBeforeLegalize() && N0->hasOneUse() && in SimplifySetCC() 1182 N0.getNode()->hasOneUse() && in SimplifySetCC() 1184 N0.getOperand(0).getNode()->hasOneUse() && in SimplifySetCC() 1500 N0.getOpcode() == ISD::AND && N0.hasOneUse()) { in SimplifySetCC() 1670 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) { in SimplifySetCC() [all …]
|
D | SelectionDAGDumper.cpp | 515 if (N->getOperand(i).getNode()->hasOneUse()) in DumpNodes() 532 if (!N->hasOneUse() && N != getRoot().getNode()) in dump()
|
/external/llvm/lib/Target/X86/ |
D | X86ISelDAGToDAG.cpp | 300 if (!N.hasOneUse()) in IsProfitableToFold() 405 if (Callee.getNode() == Chain.getNode() || !Callee.hasOneUse()) in isCalleeLoad() 416 if (!Chain.hasOneUse()) in isCalleeLoad() 432 Callee.getValue(1).hasOneUse()) in isCalleeLoad() 778 !Shift.hasOneUse()) in FoldMaskAndShiftToExtract() 826 if (!N.hasOneUse() || !Shift.hasOneUse()) in FoldMaskedShiftToScaledMask() 886 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse() || in FoldMaskAndShiftToScale() 1102 if (MulVal.getNode()->getOpcode() == ISD::ADD && MulVal.hasOneUse() && in MatchAddressRecursively() 1149 if (!RHS.getNode()->hasOneUse() || in MatchAddressRecursively() 1160 !AM.Base_Reg.getNode()->hasOneUse()) || in MatchAddressRecursively() [all …]
|
/external/llvm/lib/Analysis/ |
D | CodeMetrics.cpp | 39 if (!CS.isNoInline() && F->hasInternalLinkage() && F->hasOneUse()) in analyzeBasicBlock()
|
/external/llvm/lib/Target/MSP430/ |
D | MSP430ISelDAGToDAG.cpp | 358 N1.hasOneUse() && in SelectIndexedBinOp() 408 if (Node->hasOneUse()) in Select()
|
/external/llvm/lib/Target/Mips/ |
D | MipsSEISelLowering.cpp | 201 if (!MultHi.hasOneUse() || !MultLo.hasOneUse()) in selectMADD() 277 if (!MultHi.hasOneUse() || !MultLo.hasOneUse()) in selectMSUB()
|
/external/llvm/lib/Target/NVPTX/ |
D | NVPTXLowerAggrCopies.cpp | 120 if (load->hasOneUse() == false) in runOnFunction()
|
/external/llvm/lib/Transforms/Utils/ |
D | LCSSA.cpp | 156 (I->hasOneUse() && I->use_back()->getParent() == BB && in runOnLoop()
|
/external/llvm/include/llvm/IR/ |
D | Value.h | 158 bool hasOneUse() const { in hasOneUse() function
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineRegisterInfo.h | 239 bool hasOneUse(unsigned RegNo) const { in hasOneUse() function
|