Update list.h

Author: Barenboim

list.h

@@ -220,112 +220,4 @@ static inline void list_splice_init(struct list_head *list,
 	     &pos->member != (head); \
 	     pos = list_entry(pos->member.next, typeof (*pos), member))
 
-/*
- * Singly linked list implementation.
- */
-
-struct slist_node {
-	struct slist_node *next;
-};
-
-struct slist_head {
-	struct slist_node first, *last;
-};
-
-#define SLIST_HEAD_INIT(name) { { (struct slist_node *)0 }, &(name).first }
-
-#define SLIST_HEAD(name) \
-	struct slist_head name = SLIST_HEAD_INIT(name)
-
-static inline void INIT_SLIST_HEAD(struct slist_head *list)
-{
-	list->first.next = (struct slist_node *)0;
-	list->last = &list->first;
-}
-
-static inline void slist_add_after(struct slist_node *entry,
-				   struct slist_node *prev,
-				   struct slist_head *list)
-{
-	entry->next = prev->next;
-	prev->next = entry;
-	if (!entry->next)
-		list->last = entry;
-}
-
-static inline void slist_add_head(struct slist_node *entry,
-				  struct slist_head *list)
-{
-	slist_add_after(entry, &list->first, list);
-}
-
-static inline void slist_add_tail(struct slist_node *entry,
-				  struct slist_head *list)
-{
-	entry->next = (struct slist_node *)0;
-	list->last->next = entry;
-	list->last = entry;
-}
-
-static inline void slist_del_after(struct slist_node *prev,
-				   struct slist_head *list)
-{
-	prev->next = prev->next->next;
-	if (!prev->next)
-		list->last = prev;
-}
-
-static inline void slist_del_head(struct slist_head *list)
-{
-	slist_del_after(&list->first, list);
-}
-
-static inline int slist_empty(const struct slist_head *list)
-{
-	return !list->first.next;
-}
-
-static inline void __slist_splice(const struct slist_head *list,
-				  struct slist_node *prev,
-				  struct slist_head *head)
-{
-	list->last->next = prev->next;
-	prev->next = list->first.next;
-	if (!list->last->next)
-		head->last = list->last;
-}
-
-static inline void slist_splice(const struct slist_head *list,
-				struct slist_node *prev,
-				struct slist_head *head)
-{
-	if (!slist_empty(list))
-		__slist_splice(list, prev, head);
-}
-
-static inline void slist_splice_init(struct slist_head *list,
-				     struct slist_node *prev,
-				     struct slist_head *head)
-{
-	if (!slist_empty(list)) {
-		__slist_splice(list, prev, head);
-		INIT_SLIST_HEAD(list);
-	}
-}
-
-#define slist_entry(ptr, type, member) \
-	((type *)((char *)(ptr)-(size_t)(&((type *)0)->member)))
-
-#define slist_for_each(pos, head) \
-	for (pos = (head)->first.next; pos; pos = pos->next)
-
-#define slist_for_each_safe(pos, prev, head) \
-	for (prev = &(head)->first, pos = prev->next; pos; \
-	     prev = prev->next == pos ? pos : prev, pos = prev->next)
-
-#define slist_for_each_entry(pos, head, member) \
-	for (pos = slist_entry((head)->first.next, typeof (*pos), member); \
-	     &pos->member != (struct slist_node *)0; \
-	     pos = slist_entry(pos->member.next, typeof (*pos), member))
-
 #endif