return h->pprev == &h->next;
}
+/*
+ * Check whether the node is the only node of the head without
+ * accessing head:
+ */
+static inline bool
+hlist_is_singular_node(struct hlist_node *n, struct hlist_head *h)
+{
+ return !n->next && n->pprev == &h->first;
+}
+
/*
* Move a list from one list head to another. Fixup the pprev
* reference of the first entry if it exists.