tabs->spaces

1 files changed, 72 insertions, 72 deletions

diff --git a/list.h b/list.h
index d8dfa27..132070d 100644
--- a/list.h
+++ b/list.h
@@ -19,16 +19,16 @@
  */
 
 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)
+    struct list_head name = LIST_HEAD_INIT(name)
 
 #define INIT_LIST_HEAD(ptr) do { \
-	(ptr)->next = (ptr); (ptr)->prev = (ptr); \
+    (ptr)->next = (ptr); (ptr)->prev = (ptr); \
 } while (0)
 
 /*
@@ -38,13 +38,13 @@ struct list_head {
  * the prev/next entries already!
  */
 static inline 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;
 }
 
 /**
@@ -57,7 +57,7 @@ static inline void __list_add(struct list_head *new,
  */
 static inline void
 list_add(struct list_head *new, struct list_head *head) {
-	__list_add(new, head, head->next);
+    __list_add(new, head, head->next);
 }
 
 /**
@@ -70,7 +70,7 @@ list_add(struct list_head *new, struct list_head *head) {
  */
 static inline void
 list_add_tail(struct list_head *new, struct list_head *head) {
-	__list_add(new, head->prev, head);
+    __list_add(new, head->prev, head);
 }
 
 /*
@@ -82,8 +82,8 @@ list_add_tail(struct list_head *new, struct list_head *head) {
  */
 static inline void
 __list_del(struct list_head *prev, struct list_head *next) {
-	next->prev = prev;
-	prev->next = next;
+    next->prev = prev;
+    prev->next = next;
 }
 
 /**
@@ -94,9 +94,9 @@ __list_del(struct list_head *prev, struct list_head *next) {
  */
 static inline 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;
 }
 
 /**
@@ -105,8 +105,8 @@ list_del(struct list_head *entry) {
  */
 static inline 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); 
 }
 
 /**
@@ -137,19 +137,19 @@ list_move_tail(struct list_head *list, struct list_head *head) {
  */
 static inline int
 list_empty(struct list_head *head) {
-	return head->next == head;
+    return head->next == head;
 }
 
 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;
-	last->next = at;
-	at->prev = last;
+    struct list_head *first = list->next;
+    struct list_head *last = list->prev;
+    struct list_head *at = head->next;
+
+    first->prev = head;
+    head->next = first;
+    last->next = at;
+    at->prev = last;
 }
 
 /**
@@ -159,8 +159,8 @@ __list_splice(struct list_head *list, struct list_head *head) {
  */
 static inline 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);
 }
 
 /**
@@ -172,70 +172,70 @@ list_splice(struct list_head *list, struct list_head *head) {
  */
 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);
-	}
+    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)))
+    ((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.
+ * list_for_each    -    iterate over a 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)
+    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)
-        	
+    for (pos = (head)->prev; pos != (head); \
+            pos = pos->prev)
+            
 /**
- * list_for_each_safe	-	iterate over a list safe against removal
- * @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.
+ * list_for_each_safe    -    iterate over a list safe against removal
+ * @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)
+    for (pos = (head)->next, n = pos->next; pos != (head); \
+        pos = n, n = pos->next)
 
 /**
- * list_for_each_entry	-	iterate over list of given type
- * @pos:	the type * to use as a loop counter.
- * @head:	the head for your list.
- * @member:	the name of the list_struct within the struct.
+ * list_for_each_entry    -    iterate over list of given type
+ * @pos:    the type * to use as a loop counter.
+ * @head:    the head for your list.
+ * @member:    the name of the list_struct within the struct.
  */
-#define list_for_each_entry(pos, head, member)				\
-	for (pos = list_entry((head)->next, typeof(*pos), member);	\
-	     &pos->member != (head); 					\
-	     pos = list_entry(pos->member.next, typeof(*pos), member))
+#define list_for_each_entry(pos, head, member)                \
+    for (pos = list_entry((head)->next, typeof(*pos), member);    \
+         &pos->member != (head);                     \
+         pos = list_entry(pos->member.next, typeof(*pos), member))
 
 /**
  * list_for_each_entry_safe - iterate list entries safe against removal
- * @pos:	the type * to use as a loop counter.
- * @n:		another type * to use as temporary storage
- * @head:	the head for your list.
- * @member:	the name of the list_struct within the struct.
- */
-#define list_for_each_entry_safe(pos, n, head, member)			\
-	for (pos = list_entry((head)->next, typeof(*pos), member),	\
-		n = list_entry(pos->member.next, typeof(*pos), member);	\
-	     &pos->member != (head); 					\
-	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
+ * @pos:    the type * to use as a loop counter.
+ * @n:        another type * to use as temporary storage
+ * @head:    the head for your list.
+ * @member:    the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_safe(pos, n, head, member)            \
+    for (pos = list_entry((head)->next, typeof(*pos), member),    \
+        n = list_entry(pos->member.next, typeof(*pos), member);    \
+         &pos->member != (head);                     \
+         pos = n, n = list_entry(n->member.next, typeof(*n), member))
 
 #endif