White space cleanup

[Project_algorithmic_C.git] / lib / list.h

diff --git a/lib/list.h b/lib/list.h
index 3a7688566a67afbd1b0c462216aeca33c905a4ca..98b5b259de0c4db8f0acb96446ccd5c9a0bff5e1 100644 (file)
--- a/lib/list.h
+++ b/lib/list.h
@@ -1,8 +1,8 @@
 #ifndef __LIST_H
 #define __LIST_H
 
-/* This file is from Linux Kernel (include/linux/list.h) 
- * and modified by simply removing hardware prefetching of list items. 
+/* This file is from Linux Kernel (include/linux/list.h)
+ * and modified by simply removing hardware prefetching of list items.
  * Here by copyright, credits attributed to wherever they belong.
  * Kulesh Shanmugasundaram (kulesh [squiggly] isis.poly.edu)
  */
@@ -31,7 +31,7 @@ struct list_head {
 } while (0)
 
 /*
- * Insert a new entry between two known consecutive entries. 
+ * Insert a new entry between two known consecutive entries.
  *
  * This is only for internal list manipulation where we know
  * the prev/next entries already!
@@ -104,7 +104,7 @@ static inline void 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); 
+       INIT_LIST_HEAD(entry);
 }
 
 /**
@@ -205,7 +205,7 @@ static inline void list_splice_init(struct list_head *list,
 #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.