| /freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.h | 40 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc
139 DomTree(nullptr), Alloc(nullptr) {}
|
| H A D | LiveRangeCalc.cpp | 36 DomTree = MDT;
226 assert(DomTree && "Missing dominator tree");
252 assert(DomTree && "Missing dominator tree");
361 addLiveInBlock(LR, DomTree->getNode(MBB));
374 assert(DomTree && "Missing dominator tree");
401 // Cache the DomTree node that defined the value.
404 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
412 // Cache the DomTree node that defined the value.
415 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
420 if (DomTree
[all...] |
| H A D | EarlyIfConversion.cpp | 594 MachineDominatorTree *DomTree; member in class:__anon2453::EarlyIfConverter
643 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head);
645 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]);
649 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode);
651 DomTree->eraseNode(Removed[i]);
797 DomTree = &getAnalysis<MachineDominatorTree>();
809 for (auto DomNode : post_order(DomTree))
|
| H A D | LiveIntervalAnalysis.cpp | 94 DomTree(nullptr), LRCalc(nullptr) {
128 DomTree = &getAnalysis<MachineDominatorTree>();
201 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
271 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
600 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
|
| H A D | RegAllocGreedy.cpp | 126 MachineDominatorTree *DomTree; member in class:__anon2514::RAGreedy
2580 DomTree = &getAnalysis<MachineDominatorTree>();
2594 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree, *MBFI));
|
| /freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 348 const DominatorTreeBase<BlockT> &DomTree) {
362 if (!DomTree.isReachableFromEntry(PredBB))
471 analyze(const DominatorTreeBase<BlockT> &DomTree) { argument
474 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode();
489 if (DomTree.dominates(Header, Backedge)
490 && DomTree.isReachableFromEntry(Backedge)) {
497 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
346 discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges, LoopInfoBase<BlockT, LoopT> *LI, const DominatorTreeBase<BlockT> &DomTree) argument
|
| H A D | LoopInfo.h | 621 void analyze(const DominatorTreeBase<BlockT> &DomTree);
641 explicit LoopInfo(const DominatorTreeBase<BasicBlock> &DomTree);
|
| /freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 730 MachineDominatorTree *DomTree; member in class:__anon2690::AArch64ConditionalCompares
788 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head);
790 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB);
794 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode);
795 DomTree->eraseNode(RemovedMBB);
898 DomTree = &getAnalysis<MachineDominatorTree>();
909 // Note that updateDomTree() modifies the children of the DomTree node
912 for (auto *I : depth_first(DomTree))
|
| H A D | AArch64ConditionOptimizer.cpp | 90 MachineDominatorTree *DomTree; member in class:__anon2688::AArch64ConditionOptimizer
315 DomTree = &getAnalysis<MachineDominatorTree>();
322 // Note that updateDomTree() modifies the children of the DomTree node
325 for (MachineDomTreeNode *I : depth_first(DomTree)) {
|
| /freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
| H A D | LiveIntervalAnalysis.h | 60 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
|
| /freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
| H A D | LoopInfo.cpp | 636 LoopInfo::LoopInfo(const DominatorTreeBase<BasicBlock> &DomTree) {
637 analyze(DomTree);
|
| /freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 144 DominatorTreeBase<BasicBlock> *DomTree);
730 /// \param DomTree Opposite dominator tree. If \p Descendants is filled
735 DominatorTreeBase<BasicBlock> *DomTree) {
739 bool IsDomParent = DomTree->dominates(BB2, BB1);
733 findEquivalencesFor( BasicBlock *BB1, SmallVector<BasicBlock *, 8> Descendants, DominatorTreeBase<BasicBlock> *DomTree) argument
|
| /freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 70 NearestCommonDominator(DominatorTree *DomTree) { argument
71 DT = DomTree;
|