39 	struct hlist_bl_node *next, **pprev;  member
46 	h->next = NULL;  in INIT_HLIST_BL_NODE()
82 	n->next = first;  in hlist_bl_add_head()
84 		first->pprev = &n->next;  in hlist_bl_add_head()
90 				       struct hlist_bl_node *next)  in hlist_bl_add_before()  argument
92 	struct hlist_bl_node **pprev = next->pprev;  in hlist_bl_add_before()
95 	n->next = next;  in hlist_bl_add_before()
96 	next->pprev = &n->next;  in hlist_bl_add_before()
107 	n->next = prev->next;  in hlist_bl_add_behind()
108 	n->pprev = &prev->next;  in hlist_bl_add_behind()
109 	prev->next = n;  in hlist_bl_add_behind()
111 	if (n->next)  in hlist_bl_add_behind()
112 		n->next->pprev = &n->next;  in hlist_bl_add_behind()
117 	struct hlist_bl_node *next = n->next;  in __hlist_bl_del()  local
125 			((unsigned long)next |  in __hlist_bl_del()
127 	if (next)  in __hlist_bl_del()
128 		next->pprev = pprev;  in __hlist_bl_del()
134 	n->next = LIST_POISON1;  in hlist_bl_del()
173 	     pos = pos->next)
185 	     pos && ({ n = pos->next; 1; }) && 				 \