linux内核中的链表不同于我们在数据结构中学习的链表。一般的我们定义一个单链表节点，我们会在节点中给出指针域和数据域，比如：
struct listNode
{
struct listNode *next;
ElemType data;
};但是这会有个不好的地方，对于不同的数据域的类型，我们要编写不同的链表实现，当然我们也可以用宏定义或者C++中的模板来处理。
linux内核中给出一个更加巧妙的方法，在链表节点中只包含指针域，通过在具体需要链接的数据类型（struct类型）中定义一个链表节点的成员来完成数据类型的链接，这样这个链表结构就能通用。
linux内核链表实现的是一个双向循环链表，是一个高度抽象的数据结构，里面包含面向对象的思想，经过转换可以变成栈、队列、树等数据结构。具体实现如下（linux内核2.6.32版本）：
（1）通过链表节点怎么访问到struct类型中的其它数据成员
linux内核中通过下面两个宏定义实现：
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)TYPE：struct类型
MEMBER：struct类型的成员变量
该宏定义是获取成员变量MEMBER在TYPE中的字节偏移量。
测试代码：
#include <stdio.h>
#define offsetof(TYPE, MEMBER) ((size_t)&((TYPE *)0)->MEMBER)
struct A
{
char c;
int i;
float f;
};
int main()
{
printf("%d\n", offsetof(struct A, c));
printf("%d\n", offsetof(struct A, i));
printf("%d\n", offsetof(struct A, f));
return 0;
}运行结果：
注意：这里有内存对齐
#define container_of(ptr, type, member) ({ \
const typeof(((type *)0)->member) * __mptr = (ptr); \
(type *)((char *)__mptr - offsetof(type, member)); })ptr：member成员的指针
type：struct类型
member：member成员名
首先
const typeof(((type *)0)->member) * __mptr = (ptr);声明并定义member指针__mptr指向ptr。
然后
(type *)((char *)__mptr - offsetof(type, member));将__mptr转换为char*指针，再减去其偏移量，从而获得结构体类型的入口地址。
测试代码：
#include <stdio.h>
#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)); })
struct A
{
char c;
int i;
float f;
};
int main()
{
struct A a;
int *pi=&(a.i);
struct A* pa=container_of(pi, struct A, i);
printf("&a: %p\n", &a);
printf("pa: %p\n", pa);
return 0;
}运行结果：
（2）链表节点定义
struct list_head {
struct list_head *next, *prev;
};包含两个指针域，next指向下一个节点，prev指向前一个节点。
（3）链表初始化
#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)
{
list->next = list;
list->prev = list;
}初始化的方法就是让头节点的next和prev都指向自己。
前两个宏定义完成声明并初始化的过程；后面有个初始化函数是在运行过程中初始化。
（4）插入节点
头插：
static inline void list_add(struct list_head *new, struct list_head *head)
{
__list_add(new, head, head->next);
}尾插：
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
__list_add(new, head->prev, head);
}头插和尾插都是通过下面通用插入方法实现，已知前一个节点（prev）和后一个节点（next），在中间插入新的节点（new），程序中首先判断链表插入有效性，然后在进行相关指针赋值操作，注意这里是双向链表，不需要赋值之前保存节点指针。
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;
}（5）删除节点
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
next->prev = prev;
prev->next = next;
}static inline void list_del(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
entry->next = LIST_POISON1;
entry->prev = LIST_POISON2;
}static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}__list_del函数是一个内部函数，对于双向循环链表，删除一个节点，只需要知道删除节点的前一个节点和后一个节点。实际删除函数list_del，删除节点entry，并且最后将entry的指针域指向两个用户空间不能访问的地址。
（6）替换节点
static inline void list_replace(struct list_head *old,
struct list_head *new)
{
new->next = old->next;
new->next->prev = new;
new->prev = old->prev;
new->prev->next = new;
}
static inline void list_replace_init(struct list_head *old,
struct list_head *new)
{
list_replace(old, new);
INIT_LIST_HEAD(old);
}（7）移动
static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}
static inline void list_move(struct list_head *list, struct list_head *head)
{
__list_del(list->prev, list->next);
list_add(list, head);
}
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);
}
（8）判断节点是否是链表尾节点
static inline int list_is_last(const struct list_head *list,
const struct list_head *head)
{
return list->next == head;
}节点的next指针域指向头节点，则为尾节点。
（9）判读链表是否为空
static inline int list_empty(const struct list_head *head)
{
return head->next == head;
}表头的next指针域指向自己，则为空链表。
static inline int list_empty_careful(const struct list_head *head)
{
struct list_head *next = head->next;
return (next == head) && (next == head->prev);
}仔细判空，判断prev域和next域。
（10）判读链表是否只有一个节点
static inline int list_is_singular(const struct list_head *head)
{
return !list_empty(head) && (head->next == head->prev);
}首先判断链表是否非空，然后判读头节点的next的prev是否相等。
（11）链表切片
static inline void __list_cut_position(struct list_head *list,
struct list_head *head, struct list_head *entry)
{
struct list_head *new_first = entry->next;
list->next = head->next;
list->next->prev = list;
list->prev = entry;
entry->next = list;
head->next = new_first;
new_first->prev = head;
}static inline void list_cut_position(struct list_head *list,
struct list_head *head, struct list_head *entry)
{
if (list_empty(head))
return;
if (list_is_singular(head) &&
(head->next != entry && head != entry))
return;
if (entry == head)
INIT_LIST_HEAD(list);
else
__list_cut_position(list, head, entry);
}
（12）链表拼接
static inline void __list_splice(const struct list_head *list,
struct list_head *prev,
struct list_head *next)
{
struct list_head *first = list->next;
struct list_head *last = list->prev;
first->prev = prev;
prev->next = first;
last->next = next;
next->prev = last;
}static inline void list_splice(const struct list_head *list,
struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head, head->next);
}
static inline void list_splice_tail(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head->prev, head);
}
拼接后可以看到list链表变成了单向指向，所以下面两个函数再将list初始化。
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head, head->next);
INIT_LIST_HEAD(list);
}
}static inline void list_splice_tail_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head->prev, head);
INIT_LIST_HEAD(list);
}
}3）链表遍历
对于_safe的安全版本是考虑到遍历时如果含有删除的节点，那么该节点删除后会指向不可访问的地址，因此会造成断链，遍历失败，所以采用预先缓存下一个节点指针。
prefetch是为了预读下一个节点，提高遍历效率。
#define list_entry(ptr, type, member) \
container_of(ptr, type, member)#define list_first_entry(ptr, type, member) \
list_entry((ptr)->next, type, member)#define list_for_each(pos, head) \
for (pos = (head)->next; prefetch(pos->next), pos != (head); \
pos = pos->next)#define __list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
pos = pos->prev)#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)#define list_for_each_prev_safe(pos, n, head) \
for (pos = (head)->prev, n = pos->prev; \
prefetch(pos->prev), pos != (head); \
pos = n, n = pos->prev)#define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member); \
prefetch(pos->member.next), &pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))#define list_for_each_entry_reverse(pos, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member); \
prefetch(pos->member.prev), &pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))#define list_prepare_entry(pos, head, member) \
((pos) ? : list_entry(head, typeof(*pos), member))#define list_for_each_entry_continue(pos, head, member) \
for (pos = list_entry(pos->member.next, typeof(*pos), member); \
prefetch(pos->member.next), &pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))#define list_for_each_entry_continue_reverse(pos, head, member) \
for (pos = list_entry(pos->member.prev, typeof(*pos), member); \
prefetch(pos->member.prev), &pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))#define list_for_each_entry_from(pos, head, member) \
for (; prefetch(pos->member.next), &pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))#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))#define list_for_each_entry_safe_continue(pos, n, head, member) \
for (pos = list_entry(pos->member.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))#define list_for_each_entry_safe_from(pos, n, head, member) \
for (n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member), \
n = list_entry(pos->member.prev, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
291
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
