Home
last modified time | relevance | path

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

12345

/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...]
/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/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/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/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()
/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/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()
/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/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...]
H A DIncrTopoSortTest.cpp19 bool visited() const { return fVisited; } in visited() function in Node
66 void setVisited(bool visited) { fVisited = visited; } in setVisited() argument
158 if (!dependent->visited()) { in addEdges()
218 // All the nodes in the Queue had better have been marked as visited in validate()
220 SkASSERT(fStack[i].fNode->visited()); in validate()
234 if (!dependent->visited() && dependent->indexInSort() < upperBound) { in dfs()
272 if (node->visited()) { in shift()
/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()
H A Dcontrol-equivalence.cc105 if (GetData(input)->visited) continue; in RunUndirectedDFS()
135 if (GetData(use)->visited) continue; in RunUndirectedDFS()
191 DCHECK(!GetData(node)->visited); in DFSPush()
202 GetData(node)->visited = true; in DFSPop()
/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()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dcfa.h45 /// @param[in] work_list Set of blocks visited in the the depth first
263 // The set of nodes which have been visited from any of the roots so far. in TraversalRoots()
264 std::unordered_set<const BB*> visited; in TraversalRoots() local
266 auto mark_visited = [&visited](const BB* b) { visited.insert(b); }; in TraversalRoots()
281 assert(visited.count(block) == 0 && "Malformed graph!"); in TraversalRoots()
289 if (visited.count(block) == 0) { in TraversalRoots()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dcfa.h45 /// @param[in] work_list Set of blocks visited in the the depth first
263 // The set of nodes which have been visited from any of the roots so far. in TraversalRoots()
264 std::unordered_set<const BB*> visited; in TraversalRoots() local
266 auto mark_visited = [&visited](const BB* b) { visited.insert(b); }; in TraversalRoots()
281 assert(visited.count(block) == 0 && "Malformed graph!"); in TraversalRoots()
289 if (visited.count(block) == 0) { in TraversalRoots()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc282 bool visited; // Temporary marker used by depth-first-search member
389 if (nx->visited) { in CheckInvariants()
390 ABSL_RAW_LOG(FATAL, "Did not clear visited marker on node %u", x); in CheckInvariants()
415 n->visited = false; in GetId()
520 // Since we do not call Reorder() on this path, clear any visited in InsertEdge()
523 r->nodes_[d]->visited = false; in InsertEdge()
542 if (nn->visited) continue; in ForwardDFS()
544 nn->visited = true; in ForwardDFS()
552 if (!nw->visited && nw->rank < upper_bound) { in ForwardDFS()
568 if (nn->visited) continu in BackwardDFS()
[all...]
/third_party/node/tools/gyp/pylib/gyp/generator/
H A Danalyzer.py89 # been visited to determine a more specific status yet.
224 visited: used during iteration to indicate whether we've visited this target.
245 self.visited = False
373 elif target.visited:
376 target.visited = True
487 if target.visited:
490 target.visited = True
724 # Reset the visited status for _GetBuildTargets.
726 target.visited
[all...]
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/generator/
H A Danalyzer.py89 # been visited to determine a more specific status yet.
224 visited: used during iteration to indicate whether we've visited this target.
245 self.visited = False
373 elif target.visited:
376 target.visited = True
487 if target.visited:
490 target.visited = True
722 # Reset the visited status for _GetBuildTargets.
724 target.visited
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dregalloc.c38 bool visited; member
250 assert(info->visited); in push_stack()
256 if (!ctx->registers[*conflict].visited && can_simplify(ctx, *conflict)) { in push_stack()
258 ctx->registers[*conflict].visited = true; in push_stack()
273 ctx->registers[i].visited = true; in do_regalloc()
293 if (info->visited) in do_regalloc()
301 ctx->registers[best_reg].visited = true; in do_regalloc()
/third_party/musl/scripts/
H A Dprint_so_deps.py38 self.visited = []
156 if cur in self.visited:
168 self.visited.append(cur)
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h166 SmallPtrSet<BlockT *, 32> visited; in calculate() local
182 if (visited.insert(currentBB).second) { in calculate()
200 if (visited.count(childBB) == 0) { in calculate()
207 // If all children are visited or there is any child then pop this block in calculate()

Completed in 17 milliseconds

12345