linux 红黑树 封装map

#include <linux/rbtree.h>
#include <linux/kernel.h>

// 定义键值对结构体
struct my_key_value {
    int key;
    char value[100];
    struct rb_node node;
};

// 定义红黑树根节点
static struct rb_root my_tree = RB_ROOT;

// 插入键值对
void insert_key_value(int key, const char *value) {
    struct my_key_value *new_kv = kmalloc(sizeof(struct my_key_value), GFP_KERNEL);
    if (!new_kv)
        return;

    new_kv->key = key;
    strcpy(new_kv->value, value);

    struct rb_node **new = &(my_tree.rb_node), *parent = NULL;
    struct my_key_value *this;

    while (*new) {
        this = container_of(*new, struct my_key_value, node);
        parent = *new;

        if (key < this->key)
            new = &((*new)->rb_left);
        else if (key > this->key)
            new = &((*new)->rb_right);
        else
            break;
    }

    rb_link_node(&new_kv->node, parent, new);
    rb_insert_color(&new_kv->node, &my_tree);
}

// 查找键值对
char *find_key_value(int key) {
    struct my_key_value *kv;
    kv = rb_find(&my_tree, &my_key_value, key);
    if (kv)
        return kv->value;
    return NULL;
}

// 删除键值对
void delete_key_value(int key) {
    struct my_key_value *kv;
    kv = rb_find(&my_tree, &my_key_value, key);
    if (kv) {
        rb_erase(&kv->node, &my_tree);
        kfree(kv);
    }
}