/**
* list_add - add a new entry
- * @param new new entry to be added
- * @param head list head to add it after
+ * @param new_node new entry to be added
+ * @param head list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
/**
* list_add_tail - add a new entry
- * @param new new entry to be added
- * @param head list head to add it before
+ * @param new_node new entry to be added
+ * @param head list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
}
/**
- * list_splice_init - join two lists and reinitialise the emptied list.
+ * list_splice_init - join two lists and reinitialize the emptied list.
* @param list the new list to add.
* @param head the place to add it in the first list.
*
- * The list at @list is reinitialised
+ * The list at list is reinitialized
*/
static INLINE void list_splice_init(struct list_head *list,
struct list_head *head)
* @param head the head for your list.
*/
#define list_for_each(pos, head) \
- for (pos = (head)->next, (pos->next); pos != (head); \
- pos = pos->next, (pos->next))
+ for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* __list_for_each - iterate over a list
* @param head the head for your list.
*/
#define list_for_each_prev(pos, head) \
- for (pos = (head)->prev, (pos->prev); pos != (head); \
- pos = pos->prev, (pos->prev))
+ for (pos = (head)->prev; pos != (head); pos = pos->prev)
/**
* list_for_each_safe - iterate over a list safe against removal of list entry