X-Git-Url: https://yaffs.net/gitweb/?p=yaffs2.git;a=blobdiff_plain;f=direct%2Fyaffs_list.h;fp=yaffs_list.h;h=624cd5f1007e345b51b93b60ab63177f2108b3c0;hp=145a1c5aca94f1ac6d98a6cc5a8399cee17e6ba6;hb=757a553001be4016e9c5d8880648d3703f34b10e;hpb=9131fecc79ad4e5fbdb775cdc067bc80aae5adb8

diff --git a/yaffs_list.h b/direct/yaffs_list.h
similarity index 64%
rename from yaffs_list.h
rename to direct/yaffs_list.h
index 145a1c5..624cd5f 100644
--- a/yaffs_list.h
+++ b/direct/yaffs_list.h
@@ -31,20 +31,20 @@
  * 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 */
+struct list_head {
+	struct list_head *next; /* next in chain */
+	struct list_head *prev; /* previous in chain */
 };
 
 
 /* Initialise a static list */
-#define YLIST_HEAD(name) \
-struct ylist_head name = { &(name), &(name)}
+#define LIST_HEAD(name) \
+struct list_head name = { &(name), &(name)}
 
 
 
 /* Initialise a list head to an empty list */
-#define YINIT_LIST_HEAD(p) \
+#define INIT_LIST_HEAD(p) \
 do { \
 	(p)->next = (p);\
 	(p)->prev = (p); \
@@ -52,10 +52,10 @@ do { \
 
 
 /* Add an element to a list */
-static Y_INLINE void ylist_add(struct ylist_head *new_entry,
-				struct ylist_head *list)
+static Y_INLINE void list_add(struct list_head *new_entry,
+				struct list_head *list)
 {
-	struct ylist_head *list_next = list->next;
+	struct list_head *list_next = list->next;
 
 	list->next = new_entry;
 	new_entry->prev = list;
@@ -64,10 +64,10 @@ static Y_INLINE void ylist_add(struct ylist_head *new_entry,
 
 }
 
-static Y_INLINE void ylist_add_tail(struct ylist_head *new_entry,
-				 struct ylist_head *list)
+static Y_INLINE void list_add_tail(struct list_head *new_entry,
+				 struct list_head *list)
 {
-	struct ylist_head *list_prev = list->prev;
+	struct list_head *list_prev = list->prev;
 
 	list->prev = new_entry;
 	new_entry->next = list;
@@ -79,47 +79,47 @@ static Y_INLINE void ylist_add_tail(struct ylist_head *new_entry,
 
 /* Take an element out of its current list, with or without
  * reinitialising the links.of the entry*/
-static Y_INLINE void ylist_del(struct ylist_head *entry)
+static Y_INLINE void list_del(struct list_head *entry)
 {
-	struct ylist_head *list_next = entry->next;
-	struct ylist_head *list_prev = entry->prev;
+	struct list_head *list_next = entry->next;
+	struct list_head *list_prev = entry->prev;
 
 	list_next->prev = list_prev;
 	list_prev->next = list_next;
 
 }
 
-static Y_INLINE void ylist_del_init(struct ylist_head *entry)
+static Y_INLINE void list_del_init(struct list_head *entry)
 {
-	ylist_del(entry);
+	list_del(entry);
 	entry->next = entry->prev = entry;
 }
 
 
 /* Test if the list is empty */
-static Y_INLINE int ylist_empty(struct ylist_head *entry)
+static Y_INLINE int list_empty(struct list_head *entry)
 {
 	return (entry->next == entry);
 }
 
 
-/* ylist_entry takes a pointer to a list entry and offsets it to that
+/* list_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) \
+#define list_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
+/* list_for_each and list_for_each_safe  iterate over lists.
+ * list_for_each_safe uses temporary storage to make the list delete safe
  */
 
-#define ylist_for_each(itervar, list) \
+#define list_for_each(itervar, list) \
 	for (itervar = (list)->next; itervar != (list); itervar = itervar->next)
 
-#define ylist_for_each_safe(itervar, save_var, list) \
+#define list_for_each_safe(itervar, save_var, list) \
 	for (itervar = (list)->next, save_var = (list)->next->next; \
 		itervar != (list); itervar = save_var, save_var = save_var->next)