| /llvm-project-15.0.7/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 | 761 MachineDominatorTree *DomTree; member in __anon1f7aa2560311::EarlyIfConverter
810 MachineDomTreeNode *HeadNode = DomTree->getNode(IfConv.Head); in updateDomTree()
812 MachineDomTreeNode *Node = DomTree->getNode(B); in updateDomTree()
818 DomTree->eraseNode(B); in updateDomTree()
1035 updateDomTree(DomTree, IfConv, RemovedBlocks); in tryConvertIf()
1056 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
1068 for (auto *DomNode : post_order(DomTree)) in runOnMachineFunction()
1085 MachineDominatorTree *DomTree; member in __anon1f7aa2560911::EarlyIfPredicator
1173 updateDomTree(DomTree, IfConv, RemovedBlocks); in tryConvertIf()
1190 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
[all …]
|
| 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()
630 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in extendToIndices()
1761 LICalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator()); in constructMainRangeFromSubranges()
|
| H A D | RegAllocGreedy.h | 169 MachineDominatorTree *DomTree; variable
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | LiveDebugValues.cpp | 116 MachineDominatorTree *DomTree = nullptr; in runOnMachineFunction() local
118 DomTree = &MDT; in runOnMachineFunction()
123 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 | 818 MachineDominatorTree *DomTree;
1129 bool ExtendRanges(MachineFunction &MF, MachineDominatorTree *DomTree,
|
| H A D | InstrRefBasedImpl.cpp | 2349 IDFCalculatorBase<MachineBasicBlock, false> IDF(DomTree->getBase()); in BlockPHIPlacement()
2896 if (!DomTree->properlyDominates(AssignMBB, ScopeBlock)) in placePHIsForSingleVarDefinition()
3164 MachineDominatorTree *DomTree, in ExtendRanges() argument
3175 this->DomTree = DomTree; in ExtendRanges()
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | Dominance.h | 35 using DomTree = llvm::DominatorTreeBase<Block, IsPostDom>; variable
85 DomTree &getDomTree(Region *region) const { in getDomTree()
97 llvm::PointerIntPair<DomTree *, 1, bool>
109 mutable DenseMap<Region *, llvm::PointerIntPair<DomTree *, 1, bool>>
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 428 const DomTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop() argument
442 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
545 void LoopInfoBase<BlockT, LoopT>::analyze(const DomTreeBase<BlockT> &DomTree) { in analyze() argument
547 const DomTreeNodeBase<BlockT> *DomRoot = DomTree.getRootNode(); in analyze()
556 if (DomTree.dominates(Header, Backedge) && in analyze()
557 DomTree.isReachableFromEntry(Backedge)) { in analyze()
564 discoverAndMapSubloop(L, ArrayRef<BlockT *>(Backedges), this, DomTree); in analyze()
688 const DomTreeBase<BlockT> &DomTree) const { in verify() argument
709 OtherLI.analyze(DomTree); in verify()
|
| H A D | LoopInfo.h | 1076 void analyze(const DominatorTreeBase<BlockT, false> &DomTree);
1081 void verify(const DominatorTreeBase<BlockT, false> &DomTree) const;
1115 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree);
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 769 MachineDominatorTree *DomTree; member in __anoneb5605650211::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()
|
| H A D | AArch64ConditionOptimizer.cpp | 96 MachineDominatorTree *DomTree; member in __anon0a3327810111::AArch64ConditionOptimizer
335 DomTree = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction()
345 for (MachineDomTreeNode *I : depth_first(DomTree)) { in runOnMachineFunction()
|
| /llvm-project-15.0.7/mlir/lib/IR/ |
| H A D | Dominance.cpp | 43 -> llvm::PointerIntPair<DomTree *, 1, bool> { in getDominanceInfo()
55 auto *domTree = new DomTree(); in getDominanceInfo()
65 auto *domTree = new DomTree(); in getDominanceInfo()
|
| /llvm-project-15.0.7/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
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | InlineSizeEstimatorAnalysis.cpp | 157 auto &DomTree = FAM.getResult<DominatorTreeAnalysis>(F); in getFunctionFeatures() local
201 FF[NamedFeatureIndex::MaxDomTreeLevel] = getMaxDominatorTreeDepth(F, DomTree); in getFunctionFeatures()
|
| H A D | LoopInfo.cpp | 861 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() argument
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopDeletion/ |
| H A D | 2017-07-11-incremental-dt.ll | 6 ; Verify only the important parts of the DomTree.
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | pr36311.ll | 7 ; DomTree out of date, such that an assert from SCEV would trigger if
|
| /llvm-project-15.0.7/llvm/test/Analysis/BasicAA/ |
| H A D | invalidation.ll | 4 ; Check DomTree specifically.
|
| /llvm-project-15.0.7/clang/unittests/Analysis/ |
| H A D | CFGDominatorTree.cpp | 17 TEST(CFGDominatorTree, DomTree) { in TEST() argument
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 147 PostDominatorTreeT *DomTree);
436 PostDominatorTreeT *DomTree) {
440 bool IsDomParent = DomTree->dominates(BB2, BB1);
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 170 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {} in NearestCommonDominator() argument
|