HomeSort by relevance Sort by last modified time
    Searched refs:DomTree (Results 1 - 8 of 8) sorted by null

  /external/llvm/lib/CodeGen/
LiveRangeCalc.cpp 27 DomTree = MDT;
124 // The value is live-through, update LiveOut as well. Defer the Domtree
140 assert(DomTree && "Missing dominator tree");
168 assert(DomTree && "Missing dominator tree");
246 addLiveInBlock(LI, DomTree->getNode(WorkList.pop_back_val()));
260 assert(DomTree && "Missing dominator tree");
288 // Cache the DomTree node that defined the value.
291 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
299 // Cache the DomTree node that defined the value.
302 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def))
    [all...]
LiveRangeCalc.h 39 MachineDominatorTree *DomTree;
48 /// LiveOutPair - A value and the block that defined it. The domtree node is
68 /// The domtree node may be null, it can be computed.
127 LiveRangeCalc() : MRI(0), Indexes(0), DomTree(0), Alloc(0) {}
217 /// @param DomNode The domtree node for the block.
EarlyIfConversion.cpp 585 MachineDominatorTree *DomTree;
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)
LiveIntervalAnalysis.cpp 74 DomTree(0), LRCalc(0) {
110 DomTree = &getAnalysis<MachineDominatorTree>();
468 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
524 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
    [all...]
RegAllocGreedy.cpp 76 MachineDominatorTree *DomTree;
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 366 DominatorTreeBase<BlockT> &DomTree) {
380 if (!DomTree.isReachableFromEntry(PredBB))
518 Analyze(DominatorTreeBase<BlockT> &DomTree) {
521 DomTreeNodeBase<BlockT>* DomRoot = DomTree.getRootNode();
537 if (DomTree.dominates(Header, Backedge)
538 && DomTree.isReachableFromEntry(Backedge)) {
545 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
LoopInfo.h 537 void Analyze(DominatorTreeBase<BlockT> &DomTree);
  /external/llvm/include/llvm/CodeGen/
LiveIntervalAnalysis.h 58 MachineDominatorTree *DomTree;

Completed in 335 milliseconds