编写一个linux内核模块，用以创建、增加、删除、和遍历一个双向链表

list.c文件

 #include<linux/kernel.h>// 驱动要写入内核，与内核相关的头文件

 #include<linux/module.h>//对模块的结构定义，以及模块的版本控制

 #include<linux/slab.h>//包含了kcalloc、kzalloc内存分配函数的定义

 #include<linux/list.h>//linux内核通用链表

#include<linux/init.h>//初始化头文件

 

MODULE_LICENSE("GPL");

MODULE_AURHOR("XIYOU");

 

#define N  10

struct numlist

{

    int num;

    struct list_head list;

};

 

struct numlist numhead;

 

static int  __init doublelist_init(void)

{

 //初始化头结点

 struct numlist *listnode;//每次申请链表结点时所用的指针

 struct list_head  *pos;

 struct numlist *p;

 int i;

 

 printk("doublelist is starting...\n");

 INIT_LIST_HEAD(&numhead.list);

 

//建立N个结点，依次加入到链表当中

 for(i=0;i<N;i++)

      { listnode=(struct numlist *)kmalloc(sizeof(struct numlist),GFP_KERNEL);

         //kmalloc()在内核空间申请内存，类似于malloc()

         listnode->num=i+1;

         list_add_tail(&listnode->list,&numhead.list);

         printk("Node %d has added to the doublist......\n",i+1);

      }

     //遍历链表

     i=1;

     list_for_each(pos,&numhead.list)

    {

     p=list_entry(pos,struct numlist,list);

     printk("Node %d `s data: %d\n",i,p->num);

     i++;

    }

    return 0;  

}

 

static void __exit doublelist_exit(void)

{

   struct list_head *pos,*n;

   struct numlist *P;

   int i;

    //依次删除n个结点

   i=1;

  list_for_each_safe(pos,n,&numhead.list)

    {

      list_del(pos);

      p=list_entry(pos,struct numlist , list);

      kfree(p);

       printk("Node %d has removed from the doublelist....\n",i++);

       }  

   printk("doublelist is exiting..\n");

}

module_init(doublelist_init);

module_exit(doublelist_exit);