[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <1217890080-12073-1-git-send-email-lrodriguez@atheros.com>
Date: Mon, 4 Aug 2008 15:48:00 -0700
From: "Luis R. Rodriguez" <lrodriguez@...eros.com>
To: <linville@...driver.com>, <netdev@...r.kernel.org>,
<linux-kernel@...r.kernel.org>, <linville@...driver.com>,
<torvalds@...ux-foundation.org>
CC: "Luis R. Rodriguez" <lrodriguez@...eros.com>,
<linux-wireless@...r.kernel.org>, <ath9k-devel@...ts.ath9k.org>
Subject: [PATCH 1/4] list.h: Add list_splice_tail() and list_splice_tail_init()
If you are using linked lists for queues list_splice() will not do what
you would expect even if you use the elements passed reversed. We need
to handle these differently. We add list_splice_tail() and
list_splice_tail_init()
Signed-off-by: Luis R. Rodriguez <lrodriguez@...eros.com>
---
include/linux/list.h | 45 ++++++++++++++++++++++++++++++++++++++++++++-
1 files changed, 44 insertions(+), 1 deletions(-)
diff --git a/include/linux/list.h b/include/linux/list.h
index 453916b..594f67c 100644
--- a/include/linux/list.h
+++ b/include/linux/list.h
@@ -229,7 +229,7 @@ static inline void __list_splice(const struct list_head *list,
}
/**
- * list_splice - join two lists
+ * list_splice - join two lists, this is designed for stacks
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
@@ -256,6 +256,49 @@ static inline void list_splice_init(struct list_head *list,
}
}
+static inline void __list_splice_tail(const struct list_head *list,
+ struct list_head *head)
+{
+ struct list_head *first = list->next;
+ struct list_head *last = list->prev;
+ struct list_head *current_tail = head->prev;
+
+ current_tail->next = first;
+ last->next = head;
+ head->prev = last;
+ first->prev = current_tail;
+}
+
+/**
+ * list_splice_tail - join two lists, each list being a queue
+ * @list: the new list to add.
+ * @head: the place to add it in the first list.
+ */
+static inline void list_splice_tail(const struct list_head *list,
+ struct list_head *head)
+{
+ if (!list_empty(list))
+ __list_splice_tail(list, head);
+}
+
+/**
+ * list_splice_tail_init - join two lists, each list being a queue, and
+ * reinitialise the emptied list.
+ * @list: the new list to add.
+ * @head: the place to add it in the first list.
+ *
+ * The list at @list is reinitialised
+ */
+static inline void list_splice_tail_init(struct list_head *list,
+ struct list_head *head)
+{
+ if (!list_empty(list)) {
+ __list_splice_tail(list, head);
+ INIT_LIST_HEAD(list);
+ }
+}
+
+
/**
* list_entry - get the struct for this entry
* @ptr: the &struct list_head pointer.
--
1.5.6.rc2.15.g457bb.dirty
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists