list.h: Don't use "new" as an variable name.

[paraslash.git] / list.h

diff --git a/list.h b/list.h
index 4827e8e7ec9d155cdad1b27591994ee8b8e10b6f..da66e6bd815e0e49032fbfa21c859d24bb314d86 100644 (file)
--- a/list.h
+++ b/list.h
@@ -32,33 +32,33 @@ struct list_head {
 /**
  * Insert a new entry after the specified head.
  *
- * \param new The new entry to add.
+ * \param entry The new entry to add.
  * \param head The list head to add it after.
  *
  * This is good for implementing stacks.
  */
-static inline void para_list_add(struct list_head *new, struct list_head *head)
+static inline void para_list_add(struct list_head *entry, struct list_head *head)
 {
-       new->prev = head;
-       new->next = head->next;
-       head->next->prev = new;
-       head->next = new;
+       entry->prev = head;
+       entry->next = head->next;
+       head->next->prev = entry;
+       head->next = entry;
 }
 
 /**
  * Insert a new entry before the specified head.
  *
- * \param new The new entry to add.
+ * \param entry The new entry to add.
  * \param head list head to add it before.
  *
  * This is useful for implementing queues.
  */
-static inline void list_add_tail(struct list_head *new, struct list_head *head)
+static inline void list_add_tail(struct list_head *entry, struct list_head *head)
 {
-       new->prev = head->prev;
-       new->next = head;
-       head->prev->next = new;
-       head->prev = new;
+       entry->prev = head->prev;
+       entry->next = head;
+       head->prev->next = entry;
+       head->prev = entry;
 }
 
 /**