X-Git-Url: http://www.aleph1.co.uk/gitweb/?p=yaffs2.git;a=blobdiff_plain;f=direct%2Fyaffs_list.h;h=3038ca35ecb4e4cefcd08129368d56bf9352ef2a;hp=624cd5f1007e345b51b93b60ab63177f2108b3c0;hb=ce0a5fb9849b6dc0d1347709b28d3a34eefec662;hpb=5409719091c79983abc45bcc3070bce6786c8278

diff --git a/direct/yaffs_list.h b/direct/yaffs_list.h
index 624cd5f..3038ca3 100644
--- 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.
  *
- * 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>
@@ -24,8 +24,6 @@
 #define __YAFFS_LIST_H__
 
 
-#include "yportenv.h"
-
 /*
  * This is a simple doubly linked list implementation that matches the
  * way the Linux kernel doubly linked list implementation works.
@@ -52,7 +50,7 @@ do { \
 
 
 /* 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;
@@ -64,7 +62,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;
@@ -79,7 +77,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*/
-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;
@@ -89,7 +87,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;
@@ -97,7 +95,7 @@ static Y_INLINE void list_del_init(struct list_head *entry)
 
 
 /* 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);
 }