| /llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 55 DomTree = MDT; in reset()
90 assert(DomTree && "Missing dominator tree"); in extend()
116 assert(DomTree && "Missing dominator tree"); in calculateValues()
321 addLiveInBlock(LR, DomTree->getNode(MBB)); in findReachingDefs()
333 assert(DomTree && "Missing dominator tree"); in updateSSA()
360 // Cache the DomTree node that defined the value. in updateSSA()
364 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); in updateSSA()
376 // Cache the DomTree node that defined the value. in updateSSA()
379 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); in updateSSA()
384 if (DomTree in updateSSA()
[all...] |
| H A D | EarlyIfConversion.cpp | 769 MachineDominatorTree *DomTree = nullptr;
778 : DomTree(&DT), Loops(&LI), Traces(&MTM) {}
823 void updateDomTree(MachineDominatorTree *DomTree, const SSAIfConv &IfConv, in updateDomTree()
828 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateLoops()
830 MachineDomTreeNode *Node = DomTree->getNode(B); in updateLoops()
834 DomTree->changeImmediateDominator(Node->back(), HeadNode);
836 DomTree->eraseNode(B);
1082 updateDomTree(DomTree, IfConv, RemoveBlocks); in runOnMachineFunction()
1112 for (auto *DomNode : post_order(DomTree))
1161 MachineDominatorTree *DomTree in shouldConvertIf()
765 MachineDominatorTree *DomTree = nullptr; global() member in __anondae13cb90311::EarlyIfConverter
809 updateDomTree(MachineDominatorTree * DomTree,const SSAIfConv & IfConv,ArrayRef<MachineBasicBlock * > Removed) updateDomTree() argument
1118 MachineDominatorTree *DomTree = nullptr; global() member in __anondae13cb90b11::EarlyIfPredicator
[all...] |
| H A D | LiveIntervalCalc.cpp | 88 MachineDominatorTree *DomTree = getDomTree(); in calculate()
94 SubLIC.reset(MF, Indexes, DomTree, Alloc); in calculate()
89 MachineDominatorTree *DomTree = getDomTree(); calculate() local
|
| H A D | MachineUniformityAnalysis.cpp | 202 auto &DomTree = getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction() local
206 UI = computeMachineUniformityInfo(MF, CI, DomTree, true); in runOnMachineFunction()
|
| H A D | LiveIntervals.cpp | 90 LIS.DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in getAnalysisUsage()
232 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeRegMasks()
314 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
660 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in pruneValue()
1820 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
|
| H A D | RegAllocGreedy.h | 176 MachineDominatorTree *DomTree = nullptr;
175 MachineDominatorTree *DomTree = nullptr; global() variable
|
| /llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | LiveDebugValues.cpp | 112 MachineDominatorTree *DomTree = nullptr; in runOnMachineFunction()
114 DomTree = &MDT; in runOnMachineFunction()
119 return TheImpl->ExtendRanges(MF, DomTree, TPC, InputBBLimit, in runOnMachineFunction()
120 MachineDominatorTree *DomTree = nullptr; runOnMachineFunction() local
|
| H A D | LiveDebugValues.h | 27 virtual bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | InstrRefBasedImpl.h | 1155 MachineDominatorTree *DomTree;
1490 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| /llvm-project/mlir/include/mlir/IR/ |
| H A D | Dominance.h | 36 using DomTree = llvm::DominatorTreeBase<Block, IsPostDom>; variable
101 DomTree &getDomTree(Region *region) const { in getDomTree()
103 "Can't get DomTree for single block regions"); in getDomTree()
111 /// DomTree will be null for single-block regions. This lazily constructs the
112 /// DomTree on demand when needsDomTree=true.
113 llvm::PointerIntPair<DomTree *, 1, bool>
126 /// bit for them. We may also not have computed the DomTree yet. In either
127 /// case, the DomTree is just null.
129 mutable DenseMap<Region *, llvm::PointerIntPair<DomTree *, 1, bool>>
|
| /llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericLoopInfoImpl.h | 460 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop()
474 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
577 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze()
579 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
588 const DomTreeNodeBase<BlockT> *BackedgeNode = DomTree.getNode(Backedge); in analyze()
589 if (BackedgeNode && DomTree.dominates(DomNode, BackedgeNode)) in analyze()
595 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in getLoopsInPreorder()
719 const DomTreeBase<BlockT> &DomTree) const { in verify()
740 OtherLI.analyze(DomTree); in verify()
449 discoverAndMapSubloop(LoopT * L,ArrayRef<BlockT * > Backedges,LoopInfoBase<BlockT,LoopT> * LI,const DomTreeBase<BlockT> & DomTree) discoverAndMapSubloop() argument
566 analyze(const DomTreeBase<BlockT> & DomTree) analyze() argument
708 verify(const DomTreeBase<BlockT> & DomTree) verify() argument
|
| H A D | GenericLoopInfo.h | 693 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
698 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPURegBankSelect.cpp | 66 MachineDominatorTree &DomTree = INITIALIZE_PASS_DEPENDENCY() local
|
| /llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 766 MachineDominatorTree *DomTree;
822 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); in updateDomTree()
824 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB); in updateDomTree()
828 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
829 DomTree->eraseNode(RemovedMBB); in updateDomTree()
937 DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction()
949 // Note that updateDomTree() modifies the children of the DomTree node in runOnMachineFunction()
952 for (auto *I : depth_first(DomTree)) in runOnMachineFunction()
767 MachineDominatorTree *DomTree; global() member in __anon8ef305c80211::AArch64ConditionalCompares
|
| H A D | AArch64ConditionOptimizer.cpp | 96 MachineDominatorTree *DomTree; member in __anon2e3027840111::AArch64ConditionOptimizer
335 DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction()
345 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
|
| /llvm-project/mlir/lib/IR/ |
| H A D | Dominance.cpp | 54 /// DomTree will be null for single-block regions. This lazily constructs the
55 /// DomTree on demand when needsDomTree=true.
59 -> llvm::PointerIntPair<DomTree *, 1, bool> { in getDominanceInfo()
71 auto *domTree = new DomTree(); in getDominanceInfo()
78 // Nope, lazily construct it. Create a DomTree if this is a multi-block in getDominanceInfo()
81 auto *domTree = new DomTree(); in getDominanceInfo()
212 // DomTree. in findNearestCommonDominator()
300 // If the blocks are different, use DomTree to resolve the query. in properlyDominatesImpl()
313 // Otherwise this is some block in a multi-block region. Check DomTree. in properlyDominates()
|
| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | LiveRangeCalc.h | 49 MachineDominatorTree *DomTree = nullptr; variable
169 MachineDominatorTree *getDomTree() { return DomTree; } in getDomTree()
|
| H A D | LiveIntervals.h | 64 MachineDominatorTree *DomTree = nullptr;
104 : Indexes(&SI), DomTree(&DT) {
313 MachineDominatorTree &getDomTree() { return *DomTree; }
59 MachineDominatorTree *DomTree = nullptr; global() variable
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | InlineSizeEstimatorAnalysis.cpp | 157 auto &DomTree = FAM.getResult<DominatorTreeAnalysis>(F); in getFunctionFeatures() local
200 FF[NamedFeatureIndex::MaxDomTreeLevel] = getMaxDominatorTreeDepth(F, DomTree); in getFunctionFeatures()
|
| /llvm-project/llvm/test/Transforms/LoopDeletion/ |
| H A D | 2017-07-11-incremental-dt.ll | 6 ; Verify only the important parts of the DomTree.
|
| /llvm-project/llvm/test/Analysis/BasicAA/ |
| H A D | invalidation.ll | 4 ; Check DomTree specifically.
|
| /llvm-project/llvm/test/Transforms/LoopVectorize/ |
| H A D | pr36311.ll | 7 ; DomTree out of date, such that an assert from SCEV would trigger if
|
| /llvm-project/clang/unittests/Analysis/ |
| H A D | CFGDominatorTree.cpp | 17 TEST(CFGDominatorTree, DomTree) { in TEST() argument
|
| /llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 245 PostDominatorTreeT *DomTree);
593 /// \param DomTree Opposite dominator tree. If \p Descendants is filled
599 PostDominatorTreeT *DomTree) {
603 bool IsDomParent = DomTree->dominates(BB2, BB1);
|
| /llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 417 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
|