Home
last modified time | relevance | path

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

12345678910>>...17

/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/RISCV/
DRISCVMergeBaseOffset.cpp86 !MRI->hasOneUse(HiLUI.getOperand(0).getReg())) in detectLuiAddiGlobal()
94 !MRI->hasOneUse(LoADDI->getOperand(0).getReg())) in detectLuiAddiGlobal()
143 if (!MRI->hasOneUse(Reg)) in matchLargeOffset()
159 !MRI->hasOneUse(OffsetLui.getOperand(0).getReg())) in matchLargeOffset()
182 assert(MRI->hasOneUse(DestReg) && "expected one use for LoADDI"); in detectAndFoldOffset()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DGuardUtils.cpp67 if (!Cond->hasOneUse()) in parseWidenableBranch()
93 A->hasOneUse()) { in parseWidenableBranch()
100 B->hasOneUse()) { in parseWidenableBranch()
/external/llvm-project/llvm/lib/Analysis/
DGuardUtils.cpp67 if (!Cond->hasOneUse()) in parseWidenableBranch()
93 A->hasOneUse()) { in parseWidenableBranch()
100 B->hasOneUse()) { in parseWidenableBranch()
/external/llvm-project/llvm/lib/Target/RISCV/
DRISCVMergeBaseOffset.cpp86 !MRI->hasOneUse(HiLUI.getOperand(0).getReg())) in INITIALIZE_PASS()
94 !MRI->hasOneUse(LoADDI->getOperand(0).getReg())) in INITIALIZE_PASS()
143 if (!MRI->hasOneUse(Reg)) in matchLargeOffset()
159 !MRI->hasOneUse(OffsetLui.getOperand(0).getReg())) in matchLargeOffset()
182 assert(MRI->hasOneUse(DestReg) && "expected one use for LoADDI"); in detectAndFoldOffset()
/external/llvm/lib/Transforms/InstCombine/
DInstCombineAndOrXor.cpp31 if (!IsFreeToInvert(Operand, Operand->hasOneUse())) in dyn_castNotVal()
161 if (Op->hasOneUse()) { in OptAndOp()
169 if (Op->hasOneUse()){ in OptAndOp()
191 if (Op->hasOneUse()) { in OptAndOp()
267 if (Op->hasOneUse()) { in OptAndOp()
918 LHS->hasOneUse() && RHS->hasOneUse()) { in FoldAndOfICmps()
1167 if (Op0->hasOneUse() && Op1->hasOneUse()) { in matchDeMorgansLaws()
1342 if (!Op0I->hasOneUse()) break; in visitAnd()
1384 if (Op0I->hasOneUse() && !match(Op0LHS, m_Zero())) { in visitAnd()
1491 if (Op1->hasOneUse() || cast<BinaryOperator>(Op1)->hasOneUse()) in visitAnd()
[all …]
DInstCombineSelect.cpp146 (!TI->hasOneUse() || !FI->hasOneUse())) in FoldSelectOpOp()
149 } else if (!TI->hasOneUse() || !FI->hasOneUse()) { in FoldSelectOpOp()
169 if (!isa<BinaryOperator>(TI) || !TI->hasOneUse() || !FI->hasOneUse()) in FoldSelectOpOp()
234 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && in FoldSelectIntoOp()
264 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && in FoldSelectIntoOp()
427 if (ICI->hasOneUse()) in visitSelectInstWithICmp()
849 if (!TI || !FI || !TI->hasOneUse() || !FI->hasOneUse()) in foldAddSubSelect()
1024 if (FCI->hasOneUse() && FCmpInst::isUnordered(FCI->getPredicate())) { in visitSelectInst()
1067 if (FCI->hasOneUse() && FCmpInst::isUnordered(FCI->getPredicate())) { in visitSelectInst()
1160 (SI.hasOneUse() && match(*SI.user_begin(), m_Not(m_Value()))); in visitSelectInst()
[all …]
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()
350 if (!I->hasOneUse()) return false; in canEvaluateTruncated()
443 if (!TruncOp->hasOneUse() || !isa<IntegerType>(DestType)) in foldVecTruncToExtElt()
524 if (Src->hasOneUse() && in visitTrunc()
550 if (Src->hasOneUse() && in visitTrunc()
552 cast<Instruction>(Src)->getOperand(0)->hasOneUse()) { in visitTrunc()
567 if (Src->hasOneUse() && isa<IntegerType>(SrcTy) && in visitTrunc()
740 if (!I->hasOneUse()) return false; in canEvaluateZExtd()
[all …]
DInstCombineCompares.cpp973 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) && in FoldGEPICmp()
974 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) && in FoldGEPICmp()
1045 if (GEPsInBounds && (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) && in FoldGEPICmp()
1046 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) { in FoldGEPICmp()
1412 if (Shr->hasOneUse() && Shr->isExact()) in FoldICmpShrCst()
1415 if (Shr->hasOneUse()) { in FoldICmpShrCst()
1553 if (ICI.isEquality() && LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1602 if (LHSI->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
1639 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) && in visitICmpInstWithInstAndIntCst()
1640 LHSI->getOperand(0)->hasOneUse()) { in visitICmpInstWithInstAndIntCst()
[all …]
DInstCombinePHI.cpp41 if (!I || I->getOpcode() != Opc || !I->hasOneUse() || in FoldPHIArgBinOpIntoPHI()
140 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || in FoldPHIArgGEPIntoPHI()
309 if (!LI || !LI->hasOneUse()) in FoldPHIArgLoadIntoPHI()
426 if (Zext->getSrcTy() != NarrowType || !Zext->hasOneUse()) in FoldPHIArgZextsIntoPHI()
510 if (!I || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) in FoldPHIArgOpIntoPHI()
578 if (!PN->hasOneUse()) return false; in DeadPHICycle()
746 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI()
881 PN.getIncomingValue(0)->hasOneUse()) in visitPHINode()
888 if (PN.hasOneUse()) { in visitPHINode()
903 if (PHIUser->hasOneUse() && in visitPHINode()
/external/llvm-project/llvm/lib/Transforms/InstCombine/
DInstCombineAndOrXor.cpp100 if (!OldLHS->hasOneUse() && !OldRHS->hasOneUse()) in SimplifyBSwap()
105 if (!OldLHS->hasOneUse()) in SimplifyBSwap()
1014 (ZeroICmp->hasOneUse() || UnsignedICmp->hasOneUse())) { in foldUnsignedUnderflowCheck()
1118 if (!Cmp1->hasOneUse()) in foldAndOrOfICmpsWithConstEq()
1206 if (PredL == ICmpInst::ICMP_EQ && PredL == PredR && LHS->hasOneUse() && in foldAndOfICmps()
1207 RHS->hasOneUse()) { in foldAndOfICmps()
1458 !InstCombiner::isFreeToInvert(A, A->hasOneUse()) && in matchDeMorgansLaws()
1459 !InstCombiner::isFreeToInvert(B, B->hasOneUse())) { in matchDeMorgansLaws()
1607 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldAndToXor()
1625 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldOrToXor()
[all …]
DInstCombineSelect.cpp176 if (!Cmp->hasOneUse()) in foldSelectICmpAnd()
301 (!TI->hasOneUse() || !FI->hasOneUse())) in foldSelectOpOp()
303 } else if (!TI->hasOneUse() || !FI->hasOneUse()) { in foldSelectOpOp()
321 (TI->hasOneUse() || FI->hasOneUse())) { in foldSelectOpOp()
332 !TI->hasOneUse() || !FI->hasOneUse()) in foldSelectOpOp()
407 if (TVI->hasOneUse() && !isa<Constant>(FalseVal)) { in foldSelectIntoOp()
439 if (FVI->hasOneUse() && !isa<Constant>(TrueVal)) { in foldSelectIntoOp()
484 if (!(Cmp->hasOneUse() && Cmp->getOperand(0)->hasOneUse() && in foldSelectICmpAndAnd()
633 (IC->hasOneUse() + Or->hasOneUse())) in foldSelectICmpAndOr()
736 if (IsNegative && !TrueVal->hasOneUse() && !ICI->hasOneUse()) in canonicalizeSaturatedSubtract()
[all …]
DInstCombineMulDivRem.cpp55 if (!V->hasOneUse()) return nullptr; in simplifyValueKnownNonZero()
203 if (Op0->hasOneUse() && match(Op1, m_NegatedPower2())) { in visitMul()
275 if (Div && Div->hasOneUse() && in visitMul()
329 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitMul()
339 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitMul()
401 (Op0->hasOneUse() || Op1->hasOneUse())) { in foldFPSignBitOps()
469 if (Op0->hasOneUse() && C1DivC->isNormalFP()) in visitFMul()
547 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitFMul()
557 (Op0->hasOneUse() || Op1->hasOneUse())) { in visitFMul()
635 if (SI->use_empty() && SelectCond->hasOneUse()) in simplifyDivRemOfSelectWithZeroOp()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/InstCombine/
DInstCombineAndOrXor.cpp98 if (!OldLHS->hasOneUse() && !OldRHS->hasOneUse()) in SimplifyBSwap()
103 if (!OldLHS->hasOneUse()) in SimplifyBSwap()
126 if (Op->hasOneUse()) { in OptAndOp()
1074 (ZeroICmp->hasOneUse() || UnsignedICmp->hasOneUse())) { in foldUnsignedUnderflowCheck()
1219 if (PredL == ICmpInst::ICMP_EQ && PredL == PredR && LHS->hasOneUse() && in foldAndOfICmps()
1220 RHS->hasOneUse()) { in foldAndOfICmps()
1470 !isFreeToInvert(A, A->hasOneUse()) && in matchDeMorgansLaws()
1471 !isFreeToInvert(B, B->hasOneUse())) { in matchDeMorgansLaws()
1619 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldAndToXor()
1637 if (Op0->hasOneUse() || Op1->hasOneUse()) in foldOrToXor()
[all …]
DInstCombineSelect.cpp175 if (!Cmp->hasOneUse()) in foldSelectICmpAnd()
319 (!TI->hasOneUse() || !FI->hasOneUse())) in foldSelectOpOp()
321 } else if (!TI->hasOneUse() || !FI->hasOneUse()) { in foldSelectOpOp()
339 (TI->hasOneUse() || FI->hasOneUse())) { in foldSelectOpOp()
354 !TI->hasOneUse() || !FI->hasOneUse()) in foldSelectOpOp()
429 if (TVI->hasOneUse() && !isa<Constant>(FalseVal)) { in foldSelectIntoOp()
460 if (FVI->hasOneUse() && !isa<Constant>(TrueVal)) { in foldSelectIntoOp()
504 if (!(Cmp->hasOneUse() && Cmp->getOperand(0)->hasOneUse() && in foldSelectICmpAndAnd()
653 (IC->hasOneUse() + Or->hasOneUse())) in foldSelectICmpAndOr()
724 if (IsNegative && !TrueVal->hasOneUse() && !ICI->hasOneUse()) in canonicalizeSaturatedSubtract()
[all …]
DInstCombinePHI.cpp99 if (!PN.hasOneUse()) in FoldIntegerTypedPHI()
169 if (!LoadI->hasOneUse()) in FoldIntegerTypedPHI()
257 (LoadI && LoadI->hasOneUse())) && in FoldIntegerTypedPHI()
308 if (!I || I->getOpcode() != Opc || !I->hasOneUse() || in FoldPHIArgBinOpIntoPHI()
407 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || in FoldPHIArgGEPIntoPHI()
576 if (!LI || !LI->hasOneUse()) in FoldPHIArgLoadIntoPHI()
695 if (Zext->getSrcTy() != NarrowType || !Zext->hasOneUse()) in FoldPHIArgZextsIntoPHI()
779 if (!I || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) in FoldPHIArgOpIntoPHI()
847 if (!PN->hasOneUse()) return false; in DeadPHICycle()
1015 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI()
[all …]
DInstructionCombining.cpp272 if (!Cast || !Cast->hasOneUse()) in simplifyAssocCastAssoc()
286 if (!BinOp2 || !BinOp2->hasOneUse() || BinOp2->getOpcode() != AssocOpcode) in simplifyAssocCastAssoc()
581 if (!V && LHS->hasOneUse() && RHS->hasOneUse()) in tryFactorization()
601 if (!V && LHS->hasOneUse() && RHS->hasOneUse()) in tryFactorization()
800 if (LHS->hasOneUse() && RHS->hasOneUse()) { in SimplifySelectsFeedingBinaryOp()
806 } else if (LHSIsSelect && LHS->hasOneUse()) { in SimplifySelectsFeedingBinaryOp()
811 } else if (RHSIsSelect && RHS->hasOneUse()) { in SimplifySelectsFeedingBinaryOp()
891 if (!SI->hasOneUse()) in FoldOpIntoSelect()
926 if (CI->hasOneUse()) { in FoldOpIntoSelect()
969 if (!PN->hasOneUse()) { in foldOpIntoPhi()
[all …]
DInstCombineCasts.cpp103 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return nullptr; in PromoteCastOfAllocation()
113 if (!AI.hasOneUse() && CastElTyStoreSize < AllocElTyStoreSize) return nullptr; in PromoteCastOfAllocation()
151 if (!AI.hasOneUse()) { in PromoteCastOfAllocation()
272 if (CSrc->hasOneUse()) in commonCastTransforms()
325 if (!V->hasOneUse()) in canNotEvaluateInType()
460 if (!TruncOp->hasOneUse() || !isa<IntegerType>(DestType)) in foldVecTruncToExtElt()
641 if (Shuf && Shuf->hasOneUse() && isa<UndefValue>(Shuf->getOperand(1)) && in shrinkSplatShuffle()
665 if (!InsElt || !InsElt->hasOneUse()) in shrinkInsertElt()
760 if (Src->hasOneUse() && in visitTrunc()
787 if (Src->hasOneUse() && in visitTrunc()
[all …]
/external/tensorflow/tensorflow/compiler/mlir/tensorflow/transforms/
Dtpu_resource_partitioning.cc88 if (!result.hasOneUse()) continue; in PartitionResourceReadsWrites()
118 if (!read_var || !read_var.value().hasOneUse()) continue; in PartitionResourceReadsWrites()
121 if (!partitioned_input || !partitioned_input.output().hasOneUse() || in PartitionResourceReadsWrites()
Dgpu_fusion.cc91 if (!batch_norm.y().hasOneUse()) return failure(); in matchAndRewrite()
104 if (!add_op || add_op.z().hasOneUse()) { in matchAndRewrite()
/external/tensorflow/tensorflow/compiler/mlir/lite/transforms/
Dpost_quantize.cc85 if (arg.hasOneUse() && llvm::isa<QuantizeOp>(*arg.user_begin())) { in RemoveQuantizationAdaptorOps()
109 if (returned_op && returned_op->hasOneUse() && in RemoveQuantizationAdaptorOps()
138 if (op->hasOneUse() && in matchAndRewrite()
/external/llvm-project/llvm/lib/Transforms/Vectorize/
DVectorCombine.cpp99 !Scalar->hasOneUse()) in vectorizeLoadInsert()
113 if (!Load || !Load->isSimple() || !Load->hasOneUse() || in vectorizeLoadInsert()
278 : !Ext0->hasOneUse() || !Ext1->hasOneUse(); in isExtractExtractCheap()
286 !Ext0->hasOneUse() * Extract0Cost + in isExtractExtractCheap()
287 !Ext1->hasOneUse() * Extract1Cost; in isExtractExtractCheap()
417 if (I.hasOneUse()) in foldExtractExtract()
575 (IsConst0 ? 0 : !Ins0->hasOneUse() * InsertCost) + in scalarizeBinopOrCmp()
576 (IsConst1 ? 0 : !Ins1->hasOneUse() * InsertCost); in scalarizeBinopOrCmp()
/external/llvm/lib/Transforms/Scalar/
DReassociate.cpp129 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp()
139 if (V->hasOneUse() && isa<Instruction>(V) && in isReassociableOp()
501 if (!Op->hasOneUse()) { in LinearizeExprTree()
520 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); in LinearizeExprTree()
538 if (!Op->hasOneUse()) in LinearizeExprTree()
555 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); in LinearizeExprTree()
895 if (Sub->hasOneUse() && in ShouldBreakUpSubtract()
1166 if (!Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1203 if (Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1205 if (Opnd2->getValue()->hasOneUse()) in CombineXorOpnd()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp796 if (Op->hasOneUse() || Op->getNumValues() > 1) in deleteAndRecombine()
845 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
902 if (N0.hasOneUse()) in reassociationCanBreakAddressingModePattern()
965 if (N0.hasOneUse()) { in reassociateOpsCommutative()
1215 Replace0 &= !N0->hasOneUse(); in PromoteIntBinOp()
1216 Replace1 &= (N0 != N1) && !N1->hasOneUse(); in PromoteIntBinOp()
1730 if (N->hasOneUse() && N->use_begin()->getOpcode() == ISD::TokenFactor) in visitTokenFactor()
1767 if (Op.hasOneUse() && !is_contained(TFs, Op.getNode())) { in visitTokenFactor()
1933 if (Sel.getOpcode() != ISD::SELECT || !Sel.hasOneUse()) { in foldBinOpIntoSelect()
1938 if (Sel.getOpcode() != ISD::SELECT || !Sel.hasOneUse()) in foldBinOpIntoSelect()
[all …]
/external/llvm-project/llvm/lib/Target/X86/
DX86PartialReduction.cpp94 if (!isa<Constant>(LHS) && !LHS->hasOneUse()) in tryMAddReplacement()
96 if (!isa<Constant>(RHS) && !RHS->hasOneUse()) in tryMAddReplacement()
310 if (!BO || BO->getOpcode() != Instruction::Add || !BO->hasOneUse()) in matchAddReduction()
361 if (!Phi->hasOneUse()) in isReachableFromPHI()
368 while (U->hasOneUse() && U->getOpcode() == BO->getOpcode()) in isReachableFromPHI()
/external/llvm-project/llvm/lib/Transforms/Scalar/
DReassociate.cpp151 if (I && I->hasOneUse() && I->getOpcode() == Opcode) in isReassociableOp()
160 if (I && I->hasOneUse() && in isReassociableOp()
523 if (!Op->hasOneUse()) { in LinearizeExprTree()
544 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); in LinearizeExprTree()
562 if (!Op->hasOneUse()) in LinearizeExprTree()
579 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); in LinearizeExprTree()
993 if (Or->hasOneUse() && isInteresting(VB)) in ShouldConvertOrWithNoCommonBitsToAdd()
1038 if (Sub->hasOneUse() && in ShouldBreakUpSubtract()
1310 if (!Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
1344 if (Opnd1->getValue()->hasOneUse()) in CombineXorOpnd()
[all …]

12345678910>>...17