Home
last modified time | relevance | path

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

1234

/include/linux/
Dresource_ext.h34 static inline void resource_list_add(struct resource_entry *entry, in resource_list_add() argument
37 list_add(&entry->node, head); in resource_list_add()
40 static inline void resource_list_add_tail(struct resource_entry *entry, in resource_list_add_tail() argument
43 list_add_tail(&entry->node, head); in resource_list_add_tail()
46 static inline void resource_list_del(struct resource_entry *entry) in resource_list_del() argument
48 list_del(&entry->node); in resource_list_del()
51 static inline void resource_list_free_entry(struct resource_entry *entry) in resource_list_free_entry() argument
53 kfree(entry); in resource_list_free_entry()
57 resource_list_destroy_entry(struct resource_entry *entry) in resource_list_destroy_entry() argument
59 resource_list_del(entry); in resource_list_destroy_entry()
[all …]
Dswapops.h51 static inline unsigned swp_type(swp_entry_t entry) in swp_type() argument
53 return (entry.val >> SWP_TYPE_SHIFT); in swp_type()
60 static inline pgoff_t swp_offset(swp_entry_t entry) in swp_offset() argument
62 return entry.val & SWP_OFFSET_MASK; in swp_offset()
88 static inline pte_t swp_entry_to_pte(swp_entry_t entry) in swp_entry_to_pte() argument
92 arch_entry = __swp_entry(swp_type(entry), swp_offset(entry)); in swp_entry_to_pte()
98 swp_entry_t entry; in radix_to_swp_entry() local
100 entry.val = xa_to_value(arg); in radix_to_swp_entry()
101 return entry; in radix_to_swp_entry()
104 static inline void *swp_to_radix_entry(swp_entry_t entry) in swp_to_radix_entry() argument
[all …]
Dxarray.h65 static inline unsigned long xa_to_value(const void *entry) in xa_to_value() argument
67 return (unsigned long)entry >> 1; in xa_to_value()
77 static inline bool xa_is_value(const void *entry) in xa_is_value() argument
79 return (unsigned long)entry & 1; in xa_is_value()
110 static inline void *xa_untag_pointer(void *entry) in xa_untag_pointer() argument
112 return (void *)((unsigned long)entry & ~3UL); in xa_untag_pointer()
125 static inline unsigned int xa_pointer_tag(void *entry) in xa_pointer_tag() argument
127 return (unsigned long)entry & 3UL; in xa_pointer_tag()
155 static inline unsigned long xa_to_internal(const void *entry) in xa_to_internal() argument
157 return (unsigned long)entry >> 2; in xa_to_internal()
[all …]
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()
69 struct mb_cache_entry *entry);
71 struct mb_cache_entry *entry);
Djump_label.h128 static inline unsigned long jump_entry_code(const struct jump_entry *entry) in jump_entry_code() argument
130 return (unsigned long)&entry->code + entry->code; in jump_entry_code()
133 static inline unsigned long jump_entry_target(const struct jump_entry *entry) in jump_entry_target() argument
135 return (unsigned long)&entry->target + entry->target; in jump_entry_target()
138 static inline struct static_key *jump_entry_key(const struct jump_entry *entry) in jump_entry_key() argument
140 long offset = entry->key & ~3L; in jump_entry_key()
142 return (struct static_key *)((unsigned long)&entry->key + offset); in jump_entry_key()
147 static inline unsigned long jump_entry_code(const struct jump_entry *entry) in jump_entry_code() argument
149 return entry->code; in jump_entry_code()
152 static inline unsigned long jump_entry_target(const struct jump_entry *entry) in jump_entry_target() argument
[all …]
Dswap.h442 #define swap_address_space(entry) \ argument
443 (&swapper_spaces[swp_type(entry)][swp_offset(entry) \
452 extern void *get_shadow_from_swap_cache(swp_entry_t entry);
453 extern int add_to_swap_cache(struct page *page, swp_entry_t entry,
456 swp_entry_t entry, void *shadow);
463 extern struct page *lookup_swap_cache(swp_entry_t entry,
473 extern struct page *swap_cluster_readahead(swp_entry_t entry, gfp_t flag,
475 extern struct page *swapin_readahead(swp_entry_t entry, gfp_t flag,
497 extern void put_swap_page(struct page *page, swp_entry_t entry);
512 extern int __swap_count(swp_entry_t entry);
[all …]
Dlist.h43 extern bool __list_del_entry_valid(struct list_head *entry);
51 static inline bool __list_del_entry_valid(struct list_head *entry) in __list_del_entry_valid() argument
124 static inline void __list_del_clearprev(struct list_head *entry) in __list_del_clearprev() argument
126 __list_del(entry->prev, entry->next); in __list_del_clearprev()
127 entry->prev = NULL; in __list_del_clearprev()
130 static inline void __list_del_entry(struct list_head *entry) in __list_del_entry() argument
132 if (!__list_del_entry_valid(entry)) in __list_del_entry()
135 __list_del(entry->prev, entry->next); in __list_del_entry()
144 static inline void list_del(struct list_head *entry) in list_del() argument
146 __list_del_entry(entry); in list_del()
[all …]
Didr.h187 #define idr_for_each_entry(idr, entry, id) \ argument
188 for (id = 0; ((entry) = idr_get_next(idr, &(id))) != NULL; id += 1U)
201 #define idr_for_each_entry_ul(idr, entry, tmp, id) \ argument
203 ((entry) = tmp <= id ? idr_get_next_ul(idr, &(id)) : NULL) != NULL; \
214 #define idr_for_each_entry_continue(idr, entry, id) \ argument
215 for ((entry) = idr_get_next((idr), &(id)); \
216 entry; \
217 ++id, (entry) = idr_get_next((idr), &(id)))
230 #define idr_for_each_entry_continue_ul(idr, entry, tmp, id) \ argument
232 ((entry) = tmp <= id ? idr_get_next_ul(idr, &(id)) : NULL) != NULL; \
Dpldmfw.h20 struct list_head entry; member
59 struct list_head entry; member
92 struct list_head entry; member
Dswap_slots.h28 int free_swap_slot(swp_entry_t entry);
Dtimer.h17 struct hlist_node entry; member
81 .entry = { .next = TIMER_ENTRY_STATIC }, \
172 return !hlist_unhashed_lockless(&timer->entry); in timer_pending()
Dworkqueue.h101 struct list_head entry; member
188 .entry = { &(n).entry, &(n).entry }, \
238 INIT_LIST_HEAD(&(_work)->entry); \
246 INIT_LIST_HEAD(&(_work)->entry); \
Dwait.h34 struct list_head entry; member
52 .entry = { NULL, NULL } }
176 list_for_each_entry(wq, &wq_head->head, entry) { in __add_wait_queue()
179 head = &wq->entry; in __add_wait_queue()
181 list_add(&wq_entry->entry, head); in __add_wait_queue()
196 list_add_tail(&wq_entry->entry, &wq_head->head); in __add_wait_queue_entry_tail()
209 list_del(&wq_entry->entry); in __remove_wait_queue()
1178 .entry = LIST_HEAD_INIT((name).entry), \
1187 INIT_LIST_HEAD(&(wait)->entry); \
/include/sound/
Dinfo.h31 void (*read)(struct snd_info_entry *entry,
33 void (*write)(struct snd_info_entry *entry,
38 int (*open)(struct snd_info_entry *entry,
40 int (*release)(struct snd_info_entry *entry,
42 ssize_t (*read)(struct snd_info_entry *entry, void *file_private_data,
45 ssize_t (*write)(struct snd_info_entry *entry, void *file_private_data,
48 loff_t (*llseek)(struct snd_info_entry *entry,
51 __poll_t (*poll)(struct snd_info_entry *entry,
54 int (*ioctl)(struct snd_info_entry *entry, void *file_private_data,
56 int (*mmap)(struct snd_info_entry *entry, void *file_private_data,
[all …]
/include/linux/netfilter_arp/
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/net/tc_act/
Dtc_gate.h118 struct tcfg_gate_entry *entry; in tcf_gate_get_list() local
125 list_for_each_entry(entry, &p->entries, list) in tcf_gate_get_list()
136 list_for_each_entry(entry, &p->entries, list) { in tcf_gate_get_list()
137 oe[i].gate_state = entry->gate_state; in tcf_gate_get_list()
138 oe[i].interval = entry->interval; in tcf_gate_get_list()
139 oe[i].ipv = entry->ipv; in tcf_gate_get_list()
140 oe[i].maxoctets = entry->maxoctets; in tcf_gate_get_list()
/include/trace/hooks/
Dtmpfile.h17 TP_PROTO(struct fuse_args *args, struct dentry **d, struct dentry *entry,
19 TP_ARGS(args, d, entry, inode, skip_splice), 1);
21 TP_PROTO(struct inode *dir, struct dentry *entry, umode_t mode,
25 TP_ARGS(dir, entry, mode, f, ret), 1);
/include/linux/netfilter_ipv4/
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/trace/
Dperf.h8 #define __entry entry
60 struct trace_event_raw_##call *entry; \
77 __entry_size = ALIGN(__data_size + sizeof(*entry) + sizeof(u32),\
81 entry = perf_trace_buf_alloc(__entry_size, &__regs, &rctx); \
82 if (!entry) \
91 perf_trace_run_bpf_submit(entry, __entry_size, rctx, \
/include/uapi/linux/netfilter/
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/
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/net/netfilter/
Dnf_queue.h31 int (*outfn)(struct nf_queue_entry *entry,
38 void nf_reinject(struct nf_queue_entry *entry, unsigned int verdict);
40 bool nf_queue_entry_get_refs(struct nf_queue_entry *entry);
41 void nf_queue_entry_free(struct nf_queue_entry *entry);
/include/linux/netfilter_bridge/
Debtables.h27 bool (*checkentry)(const char *table, const void *entry,
44 bool (*checkentry)(const char *table, const void *entry,
62 bool (*checkentry)(const char *table, const void *entry,
/include/trace/events/
Dtask.h49 memcpy(entry->oldcomm, task->comm, TASK_COMM_LEN);
50 strlcpy(entry->newcomm, comm, TASK_COMM_LEN);
/include/drm/
Ddrm_mm.h361 #define drm_mm_for_each_node(entry, mm) \ argument
362 list_for_each_entry(entry, drm_mm_nodes(mm), node_list)
373 #define drm_mm_for_each_node_safe(entry, next, mm) \ argument
374 list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list)

1234