内核链表

什么是内核链表？

      在我们以往见到的链表中，数据域和指针域是位于同一个“等级”上的成员，如下图所示

      所以我们就可以针对这个结构产生对其进行增删改查的相关函数。那什么是内核链表呢？从名字上我们可以看出内核链表不就是内核中的链表吗！说的没错，内核链表就是在linux内核中使用的链表，那它和普通的链表有什么不同之处呢？先看下图，你会发现没有了指针域，此刻你心想这TM不是扯吗？没有了指针域还能叫做链表吗？先别着急，且听我慢慢道来。

      在内核链表节点的示意图中，我们可以发现有一个数据域被“绿了”，因为他不是普通的数据域，他是一个结构体，我们暂且认为它是kernel_list类型，在这个结构体中存放了两个指向该类型指针。你是不是感觉到了什么猫腻。没错！我们就是通过内部的这个kernel_list类型的数据成员链起来，从而实现了大结构体的连接的。他们样子可能就是下图所示

为什么会有内核链表？

      介绍完内核链表，我们说说为什么会有内核链表，你想想啊。。。在linux内核中的数据结构数量是非常多的，而链表又是非常常见的。所以如果都像我们之前做的单向链表或者是双向链表，那编写内核的人就需要对不同的链表来实现增删改查（写过链表的童鞋又知道，不同链表之间的差距在函数上体现的是非常少的），这样做就会导致内核膨胀和内核代码编写人员的负担。所以他们就创造了内核链表这种东西。。

如何实现内核链表？

我们先来回顾普通双向循环链表的编写套路。

插入节点

new->next = head->next;// 1
head->next = new; // 2、3

删除节点

front->next = front->next->next;
toBDel->next = nullptr;

销毁链表

while(head)
{
	Node *temp = head->next;
	free(head);
	head = temp;
}

看完了普通双向循环链表的编写套路之后，让我们来看一看内核双向链表的编写方法。

创建链表（好像和普通链表没有什么区别嘛）

outlist_t *create_list(void)
{
	outlist_t *ret = (outlist_t *)malloc(sizeof(outlist_t));
	if(ret == NULL)
	{
		perror("create_list failed");
		return NULL;
	}
	kernel_list_init(&(ret->klist));
	return ret;
}

void kernel_list_init(kernel_list_t * klist)
{
	klist->pre = klist;
	klist->next = klist;
}

void kernel_list_remove(kernel_list_t *target)
{
target->pre->next = target->next;
target->next->pre = target->pre;
target->pre = target;
target->next = target;
}

添加节点（好像也没有什么区别啊，反正我能看懂）

int add_list_head(outlist_t *head)
{
	outlist_t *ret = (outlist_t *)malloc(sizeof(outlist_t));
	if(ret == NULL)
	{
		perror("create_list failed");
		return -1;
	}
	fprintf(stderr,"请输入姓名和工号:");
	scanf("%s %d", ret->name, &(ret->id));
	kernel_add_head(&(head->klist), &(ret->klist));	
	return 0;
}

int add_list_tail(outlist_t *head)
{
	outlist_t *ret = (outlist_t *)malloc(sizeof(outlist_t));
	if(ret == NULL)
	{
		perror("create_list failed");
		return -1;
	}
	fprintf(stderr,"请输入姓名和工号:");
	scanf("%s %d", ret->name, &(ret->id));
	kernel_add_tail(&(head->klist), &(ret->klist));	
	return 0;
}
void kernel_add_head(kernel_list_t *head, kernel_list_t *temp)
{
	temp->next = head->next;
	temp->pre = head;
	head->next->pre = temp;
	head->next = temp;
}

void kernel_add_tail(kernel_list_t *head, kernel_list_t *temp)
{
	temp->next = head;
	temp->pre = head->pre;
	head->pre->next = temp;
	head->pre = temp;
}

插入节点（你是不是多少有些不耐烦了）

销毁链表（哈哈，终于来了）

      这里我们发现了一个问题，我们怎么从kernel_list这个结构体的指针获得包含它的大结构体的指针呢？否则我们无法free这块空间。
解决方法：

#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
	上面的宏定义可以获得某成员到包含该成员的大结构体的偏移

	#define container_of(ptr, type, member) ({			\
    const typeof( ((type *)0)->member ) *__mptr = (ptr);	\
    (type *)( (char *)__mptr - offsetof(type,member) );})
	上面的宏定义可以由内部成员（kernel_list）的指针获得外面大结构体的指针

	有了以上的准备我们就可以动手写销毁链表的代码了

遍历链表（这时我们同样遇到了上面的问题，不多说了）

void show_list(outlist_t *head)
{
	outlist_t *pOut;
	kernel_list_t *pIn;

	for(pIn = head->klist.next; pIn != &(head->klist); pIn = pIn->next)
	{
		pOut = container_of(pIn, outlist_t, klist);
		printf("%s, %d\n", pOut->name, pOut->id);
	}
}

附上一个网上找到的内核链表的文件

#ifndef __DLIST_H
#define __DLIST_H

/* This file is from Linux Kernel (include/linux/list.h)
* and modified by simply removing hardware prefetching of list items.
* Here by copyright, credits attributed to wherever they belong.
* Kulesh Shanmugasundaram (kulesh [squiggly] isis.poly.edu)
*/

