Home
last modified time | relevance | path

Searched refs:existing (Results 1 - 25 of 160) sorted by relevance

1234567

/foundation/arkui/ace_engine_lite/frameworks/tools/qt/simulator/jsfwk/targets/simulator/mock/amsthread/
H A Dams_thread.cpp268 JSAppRecord *existing = nullptr; in GetAppRecord() local
271 existing = record; in GetAppRecord()
276 return existing; in GetAppRecord()
282 JSAppRecord *existing = nullptr; in PopAppRecord() local
285 existing = record; in PopAppRecord()
289 if (existing != nullptr) { in PopAppRecord()
290 appRecords_.removeOne(existing); in PopAppRecord()
293 return existing; in PopAppRecord()
299 JSAppRecord *existing = nullptr; in DeleteAppRecord() local
302 existing in DeleteAppRecord()
324 JSAppRecord *existing = nullptr; GetAppRecordByInfo() local
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeException.java31 Column<T> column, T value, RangeTree existing, RangeTree ranges, OverwriteMode mode) { in checkDisjoint()
32 RangeTree intersection = existing.intersect(ranges); in checkDisjoint()
35 throw new RangeException(column, value, existing, ranges, intersection, mode); in checkDisjoint()
41 RangeTree existing, in RangeException()
45 super(explain(checkNotNull(column), value, existing, ranges, intersection, checkNotNull(mode))); in RangeException()
51 RangeTree existing, in explain()
58 + "existing ranges:\n%s" in explain()
60 value, column, mode, toLines(intersection), toLines(existing), toLines(ranges)); in explain()
30 checkDisjoint( Column<T> column, T value, RangeTree existing, RangeTree ranges, OverwriteMode mode) checkDisjoint() argument
39 RangeException(Column<?> column, @Nullable Object value, RangeTree existing, RangeTree ranges, RangeTree intersection, OverwriteMode mode) RangeException() argument
48 explain( Column<?> column, @Nullable Object value, RangeTree existing, RangeTree ranges, RangeTree intersection, OverwriteMode mode) explain() argument
/third_party/mesa3d/src/compiler/glsl/
H A Dglsl_symbol_table.cpp139 symbol_table_entry *existing = get_entry(v->name); in add_variable() local
141 /* If there's already an existing function (not a constructor!) in in add_variable()
142 * the current scope, just update the existing entry to include 'v'. in add_variable()
144 if (existing->v == NULL && existing->t == NULL) { in add_variable()
145 existing->v = v; in add_variable()
149 /* If not declared at this scope, add a new entry. But if an existing in add_variable()
154 if (existing != NULL) in add_variable()
155 entry->f = existing->f; in add_variable()
196 symbol_table_entry *existing in add_function() local
[all...]
H A Dlinker.cpp787 ir_variable *const existing, in validate_intrastage_arrays()
795 if (var->type->is_array() && existing->type->is_array()) { in validate_intrastage_arrays()
797 const glsl_type *no_array_existing = existing->type->fields.array; in validate_intrastage_arrays()
805 ((var->type->length == 0)|| (existing->type->length == 0))) { in validate_intrastage_arrays()
807 if ((int)var->type->length <= existing->data.max_array_access) { in validate_intrastage_arrays()
813 existing->data.max_array_access); in validate_intrastage_arrays()
815 existing->type = var->type; in validate_intrastage_arrays()
817 } else if (existing->type->length != 0) { in validate_intrastage_arrays()
818 if((int)existing->type->length <= var->data.max_array_access && in validate_intrastage_arrays()
819 !existing in validate_intrastage_arrays()
785 validate_intrastage_arrays(struct gl_shader_program *prog, ir_variable *const var, ir_variable *const existing, bool match_precision) validate_intrastage_arrays() argument
874 ir_variable *const existing = variables->get_variable(var->name); cross_validate_globals() local
1353 ir_variable *const existing = remap_variables() local
[all...]
/third_party/rust/crates/clap/src/util/
H A Dflat_map.rs20 for (index, existing) in self.keys.iter().enumerate() {
21 if *existing == key {
47 for existing in &self.keys { in contains_key()
48 if existing.borrow() == key { in contains_key()
83 for (index, existing) in self.keys.iter().enumerate() { in entry()
84 if *existing == key { in entry()
96 for (index, existing) in self.keys.iter().enumerate() { in get()
97 if existing.borrow() == k { in get()
109 for (index, existing) in self.keys.iter().enumerate() { in get_mut()
110 if existing in get_mut()
[all...]
H A Dflat_set.rs19 for existing in &self.inner {
20 if *existing == value {
33 for existing in &self.inner { in contains()
34 if existing.borrow() == value { in contains()
/third_party/skia/src/sksl/dsl/priv/
H A DDSLWriter.cpp98 void DSLWriter::AddVarDeclaration(DSLStatement& existing, DSLVar& additional) { in AddVarDeclaration() argument
99 if (existing.fStatement->is<Block>()) { in AddVarDeclaration()
100 SkSL::Block& block = existing.fStatement->as<Block>(); in AddVarDeclaration()
103 } else if (existing.fStatement->is<VarDeclaration>()) { in AddVarDeclaration()
106 stmts.push_back(std::move(existing.fStatement)); in AddVarDeclaration()
108 existing.fStatement = SkSL::Block::MakeUnscoped(/*line=*/-1, std::move(stmts)); in AddVarDeclaration()
109 } else if (existing.fStatement->isEmpty()) { in AddVarDeclaration()
111 existing.fStatement = Declare(additional).release(); in AddVarDeclaration()
/kernel/linux/linux-6.6/fs/btrfs/
H A Ddelayed-ref.c584 * Return true if the ref was merged into an existing one (and therefore can be
627 /* remove existing tail if its ref_mod is zero */ in insert_delayed_ref()
636 * existing and update must have the same bytenr
639 struct btrfs_delayed_ref_head *existing, in update_existing_head_ref()
647 BUG_ON(existing->is_data != update->is_data); in update_existing_head_ref()
649 spin_lock(&existing->lock); in update_existing_head_ref()
654 * with an existing head ref without in update_existing_head_ref()
658 existing->must_insert_reserved = update->must_insert_reserved; in update_existing_head_ref()
664 existing->num_bytes = update->num_bytes; in update_existing_head_ref()
669 if (!existing in update_existing_head_ref()
638 update_existing_head_ref(struct btrfs_trans_handle *trans, struct btrfs_delayed_ref_head *existing, struct btrfs_delayed_ref_head *update) update_existing_head_ref() argument
794 struct btrfs_delayed_ref_head *existing; add_delayed_ref_head() local
[all...]
/kernel/linux/linux-5.10/net/llc/
H A Dllc_if.c89 struct sock *existing; in llc_establish_connection() local
95 existing = llc_lookup_established(llc->sap, &daddr, &laddr); in llc_establish_connection()
96 if (existing) { in llc_establish_connection()
97 if (existing->sk_state == TCP_ESTABLISHED) { in llc_establish_connection()
98 sk = existing; in llc_establish_connection()
101 sock_put(existing); in llc_establish_connection()
/kernel/linux/linux-6.6/net/llc/
H A Dllc_if.c89 struct sock *existing; in llc_establish_connection() local
95 existing = llc_lookup_established(llc->sap, &daddr, &laddr, sock_net(sk)); in llc_establish_connection()
96 if (existing) { in llc_establish_connection()
97 if (existing->sk_state == TCP_ESTABLISHED) { in llc_establish_connection()
98 sk = existing; in llc_establish_connection()
101 sock_put(existing); in llc_establish_connection()
/kernel/linux/linux-5.10/fs/btrfs/
H A Ddelayed-ref.c632 /* remove existing tail if its ref_mod is zero */ in insert_delayed_ref()
647 * existing and update must have the same bytenr
650 struct btrfs_delayed_ref_head *existing, in update_existing_head_ref()
656 u64 flags = btrfs_ref_head_to_space_flags(existing); in update_existing_head_ref()
659 BUG_ON(existing->is_data != update->is_data); in update_existing_head_ref()
661 spin_lock(&existing->lock); in update_existing_head_ref()
666 * with an existing head ref without in update_existing_head_ref()
670 existing->must_insert_reserved = update->must_insert_reserved; in update_existing_head_ref()
676 existing->num_bytes = update->num_bytes; in update_existing_head_ref()
681 if (!existing in update_existing_head_ref()
649 update_existing_head_ref(struct btrfs_trans_handle *trans, struct btrfs_delayed_ref_head *existing, struct btrfs_delayed_ref_head *update) update_existing_head_ref() argument
822 struct btrfs_delayed_ref_head *existing; add_delayed_ref_head() local
[all...]
H A Dextent_map.c393 * existing mappings. The extent_map struct passed in will be inserted
535 * Helper for btrfs_get_extent. Given an existing extent in the tree,
536 * the existing extent is the nearest extent to map_start,
541 struct extent_map *existing, in merge_extent_mapping()
553 if (existing->start > map_start) { in merge_extent_mapping()
554 next = existing; in merge_extent_mapping()
557 prev = existing; in merge_extent_mapping()
589 * a) Returning the existing extent in @em_in if @start is within the
590 * existing em.
591 * b) Merge the existing exten
540 merge_extent_mapping(struct extent_map_tree *em_tree, struct extent_map *existing, struct extent_map *em, u64 map_start) merge_extent_mapping() argument
609 struct extent_map *existing; btrfs_add_extent_mapping() local
[all...]
/third_party/node/deps/npm/test/lib/commands/
H A Dshrinkwrap.js50 // Run shrinkwrap against all combinations of existing and config
54 const existing = JSON.stringify({ lockfileVersion: 2 })
62 existingDir = { 'package-lock.json': existing }
65 existingDir = { 'npm-shrinkwrap.json': existing }
68 existingDir = { node_modules: { '.package-lock.json': existing } }
83 await t.test('existing', async t => {
85 t.match(t.context, assertions.existing)
88 await t.test('existing upgrade', async t => {
93 await t.test('existing downgrade', async t => {
135 existing
[all...]
/third_party/musl/src/unistd/
H A Dlink.c5 int link(const char *existing, const char *new) in link() argument
8 return syscall(SYS_link, existing, new); in link()
10 return syscall(SYS_linkat, AT_FDCWD, existing, AT_FDCWD, new, 0); in link()
H A Dsymlink.c5 int symlink(const char *existing, const char *new) in symlink() argument
8 return syscall(SYS_symlink, existing, new); in symlink()
10 return syscall(SYS_symlinkat, existing, AT_FDCWD, new); in symlink()
H A Dlinkat.c4 int linkat(int fd1, const char *existing, int fd2, const char *new, int flag) in linkat() argument
6 return syscall(SYS_linkat, fd1, existing, fd2, new, flag); in linkat()
H A Dsymlinkat.c4 int symlinkat(const char *existing, int fd, const char *new) in symlinkat() argument
6 return syscall(SYS_symlinkat, existing, fd, new); in symlinkat()
/third_party/node/lib/internal/modules/esm/
H A Dfetch_module.js142 const existing = cacheForGET.get(parsed.href);
143 if (existing) {
144 return existing;
267 const existing = cacheForGET.get(href);
268 if (existing) {
269 return existing;
/third_party/python/Lib/logging/
H A Dconfig.py173 def _handle_existing_loggers(existing, child_loggers, disable_existing):
181 what was intended by the user. Also, allow existing loggers to NOT be
185 for log in existing:
219 #we don't want to lose the existing loggers,
221 #existing is set to contain all existing loggers,
224 #what's left in existing is the set of loggers
227 existing = list(root.manager.loggerDict.keys())
232 existing.sort()
233 #We'll keep the list of existing logger
[all...]
/third_party/mesa3d/src/gallium/drivers/crocus/
H A Dcrocus_program_cache.c116 * Look for an existing entry in the cache that has identical assembly code.
127 const struct crocus_compiled_shader *existing = entry->data; in find_existing_assembly() local
129 if (existing->map_size != assembly_size) in find_existing_assembly()
132 if (memcmp(map + existing->offset, assembly, assembly_size) == 0) in find_existing_assembly()
133 return existing; in find_existing_assembly()
199 const struct crocus_compiled_shader *existing = find_existing_assembly( in crocus_upload_shader() local
203 * existing stuff without creating new copy into the underlying buffer in crocus_upload_shader()
208 if (existing) { in crocus_upload_shader()
209 shader->offset = existing->offset; in crocus_upload_shader()
210 shader->map_size = existing in crocus_upload_shader()
[all...]
/third_party/mesa3d/src/panfrost/lib/genxml/
H A Ddecode_common.c136 struct pandecode_mapped_memory *existing = in pandecode_inject_mmap() local
139 if (existing && existing->gpu_va == gpu_va) { in pandecode_inject_mmap()
140 existing->length = sz; in pandecode_inject_mmap()
141 existing->addr = cpu; in pandecode_inject_mmap()
142 pandecode_add_name(existing, gpu_va, name); in pandecode_inject_mmap()
/foundation/multimedia/audio_framework/services/audio_policy/server/src/service/config/
H A Daudio_concurrency_parser.cpp55 void AudioConcurrencyParser::ParseIncoming(const std::string &existing, xmlNode *node, in ParseIncoming() argument
68 AUDIO_DEBUG_LOG("existing: %{public}s %{public}d, incoming: %{public}s %{public}d, action: %{public}s", in ParseIncoming()
69 existing.c_str(), audioPipeTypeMap_[existing], incoming.c_str(), in ParseIncoming()
72 std::make_pair(audioPipeTypeMap_[existing], audioPipeTypeMap_[incoming]); in ParseIncoming()
74 (action == "concede existing" ? CONCEDE_EXISTING : CONCEDE_INCOMING); in ParseIncoming()
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DSizedMRUCache.h34 // Check for existing key. in put()
80 // Check for existing key. in eraseByKey()
81 auto existing = mStore.Peek(key); in eraseByKey() local
82 if (existing != mStore.end()) in eraseByKey()
84 mCurrentSize -= existing->second.size; in eraseByKey()
85 mStore.Erase(existing); in eraseByKey()
/third_party/protobuf/python/
H A Drelease.sh88 twine upload --skip-existing -r testpypi -u protobuf-wheel-test dist/*
96 twine upload --skip-existing -r testpypi -u protobuf-wheel-test dist/*
113 twine upload --skip-existing -u protobuf-packages dist/*
120 twine upload --skip-existing -u protobuf-packages dist/*
/kernel/linux/linux-6.6/include/kunit/
H A Dresource.h198 struct kunit_resource *existing; in kunit_add_named_resource() local
203 existing = kunit_find_named_resource(test, name); in kunit_add_named_resource()
204 if (existing) { in kunit_add_named_resource()
205 kunit_put_resource(existing); in kunit_add_named_resource()

Completed in 14 milliseconds

1234567