| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| 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()
|
| D | OrderedInstructions.cpp | 47 DomTreeNode *DA = DT->getNode(InstA->getParent()); in dfsBefore()
48 DomTreeNode *DB = DT->getNode(InstB->getParent()); in dfsBefore()
|
| D | LegacyDivergenceAnalysis.cpp | 164 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
210 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
|
| D | MemorySSA.cpp | 531 DomTreeNode *Node = DT.getNode(BB); in getWalkTarget()
971 DomTreeNode *DTN;
972 DomTreeNode::const_iterator ChildIt;
975 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
1138 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
1156 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
1157 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
1163 DomTreeNode *Child = *ChildIt; in renamePass()
|
| D | IVUsers.cpp | 99 for (DomTreeNode *Rung = DT->getNode(BB); in isSimplifiedLoopNest()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | Dominators.h | 74 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
208 struct GraphTraits<DomTreeNode *>
209 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
212 struct GraphTraits<const DomTreeNode *>
213 : public DomTreeGraphTraitsBase<const DomTreeNode,
214 DomTreeNode::const_iterator> {};
217 : public GraphTraits<DomTreeNode*> {
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 121 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
134 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
170 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | EarlyCSE.cpp | 601 unsigned cg, DomTreeNode *n, DomTreeNode::iterator child, in StackNode()
602 DomTreeNode::iterator end) in StackNode()
615 DomTreeNode *node() { return Node; } in node()
616 DomTreeNode::iterator childIter() { return ChildIter; } in childIter()
618 DomTreeNode *nextChild() { in nextChild()
619 DomTreeNode *child = *ChildIter; in nextChild()
624 DomTreeNode::iterator end() { return EndIter; } in end()
631 DomTreeNode *Node;
632 DomTreeNode::iterator ChildIter;
633 DomTreeNode::iterator EndIter;
[all …]
|
| D | Sink.cpp | 168 DomTreeNode *DTN = DT.getNode(Inst->getParent()); in SinkInstruction()
169 for (DomTreeNode::iterator I = DTN->begin(), E = DTN->end(); in SinkInstruction()
|
| 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()
|
| D | SimpleLoopUnswitch.cpp | 1896 SmallVector<DomTreeNode *, 4> DomWorklist; in visitDomSubTree()
1899 SmallPtrSet<DomTreeNode *, 4> Visited; in visitDomSubTree()
1903 DomTreeNode *N = DomWorklist.pop_back_val(); in visitDomSubTree()
1910 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()
2344 computeDomSubtreeCost(DomTreeNode &N, in computeDomSubtreeCost()
2346 SmallDenseMap<DomTreeNode *, int, 4> &DTCostMap) { in computeDomSubtreeCost() argument
2361 N.begin(), N.end(), BBCostIt->second, [&](int Sum, DomTreeNode *ChildN) { in computeDomSubtreeCost()
2686 SmallDenseMap<DomTreeNode *, int, 4> DTCostMap; in unswitchBestCondition()
|
| D | LICM.cpp | 497 bool llvm::sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, in sinkRegion()
515 SmallVector<DomTreeNode *, 16> Worklist = collectChildrenInLoop(N, CurLoop); in sinkRegion()
518 for (DomTreeNode *DTN : reverse(Worklist)) { in sinkRegion()
770 DomTreeNode *PreheaderNode = DT->getNode(HoistCommonSucc); in getOrCreateHoistedBlock()
771 DomTreeNode *HeaderNode = DT->getNode(CurLoop->getHeader()); in getOrCreateHoistedBlock()
798 bool llvm::hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, in hoistRegion()
|
| D | ADCE.cpp | 298 for (auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
|
| D | NewGVN.cpp | 512 DenseMap<const DomTreeNode *, unsigned> RPOOrdering;
3438 [&](const DomTreeNode *A, const DomTreeNode *B) { in runGVN()
3571 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToDFSOrdered()
3630 DomTreeNode *DomNode = DT->getNode(IBlock); in convertClassToDFSOrdered()
3660 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToLoadsAndStores()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 535 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
536 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlock()
538 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock()
539 for (DomTreeNode *I : Children) in SplitBlock()
952 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
953 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen()
955 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen()
956 for (DomTreeNode *Child : Children) in SplitBlockAndInsertIfThen()
|
| D | PredicateInfo.cpp | 180 DomTreeNode *DomASrc = DT.getNode(ASrc); in comparePHIRelated()
181 DomTreeNode *DomBSrc = DT.getNode(BSrc); in comparePHIRelated()
193 DomTreeNode *DomADest = DT.getNode(ADest); in comparePHIRelated()
194 DomTreeNode *DomBDest = DT.getNode(BDest); in comparePHIRelated()
310 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
621 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
|
| D | LoopUtils.cpp | 487 SmallVector<DomTreeNode *, 16>
488 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop()
489 SmallVector<DomTreeNode *, 16> Worklist; in collectChildrenInLoop()
490 auto AddRegionToWorklist = [&](DomTreeNode *DTN) { in collectChildrenInLoop()
500 for (DomTreeNode *Child : Worklist[I]->getChildren()) in collectChildrenInLoop()
|
| D | CodeExtractor.cpp | 752 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks()
753 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
756 DomTreeNode *NewNode = DT->addNewBlock(New, Block); in splitReturnBlocks()
758 for (DomTreeNode *I : Children) in splitReturnBlocks()
|
| D | LoopSimplify.cpp | 676 DomTreeNode *Node = DT->getNode(ExitingBlock); in simplifyOneLoop()
680 DomTreeNode *Child = Children.front(); in simplifyOneLoop()
|
| D | LCSSA.cpp | 131 DomTreeNode *DomNode = DT.getNode(DomBB); in formLCSSAForInstructions()
|
| D | LoopUnrollPeel.cpp | 521 DomTreeNode *IDom = DT->getNode(*BB)->getIDom(); in cloneLoopBlocks()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | PostDominators.h | 101 : public GraphTraits<DomTreeNode*> {
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 305 for (const auto &DomTreeNode : DomTreeNodes) {
306 NodeT *BB = DomTreeNode.first;
312 DomTreeNodeBase<NodeT> &MyNd = *DomTreeNode.second;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonGenExtract.cpp | 225 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) in visitBlock()
|
| D | HexagonCommonGEP.cpp | 330 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) in getBlockTraversalOrder()
811 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
871 DomTreeNode *DN = DT->getNode(L->getHeader()); in preheader()
1251 for (auto DTN : children<DomTreeNode*>(DT->getNode(B))) in removeDeadCode()
|