341 	struct hlist_node *next, **pprev;  member
349 	(node)->pprev = NULL;						\
356 	return !h->pprev;  in hlist_unhashed()
370 	WRITE_ONCE(*(n->pprev), n->next);  in hlist_del()
372 		n->next->pprev = n->pprev;  in hlist_del()
391 		h->first->pprev = &n->next;  in hlist_add_head()
393 	n->pprev = &h->first;  in hlist_add_head()
400 	n->pprev = next->pprev;  in hlist_add_before()
402 	next->pprev = &n->next;  in hlist_add_before()
403 	WRITE_ONCE(*(n->pprev), n);  in hlist_add_before()
412 	n->pprev = &prev->next;  in hlist_add_behind()
415 		n->next->pprev = &n->next;  in hlist_add_behind()
424 		new->first->pprev = &new->first;  in hlist_move_list()