@@ -68,40 +68,40 @@ struct list_head {
6868 * This is only for internal list manipulation where we know
6969 * the prev/next entries already!
7070 */
71- static inline void __list_add (struct list_head * new ,
71+ static inline void __list_add (struct list_head * elem ,
7272 struct list_head * prev ,
7373 struct list_head * next )
7474{
75- next -> prev = new ;
76- new -> next = next ;
77- new -> prev = prev ;
78- prev -> next = new ;
75+ next -> prev = elem ;
76+ elem -> next = next ;
77+ elem -> prev = prev ;
78+ prev -> next = elem ;
7979}
8080
8181/**
8282 * list_add - add a new entry
83- * @new : new entry to be added
83+ * @elem : new entry to be added
8484 * @head: list head to add it after
8585 *
8686 * Insert a new entry after the specified head.
8787 * This is good for implementing stacks.
8888 */
89- static inline void list_add (struct list_head * new , struct list_head * head )
89+ static inline void list_add (struct list_head * elem , struct list_head * head )
9090{
91- __list_add (new , head , head -> next );
91+ __list_add (elem , head , head -> next );
9292}
9393
9494/**
9595 * list_add_tail - add a new entry
96- * @new : new entry to be added
96+ * @elem : new entry to be added
9797 * @head: list head to add it before
9898 *
9999 * Insert a new entry before the specified head.
100100 * This is useful for implementing queues.
101101 */
102- static inline void list_add_tail (struct list_head * new , struct list_head * head )
102+ static inline void list_add_tail (struct list_head * elem , struct list_head * head )
103103{
104- __list_add (new , head -> prev , head );
104+ __list_add (elem , head -> prev , head );
105105}
106106
107107
0 commit comments