* 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); \
/* 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;
}
-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;
/* 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)