| /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 | 502 PopulateLoopsDFS<BlockT, LoopT> DFS(this); in analyze()
503 DFS.traverse(DomRoot->getBlock()); in analyze()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | DataFlowSanitizer.cpp | 284 DataFlowSanitizer &DFS; member
307 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) in DFSanFunction()
308 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), in DFSanFunction()
858 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroShadow); in runOnModule()
862 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {}); in runOnModule()
873 if (DFS.ArgTLS) in getArgTLSPtr()
874 return ArgTLSPtr = DFS.ArgTLS; in getArgTLSPtr()
877 return ArgTLSPtr = IRB.CreateCall(DFS.GetArgTLS, {}); in getArgTLSPtr()
883 if (DFS.RetvalTLS) in getRetvalTLS()
884 return RetvalTLSPtr = DFS.RetvalTLS; in getRetvalTLS()
[all …]
|
| /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/clang/test/CodeGenCXX/ |
| D | strict-vtable-pointers.cpp | 74 DynamicFromStatic DFS; in LocalObjects() local
75 DFS.bar(); in LocalObjects()
|
| /external/pdfium/core/src/fxcodec/jbig2/ |
| D | JBig2_TrdProc.cpp | 20 int32_t DT, DFS, CURS; in decode_Huffman() local
52 if (pHuffmanDecoder->decodeAValue(SBHUFFFS, &DFS) != 0) in decode_Huffman()
55 FIRSTS = FIRSTS + DFS; in decode_Huffman()
220 int32_t DT, DFS, CURS; in decode_Arith() local
273 IAFS->decode(pArithDecoder, &DFS); in decode_Arith()
274 FIRSTS = FIRSTS + DFS; in decode_Arith()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 451 LoopBlocksDFS DFS; member in __anonc610db300311::UnloopUpdater
465 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
484 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
513 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
514 POE = DFS.endPostorder(); POI != POE; ++POI) { in updateBlockParents()
603 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| D | README.txt | 2 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| D | README.chromium | 9 constructing graphs, BFS and DFS traversals, topological sort, shortest paths,
|
| D | PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1616 SchedDAGReverseDFS DFS; in compute() local
1618 DFS.follow(SU); in compute()
1621 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1622 const SDep &PredDep = *DFS.getPred(); in compute()
1623 DFS.advance(); in compute()
1631 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1635 DFS.follow(PredDep.getSUnit()); in compute()
1638 const SUnit *Child = DFS.getCurr(); in compute()
1639 const SDep *PredDep = DFS.backtrack(); in compute()
1642 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|
| D | ScheduleDAG.cpp | 527 DFS(Y, UpperBound, HasLoop); in AddPred()
544 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() function in ScheduleDAGTopologicalSort
626 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| D | MachineScheduler.cpp | 3371 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeLabel() local
3374 if (DFS) in getNodeLabel()
3375 SS << " I:" << DFS->getNumInstrs(SU); in getNodeLabel()
3385 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeAttributes() local
3387 if (DFS) { in getNodeAttributes()
3389 Str += DOT::getColorString(DFS->getSubtreeID(N)); in getNodeAttributes()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUnroll.cpp | 304 LoopBlocksDFS DFS(L); in UnrollLoop() local
305 DFS.perform(LI); in UnrollLoop()
308 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
309 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollLoop()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| D | index.rst | 10 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| D | core.rst | 17 includes methods for constructing graphs, BFS and DFS traversals,
|
| /external/autotest/server/site_tests/network_WiFi_Regulatory/ |
| D | control | 16 element. Such frames are sent on a DFS network to vacate the
|
| /external/autotest/server/site_tests/network_WiFi_SimpleConnect/ |
| D | control.wifi_checkDFS | 16 This test verifies that DUT can connect to an open network on a DFS channel.
|
| /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 | 44 class DFS : public WorkList { class
105 WorkList *WorkList::makeDFS() { return new DFS(); } in makeDFS()
|
| /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/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph.egg-info/ |
| D | PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /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 | 706 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|