Home
last modified time | relevance | path

Searched refs:entry (Results 1 – 25 of 116) sorted by relevance

12345

/include/linux/
A Dswapops.h150 arch_entry = __swp_entry(swp_type(entry), swp_offset(entry)); in swp_entry_to_pte()
156 swp_entry_t entry; in radix_to_swp_entry() local
159 return entry; in radix_to_swp_entry()
180 int type = swp_type(entry); in is_device_private_entry()
289 return entry; in make_migration_entry_young()
305 return entry; in make_migration_entry_dirty()
355 return entry; in make_migration_entry_young()
365 return entry; in make_migration_entry_dirty()
527 return is_migration_entry(entry) || is_device_private_entry(entry) || in is_pfn_swap_entry()
528 is_device_exclusive_entry(entry) || is_hwpoison_entry(entry); in is_pfn_swap_entry()
[all …]
A Dresource_ext.h37 list_add(&entry->node, head); in resource_list_add()
43 list_add_tail(&entry->node, head); in resource_list_add_tail()
48 list_del(&entry->node); in resource_list_del()
53 kfree(entry); in resource_list_free_entry()
59 resource_list_del(entry); in resource_list_destroy_entry()
60 resource_list_free_entry(entry); in resource_list_destroy_entry()
64 list_for_each_entry((entry), (list), node)
72 struct resource_entry *entry; in resource_list_first_type() local
74 resource_list_for_each_entry(entry, list) { in resource_list_first_type()
75 if (resource_type(entry->res) == type) in resource_list_first_type()
[all …]
A Dbpf_mprog.h116 for (fp = &entry->fp_items[0], cp = &entry->parent->cp_items[0];\
161 if (entry == &entry->parent->a) in bpf_mprog_peer()
162 return &entry->parent->b; in bpf_mprog_peer()
164 return &entry->parent->a; in bpf_mprog_peer()
181 entry->parent->count++; in bpf_mprog_inc()
186 entry->parent->count--; in bpf_mprog_dec()
231 if (entry->parent->ref) { in bpf_mprog_complete_release()
233 entry->parent->ref = NULL; in bpf_mprog_complete_release()
280 entry->fp_items + idx, in bpf_mprog_entry_grow()
296 entry->fp_items + idx + 1, in bpf_mprog_entry_shrink()
[all …]
A Dxarray.h644 void *entry; in xa_erase_bh() local
650 return entry; in xa_erase_bh()
668 void *entry; in xa_erase_irq() local
674 return entry; in xa_erase_irq()
1318 return xa_is_internal(entry) && (entry <= XA_RETRY_ENTRY); in xa_is_advanced()
1617 void *entry; in xas_reload() local
1720 void *entry; in xas_next_entry() local
1778 void *entry; in xas_next_marked() local
1791 if (!entry) in xas_next_marked()
1818 for (entry = xas_find(xas, max); entry; \
[all …]
A Dmbcache.h46 struct mb_cache_entry *entry);
47 void mb_cache_entry_wait_unused(struct mb_cache_entry *entry);
49 struct mb_cache_entry *entry) in mb_cache_entry_put() argument
51 unsigned int cnt = atomic_dec_return(&entry->e_refcnt); in mb_cache_entry_put()
55 wake_up_var(&entry->e_refcnt); in mb_cache_entry_put()
58 __mb_cache_entry_free(cache, entry); in mb_cache_entry_put()
68 struct mb_cache_entry *entry);
70 struct mb_cache_entry *entry);
A Djump_label.h126 return (unsigned long)&entry->code + entry->code; in jump_entry_code()
131 return (unsigned long)&entry->target + entry->target; in jump_entry_target()
136 long offset = entry->key & ~3L; in jump_entry_key()
145 return entry->code; in jump_entry_code()
150 return entry->target; in jump_entry_target()
162 return (unsigned long)entry->key & 1UL; in jump_entry_is_branch()
167 return (unsigned long)entry->key & 2UL; in jump_entry_is_init()
173 entry->key |= 2; in jump_entry_set_init()
175 entry->key &= ~2; in jump_entry_set_init()
178 static inline int jump_entry_size(struct jump_entry *entry) in jump_entry_size() argument
[all …]
A Dswap.h357 swp_entry_t entry = folio->swap; in page_swap_entry() local
359 entry.val += folio_page_idx(folio, page); in page_swap_entry()
360 return entry; in page_swap_entry()
507 extern int __swap_count(swp_entry_t entry);
509 extern int swp_swapcount(swp_entry_t entry);
619 free_swap_and_cache_nr(entry, 1); in free_swap_and_cache()
622 static inline void swap_free(swp_entry_t entry) in swap_free() argument
624 swap_free_nr(entry, 1); in swap_free()
664 swp_entry_t entry) in mem_cgroup_try_charge_swap() argument
676 __mem_cgroup_uncharge_swap(entry, nr_pages); in mem_cgroup_uncharge_swap()
[all …]
A Dlist.h119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
209 __list_del(entry->prev, entry->next); in __list_del_clearprev()
210 entry->prev = NULL; in __list_del_clearprev()
218 __list_del(entry->prev, entry->next); in __list_del_entry()
288 INIT_LIST_HEAD(entry); in list_del_init()
390 WRITE_ONCE(entry->prev, entry); in list_del_init_careful()
391 smp_store_release(&entry->next, entry); in list_del_init_careful()
460 list->prev = entry; in __list_cut_position()
461 entry->next = list; in __list_cut_position()
519 head->next = entry; in list_cut_before()
[all …]
A Didr.h204 #define idr_for_each_entry(idr, entry, id) \ argument
205 for (id = 0; ((entry) = idr_get_next(idr, &(id))) != NULL; id += 1U)
218 #define idr_for_each_entry_ul(idr, entry, tmp, id) \ argument
220 ((entry) = tmp <= id ? idr_get_next_ul(idr, &(id)) : NULL) != NULL; \
231 #define idr_for_each_entry_continue(idr, entry, id) \ argument
232 for ((entry) = idr_get_next((idr), &(id)); \
233 entry; \
234 ++id, (entry) = idr_get_next((idr), &(id)))
247 #define idr_for_each_entry_continue_ul(idr, entry, tmp, id) \ argument
249 ((entry) = tmp <= id ? idr_get_next_ul(idr, &(id)) : NULL) != NULL; \
A Dmaple_tree.h329 void *entry, gfp_t gfp);
331 unsigned long last, void *entry, gfp_t gfp);
333 void *entry, unsigned long size, unsigned long min,
336 void *entry, unsigned long range_lo, unsigned long range_hi,
339 void *entry, unsigned long size, unsigned long min,
343 unsigned long last, void *entry, gfp_t gfp);
345 void *entry, gfp_t gfp);
464 void *entry; /* The entry to write */ member
502 .entry = wr_entry, \
515 void *mas_store(struct ma_state *mas, void *entry);
[all …]
A Dpldmfw.h20 struct list_head entry; member
59 struct list_head entry; member
92 struct list_head entry; member
/include/net/
A Dtcx.h35 struct bpf_mprog_bundle *bundle = entry->parent; in tcx_entry()
62 rcu_assign_pointer(dev->tcx_ingress, entry); in tcx_entry_update()
64 rcu_assign_pointer(dev->tcx_egress, entry); in tcx_entry_update()
91 kfree_rcu(tcx_entry(entry), rcu); in tcx_entry_free()
100 if (!entry) { in tcx_entry_fetch_or_create()
101 entry = tcx_entry_create(); in tcx_entry_fetch_or_create()
102 if (!entry) in tcx_entry_fetch_or_create()
106 return entry; in tcx_entry_fetch_or_create()
130 tcx_entry(entry)->miniq_active++; in tcx_miniq_inc()
136 tcx_entry(entry)->miniq_active--; in tcx_miniq_dec()
[all …]
/include/sound/
A Dinfo.h30 void (*read)(struct snd_info_entry *entry,
32 void (*write)(struct snd_info_entry *entry,
37 int (*open)(struct snd_info_entry *entry,
39 int (*release)(struct snd_info_entry *entry,
47 loff_t (*llseek)(struct snd_info_entry *entry,
50 __poll_t (*poll)(struct snd_info_entry *entry,
72 void (*private_free)(struct snd_info_entry *entry);
127 int snd_info_register(struct snd_info_entry *entry);
141 entry->private_data = private_data; in snd_info_set_text_ops()
142 entry->c.text.read = read; in snd_info_set_text_ops()
[all …]
/include/net/tc_act/
A Dtc_gate.h104 struct tcfg_gate_entry *entry; in tcf_gate_get_list() local
111 list_for_each_entry(entry, &p->entries, list) in tcf_gate_get_list()
122 list_for_each_entry(entry, &p->entries, list) { in tcf_gate_get_list()
123 oe[i].gate_state = entry->gate_state; in tcf_gate_get_list()
124 oe[i].interval = entry->interval; in tcf_gate_get_list()
125 oe[i].ipv = entry->ipv; in tcf_gate_get_list()
126 oe[i].maxoctets = entry->maxoctets; in tcf_gate_get_list()
/include/linux/netfilter_ipv4/
A Dip_tables.h34 struct ipt_entry entry; member
39 struct ipt_entry entry; member
51 .entry = IPT_ENTRY_INIT(sizeof(struct ipt_standard)), \
59 .entry = IPT_ENTRY_INIT(sizeof(struct ipt_error)), \
/include/linux/netfilter_arp/
A Darp_tables.h20 struct arpt_entry entry; member
25 struct arpt_entry entry; member
37 .entry = ARPT_ENTRY_INIT(sizeof(struct arpt_standard)), \
45 .entry = ARPT_ENTRY_INIT(sizeof(struct arpt_error)), \
/include/drm/
A Ddrm_gpuvm.h122 struct list_head entry; member
141 struct list_head entry; member
430 if (va && !list_is_last(&va->rb.entry, &va->vm->rb.list)) in __drm_gpuva_next()
431 return list_next_entry(va, rb.entry); in __drm_gpuva_next()
490 list_for_each_entry(va__, &(gpuvm__)->rb.list, rb.entry)
703 } entry; member
953 struct list_head entry; member
1012 list_for_each_entry_safe(op, next, &(ops)->list, entry)
1033 list_for_each_entry_reverse(op, &(ops)->list, entry)
1053 #define drm_gpuva_prev_op(op) list_prev_entry(op, entry)
[all …]
/include/uapi/linux/
A Dnexthop.h23 static inline __u16 nexthop_grp_weight(const struct nexthop_grp *entry) in nexthop_grp_weight() argument
25 return ((entry->weight_high << 8) | entry->weight) + 1; in nexthop_grp_weight()
/include/trace/
A Dperf.h22 struct trace_event_raw_##call *entry; \
39 __entry_size = ALIGN(__data_size + sizeof(*entry) + sizeof(u32),\
43 entry = perf_trace_buf_alloc(__entry_size, &__regs, &rctx); \
44 if (!entry) \
53 perf_trace_run_bpf_submit(entry, __entry_size, rctx, \
A Dtrace_custom_events.h126 struct trace_custom_event_raw_##call __maybe_unused *entry; \
148 struct trace_custom_event_raw_##call *entry; \
156 entry = trace_event_buffer_reserve(&fbuffer, trace_file, \
157 sizeof(*entry) + __data_size); \
159 if (!entry) \
/include/uapi/linux/netfilter/
A Dx_tables.h180 #define xt_ematch_foreach(pos, entry) \ argument
181 for ((pos) = (struct xt_entry_match *)entry->elems; \
182 (pos) < (struct xt_entry_match *)((char *)(entry) + \
183 (entry)->target_offset); \
/include/uapi/linux/netfilter_ipv6/
A Dip6_tables.h133 struct ip6t_entry entry; member
138 struct ip6t_entry entry; member
150 .entry = IP6T_ENTRY_INIT(sizeof(struct ip6t_standard)), \
158 .entry = IP6T_ENTRY_INIT(sizeof(struct ip6t_error)), \
/include/trace/stages/
A Dstage5_get_offsets.h10 #define __entry entry
54 offsetof(typeof(*entry), __data); \
75 offsetof(typeof(*entry), __data) - \
76 offsetof(typeof(*entry), __rel_loc_##item) - \
/include/linux/net/intel/
A Diidc_rdma_ice.h66 struct msix_entry *entry);
68 struct msix_entry *entry);
/include/linux/platform_data/x86/
A Dsimatic-ipc.h49 u8 entry; in simatic_ipc_get_station_id() member
58 data_entry->entry == SIMATIC_IPC_DMI_ENTRY && in simatic_ipc_get_station_id()

Completed in 53 milliseconds

12345