| /external/clang/test/Analysis/ |
| D | traversal-algorithm.mm | 1 …zer-checker=debug.DumpTraversal -analyzer-max-loop 4 -std=c++11 %s | FileCheck -check-prefix=DFS %s
53 // DFS:27 WhileStmt
54 // DFS-next:33 ForStmt
55 // DFS-next:37 ObjCForCollectionStmt
56 // DFS-next:44 CXXForRangeStmt
57 // DFS-next:44 CXXForRangeStmt
58 // DFS-next:44 CXXForRangeStmt
59 // DFS-next:44 CXXForRangeStmt
60 // DFS-next:--END PATH--
61 // DFS-next:37 ObjCForCollectionStmt
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopIterator.h | 128 LoopBlocksDFS &DFS;
133 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
139 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing"); in begin()
140 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
141 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
145 return po_ext_end(DFS.L->getHeader(), *this); in end()
154 if (!DFS.L->contains(LI->getLoopFor(BB))) in visitPreorder()
157 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second; in visitPreorder()
163 assert(DFS.PostNumbers.count(BB) && "Loop DFS skipped preorder"); in finishPostorder()
164 DFS.PostBlocks.push_back(BB); in finishPostorder()
[all …]
|
| D | LoopInfoImpl.h | 551 PopulateLoopsDFS<BlockT, LoopT> DFS(this); in Analyze()
552 DFS.traverse(DomRoot->getBlock()); in Analyze()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 91 DFS(n, visited, sorted); in sort()
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { in DFS() method in Graph
102 DFS(target, visited, sorted); in DFS()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 439 LoopBlocksDFS DFS; member in __anon4e6819950111::UnloopUpdater
453 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
472 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
501 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
502 POE = DFS.endPostorder(); POI != POE; ++POI) { in updateBlockParents()
591 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1250 SchedDAGReverseDFS DFS; in compute() local
1252 DFS.follow(SU); in compute()
1255 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1256 const SDep &PredDep = *DFS.getPred(); in compute()
1257 DFS.advance(); in compute()
1265 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1269 DFS.follow(PredDep.getSUnit()); in compute()
1272 const SUnit *Child = DFS.getCurr(); in compute()
1273 const SDep *PredDep = DFS.backtrack(); in compute()
1276 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|
| D | ScheduleDAG.cpp | 528 DFS(Y, UpperBound, HasLoop); in AddPred()
545 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() function in ScheduleDAGTopologicalSort
627 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| D | MachineScheduler.cpp | 2757 const SchedDFSResult *DFS = in getNodeAttributes() local
2759 if (DFS) { in getNodeAttributes()
2761 Str += DOT::getColorString(DFS->getSubtreeID(N)); in getNodeAttributes()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUnroll.cpp | 263 LoopBlocksDFS DFS(L); in UnrollLoop() local
264 DFS.perform(LI); in UnrollLoop()
267 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
268 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollLoop()
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 33 1) Do a DFS from the first machine-code basic block of the hot loop
36 2) Do a DFS from the last machine-code basic block of the hot loop
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | CoreEngine.cpp | 43 class DFS : public WorkList { class
104 WorkList *WorkList::makeDFS() { return new DFS(); } in makeDFS()
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 1951 LoopBlocksDFS DFS(OrigLoop); in vectorizeLoop() local
1952 DFS.perform(LI); in vectorizeLoop()
1955 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), in vectorizeLoop()
1956 be = DFS.endRPO(); bb != be; ++bb) in vectorizeLoop()
4298 LoopBlocksDFS DFS(TheLoop); in calculateRegisterUsage() local
4299 DFS.perform(LI); in calculateRegisterUsage()
4319 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), in calculateRegisterUsage()
4320 be = DFS.endRPO(); bb != be; ++bb) { in calculateRegisterUsage()
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3collections.c | 2415 DFS(pANTLR3_TOPO topo, ANTLR3_UINT32 node) in DFS() function
2500 DFS(topo, i); in DFS()
2564 DFS(topo, v); in sortToArray()
|
| /external/clang/docs/analyzer/ |
| D | DebugChecks.rst | 50 whether the analysis engine is doing BFS or DFS.
|
| /external/llvm/include/llvm/CodeGen/ |
| D | ScheduleDAG.h | 692 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|