linux 内核链表的实现

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

struct list_head *new_node = kmalloc(sizeof(struct list_head), GFP_KERNEL);
if (!new_node) {
    // 处理内存分配失败的情况
    return -ENOMEM;
}
list_add(new_node, head); // 将新节点插入链表

struct list_head *pos;
list_for_each(pos, head) {
    // 确保在遍历过程中不修改链表结构
}

struct list_head *pos, *tmp;
list_for_each_safe(pos, tmp, head) {
    if (/* 删除条件 */) {
        list_del(pos);
        kfree(pos); // 释放节点内存
    }
}

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

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

static LIST_HEAD(my_list);

static int __init my_module_init(void) {
    struct my_node *node;

    node = kmalloc(sizeof(struct my_node), GFP_KERNEL);
    if (!node)
        return -ENOMEM;

    node->data = 42;
    list_add(&node->list, &my_list);

    printk(KERN_INFO "Node added with data: %d\n", node->data);

    return 0;
}

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

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

    printk(KERN_INFO "All nodes removed\n");
}

module_init(my_module_init);
module_exit(my_module_exit);

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