Avoid use of C++ keywords

diff --git a/include/list.h b/include/list.h
index 65c81422c522e646b2bc0a6893a323d8aed6a6f7..5b3f1bf0a63c95cf9e5ee25d39c5aff90b76b1e9 100644 (file)
--- a/include/list.h
+++ b/include/list.h
@@ -36,14 +36,14 @@ struct list_head {
  * This is only for internal list manipulation where we know
  * the prev/next entries already!
  */
-static __inline__ void __list_add(struct list_head * new,
-       struct list_head * prev,
-       struct list_head * next)
+static __inline__ void __list_add(struct list_head * _new,
+                                 struct list_head * prev,
+                                 struct list_head * next)
 {
-       next->prev = new;
-       new->next = next;
-       new->prev = prev;
-       prev->next = new;
+       next->prev = _new;
+       _new->next = next;
+       _new->prev = prev;
+       prev->next = _new;
 }
 
 /**
@@ -54,9 +54,9 @@ static __inline__ void __list_add(struct list_head * new,
  * Insert a new entry after the specified head.
  * This is good for implementing stacks.
  */
-static __inline__ void list_add(struct list_head *new, struct list_head *head)
+static __inline__ void list_add(struct list_head *_new, struct list_head *head)
 {
-       __list_add(new, head, head->next);
+       __list_add(_new, head, head->next);
 }
 
 /**
@@ -67,9 +67,9 @@ static __inline__ void list_add(struct list_head *new, struct list_head *head)
  * Insert a new entry before the specified head.
  * 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 *_new, struct list_head *head)
 {
-       __list_add(new, head->prev, head);
+       __list_add(_new, head->prev, head);
 }
 
 /*