Home
last modified time | relevance | path

Searched refs:DTU (Results 1 – 25 of 44) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp82 DomTreeUpdater *DTU) { in tailMergeBlocksWithSimilarFunctionTerminators() argument
88 if (DTU && DTU->isBBPendingDeletion(&BB)) in tailMergeBlocksWithSimilarFunctionTerminators()
146 if (DTU) in tailMergeBlocksWithSimilarFunctionTerminators()
197 if (DTU) in tailMergeBlocksWithSimilarFunctionTerminators()
204 if (DTU) in tailMergeBlocksWithSimilarFunctionTerminators()
205 DTU->applyUpdates(Updates); in tailMergeBlocksWithSimilarFunctionTerminators()
213 DomTreeUpdater *DTU, in iterativelySimplifyCFG() argument
233 if (DTU) { in iterativelySimplifyCFG()
235 !DTU->isBBPendingDeletion(&BB) && in iterativelySimplifyCFG()
239 while (BBIt != F.end() && DTU->isBBPendingDeletion(&*BBIt)) in iterativelySimplifyCFG()
[all …]
DLowerConstantIntrinsics.cpp56 DomTreeUpdater *DTU) { in replaceConditionalBranchesOnConstant() argument
84 if (DTU) in replaceConditionalBranchesOnConstant()
85 DTU->applyUpdates({{DominatorTree::Delete, Source, Other}}); in replaceConditionalBranchesOnConstant()
95 Optional<DomTreeUpdater> DTU; in lowerConstantIntrinsics() local
97 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy); in lowerConstantIntrinsics()
142 II, NewValue, DTU.hasValue() ? DTU.getPointer() : nullptr); in lowerConstantIntrinsics()
145 removeUnreachableBlocks(F, DTU.hasValue() ? DTU.getPointer() : nullptr); in lowerConstantIntrinsics()
DScalarizeMaskedMemIntrin.cpp73 DomTreeUpdater *DTU);
76 const DataLayout &DL, DomTreeUpdater *DTU);
146 DomTreeUpdater *DTU, bool &ModifiedDT) { in scalarizeMaskedLoad() argument
231 /*BranchWeights=*/nullptr, DTU); in scalarizeMaskedLoad()
288 DomTreeUpdater *DTU, bool &ModifiedDT) { in scalarizeMaskedStore() argument
365 /*BranchWeights=*/nullptr, DTU); in scalarizeMaskedStore()
416 DomTreeUpdater *DTU, bool &ModifiedDT) { in scalarizeMaskedGather() argument
487 /*BranchWeights=*/nullptr, DTU); in scalarizeMaskedGather()
546 DomTreeUpdater *DTU, bool &ModifiedDT) { in scalarizeMaskedScatter() argument
614 /*BranchWeights=*/nullptr, DTU); in scalarizeMaskedScatter()
[all …]
DCallSiteSplitting.cpp307 DomTreeUpdater &DTU) { in splitCallSite() argument
331 DTU); in splitCallSite()
370 DTU.applyUpdatesPermissive({{DominatorTree::Delete, Splits[i], TailBB}}); in splitCallSite()
374 DTU.deleteBB(TailBB); in splitCallSite()
456 DomTreeUpdater &DTU) { in shouldSplitOnPredicatedArgument() argument
465 assert(DTU.hasDomTree() && "We need a DTU with a valid DT!"); in shouldSplitOnPredicatedArgument()
466 auto *CSDTNode = DTU.getDomTree().getNode(CB.getParent()); in shouldSplitOnPredicatedArgument()
488 DomTreeUpdater &DTU) { in tryToSplitCallSite() argument
493 auto PredsWithConds = shouldSplitOnPredicatedArgument(CB, DTU); in tryToSplitCallSite()
499 splitCallSite(CB, PredsWithConds, DTU); in tryToSplitCallSite()
[all …]
DPartiallyInlineLibCalls.cpp35 const TargetTransformInfo *TTI, DomTreeUpdater *DTU) { in optimizeSQRT() argument
63 /*BranchWeights*/ nullptr, DTU); in optimizeSQRT()
106 Optional<DomTreeUpdater> DTU; in runPartiallyInlineLibCalls() local
108 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy); in runPartiallyInlineLibCalls()
139 DTU.hasValue() ? DTU.getPointer() : nullptr)) in runPartiallyInlineLibCalls()
DDFAJumpThreading.cpp128 void unfold(DomTreeUpdater *DTU, SelectInstToUnfold SIToUnfold,
144 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in unfoldSelectInstrs() local
155 unfold(&DTU, SIToUnfold, &NewSIsToUnfold, &NewBBs); in unfoldSelectInstrs()
217 DomTreeUpdater *DTU, SelectInst *SI, PHINode *SIUse, SelectInst *SIToSink, in createBasicBlockAndSinkSelectInst() argument
230 DTU->applyUpdates({{DominatorTree::Insert, *NewBlock, EndBlock}}); in createBasicBlockAndSinkSelectInst()
240 void unfold(DomTreeUpdater *DTU, SelectInstToUnfold SIToUnfold, in unfold() argument
262 createBasicBlockAndSinkSelectInst(DTU, SI, SIUse, SIOp, EndBlock, in unfold()
267 createBasicBlockAndSinkSelectInst(DTU, SI, SIUse, SIOp, EndBlock, in unfold()
279 DTU->applyUpdates({{DominatorTree::Insert, FalseBlock, EndBlock}}); in unfold()
339 DTU->applyUpdates({{DominatorTree::Insert, StartBlock, TT}, in unfold()
[all …]
DTailRecursionElimination.cpp402 DomTreeUpdater &DTU; member in __anon0c1184080511::TailRecursionEliminator
432 DomTreeUpdater &DTU) in TailRecursionEliminator() argument
433 : F(F), TTI(TTI), AA(AA), ORE(ORE), DTU(DTU) {} in TailRecursionEliminator()
454 DomTreeUpdater &DTU);
550 DTU.recalculate(*NewEntry->getParent()); in createTailRecurseLoopHeader()
724 DTU.applyUpdates({{DominatorTree::Insert, BB, HeaderBB}}); in eliminateCall()
821 FoldReturnIntoUncondBranch(Ret, Succ, &BB, &DTU); in processBlock()
830 DTU.deleteBB(Succ); in processBlock()
848 DomTreeUpdater &DTU) { in eliminate() argument
864 TailRecursionEliminator TRE(F, TTI, AA, ORE, DTU); in eliminate()
[all …]
DMergeICmps.cpp405 DomTreeUpdater &DTU);
594 AliasAnalysis &AA, DomTreeUpdater &DTU) { in mergeComparisons() argument
651 DTU.applyUpdates({{DominatorTree::Insert, BB, PhiBB}}); in mergeComparisons()
656 DTU.applyUpdates({{DominatorTree::Insert, BB, NextCmpBlock}, in mergeComparisons()
663 DomTreeUpdater &DTU) { in simplify() argument
682 const auto mergeRange = [this, &TLI, &AA, &DTU](int I, int Num, in simplify()
686 InsertBefore, Next, Phi_, TLI, AA, DTU); in simplify()
714 DTU.applyUpdates({{DominatorTree::Delete, Pred, EntryBlock_}, in simplify()
721 if (ChainEntryIsFnEntry && DTU.hasDomTree()) { in simplify()
725 DTU.getDomTree().setNewRoot(NextCmpBlock); in simplify()
[all …]
DSCCP.cpp346 DomTreeUpdater &DTU) { in removeNonFeasibleEdges() argument
385 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
402 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
523 DomTreeUpdater DTU = Solver.getDTU(F); in runIPSCCP() local
530 /*PreserveLCSSA=*/false, &DTU); in runIPSCCP()
534 /*PreserveLCSSA=*/false, &DTU); in runIPSCCP()
537 MadeChanges |= removeNonFeasibleEdges(Solver, &BB, DTU); in runIPSCCP()
540 DTU.deleteBB(DeadBB); in runIPSCCP()
DLoopSimplifyCFG.cpp126 DomTreeUpdater DTU; member in __anon7bf19fa20111::ConstantTerminatorFoldingImpl
420 DTU.applyUpdates(DTUpdates); in handleDeadExits()
473 DTU.applyUpdates(DTUpdates); in deleteDeadLoopBlocks()
476 DTU.deleteBB(BB); in deleteDeadLoopBlocks()
536 DTU(DT, DomTreeUpdater::UpdateStrategy::Eager) {} in ConstantTerminatorFoldingImpl()
600 DTU.applyUpdates(DTUpdates); in run()
652 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in mergeBlocksIntoPredecessors() local
669 MergeBlockIntoPredecessor(Succ, &DTU, &LI, MSSAU); in mergeBlocksIntoPredecessors()
DJumpThreading.cpp325 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Lazy); in runOnFunction() local
334 bool Changed = Impl.runImpl(F, TLI, LVI, AA, &DTU, F.hasProfileData(), in runOnFunction()
338 LVI->printLVI(F, DTU.getDomTree(), dbgs()); in runOnFunction()
353 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in run() local
363 bool Changed = runImpl(F, &TLI, &LVI, &AA, &DTU, F.hasProfileData(), in run()
368 LVI.printLVI(F, DTU.getDomTree(), dbgs()); in run()
388 DTU = DTU_; in runImpl()
414 assert(DTU && "DTU isn't passed into JumpThreading before using it."); in runImpl()
415 assert(DTU->hasDomTree() && "JumpThreading relies on DomTree to proceed."); in runImpl()
416 DominatorTree &DT = DTU->getDomTree(); in runImpl()
[all …]
DLoopFuse.cpp543 DomTreeUpdater DTU; member
560 : LDT(LI), DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy), LI(LI), in LoopFuser()
817 DTU.applyUpdates(TreeUpdates); in peelFusionCandidate()
818 DTU.flush(); in peelFusionCandidate()
1290 MergeBlockIntoPredecessor(Succ, &DTU, &LI); in mergeLatch()
1291 DTU.flush(); in mergeLatch()
1466 DTU.applyUpdates(TreeUpdates); in performFusion()
1469 DTU.deleteBB(FC1.Preheader); in performFusion()
1472 DTU.deleteBB(FC0.ExitBlock); in performFusion()
1475 DTU.flush(); in performFusion()
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp89 void llvm::DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU, in DeleteDeadBlock() argument
91 DeleteDeadBlocks({BB}, DTU, KeepOneInputPHIs); in DeleteDeadBlock()
94 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU, in DeleteDeadBlocks() argument
106 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks()
108 if (DTU) in DeleteDeadBlocks()
109 DTU->applyUpdates(Updates); in DeleteDeadBlocks()
112 if (DTU) in DeleteDeadBlocks()
113 DTU->deleteBB(BB); in DeleteDeadBlocks()
118 bool llvm::EliminateUnreachableBlocks(Function &F, DomTreeUpdater *DTU, in EliminateUnreachableBlocks() argument
133 DeleteDeadBlocks(DeadBlocks, DTU, KeepOneInputPHIs); in EliminateUnreachableBlocks()
[all …]
DSimplifyCFG.cpp219 DomTreeUpdater *DTU; member in __anon0a8a7a230111::SimplifyCFGOpt
265 SimplifyCFGOpt(const TargetTransformInfo &TTI, DomTreeUpdater *DTU, in SimplifyCFGOpt() argument
268 : TTI(TTI), DTU(DTU), DL(DL), LoopHeaders(LoopHeaders), Options(Opts) { in SimplifyCFGOpt()
269 assert((!DTU || !DTU->hasPostDomTree()) && in SimplifyCFGOpt()
893 if (DTU) in SimplifyEqualityComparisonWithOnlyPredecessor()
894 DTU->applyUpdates( in SimplifyEqualityComparisonWithOnlyPredecessor()
913 if (DTU) in SimplifyEqualityComparisonWithOnlyPredecessor()
918 if (DTU) in SimplifyEqualityComparisonWithOnlyPredecessor()
923 if (DTU) { in SimplifyEqualityComparisonWithOnlyPredecessor()
928 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor()
[all …]
DMatrixUtils.cpp25 IRBuilderBase &B, DomTreeUpdater &DTU, Loop *L, in CreateLoop() argument
51 DTU.applyUpdatesPermissive({ in CreateLoop()
71 IRBuilderBase &B, DomTreeUpdater &DTU, in CreateTiledLoops() argument
85 "cols", B, DTU, ColLoop, LI); in CreateTiledLoops()
89 "rows", B, DTU, RowLoop, LI); in CreateTiledLoops()
94 B.getInt64(TileSize), "inner", B, DTU, InnerLoop, LI); in CreateTiledLoops()
DLocal.cpp130 DomTreeUpdater *DTU) { in ConstantFoldTerminator() argument
182 if (DTU) in ConstantFoldTerminator()
183 DTU->applyUpdates({{DominatorTree::Delete, BB, OldDest}}); in ConstantFoldTerminator()
275 if (DTU && Succ != TheOnlyDest) in ConstantFoldTerminator()
290 if (DTU) { in ConstantFoldTerminator()
295 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
350 if (DTU && DestBB != TheOnlyDest) in ConstantFoldTerminator()
377 if (DTU) { in ConstantFoldTerminator()
382 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
742 DomTreeUpdater *DTU) { in MergeBasicBlockIntoOnlyPred() argument
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DIndirectBrExpandPass.cpp97 Optional<DomTreeUpdater> DTU; in runOnFunction() local
99 DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy); in runOnFunction()
175 if (DTU) in runOnFunction()
178 if (DTU) { in runOnFunction()
185 if (DTU) { in runOnFunction()
188 DTU->applyUpdates(Updates); in runOnFunction()
219 if (DTU) { in runOnFunction()
238 if (DTU) in runOnFunction()
243 if (DTU) { in runOnFunction()
260 if (DTU) { in runOnFunction()
[all …]
DExpandMemCmp.cpp81 DomTreeUpdater *DTU; member in __anon299ff9eb0111::MemCmpExpansion
131 DomTreeUpdater *DTU);
221 DomTreeUpdater *DTU) in MemCmpExpansion() argument
224 IsUsedForZeroCmp(IsUsedForZeroCmp), DL(TheDataLayout), DTU(DTU), in MemCmpExpansion()
351 if (DTU) in emitLoadCompareByteBlock()
352 DTU->applyUpdates( in emitLoadCompareByteBlock()
359 if (DTU) in emitLoadCompareByteBlock()
360 DTU->applyUpdates({{DominatorTree::Insert, BB, EndBlock}}); in emitLoadCompareByteBlock()
448 if (DTU) in emitLoadCompareBlockMultipleLoads()
449 DTU->applyUpdates({{DominatorTree::Insert, BB, ResBlock.BB}, in emitLoadCompareBlockMultipleLoads()
[all …]
DDwarfEHPrepare.cpp62 DomTreeUpdater *DTU; member in __anonc2cdf2bc0111::DwarfEHPrepare
85 DTU(DTU_), TTI(TTI_) {} in DwarfEHPrepare()
132 assert(DTU && "Should have DomTreeUpdater here."); in pruneUnreachableResumes()
138 if (isPotentiallyReachable(LP, RI, nullptr, &DTU->getDomTree())) { in pruneUnreachableResumes()
162 simplifyCFG(BB, *TTI, DTU); in pruneUnreachableResumes()
268 if (DTU) in InsertUnwindResumeCalls()
269 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
284 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in prepareDwarfEH() local
286 return DwarfEHPrepare(OptLevel, RewindFunction, F, TLI, DT ? &DTU : nullptr, in prepareDwarfEH()
DShadowStackGCLowering.cpp309 Optional<DomTreeUpdater> DTU; in runOnFunction() local
311 DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy); in runOnFunction()
365 DTU.hasValue() ? DTU.getPointer() : nullptr); in runOnFunction()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h54 void DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU = nullptr,
64 DomTreeUpdater *DTU = nullptr,
70 bool EliminateUnreachableBlocks(Function &F, DomTreeUpdater *DTU = nullptr,
94 bool MergeBlockIntoPredecessor(BasicBlock *BB, DomTreeUpdater *DTU = nullptr,
109 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr);
311 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr,
321 DomTreeUpdater *DTU, LoopInfo *LI,
362 DomTreeUpdater *DTU = nullptr,
402 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr,
411 DomTreeUpdater *DTU = nullptr);
[all …]
DLocal.h74 DomTreeUpdater *DTU = nullptr);
154 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, DomTreeUpdater *DTU = nullptr);
161 DomTreeUpdater *DTU = nullptr);
176 DomTreeUpdater *DTU = nullptr,
188 bool FoldBranchToCommonDest(BranchInst *BI, llvm::DomTreeUpdater *DTU = nullptr,
237 void changeToCall(InvokeInst *II, DomTreeUpdater *DTU = nullptr);
332 DomTreeUpdater *DTU = nullptr,
341 DomTreeUpdater *DTU = nullptr);
349 void removeUnwindEdge(BasicBlock *BB, DomTreeUpdater *DTU = nullptr);
354 bool removeUnreachableBlocks(Function &F, DomTreeUpdater *DTU = nullptr,
DEscapeEnumerator.h38 DomTreeUpdater *DTU; variable
42 bool HandleExceptions = true, DomTreeUpdater *DTU = nullptr)
45 HandleExceptions(HandleExceptions), DTU(DTU) {} in F()
DMatrixUtils.h79 IRBuilderBase &B, DomTreeUpdater &DTU,
89 IRBuilderBase &B, DomTreeUpdater &DTU, Loop *L,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
DAMDGPUUnifyDivergentExitNodes.cpp69 BasicBlock *unifyReturnBlockSet(Function &F, DomTreeUpdater &DTU,
137 Function &F, DomTreeUpdater &DTU, ArrayRef<BasicBlock *> ReturningBlocks, in unifyReturnBlockSet() argument
172 DTU.applyUpdates(Updates); in unifyReturnBlockSet()
177 simplifyCFG(BB, *TTI, RequireAndPreserveDomTree ? &DTU : nullptr, in unifyReturnBlockSet()
306 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in runOnFunction() local
308 DTU.applyUpdates(Updates); in runOnFunction()
318 unifyReturnBlockSet(F, DTU, ReturningBlocks, "UnifiedReturnBlock"); in runOnFunction()

12