80 	struct list_head node_list;  member
86 	struct list_head	node_list;  member
95 	.node_list = LIST_HEAD_INIT((head).node_list)	\
114 	.node_list = LIST_HEAD_INIT((node).node_list),	\
124 	INIT_LIST_HEAD(&head->node_list);  in plist_head_init()
136 	INIT_LIST_HEAD(&node->node_list);  in plist_node_init()
150 	 list_for_each_entry(pos, &(head)->node_list, node_list)
160 	 list_for_each_entry_continue(pos, &(head)->node_list, node_list)
171 	 list_for_each_entry_safe(pos, n, &(head)->node_list, node_list)
180 	 list_for_each_entry(pos, &(head)->node_list, mem.node_list)
192 	list_for_each_entry_continue(pos, &(head)->node_list, m.node_list)
204 	list_for_each_entry_safe(pos, n, &(head)->node_list, m.node_list)
212 	return list_empty(&head->node_list);  in plist_head_empty()
221 	return list_empty(&node->node_list);  in plist_node_empty()
265 	list_next_entry(pos, node_list)
272 	list_prev_entry(pos, node_list)
282 	return list_entry(head->node_list.next,  in plist_first()
283 			  struct plist_node, node_list);  in plist_first()
294 	return list_entry(head->node_list.prev,  in plist_last()
295 			  struct plist_node, node_list);  in plist_last()