libopkg: implement lightweight package listing logic

[oweals/opkg-lede.git] / libopkg / list.h

diff --git a/libopkg/list.h b/libopkg/list.h
index c1325db916a6cee9c26871f99c981f093bcf437f..2b9aac3c7cfdf3520b84d6653885ea5f92f11bdc 100644 (file)
--- a/libopkg/list.h
+++ b/libopkg/list.h
@@ -21,7 +21,7 @@
 #define _LINUX_LIST_H
 
 struct list_head {
-    struct list_head *next, *prev;
+       struct list_head *next, *prev;
 };
 
 #define LIST_POISON1  ((struct list_head *) 0x00100100)
@@ -37,12 +37,12 @@ struct list_head {
 } while (0)
 
 static inline void __list_add(struct list_head *newitem,
-                              struct list_head *prev,
-                              struct list_head *next) {
-    next->prev = newitem;
-    newitem->next = next;
-    newitem->prev = prev;
-    prev->next = newitem;
+                             struct list_head *prev, struct list_head *next)
+{
+       next->prev = newitem;
+       newitem->next = next;
+       newitem->prev = prev;
+       prev->next = newitem;
 }
 
 /**
@@ -53,8 +53,9 @@ static inline void __list_add(struct list_head *newitem,
  * Insert a new entry after the specified head.
  * This is good for implementing stacks.
  */
-static inline void list_add(struct list_head *newitem, struct list_head *head) {
-    __list_add(newitem, head, head->next);
+static inline void list_add(struct list_head *newitem, struct list_head *head)
+{
+       __list_add(newitem, head, head->next);
 }
 
 /**
@@ -65,11 +66,12 @@ static inline void list_add(struct list_head *newitem, struct list_head *head) {
  * Insert a new entry before the specified head.
  * This is useful for implementing queues.
  */
-static inline void list_add_tail(struct list_head *newitem, struct list_head *head) {
-    __list_add(newitem, head->prev, head);
+static inline void list_add_tail(struct list_head *newitem,
+                                struct list_head *head)
+{
+       __list_add(newitem, head->prev, head);
 }
 
-
 /*
  * Delete a list entry by making the prev/next entries
  * point to each other.
@@ -77,9 +79,10 @@ static inline void list_add_tail(struct list_head *newitem, struct list_head *he
  * This is only for internal list manipulation where we know
  * the prev/next entries already!
  */
-static inline void __list_del(struct list_head * prev, struct list_head * next) {
-    next->prev = prev;
-    prev->next = next;
+static inline void __list_del(struct list_head *prev, struct list_head *next)
+{
+       next->prev = prev;
+       prev->next = next;
 }
 
 /**
@@ -88,19 +91,21 @@ static inline void __list_del(struct list_head * prev, struct list_head * next)
  * Note: list_empty on entry does not return true after this, the entry is
  * in an undefined state.
  */
-static inline void list_del(struct list_head *entry) {
-    __list_del(entry->prev, entry->next);
-    entry->next = LIST_POISON1;
-    entry->prev = LIST_POISON2;
+static inline void list_del(struct list_head *entry)
+{
+       __list_del(entry->prev, entry->next);
+       entry->next = LIST_POISON1;
+       entry->prev = LIST_POISON2;
 }
 
 /**
  * list_del_init - deletes entry from list and reinitialize it.
  * @entry: the element to delete from the list.
  */
-static inline void list_del_init(struct list_head *entry) {
-    __list_del(entry->prev, entry->next);
-    INIT_LIST_HEAD(entry);
+static inline void list_del_init(struct list_head *entry)
+{
+       __list_del(entry->prev, entry->next);
+       INIT_LIST_HEAD(entry);
 }
 
 /**
@@ -108,9 +113,10 @@ static inline void list_del_init(struct list_head *entry) {
  * @list: the entry to move
  * @head: the head that will precede our entry
  */
-static inline void list_move(struct list_head *list, struct list_head *head) {
-    __list_del(list->prev, list->next);
-    list_add(list, head);
+static inline void list_move(struct list_head *list, struct list_head *head)
+{
+       __list_del(list->prev, list->next);
+       list_add(list, head);
 }
 
 /**
@@ -119,17 +125,19 @@ static inline void list_move(struct list_head *list, struct list_head *head) {
  * @head: the head that will follow our entry
  */
 static inline void list_move_tail(struct list_head *list,
-                                  struct list_head *head) {
-    __list_del(list->prev, list->next);
-    list_add_tail(list, head);
+                                 struct list_head *head)
+{
+       __list_del(list->prev, list->next);
+       list_add_tail(list, head);
 }
 
 /**
  * list_empty - tests whether a list is empty
  * @head: the list to test.
  */
-static inline int list_empty(const struct list_head *head) {
-    return head->next == head;
+static inline int list_empty(const struct list_head *head)
+{
+       return head->next == head;
 }
 
 /**
@@ -144,22 +152,23 @@ static inline int list_empty(const struct list_head *head) {
  *
  * @head: the list to test.
  */
-static inline int list_empty_careful(const struct list_head *head) {
-    struct list_head *next = head->next;
-    return (next == head) && (next == head->prev);
+static inline int list_empty_careful(const struct list_head *head)
+{
+       struct list_head *next = head->next;
+       return (next == head) && (next == head->prev);
 }
 
-static inline void __list_splice(struct list_head *list,
-                                 struct list_head *head) {
-    struct list_head *first = list->next;
-    struct list_head *last = list->prev;
-    struct list_head *at = head->next;
+static inline void __list_splice(struct list_head *list, struct list_head *head)
+{
+       struct list_head *first = list->next;
+       struct list_head *last = list->prev;
+       struct list_head *at = head->next;
 
-    first->prev = head;
-    head->next = first;
+       first->prev = head;
+       head->next = first;
 
-    last->next = at;
-    at->prev = last;
+       last->next = at;
+       at->prev = last;
 }
 
 /**
@@ -167,9 +176,10 @@ static inline void __list_splice(struct list_head *list,
  * @list: the new list to add.
  * @head: the place to add it in the first list.
  */
-static inline void list_splice(struct list_head *list, struct list_head *head) {
-    if (!list_empty(list))
-        __list_splice(list, head);
+static inline void list_splice(struct list_head *list, struct list_head *head)
+{
+       if (!list_empty(list))
+               __list_splice(list, head);
 }
 
 /**
@@ -180,15 +190,14 @@ static inline void list_splice(struct list_head *list, struct list_head *head) {
  * The list at @list is reinitialised
  */
 static inline void list_splice_init(struct list_head *list,
-                                    struct list_head *head) {
-    if (!list_empty(list)) {
-        __list_splice(list, head);
-        INIT_LIST_HEAD(list);
-    }
+                                   struct list_head *head)
+{
+       if (!list_empty(list)) {
+               __list_splice(list, head);
+               INIT_LIST_HEAD(list);
+       }
 }
 
-
-
 #define _offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
 #define container_of(ptr, type, member) ({                      \
         const typeof( ((type *)0)->member ) *__mptr = (ptr);    \