| /external/python/cpython2/Tools/gdb/ |
| D | libpython.py | 201 def write_field_repr(self, name, out, visited): argument
207 field_obj.write_repr(out, visited)
253 def proxyval(self, visited): argument
292 def write_repr(self, out, visited): argument
300 return out.write(repr(self.proxyval(visited)))
410 def _write_instance_repr(out, visited, name, pyop_attrdict, address): argument
424 out.write(pyop_arg.proxyval(visited))
426 pyop_val.write_repr(out, visited)
492 def proxyval(self, visited): argument
500 if self.as_address() in visited:
[all …]
|
| /external/python/cpython3/Tools/gdb/ |
| D | libpython.py | 230 def write_field_repr(self, name, out, visited): argument
236 field_obj.write_repr(out, visited)
282 def proxyval(self, visited): argument
321 def write_repr(self, out, visited): argument
329 return out.write(repr(self.proxyval(visited)))
438 def _write_instance_repr(out, visited, name, pyop_attrdict, address): argument
452 out.write(pyop_arg.proxyval(visited))
454 pyop_val.write_repr(out, visited)
520 def proxyval(self, visited): argument
528 if self.as_address() in visited:
[all …]
|
| /external/eigen/Eigen/src/MetisSupport/ |
| D | MetisSupport.h | 37 IndexVector visited(m); in get_symmetrized_graph()
38 visited.setConstant(-1); in get_symmetrized_graph()
42 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
47 if (visited(idx) != j ) in get_symmetrized_graph()
49 visited(idx) = j; in get_symmetrized_graph()
57 if(visited(idx) != j) in get_symmetrized_graph()
59 visited(idx) = j; in get_symmetrized_graph()
69 visited.setConstant(-1); in get_symmetrized_graph()
75 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
80 if (visited(idx) != j ) in get_symmetrized_graph()
[all …]
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | algorithm.cc | 42 std::vector<bool> visited(g.num_node_ids(), false); in DFSFromHelper() local
53 if (visited[n->id()]) continue; in DFSFromHelper()
54 visited[n->id()] = true; in DFSFromHelper()
60 auto add_work = [&visited, &stack](Node* out) { in DFSFromHelper()
61 if (!visited[out->id()]) { in DFSFromHelper()
136 std::vector<bool> visited(g.num_node_ids(), false); in ReverseDFSFromHelper() local
147 if (visited[n->id()]) continue; in ReverseDFSFromHelper()
148 visited[n->id()] = true; in ReverseDFSFromHelper()
154 auto add_work = [&visited, &stack](T out) { in ReverseDFSFromHelper()
155 if (!visited[out->id()]) { in ReverseDFSFromHelper()
[all …]
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 83 Set<Node<T>> visited = new OrderedHashSet<Node<T>>(); in sort() local
85 while ( visited.size() < nodes.size() ) { in sort()
90 if ( !visited.contains(n) ) break; in sort()
92 DFS(n, visited, sorted); in sort()
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) { in DFS() argument
98 if ( visited.contains(n) ) return; in DFS()
99 visited.add(n); in DFS()
102 DFS(target, visited, sorted); in DFS()
|
| /external/libaom/libaom/tools/txfm_analyzer/ |
| D | txfm_gen_code.cc | 239 if (node->visited == 0) { in node_to_code_sse2()
240 node->visited = 1; in node_to_code_sse2()
249 partnerNode->visited = 1; in node_to_code_sse2()
257 partnerNode->visited = 1; in node_to_code_sse2()
264 int visited[65][65][2][2]; in gen_cospi_list_sse2() local
265 memset(visited, 0, sizeof(visited)); in gen_cospi_list_sse2()
276 if (node0->visited == 0) { in gen_cospi_list_sse2()
277 node0->visited = 1; in gen_cospi_list_sse2()
291 if (!visited[idx0][idx1][sgn0][sgn1]) { in gen_cospi_list_sse2()
292 visited[idx0][idx1][sgn0][sgn1] = 1; in gen_cospi_list_sse2()
[all …]
|
| /external/pdfium/fpdfsdk/ |
| D | cpdfsdk_actionhandler.cpp | 25 std::set<const CPDF_Dictionary*> visited; in DoAction_DocOpen() local
26 return ExecuteDocumentOpenAction(action, pFormFillEnv, &visited); in DoAction_DocOpen()
66 std::set<const CPDF_Dictionary*> visited; in DoAction_Page() local
67 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited); in DoAction_Page()
74 std::set<const CPDF_Dictionary*> visited; in DoAction_Document() local
75 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited); in DoAction_Document()
84 std::set<const CPDF_Dictionary*> visited; in DoAction_Field() local
86 &visited); in DoAction_Field()
92 std::set<const CPDF_Dictionary*>* visited) { in ExecuteDocumentOpenAction() argument
94 if (pdfium::ContainsKey(*visited, pDict)) in ExecuteDocumentOpenAction()
[all …]
|
| /external/kotlinx.coroutines/publication-validator/src/test/kotlin/kotlinx/coroutines/tools/ |
| D | NpmPublicationValidator.kt | 22 val visited = visit("package.json") { in <lambda>() constant
30 assertEquals(1, visited) in <lambda>()
36 val visited = visit(".js") { in <lambda>() constant
42 assertEquals(2, visited) in <lambda>()
57 var visited = 0 in <lambda>() variable
62 ++visited in <lambda>()
68 return visited in <lambda>()
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | DFAOptimizer.java | 128 protected Set<Integer> visited = new HashSet<Integer>(); field in DFAOptimizer
157 visited.clear(); in optimize()
172 visited.clear(); in optimize()
186 if ( visited.contains(sI) ) { in optimizeExitBranches()
189 visited.add(sI); in optimizeExitBranches()
216 if ( visited.contains(sI) ) { in optimizeEOTBranches()
219 visited.add(sI); in optimizeEOTBranches()
|
| D | MachineProbe.java | 49 Set<DFAState> visited = new HashSet<DFAState>(); in getAnyDFAPathToTarget() local
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited); in getAnyDFAPathToTarget()
54 DFAState targetState, Set<DFAState> visited) { in getAnyDFAPathToTarget() argument
56 visited.add(startState); in getAnyDFAPathToTarget()
65 if (!visited.contains(e.target)) { in getAnyDFAPathToTarget()
67 (DFAState) e.target, targetState, visited); in getAnyDFAPathToTarget()
|
| /external/mesa3d/src/panfrost/midgard/ |
| D | midgard_helper_invocations.c | 105 struct set *visited = _mesa_set_create(NULL, in mir_analyze_helper_terminate() local
132 if (!_mesa_set_search(visited, pred)) { in mir_analyze_helper_terminate()
138 _mesa_set_add(visited, blk); in mir_analyze_helper_terminate()
141 _mesa_set_destroy(visited, NULL); in mir_analyze_helper_terminate()
214 struct set *visited = _mesa_set_create(NULL, in mir_analyze_helper_requirements() local
226 if (progress || !_mesa_set_search(visited, blk)) { in mir_analyze_helper_requirements()
231 _mesa_set_add(visited, blk); in mir_analyze_helper_requirements()
234 _mesa_set_destroy(visited, NULL); in mir_analyze_helper_requirements()
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | call_graph_test.cc | 374 std::vector<const HloComputation*> visited; in TEST_F() local
375 TF_ASSERT_OK(call_graph->VisitNodes([&visited](const CallGraphNode& node) { in TEST_F()
376 visited.push_back(node.computation()); in TEST_F()
379 EXPECT_EQ(visited.size(), 5); in TEST_F()
382 std::unordered_set<const HloComputation*>(visited.begin(), visited.end()) in TEST_F()
387 auto index_of = [&visited](const HloComputation* comp) { in TEST_F()
388 auto it = absl::c_find(visited, comp); in TEST_F()
389 EXPECT_NE(it, visited.end()); in TEST_F()
390 return std::distance(visited.begin(), it); in TEST_F()
508 std::vector<HloComputation*> visited; in TEST_F() local
[all …]
|
| D | ar_crs_combiner.cc | 129 absl::flat_hash_set<HloInstruction*>* visited) { in GetAllTuples() argument
130 if (visited->find(instruction) != visited->end()) { in GetAllTuples()
133 visited->insert(instruction); in GetAllTuples()
140 return GetAllTuples(instruction->operands()[0], visited); in GetAllTuples()
146 auto init_tuples = GetAllTuples(while_instr->while_init(), visited); in GetAllTuples()
148 while_instr->while_body()->root_instruction(), visited); in GetAllTuples()
167 GetAllTuples(cond_instr->mutable_operand(i + 1), visited); in GetAllTuples()
181 auto tuples = GetAllTuples(instruction->operands()[0], visited); in GetAllTuples()
187 tuple->mutable_operand(instruction->tuple_index()), visited); in GetAllTuples()
207 auto init_tuples = GetAllTuples(instruction->while_init(), visited); in GetAllTuples()
[all …]
|
| D | call_graph.cc | 145 absl::flat_hash_set<const HloComputation*>* visited) const { in DominatesHelper()
146 if (a == b || ContainsKey(*visited, b)) { in DominatesHelper()
159 visited->insert(b); in DominatesHelper()
161 if (!DominatesHelper(a, b_caller, visited)) { in DominatesHelper()
170 absl::flat_hash_set<const HloComputation*> visited; in Dominates() local
171 return DominatesHelper(a, b, &visited); in Dominates()
321 absl::flat_hash_set<const CallGraphNode*>* visited) const { in VisitNodesInternal()
322 auto pair = visited->insert(&node); in VisitNodesInternal()
330 VisitNodesInternal(visitor_func, GetNode(computation), visited)); in VisitNodesInternal()
338 absl::flat_hash_set<const CallGraphNode*> visited; in VisitNodes() local
[all …]
|
| /external/tensorflow/tensorflow/python/autograph/pyct/ |
| D | inspect_utils.py | 173 def getqualifiedname(namespace, object_, max_depth=5, visited=None): argument
191 if visited is None:
192 visited = set()
213 namespace, parent, max_depth=0, visited=visited)
216 parent.__dict__, object_, max_depth=0, visited=visited)
227 if tf_inspect.ismodule(value) and id(value) not in visited:
228 visited.add(id(value))
230 max_depth - 1, visited)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGPrinter.cpp | 224 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, in setSubgraphColorHelper() argument
237 unsigned oldSize = visited.size(); in setSubgraphColorHelper()
238 visited.insert(N); in setSubgraphColorHelper()
239 if (visited.size() != oldSize) { in setSubgraphColorHelper()
244 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; in setSubgraphColorHelper()
258 DenseSet<SDNode *> visited; in setSubgraphColor() local
260 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { in setSubgraphColor()
263 setSubgraphColorHelper(N, "blue", visited, 0, printed); in setSubgraphColor()
265 setSubgraphColorHelper(N, "green", visited, 0, printed); in setSubgraphColor()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGPrinter.cpp | 226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, in setSubgraphColorHelper() argument
239 unsigned oldSize = visited.size(); in setSubgraphColorHelper()
240 visited.insert(N); in setSubgraphColorHelper()
241 if (visited.size() != oldSize) { in setSubgraphColorHelper()
246 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; in setSubgraphColorHelper()
260 DenseSet<SDNode *> visited; in setSubgraphColor() local
262 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { in setSubgraphColor()
265 setSubgraphColorHelper(N, "blue", visited, 0, printed); in setSubgraphColor()
267 setSubgraphColorHelper(N, "green", visited, 0, printed); in setSubgraphColor()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | UnreachableCodeChecker.cpp | 43 CFGBlocksSet &visited);
52 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
107 if (!visited.count(CB->getBlockID())) in checkEndAnalysis()
108 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
172 CFGBlocksSet &visited) { in FindUnreachableEntryPoints() argument
173 visited.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
184 if (!visited.count((*I)->getBlockID())) in FindUnreachableEntryPoints()
186 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
|
| /external/grpc-grpc/src/proto/ |
| D | gen_build_yaml.py | 24 def update_deps(key, proto_filename, deps, deps_external, is_trans, visited): argument
25 if not proto_filename in visited:
26 visited.append(proto_filename)
42 update_deps(key, imp_proto, deps, deps_external, is_trans, visited)
|
| /external/llvm/unittests/Support/ |
| D | Path.cpp | 667 v_t visited; in TEST_F() local
678 visited.push_back(path::filename(i->path())); in TEST_F()
680 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0"); in TEST_F()
681 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1"); in TEST_F()
682 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1"); in TEST_F()
683 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited.end(), in TEST_F()
685 v_t::const_iterator da1 = std::find(visited.begin(), visited.end(), "da1"); in TEST_F()
686 v_t::const_iterator z0 = std::find(visited.begin(), visited.end(), "z0"); in TEST_F()
687 v_t::const_iterator za1 = std::find(visited.begin(), visited.end(), "za1"); in TEST_F()
688 v_t::const_iterator pop = std::find(visited.begin(), visited.end(), "pop"); in TEST_F()
[all …]
|
| /external/skia/tools/doxygen/ |
| D | customdoxygen.css | 51 .contents a:visited {
61 .contents a.qindexHL:visited {
65 a.code, a.code:visited, a.line, a.line:visited {
69 a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited {
|
| /external/tensorflow/tensorflow/compiler/xla/tools/ |
| D | hlo_extractor.cc | 114 absl::flat_hash_map<const HloInstruction*, int64> visited; in ComputeBoundary() local
116 visited.emplace(root, 0); in ComputeBoundary()
120 int64 hops = visited[hlo]; in ComputeBoundary()
126 if (visited.count(operand)) { in ComputeBoundary()
130 visited.emplace(operand, hops + 1); in ComputeBoundary()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bvgraph.h | 113 &visited = t2; in isReachable() local
115 visited.clear(); in isReachable()
116 visited.setBit(from); in isReachable()
119 if (visited.setBit(idx)) in isReachable()
122 return targets.intersectsWith(visited); in isReachable()
|
| /external/tensorflow/tensorflow/python/data/util/ |
| D | traverse.py | 42 visited = []
45 visited.append(op)
54 if input_op not in visited:
|
| /external/perfetto/tools/ |
| D | gen_merged_protos | 55 def get_transitive_imports(rel_path, visited): argument
56 if rel_path in visited:
58 visited.add(rel_path)
64 res += get_transitive_imports(child, visited)
123 all_protos += get_transitive_imports(root_path, visited=set())
|