X-Git-Url: http://www.aleph1.co.uk/gitweb/?p=yaffs2.git;a=blobdiff_plain;f=devextras.h;h=7df46dc2921cb8c686ad253360ce18b4967a1f18;hp=55c31219d3dd7bb09b567900e0f73da18a52b903;hb=30baeed47b026db1d7c3a31c0bac7413887e38f5;hpb=e8cfe05cf0d057f6978c37943e51b17bb14664e3

diff --git a/devextras.h b/devextras.h
index 55c3121..7df46dc 100644
--- a/devextras.h
+++ b/devextras.h
@@ -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.
  */
 
@@ -44,25 +44,43 @@ struct ylist_head {
 };
 
 
+/* Initialise a static list */
+#define YLIST_HEAD(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;
 	newEntry->next = listNext;
 	listNext->prev = 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;
+
 }
 
 
@@ -72,10 +90,10 @@ 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;
-	
+
 }
 
 static __inline__ void ylist_del_init(struct ylist_head *entry)
@@ -95,8 +113,8 @@ static __inline__ int ylist_empty(struct ylist_head *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)))
 
@@ -106,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__)
@@ -141,7 +159,8 @@ static __inline__ int ylist_empty(struct ylist_head *entry)
 #endif
 
 /*
- * Attribute flags.
+ * Attribute flags.  These should be or-ed together to figure out what
+ * has been changed!
  */
 #define ATTR_MODE	1
 #define ATTR_UID	2
@@ -151,7 +170,6 @@ static __inline__ int ylist_empty(struct ylist_head *entry)
 #define ATTR_MTIME	32
 #define ATTR_CTIME	64
 
-
 struct iattr {
 	unsigned int ia_valid;
 	unsigned ia_mode;
@@ -166,9 +184,6 @@ struct iattr {
 
 #endif
 
-
-#define KERN_DEBUG
-
 #else
 
 #include <linux/types.h>