/external/llvm/lib/CodeGen/ |
H A D | LiveRangeCalc.cpp | 29 DomTree = MDT; 137 assert(DomTree && "Missing dominator tree"); 163 assert(DomTree && "Missing dominator tree"); 267 addLiveInBlock(LR, DomTree->getNode(MBB)); 280 assert(DomTree && "Missing dominator tree"); 308 // Cache the DomTree node that defined the value. 311 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); 319 // Cache the DomTree node that defined the value. 322 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); 327 if (DomTree [all...] |
H A D | LiveRangeCalc.h | 40 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc 129 DomTree(nullptr), Alloc(nullptr) {}
|
H A D | EarlyIfConversion.cpp | 585 MachineDominatorTree *DomTree; member in class:__anon25740::EarlyIfConverter 634 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); 636 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]); 640 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode); 642 DomTree->eraseNode(Removed[i]); 790 DomTree = &getAnalysis<MachineDominatorTree>(); 803 I = po_begin(DomTree), E = po_end(DomTree); I != E; ++I)
|
H A D | LiveIntervalAnalysis.cpp | 83 DomTree(nullptr), LRCalc(nullptr) { 118 DomTree = &getAnalysis<MachineDominatorTree>(); 186 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); 239 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); 460 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
|
H A D | RegAllocGreedy.cpp | 118 MachineDominatorTree *DomTree; member in class:__anon25792::RAGreedy 2338 DomTree = &getAnalysis<MachineDominatorTree>(); 2352 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree, *MBFI));
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 348 DominatorTreeBase<BlockT> &DomTree) { 362 if (!DomTree.isReachableFromEntry(PredBB)) 499 Analyze(DominatorTreeBase<BlockT> &DomTree) { argument 502 DomTreeNodeBase<BlockT>* DomRoot = DomTree.getRootNode(); 518 if (DomTree.dominates(Header, Backedge) 519 && DomTree.isReachableFromEntry(Backedge)) { 526 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree); 346 discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges, LoopInfoBase<BlockT, LoopT> *LI, DominatorTreeBase<BlockT> &DomTree) argument
|
H A D | LoopInfo.h | 617 void Analyze(DominatorTreeBase<BlockT> &DomTree);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionalCompares.cpp | 730 MachineDominatorTree *DomTree; member in class:__anon25936::AArch64ConditionalCompares 788 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); 790 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]); 794 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode); 795 DomTree->eraseNode(Removed[i]); 899 DomTree = &getAnalysis<MachineDominatorTree>(); 911 // Note that updateDomTree() modifies the children of the DomTree node 914 for (auto *I : depth_first(DomTree))
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SampleProfile.cpp | 127 bool emitAnnotations(Function &F, DominatorTree *DomTree, 145 DominatorTreeBase<BasicBlock> *DomTree); 623 /// \param DomTree Opposite dominator tree. If \p Descendants is filled 628 DominatorTreeBase<BasicBlock> *DomTree) { 633 bool IsDomParent = DomTree->dominates(BB2, BB1); 1036 bool SampleFunctionProfile::emitAnnotations(Function &F, DominatorTree *DomTree, argument 1048 DT = DomTree; 626 findEquivalencesFor( BasicBlock *BB1, SmallVector<BasicBlock *, 8> Descendants, DominatorTreeBase<BasicBlock> *DomTree) argument
|
H A D | StructurizeCFG.cpp | 66 NearestCommonDominator(DominatorTree *DomTree) { argument 67 DT = DomTree;
|
/external/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalAnalysis.h | 58 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
|