| /include/linux/ |
| D | rculist.h | 32 ACCESS_ONCE(list->next) = list; in INIT_LIST_HEAD_RCU()
40 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
50 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
52 new->next = next; in __list_add_rcu()
55 next->prev = new; in __list_add_rcu()
59 struct list_head *prev, struct list_head *next);
80 __list_add_rcu(new, head, head->next); in list_add_rcu()
174 new->next = old->next; in list_replace_rcu()
177 new->next->prev = new; in list_replace_rcu()
202 struct list_head *first = list->next; in list_splice_init_rcu()
[all …]
|
| D | list.h | 27 list->next = list; in INIT_LIST_HEAD()
40 struct list_head *next) in __list_add() argument
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
87 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
89 next->prev = prev; in __list_del()
90 prev->next = next; in __list_del()
[all …]
|
| D | list_nulls.h | 22 struct hlist_nulls_node *next, **pprev; member
64 n->next = first; in hlist_nulls_add_head()
68 first->pprev = &n->next; in hlist_nulls_add_head()
73 struct hlist_nulls_node *next = n->next; in __hlist_nulls_del() local
75 *pprev = next; in __hlist_nulls_del()
76 if (!is_a_nulls(next)) in __hlist_nulls_del()
77 next->pprev = pprev; in __hlist_nulls_del()
98 pos = pos->next)
110 pos = pos->next)
|
| D | list_bl.h | 38 struct hlist_bl_node *next, **pprev; member
45 h->next = NULL; in INIT_HLIST_BL_NODE()
81 n->next = first; in hlist_bl_add_head()
83 first->pprev = &n->next; in hlist_bl_add_head()
90 struct hlist_bl_node *next = n->next; in __hlist_bl_del() local
97 ((unsigned long)next | in __hlist_bl_del()
99 if (next) in __hlist_bl_del()
100 next->pprev = pprev; in __hlist_bl_del()
106 n->next = LIST_POISON1; in hlist_bl_del()
145 pos = pos->next)
[all …]
|
| D | timerqueue.h | 15 struct timerqueue_node *next; member
37 return head->next; in timerqueue_getnext()
48 head->next = NULL; in timerqueue_init_head()
|
| D | user-return-notifier.h | 19 struct task_struct *next) in propagate_user_return_notify() argument
23 set_tsk_thread_flag(next, TIF_USER_RETURN_NOTIFY); in propagate_user_return_notify()
39 struct task_struct *next) in propagate_user_return_notify() argument
|
| D | context_tracking.h | 16 struct task_struct *next);
52 struct task_struct *next) in context_tracking_task_switch() argument
55 __context_tracking_task_switch(prev, next); in context_tracking_task_switch()
63 struct task_struct *next) { } in context_tracking_task_switch() argument
|
| D | llist.h | 66 struct llist_node *next; member
105 for ((pos) = (node); pos; (pos) = (pos)->next)
125 (pos) = llist_entry((pos)->member.next, typeof(*(pos)), member))
147 (n = llist_entry(pos->member.next, typeof(*n), member), true); \
165 return node->next; in llist_next()
|
| D | rculist_nulls.h | 44 (*((struct hlist_nulls_node __rcu __force **)&(node)->next))
95 n->next = first; in hlist_nulls_add_head_rcu()
99 first->pprev = &n->next; in hlist_nulls_add_head_rcu()
|
| D | rculist_bl.h | 106 n->next = first; in hlist_bl_add_head_rcu()
108 first->pprev = &n->next; in hlist_bl_add_head_rcu()
126 pos = rcu_dereference_raw(pos->next))
|
| D | n_r3964.h | 92 struct r3964_client_info *next; member
110 struct r3964_message *next; member
124 struct r3964_block_header *next; member
|
| D | agpgart.h | 92 struct agp_client *next; member
100 struct agp_controller *next; member
115 struct agp_file_private *next; member
|
| D | rhashtable.h | 24 struct rhash_head __rcu *next; member
27 #define INIT_HASH_HEAD(ptr) ((ptr)->next = NULL)
131 pos ? rht_entry_safe(rht_dereference((pos)->member.next, ht), \
144 pos = rht_dereference((pos)->next, ht))
191 pos = rht_dereference_rcu((pos)->next, ht))
207 pos = rht_entry_safe(rcu_dereference_raw((pos)->member.next), \
|
| D | ihex.h | 27 int next = ((be16_to_cpu(rec->len) + 5) & ~3) - 2; in ihex_next_binrec() local
28 rec = (void *)&rec->data[next]; in ihex_next_binrec()
|
| D | if_tunnel.h | 14 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
|
| D | pnp.h | 222 for((card) = global_to_pnp_card(pnp_cards.next); \
224 (card) = global_to_pnp_card((card)->global_list.next))
278 for((dev) = global_to_pnp_dev(pnp_global.next); \
280 (dev) = global_to_pnp_dev((dev)->global_list.next))
282 for((dev) = card_to_pnp_dev((card)->devices.next); \
284 (dev) = card_to_pnp_dev((dev)->card_list.next))
367 struct pnp_id *next; member
430 for((card) = protocol_to_pnp_card((protocol)->cards.next); \
432 (card) = protocol_to_pnp_card((card)->protocol_list.next))
434 for((dev) = protocol_to_pnp_dev((protocol)->devices.next); \
[all …]
|
| D | skbuff.h | 170 struct sk_buff *next; member
509 struct sk_buff *next; member
994 return list->next == (const struct sk_buff *) list; in skb_queue_empty()
1007 return skb->next == (const struct sk_buff *) list; in skb_queue_is_last()
1038 return skb->next; in skb_queue_next()
1242 struct sk_buff *skb = list_->next; in skb_peek()
1261 struct sk_buff *next = skb->next; in skb_peek_next() local
1263 if (next == (struct sk_buff *)list_) in skb_peek_next()
1264 next = NULL; in skb_peek_next()
1265 return next; in skb_peek_next()
[all …]
|
| D | types.h | 187 struct list_head *next, *prev; member
195 struct hlist_node *next, **pprev; member
211 struct callback_head *next; member
|
| D | hugetlb_cgroup.h | 36 return (struct hugetlb_cgroup *)page[2].lru.next; in hugetlb_cgroup_from_page()
46 page[2].lru.next = (void *)h_cg; in set_hugetlb_cgroup()
|
| /include/asm-generic/ |
| D | switch_to.h | 25 #define switch_to(prev, next, last) \ argument
27 ((last) = __switch_to((prev), (next))); \
|
| /include/net/ |
| D | atmclip.h | 33 struct clip_vcc *next; /* next VCC */ member
49 struct net_device *next; /* next CLIP interface */ member
|
| /include/drm/ |
| D | drm_mm.h | 124 return mm->hole_stack.next; in drm_mm_initialized()
151 return list_entry(hole_node->node_list.next, in __drm_mm_hole_node_end()
203 for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
208 entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
211 …for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm…
216 …entry = list_entry((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_no…
|
| /include/sound/ |
| D | soundfont.h | 33 struct snd_sf_zone *next; /* Link to next */ member
51 struct snd_sf_sample *next; member
58 struct snd_soundfont *next; /* Link to next */ member
|
| /include/linux/raid/ |
| D | xor.h | 10 struct xor_block_template *next; member
|
| /include/uapi/linux/ |
| D | dm-ioctl.h | 167 __u32 next; member
192 __u32 next; /* offset to the next record from member
201 __u32 next; member
|