| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| H A D | Dominators.java | 121 HashSet<SsaBasicBlock> visited = new HashSet<SsaBasicBlock>();
132 if (visited.add(vAncestor) && vabbInfo.ancestor != null) {
|
| /external/llvm/lib/CodeGen/ |
| H A D | CalcSpillWeights.cpp | 139 SmallPtrSet<MachineInstr*, 8> visited; local
158 if (!visited.insert(mi).second)
|
| /external/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector2.cc | 61 bool visited[kMaxMutex]; member in struct:__sanitizer::DDPhysicalThread
365 internal_memset(pt->visited, 0, sizeof(pt->visited));
380 if (pt->visited[link.id])
386 pt->visited[link.id] = true;
|
| /external/llvm/include/llvm/Analysis/ |
| H A D | RegionInfoImpl.h | 263 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const {
266 visited->insert(BB);
273 if (*SI != exit && visited->find(*SI) == visited->end())
274 verifyWalk(*SI, visited);
286 std::set<BlockT *> visited;
287 verifyWalk(getEntry(), &visited); local
|
| /external/pdfium/core/src/fpdfapi/fpdf_parser/ |
| H A D | fpdf_parser_objects.cpp | 240 std::set<FX_DWORD> visited; local
241 return CloneInternal(bDirect, &visited);
244 std::set<FX_DWORD>* visited) const {
265 pCopy->m_Objects.Add(value->CloneInternal(bDirect, visited));
274 it.first, it.second->CloneInternal(bDirect, visited)));
288 pDict = ToDictionary(pDict->CloneInternal(bDirect, visited));
295 if (bDirect && !pdfium::ContainsKey(*visited, obj_num)) {
296 visited->insert(obj_num);
298 return pDirect ? pDirect->CloneInternal(TRUE, visited) : nullptr;
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| H A D | antlr3collections.c | 2296 topo->visited = NULL; // Don't know how big it is yet
2426 if (topo->visited->isMember(topo->visited, node))
2460 // So far, no cycles have been found and we have not visited this node yet,
2467 // First flag that we have visited this node
2469 topo->visited->add(topo->visited, node);
2479 // that have not already been visited.
2505 // At this point we will have visited all the dependencies
2541 // Next we need an empty bitset to show whether we have visited
[all...] |
| /external/guice/lib/build/ |
| H A D | safesax.jar | ... .Children children java.util.ArrayList requiredChilden boolean visited safesax.StartElementListener startElementListener safesax.EndElementListener endElementListener safesax. ... |
| /external/icu/icu4c/source/test/perf/perldriver/ |
| H A D | Output.pm | 228 A:visited { color: blue; font-weight: normal; text-decoration: none } /* visited links */
|
| /external/icu/icu4j/perf-tests/perldriver/ |
| H A D | Output.pm | 228 A:visited { color: blue; font-weight: normal; text-decoration: none } /* visited links */
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/experimental/javascript/closure/ |
| H A D | base.js | 452 visited: {},
547 // we have already visited this one. We can get here if we have cyclic
549 if (path in deps.visited) {
557 deps.visited[path] = true;
|
| /external/doclava/res/assets/templates/assets/ |
| H A D | doclava-developer-core.css | 41 a:visited,
42 a:visited code {
477 #footerlinks a:visited {
|
| H A D | doclava-developer-docs.css | 256 #jd-header .crumb a:visited {
413 .absent a:visited,
|
| /external/libopus/doc/ |
| H A D | customdoxygen.css | 95 .contents a:visited {
114 .contents a.qindexHL:visited {
125 a.code, a.code:visited {
129 a.codeRef, a.codeRef:visited {
|
| /external/llvm/docs/_ocamldoc/ |
| H A D | style.css | 77 a, a:link, a:visited, a:active, a:hover { color : #00B; text-decoration: none }
|
| /external/llvm/docs/_static/ |
| H A D | llvm.css | 9 a:link img, a:visited img { border-style: none }
|
| /external/nanopb-c/docs/ |
| H A D | lsr.css | 54 p a:visited {
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| H A D | antlr3collections.h | 427 * visited in the stack, then it means there wasa cycle such as 9->8->1->9
457 * The set of visited nodes as determined by a set entry in
460 pANTLR3_BITSET visited; member in struct:ANTLR3_TOPO_struct
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| H A D | visitor.rb | 46 children have been visited.
|
| /external/v8/test/mjsunit/es6/ |
| H A D | iteration-semantics.js | 116 var visited = []
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| H A D | test_object_graph.py | 294 visited, removes, orphans = graph.filterStack(
297 self.assertEqual(visited, 6)
|
| /external/libjpeg-turbo/doc/html/ |
| H A D | doxygen.css | 113 .contents a:visited {
132 .contents a.qindexHL:visited {
143 a.code, a.code:visited {
147 a.codeRef, a.codeRef:visited {
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| H A D | ProgramState.cpp | 509 bool wasVisited = !visited.insert(val.getCVData()).second;
530 bool wasVisited = !visited.insert(sym).second;
586 bool wasVisited = !visited.insert(R).second;
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| H A D | nv50_ir_graph.cpp | 89 visited(0),
424 // erase visited
|
| /external/v8/src/compiler/ |
| H A D | scheduler.cc | 1110 // except for backwards edges have been visited.
1189 BoolVector visited(graph_->NodeCount(), false, zone_);
1193 visited[node->id()] = true;
1198 if (visited[node->id()]) {
1203 visited[node->id()] = true;
|
| /external/pdfium/core/include/fpdfapi/ |
| H A D | fpdf_objects.h | 138 std::set<FX_DWORD>* visited) const;
|