linux list_head

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

struct list_head my_list;
INIT_LIST_HEAD(&my_list);

struct list_head new_node;
INIT_LIST_HEAD(&new_node);

// 在链表头插入新节点
list_add(&new_node, &my_list);

// 删除节点
list_del(&new_node);

struct list_head *pos;
struct my_struct *entry;

list_for_each(pos, &my_list) {
    entry = list_entry(pos, struct my_struct, list);
    // 处理 entry
}

#include <linux/list.h>
#include <stdio.h>

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

int main() {
    struct list_head my_list;
    INIT_LIST_HEAD(&my_list);

    // 创建并插入节点
    struct my_struct *entry1 = malloc(sizeof(struct my_struct));
    entry1->data = 1;
    INIT_LIST_HEAD(&entry1->list);
    list_add(&entry1->list, &my_list);

    struct my_struct *entry2 = malloc(sizeof(struct my_struct));
    entry2->data = 2;
    INIT_LIST_HEAD(&entry2->list);
    list_add(&entry2->list, &my_list);

    // 遍历链表
    struct list_head *pos;
    list_for_each(pos, &my_list) {
        struct my_struct *entry = list_entry(pos, struct my_struct, list);
        printf("Data: %d\n", entry->data);
    }

    // 删除节点
    list_del(&entry1->list);
    free(entry1);
    list_del(&entry2->list);
    free(entry2);

    return 0;
}