与linux链表有关的操作定义在linux/list.h链表头:
struct list_head {
struct list_head *next, *prev;
};
该结构体为链接结构中的成员,这样将链表的指针域与链表的数据域分开
链表头的初始化
1.#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)
2 static inline void INIT_LIST_HEAD(struct list_head *list)
{
list->next = list;
list->prev = list;
}
链表的插入
1. static inline void list_add(struct list_head *new, struct list_head *head)
{
__list_add(new, head, head->next);
}
2. static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
__list_add(new, head->prev, head);
}
#ifndef CONFIG_DEBUG_LIST
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;
}
#else
extern void __list_add(struct list_head *new,
struct list_head *prev,
struct list_head *next);
链表的删除
1. #ifndef CONFIG_DEBUG_LIST
static inline void list_del(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
entry->next = LIST_POISON1;
entry->prev = LIST_POISON2;
}
#else
extern void list_del(struct list_head *entry);
#endif
2. static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
next->prev = prev;
prev->next = next;
}
链表的替换
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);
}
链表的移动,从一个链表删除移动到另一个链表
static inline void list_move(struct list_head *list, struct list_head *head)
{
__list_del(list->prev, list->next);
list_add(list, head);
}
链表的遍历
1. #define __list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
2.#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
pos = pos->prev)
链表与用户结构链接list_entry
linux/list.h
#define list_entry(ptr, type, member) \
container_of(ptr, type, member)
linux/kernel.h#define container_of(ptr, type, member) ({ \
/*将链表中的元素prt转换成结构type中成员member类型*/
const typeof(((type *)0)->member)*__mptr = (ptr); \
/*__mptr减去member成员偏移地址正好是type的结构地址*/
(type *)((char *)__mptr - offsetof(type, member)); })
hjk