| /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 | 277 DataFlowSanitizer &DFS; member
300 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) in DFSanFunction()
301 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), in DFSanFunction()
849 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroShadow); in runOnModule()
853 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn); in runOnModule()
864 if (DFS.ArgTLS) in getArgTLSPtr()
865 return ArgTLSPtr = DFS.ArgTLS; in getArgTLSPtr()
868 return ArgTLSPtr = IRB.CreateCall(DFS.GetArgTLS); in getArgTLSPtr()
874 if (DFS.RetvalTLS) in getRetvalTLS()
875 return RetvalTLSPtr = DFS.RetvalTLS; in getRetvalTLS()
[all …]
|
| /external/lldb/examples/scripting/ |
| D | tree_utils.py | 23 def DFS (root, word, cur_path): function
66 return DFS (left_child_ptr, word, cur_path)
75 return DFS (right_child_ptr, word, cur_path)
|
| /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 | 424 LoopBlocksDFS DFS; member in __anon889b8b8b0111::UnloopUpdater
438 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
457 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
486 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
487 POE = DFS.endPostorder(); POI != POE; ++POI) { in updateBlockParents()
576 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1481 SchedDAGReverseDFS DFS; in compute() local
1483 DFS.follow(SU); in compute()
1486 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1487 const SDep &PredDep = *DFS.getPred(); in compute()
1488 DFS.advance(); in compute()
1496 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1500 DFS.follow(PredDep.getSUnit()); in compute()
1503 const SUnit *Child = DFS.getCurr(); in compute()
1504 const SDep *PredDep = DFS.backtrack(); in compute()
1507 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 | 3281 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeLabel() local
3284 if (DFS) in getNodeLabel()
3285 SS << " I:" << DFS->getNumInstrs(SU); in getNodeLabel()
3295 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeAttributes() local
3297 if (DFS) { in getNodeAttributes()
3299 Str += DOT::getColorString(DFS->getSubtreeID(N)); in getNodeAttributes()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUnroll.cpp | 303 LoopBlocksDFS DFS(L); in UnrollLoop() local
304 DFS.perform(LI); in UnrollLoop()
307 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
308 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 | 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/clang/docs/analyzer/ |
| D | DebugChecks.rst | 50 whether the analysis engine is doing BFS or DFS.
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 2750 LoopBlocksDFS DFS(OrigLoop); in vectorizeLoop() local
2751 DFS.perform(LI); in vectorizeLoop()
2754 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), in vectorizeLoop()
2755 be = DFS.endRPO(); bb != be; ++bb) in vectorizeLoop()
4799 LoopBlocksDFS DFS(TheLoop); in calculateRegisterUsage() local
4800 DFS.perform(LI); in calculateRegisterUsage()
4820 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), in calculateRegisterUsage()
4821 be = DFS.endRPO(); bb != be; ++bb) { in calculateRegisterUsage()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | ScheduleDAG.h | 706 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|
| /external/pdfium/core/src/fxcodec/jbig2/ |
| D | JBig2_GeneralDecoder.cpp | 1877 FX_INT32 DT, DFS, CURS; in decode_Huffman() local
1916 if(pHuffmanDecoder->decodeAValue(SBHUFFFS, &DFS) != 0) { in decode_Huffman()
1920 FIRSTS = FIRSTS + DFS; in decode_Huffman()
2097 FX_INT32 DT, DFS, CURS; in decode_Arith() local
2160 if(IAFS->decode(pArithDecoder, &DFS) == -1) { in decode_Arith()
2164 FIRSTS = FIRSTS + DFS; in decode_Arith()
|
| /external/wpa_supplicant_8/hostapd/ |
| D | ChangeLog | 49 * fixed DFS and channel switch operation for multi-BSS cases
168 * added support for DFS (processing radar detection events, CAC, channel
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| D | ChangeLog | 79 * allow hostapd DFS implementation to be used in wpa_supplicant AP mode
147 * added DFS indicator to get_capability freq
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF
META-INF/ECLIPSEF.SF
META-INF/ECLIPSEF ... |
| D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF
META-INF/ECLIPSEF.SF
META-INF/ECLIPSEF ... |
| D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF
META-INF/ECLIPSEF.SF
META-INF/ECLIPSEF ... |
| /external/antlr/antlr-3.4/lib/ |
| D | antlr-3.4-complete.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/antlr/
org/ ... |