/*
* Simple doubly linked list implementation.
*
* Some of the internal functions (“__xxx”) are useful when
* manipulating whole lists rather than single entries, as
* sometimes we already know the next/prev entries and we can
* generate better code by using them directly rather than
* using the generic single-entry routines.
*/
/**
 * container_of - cast a member of a structure out to the containing structure
 *
 * @ptr:	the pointer to the member.
 * @type:	the type of the container struct this is embedded in.
 * @member:	the name of the member within the struct.
 *
 */
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)

#define container_of(ptr, type, member) ({			\
        const typeof( ((type *)0)->member ) *__mptr = (ptr);	\
        (type *)( (char *)__mptr - offsetof(type,member) );})
/*
 * These are non-NULL pointers that will result in page faults
 * under normal circumstances, used to verify that nobody uses
 * non-initialized list entries.
 */
#define LIST_POISON1  ((void *) 0x00100100)
#define LIST_POISON2  ((void *) 0x00200)

struct list_head {
	struct list_head *next, *prev;
};

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)

#define INIT_LIST_HEAD(ptr) do { \
	(ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)

/*
* 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)
{
	next->prev = new;
	new->next = next;
	new->prev = prev;
	prev->next = new;
}

/**
* 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);
}

/**
* list_add_tail – add a new entry
* @new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
	__list_add(new, head->prev, head);
}

/*
* Delete a list entry by making the prev/next entries
* point to each other.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline void __list_del(struct list_head *prev, struct list_head *next)
{
	next->prev = prev;
	prev->next = next;
}

/**
* list_del – deletes entry from list.
* @entry: the element to delete from the list.
* Note: list_empty on entry does not return true after this, the entry is in an undefined state.
*/
static inline void list_del(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
	entry->next = (void *) 0;
	entry->prev = (void *) 0;
}

/**
* list_del_init – deletes entry from list and reinitialize it.
* @entry: the element to delete from the list.
*/
static inline void list_del_init(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
	INIT_LIST_HEAD(entry);
}

/**
* list_move – delete from one list and add as another’s head
* @list: the entry to move
* @head: the head that will precede our entry
*/
static inline void list_move(struct list_head *list,
				struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add(list, head);
}

/**
* list_move_tail – delete from one list and add as another’s tail
* @list: the entry to move
* @head: the head that will follow our entry
*/
static inline void list_move_tail(struct list_head *list,
					struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add_tail(list, head);
}

/**
* list_empty – tests whether a list is empty
* @head: the list to test.
*/
static inline int list_empty(struct list_head *head)
{
	return head->next == head;
}
/**
	合并两个链表，这里我们可以看出，head节点是不存储数据的
*/
static inline void __list_splice(struct list_head *list,
					struct list_head *head)
{
	struct list_head *first = list->next;
	struct list_head *last = list->prev;
	struct list_head *at = head->next;

	first->prev = head;
	head->next = first;

	last->next = at;
	at->prev = last;
}

/**
* list_splice – join two lists
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
static inline void list_splice(struct list_head *list, struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head);
}

/**
* list_splice_init – join two lists and reinitialise the emptied list.
* @list: the new list to add.
* @head: the place to add it in the first list.
*
* The list at @list is reinitialised
*/
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head);
INIT_LIST_HEAD(list);
}
}

/**
* list_entry – get the struct for this entry
* @ptr:    the &struct list_head pointer.
* @type:    the type of the struct this is embedded in.
* @member:    the name of the list_struct within the struct.
*/
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

/**
* list_for_each    -    iterate over a list
* @pos:    the &struct list_head to use as a loop counter.
* @head:    the head for your list.
*/
#define list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); \
pos = pos->next)
/**
* list_for_each_prev    -    iterate over a list backwards
* @pos:    the &struct list_head to use as a loop counter.
* @head:    the head for your list.
*/
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; pos != (head); \
pos = pos->prev)

/**
* list_for_each_safe    -    iterate over a list safe against removal of list entry
* @pos:    the &struct list_head to use as a loop counter.
* @n:        another &struct list_head to use as temporary storage
* @head:    the head for your list.
*/
#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)

/**
* list_for_each_entry    -    iterate over list of given type
* @pos:    the type * to use as a loop counter.
* @head:    the head for your list.
* @member:    the name of the list_struct within the struct.
*/
#define list_for_each_entry(pos, head, member)                \
for (pos = list_entry((head)->next, typeof(*pos), member);    \
&pos->member != (head);                     \
pos = list_entry(pos->member.next, typeof(*pos), member))

/**
* list_for_each_entry_safe – iterate over list of given type safe against removal of list entry
* @pos:    the type * to use as a loop counter.
* @n:        another type * to use as temporary storage
* @head:    the head for your list.
* @member:    the name of the list_struct within the struct.
*/
#define list_for_each_entry_safe(pos, n, head, member)            \
for (pos = list_entry((head)->next, typeof(*pos), member),    \
n = list_entry(pos->member.next, typeof(*pos), member);    \
&pos->member != (head);                     \
pos = n, n = list_entry(n->member.next, typeof(*n), member))

#endif