Home
last modified time | relevance | path

Searched refs:entry (Results 426 - 450 of 2173) sorted by relevance

1...<<11121314151617181920>>...87

/third_party/rust/crates/bindgen/bindgen/ir/analysis/
H A Dhas_vtable.rs102 match self.have_vtable.entry(id) { in insert()
103 Entry::Occupied(mut entry) => { in insert()
104 if *entry.get() < result { in insert()
105 entry.insert(result); in insert()
111 Entry::Vacant(entry) => { in insert()
112 entry.insert(result); in insert()
217 // We let the lack of an entry mean "No" to save space. in from()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dext_inst.cpp176 const auto& entry = group.entries[index]; in spvExtInstTableNameLookup() local
177 if (!strcmp(name, entry.name)) { in spvExtInstTableNameLookup()
178 *pEntry = &entry; in spvExtInstTableNameLookup()
198 const auto& entry = group.entries[index]; in spvExtInstTableValueLookup() local
199 if (value == entry.ext_inst) { in spvExtInstTableValueLookup()
200 *pEntry = &entry; in spvExtInstTableValueLookup()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dext_inst.cpp176 const auto& entry = group.entries[index]; in spvExtInstTableNameLookup() local
177 if (!strcmp(name, entry.name)) { in spvExtInstTableNameLookup()
178 *pEntry = &entry; in spvExtInstTableNameLookup()
198 const auto& entry = group.entries[index]; in spvExtInstTableValueLookup() local
199 if (value == entry.ext_inst) { in spvExtInstTableValueLookup()
200 *pEntry = &entry; in spvExtInstTableValueLookup()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DRegistry.h24 /// A simple registry entry which provides only a name, description, and
47 typedef SimpleRegistryEntry<T> entry; typedef in llvm::Registry
66 const entry& Val;
69 node(const entry &V) : Next(nullptr), Val(V) {} in node()
85 const entry> {
93 const entry &operator*() const { return Cur->Val; } in operator *()
115 entry Entry;
/third_party/spirv-tools/source/
H A Dext_inst.cpp178 const auto& entry = group.entries[index]; in spvExtInstTableNameLookup() local
179 if (!strcmp(name, entry.name)) { in spvExtInstTableNameLookup()
180 *pEntry = &entry; in spvExtInstTableNameLookup()
200 const auto& entry = group.entries[index]; in spvExtInstTableValueLookup() local
201 if (value == entry.ext_inst) { in spvExtInstTableValueLookup()
202 *pEntry = &entry; in spvExtInstTableValueLookup()
/third_party/skia/third_party/externals/expat/expat/tests/
H A Dstructdata.c77 StructDataEntry *entry; in StructData_AddItem() local
91 entry = &storage->entries[storage->count]; in StructData_AddItem()
92 entry->str = xmlstrdup(s); in StructData_AddItem()
93 entry->data0 = data0; in StructData_AddItem()
94 entry->data1 = data1; in StructData_AddItem()
95 entry->data2 = data2; in StructData_AddItem()
/third_party/pulseaudio/src/pulsecore/
H A Ddynarray.c92 void *entry; in pa_dynarray_remove_by_index() local
99 entry = array->data[i]; in pa_dynarray_remove_by_index()
104 array->free_cb(entry); in pa_dynarray_remove_by_index()
145 void *entry; in pa_dynarray_insert_by_index() local
156 entry = pa_dynarray_last(array); in pa_dynarray_insert_by_index()
157 pa_dynarray_append(array, entry); in pa_dynarray_insert_by_index()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/rsn_supp/
H A Dpmksa_cache.h13 * struct rsn_pmksa_cache_entry - PMKSA cache entry
26 * cache entry is applicable to all BSSs (any BSSID/aa[]) that
40 * This can be a pointer to the configuration entry, but PMKSA caching
60 pmksa_cache_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry,
62 bool (*is_current_cb)(struct rsn_pmksa_cache_entry *entry,
79 struct rsn_pmksa_cache_entry *entry);
96 pmksa_cache_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry, in pmksa_cache_init() argument
98 bool (*is_current_cb)(struct rsn_pmksa_cache_entry *entry, in pmksa_cache_init()
136 struct rsn_pmksa_cache_entry *entry) in pmksa_cache_add_entry()
135 pmksa_cache_add_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) pmksa_cache_add_entry() argument
/third_party/ffmpeg/libavformat/
H A Dlibssh.c339 AVIODirEntry *entry; in libssh_read_dir() local
341 *next = entry = ff_alloc_dir_entry(); in libssh_read_dir()
342 if (!entry) in libssh_read_dir()
357 entry->name = av_strdup(attr->name); in libssh_read_dir()
358 entry->group_id = attr->gid; in libssh_read_dir()
359 entry->user_id = attr->uid; in libssh_read_dir()
360 entry->size = attr->size; in libssh_read_dir()
361 entry->access_timestamp = INT64_C(1000000) * attr->atime; in libssh_read_dir()
362 entry->modification_timestamp = INT64_C(1000000) * attr->mtime; in libssh_read_dir()
363 entry in libssh_read_dir()
[all...]
/third_party/libunwind/libunwind/src/arm/
H A DGex_tables.c284 * Reads the entry from the given cursor and extracts the unwind instructions
293 unw_word_t entry = (unw_word_t) c->pi.unwind_info; in arm_exidx_extract() local
297 /* An ARM unwind entry consists of a prel31 offset to the start of a in arm_exidx_extract()
300 * if bit 31 is one: this is a table entry itself (ARM_EXIDX_COMPACT) in arm_exidx_extract()
302 table entry for this function */ in arm_exidx_extract()
303 if (prel31_to_addr(c->as, c->as_arg, entry, &addr) < 0) in arm_exidx_extract()
306 if ((*c->as->acc.access_mem)(c->as, entry + 4, &data, 0, c->as_arg) < 0) in arm_exidx_extract()
327 if (prel31_to_addr(c->as, c->as_arg, entry + 4, &extbl_data) < 0) in arm_exidx_extract()
392 appropriate unwind entry. */ in arm_search_unwind_table()
395 unw_word_t entry, va in arm_search_unwind_table() local
[all...]
/third_party/node/test/common/
H A Dsnapshot.js9 function buildSnapshot(entry, env) {
14 entry,
38 function runWithSnapshot(entry, env) {
40 if (entry !== undefined) {
41 args.push(entry);
/third_party/skia/src/sksl/
H A DSkSLLexer.cpp466 const CompactEntry& entry = kCompact[index.pos]; in get_transition() local
467 int value = entry.data[transition >> 2]; in get_transition()
470 State table[] = {0, entry.v0, entry.v1, entry.v2}; in get_transition()
/third_party/skia/third_party/externals/dawn/src/dawn_native/
H A DBindingInfo.cpp47 void IncrementBindingCounts(BindingCounts* bindingCounts, const BindGroupLayoutEntry& entry) { in IncrementBindingCounts() argument
52 if (entry.buffer.type != wgpu::BufferBindingType::Undefined) { in IncrementBindingCounts()
54 const BufferBindingLayout& buffer = entry.buffer; in IncrementBindingCounts()
82 } else if (entry.sampler.type != wgpu::SamplerBindingType::Undefined) { in IncrementBindingCounts()
84 } else if (entry.texture.sampleType != wgpu::TextureSampleType::Undefined) { in IncrementBindingCounts()
86 } else if (entry.storageTexture.access != wgpu::StorageTextureAccess::Undefined) { in IncrementBindingCounts()
90 FindInChain(entry.nextInChain, &externalTextureBindingLayout); in IncrementBindingCounts()
97 for (SingleShaderStage stage : IterateStages(entry.visibility)) { in IncrementBindingCounts()
/third_party/gn/src/gn/
H A Dcommand_help.cc298 for (const auto& entry : command_map) in RunHelp()
299 all_help_topics.push_back(entry.first); in RunHelp()
306 for (const auto& entry : function_map) in RunHelp()
307 all_help_topics.push_back(entry.first); in RunHelp()
315 for (const auto& entry : builtin_vars) in RunHelp()
316 all_help_topics.push_back(entry.first); in RunHelp()
324 for (const auto& entry : target_vars) in RunHelp()
325 all_help_topics.push_back(entry.first); in RunHelp()
360 for (const auto& entry : random_topics) in RunHelp()
361 all_help_topics.push_back(entry in RunHelp()
[all...]
/third_party/node/deps/v8/third_party/zlib/google/
H A Dzip.cc206 while (const ZipReader::Entry* const entry = reader.Next()) { in Unzip()
207 if (entry->is_unsafe) { in Unzip()
208 LOG(ERROR) << "Found unsafe entry " << Redact(entry->path) << " in ZIP"; in Unzip()
214 if (options.filter && !options.filter.Run(entry->path)) { in Unzip()
215 VLOG(1) << "Skipped ZIP entry " << Redact(entry->path); in Unzip()
219 if (entry->is_directory) { in Unzip()
221 if (!directory_creator.Run(entry->path)) { in Unzip()
222 LOG(ERROR) << "Cannot create directory " << Redact(entry in Unzip()
[all...]
/third_party/node/deps/zlib/google/
H A Dzip.cc206 while (const ZipReader::Entry* const entry = reader.Next()) { in Unzip()
207 if (entry->is_unsafe) { in Unzip()
208 LOG(ERROR) << "Found unsafe entry " << Redact(entry->path) << " in ZIP"; in Unzip()
214 if (options.filter && !options.filter.Run(entry->path)) { in Unzip()
215 VLOG(1) << "Skipped ZIP entry " << Redact(entry->path); in Unzip()
219 if (entry->is_directory) { in Unzip()
221 if (!directory_creator.Run(entry->path)) { in Unzip()
222 LOG(ERROR) << "Cannot create directory " << Redact(entry in Unzip()
[all...]
/third_party/node/deps/v8/src/objects/
H A Dosr-optimized-code-cache.cc41 int entry = -1; in Insert() local
45 entry = index; in Insert()
50 if (entry == -1) { in Insert()
52 entry = GrowOSRCache(isolate, native_context, &osr_cache); in Insert()
55 // entry. in Insert()
58 // for now choosing to replace the first entry. in Insert()
60 entry = 0; in Insert()
64 osr_cache->InitializeEntry(entry, *shared, *code, osr_offset); in Insert()
251 void OSROptimizedCodeCache::InitializeEntry(int entry, in InitializeEntry() argument
255 Set(entry in InitializeEntry()
[all...]
H A Dliteral-objects.cc51 InternalIndex entry = descriptor_array_template->Search( in AddToDescriptorArrayTemplate() local
55 if (entry.is_not_found()) { in AddToDescriptorArrayTemplate()
71 int sorted_index = descriptor_array_template->GetDetails(entry).pointer(); in AddToDescriptorArrayTemplate()
75 descriptor_array_template->Set(entry, &d); in AddToDescriptorArrayTemplate()
79 Object raw_accessor = descriptor_array_template->GetStrongValue(entry); in AddToDescriptorArrayTemplate()
87 descriptor_array_template->Set(entry, &d); in AddToDescriptorArrayTemplate()
159 InternalIndex entry = dictionary->FindEntry(isolate, key); in AddToDictionaryTemplate() local
167 if (entry.is_not_found()) { in AddToDictionaryTemplate()
188 isolate, dictionary, key, value_handle, details, &entry); in AddToDictionaryTemplate()
201 : dictionary->DetailsAt(entry) in AddToDictionaryTemplate()
[all...]
/third_party/mesa3d/src/gallium/drivers/crocus/
H A Dcrocus_program_cache.c90 struct hash_entry *entry = in crocus_find_cached_shader() local
95 return entry ? entry->data : NULL; in crocus_find_cached_shader()
103 hash_table_foreach(ice->shaders.cache, entry) { in crocus_find_previous_compile()
104 const struct keybox *keybox = entry->key; in crocus_find_previous_compile()
116 * Look for an existing entry in the cache that has identical assembly code.
126 hash_table_foreach (cache, entry) { in find_existing_assembly()
127 const struct crocus_compiled_shader *existing = entry->data; in find_existing_assembly()
339 hash_table_foreach(ice->shaders.cache, entry) { in crocus_print_program_cache()
340 const struct keybox *keybox = entry in crocus_print_program_cache()
[all...]
/third_party/skia/third_party/externals/brotli/research/
H A Dfind_opt_references.cc92 int left_lcp, entry_type* entry) { in GoLeft()
93 entry->first = left_lcp; in GoLeft()
98 entry->second.push_back(idx - sarray[left_ix]); in GoLeft()
104 int right_ix, int right_lcp, entry_type* entry) { in GoRight()
105 entry->first = right_lcp; in GoRight()
110 entry->second.push_back(idx - sarray[right_ix]); in GoRight()
169 entry_type& entry = entries[idx]; in ProcessEntries() local
170 if (entry.first > long_length) { in ProcessEntries()
173 segments.push_back({idx, idx + entry.first}); in ProcessEntries()
175 segments.back().second = idx + entry in ProcessEntries()
91 GoLeft(sarray_type* sarray, lcp_type* lcp, int idx, int left_ix, int left_lcp, entry_type* entry) GoLeft() argument
103 GoRight(sarray_type* sarray, lcp_type* lcp, int idx, size_t size, int right_ix, int right_lcp, entry_type* entry) GoRight() argument
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DMessageLiteToString.java172 Map.Entry<GeneratedMessageLite.ExtensionDescriptor, Object> entry = iter.next(); in reflectivePrintWithIndent()
173 printField(buffer, indent, "[" + entry.getKey().getNumber() + "]", entry.getValue()); in reflectivePrintWithIndent()
224 for (Object entry : list) { in printField()
225 printField(buffer, indent, name, entry); in printField()
231 for (Map.Entry<?, ?> entry : map.entrySet()) { in printField()
232 printField(buffer, indent, name, entry); in printField()
257 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object; in printField()
258 printField(buffer, indent + 2, "key", entry.getKey()); in printField()
259 printField(buffer, indent + 2, "value", entry in printField()
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-aat-layout-kerx-table.hh173 static bool performAction (const Entry<EntryData> &entry) in performAction()
174 { return entry.data.kernActionIndex != 0xFFFF; } in performAction()
176 static unsigned int kernActionIndex (const Entry<EntryData> &entry) in kernActionIndex()
177 { return entry.data.kernActionIndex; } in kernActionIndex()
195 static bool performAction (const Entry<EntryData> &entry) in performAction()
196 { return entry.flags & Offset; } in performAction()
198 static unsigned int kernActionIndex (const Entry<EntryData> &entry) in kernActionIndex()
199 { return entry.flags & Offset; } in kernActionIndex()
231 const Entry<EntryData> &entry) in is_actionable()
232 { return Format1EntryT::performAction (entry); } in is_actionable()
[all...]
/third_party/eudev/src/libudev/
H A Dlibudev-enumerate.c171 struct syspath *entry; in syspath_add() local
191 entry = &udev_enumerate->devices[udev_enumerate->devices_cur]; in syspath_add()
192 entry->syspath = path; in syspath_add()
193 entry->len = strlen(path); in syspath_add()
264 * Get the first entry of the sorted list of device paths.
284 struct syspath *entry = &udev_enumerate->devices[i]; in udev_enumerate_get_list_entry() local
288 entry->len == prev->len && in udev_enumerate_get_list_entry()
289 memcmp(entry->syspath, prev->syspath, entry->len) == 0) in udev_enumerate_get_list_entry()
291 prev = entry; in udev_enumerate_get_list_entry()
330 struct syspath *entry = &udev_enumerate->devices[i]; udev_enumerate_get_list_entry() local
[all...]
/third_party/python/Lib/idlelib/
H A Dtree.py268 self.entry
299 self.entry = Entry(self.label, bd=0, highlightthickness=1, width=0)
300 self.entry.insert(0, self.label['text'])
301 self.entry.selection_range(0, END)
302 self.entry.pack(ipadx=5)
303 self.entry.focus_set()
304 self.entry.bind("<Return>", self.edit_finish)
305 self.entry.bind("<Escape>", self.edit_cancel)
309 entry = self.entry
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dgl_nir_link_uniforms.c135 struct hash_entry *entry = in update_array_sizes() local
137 if (entry) { in update_array_sizes()
138 ainfo = (struct uniform_array_info *) entry->data; in update_array_sizes()
150 * match the new array size. The number of slots per array entry in update_array_sizes()
166 struct hash_entry *entry = in update_array_sizes() local
168 if (entry) { in update_array_sizes()
170 (struct uniform_array_info *) entry->data; in update_array_sizes()
484 struct hash_entry *entry = in add_var_use_deref() local
486 if (!entry && glsl_type_is_array(deref->var->type)) { in add_var_use_deref()
496 if (entry) in add_var_use_deref()
965 struct hash_entry *entry = find_and_update_named_uniform_storage() local
979 struct hash_entry *entry = prog->data->spirv ? NULL : find_and_update_named_uniform_storage() local
1095 struct type_tree_entry *entry = malloc(sizeof *entry); build_type_tree_for_type() local
1130 free_type_tree(struct type_tree_entry *entry) free_type_tree() argument
1143 hash_free_uniform_name(struct hash_entry *entry) hash_free_uniform_name() argument
1364 struct hash_entry *entry = prog->data->spirv ? NULL : nir_link_uniform() local
1589 struct set_entry *entry = _mesa_set_search(storage_counted, name); gl_nir_link_uniforms() local
1726 struct hash_entry *entry = gl_nir_link_uniforms() local
1749 struct hash_entry *entry = gl_nir_link_uniforms() local
1828 struct hash_entry *entry = gl_nir_link_uniforms() local
[all...]

Completed in 16 milliseconds

1...<<11121314151617181920>>...87