Searched refs:DomTree (Results 1 - 9 of 9) sorted by relevance

/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp28 DomTree = MDT;
141 assert(DomTree && "Missing dominator tree");
167 assert(DomTree && "Missing dominator tree");
273 addLiveInBlock(LI, DomTree->getNode(MBB));
286 assert(DomTree && "Missing dominator tree");
314 // Cache the DomTree node that defined the value.
317 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
325 // Cache the DomTree node that defined the value.
328 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
333 if (DomTree
[all...]
H A DLiveRangeCalc.h40 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc
130 LiveRangeCalc() : MF(0), MRI(0), Indexes(0), DomTree(0), Alloc(0) {}
H A DEarlyIfConversion.cpp584 MachineDominatorTree *DomTree; member in class:__anon2148::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]);
783 DomTree = &getAnalysis<MachineDominatorTree>();
796 I = po_begin(DomTree), E = po_end(DomTree); I != E; ++I)
H A DLiveIntervalAnalysis.cpp72 DomTree(0), LRCalc(0) {
107 DomTree = &getAnalysis<MachineDominatorTree>();
168 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
224 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
437 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
H A DRegAllocGreedy.cpp74 MachineDominatorTree *DomTree; member in class:__anon2201::RAGreedy
1773 DomTree = &getAnalysis<MachineDominatorTree>();
1781 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree));
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h367 DominatorTreeBase<BlockT> &DomTree) {
381 if (!DomTree.isReachableFromEntry(PredBB))
519 Analyze(DominatorTreeBase<BlockT> &DomTree) { argument
522 DomTreeNodeBase<BlockT>* DomRoot = DomTree.getRootNode();
538 if (DomTree.dominates(Header, Backedge)
539 && DomTree.isReachableFromEntry(Backedge)) {
546 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
365 discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges, LoopInfoBase<BlockT, LoopT> *LI, DominatorTreeBase<BlockT> &DomTree) argument
H A DLoopInfo.h546 void Analyze(DominatorTreeBase<BlockT> &DomTree);
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DLiveIntervalAnalysis.h56 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDGPUStructurizeCFG.cpp73 NearestCommonDominator(DominatorTree *DomTree) { argument
74 DT = DomTree;

Completed in 180 milliseconds