35     struct hlist_node *first;  member
38 #define HLIST_HEAD_INIT { .first = NULL }
39 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
40 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
63     return !READ_ONCE(h->first);  in hlist_empty()
93     struct hlist_node *first = h->first;  in hlist_add_head()  local
94     n->next = first;  in hlist_add_head()
95     if (first)  in hlist_add_head()
96         first->pprev = &n->next;  in hlist_add_head()
97     WRITE_ONCE(h->first, n);  in hlist_add_head()
98     n->pprev = &h->first;  in hlist_add_head()
132     return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
138     _new->first = old->first;  in hlist_move_list()
139     if (_new->first)  in hlist_move_list()
140         _new->first->pprev = &_new->first;  in hlist_move_list()
141     old->first = NULL;  in hlist_move_list()
147     for (pos = (head)->first; pos ; pos = pos->next)
150     for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
159     for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
173     for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\