| /external/llvm-project/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/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/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LoopIterator.h | 174 LoopBlocksDFS DFS;
177 LoopBlocksRPO(Loop *Container) : DFS(Container) {} in LoopBlocksRPO()
181 DFS.perform(LI); in perform()
185 LoopBlocksDFS::RPOIterator begin() const { return DFS.beginRPO(); } in begin()
186 LoopBlocksDFS::RPOIterator end() const { return DFS.endRPO(); } in end()
206 LoopBlocksDFS &DFS;
211 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
217 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing"); in begin()
218 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
219 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
[all …]
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | LoopIterator.h | 174 LoopBlocksDFS DFS;
177 LoopBlocksRPO(Loop *Container) : DFS(Container) {} in LoopBlocksRPO()
181 DFS.perform(LI); in perform()
185 LoopBlocksDFS::RPOIterator begin() const { return DFS.beginRPO(); } in begin()
186 LoopBlocksDFS::RPOIterator end() const { return DFS.endRPO(); } in end()
206 LoopBlocksDFS &DFS;
211 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
217 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing"); in begin()
218 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
219 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| D | DataFlowSanitizer.cpp | 440 DataFlowSanitizer &DFS; member
461 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) in DFSanFunction()
462 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) { in DFSanFunction()
1090 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroPrimitiveShadow); in runImpl()
1094 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {}); in runImpl()
1104 Value *Base = IRB.CreatePointerCast(DFS.ArgTLS, DFS.IntptrTy); in getArgTLS()
1106 Base = IRB.CreateAdd(Base, ConstantInt::get(DFS.IntptrTy, ArgOffset)); in getArgTLS()
1107 return IRB.CreateIntToPtr(Base, PointerType::get(DFS.getShadowTy(T), 0), in getArgTLS()
1113 DFS.RetvalTLS, PointerType::get(DFS.getShadowTy(T), 0), "_dfsret"); in getRetvalTLS()
1126 unsigned Size = DL.getTypeAllocSize(DFS.getShadowTy(&FArg)); in getShadowForTLSArgument()
[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 …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | DataFlowSanitizer.cpp | 387 DataFlowSanitizer &DFS; member
410 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) in DFSanFunction()
411 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) { in DFSanFunction()
988 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroShadow); in runOnModule()
992 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {}); in runOnModule()
1003 if (DFS.ArgTLS) in getArgTLSPtr()
1004 return ArgTLSPtr = DFS.ArgTLS; in getArgTLSPtr()
1007 return ArgTLSPtr = IRB.CreateCall(DFS.GetArgTLSTy, DFS.GetArgTLS, {}); in getArgTLSPtr()
1013 if (DFS.RetvalTLS) in getRetvalTLS()
1014 return RetvalTLSPtr = DFS.RetvalTLS; in getRetvalTLS()
[all …]
|
| /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()
853 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroShadow); in runOnModule()
857 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {}); in runOnModule()
868 if (DFS.ArgTLS) in getArgTLSPtr()
869 return ArgTLSPtr = DFS.ArgTLS; in getArgTLSPtr()
872 return ArgTLSPtr = IRB.CreateCall(DFS.GetArgTLS, {}); in getArgTLSPtr()
878 if (DFS.RetvalTLS) in getRetvalTLS()
879 return RetvalTLSPtr = DFS.RetvalTLS; in getRetvalTLS()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopSimplifyCFG.cpp | 124 LoopBlocksDFS DFS; member in __anon30b0ffd50111::ConstantTerminatorFoldingImpl
189 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { in hasIrreducibleCFG() argument
190 assert(DFS.isComplete() && "DFS is expected to be finished"); in hasIrreducibleCFG()
194 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) in hasIrreducibleCFG()
197 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in hasIrreducibleCFG()
212 DFS.perform(&LI); in analyze()
213 assert(DFS.isComplete() && "DFS is expected to be finished"); in analyze()
222 if (hasIrreducibleCFG(DFS)) { in analyze()
229 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in analyze()
301 for (auto I = DFS.beginPostorder(), E = DFS.endPostorder(); I != E; ++I) { in analyze()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | LoopSimplifyCFG.cpp | 126 LoopBlocksDFS DFS; member in __anon58198de10111::ConstantTerminatorFoldingImpl
191 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { in hasIrreducibleCFG() argument
192 assert(DFS.isComplete() && "DFS is expected to be finished"); in hasIrreducibleCFG()
196 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) in hasIrreducibleCFG()
199 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in hasIrreducibleCFG()
214 DFS.perform(&LI); in analyze()
215 assert(DFS.isComplete() && "DFS is expected to be finished"); in analyze()
224 if (hasIrreducibleCFG(DFS)) { in analyze()
231 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in analyze()
303 for (auto I = DFS.beginPostorder(), E = DFS.endPostorder(); I != E; ++I) { in analyze()
[all …]
|
| /external/llvm-project/lldb/examples/scripting/ |
| D | tree_utils.py | 24 def DFS(root, word, cur_path): function
67 return DFS(left_child_ptr, word, cur_path)
76 return DFS(right_child_ptr, word, cur_path)
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 92 DFS(n, visited, sorted); in sort()
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) { in DFS() method in Graph
102 DFS(target, visited, sorted); in DFS()
|
| /external/protobuf/src/google/protobuf/compiler/ |
| D | scc.h | 69 return DFS(descriptor).scc; in GetSCC()
90 NodeData DFS(const Descriptor* descriptor) { in DFS() function
105 NodeData child_data = DFS(dep); in DFS()
|
| /external/llvm-project/lldb/docs/use/ |
| D | python.rst | 61 root to the node containing the word. This is what our DFS function in
67 1: def DFS (root, word, cur_path):
85 19: return DFS (left_child_ptr, word, cur_path)
91 25: return DFS (right_child_ptr, word, cur_path)
100 the DFS function. The first parameter is going to be a node in our
132 the header file SBValue.h. The SBValue methods that we use in our DFS function
136 Explaining DFS Script in Detail
152 Lines 2-11 of DFS are getting data out of the current tree node and getting
154 Lines 2-4 of our DFS function get the word, left and right fields out of the
171 One other note: Typing something as long as our DFS function directly into the
[all …]
|
| /external/icu/icu4c/source/stubdata/ |
| D | Android.mk | 28 LOCAL_LICENSE_KINDS := SPDX-license-identifier-Unicode-DFS
53 LOCAL_LICENSE_KINDS := SPDX-license-identifier-Unicode-DFS
|
| /external/llvm-project/llvm/test/Transforms/HotColdSplit/ |
| D | forward-dfs-reaches-marked-block.ll | 13 ; This will be marked by the inverse DFS on sink-predecesors.
19 ; Do not allow the forward-DFS on sink-successors to mark the block again.
|
| /external/clang/test/CodeGenCXX/ |
| D | strict-vtable-pointers.cpp | 74 DynamicFromStatic DFS; in LocalObjects() local
75 DFS.bar(); in LocalObjects()
|
| /external/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUAnnotateUniformValues.cpp | 81 static void DFS(BasicBlock *Root, SetVector<BasicBlock*> & Set) { in DFS() function
84 DFS(I, Set); in DFS()
107 DFS(Start, Checklist); in isClobberedInFunction()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUAnnotateUniformValues.cpp | 80 static void DFS(BasicBlock *Root, SetVector<BasicBlock*> & Set) { in DFS() function
83 DFS(I, Set); in DFS()
106 DFS(Start, Checklist); in isClobberedInFunction()
|
| /external/pdfium/core/fxcodec/jbig2/ |
| D | JBig2_TrdProc.cpp | 80 int32_t DFS; in DecodeHuffman() local
81 if (pHuffmanDecoder->DecodeAValue(SBHUFFFS.Get(), &DFS) != 0) in DecodeHuffman()
84 FIRSTS += DFS; in DecodeHuffman()
292 int32_t DFS; in DecodeArith() local
293 pIAFS->Decode(pArithDecoder, &DFS); in DecodeArith()
294 FIRSTS += DFS; in DecodeArith()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | DDG.cpp | 202 LoopBlocksDFS DFS(&L); in DataDependenceGraph() local
203 DFS.perform(&LI); in DataDependenceGraph()
205 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) in DataDependenceGraph()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 403 LoopBlocksDFS DFS; member in __anon5c76b2920311::UnloopUpdater
417 Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
436 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
464 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
465 POE = DFS.endPostorder(); POI != POE; ++POI) { in updateBlockParents()
552 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | DDG.cpp | 207 LoopBlocksDFS DFS(&L); in DataDependenceGraph() local
208 DFS.perform(&LI); in DataDependenceGraph()
210 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) in DataDependenceGraph()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1460 SchedDAGReverseDFS DFS; in compute() local
1462 DFS.follow(&SU); in compute()
1465 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1466 const SDep &PredDep = *DFS.getPred(); in compute()
1467 DFS.advance(); in compute()
1475 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1479 DFS.follow(PredDep.getSUnit()); in compute()
1482 const SUnit *Child = DFS.getCurr(); in compute()
1483 const SDep *PredDep = DFS.backtrack(); in compute()
1486 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1456 SchedDAGReverseDFS DFS; in compute() local
1458 DFS.follow(&SU); in compute()
1461 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1462 const SDep &PredDep = *DFS.getPred(); in compute()
1463 DFS.advance(); in compute()
1471 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1475 DFS.follow(PredDep.getSUnit()); in compute()
1478 const SUnit *Child = DFS.getCurr(); in compute()
1479 const SDep *PredDep = DFS.backtrack(); in compute()
1482 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|