| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| EscapeEnumerator.h | 38 DomTreeUpdater *DTU;
42 bool HandleExceptions = true, DomTreeUpdater *DTU = nullptr)
45 HandleExceptions(HandleExceptions), DTU(DTU) {}
|
| Local.h | 74 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);
333 DomTreeUpdater *DTU = nullptr,
342 DomTreeUpdater *DTU = nullptr);
350 void removeUnwindEdge(BasicBlock *BB, DomTreeUpdater *DTU = nullptr);
355 bool removeUnreachableBlocks(Function &F, DomTreeUpdater *DTU = nullptr
[all...] |
| BasicBlockUtils.h | 54 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...] |
| MatrixUtils.h | 79 IRBuilderBase &B, DomTreeUpdater &DTU,
86 /// tree updates to \p DTU.
89 IRBuilderBase &B, DomTreeUpdater &DTU, Loop *L,
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 82 static bool mergeEmptyReturnBlocks(Function &F, DomTreeUpdater *DTU) {
92 if (DTU && DTU->isBBPendingDeletion(&BB))
145 if (DTU) {
183 if (DTU)
187 if (DTU)
188 DTU->applyUpdates(Updates);
190 DeleteDeadBlocks(DeadBlocks, DTU);
198 DomTreeUpdater *DTU,
218 if (DTU) {
[all...] |
| LowerConstantIntrinsics.cpp | 56 DomTreeUpdater *DTU) {
84 if (DTU)
85 DTU->applyUpdates({{DominatorTree::Delete, Source, Other}});
95 Optional<DomTreeUpdater> DTU;
97 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy);
142 II, NewValue, DTU.hasValue() ? DTU.getPointer() : nullptr);
145 removeUnreachableBlocks(F, DTU.hasValue() ? DTU.getPointer() : nullptr);
|
| PartiallyInlineLibCalls.cpp | 35 const TargetTransformInfo *TTI, DomTreeUpdater *DTU) {
63 /*BranchWeights*/ nullptr, DTU);
106 Optional<DomTreeUpdater> DTU;
108 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy);
139 DTU.hasValue() ? DTU.getPointer() : nullptr))
|
| CallSiteSplitting.cpp | 307 DomTreeUpdater &DTU) {
331 DTU);
370 DTU.applyUpdatesPermissive({{DominatorTree::Delete, Splits[i], TailBB}});
374 DTU.deleteBB(TailBB);
456 DomTreeUpdater &DTU) {
465 assert(DTU.hasDomTree() && "We need a DTU with a valid DT!");
466 auto *CSDTNode = DTU.getDomTree().getNode(CB.getParent());
488 DomTreeUpdater &DTU) {
493 auto PredsWithConds = shouldSplitOnPredicatedArgument(CB, DTU);
[all...] |
| ScalarizeMaskedMemIntrin.cpp | 73 DomTreeUpdater *DTU);
76 const DataLayout &DL, DomTreeUpdater *DTU);
146 DomTreeUpdater *DTU, bool &ModifiedDT) {
231 /*BranchWeights=*/nullptr, DTU);
288 DomTreeUpdater *DTU, bool &ModifiedDT) {
365 /*BranchWeights=*/nullptr, DTU);
416 DomTreeUpdater *DTU, bool &ModifiedDT) {
487 /*BranchWeights=*/nullptr, DTU);
546 DomTreeUpdater *DTU, bool &ModifiedDT) {
614 /*BranchWeights=*/nullptr, DTU);
[all...] |
| TailRecursionElimination.cpp | 398 DomTreeUpdater &DTU;
429 DomTreeUpdater &DTU)
430 : F(F), TTI(TTI), AA(AA), ORE(ORE), DTU(DTU) {}
448 DomTreeUpdater &DTU);
558 DTU.recalculate(*NewEntry->getParent());
676 DTU.applyUpdates({{DominatorTree::Insert, BB, HeaderBB}});
774 FoldReturnIntoUncondBranch(Ret, Succ, &BB, &DTU);
783 DTU.deleteBB(Succ);
801 DomTreeUpdater &DTU) {
[all...] |
| MergeICmps.cpp | 419 DomTreeUpdater &DTU);
609 AliasAnalysis &AA, DomTreeUpdater &DTU) {
666 DTU.applyUpdates({{DominatorTree::Insert, BB, PhiBB}});
671 DTU.applyUpdates({{DominatorTree::Insert, BB, NextCmpBlock},
678 DomTreeUpdater &DTU) {
697 const auto mergeRange = [this, &TLI, &AA, &DTU](int I, int Num,
701 InsertBefore, Next, Phi_, TLI, AA, DTU);
729 DTU.applyUpdates({{DominatorTree::Delete, Pred, EntryBlock_},
736 if (ChainEntryIsFnEntry && DTU.hasDomTree()) {
740 DTU.getDomTree().setNewRoot(NextCmpBlock)
[all...] |
| LoopSimplifyCFG.cpp | 126 DomTreeUpdater DTU;
420 DTU.applyUpdates(DTUpdates);
473 DTU.applyUpdates(DTUpdates);
476 DTU.deleteBB(BB);
536 DTU(DT, DomTreeUpdater::UpdateStrategy::Eager) {}
600 DTU.applyUpdates(DTUpdates);
652 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager);
669 MergeBlockIntoPredecessor(Succ, &DTU, &LI, MSSAU);
|
| SCCP.cpp | 349 DomTreeUpdater &DTU) {
388 DTU.applyUpdatesPermissive(Updates);
405 DTU.applyUpdatesPermissive(Updates);
526 DomTreeUpdater DTU = Solver.getDTU(F);
534 /*PreserveLCSSA=*/false, &DTU);
539 /*PreserveLCSSA=*/false, &DTU);
542 MadeChanges |= removeNonFeasibleEdges(Solver, &BB, DTU);
545 DTU.deleteBB(DeadBB);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| IndirectBrExpandPass.cpp | 97 Optional<DomTreeUpdater> DTU;
99 DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy);
175 if (DTU)
178 if (DTU) {
185 if (DTU) {
188 DTU->applyUpdates(Updates);
219 if (DTU) {
238 if (DTU)
243 if (DTU) {
260 if (DTU) {
[all...] |
| ExpandMemCmp.cpp | 81 DomTreeUpdater *DTU;
131 DomTreeUpdater *DTU);
221 DomTreeUpdater *DTU)
224 IsUsedForZeroCmp(IsUsedForZeroCmp), DL(TheDataLayout), DTU(DTU),
351 if (DTU)
352 DTU->applyUpdates(
359 if (DTU)
360 DTU->applyUpdates({{DominatorTree::Insert, BB, EndBlock}});
448 if (DTU)
[all...] |
| DwarfEHPrepare.cpp | 56 DomTreeUpdater *DTU;
79 DTU(DTU_), TTI(TTI_) {}
126 assert(DTU && "Should have DomTreeUpdater here.");
132 if (isPotentiallyReachable(LP, RI, nullptr, &DTU->getDomTree())) {
156 simplifyCFG(BB, *TTI, DTU);
245 if (DTU)
246 DTU->applyUpdates(Updates);
261 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
263 return DwarfEHPrepare(OptLevel, RewindFunction, F, TLI, DT ? &DTU : nullptr,
|
| WasmEHPrepare.cpp | 162 static void eraseDeadBBsAndChildren(const Container &BBs, DomTreeUpdater *DTU) {
169 DeleteDeadBlock(BB, DTU);
182 DomTreeUpdater DTU(&DT, /*PostDominatorTree*/ nullptr,
206 eraseDeadBBsAndChildren(Succs, &DTU);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| MatrixUtils.cpp | 25 IRBuilderBase &B, DomTreeUpdater &DTU, Loop *L,
51 DTU.applyUpdatesPermissive({
71 IRBuilderBase &B, DomTreeUpdater &DTU,
85 "cols", B, DTU, ColLoop, LI);
89 "rows", B, DTU, RowLoop, LI);
94 B.getInt64(TileSize), "inner", B, DTU, InnerLoop, LI);
|
| BasicBlockUtils.cpp | 85 "applying corresponding DTU updates.");
89 void llvm::DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU,
91 DeleteDeadBlocks({BB}, DTU, KeepOneInputPHIs);
94 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU,
106 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs);
108 if (DTU)
109 DTU->applyUpdates(Updates);
112 if (DTU)
113 DTU->deleteBB(BB);
118 bool llvm::EliminateUnreachableBlocks(Function &F, DomTreeUpdater *DTU,
[all...] |
| SimplifyCFG.cpp | 223 DomTreeUpdater *DTU;
271 SimplifyCFGOpt(const TargetTransformInfo &TTI, DomTreeUpdater *DTU,
274 : TTI(TTI), DTU(DTU), DL(DL), LoopHeaders(LoopHeaders), Options(Opts) {
275 assert((!DTU || !DTU->hasPostDomTree()) &&
899 if (DTU)
900 DTU->applyUpdates(
919 if (DTU)
924 if (DTU)
[all...] |
| Local.cpp | 130 DomTreeUpdater *DTU) {
182 if (DTU)
183 DTU->applyUpdates({{DominatorTree::Delete, BB, OldDest}});
275 if (DTU && Succ != TheOnlyDest)
290 if (DTU) {
295 DTU->applyUpdates(Updates);
350 if (DTU && DestBB != TheOnlyDest)
377 if (DTU) {
382 DTU->applyUpdates(Updates);
727 DomTreeUpdater *DTU) {
[all...] |
| EscapeEnumerator.cpp | 93 changeToInvokeAndSplitBasicBlock(CI, CleanupBB, DTU);
|
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 104 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
127 DTU.deleteBB(&BB);
132 DTU.applyUpdatesPermissive(DTUpdates);
176 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
212 DTU.applyUpdatesPermissive(DTUpdates);
221 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
259 DTU.applyUpdatesPermissive(DTUpdates);
308 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
323 // Tell DTU about the changes to the CFG: All edges from BB to its
346 DTU.deleteBB(&BB)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUUnifyDivergentExitNodes.cpp | 69 BasicBlock *unifyReturnBlockSet(Function &F, DomTreeUpdater &DTU,
152 Function &F, DomTreeUpdater &DTU, ArrayRef<BasicBlock *> ReturningBlocks,
205 DTU.applyUpdates(Updates);
210 simplifyCFG(BB, *TTI, RequireAndPreserveDomTree ? &DTU : nullptr,
376 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager);
378 DTU.applyUpdates(Updates);
398 unifyReturnBlockSet(F, DTU, BlocksToUnify, InsertExport,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 83 DomTreeUpdater *DTU;
103 AAResults *AA, DomTreeUpdater *DTU, bool HasProfileData,
|
