Rationalise context and parameter handling

[yaffs2.git] / devextras.h

diff --git a/devextras.h b/devextras.h
index a9366fdd2e79b182750938d655036f7928c99ceb..7df46dc2921cb8c686ad253360ce18b4967a1f18 100644 (file)
--- a/devextras.h
+++ b/devextras.h
@@ -1,5 +1,5 @@
 /*
- * YAFFS: Yet another Flash File System . A NAND-flash specific file system. 
+ * YAFFS: Yet another Flash File System . A NAND-flash specific file system.
  *
  * Copyright (C) 2002-2007 Aleph One Ltd.
  *   for Toby Churchill Ltd and Brightstar Engineering
@@ -24,7 +24,7 @@
 #define __EXTRAS_H__
 
 
-#if !(defined __KERNEL__) 
+#if !(defined __KERNEL__)
 
 /* Definition of types */
 typedef unsigned char __u8;
@@ -34,7 +34,7 @@ typedef unsigned __u32;
 #endif
 
 /*
- * This is a simple doubly linked list implementation that matches the 
+ * This is a simple doubly linked list implementation that matches the
  * way the Linux kernel doubly linked list implementation works.
  */
 
@@ -46,41 +46,41 @@ struct ylist_head {
 
 /* Initialise a static list */
 #define YLIST_HEAD(name) \
-struct ylist_head name = { &(name),&(name)}
+struct ylist_head name = { &(name), &(name)}
 
 
 
 /* Initialise a list head to an empty list */
 #define YINIT_LIST_HEAD(p) \
 do { \
- (p)->next = (p);\
- (p)->prev = (p); \
-} while(0)
+       (p)->next = (p);\
+       (p)->prev = (p); \
+} while (0)
 
 
 /* Add an element to a list */
-static __inline__ void ylist_add(struct ylist_head *newEntry, 
-                                 struct ylist_head *list)
+static __inline__ void ylist_add(struct ylist_head *newEntry,
+                               struct ylist_head *list)
 {
-        struct ylist_head *listNext = list->next;
-        
-        list->next = newEntry;
-        newEntry->prev = list;
+       struct ylist_head *listNext = list->next;
+
+       list->next = newEntry;
+       newEntry->prev = list;
        newEntry->next = listNext;
        listNext->prev = newEntry;
-       
+
 }
 
-static __inline__ void ylist_add_tail(struct ylist_head *newEntry, 
+static __inline__ void ylist_add_tail(struct ylist_head *newEntry,
                                 struct ylist_head *list)
 {
        struct ylist_head *listPrev = list->prev;
-       
+
        list->prev = newEntry;
        newEntry->next = list;
        newEntry->prev = listPrev;
        listPrev->next = newEntry;
-       
+
 }
 
 
@@ -88,35 +88,35 @@ static __inline__ void ylist_add_tail(struct ylist_head *newEntry,
  * reinitialising the links.of the entry*/
 static __inline__ void ylist_del(struct ylist_head *entry)
 {
-        struct ylist_head *listNext = entry->next;
-        struct ylist_head *listPrev = entry->prev;
-        
-        listNext->prev = listPrev;
-        listPrev->next = listNext;
-        
+       struct ylist_head *listNext = entry->next;
+       struct ylist_head *listPrev = entry->prev;
+
+       listNext->prev = listPrev;
+       listPrev->next = listNext;
+
 }
 
 static __inline__ void ylist_del_init(struct ylist_head *entry)
 {
-        ylist_del(entry);
-        entry->next = entry->prev = entry;
+       ylist_del(entry);
+       entry->next = entry->prev = entry;
 }
 
 
 /* Test if the list is empty */
 static __inline__ int ylist_empty(struct ylist_head *entry)
 {
-        return (entry->next == entry);
+       return (entry->next == entry);
 }
 
 
 /* ylist_entry takes a pointer to a list entry and offsets it to that
  * we can find a pointer to the object it is embedded in.
  */
- 
- 
+
+
 #define ylist_entry(entry, type, member) \
-        ((type *)((char *)(entry)-(unsigned long)(&((type *)NULL)->member)))
+       ((type *)((char *)(entry)-(unsigned long)(&((type *)NULL)->member)))
 
 
 /* ylist_for_each and list_for_each_safe  iterate over lists.
@@ -124,11 +124,11 @@ static __inline__ int ylist_empty(struct ylist_head *entry)
  */
 
 #define ylist_for_each(itervar, list) \
-        for (itervar = (list)->next; itervar != (list); itervar = itervar->next )
+       for (itervar = (list)->next; itervar != (list); itervar = itervar->next)
 
-#define ylist_for_each_safe(itervar,saveVar, list) \
-        for (itervar = (list)->next, saveVar = (list)->next->next; itervar != (list); \
-         itervar = saveVar, saveVar = saveVar->next)
+#define ylist_for_each_safe(itervar, saveVar, list) \
+       for (itervar = (list)->next, saveVar = (list)->next->next; \
+               itervar != (list); itervar = saveVar, saveVar = saveVar->next)
 
 
 #if !(defined __KERNEL__)
@@ -143,15 +143,15 @@ static __inline__ int ylist_empty(struct ylist_head *entry)
 /* File types */
 
 
-#define DT_UNKNOWN      0
-#define DT_FIFO         1
-#define DT_CHR          2
+#define DT_UNKNOWN     0
+#define DT_FIFO                1
+#define DT_CHR         2
 #define DT_DIR         4
 #define DT_BLK         6
-#define DT_REG          8
-#define DT_LNK          10
-#define DT_SOCK         12
-#define DT_WHT          14
+#define DT_REG         8
+#define DT_LNK         10
+#define DT_SOCK                12
+#define DT_WHT         14
 
 
 #ifndef WIN32
@@ -162,8 +162,8 @@ static __inline__ int ylist_empty(struct ylist_head *entry)
  * Attribute flags.  These should be or-ed together to figure out what
  * has been changed!
  */
-#define ATTR_MODE       1
-#define ATTR_UID        2
+#define ATTR_MODE      1
+#define ATTR_UID       2
 #define ATTR_GID       4
 #define ATTR_SIZE      8
 #define ATTR_ATIME     16
@@ -179,14 +179,11 @@ struct iattr {
        unsigned ia_atime;
        unsigned ia_mtime;
        unsigned ia_ctime;
-        unsigned int ia_attr_flags;
+       unsigned int ia_attr_flags;
 };
 
 #endif
 
-
-#define KERN_DEBUG
-
 #else
 
 #include <linux/types.h>