/include/linux/ |
D | list.h | 26 list->next = list; in INIT_LIST_HEAD() 39 struct list_head *next) in __list_add() argument 41 next->prev = new; in __list_add() 42 new->next = next; in __list_add() 44 prev->next = new; in __list_add() 49 struct list_head *next); 62 __list_add(new, head, head->next); in list_add() 86 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument 88 next->prev = prev; in __list_del() 89 prev->next = next; in __list_del() [all …]
|
D | rculist.h | 25 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) 34 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument 36 new->next = next; in __list_add_rcu() 39 next->prev = new; in __list_add_rcu() 60 __list_add_rcu(new, head, head->next); in list_add_rcu() 111 __list_del(entry->prev, entry->next); in list_del_rcu() 154 new->next = old->next; in list_replace_rcu() 157 new->next->prev = new; in list_replace_rcu() 182 struct list_head *first = list->next; in list_splice_init_rcu() 184 struct list_head *at = head->next; in list_splice_init_rcu() [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() 140 pos = pos->next) [all …]
|
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)) 142 return node->next; in llist_next() 159 new->next = entry; in llist_add()
|
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 | timerqueue.h | 15 struct timerqueue_node *next; member 37 return head->next; in timerqueue_getnext() 48 head->next = NULL; in timerqueue_init_head()
|
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 | skbuff.h | 130 struct sk_buff *next; member 390 struct sk_buff *next; member 666 return list->next == (struct sk_buff *)list; in skb_queue_empty() 679 return skb->next == (struct sk_buff *)list; in skb_queue_is_last() 710 return skb->next; in skb_queue_next() 881 struct sk_buff *list = ((const struct sk_buff *)list_)->next; in skb_peek() 899 struct sk_buff *next = skb->next; in skb_peek_next() local 900 if (next == (struct sk_buff *)list_) in skb_peek_next() 901 next = NULL; in skb_peek_next() 902 return next; in skb_peek_next() [all …]
|
D | n_r3964.h | 121 struct r3964_client_info *next; member 162 struct r3964_message *next; member 176 struct r3964_block_header *next; member
|
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 | dm-ioctl.h | 167 __u32 next; member 192 __u32 next; /* offset to the next record from member 201 __u32 next; member
|
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 | phonedev.h | 11 struct phone_device *next; member
|
D | agpgart.h | 174 struct agp_client *next; member 182 struct agp_controller *next; member 197 struct agp_file_private *next; member
|
D | types.h | 230 struct list_head *next, *prev; member 238 struct hlist_node *next, **pprev; member 254 struct rcu_head *next; member
|
/include/asm-generic/ |
D | switch_to.h | 25 #define switch_to(prev, next, last) \ argument 27 ((last) = __switch_to((prev), (next))); \
|
D | mmu_context.h | 35 struct mm_struct *next, in switch_mm() argument
|
/include/drm/ |
D | drm_mm.h | 85 return mm->hole_stack.next; in drm_mm_initialized() 92 next = entry ? list_entry(entry->node_list.next, \ 94 entry != NULL; entry = next, \ 95 next = entry ? list_entry(entry->node_list.next, \
|
/include/net/ |
D | atmclip.h | 33 struct clip_vcc *next; /* next VCC */ member 49 struct net_device *next; /* next CLIP interface */ member
|
D | ipip.h | 19 struct ip_tunnel __rcu *next; member 42 struct ip_tunnel_prl_entry __rcu *next; member
|
D | ip6_tunnel.h | 16 struct ip6_tnl __rcu *next; /* next tunnel in list */ member
|
/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
|