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

/external/llvm/lib/CodeGen/
H A DLiveRangeCalc.h40 MachineDominatorTree *DomTree; member in class:llvm::LiveRangeCalc
129 DomTree(nullptr), Alloc(nullptr) {}
H A DEarlyIfConversion.cpp585 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 DRegAllocGreedy.cpp118 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/CodeGen/
H A DLiveIntervalAnalysis.h58 MachineDominatorTree *DomTree; member in class:llvm::LiveIntervals
/external/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h348 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
/external/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp730 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 DSampleProfile.cpp127 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 DStructurizeCFG.cpp66 NearestCommonDominator(DominatorTree *DomTree) { argument
67 DT = DomTree;

Completed in 240 milliseconds