Home
last modified time | relevance | path

Searched refs:visited (Results 1 - 25 of 165) sorted by relevance

1234567

/kernel/linux/linux-6.6/lib/
H A Dhashtable_test.c16 int visited; member
73 a.visited = 0; in hashtable_test_hash_add()
77 b.visited = 0; in hashtable_test_hash_add()
81 x->visited++; in hashtable_test_hash_add()
90 /* Both entries should have been visited exactly once. */ in hashtable_test_hash_add()
91 KUNIT_EXPECT_EQ(test, a.visited, 1); in hashtable_test_hash_add()
92 KUNIT_EXPECT_EQ(test, b.visited, 1); in hashtable_test_hash_add()
105 b.visited = 0; in hashtable_test_hash_del()
110 x->visited++; in hashtable_test_hash_del()
114 /* The deleted entry should not have been visited in hashtable_test_hash_del()
[all...]
/kernel/linux/linux-5.10/tools/testing/selftests/bpf/map_tests/
H A Darray_map_batch_ops.c30 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument
35 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
39 visited[i] = 1; in map_batch_verify()
42 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
55 int map_fd, *keys, *values, *visited; in test_array_map_batch_ops() local
73 visited = malloc(max_entries * sizeof(int)); in test_array_map_batch_ops()
74 CHECK(!keys || !values || !visited, "malloc()", "error:%s\n", in test_array_map_batch_ops()
84 map_batch_verify(visited, max_entrie in test_array_map_batch_ops()
[all...]
H A Dhtab_map_batch_ops.c40 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument
50 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
67 visited[i] = 1; in map_batch_verify()
71 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
80 int map_fd, *keys, *visited, key; in __test_map_lookup_and_delete_batch() local
109 visited = malloc(max_entries * sizeof(int)); in __test_map_lookup_and_delete_batch()
110 CHECK(!keys || !values || !visited, "malloc()", in __test_map_lookup_and_delete_batch()
139 map_batch_verify(visited, max_entrie in __test_map_lookup_and_delete_batch()
[all...]
/third_party/python/Tools/gdb/
H A Dlibpython.py33 visited so far in the traversal, to avoid infinite recursion due to cycles in
210 def write_field_repr(self, name, out, visited):
216 field_obj.write_repr(out, visited)
262 def proxyval(self, visited):
273 visited: a set of all gdb.Value pyobject pointers already visited
301 def write_repr(self, out, visited):
309 return out.write(repr(self.proxyval(visited)))
418 def _write_instance_repr(out, visited, name, pyop_attrdict, address):
433 out.write(pyop_arg.proxyval(visited))
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/map_tests/
H A Darray_map_batch_ops.c40 static void map_batch_verify(int *visited, __u32 max_entries, int *keys, in map_batch_verify() argument
46 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
62 visited[i] = 1; in map_batch_verify()
65 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
72 int map_fd, *keys, *visited; in __test_map_lookup_and_update_batch() local
94 visited = calloc(max_entries, sizeof(*visited)); in __test_map_lookup_and_update_batch()
95 CHECK(!keys || !values || !visited, "mallo in __test_map_lookup_and_update_batch()
[all...]
H A Dlpm_trie_map_batch_ops.c44 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument
51 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
58 visited[i] = 1; in map_batch_verify()
61 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
70 int map_fd, *values, *visited; in test_lpm_trie_map_batch_ops() local
88 visited = malloc(max_entries * sizeof(int)); in test_lpm_trie_map_batch_ops()
89 CHECK(!keys || !values || !visited, "malloc()", "error:%s\n", in test_lpm_trie_map_batch_ops()
95 map_batch_verify(visited, max_entrie in test_lpm_trie_map_batch_ops()
[all...]
H A Dhtab_map_batch_ops.c41 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument
51 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
68 visited[i] = 1; in map_batch_verify()
72 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
81 int map_fd, *keys, *visited, key; in __test_map_lookup_and_delete_batch() local
103 visited = malloc(max_entries * sizeof(int)); in __test_map_lookup_and_delete_batch()
104 CHECK(!keys || !values || !visited, "malloc()", in __test_map_lookup_and_delete_batch()
133 map_batch_verify(visited, max_entrie in __test_map_lookup_and_delete_batch()
[all...]
/third_party/rust/crates/regex/src/
H A Dbacktrack.rs6 // case linear time by keeping track of the states that it has visited (using a
7 // bitmap). Namely, once a state is visited, it is never visited again. Since a
57 visited: Vec<Bits>,
63 Cache { jobs: vec![], visited: vec![] } in new()
108 // of the states we've visited. in clear()
119 self.m.visited.truncate(visited_len); in clear()
120 for v in &mut self.m.visited { in clear()
123 if visited_len > self.m.visited.len() { in clear()
124 let len = self.m.visited in clear()
[all...]
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_helper_invocations.c105 struct set *visited = _mesa_set_create(NULL, in mir_analyze_helper_terminate() local
119 * only be added to the worklist if it is not on the visited list and in mir_analyze_helper_terminate()
120 * the visited list - also a subset of the blocks - grows every in mir_analyze_helper_terminate()
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, NUL in mir_analyze_helper_requirements()
[all...]
/third_party/node/deps/openssl/openssl/crypto/
H A Dprovider_conf.c84 STACK_OF(OPENSSL_CSTRING) *visited) in provider_conf_params_internal()
100 * been visited. If it has, then we have a recursive lookup in provider_conf_params_internal()
104 for (i = 0; i < sk_OPENSSL_CSTRING_num(visited); i++) { in provider_conf_params_internal()
105 if (sk_OPENSSL_CSTRING_value(visited, i) == value) { in provider_conf_params_internal()
112 * We've not visited this node yet, so record it on the stack in provider_conf_params_internal()
114 if (!sk_OPENSSL_CSTRING_push(visited, value)) in provider_conf_params_internal()
127 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
133 sectconf->value, cnf, visited); in provider_conf_params_internal()
135 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
139 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
80 provider_conf_params_internal(OSSL_PROVIDER *prov, OSSL_PROVIDER_INFO *provinfo, const char *name, const char *value, const CONF *cnf, STACK_OF(OPENSSL_CSTRING) *visited) provider_conf_params_internal() argument
[all...]
/third_party/openssl/crypto/
H A Dprovider_conf.c84 STACK_OF(OPENSSL_CSTRING) *visited) in provider_conf_params_internal()
100 * been visited. If it has, then we have a recursive lookup in provider_conf_params_internal()
104 for (i = 0; i < sk_OPENSSL_CSTRING_num(visited); i++) { in provider_conf_params_internal()
105 if (sk_OPENSSL_CSTRING_value(visited, i) == value) { in provider_conf_params_internal()
112 * We've not visited this node yet, so record it on the stack in provider_conf_params_internal()
114 if (!sk_OPENSSL_CSTRING_push(visited, value)) in provider_conf_params_internal()
127 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
133 sectconf->value, cnf, visited); in provider_conf_params_internal()
135 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
139 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
80 provider_conf_params_internal(OSSL_PROVIDER *prov, OSSL_PROVIDER_INFO *provinfo, const char *name, const char *value, const CONF *cnf, STACK_OF(OPENSSL_CSTRING) *visited) provider_conf_params_internal() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp223 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, in setSubgraphColorHelper() argument
236 unsigned oldSize = visited.size(); in setSubgraphColorHelper()
237 visited.insert(N); in setSubgraphColorHelper()
238 if (visited.size() != oldSize) { in setSubgraphColorHelper()
243 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; in setSubgraphColorHelper()
257 DenseSet<SDNode *> visited; in setSubgraphColor() local
259 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { in setSubgraphColor()
262 setSubgraphColorHelper(N, "blue", visited, 0, printed); in setSubgraphColor()
264 setSubgraphColorHelper(N, "green", visited, 0, printed); in setSubgraphColor()
/foundation/resourceschedule/ffrt/src/util/
H A Dgraph_check.cpp58 if (!vertexStatus[v].visited) { in IsCyclicDfs()
59 vertexStatus[v].visited = true; in IsCyclicDfs()
64 if (!vertexStatus[*i].visited && IsCyclicDfs(*i, vertexStatus)) { in IsCyclicDfs()
80 vertexStatus[t.first].visited = false; in IsCyclic()
85 if (!vertexStatus[t.first].visited && IsCyclicDfs(t.first, vertexStatus)) { in IsCyclic()
/kernel/linux/linux-5.10/sound/usb/
H A Dclock.c268 unsigned long *visited, bool validate) in __uac_clock_find_source()
276 if (test_and_set_bit(entity_id, visited)) { in __uac_clock_find_source()
320 visited, validate); in __uac_clock_find_source()
343 visited, true); in __uac_clock_find_source()
365 visited, validate); in __uac_clock_find_source()
372 unsigned long *visited, bool validate) in __uac3_clock_find_source()
380 if (test_and_set_bit(entity_id, visited)) { in __uac3_clock_find_source()
424 visited, validate); in __uac3_clock_find_source()
443 visited, true); in __uac3_clock_find_source()
466 visited, validat in __uac3_clock_find_source()
266 __uac_clock_find_source(struct snd_usb_audio *chip, struct audioformat *fmt, int entity_id, unsigned long *visited, bool validate) __uac_clock_find_source() argument
370 __uac3_clock_find_source(struct snd_usb_audio *chip, struct audioformat *fmt, int entity_id, unsigned long *visited, bool validate) __uac3_clock_find_source() argument
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-repacker.hh347 hb_set_t visited; in assign_32bit_spaces() local
356 find_subgraph (l.objidx, visited); in assign_32bit_spaces()
361 // Mark everything not in the subgraphs of 32 bit roots as visited. in assign_32bit_spaces()
363 visited.invert (); in assign_32bit_spaces()
373 find_connected_nodes (next, roots, visited, connected_roots); in assign_32bit_spaces()
725 hb_set_t visited; in wide_parents() local
728 if (visited.has (p)) continue; in wide_parents()
729 visited.add (p); in wide_parents()
800 // Redundant ones are filtered out later on by the visited set. in update_distances()
815 hb_vector_t<bool> visited; in update_distances() local
[all...]
/third_party/mesa3d/src/amd/compiler/
H A Daco_lower_phis.cpp49 std::vector<bool> visited; member
57 if (state->visited[block_idx]) in get_ssa()
62 state->visited[block_idx] = true; in get_ssa()
82 bool previously_visited = state->visited[block_idx]; in get_ssa()
87 state->visited[block_idx] = true; in get_ssa()
101 if (!previously_visited && state->visited[block_idx]) in get_ssa()
272 state->visited.resize(program->blocks.size()); in lower_divergent_bool_phi()
278 std::fill(state->visited.begin(), state->visited.end(), false); in lower_divergent_bool_phi()
288 state->visited[pre in lower_divergent_bool_phi()
[all...]
/third_party/mesa3d/src/panfrost/util/
H A Dpan_liveness.c119 struct set *visited = _mesa_set_create(NULL, in pan_compute_liveness() local
149 if (progress || !_mesa_set_search(visited, blk)) { in pan_compute_liveness()
154 _mesa_set_add(visited, blk); in pan_compute_liveness()
157 _mesa_set_destroy(visited, NULL); in pan_compute_liveness()
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_push_ubo.c190 bi_find_component(adjacency_row *adjacency, BITSET_WORD *visited, in bi_find_component() argument
195 BITSET_SET(visited, node); in bi_find_component()
199 if (!BITSET_TEST(visited, neighbour)) { in bi_find_component()
200 bi_find_component(adjacency, visited, component, size, in bi_find_component()
282 BITSET_DECLARE(visited, PAN_MAX_PUSH) = { 0 }; in bi_opt_reorder_push()
294 if (BITSET_TEST(visited, i)) continue; in bi_opt_reorder_push()
298 bi_find_component(adjacency, visited, component, &size, i); in bi_opt_reorder_push()
/kernel/linux/linux-6.6/sound/usb/
H A Dclock.c256 unsigned long *visited, bool validate) in __uac_clock_find_source()
267 if (test_and_set_bit(entity_id, visited)) { in __uac_clock_find_source()
325 visited, validate); in __uac_clock_find_source()
354 visited, true); in __uac_clock_find_source()
376 visited, validate); in __uac_clock_find_source()
388 * The 'visited' bitfield is used internally to detect recursive loops.
395 DECLARE_BITMAP(visited, 256); in snd_usb_clock_find_source()
396 memset(visited, 0, sizeof(visited)); in snd_usb_clock_find_source()
401 return __uac_clock_find_source(chip, fmt, fmt->clock, visited, in snd_usb_clock_find_source()
254 __uac_clock_find_source(struct snd_usb_audio *chip, const struct audioformat *fmt, int entity_id, unsigned long *visited, bool validate) __uac_clock_find_source() argument
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/
H A DCompilerRegressionTest.java183 Set<DfaNode> visited = new HashSet<>(); in buildTestNumbers()
184 ranges.accept(new Visitor(RangeSpecification.empty(), numbers, visited)); in buildTestNumbers()
198 private final Set<DfaNode> visited; field in CompilerRegressionTest.Visitor
203 Set<DfaNode> visited) { in Visitor()
206 this.visited = visited; in Visitor()
217 // Avoid recursing into nodes we've already visited. This avoids generating many (hundreds) in visit()
221 if (visited.contains(target)) { in visit()
224 visited.add(target); in visit()
227 Visitor childVisitor = new Visitor(path, numbers, visited); in visit()
201 Visitor(RangeSpecification sourcePath, SetMultimap<Result, DigitSequence> numbers, Set<DfaNode> visited) Visitor() argument
[all...]
/third_party/skia/tests/
H A DPDFPrimitivesTest.cpp257 static sk_sp<TestImageFilter> Make(bool visited = false) { in Make()
258 return sk_sp<TestImageFilter>(new TestImageFilter(visited)); in Make()
261 bool visited() const { return fVisited; } in visited() function in __anon19052::TestImageFilter
272 TestImageFilter(bool visited) : INHERITED(nullptr, 0, nullptr), fVisited(visited) {} in TestImageFilter() argument
281 bool visited = buffer.readBool(); in CreateProc() local
282 return TestImageFilter::Make(visited); in CreateProc()
298 REPORTER_ASSERT(reporter, !filter->visited()); in DEF_TEST()
304 // Filter was used in rendering; should be visited. in DEF_TEST()
305 REPORTER_ASSERT(reporter, filter->visited()); in DEF_TEST()
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dloop-peeling.cc272 ZoneVector<bool> visited(graph->NodeCount(), false, tmp_zone); in EliminateLoopExits()
281 if (!visited[control->id()]) { in EliminateLoopExits()
282 visited[control->id()] = true; in EliminateLoopExits()
288 if (!visited[control->id()]) { in EliminateLoopExits()
289 visited[control->id()] = true; in EliminateLoopExits()
/test/xts/acts/
H A Dget_dependency.py87 visited = set() # 存储已访问的节点
92 if node in visited:
96 visited.add(node)
104 return visited, string_buffer
/third_party/ltp/tools/sparse/sparse-src/
H A Dctags.c106 if (sym->ident && !sym->visited) { in add_tag()
107 sym->visited = 1; in add_tag()
126 if (!sym || sym->visited) in examine_symbol()
173 if (sym->visited) in examine_namespace()
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.h137 int visited; member in nv50_ir::Graph::Node
195 if (visited == v) in visit()
197 visited = v; in visit()
203 return visited; in getSequence()

Completed in 14 milliseconds

1234567