333 	struct hlist_node *next, **pprev;  member
342 	(node)->pprev = NULL;						\
349 	return !h->pprev;  in hlist_unhashed()
363 	WRITE_ONCE(*(n->pprev), n->next);  in hlist_del()
365 		n->next->pprev = n->pprev;  in hlist_del()
384 		h->first->pprev = &n->next;  in hlist_add_head()
386 	n->pprev = &h->first;  in hlist_add_head()
393 	n->pprev = next->pprev;  in hlist_add_before()
395 	next->pprev = &n->next;  in hlist_add_before()
396 	WRITE_ONCE(*(n->pprev), n);  in hlist_add_before()
405 	n->pprev = &prev->next;  in hlist_add_behind()
408 		n->next->pprev = &n->next;  in hlist_add_behind()
417 		new->first->pprev = &new->first;  in hlist_move_list()