| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| LoopIterator.h | 51 /// preorder visited by DFS. It's postorder number is initially zero and set
64 /// Traverse the loop blocks and store the DFS result.
72 assert(isComplete() && "bad loop DFS");
79 assert(isComplete() && "bad loop DFS");
96 assert(I != PostNumbers.end() && "block not visited by DFS");
97 assert(I->second && "block not finished by DFS");
119 LoopBlocksDFS &DFS;
124 DFS(Storage), LI(LInfo) {}
128 /// finishPostorder to record the DFS result.
130 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 50 /// preorder visited by DFS. It's postorder number is initially zero and set
63 /// Traverse the loop blocks and store the DFS result.
71 assert(isComplete() && "bad loop DFS");
78 assert(isComplete() && "bad loop DFS");
95 assert(I != PostNumbers.end() && "block not visited by DFS");
96 assert(I->second && "block not finished by DFS");
128 LoopBlocksDFS &DFS;
133 DFS(Storage), LI(LInfo) {}
137 /// finishPostorder to record the DFS result.
139 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| LoopInfoImpl.h | 405 /// Populate all loop data in a stable order during a single forward DFS.
422 /// Top-level driver for the forward DFS within the loop.
464 /// 2) Visited during a forward DFS CFG traversal.
465 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
502 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
503 DFS.traverse(DomRoot->getBlock());
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| LoopInfoImpl.h | 409 /// Populate all loop data in a stable order during a single forward DFS.
426 /// Top-level driver for the forward DFS within the loop.
468 /// 2) Visited during a forward DFS CFG traversal.
469 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
506 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
507 DFS.traverse(DomRoot->getBlock());
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| LoopInfoImpl.h | 409 /// Populate all loop data in a stable order during a single forward DFS.
426 /// Top-level driver for the forward DFS within the loop.
468 /// 2) Visited during a forward DFS CFG traversal.
469 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
506 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
507 DFS.traverse(DomRoot->getBlock());
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 110 /// preorder visited by DFS. It's postorder number is initially zero and set
123 /// Traverse the loop blocks and store the DFS result.
131 assert(isComplete() && "bad loop DFS");
138 assert(isComplete() && "bad loop DFS");
155 assert(I != PostNumbers.end() && "block not visited by DFS");
156 assert(I->second && "block not finished by DFS");
188 LoopBlocksDFS &DFS;
193 DFS(Storage), LI(LInfo) {}
197 /// finishPostorder to record the DFS result.
199 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 70 /** DFS-based topological sort. A valid sort is the reverse of
91 DFS(n, visited, sorted);
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) {
102 DFS(target, visited, sorted);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| DataFlowSanitizer.cpp | 284 DataFlowSanitizer &DFS;
307 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI)
308 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()),
515 std::string GVName = GV->getName(), Prefix = "dfs$";
713 // Instrumented functions get a 'dfs$' prefix. This allows us to more
[all...] |
| /external/clang/test/CodeGenCXX/ |
| strict-vtable-pointers.cpp | 74 DynamicFromStatic DFS;
75 DFS.bar();
|
| /external/pdfium/core/fxcodec/jbig2/ |
| JBig2_TrdProc.cpp | 42 int32_t DFS;
43 if (pHuffmanDecoder->decodeAValue(SBHUFFFS, &DFS) != 0)
46 FIRSTS = FIRSTS + DFS;
286 int32_t DFS;
287 pIAFS->decode(pArithDecoder, &DFS);
288 FIRSTS += DFS;
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 403 LoopBlocksDFS DFS;
417 Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {}
436 LoopBlocksTraversal Traversal(DFS, LI);
456 // the DFS result cached by Traversal.
464 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
465 POE = DFS.endPostorder(); POI != POE; ++POI) {
507 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
552 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
722 /// Traverse the loop blocks and store the DFS result.
723 /// Useful for clients that just want the final DFS result and don't need t
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| LoopInfo.cpp | 400 LoopBlocksDFS DFS;
414 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {}
433 LoopBlocksTraversal Traversal(DFS, LI);
454 // the DFS result cached by Traversal.
462 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
463 POE = DFS.endPostorder(); POI != POE; ++POI) {
509 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
555 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
676 // FIXME: With an up-to-date DFS (see LoopIterator.h) and DominatorTree, we
698 /// Traverse the loop blocks and store the DFS result
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 237 LoopBlocksDFS DFS(L);
238 DFS.perform(LI);
240 // Stash the DFS iterators before adding blocks to the loop.
241 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
242 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.cpp | [all...] |
| ScheduleDAG.cpp | 456 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS
527 DFS(Y, UpperBound, HasLoop);
541 /// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark
544 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
626 DFS(TargetSU, UpperBound, HasLoop);
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 377 LoopBlocksDFS DFS(L);
378 DFS.perform(LI);
380 // Stash the DFS iterators before adding blocks to the loop.
381 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
382 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAG.cpp | 431 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS
499 DFS(Y, UpperBound, HasLoop);
513 /// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark
516 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
594 DFS(TargetSU, UpperBound, HasLoop);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 44 class DFS : public WorkList {
105 WorkList *WorkList::makeDFS() { return new DFS(); }
|
