| /include/linux/ |
| D | damon.h | 71 struct list_head list; member
94 struct list_head list; member
173 struct list_head list; member
352 struct list_head list; member
426 struct list_head list; member
648 return container_of(r->list.next, struct damon_region, list); in damon_next_region()
653 return container_of(r->list.prev, struct damon_region, list); in damon_prev_region()
658 return list_last_entry(&t->regions_list, struct damon_region, list); in damon_last_region()
663 return list_first_entry(&t->regions_list, struct damon_region, list); in damon_first_region()
673 list_for_each_entry(r, &t->regions_list, list)
[all …]
|
| D | list.h | 35 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
38 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD()
296 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
298 __list_del_entry(list); in list_move()
299 list_add(list, head); in list_move()
307 static inline void list_move_tail(struct list_head *list, in list_move_tail() argument
310 __list_del_entry(list); in list_move_tail()
311 list_add_tail(list, head); in list_move_tail()
342 static inline int list_is_first(const struct list_head *list, const struct list_head *head) in list_is_first() argument
[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 | virtio_vsock.h | 95 virtio_vsock_skb_queue_head(struct sk_buff_head *list, struct sk_buff *skb) in virtio_vsock_skb_queue_head() argument
97 spin_lock_bh(&list->lock); in virtio_vsock_skb_queue_head()
98 __skb_queue_head(list, skb); in virtio_vsock_skb_queue_head()
99 spin_unlock_bh(&list->lock); in virtio_vsock_skb_queue_head()
103 virtio_vsock_skb_queue_tail(struct sk_buff_head *list, struct sk_buff *skb) in virtio_vsock_skb_queue_tail() argument
105 spin_lock_bh(&list->lock); in virtio_vsock_skb_queue_tail()
106 __skb_queue_tail(list, skb); in virtio_vsock_skb_queue_tail()
107 spin_unlock_bh(&list->lock); in virtio_vsock_skb_queue_tail()
110 static inline struct sk_buff *virtio_vsock_skb_dequeue(struct sk_buff_head *list) in virtio_vsock_skb_dequeue() argument
114 spin_lock_bh(&list->lock); in virtio_vsock_skb_dequeue()
[all …]
|
| 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
229 static inline void __list_splice_init_rcu(struct list_head *list, in __list_splice_init_rcu() argument
234 struct list_head *first = list->next; in __list_splice_init_rcu()
235 struct list_head *last = list->prev; in __list_splice_init_rcu()
243 INIT_LIST_HEAD_RCU(list); in __list_splice_init_rcu()
277 static inline void list_splice_init_rcu(struct list_head *list, in list_splice_init_rcu() argument
281 if (!list_empty(list)) in list_splice_init_rcu()
[all …]
|
| D | devfreq.h | 262 unsigned int list);
265 unsigned int list);
269 unsigned int list);
273 unsigned int list);
411 unsigned int list) in devfreq_register_notifier() argument
418 unsigned int list) in devfreq_unregister_notifier() argument
426 unsigned int list) in devm_devfreq_register_notifier() argument
434 unsigned int list) in devm_devfreq_unregister_notifier() argument
|
| D | rhashtable.h | 562 #define rhl_for_each_rcu(pos, list) \ argument
563 for (pos = list; pos; pos = rcu_dereference_raw(pos->next))
575 #define rhl_for_each_entry_rcu(tpos, pos, list, member) \ argument
576 for (pos = list; pos && rht_entry(tpos, pos, member); \
743 struct rhlist_head *list; in __rhashtable_insert_fast() local
760 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
763 RCU_INIT_POINTER(list->next, plist); in __rhashtable_insert_fast()
765 RCU_INIT_POINTER(list->rhead.next, head); in __rhashtable_insert_fast()
790 struct rhlist_head *list; in __rhashtable_insert_fast() local
792 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
[all …]
|
| D | of_iommu.h | 15 struct list_head *list);
27 struct list_head *list) in of_iommu_get_resv_regions() argument
|
| 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 | kvm_irqfd.h | 29 struct list_head list; member
57 struct list_head list; member
|
| D | list_lru.h | 32 struct list_head list; member
54 struct list_head list; member
170 void list_lru_isolate(struct list_lru_one *list, struct list_head *item);
171 void list_lru_isolate_move(struct list_lru_one *list, struct list_head *item,
175 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
|
| /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/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/net/netfilter/ |
| D | nf_conntrack_count.h | 27 int nf_conncount_add(struct net *net, struct nf_conncount_list *list,
31 void nf_conncount_list_init(struct nf_conncount_list *list);
34 struct nf_conncount_list *list);
36 void nf_conncount_cache_free(struct nf_conncount_list *list);
|
| /include/drm/ttm/ |
| D | ttm_execbuf_util.h | 64 struct list_head *list);
100 struct list_head *list, bool intr,
116 struct list_head *list,
|
| /include/drm/ |
| D | drm_mode_object.h | 110 #define DRM_ENUM_NAME_FN(fnname, list) \ argument
114 for (i = 0; i < ARRAY_SIZE(list); i++) { \
115 if (list[i].type == val) \
116 return list[i].name; \
|
| D | drm_gpuvm.h | 264 struct list_head list; member
298 struct list_head list; member
320 struct list_head list; member
430 if (va && !list_is_last(&va->rb.entry, &va->vm->rb.list)) in __drm_gpuva_next()
490 list_for_each_entry(va__, &(gpuvm__)->rb.list, rb.entry)
503 list_for_each_entry_safe(va__, next__, &(gpuvm__)->rb.list, rb.entry)
704 } list; member
772 list_for_each_entry(va__, &(vm_bo)->list.gpuva, gem.entry)
788 list_for_each_entry_safe(va__, next__, &(vm_bo)->list.gpuva, gem.entry)
985 struct list_head list; member
[all …]
|
| /include/net/ |
| D | netrom.h | 161 #define nr_neigh_for_each(__nr_neigh, list) \ argument
162 hlist_for_each_entry(__nr_neigh, list, neigh_node)
164 #define nr_neigh_for_each_safe(__nr_neigh, node2, list) \ argument
165 hlist_for_each_entry_safe(__nr_neigh, node2, list, neigh_node)
167 #define nr_node_for_each(__nr_node, list) \ argument
168 hlist_for_each_entry(__nr_node, list, node_node)
170 #define nr_node_for_each_safe(__nr_node, node2, list) \ argument
171 hlist_for_each_entry_safe(__nr_node, node2, list, node_node)
|
| /include/net/bluetooth/ |
| D | hci_core.h | 61 struct list_head list; /* unknown or resolve */ member
128 struct list_head list; member
137 struct list_head list; member
143 struct list_head list; member
154 struct list_head list; member
169 struct list_head list; member
176 struct list_head list; member
183 struct list_head list; member
197 struct list_head list; member
210 struct list_head list; member
[all …]
|
| /include/linux/usb/ |
| D | audio.h | 25 struct list_head list; member
34 struct list_head list; member
|
| /include/media/ |
| D | media-device.h | 38 struct list_head list; member
383 list_for_each_entry(entity, &(mdev)->entities, graph_obj.list)
387 list_for_each_entry(intf, &(mdev)->interfaces, graph_obj.list)
391 list_for_each_entry(pad, &(mdev)->pads, graph_obj.list)
395 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/crypto/ |
| D | algapi.h | 78 struct hlist_node list; member
89 struct list_head list; member
99 struct list_head list; member
114 struct list_head list; member
224 return queue->backlog == &queue->list ? NULL : in crypto_get_backlog()
225 container_of(queue->backlog, struct crypto_async_request, list); in crypto_get_backlog()
|