需要注意的一點(diǎn)是，頭結(jié)點(diǎn)head是不使用的，這點(diǎn)需要注意。

使用list_head組織的鏈表的結(jié)構(gòu)如下圖所示：

      然后就開始圍繞這個(gè)結(jié)構(gòu)開始構(gòu)建鏈表，然后插入、刪除節(jié)點(diǎn) ，遍歷整個(gè)鏈表等等，其實(shí)內(nèi)核已經(jīng)提供好了現(xiàn)成的接口，接下來(lái)就讓我們進(jìn)入 kernel/include/linux/list.h中：

一. 創(chuàng)建鏈表

    內(nèi)核提供了下面的這些接口來(lái)初始化鏈表：

#define LIST_HEAD_INIT(name) { &(name), &(name) } #define LIST_HEAD(name) \ struct list_head name = LIST_HEAD_INIT(name) static inline void INIT_LIST_HEAD(struct list_head *list){ WRITE_ONCE(list->next, list); list->prev = list;}

structlist_head mylist = {&mylist, &mylist} ;

struct mylist{ int type; char name[MAX_NAME_LEN]; struct list_head list;}

structlist_head myhead; INIT_LIST_HEAD(&myhead);

/** * list_add - add a new entry * @new: new entry to be added * @head: list head to add it after * * Insert a new entry after the specified head. * This is good for implementing stacks. */static inline void list_add(struct list_head *new, struct list_head *head){ __list_add(new, head, head->next);}

/* * Insert a new entry between two known consecutive entries. * * This is only for internal list manipulation where we know * the prev/next entries already! */static inline void __list_add(struct list_head *new, struct list_head *prev, struct list_head *next){ if (!__list_add_valid(new, prev, next)) return;  next->prev = new;