Have updated yaffs direct tests and added README files to the tests.

[yaffs2.git] / direct / yaffs_list.h

diff --git a/direct/yaffs_list.h b/direct/yaffs_list.h
index 624cd5f1007e345b51b93b60ab63177f2108b3c0..f1c52544b27f2c4524a4800de29c0cc11ba971e6 100644 (file)
--- a/direct/yaffs_list.h
+++ b/direct/yaffs_list.h
@@ -1,7 +1,7 @@
 /*
  * 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-2010 Aleph One Ltd.
+ * Copyright (C) 2002-2011 Aleph One Ltd.

  *   for Toby Churchill Ltd and Brightstar Engineering
  *
  * Created by Charles Manning <charles@aleph1.co.uk>
  *   for Toby Churchill Ltd and Brightstar Engineering
  *
  * Created by Charles Manning <charles@aleph1.co.uk>


@@ -52,7 +52,7 @@ do { \
 
 
 /* Add an element to a list */
 
 
 /* Add an element to a list */

-static Y_INLINE void list_add(struct list_head *new_entry,
+static inline void list_add(struct list_head *new_entry,

                                struct list_head *list)
 {
        struct list_head *list_next = list->next;
                                struct list_head *list)
 {
        struct list_head *list_next = list->next;


@@ -64,7 +64,7 @@ static Y_INLINE void list_add(struct list_head *new_entry,
 
 }
 
 
 }
 

-static Y_INLINE void list_add_tail(struct list_head *new_entry,
+static inline void list_add_tail(struct list_head *new_entry,

                                 struct list_head *list)
 {
        struct list_head *list_prev = list->prev;
                                 struct list_head *list)
 {
        struct list_head *list_prev = list->prev;


@@ -79,7 +79,7 @@ static Y_INLINE void list_add_tail(struct list_head *new_entry,
 
 /* Take an element out of its current list, with or without
  * reinitialising the links.of the entry*/
 
 /* Take an element out of its current list, with or without
  * reinitialising the links.of the entry*/

-static Y_INLINE void list_del(struct list_head *entry)
+static inline void list_del(struct list_head *entry)

 {
        struct list_head *list_next = entry->next;
        struct list_head *list_prev = entry->prev;
 {
        struct list_head *list_next = entry->next;
        struct list_head *list_prev = entry->prev;


@@ -89,7 +89,7 @@ static Y_INLINE void list_del(struct list_head *entry)
 
 }
 
 
 }
 

-static Y_INLINE void list_del_init(struct list_head *entry)
+static inline void list_del_init(struct list_head *entry)

 {
        list_del(entry);
        entry->next = entry->prev = entry;
 {
        list_del(entry);
        entry->next = entry->prev = entry;


@@ -97,7 +97,7 @@ static Y_INLINE void list_del_init(struct list_head *entry)
 
 
 /* Test if the list is empty */
 
 
 /* Test if the list is empty */

-static Y_INLINE int list_empty(struct list_head *entry)
+static inline int list_empty(struct list_head *entry)

 {
        return (entry->next == entry);
 }
 {
        return (entry->next == entry);
 }