Home
last modified time | relevance | path

Searched refs:DomTreeNode (Results 1 – 25 of 36) sorted by relevance

12

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDomPrinter.h25 struct DOTGraphTraits<DomTreeNode *> : public DefaultDOTGraphTraits {
29 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
45 : public DOTGraphTraits<DomTreeNode *> {
48 : DOTGraphTraits<DomTreeNode *>(isSimple) {}
54 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
55 return DOTGraphTraits<DomTreeNode *>::getNodeLabel(Node,
62 : public DOTGraphTraits<DomTreeNode*> {
65 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
71 std::string getNodeLabel(DomTreeNode *Node,
73 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
H A DPostDominators.h99 : public GraphTraits<DomTreeNode*> {
H A DRegionInfo.h92 using DomTreeNodeT = DomTreeNode;
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DDominators.h38 using DomTreeNode = llvm::DomTreeNodeBase<CFGBlock>; variable
66 DomTreeNode *getRootNode() { in getRootNode()
74 DomTreeNode *R = getRootNode(); in compare()
75 DomTreeNode *OtherR = Other.getRootNode(); in compare()
104 DomTreeNode *IDom = DT.getNode(*I)->getIDom(); in dump()
280 template <> struct GraphTraits<clang::DomTreeNode *> {
281 using NodeRef = ::clang::DomTreeNode *;
282 using ChildIteratorType = ::clang::DomTreeNode::const_iterator;
291 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
295 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
[all …]
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DDominators.h96 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
244 struct GraphTraits<DomTreeNode *>
245 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::const_iterator> {
249 struct GraphTraits<const DomTreeNode *>
250 : public DomTreeGraphTraitsBase<const DomTreeNode,
251 DomTreeNode::const_iterator> {};
254 : public GraphTraits<DomTreeNode*> {
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h23 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
149 bool sinkRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
157 bool sinkRegionForLoopNest(DomTreeNode *, AAResults *, LoopInfo *,
174 bool hoistRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
219 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DEarlyCSE.cpp634 unsigned cg, DomTreeNode *n, DomTreeNode::const_iterator child, in StackNode()
635 DomTreeNode::const_iterator end) in StackNode()
648 DomTreeNode *node() { return Node; } in node()
651 DomTreeNode *nextChild() { in nextChild()
652 DomTreeNode *child = *ChildIter; in nextChild()
664 DomTreeNode *Node;
665 DomTreeNode::const_iterator ChildIter;
666 DomTreeNode::const_iterator EndIter;
828 bool processNode(DomTreeNode *Node);
1201 bool EarlyCSE::processNode(DomTreeNode *Node) { in processNode()
[all …]
H A DGuardWidening.cpp123 DomTreeNode *Root;
139 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
277 DomTreeNode *Root, in GuardWideningImpl()
331 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI, in eliminateInstrViaWidening()
H A DLICM.cpp528 bool llvm::sinkRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in sinkRegion()
544 SmallVector<DomTreeNode *, 16> Worklist = collectChildrenInLoop(N, CurLoop); in sinkRegion()
547 for (DomTreeNode *DTN : reverse(Worklist)) { in sinkRegion()
597 DomTreeNode *N, AAResults *AA, LoopInfo *LI, DominatorTree *DT, in sinkRegionForLoopNest()
819 DomTreeNode *PreheaderNode = DT->getNode(HoistCommonSucc); in getOrCreateHoistedBlock()
820 DomTreeNode *HeaderNode = DT->getNode(CurLoop->getHeader()); in getOrCreateHoistedBlock()
847 bool llvm::hoistRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in hoistRegion()
H A DSimpleLoopUnswitch.cpp2026 SmallVector<DomTreeNode *, 4> DomWorklist; in visitDomSubTree()
2029 SmallPtrSet<DomTreeNode *, 4> Visited; in visitDomSubTree()
2033 DomTreeNode *N = DomWorklist.pop_back_val(); in visitDomSubTree()
2040 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()
2528 DomTreeNode &N, in computeDomSubtreeCost()
2530 SmallDenseMap<DomTreeNode *, InstructionCost, 4> &DTCostMap) { in computeDomSubtreeCost() argument
2546 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost()
2902 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; in unswitchBestCondition()
H A DConstraintElimination.cpp444 ConstraintOrBlock(DomTreeNode *DTN) in ConstraintOrBlock()
447 ConstraintOrBlock(DomTreeNode *DTN, CmpInst *Condition, bool Not) in ConstraintOrBlock()
H A DADCE.cpp298 for (auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
H A DNewGVN.cpp513 DenseMap<const DomTreeNode *, unsigned> RPOOrdering;
3452 llvm::sort(*Node, [&](const DomTreeNode *A, const DomTreeNode *B) { in runGVN()
3585 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToDFSOrdered()
3644 DomTreeNode *DomNode = DT->getNode(IBlock); in convertClassToDFSOrdered()
3674 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToLoadsAndStores()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DPredicateInfo.cpp169 DomTreeNode *DomASrc = DT.getNode(ASrc); in comparePHIRelated()
170 DomTreeNode *DomBSrc = DT.getNode(BSrc); in comparePHIRelated()
182 DomTreeNode *DomADest = DT.getNode(ADest); in comparePHIRelated()
183 DomTreeNode *DomBDest = DT.getNode(BDest); in comparePHIRelated()
352 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
638 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
H A DBasicBlockUtils.cpp821 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl()
822 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
824 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlockImpl()
825 for (DomTreeNode *I : Children) in SplitBlockImpl()
1419 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThenImpl()
1420 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThenImpl()
1422 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThenImpl()
1423 for (DomTreeNode *Child : Children) in SplitBlockAndInsertIfThenImpl()
H A DCodeMoverUtils.cpp103 DomTreeNode *DA = DT->getNode(InstA->getParent()); in domTreeLevelBefore()
104 DomTreeNode *DB = DT->getNode(InstB->getParent()); in domTreeLevelBefore()
H A DLoopUtils.cpp449 SmallVector<DomTreeNode *, 16>
450 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop()
451 SmallVector<DomTreeNode *, 16> Worklist; in collectChildrenInLoop()
452 auto AddRegionToWorklist = [&](DomTreeNode *DTN) { in collectChildrenInLoop()
462 for (DomTreeNode *Child : Worklist[I]->children()) in collectChildrenInLoop()
H A DLoopSimplify.cpp681 DomTreeNode *Node = DT->getNode(ExitingBlock); in simplifyOneLoop()
683 DomTreeNode *Child = Node->back(); in simplifyOneLoop()
H A DCodeExtractor.cpp799 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks()
800 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
803 DomTreeNode *NewNode = DT->addNewBlock(New, Block); in splitReturnBlocks()
805 for (DomTreeNode *I : Children) in splitReturnBlocks()
H A DLCSSA.cpp138 const DomTreeNode *DomNode = DT.getNode(DomBB); in formLCSSAForInstructions()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLegacyDivergenceAnalysis.cpp165 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
211 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
H A DMemorySSA.cpp563 DomTreeNode *Node = DT.getNode(BB); in getWalkTarget()
1013 DomTreeNode *DTN;
1014 DomTreeNode::const_iterator ChildIt;
1017 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
1186 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
1204 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
1205 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
1211 DomTreeNode *Child = *ChildIt; in renamePass()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h330 for (const auto &DomTreeNode : DomTreeNodes) {
331 NodeT *BB = DomTreeNode.first;
337 DomTreeNodeBase<NodeT> &MyNd = *DomTreeNode.second;
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp331 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) in getBlockTraversalOrder()
799 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
859 DomTreeNode *DN = DT->getNode(L->getHeader()); in preheader()
1233 for (auto DTN : children<DomTreeNode*>(DT->getNode(B))) in removeDeadCode()
H A DHexagonGenExtract.cpp227 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) in visitBlock()

12