yaffs: Batter read-only support handling

[yaffs2.git] / devextras.h

diff --git a/devextras.h b/devextras.h
index 55c31219d3dd7bb09b567900e0f73da18a52b903..ce30c820d938818ccce765fbe7cfe517dabc84cc 100644 (file)
--- a/devextras.h
+++ b/devextras.h
@@ -1,7 +1,7 @@
 /*
  * YAFFS: Yet another Flash File System . A NAND-flash specific file system.
  *
- * Copyright (C) 2002-2007 Aleph One Ltd.
+ * Copyright (C) 2002-2010 Aleph One Ltd.
  *   for Toby Churchill Ltd and Brightstar Engineering
  *
  * Created by Charles Manning <charles@aleph1.co.uk>
@@ -24,6 +24,8 @@
 #define __EXTRAS_H__
 
 
+#include "yportenv.h"
+
 #if !(defined __KERNEL__)
 
 /* Definition of types */
@@ -33,85 +35,6 @@ typedef unsigned __u32;
 
 #endif
 
-/*
- * This is a simple doubly linked list implementation that matches the 
- * way the Linux kernel doubly linked list implementation works.
- */
-
-struct ylist_head {
-       struct ylist_head *next; /* next in chain */
-       struct ylist_head *prev; /* previous in chain */
-};
-
-
-/* Initialise a list head to an empty list */
-#define YINIT_LIST_HEAD(p) \
-do { \
- (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)
-{
-       struct ylist_head *listNext = list->next;
-       
-       list->next = newEntry;
-       newEntry->prev = list;
-       newEntry->next = listNext;
-       listNext->prev = newEntry;
-       
-}
-
-
-/* Take an element out of its current list, with or without
- * 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;
-       
-}
-
-static __inline__ void ylist_del_init(struct ylist_head *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);
-}
-
-
-/* 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)))
-
-
-/* ylist_for_each and list_for_each_safe  iterate over lists.
- * ylist_for_each_safe uses temporary storage to make the list delete safe
- */
-
-#define ylist_for_each(itervar, list) \
-       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)
-
 
 #if !(defined __KERNEL__)
 
@@ -141,7 +64,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 +75,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 +89,6 @@ struct iattr {
 
 #endif
 
-
-#define KERN_DEBUG
-
 #else
 
 #include <linux/types.h>