list.h: Move list_is_singular() up.

This way all simple inline functions come before the various iterators.

diff --git a/list.h b/list.h
index d28de9cc1a9dd30fa06f3a0426bdf6f4ba83c308..9056f1f7f4c72a048a2dd645bba076baa9d9b667 100644 (file)
--- a/list.h
+++ b/list.h
@@ -103,6 +103,16 @@ static inline int list_empty(const struct list_head *head)
        return head->next == head;
 }
 
        return head->next == head;
 }
 

+/**
+ * Test whether a list has just one entry.
+ *
+ * \param head The list to test.
+ */
+static inline int list_is_singular(const struct list_head *head)
+{
+       return !list_empty(head) && (head->next == head->prev);
+}
+

 /**
  * Get the struct in which this entry is embedded in.
  *
 /**
  * Get the struct in which this entry is embedded in.
  *


@@ -149,13 +159,3 @@ static inline int list_empty(const struct list_head *head)
  */
 #define list_first_entry(ptr, type, member) \
        list_entry((ptr)->next, type, member)
  */
 #define list_first_entry(ptr, type, member) \
        list_entry((ptr)->next, type, member)

-
-/**
- * Test whether a list has just one entry.
- *
- * \param head The list to test.
- */
-static inline int list_is_singular(const struct list_head *head)
-{
-       return !list_empty(head) && (head->next == head->prev);
-}