31     struct hlist_node *next, **pprev;  member
52     h->next = NULL;  in INIT_HLIST_NODE()
68     struct hlist_node *next = n->next;  in __hlist_del()  local
71     WRITE_ONCE(*pprev, next);  in __hlist_del()
72     if (next)  in __hlist_del()
73         next->pprev = pprev;  in __hlist_del()
79     n->next = (struct hlist_node*)LIST_POISON1;  in hlist_del()
94     n->next = first;  in hlist_add_head()
96         first->pprev = &n->next;  in hlist_add_head()
101 static inline void hlist_add_before(struct hlist_node *n, struct hlist_node *next)  in hlist_add_before()  argument
103     n->pprev = next->pprev;  in hlist_add_before()
104     n->next = next;  in hlist_add_before()
105     next->pprev = &n->next;  in hlist_add_before()
111     n->next = prev->next;  in hlist_add_behind()
112     WRITE_ONCE(prev->next, n);  in hlist_add_behind()
113     n->pprev = &prev->next;  in hlist_add_behind()
115     if (n->next)  in hlist_add_behind()
116         n->next->pprev  = &n->next;  in hlist_add_behind()
121     n->pprev = &n->next;  in hlist_add_fake()
126     return h->pprev == &h->next;  in hlist_fake()
132     return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
147     for (pos = (head)->first; pos ; pos = pos->next)
150     for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
161          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
164     for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
166          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
170          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
174          pos && ({ n = pos->member.next; 1; });         \