31     struct hlist_node *next, **pprev;  member
53     h->pprev = NULL;  in INIT_HLIST_NODE()
58     return !h->pprev;  in hlist_unhashed()
69     struct hlist_node **pprev = n->pprev;  in __hlist_del()  local
71     WRITE_ONCE(*pprev, next);  in __hlist_del()
73         next->pprev = pprev;  in __hlist_del()
80     n->pprev = (struct hlist_node**)LIST_POISON2;  in hlist_del()
96         first->pprev = &n->next;  in hlist_add_head()
98     n->pprev = &h->first;  in hlist_add_head()
103     n->pprev = next->pprev;  in hlist_add_before()
105     next->pprev = &n->next;  in hlist_add_before()
106     WRITE_ONCE(*(n->pprev), n);  in hlist_add_before()
113     n->pprev = &prev->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()
140         _new->first->pprev = &_new->first;  in hlist_move_list()