| /netbsd/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | DomPrinter.cpp | 29 struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { in getNodeLabel()
52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
55 : DOTGraphTraits<DomTreeNode*>(isSimple) {} in DOTGraphTraits()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
62 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode()); in getNodeLabel()
68 : public DOTGraphTraits<DomTreeNode*> {
71 : DOTGraphTraits<DomTreeNode*>(isSimple) {} in DOTGraphTraits()
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G ) { in getNodeLabel()
78 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode()); in getNodeLabel()
|
| H A D | LegacyDivergenceAnalysis.cpp | 164 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
210 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
|
| H A D | MemorySSA.cpp | 533 DomTreeNode *Node = DT.getNode(BB); in getWalkTarget()
983 DomTreeNode *DTN;
984 DomTreeNode::const_iterator ChildIt;
987 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
1150 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
1168 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
1169 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
1175 DomTreeNode *Child = *ChildIt; in renamePass()
|
| H A D | IVUsers.cpp | 99 for (DomTreeNode *Rung = DT->getNode(BB); in isSimplifiedLoopNest()
|
| /netbsd/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 38 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 …]
|
| /netbsd/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 81 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
229 struct GraphTraits<DomTreeNode *>
230 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::const_iterator> {
234 struct GraphTraits<const DomTreeNode *>
235 : public DomTreeGraphTraitsBase<const DomTreeNode,
236 DomTreeNode::const_iterator> {};
239 : public GraphTraits<DomTreeNode*> {
|
| /netbsd/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| H A D | LoopUtils.h | 24 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
150 bool sinkRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
164 bool hoistRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
207 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
|
| /netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 639 unsigned cg, DomTreeNode *n, DomTreeNode::const_iterator child, in StackNode()
640 DomTreeNode::const_iterator end) in StackNode()
653 DomTreeNode *node() { return Node; } in node()
656 DomTreeNode *nextChild() { in nextChild()
657 DomTreeNode *child = *ChildIter; in nextChild()
669 DomTreeNode *Node;
670 DomTreeNode::const_iterator ChildIter;
671 DomTreeNode::const_iterator EndIter;
818 bool processNode(DomTreeNode *Node);
1185 bool EarlyCSE::processNode(DomTreeNode *Node) { in processNode()
[all …]
|
| H A D | GuardWidening.cpp | 120 DomTreeNode *Root;
136 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
274 LoopInfo &LI, DomTreeNode *Root, in GuardWideningImpl()
328 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI, in eliminateInstrViaWidening()
|
| H A D | SimpleLoopUnswitch.cpp | 1942 SmallVector<DomTreeNode *, 4> DomWorklist; in visitDomSubTree()
1945 SmallPtrSet<DomTreeNode *, 4> Visited; in visitDomSubTree()
1949 DomTreeNode *N = DomWorklist.pop_back_val(); in visitDomSubTree()
1956 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()
2406 DomTreeNode &N, in computeDomSubtreeCost()
2408 SmallDenseMap<DomTreeNode *, InstructionCost, 4> &DTCostMap) { in computeDomSubtreeCost() argument
2424 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost()
2761 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; in unswitchBestCondition()
|
| H A D | ConstraintElimination.cpp | 225 ConstraintOrBlock(DomTreeNode *DTN) in ConstraintOrBlock()
228 ConstraintOrBlock(DomTreeNode *DTN, CmpInst *Condition, bool Not) in ConstraintOrBlock()
|
| H A D | LICM.cpp | 524 bool llvm::sinkRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in sinkRegion()
542 SmallVector<DomTreeNode *, 16> Worklist = collectChildrenInLoop(N, CurLoop); in sinkRegion()
545 for (DomTreeNode *DTN : reverse(Worklist)) { in sinkRegion()
799 DomTreeNode *PreheaderNode = DT->getNode(HoistCommonSucc); in getOrCreateHoistedBlock()
800 DomTreeNode *HeaderNode = DT->getNode(CurLoop->getHeader()); in getOrCreateHoistedBlock()
856 bool llvm::hoistRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in hoistRegion()
|
| H A D | ADCE.cpp | 299 for (auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
|
| H A D | NewGVN.cpp | 514 DenseMap<const DomTreeNode *, unsigned> RPOOrdering;
3420 llvm::sort(*Node, [&](const DomTreeNode *A, const DomTreeNode *B) { in runGVN()
3553 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToDFSOrdered()
3612 DomTreeNode *DomNode = DT->getNode(IBlock); in convertClassToDFSOrdered()
3642 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToLoadsAndStores()
|
| /netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | PredicateInfo.cpp | 175 DomTreeNode *DomASrc = DT.getNode(ASrc); in comparePHIRelated()
176 DomTreeNode *DomBSrc = DT.getNode(BSrc); in comparePHIRelated()
188 DomTreeNode *DomADest = DT.getNode(ADest); in comparePHIRelated()
189 DomTreeNode *DomBDest = DT.getNode(BDest); in comparePHIRelated()
358 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
633 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
|
| H A D | BasicBlockUtils.cpp | 798 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl()
799 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
801 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlockImpl()
802 for (DomTreeNode *I : Children) in SplitBlockImpl()
1393 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThenImpl()
1394 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThenImpl()
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThenImpl()
1397 for (DomTreeNode *Child : Children) in SplitBlockAndInsertIfThenImpl()
|
| H A D | CodeMoverUtils.cpp | 103 DomTreeNode *DA = DT->getNode(InstA->getParent()); in domTreeLevelBefore()
104 DomTreeNode *DB = DT->getNode(InstB->getParent()); in domTreeLevelBefore()
|
| H A D | LoopUtils.cpp | 518 SmallVector<DomTreeNode *, 16>
519 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop()
520 SmallVector<DomTreeNode *, 16> Worklist; in collectChildrenInLoop()
521 auto AddRegionToWorklist = [&](DomTreeNode *DTN) { in collectChildrenInLoop()
531 for (DomTreeNode *Child : Worklist[I]->children()) in collectChildrenInLoop()
|
| H A D | LoopSimplify.cpp | 687 DomTreeNode *Node = DT->getNode(ExitingBlock); in simplifyOneLoop()
689 DomTreeNode *Child = Node->back(); in simplifyOneLoop()
|
| H A D | CodeExtractor.cpp | 799 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 D | LCSSA.cpp | 139 const DomTreeNode *DomNode = DT.getNode(DomBB); in formLCSSAForInstructions()
|
| /netbsd/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | PostDominators.h | 99 : public GraphTraits<DomTreeNode*> {
|
| /netbsd/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 330 for (const auto &DomTreeNode : DomTreeNodes) {
331 NodeT *BB = DomTreeNode.first;
337 DomTreeNodeBase<NodeT> &MyNd = *DomTreeNode.second;
|
| /netbsd/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenExtract.cpp | 227 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) in visitBlock()
|
| H A D | HexagonCommonGEP.cpp | 320 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) in getBlockTraversalOrder()
801 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
861 DomTreeNode *DN = DT->getNode(L->getHeader()); in preheader()
1241 for (auto DTN : children<DomTreeNode*>(DT->getNode(B))) in removeDeadCode()
|