Searched defs:DomTree (Results 1 - 5 of 5) sorted by relevance

/external/llvm/lib/CodeGen/
H A DLiveRangeCalc.h39 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc
127 LiveRangeCalc() : MRI(0), Indexes(0), DomTree(0), Alloc(0) {}
H A DEarlyIfConversion.cpp585 MachineDominatorTree *DomTree; member in class:__anon8656::EarlyIfConverter
633 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head);
635 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]);
639 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode);
641 DomTree->eraseNode(Removed[i]);
782 DomTree = &getAnalysis<MachineDominatorTree>();
795 I = po_begin(DomTree), E = po_end(DomTree); I != E; ++I)
H A DRegAllocGreedy.cpp76 MachineDominatorTree *DomTree; member in class:__anon8706::RAGreedy
1758 DomTree = &getAnalysis<MachineDominatorTree>();
1766 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree));
/external/llvm/include/llvm/CodeGen/
H A DLiveIntervalAnalysis.h58 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
/external/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h366 DominatorTreeBase<BlockT> &DomTree) {
380 if (!DomTree.isReachableFromEntry(PredBB))
518 Analyze(DominatorTreeBase<BlockT> &DomTree) { argument
521 DomTreeNodeBase<BlockT>* DomRoot = DomTree.getRootNode();
537 if (DomTree.dominates(Header, Backedge)
538 && DomTree.isReachableFromEntry(Backedge)) {
545 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
364 discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges, LoopInfoBase<BlockT, LoopT> *LI, DominatorTreeBase<BlockT> &DomTree) argument

Completed in 104 milliseconds