| /linux/include/linux/ |
| H A D | leafops.h | 38 * softleaf_mk_none() - Create an empty ('none') leaf entry.
39 * Returns: empty leaf entry.
47 * softleaf_from_pte() - Obtain a leaf entry from a PTE entry.
48 * @pte: PTE entry.
50 * If @pte is present (therefore not a leaf entry) the function returns an empty
51 * leaf entry. Otherwise, it returns a leaf entry.
53 * Returns: Leaf entry.
70 * softleaf_to_pte() - Obtain a PTE entry from a leaf entry.
71 * @entry: Leaf entry.
73 * This generates an architecture-specific PTE entry that can be utilised to
[all …]
|
| H A D | xarray.h | 28 * The bottom two bits of the entry determine how the XArray interprets
31 * 00: Pointer entry
32 * 10: Internal entry
33 * x1: Value entry or tagged pointer
41 * 256: Retry entry
42 * 257: Zero entry
52 * xa_mk_value() - Create an XArray entry from an integer.
56 * Return: An entry suitable for storing in the XArray.
65 * xa_to_value() - Get value stored in an XArray entry.
66 * @entry: XArray entry.
[all …]
|
| /linux/sound/core/ |
| H A D | info.c | 54 struct snd_info_entry *entry; member
59 static void snd_info_clear_entries(struct snd_info_entry *entry);
73 static int alloc_info_private(struct snd_info_entry *entry, in alloc_info_private() argument
78 if (!entry || !entry->p) in alloc_info_private()
80 if (!try_module_get(entry->module)) in alloc_info_private()
84 module_put(entry->module); in alloc_info_private()
87 data->entry = entry; in alloc_info_private()
107 struct snd_info_entry *entry; in snd_info_entry_llseek() local
111 entry = data->entry; in snd_info_entry_llseek()
112 guard(mutex)(&entry->access); in snd_info_entry_llseek()
[all …]
|
| /linux/drivers/firmware/ |
| H A D | memmap.c | 22 * Firmware map entry. Because firmware memory maps are flat and not
34 struct list_head list; /* entry for the linked list */
35 struct kobject kobj; /* kobject for each entry */
43 static ssize_t start_show(struct firmware_map_entry *entry, char *buf);
44 static ssize_t end_show(struct firmware_map_entry *entry, char *buf);
45 static ssize_t type_show(struct firmware_map_entry *entry, char *buf);
56 ssize_t (*show)(struct firmware_map_entry *entry, char *buf);
64 * These are default attributes that are added for every memmap entry.
85 * map entry is allocated by bootmem, we need to remember the storage and
100 struct firmware_map_entry *entry = to_memmap_entry(kobj); in release_firmware_map_entry() local
[all …]
|
| H A D | dmi-sysfs.c | 14 * entry.
32 the top entry type is only 8 bits */
54 ssize_t (*show)(struct dmi_sysfs_entry *entry, char *buf);
64 * dmi_sysfs_mapped_attribute - Attribute where we require the entry be
69 ssize_t (*show)(struct dmi_sysfs_entry *entry,
81 * Generic DMI entry support.
101 struct dmi_sysfs_entry *entry = to_entry(kobj); in dmi_sysfs_attr_show() local
108 return attr->show(entry, buf); in dmi_sysfs_attr_show()
119 struct dmi_sysfs_entry *entry; member
130 struct dmi_sysfs_entry *entry = data->entry; in find_dmi_entry_helper() local
[all …]
|
| /linux/drivers/media/platform/nvidia/tegra-vde/ |
| H A D | dmabuf-cache.c | 32 static void tegra_vde_release_entry(struct tegra_vde_cache_entry *entry) in tegra_vde_release_entry() argument
34 struct dma_buf *dmabuf = entry->a->dmabuf; in tegra_vde_release_entry()
36 WARN_ON_ONCE(entry->refcnt); in tegra_vde_release_entry()
38 if (entry->vde->domain) in tegra_vde_release_entry()
39 tegra_vde_iommu_unmap(entry->vde, entry->iova); in tegra_vde_release_entry()
41 dma_buf_unmap_attachment_unlocked(entry->a, entry->sgt, entry->dma_dir); in tegra_vde_release_entry()
42 dma_buf_detach(dmabuf, entry->a); in tegra_vde_release_entry()
45 list_del(&entry->list); in tegra_vde_release_entry()
46 kfree(entry); in tegra_vde_release_entry()
51 struct tegra_vde_cache_entry *entry; in tegra_vde_delayed_unmap() local
[all …]
|
| /linux/drivers/net/dsa/sja1105/ |
| H A D | sja1105_static_config.c | 94 struct sja1105_avb_params_entry *entry = entry_ptr; in sja1105et_avb_params_entry_packing() local
96 sja1105_packing(buf, &entry->destmeta, 95, 48, size, op); in sja1105et_avb_params_entry_packing()
97 sja1105_packing(buf, &entry->srcmeta, 47, 0, size, op); in sja1105et_avb_params_entry_packing()
105 struct sja1105_avb_params_entry *entry = entry_ptr; in sja1105pqrs_avb_params_entry_packing() local
107 sja1105_packing(buf, &entry->cas_master, 126, 126, size, op); in sja1105pqrs_avb_params_entry_packing()
108 sja1105_packing(buf, &entry->destmeta, 125, 78, size, op); in sja1105pqrs_avb_params_entry_packing()
109 sja1105_packing(buf, &entry->srcmeta, 77, 30, size, op); in sja1105pqrs_avb_params_entry_packing()
117 struct sja1105_general_params_entry *entry = entry_ptr; in sja1105et_general_params_entry_packing() local
119 sja1105_packing(buf, &entry->vllupformat, 319, 319, size, op); in sja1105et_general_params_entry_packing()
120 sja1105_packing(buf, &entry->mirr_ptacu, 318, 318, size, op); in sja1105et_general_params_entry_packing()
[all …]
|
| /linux/tools/perf/ui/browsers/ |
| H A D | annotate-data.c | 52 struct browser_entry *entry, in get_member_overhead() argument
55 struct annotated_member *member = entry->data; in get_member_overhead()
70 update_hist_entry(&entry->hists[k++], &h->addr[offset]); in get_member_overhead()
83 struct browser_entry *entry; in add_child_entries() local
86 entry = zalloc(sizeof(*entry)); in add_child_entries()
87 if (entry == NULL) in add_child_entries()
90 entry->hists = calloc(browser->nr_events, sizeof(*entry->hists)); in add_child_entries()
91 if (entry->hists == NULL) { in add_child_entries()
92 free(entry); in add_child_entries()
96 entry->data = member; in add_child_entries()
[all …]
|
| /linux/drivers/gpu/drm/amd/pm/powerplay/smumgr/ |
| H A D | vega10_smumgr.c | 46 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].version != 0, in vega10_copy_table_from_smc()
48 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].size != 0, in vega10_copy_table_from_smc()
52 upper_32_bits(priv->smu_tables.entry[table_id].mc_addr), in vega10_copy_table_from_smc()
56 lower_32_bits(priv->smu_tables.entry[table_id].mc_addr), in vega10_copy_table_from_smc()
60 priv->smu_tables.entry[table_id].table_id, in vega10_copy_table_from_smc()
65 memcpy(table, priv->smu_tables.entry[table_id].table, in vega10_copy_table_from_smc()
66 priv->smu_tables.entry[table_id].size); in vega10_copy_table_from_smc()
85 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].version != 0, in vega10_copy_table_to_smc()
87 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].size != 0, in vega10_copy_table_to_smc()
90 memcpy(priv->smu_tables.entry[table_id].table, table, in vega10_copy_table_to_smc()
[all …]
|
| H A D | vega12_smumgr.c | 49 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].version != 0, in vega12_copy_table_from_smc()
51 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].size != 0, in vega12_copy_table_from_smc()
55 upper_32_bits(priv->smu_tables.entry[table_id].mc_addr), in vega12_copy_table_from_smc()
60 lower_32_bits(priv->smu_tables.entry[table_id].mc_addr), in vega12_copy_table_from_smc()
73 memcpy(table, priv->smu_tables.entry[table_id].table, in vega12_copy_table_from_smc()
74 priv->smu_tables.entry[table_id].size); in vega12_copy_table_from_smc()
93 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].version != 0, in vega12_copy_table_to_smc()
95 PP_ASSERT_WITH_CODE(priv->smu_tables.entry[table_id].size != 0, in vega12_copy_table_to_smc()
98 memcpy(priv->smu_tables.entry[table_id].table, table, in vega12_copy_table_to_smc()
99 priv->smu_tables.entry[table_id].size); in vega12_copy_table_to_smc()
[all …]
|
| /linux/net/netlabel/ |
| H A D | netlabel_domainhash.c | 55 * netlbl_domhsh_free_entry - Frees a domain hash table entry
56 * @entry: the entry's RCU field
60 * function so that the memory allocated to a hash table entry can be released
64 static void netlbl_domhsh_free_entry(struct rcu_head *entry) in netlbl_domhsh_free_entry() argument
74 ptr = container_of(entry, struct netlbl_dom_map, rcu); in netlbl_domhsh_free_entry()
125 * netlbl_domhsh_search - Search for a domain entry
131 * entry if found, otherwise NULL is returned. @family may be %AF_UNSPEC
159 * netlbl_domhsh_search_def - Search for a domain entry
165 * entry if an exact match is found, if an exact match is not present in the
166 * hash table then the default entry is returned if valid otherwise NULL is
[all …]
|
| H A D | netlabel_addrlist.c | 36 * netlbl_af4list_search - Search for a matching IPv4 address entry
41 * Searches the IPv4 address list given by @head. If a matching address entry
59 * netlbl_af4list_search_exact - Search for an exact IPv4 address entry
86 * netlbl_af6list_search - Search for a matching IPv6 address entry
91 * Searches the IPv6 address list given by @head. If a matching address entry
110 * netlbl_af6list_search_exact - Search for an exact IPv6 address entry
138 * netlbl_af4list_add - Add a new IPv4 address entry to a list
139 * @entry: address entry
143 * Add a new address entry to the list pointed to by @head. On success zero is
148 int netlbl_af4list_add(struct netlbl_af4list *entry, struct list_head *head) in netlbl_af4list_add() argument
[all …]
|
| /linux/drivers/acpi/ |
| H A D | nvs.c | 97 struct nvs_page *entry, *next; in suspend_nvs_register() local
105 entry = kzalloc_obj(struct nvs_page); in suspend_nvs_register()
106 if (!entry) in suspend_nvs_register()
109 list_add_tail(&entry->node, &nvs_list); in suspend_nvs_register()
110 entry->phys_start = start; in suspend_nvs_register()
112 entry->size = (size < nr_bytes) ? size : nr_bytes; in suspend_nvs_register()
114 start += entry->size; in suspend_nvs_register()
115 size -= entry->size; in suspend_nvs_register()
120 list_for_each_entry_safe(entry, next, &nvs_list, node) { in suspend_nvs_register()
121 list_del(&entry->node); in suspend_nvs_register()
[all …]
|
| /linux/tools/perf/util/ |
| H A D | block-range.c | 19 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug() local
21 assert(old < entry->start); in block_range__debug()
22 assert(entry->start <= entry->end); /* single instruction block; jump to a jump */ in block_range__debug()
24 old = entry->end; in block_range__debug()
33 struct block_range *entry; in block_range__find() local
37 entry = rb_entry(parent, struct block_range, node); in block_range__find()
39 if (addr < entry->start) in block_range__find()
41 else if (addr > entry->end) in block_range__find()
44 return entry; in block_range__find()
81 struct block_range *next, *entry = NULL; block_range__create() local
[all...] |
| /linux/security/integrity/ima/ |
| H A D | ima_policy.c | 383 static void ima_lsm_free_rule(struct ima_rule_entry *entry) in ima_lsm_free_rule() argument
388 ima_filter_rule_free(entry->lsm[i].rule); in ima_lsm_free_rule()
389 kfree(entry->lsm[i].args_p); in ima_lsm_free_rule()
393 static void ima_free_rule(struct ima_rule_entry *entry) in ima_free_rule() argument
395 if (!entry) in ima_free_rule()
399 * entry->template->fields may be allocated in ima_parse_rule() but that in ima_free_rule()
403 kfree(entry->fsname); in ima_free_rule()
404 kfree(entry->fs_subtype); in ima_free_rule()
405 ima_free_rule_opt_list(entry->keyrings); in ima_free_rule()
406 ima_lsm_free_rule(entry); in ima_free_rule()
410 ima_lsm_copy_rule(struct ima_rule_entry * entry,gfp_t gfp) ima_lsm_copy_rule() argument
444 ima_lsm_update_rule(struct ima_rule_entry * entry) ima_lsm_update_rule() argument
468 ima_rule_contains_lsm_cond(struct ima_rule_entry * entry) ima_rule_contains_lsm_cond() argument
486 struct ima_rule_entry *entry, *e; ima_lsm_update_rules() local
758 struct ima_rule_entry *entry; ima_match_policy() local
826 struct ima_rule_entry *entry; ima_update_policy_flags() local
883 struct ima_rule_entry *entry; add_rules() local
1144 ima_lsm_rule_init(struct ima_rule_entry * entry,substring_t * args,int lsm_rule,int audit_type) ima_lsm_rule_init() argument
1256 ima_validate_rule(struct ima_rule_entry * entry) ima_validate_rule() argument
1424 ima_parse_rule(char * rule,struct ima_rule_entry * entry) ima_parse_rule() argument
1967 struct ima_rule_entry *entry; ima_parse_add_rule() local
2010 struct ima_rule_entry *entry, *tmp; ima_delete_rules() local
2040 struct ima_rule_entry *entry; ima_policy_start() local
2057 struct ima_rule_entry *entry = v; ima_policy_next() local
2114 struct ima_rule_entry *entry = v; ima_policy_show() local
2338 struct ima_rule_entry *entry; ima_appraise_signature() local
[all...] |
| /linux/fs/squashfs/ |
| H A D | cache.c | 56 struct squashfs_cache_entry *entry; in squashfs_cache_get() local
62 if (cache->entry[i].block == block) { in squashfs_cache_get()
84 * At least one unused cache entry. A simple in squashfs_cache_get()
85 * round-robin strategy is used to choose the entry to in squashfs_cache_get()
90 if (cache->entry[i].refcount == 0) in squashfs_cache_get()
96 entry = &cache->entry[i]; in squashfs_cache_get()
99 * Initialise chosen cache entry, and fill it in from in squashfs_cache_get()
103 entry->block = block; in squashfs_cache_get()
104 entry->refcount = 1; in squashfs_cache_get()
105 entry->pending = 1; in squashfs_cache_get()
[all …]
|
| /linux/lib/ |
| H A D | xarray.c | 24 * @index is the index of the entry being operated on
30 * @entry refers to something stored in a slot in the xarray
120 * xas_squash_marks() - Merge all marks to the first entry
123 * Set a mark on the first entry if any entry has it set. Clear marks on
184 void *entry; in xas_start() local
191 entry = xa_head(xas->xa); in xas_start()
192 if (!xa_is_node(entry)) { in xas_start()
196 if ((xas->xa_index >> xa_to_node(entry)->shift) > XA_CHUNK_MASK) in xas_start()
201 return entry; in xas_start()
208 void *entry = xa_entry(xas->xa, node, offset); in xas_descend() local
[all …]
|
| /linux/kernel/dma/ |
| H A D | debug.c | 171 static inline void dump_entry_trace(struct dma_debug_entry *entry) in dump_entry_trace() argument
174 if (entry) { in dump_entry_trace()
176 stack_trace_print(entry->stack_entries, entry->stack_len, 0); in dump_entry_trace()
222 #define err_printk(dev, entry, format, arg...) do { \ argument
229 dump_entry_trace(entry); \
241 static int hash_fn(struct dma_debug_entry *entry) in hash_fn() argument
247 return (entry->dev_addr >> HASH_FN_SHIFT) & HASH_FN_MASK; in hash_fn()
253 static struct hash_bucket *get_hash_bucket(struct dma_debug_entry *entry, in get_hash_bucket() argument
257 int idx = hash_fn(entry); in get_hash_bucket()
301 struct dma_debug_entry *entry, *ret = NULL; __hash_bucket_find() local
358 struct dma_debug_entry *entry, index = *ref; bucket_find_contain() local
382 hash_bucket_add(struct hash_bucket * bucket,struct dma_debug_entry * entry) hash_bucket_add() argument
390 hash_bucket_del(struct dma_debug_entry * entry) hash_bucket_del() argument
424 to_cacheline_number(struct dma_debug_entry * entry) to_cacheline_number() argument
477 active_cacheline_insert(struct dma_debug_entry * entry,bool * overlap_cache_clean) active_cacheline_insert() argument
510 active_cacheline_remove(struct dma_debug_entry * entry) active_cacheline_remove() argument
539 struct dma_debug_entry *entry; debug_dma_dump_mappings() local
571 struct dma_debug_entry *entry; dump_show() local
597 add_dma_entry(struct dma_debug_entry * entry,unsigned long attrs) add_dma_entry() argument
628 struct dma_debug_entry *entry; dma_debug_create_entries() local
646 struct dma_debug_entry *entry; __dma_entry_alloc() local
683 struct dma_debug_entry *entry; dma_entry_alloc() local
714 dma_entry_free(struct dma_debug_entry * entry) dma_entry_free() argument
850 struct dma_debug_entry *entry; device_dma_allocations() local
871 struct dma_debug_entry *entry; dma_debug_device_change() local
981 struct dma_debug_entry *entry; check_unmap() local
1120 struct dma_debug_entry *entry; check_sync() local
1234 struct dma_debug_entry *entry; debug_dma_map_phys() local
1274 struct dma_debug_entry *entry; debug_dma_mapping_error() local
1329 struct dma_debug_entry *entry; debug_dma_map_sg() local
1365 struct dma_debug_entry *entry; get_nr_mapped_entries() local
1428 struct dma_debug_entry *entry; debug_dma_alloc_coherent() local
1580 struct dma_debug_entry *entry; debug_dma_alloc_pages() local
[all...] |
| /linux/arch/x86/kvm/ |
| H A D | cpuid.c | 112 * If the index isn't significant, use the first entry with a in kvm_find_cpuid_entry2()
121 * Similarly, use the first matching entry if KVM is doing a in kvm_find_cpuid_entry2()
211 struct kvm_cpuid_entry2 *entry; in kvm_get_hypervisor_cpuid() local
215 entry = kvm_find_cpuid_entry(vcpu, base); in kvm_get_hypervisor_cpuid()
217 if (entry) { in kvm_get_hypervisor_cpuid()
220 signature[0] = entry->ebx; in kvm_get_hypervisor_cpuid()
221 signature[1] = entry->ecx; in kvm_get_hypervisor_cpuid()
222 signature[2] = entry->edx; in kvm_get_hypervisor_cpuid()
226 cpuid.limit = entry->eax; in kvm_get_hypervisor_cpuid()
281 struct kvm_cpuid_entry2 *entry, in kvm_update_feature_runtime() argument
329 struct kvm_cpuid_entry2 *entry; kvm_cpuid_has_hyperv() local
340 struct kvm_cpuid_entry2 *entry; guest_cpuid_is_amd_or_hygon() local
355 cpuid_get_reg_unsafe(struct kvm_cpuid_entry2 * entry,u32 reg) cpuid_get_reg_unsafe() argument
379 struct kvm_cpuid_entry2 *entry; kvm_vcpu_after_set_cpuid() local
677 struct kvm_cpuid_entry2 entry; raw_cpuid_get() local
1331 struct kvm_cpuid_entry2 *entry = get_next_cpuid(array); do_host_cpuid() local
1371 cpuid_func_emulated(struct kvm_cpuid_entry2 * entry,u32 func,bool include_partially_emulated) cpuid_func_emulated() argument
1419 struct kvm_cpuid_entry2 *entry; __do_cpuid_func() local
2092 struct kvm_cpuid_entry2 *entry; kvm_cpuid() local
[all...] |
| /linux/drivers/net/ethernet/marvell/mvpp2/ |
| H A D | mvpp2_debugfs.c | 60 struct mvpp2_dbgfs_flow_tbl_entry *entry = s->private; in mvpp2_dbgfs_flow_flt_hits_show() local
62 u32 hits = mvpp2_cls_flow_hits(entry->priv, entry->id); in mvpp2_dbgfs_flow_flt_hits_show()
73 struct mvpp2_dbgfs_flow_entry *entry = s->private; in mvpp2_dbgfs_flow_dec_hits_show() local
75 u32 hits = mvpp2_cls_lookup_hits(entry->priv, entry->flow); in mvpp2_dbgfs_flow_dec_hits_show()
86 struct mvpp2_dbgfs_flow_entry *entry = s->private; in mvpp2_dbgfs_flow_type_show() local
90 f = mvpp2_cls_flow_get(entry->flow); in mvpp2_dbgfs_flow_type_show()
126 const struct mvpp2_dbgfs_flow_entry *entry = s->private; in mvpp2_dbgfs_flow_id_show() local
129 f = mvpp2_cls_flow_get(entry->flow); in mvpp2_dbgfs_flow_id_show()
142 struct mvpp2_dbgfs_port_flow_entry *entry = s->private; in mvpp2_dbgfs_port_flow_hash_opt_show() local
143 struct mvpp2_port *port = entry->port; in mvpp2_dbgfs_port_flow_hash_opt_show()
[all …]
|
| /linux/drivers/gpio/ |
| H A D | gpiolib-shared.c | 71 struct gpio_shared_entry *entry; in gpio_shared_find_entry() local
73 list_for_each_entry(entry, &gpio_shared_list, list) { in gpio_shared_find_entry()
74 if (entry->fwnode == controller_node && entry->offset == offset) in gpio_shared_find_entry()
75 return entry; in gpio_shared_find_entry()
110 static int gpio_shared_setup_reset_proxy(struct gpio_shared_entry *entry, in gpio_shared_setup_reset_proxy() argument
115 list_for_each_entry(ref, &entry->refs, list) { in gpio_shared_setup_reset_proxy()
127 list_add_tail(&ref->list, &entry->refs); in gpio_shared_setup_reset_proxy()
130 entry->offset, fwnode_get_name(entry->fwnode)); in gpio_shared_setup_reset_proxy()
161 struct gpio_shared_entry *entry; in gpio_shared_of_traverse() local
228 entry = gpio_shared_find_entry(fwnode, offset); in gpio_shared_of_traverse()
[all …]
|
| /linux/drivers/net/dsa/microchip/ |
| H A D | ksz9477_acl.c | 117 * ksz9477_dump_acl_index - Print the ACL entry at the specified index
120 * @acle: Pointer to the ACL entry array.
121 * @index: The index of the ACL entry to print.
123 * This function prints the details of an ACL entry, located at a particular
127 * Return: 1 if the entry is non-empty and printed, 0 otherwise.
134 u8 *entry; in ksz9477_dump_acl_index() local
137 entry = &acle[index].entry[0]; in ksz9477_dump_acl_index()
139 if (entry[i]) in ksz9477_dump_acl_index()
142 sprintf(buf + (i * 3), "%02x ", entry[i]); in ksz9477_dump_acl_index()
149 dev_err(dev->dev, " Entry %02d, prio: %02d : %s", index, in ksz9477_dump_acl_index()
[all …]
|
| /linux/fs/ceph/ |
| H A D | subvolume_metrics.c | 61 struct ceph_subvol_metric_rb_entry *entry = in __lookup_entry() local
64 if (subvol_id < entry->subvolume_id) in __lookup_entry()
66 else if (subvol_id > entry->subvolume_id) in __lookup_entry()
69 return entry; in __lookup_entry()
77 struct ceph_subvol_metric_rb_entry *entry) in __insert_entry() argument
88 if (entry->subvolume_id < cur->subvolume_id) in __insert_entry()
90 else if (entry->subvolume_id > cur->subvolume_id) { in __insert_entry()
97 rb_link_node(&entry->node, parent, link); in __insert_entry()
98 rb_insert_color_cached(&entry->node, &tracker->tree, leftmost); in __insert_entry()
100 return entry; in __insert_entry()
[all …]
|
| /linux/drivers/net/ethernet/marvell/prestera/ |
| H A D | prestera_span.c | 28 struct prestera_span_entry *entry; in prestera_span_entry_create() local
30 entry = kzalloc_obj(*entry); in prestera_span_entry_create()
31 if (!entry) in prestera_span_entry_create()
34 refcount_set(&entry->ref_count, 1); in prestera_span_entry_create()
35 entry->port = port; in prestera_span_entry_create()
36 entry->id = span_id; in prestera_span_entry_create()
37 list_add_tail(&entry->list, &port->sw->span->entries); in prestera_span_entry_create()
39 return entry; in prestera_span_entry_create()
42 static void prestera_span_entry_del(struct prestera_span_entry *entry) in prestera_span_entry_del() argument
44 list_del(&entry->list); in prestera_span_entry_del()
[all …]
|
| /linux/drivers/infiniband/core/ |
| H A D | ib_core_uverbs.c | 21 * @entry: entry into the mmap_xa that needs to be linked with
37 struct rdma_user_mmap_entry *entry) in rdma_umap_priv_init() argument
42 if (entry) { in rdma_umap_priv_init()
43 kref_get(&entry->ref); in rdma_umap_priv_init()
44 priv->entry = entry; in rdma_umap_priv_init()
63 * @entry: mmap_entry retrieved from rdma_user_mmap_entry_get(), or NULL
74 struct rdma_user_mmap_entry *entry) in rdma_user_mmap_io() argument
101 rdma_umap_priv_init(priv, vma, entry); in rdma_user_mmap_io()
125 struct rdma_user_mmap_entry *entry; rdma_user_mmap_entry_get_pgoff() local
169 struct rdma_user_mmap_entry *entry; rdma_user_mmap_entry_get() local
186 struct rdma_user_mmap_entry *entry = rdma_user_mmap_entry_free() local
219 rdma_user_mmap_entry_put(struct rdma_user_mmap_entry * entry) rdma_user_mmap_entry_put() argument
235 rdma_user_mmap_entry_remove(struct rdma_user_mmap_entry * entry) rdma_user_mmap_entry_remove() argument
285 rdma_user_mmap_entry_insert_range(struct ib_ucontext * ucontext,struct rdma_user_mmap_entry * entry,size_t length,u32 min_pgoff,u32 max_pgoff) rdma_user_mmap_entry_insert_range() argument
386 rdma_user_mmap_entry_insert(struct ib_ucontext * ucontext,struct rdma_user_mmap_entry * entry,size_t length) rdma_user_mmap_entry_insert() argument
[all...] |