将new所代表的list_head插入head所索引的队列的尾部 static inline void list_add_tail( struct list_head * new , struct list_head *head) { __list_add(new, head->prev, head); } 将new所代表的list_head插入到next索引的双链表(next索引双链表的第一个节点)的尾部 static inline void __list_add( struct list_head * new , struct list_head * prev, struct list_head * next) { next->prev = new; //(1) new->next = next; //(2) new->prev = prev; //(3) prev->next = new; //(4) }