| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 56 DomTree = MDT; in reset()
91 assert(DomTree && "Missing dominator tree"); in extend()
117 assert(DomTree && "Missing dominator tree"); in calculateValues()
317 addLiveInBlock(LR, DomTree->getNode(MBB)); in findReachingDefs()
329 assert(DomTree && "Missing dominator tree"); in updateSSA()
360 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def)); in updateSSA()
375 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def)); in updateSSA()
380 if (DomTree->dominates(IDom, Value.second)) { in updateSSA()
|
| H A D | EarlyIfConversion.cpp | 767 MachineDominatorTree *DomTree; member in __anon3786be1d0311::EarlyIfConverter
811 void updateDomTree(MachineDominatorTree *DomTree, const SSAIfConv &IfConv, in updateDomTree() argument
816 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateDomTree()
818 MachineDomTreeNode *Node = DomTree->getNode(B); in updateDomTree()
822 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
824 DomTree->eraseNode(B); in updateDomTree()
1041 updateDomTree(DomTree, IfConv, RemovedBlocks); in tryConvertIf()
1062 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
1074 for (auto *DomNode : post_order(DomTree)) in runOnMachineFunction()
1091 MachineDominatorTree *DomTree; member in __anon3786be1d0911::EarlyIfPredicator
[all …]
|
| H A D | MachineUniformityAnalysis.cpp | 182 auto &DomTree = getAnalysis<MachineDominatorTree>().getBase(); in runOnMachineFunction() local
184 UI = computeMachineUniformityInfo(MF, CI, DomTree); in runOnMachineFunction()
|
| H A D | LiveIntervalCalc.cpp | 90 MachineDominatorTree *DomTree = getDomTree(); in calculate() local
96 SubLIC.reset(MF, Indexes, DomTree, Alloc); in calculate()
|
| H A D | LiveIntervals.cpp | 126 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
191 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeVirtRegInterval()
273 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in computeRegUnitRange()
624 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in extendToIndices()
1753 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in constructMainRangeFromSubranges()
|
| H A D | RegAllocGreedy.h | 177 MachineDominatorTree *DomTree; variable
|
| H A D | RegAllocGreedy.cpp | 2624 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
2657 SE.reset(new SplitEditor(*SA, *LIS, *VRM, *DomTree, *MBFI, *VRAI)); in runOnMachineFunction()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | LiveDebugValues.cpp | 120 MachineDominatorTree *DomTree = nullptr; in runOnMachineFunction() local
122 DomTree = &MDT; in runOnMachineFunction()
127 return TheImpl->ExtendRanges(MF, DomTree, TPC, InputBBLimit, in runOnMachineFunction()
|
| H A D | LiveDebugValues.h | 27 virtual bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | InstrRefBasedImpl.h | 1078 MachineDominatorTree *DomTree;
1409 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | VarLocBasedImpl.cpp | 1086 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
2206 MachineDominatorTree *DomTree, in ExtendRanges() argument
2209 (void)DomTree; in ExtendRanges()
|
| H A D | InstrRefBasedImpl.cpp | 2754 IDFCalculatorBase<MachineBasicBlock, false> IDF(DomTree->getBase()); in BlockPHIPlacement()
3365 if (!DomTree->properlyDominates(AssignMBB, ScopeBlock)) in placePHIsForSingleVarDefinition()
3639 MachineDominatorTree *DomTree, in ExtendRanges() argument
3650 this->DomTree = DomTree; in ExtendRanges()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 440 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop() argument
454 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
557 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze() argument
559 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
568 if (DomTree.dominates(Header, Backedge) && in analyze()
569 DomTree.isReachableFromEntry(Backedge)) { in analyze()
576 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in analyze()
700 const DomTreeBase<BlockT> &DomTree) const { in verify() argument
721 OtherLI.analyze(DomTree); in verify()
|
| H A D | LoopInfo.h | 1079 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
1084 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
1118 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 768 MachineDominatorTree *DomTree; member in __anonbd96cf2c0211::AArch64ConditionalCompares
824 MachineDomTreeNode *HeadNode = DomTree->getNode(CmpConv.Head); in updateDomTree()
826 MachineDomTreeNode *Node = DomTree->getNode(RemovedMBB); in updateDomTree()
830 DomTree->changeImmediateDominator(Node->back(), HeadNode); in updateDomTree()
831 DomTree->eraseNode(RemovedMBB); in updateDomTree()
937 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
952 for (auto *I : depth_first(DomTree)) in runOnMachineFunction()
|
| H A D | AArch64ConditionOptimizer.cpp | 96 MachineDominatorTree *DomTree; member in __anon010e54680111::AArch64ConditionOptimizer
335 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
345 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | LiveRangeCalc.h | 49 MachineDominatorTree *DomTree = nullptr; variable
169 MachineDominatorTree *getDomTree() { return DomTree; } in getDomTree()
|
| H A D | LiveIntervals.h | 59 MachineDominatorTree *DomTree = nullptr; variable
|
| /openbsd-src/gnu/llvm/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 | 865 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() argument
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 146 PostDominatorTreeT *DomTree);
435 PostDominatorTreeT *DomTree) {
439 bool IsDomParent = DomTree->dominates(BB2, BB1);
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 173 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {} in NearestCommonDominator() argument
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroSplit.cpp | 698 DominatorTree DomTree(*NewF); in salvageDebugInfo() local
701 &DomTree); in salvageDebugInfo()
|