深入分析linux内核链表

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

#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/list.h>

struct my_node {
    int data;
    struct list_head list;
};

static LIST_HEAD(my_list);

void add_node(int data) {
    struct my_node *new_node = kmalloc(sizeof(struct my_node), GFP_KERNEL);
    if (!new_node)
        return;

    new_node->data = data;
    list_add(&new_node->list, &my_list);
}

void print_list(void) {
    struct my_node *pos;

    list_for_each_entry(pos, &my_list, list) {
        printk(KERN_INFO "Node data: %d\n", pos->data);
    }
}

static int __init my_module_init(void) {
    add_node(1);
    add_node(2);
    add_node(3);
    print_list();
    return 0;
}

static void __exit my_module_exit(void) {
    struct my_node *pos, *tmp;

    list_for_each_entry_safe(pos, tmp, &my_list, list) {
        list_del(&pos->list);
        kfree(pos);
    }
}

module_init(my_module_init);
module_exit(my_module_exit);

MODULE_LICENSE("GPL");
MODULE_DESCRIPTION("Linux Kernel List Example");
MODULE_AUTHOR("Your Name");