Simplify slist impl (unused).

Author: Barenboim

list.h

@@ -234,23 +234,6 @@ static inline void INIT_SLIST_HEAD(struct slist_head *list)
 	list->last = &list->first;
 }
 
-static inline void slist_add_head(struct slist_node *node,
-								  struct slist_head *list)
-{
-	node->next = list->first.next;
-	list->first.next = node;
-	if (!node->next)
-		list->last = node;
-}
-
-static inline void slist_add_tail(struct slist_node *node,
-								  struct slist_head *list)
-{
-	node->next = (struct slist_node *)0;
-	list->last->next = node;
-	list->last = node;
-}
-
 static inline void slist_add_after(struct slist_node *node,
 								   struct slist_node *prev,
 								   struct slist_head *list)
@@ -261,11 +244,18 @@ static inline void slist_add_after(struct slist_node *node,
 		list->last = node;
 }
 
-static inline void slist_del_head(struct slist_head *list)
+static inline void slist_add_head(struct slist_node *node,
+								  struct slist_head *list)
 {
-	list->first.next = list->first.next->next;
-	if (!list->first.next)
-		list->last = &list->first;
+	slist_add_after(node, &list->first, list);
+}
+
+static inline void slist_add_tail(struct slist_node *node,
+								  struct slist_head *list)
+{
+	node->next = (struct slist_node *)0;
+	list->last->next = node;
+	list->last = node;
 }
 
 static inline void slist_del_after(struct slist_node *prev,
@@ -276,6 +266,11 @@ static inline void slist_del_after(struct slist_node *prev,
 		list->last = prev;
 }
 
+static inline void slist_del_head(struct slist_head *list)
+{
+	slist_del_after(&list->first, list);
+}
+
 static inline int slist_empty(struct slist_head *list)
 {
 	return !list->first.next;