1、list_add_tail

/*!* @brief list_add_tail - add a new entry** @details Insert a new entry before the specified head.* This is useful for implementing queues.** @param new_h: new entry to be added* @param head: list head to add it before*/
static inline void list_add_tail(struct list_head *new_h, struct list_head *head)
{__list_add(new_h, head->prev, head);
}
/*!* @brief Insert a new entry between two known consecutive entries.** @details This is only for internal list manipulation where we know* the prev/next entries already!*/
static inline void __list_add(struct list_head *new_h,struct list_head *prev,struct list_head *next)
{next->prev = new_h;new_h->next = next;new_h->prev = prev;prev->next = new_h;
}

2、list_for_each_entry

#define list_for_each_entry(pos, head, member)				\for (pos = list_first_entry(head, typeof(*pos), member);	\&pos->member != (head);					\pos = list_next_entry(pos, member))#define list_first_entry(ptr, type, member) \list_entry((ptr)->next, type, member)#define list_entry(ptr, type, member) \container_of(ptr, type, member)#define list_next_entry(pos, member) \list_entry((pos)->member.next, typeof(*(pos)), member)//宏展开
for (pos = container_of((head)->next, typeof(*pos), member);&pos->member != (head);pos = container_of((pos)->member.next, typeof(*(pos)), member))