lib: removed hard tabs from list

replaced hard tabs with soft tabs according to coding guidelines

1 files changed, 59 insertions, 59 deletions

diff --git a/include/ouroboros/list.h b/include/ouroboros/list.h
index f446749d..5ac68d9f 100644
--- a/include/ouroboros/list.h
+++ b/include/ouroboros/list.h
@@ -37,17 +37,17 @@
  */
 
 struct list_head {
-	struct list_head * next, * prev;
+        struct list_head * next, * prev;
 };
 
 #define LIST_HEAD_INIT(name) { &(name), &(name) }
 
-#define LIST_HEAD(name) \
-	struct list_head name = LIST_HEAD_INIT(name)
+#define LIST_HEAD(name)                                 \
+        struct list_head name = LIST_HEAD_INIT(name)
 
-#define INIT_LIST_HEAD(ptr) do { \
-	(ptr)->next = (ptr); (ptr)->prev = (ptr); \
-} while (0)
+#define INIT_LIST_HEAD(ptr) do {                                \
+                (ptr)->next = (ptr); (ptr)->prev = (ptr);       \
+        } while (0)
 
 /*
  * Insert a new entry between two known consecutive entries.
@@ -56,13 +56,13 @@ struct list_head {
  * the prev/next entries already!
  */
 static void __list_add(struct list_head * new,
-			      struct list_head * prev,
-			      struct list_head * next)
+                       struct list_head * prev,
+                       struct list_head * next)
 {
-	next->prev = new;
-	new->next = next;
-	new->prev = prev;
-	prev->next = new;
+        next->prev = new;
+        new->next = next;
+        new->prev = prev;
+        prev->next = new;
 }
 
 /**
@@ -76,7 +76,7 @@ static void __list_add(struct list_head * new,
 void list_add(struct list_head * new,
               struct list_head * head)
 {
-	__list_add(new, head, head->next);
+        __list_add(new, head, head->next);
 }
 
 /**
@@ -90,7 +90,7 @@ void list_add(struct list_head * new,
 void list_add_tail(struct list_head * new,
                    struct list_head * head)
 {
-	__list_add(new, head->prev, head);
+        __list_add(new, head->prev, head);
 }
 
 /*
@@ -101,10 +101,10 @@ void list_add_tail(struct list_head * new,
  * the prev/next entries already!
  */
 static void __list_del(struct list_head * prev,
-                              struct list_head * next)
+                       struct list_head * next)
 {
-	next->prev = prev;
-	prev->next = next;
+        next->prev = prev;
+        prev->next = next;
 }
 
 /**
@@ -115,9 +115,9 @@ static void __list_del(struct list_head * prev,
  */
 void list_del(struct list_head * entry)
 {
-	__list_del(entry->prev, entry->next);
-	entry->next = (void *) 0;
-	entry->prev = (void *) 0;
+        __list_del(entry->prev, entry->next);
+        entry->next = (void *) 0;
+        entry->prev = (void *) 0;
 }
 
 /**
@@ -126,8 +126,8 @@ void list_del(struct list_head * entry)
  */
 void list_del_init(struct list_head * entry)
 {
-	__list_del(entry->prev, entry->next);
-	INIT_LIST_HEAD(entry);
+        __list_del(entry->prev, entry->next);
+        INIT_LIST_HEAD(entry);
 }
 
 /**
@@ -160,21 +160,21 @@ void list_move_tail(struct list_head * list,
  */
 int list_empty(struct list_head * head)
 {
-	return head->next == head;
+        return head->next == head;
 }
 
 static void __list_splice(struct list_head *list,
-				 struct list_head *head)
+                          struct list_head *head)
 {
-	struct list_head *first = list->next;
-	struct list_head *last = list->prev;
-	struct list_head *at = head->next;
+        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;
 }
 
 /**
@@ -185,8 +185,8 @@ static void __list_splice(struct list_head *list,
 void list_splice(struct list_head * list,
                  struct list_head * head)
 {
-	if (!list_empty(list))
-		__list_splice(list, head);
+        if (!list_empty(list))
+                __list_splice(list, head);
 }
 
 /**
@@ -199,46 +199,46 @@ void list_splice(struct list_head * list,
 void list_splice_init(struct list_head * list,
                       struct list_head * head)
 {
-	if (!list_empty(list)) {
-		__list_splice(list, head);
-		INIT_LIST_HEAD(list);
-	}
+        if (!list_empty(list)) {
+                __list_splice(list, head);
+                INIT_LIST_HEAD(list);
+        }
 }
 
 /**
  * list_entry - get the struct for this entry
- * @ptr:	the &struct list_head pointer.
- * @type:	the type of the struct this is embedded in.
- * @member:	the name of the list_struct within the struct.
+ * @ptr:        the &struct list_head pointer.
+ * @type:       the type of the struct this is embedded in.
+ * @member:     the name of the list_struct within the struct.
  */
-#define list_entry(ptr, type, member) \
-	((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
+#define list_entry(ptr, type, member)                                   \
+        ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
 
 /**
  * list_for_each - iterate over a list
- * @pos:	the &struct list_head to use as a loop counter.
- * @head:	the head for your list.
+ * @pos:        the &struct list_head to use as a loop counter.
+ * @head:       the head for your list.
  */
-#define list_for_each(pos, head) \
-	for (pos = (head)->next; pos != (head); \
-        	pos = pos->next)
+#define list_for_each(pos, head)                \
+        for (pos = (head)->next; pos != (head); \
+             pos = pos->next)
 /**
- * list_for_each_prev	-	iterate over a list backwards
- * @pos:	the &struct list_head to use as a loop counter.
- * @head:	the head for your list.
+ * list_for_each_prev   -       iterate over a list backwards
+ * @pos:        the &struct list_head to use as a loop counter.
+ * @head:       the head for your list.
  */
-#define list_for_each_prev(pos, head) \
-	for (pos = (head)->prev; pos != (head); \
-        	pos = pos->prev)
+#define list_for_each_prev(pos, head)           \
+        for (pos = (head)->prev; pos != (head); \
+             pos = pos->prev)
 
 /**
  * list_for_each_safe - iterate over a list safe against removal of list entry
- * @pos:	the &struct list_head to use as a loop counter.
- * @n:		another &struct list_head to use as temporary storage
- * @head:	the head for your list.
+ * @pos:        the &struct list_head to use as a loop counter.
+ * @n:          another &struct list_head to use as temporary storage
+ * @head:       the head for your list.
  */
-#define list_for_each_safe(pos, n, head) \
-	for (pos = (head)->next, n = pos->next; pos != (head); \
-		pos = n, n = pos->next)
+#define list_for_each_safe(pos, n, head)                        \
+        for (pos = (head)->next, n = pos->next; pos != (head);  \
+             pos = n, n = pos->next)
 
 #endif