| /freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| D | LiveRangeCalc.cpp | 58 DomTree = MDT; in reset()
93 assert(DomTree && "Missing dominator tree"); in extend()
119 assert(DomTree && "Missing dominator tree"); in calculateValues()
319 addLiveInBlock(LR, DomTree->getNode(MBB)); in findReachingDefs()
331 assert(DomTree && "Missing dominator tree"); in updateSSA()
362 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); in updateSSA()
377 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); in updateSSA()
382 if (DomTree->dominates(IDom, Value.second)) { in updateSSA()
|
| D | EarlyIfConversion.cpp | 763 MachineDominatorTree *DomTree; member in __anon5753a03e0311::EarlyIfConverter
807 void updateDomTree(MachineDominatorTree *DomTree, const SSAIfConv &IfConv, in updateDomTree() argument
812 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateDomTree()
814 MachineDomTreeNode *Node = DomTree->getNode(B); in updateDomTree()
818 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
820 DomTree->eraseNode(B); in updateDomTree()
1037 updateDomTree(DomTree, IfConv, RemovedBlocks); in tryConvertIf()
1058 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
1070 for (auto DomNode : post_order(DomTree)) in runOnMachineFunction()
1087 MachineDominatorTree *DomTree; member in __anon5753a03e0911::EarlyIfPredicator
[all …]
|
| D | LiveIntervalCalc.cpp | 99 MachineDominatorTree *DomTree = getDomTree(); in calculate() local
105 SubLIC.reset(MF, Indexes, DomTree, Alloc); in calculate()
|
| D | LiveIntervals.cpp | 133 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
198 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeVirtRegInterval()
280 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeRegUnitRange()
637 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in extendToIndices()
1757 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in constructMainRangeFromSubranges()
|
| D | RegAllocGreedy.cpp | 164 MachineDominatorTree *DomTree; member in __anon7d9722f50111::RAGreedy
3356 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
3376 SE.reset(new SplitEditor(*SA, *AA, *LIS, *VRM, *DomTree, *MBFI, *VRAI)); in runOnMachineFunction()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| D | LoopInfoImpl.h | 430 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop() argument
444 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
548 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze() argument
550 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
559 if (DomTree.dominates(Header, Backedge) && in analyze()
560 DomTree.isReachableFromEntry(Backedge)) { in analyze()
567 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in analyze()
690 const DomTreeBase<BlockT> &DomTree) const { in verify() argument
711 OtherLI.analyze(DomTree); in verify()
|
| D | LoopInfo.h | 1054 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
1059 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
1093 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| D | AArch64ConditionalCompares.cpp | 769 MachineDominatorTree *DomTree; member in __anon3cfdd34d0211::AArch64ConditionalCompares
825 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); in updateDomTree()
827 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB); in updateDomTree()
831 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
832 DomTree->eraseNode(RemovedMBB); in updateDomTree()
938 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
953 for (auto *I : depth_first(DomTree)) in runOnMachineFunction()
|
| D | AArch64ConditionOptimizer.cpp | 96 MachineDominatorTree *DomTree; member in __anoneda4d8690111::AArch64ConditionOptimizer
335 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
345 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| D | LiveRangeCalc.h | 50 MachineDominatorTree *DomTree = nullptr; variable
170 MachineDominatorTree *getDomTree() { return DomTree; } in getDomTree()
|
| D | LiveIntervals.h | 61 MachineDominatorTree *DomTree = nullptr; variable
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| D | InlineSizeEstimatorAnalysis.cpp | 159 auto &DomTree = FAM.getResult<DominatorTreeAnalysis>(F); in getFunctionFeatures() local
203 FF[NamedFeatureIndex::MaxDomTreeLevel] = getMaxDominatorTreeDepth(F, DomTree); in getFunctionFeatures()
|
| D | LoopInfo.cpp | 867 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() argument
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| D | SampleProfileLoaderBaseImpl.h | 131 PostDominatorTreeT *DomTree);
408 PostDominatorTreeT *DomTree) {
412 bool IsDomParent = DomTree->dominates(BB2, BB1);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | StructurizeCFG.cpp | 174 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {} in NearestCommonDominator() argument
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| D | CoroSplit.cpp | 664 DominatorTree DomTree(*NewF); in salvageDebugInfo() local
667 &DomTree); in salvageDebugInfo()
|