Searched refs:DomTree (Results 1 - 9 of 9) sorted by relevance
| /freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 28 DomTree = MDT;
138 assert(DomTree && "Missing dominator tree");
164 assert(DomTree && "Missing dominator tree");
268 addLiveInBlock(LR, DomTree->getNode(MBB));
281 assert(DomTree && "Missing dominator tree");
309 // Cache the DomTree node that defined the value.
312 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
320 // Cache the DomTree node that defined the value.
323 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
328 if (DomTree
[all...] |
| H A D | LiveRangeCalc.h | 40 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc
128 LiveRangeCalc() : MF(0), MRI(0), Indexes(0), DomTree(0), Alloc(0) {}
|
| H A D | EarlyIfConversion.cpp | 584 MachineDominatorTree *DomTree; member in class:__anon2117::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 D | LiveIntervalAnalysis.cpp | 81 DomTree(0), LRCalc(0) {
116 DomTree = &getAnalysis<MachineDominatorTree>();
184 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
236 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
447 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
|
| H A D | RegAllocGreedy.cpp | 76 MachineDominatorTree *DomTree; member in class:__anon2170::RAGreedy
1834 DomTree = &getAnalysis<MachineDominatorTree>();
1846 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree, *MBFI));
|
| /freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 347 DominatorTreeBase<BlockT> &DomTree) {
361 if (!DomTree.isReachableFromEntry(PredBB))
498 Analyze(DominatorTreeBase<BlockT> &DomTree) { argument
501 DomTreeNodeBase<BlockT>* DomRoot = DomTree.getRootNode();
517 if (DomTree.dominates(Header, Backedge)
518 && DomTree.isReachableFromEntry(Backedge)) {
525 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
345 discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges, LoopInfoBase<BlockT, LoopT> *LI, DominatorTreeBase<BlockT> &DomTree) argument
|
| H A D | LoopInfo.h | 577 void Analyze(DominatorTreeBase<BlockT> &DomTree);
|
| /freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
| H A D | LiveIntervalAnalysis.h | 57 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 65 NearestCommonDominator(DominatorTree *DomTree) { argument
66 DT = DomTree;
|
Completed in 146 milliseconds