HomeSort by: relevance | last modified time | path
    Searched refs:DomTree (Results 1 - 15 of 15) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
LiveRangeCalc.h 50 MachineDominatorTree *DomTree = nullptr;
53 /// LiveOutPair - A value and the block that defined it. The domtree node is
93 /// The domtree node may be null, it can be computed.
170 MachineDominatorTree *getDomTree() { return DomTree; }
240 /// @param DomNode The domtree node for the block.
LiveIntervals.h 61 MachineDominatorTree *DomTree = nullptr;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LiveRangeCalc.cpp 58 DomTree = MDT;
79 // Defer the Domtree lookup until it is needed.
93 assert(DomTree && "Missing dominator tree");
119 assert(DomTree && "Missing dominator tree");
319 addLiveInBlock(LR, DomTree->getNode(MBB));
331 assert(DomTree && "Missing dominator tree");
358 // Cache the DomTree node that defined the value.
362 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
374 // Cache the DomTree node that defined the value.
377 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def))
    [all...]
EarlyIfConversion.cpp 763 MachineDominatorTree *DomTree;
807 void updateDomTree(MachineDominatorTree *DomTree, const SSAIfConv &IfConv,
812 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head);
814 MachineDomTreeNode *Node = DomTree->getNode(B);
818 DomTree->changeImmediateDominator(Node->back(), HeadNode);
820 DomTree->eraseNode(B);
1037 updateDomTree(DomTree, IfConv, RemovedBlocks);
1058 DomTree = &getAnalysis<MachineDominatorTree>();
1070 for (auto DomNode : post_order(DomTree))
1087 MachineDominatorTree *DomTree;
    [all...]
LiveIntervalCalc.cpp 99 MachineDominatorTree *DomTree = getDomTree();
105 SubLIC.reset(MF, Indexes, DomTree, Alloc);
LiveIntervals.cpp 133 DomTree = &getAnalysis<MachineDominatorTree>();
198 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
280 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
637 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
1752 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
RegAllocGreedy.cpp 164 MachineDominatorTree *DomTree;
3332 DomTree = &getAnalysis<MachineDominatorTree>();
3352 SE.reset(new SplitEditor(*SA, *AA, *LIS, *VRM, *DomTree, *MBFI, *VRAI));
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ConditionalCompares.cpp 769 MachineDominatorTree *DomTree;
825 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head);
827 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB);
831 DomTree->changeImmediateDominator(Node->back(), HeadNode);
832 DomTree->eraseNode(RemovedMBB);
938 DomTree = &getAnalysis<MachineDominatorTree>();
950 // Note that updateDomTree() modifies the children of the DomTree node
953 for (auto *I : depth_first(DomTree))
AArch64ConditionOptimizer.cpp 96 MachineDominatorTree *DomTree;
335 DomTree = &getAnalysis<MachineDominatorTree>();
342 // Note that updateDomTree() modifies the children of the DomTree node
345 for (MachineDomTreeNode *I : depth_first(DomTree)) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopInfoImpl.h 430 const DomTreeBase<BlockT> &DomTree) {
444 if (!DomTree.isReachableFromEntry(PredBB))
548 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) {
550 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode();
559 if (DomTree.dominates(Header, Backedge) &&
560 DomTree.isReachableFromEntry(Backedge)) {
567 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree);
690 const DomTreeBase<BlockT> &DomTree) const {
711 OtherLI.analyze(DomTree);
LoopInfo.h 1051 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
1056 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
1090 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
InlineSizeEstimatorAnalysis.cpp 159 auto &DomTree = FAM.getResult<DominatorTreeAnalysis>(F);
203 FF[NamedFeatureIndex::MaxDomTreeLevel] = getMaxDominatorTreeDepth(F, DomTree);
LoopInfo.cpp 867 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); }
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
SampleProfileLoaderBaseImpl.h 131 PostDominatorTreeT *DomTree);
399 /// \param DomTree Opposite dominator tree. If \p Descendants is filled
405 PostDominatorTreeT *DomTree) {
409 bool IsDomParent = DomTree->dominates(BB2, BB1);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 174 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {}

Completed in 116 milliseconds