/********************
 * 内核中链表的应用
 ********************/

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

struct my_struct{
 struct list_head list;
 unsigned long dog;
 void *cat;
};

struct my_struct mine={
 .lost = LIST_HEAD_INIT(mine.list);
 .dog = 0,
 .cat = NULL
};
//或
static LIST_HEAD(fox);
/*等于struct list_head fox = LIST_HEAD_INIT(fox); */

struct my_struct *p;
p = kmalloc(GFP_KERNEL, sizeof(my_struct));
p->dog = 0;
p->cat = NULL;
INIT_LIST_HEAD(&p->list);

list_add(struct list_head *new, 
     struct list_head *head);
//向指定链表的head节点后面插入new节点

list_add_tail(struct list_head *new, 
     struct list_head *head);
//向指定链表的head节点前面插入new节点

list_del(struct list_head *entry);
//将entry从链表中移走

list_move(struct list_head *list, 
     struct list_head *head);

e.list_empty(struct list_head *head);

list_splice(struct list_head *list, 
      struct list_head *head);
//注意！新的链表不包括list节点

list_entry(struct list_head *ptr,
      type_of_struct, 
      field_name);

my_struct *p = (list_head *ptr, my_struct, list);

list_for_each(struct list_head *cursor,
       struct list_head *list);
//常常和list_entry配套使用
//注意！用list_for_each遍历时，不包括头节点

list_for_each_entry(type *cursor, 
      struct list_head *list,
      member);

list_for_each_entry_safe(type *cursor, 
     type *tmp;
     struct list_head *list,
     member);