| /include/linux/ |
| D | freelist.h | 30 static inline void __freelist_add(struct freelist_node *node, struct freelist_head *list) in __freelist_add() argument
46 struct freelist_node *head = READ_ONCE(list->head); in __freelist_add()
52 if (!try_cmpxchg_release(&list->head, &head, node)) { in __freelist_add()
64 static inline void freelist_add(struct freelist_node *node, struct freelist_head *list) in freelist_add() argument
75 __freelist_add(node, list); in freelist_add()
79 static inline struct freelist_node *freelist_try_get(struct freelist_head *list) in freelist_try_get() argument
81 struct freelist_node *prev, *next, *head = smp_load_acquire(&list->head); in freelist_try_get()
89 head = smp_load_acquire(&list->head); in freelist_try_get()
99 if (try_cmpxchg_acquire(&list->head, &head, next)) { in freelist_try_get()
123 __freelist_add(prev, list); in freelist_try_get()
|
| D | list.h | 33 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
36 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD()
213 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
215 __list_del_entry(list); in list_move()
216 list_add(list, head); in list_move()
224 static inline void list_move_tail(struct list_head *list, in list_move_tail() argument
227 __list_del_entry(list); in list_move_tail()
228 list_add_tail(list, head); in list_move_tail()
259 static inline int list_is_first(const struct list_head *list, const struct list_head *head) in list_is_first() argument
[all …]
|
| D | damon.h | 54 struct list_head list; member
78 struct list_head list; member
254 struct list_head list; member
420 return container_of(r->list.next, struct damon_region, list); in damon_next_region()
425 return container_of(r->list.prev, struct damon_region, list); in damon_prev_region()
430 return list_last_entry(&t->regions_list, struct damon_region, list); in damon_last_region()
434 list_for_each_entry(r, &t->regions_list, list)
437 list_for_each_entry_safe(r, next, &t->regions_list, list)
440 list_for_each_entry(t, &(ctx)->adaptive_targets, list)
443 list_for_each_entry_safe(t, next, &(ctx)->adaptive_targets, list)
[all …]
|
| D | resource_ext.h | 63 #define resource_list_for_each_entry(entry, list) \ argument
64 list_for_each_entry((entry), (list), node)
66 #define resource_list_for_each_entry_safe(entry, tmp, list) \ argument
67 list_for_each_entry_safe((entry), (tmp), (list), node)
70 resource_list_first_type(struct list_head *list, unsigned long type) in resource_list_first_type() argument
74 resource_list_for_each_entry(entry, list) { in resource_list_first_type()
|
| D | kcore.h | 17 struct list_head list; member
24 struct list_head list; member
31 struct list_head list; /* List of dumps */ member
|
| D | rculist.h | 22 static inline void INIT_LIST_HEAD_RCU(struct list_head *list) in INIT_LIST_HEAD_RCU() argument
24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) argument
226 static inline void __list_splice_init_rcu(struct list_head *list, in __list_splice_init_rcu() argument
231 struct list_head *first = list->next; in __list_splice_init_rcu()
232 struct list_head *last = list->prev; in __list_splice_init_rcu()
240 INIT_LIST_HEAD_RCU(list); in __list_splice_init_rcu()
274 static inline void list_splice_init_rcu(struct list_head *list, in list_splice_init_rcu() argument
278 if (!list_empty(list)) in list_splice_init_rcu()
[all …]
|
| D | devfreq.h | 254 unsigned int list);
257 unsigned int list);
261 unsigned int list);
265 unsigned int list);
394 unsigned int list) in devfreq_register_notifier() argument
401 unsigned int list) in devfreq_unregister_notifier() argument
409 unsigned int list) in devm_devfreq_register_notifier() argument
417 unsigned int list) in devm_devfreq_unregister_notifier() argument
|
| D | rhashtable.h | 554 #define rhl_for_each_rcu(pos, list) \ argument
555 for (pos = list; pos; pos = rcu_dereference_raw(pos->next))
567 #define rhl_for_each_entry_rcu(tpos, pos, list, member) \ argument
568 for (pos = list; pos && rht_entry(tpos, pos, member); \
734 struct rhlist_head *list; in __rhashtable_insert_fast() local
751 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
754 RCU_INIT_POINTER(list->next, plist); in __rhashtable_insert_fast()
756 RCU_INIT_POINTER(list->rhead.next, head); in __rhashtable_insert_fast()
781 struct rhlist_head *list; in __rhashtable_insert_fast() local
783 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
[all …]
|
| D | kvm_irqfd.h | 29 struct list_head list; member
57 struct list_head list; member
|
| D | dmi.h | 83 struct list_head list; member
100 extern int dmi_check_system(const struct dmi_system_id *list);
101 const struct dmi_system_id *dmi_first_match(const struct dmi_system_id *list);
121 static inline int dmi_check_system(const struct dmi_system_id *list) { return 0; } in dmi_check_system() argument
150 dmi_first_match(const struct dmi_system_id *list) { return NULL; } in dmi_first_match() argument
|
| D | list_lru.h | 29 struct list_head list; member
55 struct list_head list; member
137 void list_lru_isolate(struct list_lru_one *list, struct list_head *item);
138 void list_lru_isolate_move(struct list_lru_one *list, struct list_head *item,
142 struct list_lru_one *list, spinlock_t *lock, void *cb_arg);
|
| D | parman.h | 45 struct list_head list; member
50 struct list_head list; member
|
| D | xattr.h | 34 bool (*list)(struct dentry *dentry); member
55 ssize_t vfs_listxattr(struct dentry *d, char *list, size_t size);
88 struct list_head list; member
110 list_for_each_entry_safe(xattr, node, &xattrs->head, list) { in simple_xattrs_free()
|
| D | skbuff.h | 782 struct list_head list; member
1620 __list_del_entry(&skb->list); in skb_list_del_init()
1630 static inline int skb_queue_empty(const struct sk_buff_head *list) in skb_queue_empty() argument
1632 return list->next == (const struct sk_buff *) list; in skb_queue_empty()
1642 static inline bool skb_queue_empty_lockless(const struct sk_buff_head *list) in skb_queue_empty_lockless() argument
1644 return READ_ONCE(list->next) == (const struct sk_buff *) list; in skb_queue_empty_lockless()
1655 static inline bool skb_queue_is_last(const struct sk_buff_head *list, in skb_queue_is_last() argument
1658 return skb->next == (const struct sk_buff *) list; in skb_queue_is_last()
1668 static inline bool skb_queue_is_first(const struct sk_buff_head *list, in skb_queue_is_first() argument
1671 return skb->prev == (const struct sk_buff *) list; in skb_queue_is_first()
[all …]
|
| D | signal_types.h | 23 struct list_head list; member
33 struct list_head list; member
|
| /include/rdma/ |
| D | mr_pool.h | 10 struct ib_mr *ib_mr_pool_get(struct ib_qp *qp, struct list_head *list);
11 void ib_mr_pool_put(struct ib_qp *qp, struct list_head *list, struct ib_mr *mr);
13 int ib_mr_pool_init(struct ib_qp *qp, struct list_head *list, int nr,
15 void ib_mr_pool_destroy(struct ib_qp *qp, struct list_head *list);
|
| /include/net/netfilter/ |
| D | nf_conntrack_count.h | 28 int nf_conncount_add(struct net *net, struct nf_conncount_list *list,
32 void nf_conncount_list_init(struct nf_conncount_list *list);
35 struct nf_conncount_list *list);
37 void nf_conncount_cache_free(struct nf_conncount_list *list);
|
| /include/uapi/linux/ |
| D | tipc_config.h | 323 static inline void TLV_LIST_INIT(struct tlv_list_desc *list, in TLV_LIST_INIT() argument
326 list->tlv_ptr = (struct tlv_desc *)data; in TLV_LIST_INIT()
327 list->tlv_space = space; in TLV_LIST_INIT()
330 static inline int TLV_LIST_EMPTY(struct tlv_list_desc *list) in TLV_LIST_EMPTY() argument
332 return (list->tlv_space == 0); in TLV_LIST_EMPTY()
335 static inline int TLV_LIST_CHECK(struct tlv_list_desc *list, __u16 exp_type) in TLV_LIST_CHECK() argument
337 return TLV_CHECK(list->tlv_ptr, list->tlv_space, exp_type); in TLV_LIST_CHECK()
340 static inline void *TLV_LIST_DATA(struct tlv_list_desc *list) in TLV_LIST_DATA() argument
342 return TLV_DATA(list->tlv_ptr); in TLV_LIST_DATA()
345 static inline void TLV_LIST_STEP(struct tlv_list_desc *list) in TLV_LIST_STEP() argument
[all …]
|
| /include/drm/ttm/ |
| D | ttm_execbuf_util.h | 62 struct list_head *list);
99 struct list_head *list, bool intr,
115 struct list_head *list,
|
| /include/drm/ |
| D | drm_mode_object.h | 106 #define DRM_ENUM_NAME_FN(fnname, list) \ argument
110 for (i = 0; i < ARRAY_SIZE(list); i++) { \
111 if (list[i].type == val) \
112 return list[i].name; \
|
| /include/net/ |
| D | netrom.h | 160 #define nr_neigh_for_each(__nr_neigh, list) \ argument
161 hlist_for_each_entry(__nr_neigh, list, neigh_node)
163 #define nr_neigh_for_each_safe(__nr_neigh, node2, list) \ argument
164 hlist_for_each_entry_safe(__nr_neigh, node2, list, neigh_node)
166 #define nr_node_for_each(__nr_node, list) \ argument
167 hlist_for_each_entry(__nr_node, list, node_node)
169 #define nr_node_for_each_safe(__nr_node, node2, list) \ argument
170 hlist_for_each_entry_safe(__nr_node, node2, list, node_node)
|
| /include/linux/usb/ |
| D | audio.h | 28 struct list_head list; member
37 struct list_head list; member
|
| /include/media/ |
| D | media-device.h | 37 struct list_head list; member
392 list_for_each_entry(entity, &(mdev)->entities, graph_obj.list)
396 list_for_each_entry(intf, &(mdev)->interfaces, graph_obj.list)
400 list_for_each_entry(pad, &(mdev)->pads, graph_obj.list)
404 list_for_each_entry(link, &(mdev)->links, graph_obj.list)
|
| /include/linux/netfilter_bridge/ |
| D | ebtables.h | 21 struct list_head list; member
38 struct list_head list; member
55 struct list_head list; member
92 struct list_head list; member
|
| /include/net/bluetooth/ |
| D | hci_core.h | 56 struct list_head list; /* unknown or resolve */ member
124 struct list_head list; member
133 struct list_head list; member
139 struct list_head list; member
147 struct list_head list; member
164 struct list_head list; member
171 struct list_head list; member
186 struct list_head list; member
200 struct list_head list; member
210 struct list_head list; member
[all …]
|