/**
* 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;
}
/**
/**
* Delete an entry from one list and add it as another list's head.
*
- * \param list The entry to move.
+ * \param entry The entry to move.
* \param head The head that will precede our entry.
*/
-static inline void list_move(struct list_head *list, struct list_head *head)
+static inline void list_move(struct list_head *entry, struct list_head *head)
{
- list_del(list);
- para_list_add(list, head);
+ list_del(entry);
+ para_list_add(entry, head);
}
/**