高级操作系统实验 链表的应用

高级操作系统实验
链表的应用
P19.c源代码:
#include<linux/kernel.h>
#include<linux/module.h>
#include<linux/init.h>

MODULE_LICENSE(“GPL”);
MODULE_AUTHOR(“LUOTAIJIA”);

#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);
for(i=0;i<N;i++){
listnode=(struct numlist*)kmalloc(sizeof(struct numlist),GFP_KERNEL);
listnode->num=i+1;
list_add_tail(&listnode->list,&numhead.list);
printk(“Node %d has added to the doublelist…\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;
i=1;
list_for_each_safe(pos,n,&numhead.list){
list_del(pos);
p=list_entry(pos,struct numlist,list);
kfree§;
printk(“Node %d has removed from the doublelist…\n”,i++);
}
printk(“doublelist is exiting…\n”);
}
module_init(doublelist_init);
module_exit(doublelist_exit);

Makefile源代码:
ifneq ($(KERNELRELEASE),)obj-m:=p19.oelseKDIR:=/lib/modules/$(shell uname -r)/build
PWD:=$(shell pwd)
default:
$(MAKE) -C $(KDIR)M=$(PWD)
clean:
rm -rf *.o *.mod.c *.ko *.symvers *.order *.markers
endif
~
~
~

实验结果如下