Home
last modified time | relevance | path

Searched refs:DomTree (Results 1 – 14 of 14) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp59 DomTree = MDT; in reset()
120 SubLRC.reset(MF, Indexes, DomTree, Alloc); in calculate()
245 assert(DomTree && "Missing dominator tree"); in extend()
271 assert(DomTree && "Missing dominator tree"); in calculateValues()
473 addLiveInBlock(LR, DomTree->getNode(MBB)); in findReachingDefs()
485 assert(DomTree && "Missing dominator tree"); in updateSSA()
516 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); in updateSSA()
531 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); in updateSSA()
536 if (DomTree->dominates(IDom, Value.second)) { in updateSSA()
H A DEarlyIfConversion.cpp602 MachineDominatorTree *DomTree; member in __anon398718eb0211::EarlyIfConverter
651 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateDomTree()
653 MachineDomTreeNode *Node = DomTree->getNode(Removed[i]); in updateDomTree()
657 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode); in updateDomTree()
659 DomTree->eraseNode(Removed[i]); in updateDomTree()
808 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
820 for (auto DomNode : post_order(DomTree)) in runOnMachineFunction()
H A DLiveRangeCalc.h49 MachineDominatorTree *DomTree = nullptr; variable
H A DLiveIntervals.cpp133 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
198 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeVirtRegInterval()
266 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeRegUnitRange()
617 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in extendToIndices()
1657 LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in constructMainRangeFromSubranges()
H A DRegAllocGreedy.cpp170 MachineDominatorTree *DomTree; member in __anonc49c92c20111::RAGreedy
3217 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
3233 SE.reset(new SplitEditor(*SA, *AA, *LIS, *VRM, *DomTree, *MBFI)); in runOnMachineFunction()
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DSIFixWWMLiveness.cpp95 MachineDominatorTree *DomTree; member in __anon95ddd09f0111::SIFixWWMLiveness
168 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
228 if (!DomTree->dominates(Defs[0]->getParent(), Defs[I]->getParent())) in processDef()
328 if (DomTree->dominates(DefOpnd->getParent()->getParent(), WWM->getParent()) in processThenDef()
329 && !DomTree->dominates(UseBlock, WWM->getParent())) { in processThenDef()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h436 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop() argument
450 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
554 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze() argument
556 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
565 if (DomTree.dominates(Header, Backedge) && in analyze()
566 DomTree.isReachableFromEntry(Backedge)) { in analyze()
573 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in analyze()
705 const DomTreeBase<BlockT> &DomTree) const { in verify() argument
726 OtherLI.analyze(DomTree); in verify()
H A DLoopInfo.h771 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
776 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
810 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
/freebsd-12.1/contrib/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp770 MachineDominatorTree *DomTree; member in __anon845f05fa0211::AArch64ConditionalCompares
826 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); in updateDomTree()
828 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB); in updateDomTree()
832 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode); in updateDomTree()
833 DomTree->eraseNode(RemovedMBB); in updateDomTree()
939 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
954 for (auto *I : depth_first(DomTree)) in runOnMachineFunction()
H A DAArch64ConditionOptimizer.cpp96 MachineDominatorTree *DomTree; member in __anon4523e9760111::AArch64ConditionOptimizer
336 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
346 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLoopInfo.cpp600 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() argument
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DLiveIntervals.h62 MachineDominatorTree *DomTree = nullptr; variable
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp233 DominatorTreeBase<BasicBlock, IsPostDom> *DomTree);
891 DominatorTreeBase<BasicBlock, IsPostDom> *DomTree) { in findEquivalencesFor() argument
895 bool IsDomParent = DomTree->dominates(BB2, BB1); in findEquivalencesFor()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp112 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {} in NearestCommonDominator() argument