list: add list_for_each_entry_reverse macro

Signed-off-by: Jiri Pirko <jiri@mellanox.com>

diff --git a/include/list.h b/include/list.h
index cdebe4de3a9f0beff744c91122c90fd431bf8813..b549c3ec80ada3b2a3675bf43510f14d24aa2a2b 100644 (file)
--- a/include/list.h
+++ b/include/list.h
@@ -50,9 +50,15 @@ static inline void list_del(struct list_head *entry)
 #define list_first_entry(ptr, type, member) \
        list_entry((ptr)->next, type, member)
 
+#define list_last_entry(ptr, type, member) \
+       list_entry((ptr)->prev, type, member)
+
 #define list_next_entry(pos, member) \
        list_entry((pos)->member.next, typeof(*(pos)), member)
 
+#define list_prev_entry(pos, member) \
+       list_entry((pos)->member.prev, typeof(*(pos)), member)
+
 #define list_for_each_entry(pos, head, member)                         \
        for (pos = list_first_entry(head, typeof(*pos), member);        \
             &pos->member != (head);                                    \
@@ -64,6 +70,11 @@ static inline void list_del(struct list_head *entry)
             &pos->member != (head);                                    \
             pos = n, n = list_next_entry(n, member))
 
+#define list_for_each_entry_reverse(pos, head, member)                 \
+       for (pos = list_last_entry(head, typeof(*pos), member);         \
+            &pos->member != (head);                                    \
+            pos = list_prev_entry(pos, member))
+
 struct hlist_head {
        struct hlist_node *first;
 };