| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 55 DomTree = MDT; in reset()
90 assert(DomTree && "Missing dominator tree"); in extend()
116 assert(DomTree && "Missing dominator tree"); in calculateValues()
321 addLiveInBlock(LR, DomTree->getNode(MBB)); in findReachingDefs()
333 assert(DomTree && "Missing dominator tree"); in updateSSA()
364 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); in updateSSA()
379 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); in updateSSA()
384 if (DomTree->dominates(IDom, Value.second)) { in updateSSA()
|
| H A D | MachineUniformityAnalysis.cpp | 186 auto &DomTree = MFAM.getResult<MachineDominatorTreeAnalysis>(MF); in run() local
192 return computeMachineUniformityInfo(MF, CI, DomTree, in run()
229 auto &DomTree = getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction() local
233 UI = computeMachineUniformityInfo(MF, CI, DomTree, true); in runOnMachineFunction()
|
| H A D | EarlyIfConversion.cpp | 808 MachineDominatorTree *DomTree = nullptr; member in __anon4c5015260311::EarlyIfConverter
817 : DomTree(&DT), Loops(&LI), Traces(&MTM) {} in EarlyIfConverter()
862 void updateDomTree(MachineDominatorTree *DomTree, const SSAIfConv &IfConv, in updateDomTree() argument
867 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateDomTree()
869 MachineDomTreeNode *Node = DomTree->getNode(B); in updateDomTree()
873 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
875 DomTree->eraseNode(B); in updateDomTree()
1121 updateDomTree(DomTree, IfConv, RemoveBlocks); in tryConvertIf()
1151 for (auto *DomNode : post_order(DomTree)) in run()
1200 MachineDominatorTree *DomTree = nullptr; member in __anon4c5015260b11::EarlyIfPredicator
[all …]
|
| H A D | LiveIntervalCalc.cpp | 88 MachineDominatorTree *DomTree = getDomTree(); in calculate() local
94 SubLIC.reset(MF, Indexes, DomTree, Alloc); in calculate()
|
| H A D | RegAllocGreedy.cpp | 182 MachineDominatorTree *DomTree = nullptr; member
207 DomTree = Analyses.DomTree; in RAGreedy()
232 DomTree = &MFAM.getResult<MachineDominatorTreeAnalysis>(MF); in RequiredAnalyses()
273 DomTree = &P.getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in RequiredAnalyses()
2881 SpillerInstance.reset(createInlineSpiller({*LIS, *LSS, *DomTree, *MBFI}, *MF, in run()
2889 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree, *MBFI, *VRAI)); in run()
|
| H A D | LiveIntervals.cpp | 90 LIS.DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in INITIALIZE_PASS_DEPENDENCY()
232 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeVirtRegInterval()
314 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeRegUnitRange()
660 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in extendToIndices()
1820 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in constructMainRangeFromSubranges()
|
| H A D | RegAllocGreedy.h | 177 MachineDominatorTree *DomTree = nullptr; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | LiveDebugValues.cpp | 145 MachineDominatorTree *DomTree = nullptr; in run() local
147 DomTree = &MDT; in run()
152 return TheImpl->ExtendRanges(MF, DomTree, ShouldEmitDebugEntryValues, in run()
|
| H A D | LiveDebugValues.h | 27 virtual bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | InstrRefBasedImpl.h | 1158 MachineDominatorTree *DomTree;
1492 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | VarLocBasedImpl.cpp | 1089 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
2212 MachineDominatorTree *DomTree, in ExtendRanges() argument
2216 (void)DomTree; in ExtendRanges()
|
| H A D | InstrRefBasedImpl.cpp | 2820 IDFCalculatorBase<MachineBasicBlock, false> IDF(*DomTree); in BlockPHIPlacement()
3433 if (!DomTree->properlyDominates(AssignMBB, ScopeBlock)) in placePHIsForSingleVarDefinition()
3707 MachineDominatorTree *DomTree, in ExtendRanges() argument
3717 this->DomTree = DomTree; in ExtendRanges()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericLoopInfoImpl.h | 461 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop() argument
475 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
578 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze() argument
580 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
589 const DomTreeNodeBase<BlockT> *BackedgeNode = DomTree.getNode(Backedge); in analyze()
590 if (BackedgeNode && DomTree.dominates(DomNode, BackedgeNode)) in analyze()
596 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in analyze()
720 const DomTreeBase<BlockT> &DomTree) const { in verify() argument
741 OtherLI.analyze(DomTree); in verify()
|
| H A D | GenericLoopInfo.h | 693 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
698 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 766 MachineDominatorTree *DomTree; member in __anon79d718350211::AArch64ConditionalCompares
820 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); in updateDomTree()
822 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB); in updateDomTree()
826 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
827 DomTree->eraseNode(RemovedMBB); in updateDomTree()
935 DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction()
950 for (auto *I : depth_first(DomTree)) in runOnMachineFunction()
|
| H A D | AArch64ConditionOptimizer.cpp | 96 MachineDominatorTree *DomTree; member in __anond07520510111::AArch64ConditionOptimizer
333 DomTree = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree(); in runOnMachineFunction()
343 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | LiveRangeCalc.h | 50 MachineDominatorTree *DomTree = nullptr; variable
170 MachineDominatorTree *getDomTree() { return DomTree; } in getDomTree()
|
| H A D | LiveIntervals.h | 64 MachineDominatorTree *DomTree = nullptr; variable
104 : Indexes(&SI), DomTree(&DT) { in LiveIntervals()
315 MachineDominatorTree &getDomTree() { return *DomTree; } in getDomTree()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | GenericDomTreeUpdaterImpl.h | 269 auto *DomTree = [&]() { in applyUpdatesImpl()
276 if (Strategy != UpdateStrategy::Lazy || !DomTree) in applyUpdatesImpl()
290 DomTree->applyUpdates(NormalUpdates); in applyUpdatesImpl()
|
| H A D | LoopInfo.h | 419 const DominatorTreeBase<BasicBlock, false> &DomTree);
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineSizeEstimatorAnalysis.cpp | 158 auto &DomTree = FAM.getResult<DominatorTreeAnalysis>(F); in getFunctionFeatures() local
201 FF[NamedFeatureIndex::MaxDomTreeLevel] = getMaxDominatorTreeDepth(F, DomTree); in getFunctionFeatures()
|
| H A D | LoopInfo.cpp | 876 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() argument
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 246 PostDominatorTreeT *DomTree);
600 PostDominatorTreeT *DomTree) {
604 bool IsDomParent = DomTree->dominates(BB2, BB1);
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 212 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {} in NearestCommonDominator() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroSplit.cpp | 653 DominatorTree DomTree(*NewF); in salvageDebugInfo() local
656 &DomTree); in salvageDebugInfo()
|