| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ubo/ |
| H A D | vktUniformBlockCase.cpp | 153 std::ostream& operator<< (std::ostream& stream, const BlockLayoutEntry& entry) in operator <<() argument
155 stream << entry.name << " { name = " << entry.name in operator <<()
156 << ", size = " << entry.size in operator <<()
159 for (std::vector<int>::const_iterator i = entry.activeUniformIndices.begin(); i != entry.activeUniformIndices.end(); i++) in operator <<()
161 if (i != entry.activeUniformIndices.begin()) in operator <<()
170 std::ostream& operator<< (std::ostream& stream, const UniformLayoutEntry& entry) in operator <<() argument
172 stream << entry.name << " { type = " << glu::getDataTypeName(entry in operator <<()
573 UniformLayoutEntry entry; computeReferenceLayout() local
624 UniformLayoutEntry entry; computeReferenceLayout() local
651 UniformLayoutEntry entry; computeReferenceLayout() local
738 generateValue(const UniformLayoutEntry& entry, void* basePtr, de::Random& rnd) generateValue() argument
795 const UniformLayoutEntry& entry = layout.uniforms[layout.blocks[blockNdx].activeUniformIndices[entryNdx]]; generateValues() local
1198 generateValueSrc(std::ostringstream& src, const UniformLayoutEntry& entry, const void* basePtr, int elementNdx) generateValueSrc() argument
1266 writeMatrixTypeSrc(int columnCount, int rowCount, std::string compare, std::string compareType, std::ostringstream& src, const std::string& srcName, const void* basePtr, const UniformLayoutEntry& entry, bool vector) writeMatrixTypeSrc() argument
1334 generateTestSrcMatrixPerVec(glu::DataType elementType, std::ostringstream& src, const std::string& srcName, const void* basePtr, const UniformLayoutEntry& entry, bool vector) generateTestSrcMatrixPerVec() argument
1377 generateTestSrcMatrixPerElement(glu::DataType elementType, std::ostringstream& src, const std::string& srcName, const void* basePtr, const UniformLayoutEntry& entry, bool vector) generateTestSrcMatrixPerElement() argument
1421 generateSingleCompare(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const UniformLayoutEntry& entry, MatrixLoadFlags matrixLoadFlag) generateSingleCompare() argument
1471 const UniformLayoutEntry& entry = layout.uniforms[uniformNdx]; generateCompareSrc() local
[all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | maple_tree.c | 18 * subtree with an entry attached to the value where as keys are unique to a
47 * the B-tree variants, it is known that one entry will either be added or
208 static inline enum maple_type mte_node_type(const struct maple_enode *entry) in mte_node_type() argument
210 return ((unsigned long)entry >> MAPLE_NODE_TYPE_SHIFT) & in mte_node_type()
224 static inline bool mte_is_leaf(const struct maple_enode *entry) in mte_is_leaf() argument
226 return ma_is_leaf(mte_node_type(entry)); in mte_is_leaf()
233 static inline bool mt_is_reserved(const void *entry) in mt_is_reserved() argument
235 return ((unsigned long)entry < MAPLE_RESERVED_RANGE) && in mt_is_reserved()
236 xa_is_internal(entry); in mt_is_reserved()
286 static inline struct maple_node *mte_to_node(const struct maple_enode *entry) in mte_to_node() argument
297 mte_to_mat(const struct maple_enode *entry) mte_to_mat() argument
1776 struct maple_enode *entry; global() variable
2434 mab_set_b_end(struct maple_big_node *b_node, struct ma_state *mas, void *entry) mab_set_b_end() argument
3506 mas_root_expand(struct ma_state *mas, void *entry) mas_root_expand() argument
3548 mas_store_root(struct ma_state *mas, void *entry) mas_store_root() argument
3578 void *entry = wr_mas->entry; mas_is_span_wr() local
3703 void *entry; mas_state_walk() local
3776 mas_new_root(struct ma_state *mas, void *entry) mas_new_root() argument
4281 mas_insert(struct ma_state *mas, void *entry) mas_insert() argument
4442 void *entry; mas_prev_slot() local
4613 void *entry; mas_next_slot() local
4883 void *entry; mas_walk() local
5145 void *entry; mte_dead_leaves() local
5393 mas_store(struct ma_state *mas, void *entry) mas_store() argument
5430 mas_store_gfp(struct ma_state *mas, void *entry, gfp_t gfp) mas_store_gfp() argument
5454 mas_store_prealloc(struct ma_state *mas, void *entry) mas_store_prealloc() argument
5474 mas_preallocate(struct ma_state *mas, void *entry, gfp_t gfp) mas_preallocate() argument
5657 mas_next_setup(struct ma_state *mas, unsigned long max, void **entry) mas_next_setup() argument
5716 void *entry = NULL; mas_next() local
5739 void *entry = NULL; mas_next_range() local
5763 void *entry = NULL; mt_next() local
5773 mas_prev_setup(struct ma_state *mas, unsigned long min, void **entry) mas_prev_setup() argument
5840 void *entry = NULL; mas_prev() local
5863 void *entry = NULL; mas_prev_range() local
5886 void *entry = NULL; mt_prev() local
5923 mas_find_setup(struct ma_state *mas, unsigned long max, void **entry) mas_find_setup() argument
5998 void *entry = NULL; mas_find() local
6022 void *entry = NULL; mas_find_range() local
6040 mas_find_rev_setup(struct ma_state *mas, unsigned long min, void **entry) mas_find_rev_setup() argument
6123 void *entry = NULL; mas_find_rev() local
6149 void *entry = NULL; mas_find_range_rev() local
6172 void *entry; mas_erase() local
6242 void *entry; mtree_load() local
6281 mtree_store_range(struct maple_tree *mt, unsigned long index, unsigned long last, void *entry, gfp_t gfp) mtree_store_range() argument
6318 mtree_store(struct maple_tree *mt, unsigned long index, void *entry, gfp_t gfp) mtree_store() argument
6336 mtree_insert_range(struct maple_tree *mt, unsigned long first, unsigned long last, void *entry, gfp_t gfp) mtree_insert_range() argument
6371 mtree_insert(struct maple_tree *mt, unsigned long index, void *entry, gfp_t gfp) mtree_insert() argument
6378 mtree_alloc_range(struct maple_tree *mt, unsigned long *startp, void *entry, unsigned long size, unsigned long min, unsigned long max, gfp_t gfp) mtree_alloc_range() argument
6416 mtree_alloc_rrange(struct maple_tree *mt, unsigned long *startp, void *entry, unsigned long size, unsigned long min, unsigned long max, gfp_t gfp) mtree_alloc_rrange() argument
6466 void *entry = NULL; mtree_erase() local
6530 void *entry; mt_find() local
6741 mt_dump_entry(void *entry, unsigned long min, unsigned long max, unsigned int depth, enum mt_dump_format format) mt_dump_entry() argument
6757 mt_dump_range64(const struct maple_tree *mt, void *entry, unsigned long min, unsigned long max, unsigned int depth, enum mt_dump_format format) mt_dump_range64() argument
6812 mt_dump_arange64(const struct maple_tree *mt, void *entry, unsigned long min, unsigned long max, unsigned int depth, enum mt_dump_format format) mt_dump_arange64() argument
6871 mt_dump_node(const struct maple_tree *mt, void *entry, unsigned long min, unsigned long max, unsigned int depth, enum mt_dump_format format) mt_dump_node() argument
6908 void *entry = rcu_dereference_check(mt->ma_root, mt_locked(mt)); mt_dump() local
6956 void *entry = mas_get_slot(mas, i); mas_validate_gaps() local
7140 void *entry = mas_slot(mas, slots, i); mas_validate_limits() local
7163 void *entry, *last = (void *)1; mt_validate_nulls() local
[all...] |
| /third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
| H A D | FieldSet.java | 172 Map.Entry<T, Object> entry = fields.getArrayEntryAt(i); in clone()
173 clone.setField(entry.getKey(), entry.getValue()); in clone()
175 for (Map.Entry<T, Object> entry : fields.getOverflowEntries()) { in clone()
176 clone.setField(entry.getKey(), entry.getValue()); in clone()
209 for (Map.Entry<T, Object> entry : fields.getOverflowEntries()) { in cloneAllFieldsMap()
210 cloneFieldEntry(result, entry, copyList); in cloneAllFieldsMap()
216 Map<T, Object> map, Map.Entry<T, Object> entry, boolean copyList) { in cloneFieldEntry()
217 T key = entry in cloneFieldEntry()
215 cloneFieldEntry( Map<T, Object> map, Map.Entry<T, Object> entry, boolean copyList) cloneFieldEntry() argument
457 isInitialized( final Map.Entry<T, Object> entry) isInitialized() argument
519 mergeFromField(final Map.Entry<T, Object> entry) mergeFromField() argument
597 writeMessageSetTo(final Map.Entry<T, Object> entry, final CodedOutputStream output) writeMessageSetTo() argument
782 getMessageSetSerializedSize(final Map.Entry<T, Object> entry) getMessageSetSerializedSize() argument
963 replaceBuilders( Map.Entry<T, Object> entry) replaceBuilders() argument
1259 mergeFromField(final Map.Entry<T, Object> entry) mergeFromField() argument
[all...] |
| H A D | MapFieldLite.java | 101 public V put(Map.Entry<K, V> entry) { in put() argument
102 return put(entry.getKey(), entry.getValue()); in put()
143 for (Map.Entry<K, V> entry : a.entrySet()) { in equals()
144 if (!b.containsKey(entry.getKey())) { in equals()
147 if (!equals(entry.getValue(), b.get(entry.getKey()))) { in equals()
178 for (Map.Entry<K, V> entry : a.entrySet()) { in calculateHashCodeForMap()
180 calculateHashCodeForObject(entry.getKey()) ^ calculateHashCodeForObject(entry in calculateHashCodeForMap()
[all...] |
| /kernel/linux/linux-5.10/drivers/net/wireless/intersil/hostap/ |
| H A D | hostap_hw.c | 162 * __hostap_cmd_queue_free - Free Prism2 command queue entry (private)
164 * @entry: Prism2 command queue entry to be freed
165 * @del_req: request the entry to be removed
171 struct hostap_cmd_queue *entry, in __hostap_cmd_queue_free()
175 entry->del_req = 1; in __hostap_cmd_queue_free()
176 if (!list_empty(&entry->list)) { in __hostap_cmd_queue_free()
177 list_del_init(&entry->list); in __hostap_cmd_queue_free()
182 if (refcount_dec_and_test(&entry->usecnt) && entry in __hostap_cmd_queue_free()
170 __hostap_cmd_queue_free(local_info_t *local, struct hostap_cmd_queue *entry, int del_req) __hostap_cmd_queue_free() argument
195 hostap_cmd_queue_free(local_info_t *local, struct hostap_cmd_queue *entry, int del_req) hostap_cmd_queue_free() argument
215 struct hostap_cmd_queue *entry; prism2_clear_cmd_queue() local
243 hfa384x_cmd_issue(struct net_device *dev, struct hostap_cmd_queue *entry) hfa384x_cmd_issue() argument
317 struct hostap_cmd_queue *entry; hfa384x_cmd() local
487 struct hostap_cmd_queue *entry; hfa384x_cmd_callback() local
643 struct hostap_cmd_queue *entry = NULL; prism2_cmd_ev() local
2962 struct set_tim_data *entry = prism2_set_tim() local
2987 struct set_tim_data *entry; handle_set_tim_queue() local
3024 struct set_tim_data *entry; prism2_clear_set_tim_queue() local
[all...] |
| /kernel/linux/linux-6.6/drivers/net/wireless/intersil/hostap/ |
| H A D | hostap_hw.c | 162 * __hostap_cmd_queue_free - Free Prism2 command queue entry (private)
164 * @entry: Prism2 command queue entry to be freed
165 * @del_req: request the entry to be removed
171 struct hostap_cmd_queue *entry, in __hostap_cmd_queue_free()
175 entry->del_req = 1; in __hostap_cmd_queue_free()
176 if (!list_empty(&entry->list)) { in __hostap_cmd_queue_free()
177 list_del_init(&entry->list); in __hostap_cmd_queue_free()
182 if (refcount_dec_and_test(&entry->usecnt) && entry in __hostap_cmd_queue_free()
170 __hostap_cmd_queue_free(local_info_t *local, struct hostap_cmd_queue *entry, int del_req) __hostap_cmd_queue_free() argument
195 hostap_cmd_queue_free(local_info_t *local, struct hostap_cmd_queue *entry, int del_req) hostap_cmd_queue_free() argument
215 struct hostap_cmd_queue *entry; prism2_clear_cmd_queue() local
243 hfa384x_cmd_issue(struct net_device *dev, struct hostap_cmd_queue *entry) hfa384x_cmd_issue() argument
317 struct hostap_cmd_queue *entry; hfa384x_cmd() local
487 struct hostap_cmd_queue *entry; hfa384x_cmd_callback() local
643 struct hostap_cmd_queue *entry = NULL; prism2_cmd_ev() local
2966 struct set_tim_data *entry = prism2_set_tim() local
2991 struct set_tim_data *entry; handle_set_tim_queue() local
3028 struct set_tim_data *entry; prism2_clear_set_tim_queue() local
[all...] |
| /kernel/linux/linux-5.10/drivers/firmware/ |
| H A D | qemu_fw_cfg.c | 357 ssize_t (*show)(struct fw_cfg_sysfs_entry *entry, char *buf);
372 static inline void fw_cfg_sysfs_cache_enlist(struct fw_cfg_sysfs_entry *entry) in fw_cfg_sysfs_cache_enlist() argument
375 list_add_tail(&entry->list, &fw_cfg_entry_cache); in fw_cfg_sysfs_cache_enlist()
379 static inline void fw_cfg_sysfs_cache_delist(struct fw_cfg_sysfs_entry *entry) in fw_cfg_sysfs_cache_delist() argument
382 list_del(&entry->list); in fw_cfg_sysfs_cache_delist()
388 struct fw_cfg_sysfs_entry *entry, *next; in fw_cfg_sysfs_cache_cleanup() local
390 list_for_each_entry_safe(entry, next, &fw_cfg_entry_cache, list) { in fw_cfg_sysfs_cache_cleanup()
391 fw_cfg_sysfs_cache_delist(entry); in fw_cfg_sysfs_cache_cleanup()
392 kobject_put(&entry->kobj); in fw_cfg_sysfs_cache_cleanup()
396 /* default_attrs: per-entry attribute
434 struct fw_cfg_sysfs_entry *entry = to_entry(kobj); fw_cfg_sysfs_attr_show() local
447 struct fw_cfg_sysfs_entry *entry = to_entry(kobj); fw_cfg_sysfs_release_entry() local
464 struct fw_cfg_sysfs_entry *entry = to_entry(kobj); fw_cfg_sysfs_read_raw() local
582 struct fw_cfg_sysfs_entry *entry; fw_cfg_register_file() local
[all...] |
| /third_party/node/deps/v8/src/base/ |
| H A D | hashmap.h | 15 #include "src/base/hashmap-entry.h"
64 // If an entry with matching key is found, returns that entry.
68 // If an entry with matching key is found, returns that entry.
69 // If no matching entry is found, a new entry is inserted with
73 // If an entry with matching key is found, returns that entry.
74 // If no matching entry i
216 Entry* entry = Probe(key, hash); Lookup() local
246 Entry* entry = Probe(lookup_key, hash); LookupOrInsert() local
259 Entry* entry = Probe(key, hash); InsertNew() local
365 DCHECK(i < capacity()); DCHECK(occupancy() < capacity()); Entry* map = impl_.map_; while (map[i].exists() && !impl_.match()(hash, map[i].hash, key, map[i].key)) { i = (i + 1) & (capacity() - 1); } return &map[i]; } template <typename Key, typename Value, typename MatchFun, class AllocationPolicy> typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry* TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::FillEmptyEntry( Entry* entry, const Key& key, const Value& value, uint32_t hash) { DCHECK(!entry->exists()); new (entry) Entry(key, value, hash); impl_.occupancy_++; if (occupancy() + occupancy() / 4 >= capacity()) Probe() argument
551 Iterator(const Base* map, typename Base::Entry* entry) Iterator() argument
[all...] |
| /kernel/linux/linux-5.10/fs/proc/ |
| H A D | namespaces.c | 121 const struct proc_ns_operations **entry, **last; in proc_ns_dir_readdir() local
130 entry = ns_entries + (ctx->pos - 2); in proc_ns_dir_readdir()
132 while (entry <= last) { in proc_ns_dir_readdir()
133 const struct proc_ns_operations *ops = *entry; in proc_ns_dir_readdir()
138 entry++; in proc_ns_dir_readdir()
155 const struct proc_ns_operations **entry, **last; in proc_ns_dir_lookup() local
163 for (entry = ns_entries; entry < last; entry++) { in proc_ns_dir_lookup()
164 if (strlen((*entry) in proc_ns_dir_lookup()
[all...] |
| /kernel/linux/linux-6.6/fs/proc/ |
| H A D | namespaces.c | 121 const struct proc_ns_operations **entry, **last; in proc_ns_dir_readdir() local
130 entry = ns_entries + (ctx->pos - 2); in proc_ns_dir_readdir()
132 while (entry <= last) { in proc_ns_dir_readdir()
133 const struct proc_ns_operations *ops = *entry; in proc_ns_dir_readdir()
138 entry++; in proc_ns_dir_readdir()
155 const struct proc_ns_operations **entry, **last; in proc_ns_dir_lookup() local
163 for (entry = ns_entries; entry < last; entry++) { in proc_ns_dir_lookup()
164 if (strlen((*entry) in proc_ns_dir_lookup()
[all...] |
| /third_party/mesa3d/src/hgl/ |
| H A D | GLRendererRoster.cpp | 102 renderer = item.entry(view, options); in GetRenderer()
140 BEntry entry(&directory, fABISubDirectory); in AddPath()
141 if (entry.IsDirectory()) { in AddPath()
142 status = directory.SetTo(&entry); in AddPath()
157 BEntry entry; in AddPath() local
159 entry.SetTo(&ref, true); in AddPath()
160 if (entry.InitCheck() == B_OK && !entry.IsFile()) in AddPath()
177 GLRendererRoster::AddRenderer(InstantiateRenderer entry, in AddRenderer() argument
181 item.entry in AddRenderer()
[all...] |
| /kernel/linux/linux-6.6/drivers/acpi/ |
| H A D | power.c | 97 struct acpi_power_resource_entry *entry; in acpi_power_resources_list_add() local
102 entry = kzalloc(sizeof(*entry), GFP_KERNEL); in acpi_power_resources_list_add()
103 if (!entry) in acpi_power_resources_list_add()
106 entry->resource = resource; in acpi_power_resources_list_add()
112 list_add_tail(&entry->node, &e->node); in acpi_power_resources_list_add()
116 list_add_tail(&entry->node, list); in acpi_power_resources_list_add()
122 struct acpi_power_resource_entry *entry, *e; in acpi_power_resources_list_free() local
124 list_for_each_entry_safe(entry, e, list, node) { in acpi_power_resources_list_free()
125 list_del(&entry in acpi_power_resources_list_free()
222 struct acpi_power_resource_entry *entry; acpi_power_get_list_state() local
316 struct acpi_power_resource_entry *entry; acpi_device_power_add_dependent() local
351 struct acpi_power_resource_entry *entry; acpi_device_power_remove_dependent() local
472 struct acpi_power_resource_entry *entry; acpi_power_off_list() local
491 struct acpi_power_resource_entry *entry; acpi_power_on_list() local
540 struct acpi_power_resource_entry *entry; acpi_power_hide_list() local
559 struct acpi_power_resource_entry *entry; acpi_power_expose_list() local
613 struct acpi_power_resource_entry *entry; acpi_power_wakeup_list_init() local
759 struct acpi_power_resource_entry *entry; acpi_disable_wakeup_device_power() local
[all...] |
| /third_party/vk-gl-cts/external/openglcts/modules/common/ |
| H A D | glcUniformBlockCase.cpp | 194 std::ostream& operator<<(std::ostream& stream, const BlockLayoutEntry& entry) in operator <<() argument
196 stream << entry.name << " { name = " << entry.name << ", size = " << entry.size << ", activeUniformIndices = ["; in operator <<()
198 for (vector<int>::const_iterator i = entry.activeUniformIndices.begin(); i != entry.activeUniformIndices.end(); i++) in operator <<()
200 if (i != entry.activeUniformIndices.begin()) in operator <<()
226 std::ostream& operator<<(std::ostream& stream, const UniformLayoutEntry& entry) in operator <<() argument
228 stream << entry.name << " { type = " << glu::getDataTypeName(entry in operator <<()
443 UniformLayoutEntry entry; computeStd140Layout() local
486 UniformLayoutEntry entry; computeStd140Layout() local
511 UniformLayoutEntry entry; computeStd140Layout() local
596 generateValue(const UniformLayoutEntry& entry, void* basePtr, de::Random& rnd) generateValue() argument
658 const UniformLayoutEntry& entry = layout.uniforms[layout.blocks[blockNdx].activeUniformIndices[entryNdx]]; generateValues() local
857 generateValueSrc(std::ostringstream& src, const UniformLayoutEntry& entry, const void* basePtr, int elementNdx) generateValueSrc() argument
934 const UniformLayoutEntry& entry = layout.uniforms[uniformNdx]; generateCompareSrc() local
1116 BlockLayoutEntry& entry = layout.blocks[blockNdx]; getGLUniformLayout() local
1182 UniformLayoutEntry& entry = layout.uniforms[uniformNdx]; getGLUniformLayout() local
[all...] |
| /third_party/node/deps/v8/src/profiler/ |
| H A D | profile-generator.cc | 156 bool CodeEntry::IsSameFunctionAs(const CodeEntry* entry) const { in IsSameFunctionAs()
157 if (this == entry) return true; in IsSameFunctionAs()
159 return script_id_ == entry->script_id_ && position_ == entry->position_; in IsSameFunctionAs()
161 return name_ == entry->name_ && resource_name_ == entry->resource_name_ && in IsSameFunctionAs()
162 line_number_ == entry->line_number_; in IsSameFunctionAs()
332 // Handle metadata and VM state code entry types. in source_type()
372 void ProfileNode::CollectDeoptInfo(CodeEntry* entry) { in CollectDeoptInfo() argument
373 deopt_infos_.push_back(entry in CollectDeoptInfo()
377 FindChild(CodeEntry* entry, int line_number) FindChild() argument
382 FindOrAddChild(CodeEntry* entry, int line_number) FindOrAddChild() argument
665 const CodeEntry* entry = node->entry(); BuildNodeValue() local
933 AddRef(CodeEntry* entry) AddRef() argument
937 DecRef(CodeEntry* entry) DecRef() argument
966 AddCode(Address addr, CodeEntry* entry, unsigned size) AddCode() argument
971 RemoveCode(CodeEntry* entry) RemoveCode() argument
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/netronome/nfp/flower/ |
| H A D | lag_conf.c | 49 * struct nfp_fl_lag_group - list entry for each LAG group
52 * @list: List entry
145 struct nfp_fl_lag_group *entry; in nfp_fl_lag_find_group_for_master_with_lag() local
150 list_for_each_entry(entry, &lag->group_list, list) in nfp_fl_lag_find_group_for_master_with_lag()
151 if (entry->master_ndev == master) in nfp_fl_lag_find_group_for_master_with_lag()
152 return entry; in nfp_fl_lag_find_group_for_master_with_lag()
171 NL_SET_ERR_MSG_MOD(extack, "invalid entry: group does not exist for LAG action"); in nfp_flower_lag_populate_pre_action()
267 struct nfp_fl_lag_group *entry, *storage; in nfp_fl_lag_do_work() local
278 list_for_each_entry_safe(entry, storage, &lag->group_list, list) { in nfp_fl_lag_do_work()
285 if (entry in nfp_fl_lag_do_work()
678 struct nfp_fl_lag_group *entry, *storage; nfp_flower_lag_cleanup() local
[all...] |
| /kernel/linux/linux-6.6/drivers/gpu/drm/ |
| H A D | drm_debugfs.c | 56 struct drm_debugfs_entry *entry = m->private; in drm_name_info() local
57 struct drm_device *dev = entry->dev; in drm_name_info()
77 struct drm_debugfs_entry *entry = m->private; in drm_clients_info() local
78 struct drm_device *dev = entry->dev; in drm_clients_info()
131 struct drm_debugfs_entry *entry = m->private; in drm_gem_name_info() local
132 struct drm_device *dev = entry->dev; in drm_gem_name_info()
160 struct drm_debugfs_entry *entry = inode->i_private; in drm_debugfs_entry_open() local
161 struct drm_debugfs_info *node = &entry->file; in drm_debugfs_entry_open()
163 return single_open(file, node->show, entry); in drm_debugfs_entry_open()
227 * @root: DRI debugfs dir entry
268 struct drm_debugfs_entry *entry, *tmp; drm_debugfs_init() local
304 struct drm_debugfs_entry *entry, *tmp; drm_debugfs_late_register() local
376 struct drm_debugfs_entry *entry = drmm_kzalloc(dev, sizeof(*entry), GFP_KERNEL); drm_debugfs_add_file() local
[all...] |
| /third_party/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_serialize.cpp | 83 blob_write_bytes(blob, reloc->entry, sizeof(*reloc->entry) * reloc->count); in nv50_ir_prog_info_out_serialize()
92 /* Going through each entry */ in nv50_ir_prog_info_out_serialize()
94 blob_write_uint32(blob, fixup->entry[i].val); in nv50_ir_prog_info_out_serialize()
95 assert(fixup->entry[i].apply); in nv50_ir_prog_info_out_serialize()
98 if (fixup->entry[i].apply == nv50_ir::nv50_interpApply) in nv50_ir_prog_info_out_serialize()
100 else if (fixup->entry[i].apply == nv50_ir::nvc0_interpApply) in nv50_ir_prog_info_out_serialize()
102 else if (fixup->entry[i].apply == nv50_ir::gk110_interpApply) in nv50_ir_prog_info_out_serialize()
104 else if (fixup->entry[i].apply == nv50_ir::gm107_interpApply) in nv50_ir_prog_info_out_serialize()
106 else if (fixup->entry[ in nv50_ir_prog_info_out_serialize()
[all...] |
| /third_party/node/deps/v8/src/objects/ |
| H A D | dictionary.h | 41 inline Object ValueAt(InternalIndex entry);
42 inline Object ValueAt(PtrComprCageBase cage_base, InternalIndex entry);
44 inline base::Optional<Object> TryValueAt(InternalIndex entry);
46 // Set the value for entry.
47 inline void ValueAtPut(InternalIndex entry, Object value);
49 // Returns the property details for the property at entry.
50 inline PropertyDetails DetailsAt(InternalIndex entry);
52 // Set the details for entry.
53 inline void DetailsAtPut(InternalIndex entry, PropertyDetails value);
59 Isolate* isolate, Handle<Derived> dictionary, InternalIndex entry);
279 DetailsAt(Dictionary dict, InternalIndex entry) DetailsAt() argument
285 DetailsAtPut(Dictionary dict, InternalIndex entry, PropertyDetails value) DetailsAtPut() argument
[all...] |
| /third_party/node/deps/v8/src/interpreter/ |
| H A D | constant-array-builder.cc | 43 ConstantArrayBuilder::Entry entry, size_t count) { in Allocate()
48 constants_.push_back(entry); in Allocate()
77 for (const Entry& entry : constants_) { in CheckAllElementsAreUnique()
79 switch (entry.tag_) { in CheckAllElementsAreUnique()
81 duplicate = !smis.insert(entry.smi_).second; in CheckAllElementsAreUnique()
84 duplicate = !heap_numbers.insert(entry.heap_number_).second; in CheckAllElementsAreUnique()
87 duplicate = !strings.insert(entry.raw_string_).second; in CheckAllElementsAreUnique()
90 duplicate = !bigints.insert(entry.bigint_.c_str()).second; in CheckAllElementsAreUnique()
93 duplicate = !scopes.insert(entry.scope_).second; in CheckAllElementsAreUnique()
96 duplicate = !deferred_objects.insert(*entry in CheckAllElementsAreUnique()
42 Allocate( ConstantArrayBuilder::Entry entry, size_t count) Allocate() argument
173 const Entry& entry = slice->At(index); At() local
224 auto entry = smi_map_.find(smi); Insert() local
276 AllocateIndex( ConstantArrayBuilder::Entry entry) AllocateIndex() argument
281 AllocateIndexArray( ConstantArrayBuilder::Entry entry, size_t count) AllocateIndexArray() argument
354 auto entry = smi_map_.find(value); CommitReservedEntry() local
[all...] |
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | act_gate.c | 173 static int fill_gate_entry(struct nlattr **tb, struct tcfg_gate_entry *entry, in fill_gate_entry() argument
178 entry->gate_state = nla_get_flag(tb[TCA_GATE_ENTRY_GATE]); in fill_gate_entry()
184 NL_SET_ERR_MSG(extack, "Invalid interval for schedule entry"); in fill_gate_entry()
188 entry->interval = interval; in fill_gate_entry()
191 entry->ipv = nla_get_s32(tb[TCA_GATE_ENTRY_IPV]); in fill_gate_entry()
193 entry->ipv = -1; in fill_gate_entry()
196 entry->maxoctets = nla_get_s32(tb[TCA_GATE_ENTRY_MAX_OCTETS]); in fill_gate_entry()
198 entry->maxoctets = -1; in fill_gate_entry()
203 static int parse_gate_entry(struct nlattr *n, struct tcfg_gate_entry *entry, in parse_gate_entry() argument
211 NL_SET_ERR_MSG(extack, "Could not parse nested entry"); in parse_gate_entry()
222 struct tcfg_gate_entry *entry, *e; release_entry_list() local
234 struct tcfg_gate_entry *entry; parse_gate_list() local
402 struct tcfg_gate_entry *entry; tcf_gate_init() local
469 dumping_entry(struct sk_buff *skb, struct tcfg_gate_entry *entry) dumping_entry() argument
510 struct tcfg_gate_entry *entry; tcf_gate_dump() local
[all...] |
| /drivers/peripheral/distributed_camera/hdi_service/test/sample/ |
| H A D | dcamera_hdf_demo.cpp | 788 camera_metadata_item_t entry; in GetFaceDetectMode() local
789 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_STATISTICS_FACE_DETECT_MODE, &entry); in GetFaceDetectMode()
794 faceDetectMode = *(entry.data.u8); in GetFaceDetectMode()
803 camera_metadata_item_t entry; in GetFocalLength() local
804 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_ABILITY_FOCAL_LENGTH, &entry); in GetFocalLength()
809 focalLength = *(entry.data.f); in GetFocalLength()
818 camera_metadata_item_t entry; in GetAvailableFocusModes() local
819 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_ABILITY_FOCUS_MODES, &entry); in GetAvailableFocusModes()
824 uint32_t count = entry.count; in GetAvailableFocusModes()
828 focusMode.push_back(*(entry in GetAvailableFocusModes()
841 camera_metadata_item_t entry; GetAvailableExposureModes() local
864 camera_metadata_item_t entry; GetExposureCompensationRange() local
888 camera_metadata_item_t entry; GetExposureCompensationSteps() local
905 camera_metadata_item_t entry; GetAvailableMeterModes() local
928 camera_metadata_item_t entry; GetAvailableFlashModes() local
951 camera_metadata_item_t entry; GetMirrorSupported() local
966 camera_metadata_item_t entry; GetStreamBasicConfigurations() local
990 camera_metadata_item_t entry; GetFpsRange() local
1014 camera_metadata_item_t entry; GetCameraPosition() local
1030 camera_metadata_item_t entry; GetCameraType() local
1046 camera_metadata_item_t entry; GetCameraConnectionType() local
1062 camera_metadata_item_t entry; GetFaceDetectMaxNum() local
1090 camera_metadata_item_t entry; OnResult() local
1103 camera_metadata_item_t entry; OnResult() local
[all...] |
| /kernel/linux/linux-6.6/arch/parisc/kernel/ |
| H A D | alternative.c | 26 struct alt_instr *entry; in apply_alternatives() local
46 for (entry = start; entry < end; entry++, index++) { in apply_alternatives()
52 from = (u32 *)((ulong)&entry->orig_offset + entry->orig_offset); in apply_alternatives()
53 len = entry->len; in apply_alternatives()
54 cond = entry->cond; in apply_alternatives()
55 replacement = entry->replacement; in apply_alternatives()
90 source = (u32 *)((ulong)&entry in apply_alternatives()
[all...] |
| /kernel/linux/linux-5.10/security/selinux/ss/ |
| H A D | sidtab.h | 64 struct sidtab_entry entry; member
99 /* index == SID - 1 (no entry for SECSID_NULL) */
113 struct sidtab_entry *entry = sidtab_search_entry(s, sid); in sidtab_search() local
115 return entry ? &entry->context : NULL; in sidtab_search()
120 struct sidtab_entry *entry = sidtab_search_entry_force(s, sid); in sidtab_search_force() local
122 return entry ? &entry->context : NULL; in sidtab_search_force()
139 void sidtab_sid2str_put(struct sidtab *s, struct sidtab_entry *entry,
141 int sidtab_sid2str_get(struct sidtab *s, struct sidtab_entry *entry,
144 sidtab_sid2str_put(struct sidtab *s, struct sidtab_entry *entry, const char *str, u32 str_len) sidtab_sid2str_put() argument
149 sidtab_sid2str_get(struct sidtab *s, struct sidtab_entry *entry, char **out, u32 *out_len) sidtab_sid2str_get() argument
[all...] |
| /kernel/linux/linux-6.6/security/selinux/ss/ |
| H A D | sidtab.h | 64 struct sidtab_entry entry; member
98 /* index == SID - 1 (no entry for SECSID_NULL) */
112 struct sidtab_entry *entry = sidtab_search_entry(s, sid); in sidtab_search() local
114 return entry ? &entry->context : NULL; in sidtab_search()
119 struct sidtab_entry *entry = sidtab_search_entry_force(s, sid); in sidtab_search_force() local
121 return entry ? &entry->context : NULL; in sidtab_search_force()
138 void sidtab_sid2str_put(struct sidtab *s, struct sidtab_entry *entry,
140 int sidtab_sid2str_get(struct sidtab *s, struct sidtab_entry *entry,
143 sidtab_sid2str_put(struct sidtab *s, struct sidtab_entry *entry, const char *str, u32 str_len) sidtab_sid2str_put() argument
148 sidtab_sid2str_get(struct sidtab *s, struct sidtab_entry *entry, char **out, u32 *out_len) sidtab_sid2str_get() argument
[all...] |
| /third_party/mesa3d/src/compiler/glsl/ |
| H A D | ir_array_refcount.cpp | 44 free_entry(struct hash_entry *entry) in free_entry() argument
46 ir_array_refcount_entry *ivre = (ir_array_refcount_entry *) entry->data; in free_entry()
87 ir_array_refcount_entry *entry = new ir_array_refcount_entry(var); in get_variable_entry()
88 _mesa_hash_table_insert(this->ht, var, entry); in get_variable_entry()
90 return entry; in get_variable_entry()
173 ir_array_refcount_entry *const entry = in visit_enter() local
176 if (entry == NULL) in visit_enter()
180 entry->array_depth, in visit_enter()
181 entry->bits); in visit_enter()
191 ir_array_refcount_entry *entry in visit() local
[all...] |