Home
last modified time | relevance | path

Searched refs:seen (Results 1 - 25 of 230) sorted by relevance

12345678910

/third_party/node/test/parallel/
H A Dtest-promise-hook-on-resolve.js14 let seen;
17 seen = promise;
22 assert.strictEqual(seen, undefined);
25 assert.strictEqual(seen, promise);
26 seen = undefined;
35 assert.strictEqual(seen, undefined);
38 assert.strictEqual(seen, promise);
39 seen = undefined;
50 assert.strictEqual(seen, resolved);
51 seen
[all...]
H A Dtest-stream3-pause-then-read.js84 let seen = 0;
86 seen += c.length;
87 if (seen >= 100) {
91 if (seen > 100) {
92 // Oh no, seen too much!
94 const diff = seen - 100;
96 console.error('seen too much', seen, diff);
H A Dtest-stream-unshift-empty-chunk.js41 const seen = [];
45 seen.push(chunk.toString());
78 assert.deepStrictEqual(seen, expect);
/third_party/spirv-tools/source/opt/
H A Dtypes.cpp189 size_t Type::ComputeHashValue(size_t hash, SeenTypes* seen) const { in ComputeHashValue()
194 if (std::find(seen->begin(), seen->end(), this) != seen->end()) { in ComputeHashValue()
198 seen->push_back(this); in ComputeHashValue()
208 hash = As##type()->ComputeExtraStateHash(hash, seen); \ in ComputeHashValue()
244 seen->pop_back(); in ComputeHashValue()
249 SeenTypes seen; in HashValue() local
250 return ComputeHashValue(0, &seen); in HashValue()
318 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) cons
[all...]
H A Dfix_storage_class.cpp30 std::set<uint32_t> seen; in Process()
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass()
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
52 PropagateStorageClass(Instruction* inst, spv::StorageClass storage_class, std::set<uint32_t>* seen) PropagateStorageClass() argument
112 FixInstructionStorageClass( Instruction* inst, spv::StorageClass storage_class, std::set<uint32_t>* seen) FixInstructionStorageClass() argument
174 PropagateType(Instruction* inst, uint32_t type_id, uint32_t op_idx, std::set<uint32_t>* seen) PropagateType() argument
[all...]
H A Dtypes.h125 IsSameCache seen; in IsSame() local
126 return IsSameImpl(that, &seen); in IsSame()
130 // decorations. |seen| is the set of |Pointer*| pair that are currently being
132 virtual bool IsSameImpl(const Type* that, IsSameCache* seen) const = 0;
169 size_t ComputeHashValue(size_t hash, SeenTypes* seen) const;
213 virtual size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const = 0;
243 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
263 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
283 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
304 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) cons
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dtypes.cpp186 std::unordered_set<const Type*>* seen) const { in GetHashWords()
187 if (!seen->insert(this).second) { in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
235 seen->erase(this); in GetHashWords()
288 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
292 element_type_->IsSameImpl(vt->element_type_, seen) && in IsSameImpl()
303 std::unordered_set<const Type*>* seen) const { in GetExtraHashWords()
304 element_type_->GetHashWords(words, seen); in GetExtraHashWords()
313 bool Matrix::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
317 element_type_->IsSameImpl(mt->element_type_, seen) in IsSameImpl()
[all...]
H A Dfix_storage_class.cpp30 std::set<uint32_t> seen; in Process()
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass()
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
52 PropagateStorageClass(Instruction* inst, SpvStorageClass storage_class, std::set<uint32_t>* seen) PropagateStorageClass() argument
112 FixInstructionStorageClass(Instruction* inst, SpvStorageClass storage_class, std::set<uint32_t>* seen) FixInstructionStorageClass() argument
174 PropagateType(Instruction* inst, uint32_t type_id, uint32_t op_idx, std::set<uint32_t>* seen) PropagateType() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dtypes.cpp186 std::unordered_set<const Type*>* seen) const { in GetHashWords()
187 if (!seen->insert(this).second) { in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
235 seen->erase(this); in GetHashWords()
288 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
292 element_type_->IsSameImpl(vt->element_type_, seen) && in IsSameImpl()
303 std::unordered_set<const Type*>* seen) const { in GetExtraHashWords()
304 element_type_->GetHashWords(words, seen); in GetExtraHashWords()
313 bool Matrix::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
317 element_type_->IsSameImpl(mt->element_type_, seen) in IsSameImpl()
[all...]
H A Dfix_storage_class.cpp30 std::set<uint32_t> seen; in Process()
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass()
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
52 PropagateStorageClass(Instruction* inst, SpvStorageClass storage_class, std::set<uint32_t>* seen) PropagateStorageClass() argument
112 FixInstructionStorageClass(Instruction* inst, SpvStorageClass storage_class, std::set<uint32_t>* seen) FixInstructionStorageClass() argument
174 PropagateType(Instruction* inst, uint32_t type_id, uint32_t op_idx, std::set<uint32_t>* seen) PropagateType() argument
[all...]
/third_party/curl/tests/libtest/
H A Dlib509.c39 static int seen; variable
43 seen++; in custom_calloc()
49 seen++; in custom_malloc()
55 seen++; in custom_strdup()
61 seen++; in custom_realloc()
67 seen++; in custom_free()
105 if(seen) in test()
/third_party/jsframework/runtime/main/reactivity/
H A Dwatcher.js187 * @param {Set} seen
191 function traverse (val, seen) {
193 if (!seen) {
194 seen = seenObjects;
195 seen.clear();
202 if (seen.has(depId)) {
205 seen.add(depId);
210 while (i--) traverse(val[i], seen);
214 while (i--) traverse(val[keys[i]], seen);
/third_party/mesa3d/src/compiler/spirv/
H A Dspirv_info_c.py39 seen = set()
42 if x["value"] not in seen:
43 seen.add(x["value"])
49 seen = set()
54 if x["opcode"] in seen:
60 seen.add(opcode)
/third_party/mesa3d/src/util/
H A Ddag.c130 struct set *seen; member
140 if (_mesa_set_search(state->seen, node)) in dag_traverse_bottom_up_node()
157 if (!_mesa_set_search(state->seen, edge->child)) { in dag_traverse_bottom_up_node()
174 _mesa_set_add(state->seen, node); in dag_traverse_bottom_up_node()
183 } while (_mesa_set_search(state->seen, node)); in dag_traverse_bottom_up_node()
190 * Walks the DAG from leaves to the root, ensuring that each node is only seen
198 .seen = _mesa_pointer_set_create(NULL), in dag_traverse_bottom_up()
206 ralloc_free(state.seen); in dag_traverse_bottom_up()
/third_party/selinux/libsepol/src/
H A Dmodule.c460 /* Flags for which sections have been seen during parsing of module package. */
474 unsigned i, seen = 0; in sepol_module_package_read() local
508 if (seen & SEEN_FC) { in sepol_module_package_read()
532 seen |= SEEN_FC; in sepol_module_package_read()
535 if (seen & SEEN_SEUSER) { in sepol_module_package_read()
555 seen |= SEEN_SEUSER; in sepol_module_package_read()
558 if (seen & SEEN_USER_EXTRA) { in sepol_module_package_read()
580 seen |= SEEN_USER_EXTRA; in sepol_module_package_read()
583 if (seen & SEEN_NETFILTER) { in sepol_module_package_read()
607 seen | in sepol_module_package_read()
659 unsigned i, seen = 0; sepol_module_package_info() local
[all...]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dextdependency.py60 # All nodes seen during traversal.
61 seen = set()
67 seen.add(node)
69 if x not in seen:
70 seen.add(x)
75 assert x in seen
79 if y not in seen:
80 seen.add(y)
/third_party/python/Lib/importlib/metadata/
H A D_itertools.py5 "List unique elements, preserving order. Remember all elements ever seen."
8 seen = set()
9 seen_add = seen.add
11 for element in filterfalse(seen.__contains__, iterable):
17 if k not in seen:
/third_party/python/Lib/importlib/resources/
H A D_itertools.py21 "List unique elements, preserving order. Remember all elements ever seen."
24 seen: Set[Union[_T, _U]] = set()
25 seen_add = seen.add
27 for element in filterfalse(seen.__contains__, iterable):
33 if k not in seen:
/third_party/node/deps/npm/node_modules/bin-links/lib/
H A Dlink-gently.js24 const seen = new Set()
30 if (seen.has(to)) {
33 seen.add(to)
85 for (const p of seen) {
86 seen.delete(p)
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc51 std::unordered_set<int> *seen) { in IsReachable()
52 seen->insert(from); // we are investigating "from"; don't do it again in IsReachable()
58 } else if (seen->find(edge.to) == seen->end() && // success via edge in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
93 std::unordered_set<int> seen; in PrintTransitiveClosure() local
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
117 std::unordered_set<int> seen; in CheckTransitiveClosure() local
120 seen.clear(); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
50 IsReachable(Edges *edges, int from, int to, std::unordered_set<int> *seen) IsReachable() argument
259 std::unordered_set<int> seen; TEST() local
287 std::unordered_set<int> seen; TEST() local
[all...]
/third_party/node/lib/internal/test_runner/reporter/
H A Dtap.js127 function jsToYaml(indent, name, value, seen) {
154 seen.add(value);
171 if (seen.has(value)) {
176 result += jsToYaml(propsIndent, key, value, seen);
217 result += jsToYaml(indent, 'error', errMsg, seen);
220 result += jsToYaml(indent, 'code', errCode, seen);
223 result += jsToYaml(indent, 'name', errName, seen);
227 result += jsToYaml(indent, 'expected', errExpected, seen);
228 result += jsToYaml(indent, 'actual', errActual, seen);
230 result += jsToYaml(indent, 'operator', errOperator, seen);
[all...]
/third_party/mesa3d/src/asahi/compiler/
H A Dagx_dce.c35 BITSET_WORD *seen = calloc(BITSET_WORDS(ctx->alloc), sizeof(BITSET_WORD)); in agx_dce() local
40 BITSET_SET(seen, I->src[s].value); in agx_dce()
51 needed |= BITSET_TEST(seen, I->dest[d].value); in agx_dce()
62 free(seen); in agx_dce()
/third_party/python/Lib/test/
H A Daudit-tests.py23 self.seen = []
38 return [i[0] for i in self.seen]
43 self.seen.append((event, args))
85 assertEqual(hook.seen[0][0], "test_event")
86 assertEqual(hook.seen[0][1], (1, 2, 3))
126 actual = [(a[0], a[1]) for e, a in hook.seen if e == "marshal.dumps"]
129 actual = [a[0] for e, a in hook.seen if e == "marshal.loads"]
132 actual = [e for e, a in hook.seen if e == "marshal.load"]
183 actual = [(a[0], a[1]) for e, a in hook.seen if e == "object.__setattr__"]
213 actual_mode = [(a[0], a[1]) for e, a in hook.seen i
[all...]
/third_party/gn/src/gn/
H A Dconfig_values_extractors.h91 std::set<T> seen; in RecursiveTargetConfigToStream() local
101 if (seen.find(values[i]) == seen.end()) { in RecursiveTargetConfigToStream()
102 seen.insert(values[i]); in RecursiveTargetConfigToStream()
/third_party/node/deps/v8/tools/
H A Dupdate-object-macros-undef.py37 seen = set()
42 if match and match.group(1) not in seen:
43 seen.add(match.group(1))

Completed in 11 milliseconds

12345678910