From 701589559f912deb03eb5176d049d9d07fb29447 Mon Sep 17 00:00:00 2001 From: LoGin Date: Mon, 19 Feb 2024 11:17:23 +0800 Subject: [PATCH] =?UTF-8?q?=E5=88=A0=E9=99=A4=E6=97=A0=E7=94=A8=E7=9A=84C?= =?UTF-8?q?=E7=89=88=E6=9C=ACbitree=E5=92=8Cida/idr.=20(#526)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 这些数据结构不再使用,将其删除. --- docs/kernel/core_api/data_structures.md | 430 --------- kernel/src/Makefile | 2 +- kernel/src/common/bitree.h | 79 -- kernel/src/common/idr.h | 179 ---- kernel/src/include/bindings/wrapper.h | 1 - kernel/src/ktest/Makefile | 10 - kernel/src/ktest/ktest.c | 15 - kernel/src/ktest/ktest.h | 17 - kernel/src/ktest/ktest_utils.h | 27 - kernel/src/ktest/test-bitree.c | 133 --- kernel/src/ktest/test-idr.c | 599 ------------- kernel/src/ktest/test-kfifo.c | 166 ---- kernel/src/ktest/test-kvm.c | 23 - kernel/src/libs/bitree.c | 234 ----- kernel/src/libs/idr.c | 1058 ----------------------- 15 files changed, 1 insertion(+), 2972 deletions(-) delete mode 100644 kernel/src/common/bitree.h delete mode 100644 kernel/src/common/idr.h delete mode 100644 kernel/src/ktest/Makefile delete mode 100644 kernel/src/ktest/ktest.c delete mode 100644 kernel/src/ktest/ktest.h delete mode 100644 kernel/src/ktest/ktest_utils.h delete mode 100644 kernel/src/ktest/test-bitree.c delete mode 100644 kernel/src/ktest/test-idr.c delete mode 100644 kernel/src/ktest/test-kfifo.c delete mode 100644 kernel/src/ktest/test-kvm.c delete mode 100644 kernel/src/libs/bitree.c delete mode 100644 kernel/src/libs/idr.c diff --git a/docs/kernel/core_api/data_structures.md b/docs/kernel/core_api/data_structures.md index daf9cbc2..822ddcd1 100644 --- a/docs/kernel/core_api/data_structures.md +++ b/docs/kernel/core_api/data_structures.md @@ -254,433 +254,3 @@ | 不满 | 0 | ------------------ - -## ID Allocation - -   ida的主要作用是分配+管理id. 它能分配一个最小的, 未被分配出去的id. 当您需要管理某个数据结构时, 可能需要使用id来区分不同的目标. 这个时候, ida将会是很好的选择. 因为ida的十分高效, 运行常数相对数组更小, 而且提供了基本管理id需要用到的功能, 值得您试一试. - -  IDA定义于`idr.h`文件中. 您通过`DECLARE_IDA(my_ida)`来创建一个ida对象, 或者`struct ida my_ida; ida_init(&my_ida);`来初始化一个ida. - -### ida_init -`void ida_init(struct ida *ida_p)` - -#### 描述 - -  通初始化IDA, 你需要保证调用函数之前, ida的free_list为空, 否则会导致内存泄漏. -#### 参数 - -**ida_p** - -   指向ida的指针 - -#### 返回值 - -  无返回值 - -### ida_preload -`int ida_preload(struct ida *ida_p, gfp_t gfp_mask)` - -#### 描述 - -  为ida预分配空间.您可以不自行调用, 因为当ida需要空间的时候, 内部会自行使用`kmalloc`函数获取空间. 当然, 设计这个函数的目的是为了让您有更多的选择. 当您提前调用这个函数, 可以避免之后在开辟空间上的时间开销. -#### 参数 - -**ida_p** - -   指向ida的指针 - -**gfp_mask** - -   保留参数, 目前尚未使用. - -#### 返回值 - -  如果分配成功,将返回0; 否则返回负数错误码, 有可能是内存空间不够. - - -### ida_alloc -`int ida_alloc(struct ida *ida_p, int *p_id)` - -#### 描述 - -  获取一个空闲ID. 您需要注意, 返回值是成功/错误码. -#### 参数 - -**ida_p** - -   指向ida的指针 - -**p_id** - -   您需要传入一个int变量的指针, 如果成功分配ID, ID将会存储在该指针所指向的地址. - -#### 返回值 - -  如果分配成功,将返回0; 否则返回负数错误码, 有可能是内存空间不够. - - -### ida_count -`bool ida_count(struct ida *ida_p, int id)` - -#### 描述 - -  查询一个ID是否被分配. -#### 参数 - -**ida_p** - -   指向ida的指针 - -**id** - -   您查询该ID是否被分配. - -#### 返回值 - -  如果分配,将返回true; 否则返回false. - - - -### ida_remove -`void ida_remove(struct ida *ida_p, int id)` - -#### 描述 - -  删除一个已经分配的ID. 如果该ID不存在, 该函数不会产生异常错误, 因为在检测到该ID不存在的时候, 函数将会自动退出. -#### 参数 - -**ida_p** - -   指向ida的指针 - -**id** - -   您要删除的id. - -#### 返回值 - -  无返回值. - -### ida_destroy -`void ida_destroy(struct ida *ida_p)` - -#### 描述 - -  释放一个IDA所有的空间, 同时删除ida的所有已经分配的id.(所以您不用担心删除id之后, ida还会占用大量空间.) -#### 参数 - -**ida_p** - -   指向ida的指针 - -#### 返回值 - -  无返回值 - -### ida_empty -`void ida_empty(struct ida *ida_p)` - -#### 描述 - -   查询一个ida是否为空 -#### 参数 - -**ida_p** - -   指向ida的指针 - -#### 返回值 - -  ida为空则返回true，否则返回false。 - - --------------------- - - -## IDR - -   idr是一个基于radix-tree的ID-pointer的数据结构. 该数据结构提供了建id与数据指针绑定的功能, 它的主要功能有以下4个： -1. 获取一个ID, 并且将该ID与一个指针绑定 -2. 删除一个已分配的ID -3. 根据ID查找对应的指针 -4. 根据ID使用新的ptr替换旧的ptr -   您可以使用`DECLARE_idr(my_idr)`来创建一个idr。或者您也可以使用`struct idr my_idr; idr_init(my_idr);`这两句话创建一个idr。 -   至于什么是radix-tree，您可以把他简单理解为一个向上生长的多叉树，在实现中，我们选取了64叉树。 - -### idr_init -`void idr_init(struct idr *idp)` - -#### 描述 - -  通初始化IDR, 你需要保证调用函数之前, idr的free_list为空, 否则会导致内存泄漏. -#### 参数 - -**idp** - -   指向idr的指针 - -#### 返回值 - -  无返回值 - -### idr_preload -`int idr_preload(struct idr *idp, gfp_t gfp_mask)` - -#### 描述 - -  为idr预分配空间.您可以不自行调用, 因为当idr需要空间的时候, 内部会自行使用`kmalloc`函数获取空间. 当然, 设计这个函数的目的是为了让您有更多的选择. 当您提前调用这个函数, 可以避免之后在开辟空间上的时间开销. -#### 参数 - -**idp** - -   指向idr的指针 - -**gfp_mask** - -   保留参数, 目前尚未使用. - -#### 返回值 - -  如果分配成功,将返回0; 否则返回负数错误码, 有可能是内存空间不够. - - -### idr_alloc -`int idr_alloc(struct idr *idp, void *ptr, int *id)` - -#### 描述 - -   获取一个空闲ID. 您需要注意, 返回值是成功/错误码. -   调用这个函数，需要您保证ptr是非空的，即: `ptr != NULL`, 否则将会影响 `idr_find/idr_find_next/idr_find_next_getid/...`等函数的使用。(具体请看这三个函数的说明，当然，只会影响到您的使用体验，并不会影响到idr内部函数的决策和逻辑) -#### 参数 - -**idp** - -   指向ida的指针 - -**ptr** - -   指向数据的指针 - -**id** - -   您需要传入一个int变量的指针, 如果成功分配ID, ID将会存储在该指针所指向的地址. - -#### 返回值 - -  如果分配成功,将返回0; 否则返回负数错误码, 有可能是内存空间不够. - - -### idr_remove -`void* idr_remove(struct idr *idp, int id)` - -#### 描述 - -  删除一个id, 但是不释放对应的ptr指向的空间, 同时返回这个被删除id所对应的ptr。 -   如果该ID不存在, 该函数不会产生异常错误, 因为在检测到该ID不存在的时候, 函数将会自动退出，并返回NULL。 -#### 参数 - -**idp** - -   指向idr的指针 - -**id** - -   您要删除的id. - -#### 返回值 - -  如果删除成功，就返回被删除id所对应的ptr；否则返回NULL。注意：如果这个id本来就和NULL绑定，那么也会返回NULL - - -### idr_remove_all -`void idr_remove_all(struct idr *idp)` - -#### 描述 - -  删除idr的所有已经分配的id.(所以您不用担心删除id之后, idr还会占用大量空间。) - -   但是你需要注意的是，调用这个函数是不会释放数据指针指向的空间的。 所以您调用该函数之前， 确保IDR内部的数据指针被保存。否则当IDR删除所有ID之后， 将会造成内存泄漏。 - -#### 参数 - -**idp** - -   指向idr的指针 - -#### 返回值 - -  无返回值 - - -### idr_destroy -`void idr_destroy(struct idr *idp)` - -#### 描述 - -  释放一个IDR所有的空间, 同时删除idr的所有已经分配的id.(所以您不用担心删除id之后, ida还会占用大量空间.) - 和`idr_remove_all`的区别是， 释放掉所有的空间(包括free_list的预分配空间)。 -#### 参数 - -**idp** - -   指向idr的指针 - -#### 返回值 - -  无返回值 - - -### idr_find -`void *idr_find(struct idr *idp, int id)` - -#### 描述 - -  查询一个ID所绑定的数据指针 -#### 参数 - -**idp** - -   指向idr的指针 - -**id** - -   您查询该ID的数据指针 - -#### 返回值 - -   如果分配,将返回该ID对应的数据指针; 否则返回NULL.(注意， 返回NULL不一定代表这ID不存在，有可能该ID就是与空指针绑定。) -   当然，我们也提供了`idr_count`函数来判断id是否被分配，具体请查看idr_count介绍。 - -### idr_find_next -`void *idr_find_next(struct idr *idp, int start_id)` - -#### 描述 - -  传进一个start_id，返回满足 "id大于start_id的最小id" 所对应的数据指针。 -#### 参数 - -**idp** - -   指向idr的指针 - -**start_id** - -  您提供的ID限制 - -#### 返回值 - -   如果分配,将返回该ID对应的数据指针; 否则返回NULL.(注意， 返回NULL不一定代表这ID不存在，有可能该ID就是与空指针绑定。) -   当然，我们也提供了`idr_count`函数来判断id是否被分配，具体请查看idr_count介绍。 - - -### idr_find_next_getid -`void *idr_find_next_getid(struct idr *idp, int start_id, int *nextid)` - -#### 描述 - -  传进一个start_id，返回满足 "id大于start_id的最小id" 所对应的数据指针。同时，你获取到这个满足条件的最小id， 即参数中的 *nextid。 -#### 参数 - -**idp** - -   指向idr的指针 - -**start_id** - -   您提供的ID限制 - -#### 返回值 - -   如果分配,将返回该ID对应的数据指针; 否则返回NULL.(注意， 返回NULL不一定代表这ID不存在，有可能该ID就是与空指针绑定。) -   当然，我们也提供了`idr_count`函数来判断id是否被分配，具体请查看idr_count介绍。 - - -### idr_replace -`int idr_replace(struct idr *idp, void *ptr, int id)` - -#### 描述 - -  传进一个ptr，使用该ptr替换掉id所对应的Old_ptr。 -#### 参数 - -**idp** - -   指向idr的指针 - -**ptr** - -  您要替换原来的old_ptr的新指针 - -**id** - -   您要替换的指针所对应的id - -#### 返回值 - -   0代表成功，否则就是错误码 - 代表错误。 - - -### idr_replace_get_old -`int idr_replace_get_old(struct idr *idp, void *ptr, int id, void **oldptr)` - -#### 描述 - -  传进一个ptr，使用该ptr替换掉id所对应的Old_ptr，同时你可以获取到old_ptr。 -#### 参数 - -**idp** - -   指向idr的指针 - -**ptr** - -  您要替换原来的old_ptr的新指针 - -**id** - -   您要替换的指针所对应的id - - -**old_ptr** - -   您需要传进该(void**)指针，old_ptr将会存放在该指针所指向的地址。 - - -#### 返回值 - -   0代表成功，否则就是错误码 - 代表错误。 - -### idr_empty -`void idr_empty(struct idr *idp)` - -#### 描述 - -   查询一个idr是否为空 -#### 参数 - -**idp** - -   指向idr的指针 - -#### 返回值 - -  idr为空则返回true，否则返回false。 - -### idr_count -`bool idr_count(struct idr *idp, int id)` - -#### 描述 - -  查询一个ID是否被分配. -#### 参数 - -**ida_p** - -   指向idr的指针 - -**id** - -   您查询该ID是否被分配. - -#### 返回值 - -  如果分配,将返回true; 否则返回false. \ No newline at end of file diff --git a/kernel/src/Makefile b/kernel/src/Makefile index ca7aa8a3..4fcdf595 100644 --- a/kernel/src/Makefile +++ b/kernel/src/Makefile @@ -36,7 +36,7 @@ export ASFLAGS := --64 LD_LIST := "" -kernel_subdirs := common driver debug exception smp syscall ktest libs time +kernel_subdirs := common driver debug exception smp syscall libs time kernel_rust: diff --git a/kernel/src/common/bitree.h b/kernel/src/common/bitree.h deleted file mode 100644 index 0d98b337..00000000 --- a/kernel/src/common/bitree.h +++ /dev/null @@ -1,79 +0,0 @@ -#pragma once -#include - -struct bt_node_t -{ - struct bt_node_t *left; - struct bt_node_t *right; - struct bt_node_t *parent; - void *value; // 数据 - -} __attribute__((aligned(sizeof(long)))); - -struct bt_root_t -{ - struct bt_node_t *bt_node; - int32_t size; // 树中的元素个数 - int (*cmp)(void *a, void *b); // 比较函数 a>b 返回1， a==b返回0, a -#include - -#if ARCH(I386) || ARCH(X86_64) -#include -#else -#error Arch not supported. -#endif - - -/** - * idr: 基于radix-tree的ID-pointer的数据结构 - * 主要功能: - * 1. 获取一个ID, 并且将该ID与一个指针绑定 - 需要外部加锁 - * 2. 删除一个已分配的ID - 需要外部加锁 - * 3. 根据ID查找对应的指针 (读操作,看情况加锁) - * 4. 根据ID使用新的ptr替换旧的ptr - 需要外部加锁 - * - * 附加功能: - * 1. 给定starting_id, 查询下一个已分配的next_id (即:next_id>starting_id) - * 2. 销毁整个idr - * - * - * .... 待实现 - */ - -// 默认64位机器 -#define IDR_BITS 6 -#define IDR_FULL 0xfffffffffffffffful - -// size = 64 -#define IDR_SIZE (1 << IDR_BITS) -#define IDR_MASK ((1 << IDR_BITS) - 1) - -// 能管理的ID范围[0:1<<31] -#define MAX_ID_SHIFT (sizeof(int) * 8 - 1) -#define MAX_ID_BIT (1U << MAX_ID_SHIFT) -#define MAX_ID_MASK (MAX_ID_BIT - 1) - -// IDR可能最大的层次 以及 IDR预分配空间的最大限制 -#define MAX_LEVEL ((MAX_ID_SHIFT + IDR_BITS - 1) / IDR_BITS) -#define IDR_FREE_MAX (MAX_LEVEL << 1) - -// 给定layer, 计算完全64叉树的大小 -#define TREE_SIZE(layer) ((layer >= 0) ? (1ull << ((layer + 1) * IDR_BITS)) : 1) - -// 计算最后(最低位)一个1的位置 (注意使用64位的版本) -#define __lowbit_id(x) ((x) ? (__ctzll(x)) : -1) - -// 计算最前(最高位)一个1的位置 (注意使用64位的版本) -#define __mostbit_id(x) ((x) ? (63 - __clzll(x)) : -1) - -// radix-tree 节点定义 -struct idr_layer -{ - struct idr_layer *ary[IDR_SIZE]; // IDR_SIZE叉树 - unsigned long bitmap; // 每一位表示这个子树是否被使用 - unsigned long full; // 64个儿子子树, 每一位代表一个子树是否满了 - int layer; // 层数(从底向上) -}; - -// idr: 将id与pointer绑定的数据结构 -struct idr -{ - struct idr_layer *top; - struct idr_layer *free_list; - int id_free_cnt; - spinlock_t lock; -}__attribute__((aligned(8))); - -#define DECLARE_IDR(name) \ - struct idr name = {0}; \ - idr_init(&(name)); - -#define DECLARE_IDR_LAYER(name) \ - struct idr_layer name = {0}; \ - memset(name, 0, sizeof(struct idr_layer)); - -/** - * 对外函数声明 - **/ -int idr_preload(struct idr *idp, gfp_t gfp_mask); -int idr_alloc(struct idr *idp, void *ptr, int *id); -void *idr_remove(struct idr *idp, int id); -void idr_remove_all(struct idr *idp); -void idr_destroy(struct idr *idp); -void *idr_find(struct idr *idp, int id); -void *idr_find_next(struct idr *idp, int start_id); -void *idr_find_next_getid(struct idr *idp, int64_t start_id, int *nextid); -int idr_replace_get_old(struct idr *idp, void *ptr, int id, void **oldptr); -int idr_replace(struct idr *idp, void *ptr, int id); -void idr_init(struct idr *idp); -bool idr_empty(struct idr *idp); -bool idr_count(struct idr *idp, int id); - -/** - * 对外宏：遍历idr两种方式： - * 1. 从第一个元素开始遍历 - * 2. 从某一个id开始遍历 - */ - -/** - * @brief 第一种遍历方式: 从第一个元素开始遍历 - * @param idp idr指针 - * @param id 遍历的id，你不需要初始化这个id，因为它每一次都是从最小已分配的id开始遍历 - * @param ptr 数据指针(entry)，你不需要初始化这个指针 - */ -#define for_each_idr_entry(idp, id, ptr) \ - for (id = -1, ptr = idr_find_next_getid(idp, id, &id); ptr != NULL || !idr_count(idp, id); ptr = idr_find_next_getid(idp, id, &id)) - -/** - * @brief 第二种遍历方式: 从某一个id开始遍历 - * @param idp idr指针 - * @param id 遍历的id，你需要初始化这个id(请你设置为你要从哪一个id开始遍历，遍历过程将会包括这个id) - * @param ptr 数据指针(entry)，你不需要初始化这个指针 - */ -#define for_each_idr_entry_continue(idp, id, ptr) \ - for (ptr = idr_find_next_getid(idp, id - 1, &id); ptr != NULL || !idr_count(idp, id); ptr = idr_find_next_getid(idp, id, &id)) - -/** - * ida: 基于IDR实现的ID分配器 - * 主要功能: - * 1. 获取一个未分配的ID - * 2. 询问一个ID是否被分配 - * 3. 删除一个已分配ID - * - * 附加功能: - * 1. 暂定 - */ - -// 一个块的大小 - 即 sizeof(struct ida_bitmap) -#define IDA_CHUNK_SIZE 128 -// ida_bitmap的长度 -#define IDA_BITMAP_LONGS (IDA_CHUNK_SIZE / sizeof(long) - 1) -// 对应linux的IDA_BITMAP_BITS = 960 = 15 * 64 -#define IDA_FULL (IDA_BITMAP_LONGS * sizeof(long) * 8) -#define IDA_BITMAP_BITS IDA_FULL -#define IDA_BMP_SIZE (8 * sizeof(long)) - -// 自定义bitmap -struct ida_bitmap -{ - unsigned long count; // bitmap中已经分配的id数量 - unsigned long bitmap[IDA_BITMAP_LONGS]; // bitmap本身, 每一个bit代表一个ID -}; - -// id-allocater 管理+分配ID的数据结构 -struct ida -{ - struct idr idr; - struct ida_bitmap *free_list; // 预分配的数据块 -}; - -#define DECLARE_IDA(name) \ - struct ida name = {0}; \ - idr_init(&name.idr); \ - name.free_list = (NULL); - -/** - * 对外函数声明 - */ -void ida_init(struct ida *ida_p); -bool ida_empty(struct ida *ida_p); -int ida_preload(struct ida *ida_p, gfp_t gfp_mask); -int ida_alloc(struct ida *ida_p, int *p_id); -bool ida_count(struct ida *ida_p, int id); -void ida_remove(struct ida *ida_p, int id); -void ida_destroy(struct ida *ida_p); - -#pragma GCC pop_options - -#endif \ No newline at end of file diff --git a/kernel/src/include/bindings/wrapper.h b/kernel/src/include/bindings/wrapper.h index ef04a555..8bc79ca2 100644 --- a/kernel/src/include/bindings/wrapper.h +++ b/kernel/src/include/bindings/wrapper.h @@ -17,7 +17,6 @@ #include #include #include -#include #include #include #include diff --git a/kernel/src/ktest/Makefile b/kernel/src/ktest/Makefile deleted file mode 100644 index ae15a094..00000000 --- a/kernel/src/ktest/Makefile +++ /dev/null @@ -1,10 +0,0 @@ -SRC = $(wildcard *.c) -OBJ = $(SRC:.c=.o) -CFLAGS += -I . - -.PHONY: all - -all: $(OBJ) - -%.o: %.c - $(CC) $(CFLAGS) -c $< -o $@ diff --git a/kernel/src/ktest/ktest.c b/kernel/src/ktest/ktest.c deleted file mode 100644 index 47acc082..00000000 --- a/kernel/src/ktest/ktest.c +++ /dev/null @@ -1,15 +0,0 @@ -#include "ktest.h" -#include - -/** - * @brief 开启一个新的内核线程以进行测试 - * - * @param func 测试函数 - * @param arg 传递给测试函数的参数 - * @return pid_t 测试内核线程的pid - */ -pid_t ktest_start(int (*func)(void* arg), void* arg) -{ - kerror("Fix me: ktest_start, to use new process management."); - while(1); -} \ No newline at end of file diff --git a/kernel/src/ktest/ktest.h b/kernel/src/ktest/ktest.h deleted file mode 100644 index 3b4b54b1..00000000 --- a/kernel/src/ktest/ktest.h +++ /dev/null @@ -1,17 +0,0 @@ -#pragma once -#include - -int ktest_test_bitree(void* arg); -int ktest_test_kfifo(void* arg); -int ktest_test_mutex(void* arg); -int ktest_test_idr(void* arg); -int ktest_test_kvm(void* arg); - -/** - * @brief 开启一个新的内核线程以进行测试 - * - * @param func 测试函数 - * @param arg 传递给测试函数的参数 - * @return pid_t 测试内核线程的pid - */ -pid_t ktest_start(int (*func)(void* arg), void* arg); \ No newline at end of file diff --git a/kernel/src/ktest/ktest_utils.h b/kernel/src/ktest/ktest_utils.h deleted file mode 100644 index ff67e4e7..00000000 --- a/kernel/src/ktest/ktest_utils.h +++ /dev/null @@ -1,27 +0,0 @@ -#pragma once - -#include -#include - -#define assert(condition) ({ \ - int __condition = !!(condition); \ - if (unlikely(!(__condition))) \ - { \ - printk("[ kTEST FAILED ] Ktest Assertion Failed, file:%s, Line:%d\n", __FILE__, __LINE__); \ - } \ - likely(__condition); \ -}) - -#define kTEST(...) \ - do \ - { \ - printk("[ kTEST ] file:%s, Line:%d\t", __FILE__, __LINE__); \ - printk(__VA_ARGS__); \ - printk("\n"); \ - } while (0) - -/** - * @brief 测试用例函数表 - * - */ -typedef long (*ktest_case_table)(uint64_t arg0, uint64_t arg1); \ No newline at end of file diff --git a/kernel/src/ktest/test-bitree.c b/kernel/src/ktest/test-bitree.c deleted file mode 100644 index 0432adfd..00000000 --- a/kernel/src/ktest/test-bitree.c +++ /dev/null @@ -1,133 +0,0 @@ -#include "ktest.h" -#include - -#include -#include -#include -#include - -#include - -struct test_value_t -{ - uint64_t tv; -}; -static int compare(void *a, void *b) -{ - if (((struct test_value_t *)a)->tv > ((struct test_value_t *)b)->tv) - return 1; - else if (((struct test_value_t *)a)->tv == ((struct test_value_t *)b)->tv) - return 0; - else - return -1; -} - -static int release(void *value) -{ - // kdebug("release"); - return 0; -} - -/** - * @brief 测试创建二叉树 - * - * @return int - */ -static long ktest_bitree_case1(uint64_t arg0, uint64_t arg1) -{ - int val; - // ========== 测试创建树 - struct test_value_t *tv1 = (struct test_value_t *)kmalloc(sizeof(struct test_value_t), 0); - tv1->tv = 20; - struct bt_node_t *rn = bt_create_node(NULL, NULL, NULL, tv1); - - assert(rn != NULL); - assert((int64_t)rn != (-EINVAL)); - assert(rn->value == tv1); - - struct bt_root_t *tree = bt_create_tree(rn, compare, release); - assert(tree != NULL); - assert(tree->bt_node == rn); - assert(tree->cmp == compare); - assert(tree->release == release); - assert(tree->size == 1); - - // ========= 向树中插入数据10、30 - struct test_value_t *tv2 = (struct test_value_t *)kmalloc(sizeof(struct test_value_t), 0); - assert(tv2 != NULL); - tv2->tv = 10; - { - int last_size = tree->size; - val = bt_insert(tree, tv2); - assert(val == 0); - assert(last_size + 1 == tree->size); - } - struct test_value_t *tv3 = (struct test_value_t *)kmalloc(sizeof(struct test_value_t), 0); - assert(tv3 != NULL); - tv3->tv = 30; - { - int last_size = tree->size; - val = bt_insert(tree, tv3); - assert(val == 0); - assert(last_size + 1 == tree->size); - } - - // 检测树的形状 - assert(((struct test_value_t *)tree->bt_node->left->value)->tv == tv2->tv); - assert(((struct test_value_t *)tree->bt_node->right->value)->tv == tv3->tv); - - // ========= 查询结点 - // 查询值为tv2的结点 - struct bt_node_t *node2; - assert(bt_query(tree, tv2, (uint64_t*)(&node2)) == 0); - assert(node2 != NULL); - assert(node2->value == tv2); - - // ========= 插入第4个结点：15 - struct test_value_t *tv4 = (struct test_value_t *)kmalloc(sizeof(struct test_value_t), 0); - assert(tv4 != NULL); - tv4->tv = 15; - { - int last_size = tree->size; - val = bt_insert(tree, tv4); - assert(val == 0); - assert(last_size + 1 == tree->size); - } - - assert(((struct test_value_t *)node2->right->value)->tv == tv4->tv); - - // ======= 查询不存在的值 - struct bt_node_t *node_not_exists; - struct test_value_t *tv_not_exists = (struct test_value_t *)kmalloc(sizeof(struct test_value_t), 0); - assert(tv_not_exists != NULL); - tv_not_exists->tv = 100; - assert(bt_query(tree, tv_not_exists, (uint64_t*)(&node_not_exists)) == -1); - // kdebug("node_not_exists.val=%d", ((struct test_value_t*)node_not_exists->value)->tv); - assert(node_not_exists == NULL); - - // 删除根节点 - assert(bt_delete(tree, rn->value) == 0); - assert(((struct test_value_t *)tree->bt_node->value)->tv != 20); - assert(tree->bt_node->right == NULL); - - // 删除树 - assert(bt_destroy_tree(tree) == 0); - - return 0; -} - -static ktest_case_table kt_bitree_func_table[] = { - ktest_bitree_case1, -}; - -int ktest_test_bitree(void* arg) -{ - kTEST("Testing bitree..."); - for (int i = 0; i < sizeof(kt_bitree_func_table) / sizeof(ktest_case_table); ++i) - { - kTEST("Testing case %d", i); - kt_bitree_func_table[i](0, 0); - } - kTEST("bitree Test done."); - return 0; -} \ No newline at end of file diff --git a/kernel/src/ktest/test-idr.c b/kernel/src/ktest/test-idr.c deleted file mode 100644 index 38c5fcaa..00000000 --- a/kernel/src/ktest/test-idr.c +++ /dev/null @@ -1,599 +0,0 @@ - -#include - -#if ARCH(I386) || ARCH(X86_64) - -#pragma GCC push_options -#pragma GCC optimize("O1") -#include "ktest.h" -#include "ktest_utils.h" -#include - -/** - * @brief 测试idr的构建,预获取空间是否成功 - * - * 以下函数将被测试: - * 1. idr_preload - * 2. DECLARE_IDR - * 3. idr_init - * 4. idr_destroy - * - * 同时还会(间接)测试一些内部函数: - * 1. move_to_free_list - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case0(uint64_t arg0, uint64_t arg1) -{ - unsigned long bitmap = -1; - assert((int)(bitmap == IDR_FULL)); - - DECLARE_IDR(k_idr); - assert(k_idr.top == NULL); // 刚被创建,必须是NULL - assert(k_idr.id_free_cnt == 0); // 必须是0 - assert(k_idr.free_list == NULL); - - k_idr.id_free_cnt = arg1; - idr_init(&k_idr); - assert(k_idr.id_free_cnt == 0); - - assert(idr_preload(&k_idr, 0) == 0); - assert(k_idr.id_free_cnt == IDR_FREE_MAX); - - for (uint64_t i = 1; i < 64; i++) - { - int id = __lowbit_id(i), chk_id = -1; - for (int j = 0; j < 64; j++) - if ((i >> j) & 1) - { - chk_id = j; - break; - } - assert(id == chk_id); - } - - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - assert(k_idr.top == NULL); - - return 0; -} - -/** - * @brief 测试id的获取，id的删除，id的全体删除, idr的find函数 - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case1(uint64_t arg0, uint64_t arg1) -{ - DECLARE_IDR(k_idr); - int a[128]; - - // 获取128个id - for (int i = 0; i < 128; i++) - { - assert(idr_alloc(&k_idr, &a[i], &a[i]) == 0); - assert(a[i] == i); - } - - // 查询128个ptr - for (int i = 0; i < 128; i++) - { - int *ptr = idr_find(&k_idr, a[i]); - assert(ptr == &a[i]); - assert(ptr != NULL); - assert(*ptr == a[i]); - } - - // 倒序：删除64个id - for (int i = 127; i >= 64; i--) - { - int *id = idr_remove(&k_idr, a[i]); - assert(id != NULL); - assert(*id == i); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - // 正序：删除64个id - for (int i = 0; i <= 63; i++) - { - int *id = idr_remove(&k_idr, a[i]); - assert(id != NULL); - assert(*id == i); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - for (int i = 0; i < 128; i++) - { - assert(idr_count(&k_idr, i) == 0); - } - - // 重新申请128个id, 值域范围应该仍然是[0,127] - for (int i = 0; i < 128; i++) - { - assert(idr_alloc(&k_idr, &a[i], &a[i]) == 0); - assert(a[i] == i); - } - - for (int i = 0; i < 128; i++) - { - assert(idr_count(&k_idr, i)); - } - - // 正序：删除32个id - for (int i = 0; i <= 31; i++) - { - int *id = idr_remove(&k_idr, a[i]); - assert(id != NULL); - assert(*id == i); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - // 倒序：删除32个id - for (int i = 127; i >= 96; i--) - { - int *id = idr_remove(&k_idr, a[i]); - assert(id != NULL); - assert(*id == i); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - // 整体删除 - idr_remove_all(&k_idr); - assert(k_idr.top == NULL); - - // 获取128个id - for (int i = 0; i < 128; i++) - { - assert(idr_alloc(&k_idr, &a[i], &a[i]) == 0); - assert(a[i] == i); - } - - // 查询128个ptr - for (int i = 0; i < 128; i++) - { - int *ptr = idr_find(&k_idr, a[i]); - assert(ptr == &a[i]); - assert(*ptr == a[i]); - } - - // 正序：删除64个id - for (int i = 0; i <= 63; i++) - { - idr_remove(&k_idr, a[i]); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - // 倒序：删除64个id - for (int i = 127; i >= 64; i--) - { - idr_remove(&k_idr, a[i]); - assert(idr_find(&k_idr, a[i]) == NULL); - } - - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - - return 0; -} - -/** - * @brief case1 的大数据测试 - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case2(uint64_t arg0, uint64_t arg1) -{ - DECLARE_IDR(k_idr); - - // 获取 1000‘000 个ID - const int N = 1048576; - // const int N = 1048576; - const int M = 2e5; - - int tmp = 0; - for (int i = 0; i < N; i++) - { - barrier(); - assert(idr_alloc(&k_idr, &tmp, &tmp) == 0); - barrier(); - assert(tmp == i); - - barrier(); - int *ptr = idr_find(&k_idr, i); - barrier(); - assert(ptr != NULL); - assert(*ptr == i); - - barrier(); - // if (i >= 7255) kdebug("1e6 !!!!!!! : %d", i); - assert(idr_count(&k_idr, i)); - barrier(); - } - // kdebug("111111"); - // 正向: M 个ID - for (int i = 0; i < M; i++) - { - int *ptr = idr_find(&k_idr, i); - assert(ptr != NULL); - assert(*ptr == N - 1); - idr_remove(&k_idr, i); - assert(idr_find(&k_idr, i) == NULL); - } - // kdebug("22222"); - - // 倒序: N-M 个ID - for (int i = (N)-1; i >= M; i--) - { - int *ptr = idr_find(&k_idr, i); - assert(*ptr == N - 1); - idr_remove(&k_idr, i); - assert(idr_find(&k_idr, i) == NULL); - } - // kdebug("3333333"); - // 重新插入数据 - for (int i = 0; i < N; i++) - { - assert(idr_alloc(&k_idr, &tmp, &tmp) == 0); - assert(tmp == i); - assert(k_idr.top != NULL); - - int *ptr = idr_find(&k_idr, i); - assert(ptr != NULL); - assert(*ptr == i); - } - // kdebug("4444444444"); - assert(k_idr.top != NULL); - - for (int i = 0; i < M; i++) - { - assert(idr_replace(&k_idr, NULL, i) == 0); - } - // kdebug("555555555555555555"); - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - // kdebug("666666666666"); - return 0; -} - -/** - * @brief case1 的大数据测试 - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case3(uint64_t arg0, uint64_t arg1) -{ - DECLARE_IDR(k_idr); - - const int N = 1949; - int tmp; - - // 获取ID - for (int i = 0; i < N; i++) - { - assert(idr_alloc(&k_idr, &tmp, &tmp) == 0); - assert(tmp == i); - - int *ptr = idr_find(&k_idr, i); - assert(ptr != NULL); - assert(*ptr == i); - } - - // 查询 nextid - for (int i = 1; i <= N; i++) - { - int nextid; - int *ptr = idr_find_next_getid(&k_idr, i - 1, &nextid); - if (likely(i < N)) - { - assert(ptr != NULL); - assert(*ptr == N - 1); - assert(nextid == i); - } - else - { - assert(ptr == NULL); - assert(nextid == -1); - } - } - - int sz = N; - // 删掉某一段 - for (int i = N / 3, j = 2 * (N / 3), k = 0; i <= j; k++, i++) - { - int *ptr = idr_find(&k_idr, i); - assert(ptr != NULL); - assert(*ptr == N - 1); - idr_remove(&k_idr, i); - - assert(idr_find(&k_idr, i) == NULL); - sz--; - assert(k_idr.top != NULL); - } - - // 查询 nextid - for (int i = 1; i <= N; i++) - { - int nextid; - int *ptr = idr_find_next_getid(&k_idr, i - 1, &nextid); - if (likely(i < N)) - { - int target = i < N / 3 ? i : max(i, 2 * (N / 3) + 1); - assert(ptr != NULL); - assert(*ptr == N - 1); - assert(nextid == target); - } - else - { - assert(ptr == NULL); - assert(nextid == -1); - } - } - - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - - return 0; -} - -/** - * @brief 更加全面覆盖所有函数 - 小数据测试 - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case4(uint64_t arg0, uint64_t arg1) -{ - DECLARE_IDR(k_idr); - idr_init(&k_idr); - - const int N = 91173; - static uint32_t tmp; - - for (int i = 1; i <= 20; i++) - { - int M = N / i, T = M / 3, b = 2 * T; - for (int j = 0; j < M; j++) - { - assert(idr_alloc(&k_idr, &tmp, &tmp) == 0); - assert(tmp == j); - } - - for (int j = b; j >= T; j--) - { - int *ptr = idr_find(&k_idr, j); - assert(ptr != NULL); - assert(*ptr == M - 1); - idr_remove(&k_idr, j); - } - - for (int j = b + 1; j < M; j++) - { - int *ptr = idr_find(&k_idr, j); - assert(ptr != NULL); - assert(*ptr == M - 1); - idr_remove(&k_idr, j); - } - - for (int j = T - 1; j >= 0; j--) - { - int *ptr = idr_find(&k_idr, j); - assert(ptr != NULL); - assert(*ptr == M - 1); - idr_remove(&k_idr, j); - } - - assert(k_idr.top == NULL); - assert(idr_empty(&k_idr)); - } - - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - assert(idr_empty(&k_idr)); - - return 0; -} - -/** - * @brief 测试id的获取，id的删除，id的全体删除, idr的find函数 - * - * @param arg0 - * @param arg1 - */ -static long ktest_idr_case5(uint64_t arg0, uint64_t arg1) -{ - DECLARE_IDR(k_idr); - const int N = 128; - int a[N]; - - // 获取128个id - for (int i = 0; i < N; i++) - { - assert(idr_alloc(&k_idr, &a[i], &a[i]) == 0); - assert(a[i] == i); - } - - // 把id指向的指针向后移动一个单位 - for (int i = 0; i < N; i++) - { - int *ptr; - int flags = idr_replace_get_old(&k_idr, &a[(i + 1) % N], i, (void *)&ptr); - assert(flags == 0); // 0 是成功 - assert(ptr != NULL); - assert(*ptr == i); - - // 测试是否替换成功 - ptr = idr_find(&k_idr, i); - assert(ptr != NULL); - assert(*ptr == (i + 1) % N); - } - - // 销毁 - idr_destroy(&k_idr); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - - // destroy之后，再获取128个id - for (int i = 0; i < N; i++) - { - assert(idr_alloc(&k_idr, &a[i], &a[i]) == 0); - assert(a[i] == i); - } - - // 销毁 - idr_destroy(&k_idr); - assert(idr_empty(&k_idr)); - assert(k_idr.id_free_cnt == 0); - assert(k_idr.free_list == NULL); - - return 0; -} - -/** - * @brief 测试ida的插入/删除 - * - * @param arg0 - * @param arg1 - * @return long - */ -static long ktest_idr_case6(uint64_t arg0, uint64_t arg1) -{ - assert(IDA_BITMAP_LONGS != 0); - assert(IDA_BMP_SIZE != 0); - assert(IDA_FULL != 0); - assert(IDA_BITMAP_BITS != 0); - - DECLARE_IDA(k_ida); - ida_init(&k_ida); - io_sfence(); - - const int N = IDA_FULL * IDR_SIZE + 1; - - for (int i = 0; i < N; i++) - { - int p_id; - io_sfence(); - assert(ida_alloc(&k_ida, &p_id) == 0); - io_sfence(); - assert(p_id == i); - io_sfence(); - } - - for (int i = 0; i < N; i++) - { - assert(ida_count(&k_ida, i) == 1); - io_sfence(); - } - - for (int i = N - 1; i >= 0; i--) - { - ida_remove(&k_ida, i); - io_sfence(); - assert(ida_count(&k_ida, i) == 0); - io_sfence(); - } - - assert(k_ida.idr.top == NULL); - - for (int i = 0; i < N; i++) - { - int p_id; - io_sfence(); - assert(ida_alloc(&k_ida, &p_id) == 0); - io_sfence(); - assert(p_id == i); - io_sfence(); - } - - assert(k_ida.idr.top != NULL); - io_sfence(); - ida_destroy(&k_ida); - io_sfence(); - assert(k_ida.idr.top == NULL); - io_sfence(); - assert(k_ida.free_list == NULL); - io_sfence(); - assert(ida_empty(&k_ida)); - io_sfence(); - - // 测试destroy之后能否重新获取ID - for (int i = 0; i < N; i++) - { - int p_id; - io_sfence(); - assert(ida_alloc(&k_ida, &p_id) == 0); - io_sfence(); - assert(p_id == i); - io_sfence(); - } - - for (int i = 0; i < N / 3; i++) - { - ida_remove(&k_ida, i); - io_sfence(); - assert(ida_count(&k_ida, i) == 0); - io_sfence(); - } - - for (int i = 2 * N / 3; i < N; i++) - { - ida_remove(&k_ida, i); - io_sfence(); - assert(ida_count(&k_ida, i) == 0); - io_sfence(); - } - - assert(k_ida.idr.top != NULL); - io_sfence(); - ida_destroy(&k_ida); - io_sfence(); - assert(k_ida.idr.top == NULL); - io_sfence(); - assert(k_ida.free_list == NULL); - io_sfence(); - assert(ida_empty(&k_ida)); - io_sfence(); - - return 0; -} - -static ktest_case_table kt_idr_func_table[] = { - ktest_idr_case0, - ktest_idr_case1, - ktest_idr_case2, // 为了加快启动速度, 暂时注释掉这个测试 - ktest_idr_case3, - ktest_idr_case4, - ktest_idr_case5, - ktest_idr_case6, -}; - -int ktest_test_idr(void *arg) -{ - kTEST("Testing idr..."); - unsigned int sz = sizeof(kt_idr_func_table) / sizeof(ktest_case_table); - for (int i = 0; i < sz; ++i) - { - kTEST("Testing case %d", i); - kt_idr_func_table[i](i, i + 1); - } - kTEST("idr Test done."); - return 0; -} - -#pragma GCC pop_options - -#endif \ No newline at end of file diff --git a/kernel/src/ktest/test-kfifo.c b/kernel/src/ktest/test-kfifo.c deleted file mode 100644 index fd843075..00000000 --- a/kernel/src/ktest/test-kfifo.c +++ /dev/null @@ -1,166 +0,0 @@ -#include "ktest.h" -#include "ktest_utils.h" -#include -#include -#include - -static long ktest_kfifo_case0_1(uint64_t arg0, uint64_t arg1) -{ - const int fifo_size = 256; - // 创建kfifo（由kfifo申请内存） - struct kfifo_t fifo; - if (arg0 == 0) - assert(kfifo_alloc(&fifo, fifo_size, 0) == 0); - else - { - void *buf = kmalloc(fifo_size, 0); - kfifo_init(&fifo, buf, fifo_size); - } - - assert(fifo.buffer != NULL); - assert(fifo.total_size == fifo_size); - assert(kfifo_total_size(&fifo) == fifo_size); - assert(fifo.size == 0); - assert(kfifo_size(&fifo) == 0); - assert(fifo.in_offset == 0); - assert(fifo.out_offset == 0); - assert(kfifo_empty(&fifo) == 1); - assert(kfifo_full(&fifo) == 0); - - // 循环增加10个uint64_t - for (int i = 1; i <= 10; ++i) - { - uint64_t tmp = i; - assert(kfifo_in(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - } - assert(fifo.in_offset == 10 * sizeof(uint64_t)); - assert(fifo.out_offset == 0); - assert(fifo.size == 10 * sizeof(uint64_t)); - assert(fifo.total_size == fifo_size); - - // 循环删除这10个uint64_t - for (int i = 1; i <= 10; ++i) - { - uint64_t tmp = 0; - assert(kfifo_out(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - assert(tmp == i); - assert(fifo.size == (10 - i) * sizeof(uint64_t)); - assert(fifo.in_offset == 10 * sizeof(uint64_t)); - assert(fifo.out_offset == i * sizeof(uint64_t)); - } - - assert(fifo.in_offset == 10 * sizeof(uint64_t)); - assert(fifo.out_offset == 10 * sizeof(uint64_t)); - assert(fifo.in_offset == fifo.out_offset); - assert(kfifo_empty(&fifo) == 1); - - // reset - kfifo_reset(&fifo); - assert(fifo.in_offset == 0); - assert(fifo.out_offset == 0); - assert(fifo.size == 0); - - // 测试插入31个元素 - for (int i = 1; i <= 31; ++i) - { - uint64_t tmp = i; - assert(kfifo_in(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - } - - assert(fifo.size == 31 * sizeof(uint64_t)); - assert(fifo.in_offset == 31 * sizeof(uint64_t)); - assert(fifo.out_offset == 0); - - // 然后再尝试插入一个大小为2*sizeof(uint64_t)的元素 - { - __int128_t tmp = 100; - assert(kfifo_in(&fifo, &tmp, sizeof(__int128_t)) == 0); - assert(fifo.size == 31 * sizeof(uint64_t)); - assert(fifo.in_offset == 31 * sizeof(uint64_t)); - assert(fifo.out_offset == 0); - } - // 插入一个uint64, 队列满 - { - uint64_t tmp = 32; - assert(kfifo_in(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - assert(kfifo_full(&fifo)); - assert(kfifo_empty(&fifo) == 0); - assert(fifo.size == fifo.total_size); - assert(fifo.in_offset == fifo_size); - assert(fifo.out_offset == 0); - } - - // 取出之前的20个元素 - for (int i = 1; i <= 20; ++i) - { - uint64_t tmp = 0; - assert(kfifo_out(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - } - assert(fifo.size == (fifo.total_size - 20 * sizeof(uint64_t))); - assert(fifo.in_offset == fifo_size); - assert(fifo.out_offset == 20 * sizeof(uint64_t)); - - // 插入10个元素,剩余10个空位 - { - uint64_t tmp = 99; - - assert(kfifo_in(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - assert(fifo.in_offset == 1 * sizeof(uint64_t)); - - for (int i = 1; i <= 9; ++i) - { - assert(kfifo_in(&fifo, &tmp, sizeof(uint64_t)) == sizeof(uint64_t)); - } - assert(fifo.in_offset == 10 * sizeof(uint64_t)); - assert(fifo.size == 22 * sizeof(uint64_t)); - } - - { - // 取出20个 - char tmp[20 * sizeof(uint64_t)]; - assert(kfifo_out(&fifo, &tmp, 20 * sizeof(uint64_t)) == 20 * sizeof(uint64_t)); - assert(fifo.out_offset == 8 * sizeof(uint64_t)); - assert(fifo.size == 2 * (sizeof(uint64_t))); - } - - { - // 插入25个 - char tmp[25 * sizeof(uint64_t)]; - assert(kfifo_in(&fifo, &tmp, 25 * sizeof(uint64_t)) == 25 * sizeof(uint64_t)); - assert(fifo.out_offset == 8 * sizeof(uint64_t)); - assert(fifo.size == 27 * sizeof(uint64_t)); - assert(fifo.in_offset == 3 * sizeof(uint64_t)); - } - - // 测试reset out - uint32_t prev_in_offset = fifo.in_offset; - kfifo_reset_out(&fifo); - assert(fifo.size == 0); - assert(fifo.total_size == fifo_size); - assert(fifo.in_offset == prev_in_offset); - assert(fifo.out_offset == prev_in_offset); - - // 测试释放 - if (arg0 == 0) - { - kfifo_free_alloc(&fifo); - assert(fifo.buffer == NULL); - } - return 0; -} - -static ktest_case_table kt_kfifo_func_table[] = { - ktest_kfifo_case0_1, -}; - -int ktest_test_kfifo(void* arg) -{ - kTEST("Testing kfifo..."); - for (int i = 0; i < sizeof(kt_kfifo_func_table) / sizeof(ktest_case_table); ++i) - { - kTEST("Testing case %d", i); - kt_kfifo_func_table[i](i, 0); - } - kTEST("kfifo Test done."); - return 0; -} diff --git a/kernel/src/ktest/test-kvm.c b/kernel/src/ktest/test-kvm.c deleted file mode 100644 index 66cc4f63..00000000 --- a/kernel/src/ktest/test-kvm.c +++ /dev/null @@ -1,23 +0,0 @@ -#include "ktest.h" -#include "ktest_utils.h" - -static long ktest_kvm_case0_1(uint64_t arg0, uint64_t arg1){ - kTEST("Testing /dev/kvm device..."); - -} - -static ktest_case_table kt_kvm_func_table[] = { - ktest_kvm_case0_1, -}; - -int ktest_test_kvm(void* arg) -{ - kTEST("Testing kvm..."); - for (int i = 0; i < sizeof(kt_kvm_func_table) / sizeof(ktest_case_table); ++i) - { - kTEST("Testing case %d", i); - kt_kvm_func_table[i](i, 0); - } - kTEST("kvm Test done."); - return 0; -} diff --git a/kernel/src/libs/bitree.c b/kernel/src/libs/bitree.c deleted file mode 100644 index c81f7146..00000000 --- a/kernel/src/libs/bitree.c +++ /dev/null @@ -1,234 +0,0 @@ -#include -#include -#include -#include -#include -#include - -#define smaller(root, a, b) (root->cmp((a)->value, (b)->value) == -1) -#define equal(root, a, b) (root->cmp((a)->value, (b)->value) == 0) -#define greater(root, a, b) (root->cmp((a)->value, (b)->value) == 1) - -/** - * @brief 创建二叉搜索树 - * - * @param node 根节点 - * @param cmp 比较函数 - * @param release 用来释放结点的value的函数 - * @return struct bt_root_t* 树根结构体 - */ -struct bt_root_t *bt_create_tree(struct bt_node_t *node, int (*cmp)(void *a, void *b), int (*release)(void *value)) -{ - if (node == NULL || cmp == NULL) - return (void*)-EINVAL; - - struct bt_root_t *root = (struct bt_root_t *)kmalloc(sizeof(struct bt_root_t), 0); - memset((void *)root, 0, sizeof(struct bt_root_t)); - root->bt_node = node; - root->cmp = cmp; - root->release = release; - root->size = (node == NULL) ? 0 : 1; - - return root; -} - -/** - * @brief 创建结点 - * - * @param left 左子节点 - * @param right 右子节点 - * @param value 当前节点的值 - * @return struct bt_node_t* - */ -struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t *parent, void *value) -{ - struct bt_node_t *node = (struct bt_node_t *)kmalloc(sizeof(struct bt_node_t), 0); - FAIL_ON_TO(node == NULL, nomem); - memset((void *)node, 0, sizeof(struct bt_node_t)); - - node->left = left; - node->right = right; - node->value = value; - node->parent = parent; - - return node; -nomem:; - return (void*)-ENOMEM; -} -/** - * @brief 插入结点 - * - * @param root 树根结点 - * @param value 待插入结点的值 - * @return int 返回码 - */ -int bt_insert(struct bt_root_t *root, void *value) -{ - if (root == NULL) - return -EINVAL; - - struct bt_node_t *this_node = root->bt_node; - struct bt_node_t *last_node = NULL; - struct bt_node_t *insert_node = bt_create_node(NULL, NULL, NULL, value); - FAIL_ON_TO((uint64_t)insert_node == (uint64_t)(-ENOMEM), failed); - - while (this_node != NULL) - { - last_node = this_node; - if (smaller(root, insert_node, this_node)) - this_node = this_node->left; - else - this_node = this_node->right; - } - - insert_node->parent = last_node; - if (unlikely(last_node == NULL)) - root->bt_node = insert_node; - else - { - if (smaller(root, insert_node, last_node)) - last_node->left = insert_node; - else - last_node->right = insert_node; - } - ++root->size; - return 0; - -failed:; - return -ENOMEM; -} - -/** - * @brief 搜索值为value的结点 - * - * @param value 值 - * @param ret_addr 返回的结点基地址 - * @return int 错误码 - */ -int bt_query(struct bt_root_t *root, void *value, uint64_t *ret_addr) -{ - struct bt_node_t *this_node = root->bt_node; - struct bt_node_t tmp_node = {0}; - tmp_node.value = value; - - // 如果返回地址为0 - if (ret_addr == NULL) - return -EINVAL; - - while (this_node != NULL && !equal(root, this_node, &tmp_node)) - { - if (smaller(root, &tmp_node, this_node)) - this_node = this_node->left; - else - this_node = this_node->right; - } - - if (this_node != NULL && equal(root, this_node, &tmp_node)) - { - *ret_addr = (uint64_t)this_node; - return 0; - } - else - { - // 找不到则返回-1，且addr设为0 - *ret_addr = NULL; - return -1; - } -} - -static struct bt_node_t *bt_get_minimum(struct bt_node_t *this_node) -{ - while (this_node->left != NULL) - this_node = this_node->left; - return this_node; -} - -/** - * @brief 删除结点 - * - * @param root 树根 - * @param value 待删除结点的值 - * @return int 返回码 - */ -int bt_delete(struct bt_root_t *root, void *value) -{ - uint64_t tmp_addr; - int retval; - - // 寻找待删除结点 - retval = bt_query(root, value, &tmp_addr); - if (retval != 0 || tmp_addr == NULL) - return retval; - - struct bt_node_t *this_node = (struct bt_node_t *)tmp_addr; - struct bt_node_t *to_delete = NULL, *to_delete_son = NULL; - if (this_node->left == NULL || this_node->right == NULL) - to_delete = this_node; - else - { - to_delete = bt_get_minimum(this_node->right); - // 释放要被删除的值，并把下一个结点的值替换上来 - root->release(this_node->value); - this_node->value = to_delete->value; - } - - if (to_delete->left != NULL) - to_delete_son = to_delete->left; - else - to_delete_son = to_delete->right; - - if (to_delete_son != NULL) - to_delete_son->parent = to_delete->parent; - - if (to_delete->parent == NULL) - root->bt_node = to_delete_son; - else - { - if (to_delete->parent->left == to_delete) - to_delete->parent->left = to_delete_son; - else - to_delete->parent->right = to_delete_son; - } - - --root->size; - // 释放最终要删除的结点的对象 - kfree(to_delete); -} - -/** - * @brief 释放整个二叉搜索树 - * - * @param root 树的根节点 - * @return int 错误码 - */ -int bt_destroy_tree(struct bt_root_t *root) -{ - // 新建一个kfifo缓冲区，将指向结点的指针存入fifo队列 - // 注：为了将指针指向的地址存入队列，我们需要对指针取地址 - struct kfifo_t fifo; - kfifo_alloc(&fifo, ((root->size + 1) / 2) * sizeof(struct bt_node_t *), 0); - kfifo_in(&fifo, (void *)&(root->bt_node), sizeof(struct bt_node_t *)); - - // bfs - while (!kfifo_empty(&fifo)) - { - // 取出队列头部的结点指针 - struct bt_node_t *nd; - int count = kfifo_out(&fifo, &nd, sizeof(uint64_t)); - - // 将子节点加入队列 - if (nd->left != NULL) - kfifo_in(&fifo, (void *)&(nd->left), sizeof(struct bt_node_t *)); - - if (nd->right != NULL) - kfifo_in(&fifo, (void *)&(nd->right), sizeof(struct bt_node_t *)); - - // 销毁当前节点 - root->release(nd->value); - kfree(nd); - } - - kfifo_free_alloc(&fifo); - - return 0; -} \ No newline at end of file diff --git a/kernel/src/libs/idr.c b/kernel/src/libs/idr.c deleted file mode 100644 index 46a417a2..00000000 --- a/kernel/src/libs/idr.c +++ /dev/null @@ -1,1058 +0,0 @@ -#include -#if ARCH(I386) || ARCH(X86_64) - -#include -#include -/** - * @brief 更换两个idr_layer指针 - * - * @param a - * @param b - */ -static void __swap(struct idr_layer **a, struct idr_layer **b) -{ - struct idr_layer *t = *a; - *a = *b, *b = t; -} - -/** - * @brief 初始化idr - 你需要保证函数调用之前 free_list指针 为空 - * - * @param idp - */ -void idr_init(struct idr *idp) -{ - memset(idp, 0, sizeof(struct idr)); - spin_init(&idp->lock); -} - -/** - * @brief 向idr的free_list中添加一个节点(空节点) - * - * @param idp - * @param p - */ -static void __move_to_free_list(struct idr *idp, struct idr_layer *p) -{ - unsigned long flags; - spin_lock_irqsave(&idp->lock, flags); - - // 插入free_list - p->ary[0] = idp->free_list; - io_sfence(); - idp->free_list = p; - io_sfence(); - ++(idp->id_free_cnt); - - spin_unlock_irqrestore(&idp->lock, flags); -} - -/** - * @brief Get the free_idr_layer from free list object - * - * @param idp - * @return void* - */ -static void *__get_from_free_list(struct idr *idp) -{ - if (idp->id_free_cnt == 0) - { - if (idr_preload(idp, 0) != 0) - { - kBUG("idr-module find a BUG: get free node fail.(Possible ENOMEM error)"); - return NULL; - } - } - - unsigned long flags; - spin_lock_irqsave(&idp->lock, flags); - - // free_list还有节点 - struct idr_layer *item = idp->free_list; - - if (item == NULL) - { - BUG_ON(1); - } - - io_sfence(); - idp->free_list = idp->free_list->ary[0]; - io_sfence(); - item->ary[0] = NULL; // 记得清空原来的数据 - io_sfence(); - --(idp->id_free_cnt); - - spin_unlock_irqrestore(&idp->lock, flags); - - return item; -} - -/** - * @brief 为idr预分配空间 - * - * @param idp - * @param gfp_mask - * @return int (如果分配成功,将返回0; 否则返回负数 -ENOMEM, 有可能是内存空间不够) - */ -int idr_preload(struct idr *idp, gfp_t gfp_mask) -{ - int timer = 0; - while (idp->id_free_cnt < IDR_FREE_MAX) - { - struct idr_layer *new_one; - new_one = kzalloc(sizeof(struct idr_layer), gfp_mask); // 默认清空? - if (unlikely(new_one == NULL)) - return -ENOMEM; - - __move_to_free_list(idp, new_one); - timer++; - } - return 0; -} - -/** - * @brief 释放一个layer的空间 - * - * @param p - */ -static void __idr_layer_free(struct idr_layer *p) -{ - kfree(p); -} - -/** - * @brief 向上生长一层idr_layer - * - * @param idp - * @return int (0生长成功, 否则返回错误码) - */ -static int __idr_grow(struct idr *idp) -{ - struct idr_layer *new_node = __get_from_free_list(idp); - if (NULL == new_node) - return -ENOMEM; - - __swap(&new_node, &idp->top); - - idp->top->ary[0] = new_node; - idp->top->layer = new_node ? (new_node->layer + 1) : 0; // 注意特判空指针 - idp->top->bitmap = 0; - idp->top->full = 0; // clear - - if (new_node != NULL) // 设置第0位 = 1, 同时维护树的大小 - { - idp->top->bitmap = 1; - } - if (new_node != NULL && new_node->full == IDR_FULL) - { - idp->top->full = 1; // 别忘了初始化 full - } - - return 0; -} - -/** - * @brief 获取一个没有被占领的ID - * - * @param idp - * @param stk 栈空间 - * @return int (负数表示获取ID失败, [0 <= id && id <= INT_MAX] 则获取ID成功) - */ -static int __idr_get_empty_slot(struct idr *idp, struct idr_layer **stk) -{ - // 注意特判 idp->top == NULL - while (NULL == idp->top || idp->top->full == IDR_FULL) - if (__idr_grow(idp) != 0) - return -ENOMEM; - - int64_t id = 0; - int layer = idp->top->layer; - BUG_ON(layer + 1 >= 7); - stk[layer + 1] = NULL; // 标志为数组末尾 - - struct idr_layer *cur_layer = idp->top; - while (layer >= 0) - { - stk[layer] = cur_layer; - int pos = __lowbit_id(~cur_layer->full); - - if (unlikely(pos < 0)) - { - kBUG("Value 'cur_layer->full' had been full;" - "but __idr_get_empty_slot still try to insert a value."); - } - - id = (id << IDR_BITS) | pos; - cur_layer = cur_layer->ary[pos]; - - if (layer > 0 && NULL == cur_layer) // 只有非叶子节点才需要开辟儿子节点 - { - // 初始化儿子节点 - cur_layer = __get_from_free_list(idp); - if (NULL == cur_layer) - return -ENOMEM; - cur_layer->layer = layer - 1; // 儿子节点的layer - cur_layer->full = 0; - cur_layer->bitmap = 0; - - stk[layer]->ary[pos] = cur_layer; // 最后别忘了记录儿子节点 - } - - --layer; - } - - return id; -} - -/** - * @brief 更新full对象 (辅助函数，内部没有边界特判) - * - * @param idp - * @param id - * @param stk 需要保证stk数组末尾是NULL - * @param mark 0代表叶子空, 1代表叶子非空但未满, 2代表满 - */ -static __always_inline void __idr_mark_full(struct idr *idp, int id, struct idr_layer **stk, int mark) -{ - int64_t __id = (int64_t)id; - if (unlikely(NULL == stk[0] || NULL == idp->top)) - { - kBUG("idr-module find a BUG: idp->top can't be NULL."); - return; - } - - // 处理叶子节点的full/bitmap标记 - int64_t layer_id = __id & IDR_MASK; - if (mark == 2) - stk[0]->full |= (1ull << layer_id); - if (mark >= 1) - stk[0]->bitmap |= (1ull << layer_id); - - for (int i = 1; stk[i]; ++i) - { - __id >>= IDR_BITS; - layer_id = __id & IDR_MASK; - - stk[i]->bitmap |= (1ull << layer_id); - if (stk[i - 1]->full == IDR_FULL) - stk[i]->full |= (1ull << layer_id); - } -} - -/** - * @brief 提取一条已存在的路径 - * - * @param idp - * @param id - * @param stk - * @return int (0表示没有这条路径, 1表示找到这条路径) - */ -static __always_inline int __idr_get_path(struct idr *idp, int id, struct idr_layer **stk) -{ - int64_t __id = (int64_t)id; - if (unlikely(idp->top == NULL || __id < 0)) - { - kBUG("idr-module find a BUG: idp->top can't be NULL and id must be non-negative."); - return 0; - } - - struct idr_layer *cur_layer = idp->top; - int layer = cur_layer->layer; - stk[layer + 1] = NULL; // 标志数组结尾 - - if (unlikely((__id >> ((layer + 1ull) * IDR_BITS)) > 0)) - { - kBUG("idr-module find a BUG: id is invalid."); - return 0; - } - - // 提取路径 - while (layer >= 0) - { - stk[layer] = cur_layer; - int64_t layer_id = (__id >> (layer * IDR_BITS)) & IDR_MASK; - - if (unlikely(((cur_layer->bitmap >> layer_id) & 1) == 0)) - { - kBUG("idr-module find a BUG: no-such son."); - return 0; // 没有这一个儿子 - } - - cur_layer = cur_layer->ary[layer_id]; - --layer; - } - - return 1; -} - -/** - * @brief 更新full对象 (辅助函数，内部没有边界特判) - * - * @param idp - * @param id - * @param stk 需要保证stk数组末尾是NULL - * @param mark 0代表叶子空, 1代表叶子非空但未满, 2代表满 - */ -static __always_inline void __idr_erase_full(struct idr *idp, int id, struct idr_layer **stk, int mark) -{ - int64_t __id = (int64_t)id; - if (unlikely(NULL == stk[0] || NULL == idp->top)) - { - kBUG("idr-module find a BUG: idp->top can't be NULL."); - return; - } - - // 处理叶子节点的full/bitmap标记 - int64_t layer_id = __id & IDR_MASK; - if (mark == 0) // 叶子的某个插槽为空 - { - stk[0]->ary[layer_id] = NULL; - stk[0]->bitmap ^= (1ull << layer_id); - } - if (mark != 2 && ((stk[0]->full >> layer_id) & 1)) - stk[0]->full ^= (1ull << layer_id); - - // 删除节点 - for (int layer = 1; stk[layer]; ++layer) - { - __id >>= IDR_BITS; - layer_id = __id & IDR_MASK; - - if (NULL == stk[layer - 1]->bitmap) // 儿子是空节点 - { - stk[layer]->ary[layer_id] = NULL; - stk[layer]->bitmap ^= (1ull << layer_id); - - if ((stk[layer]->full >> layer_id) & 1) - stk[layer]->full ^= (1ull << layer_id); - - __idr_layer_free(stk[layer - 1]); - stk[layer - 1] = NULL; // 释放空间记得设置为 NULL - } - else if (stk[layer - 1]->full != IDR_FULL) - { - if ((stk[layer]->full >> layer_id) & 1) - stk[layer]->full ^= (1ull << layer_id); - } - } - - // 特判根节点是否只剩0号儿子节点 (注意还要layer > 0) - // (注意,有可能出现idp->top=NULL) - // bitmap: 1000...000/00.....000 - while (idp->top != NULL && ((idp->top->bitmap <= 1 && idp->top->layer > 0) || // 一条链的情况 - (idp->top->layer == 0 && idp->top->bitmap == 0))) // 最后一个点的情况 - { - struct idr_layer *t = idp->top->layer ? idp->top->ary[0] : NULL; - __idr_layer_free(idp->top); - idp->top = t; - } -} - -/** - * @brief 内部的分配ID函数 (辅助函数) - * - * @param idp - * @param ptr - * @param starting_id 暂时没用 - * @return (0 <= id <= INT_MAX 表示申请的ID；否则是负数错误码, 可能是内存空间不够或者程序逻辑有误)； - */ -static int __idr_get_new_above_int(struct idr *idp, void *ptr, int starting_id) -{ - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; - - // kdebug("stk=%#018lx, sizeof_stk=%d", stk, sizeof(stk)); - // memset(stk, 0, sizeof(stk)); - // 你可以选择 memset(stk, 0, sizeof(stk)); - int64_t id = __idr_get_empty_slot(idp, stk); - - if (id >= 0) - { - stk[0]->ary[IDR_MASK & id] = ptr; - __idr_mark_full(idp, id, stk, 2); - } - - return id; -} - -/** - * @brief 从[0,INT_MAX]区间内返回一个最小的空闲ID - * - * @param idp - * @param ptr - id 所对应的指针 - * @param int* id - 传入int指针，获取到的NEW_ID存在id里 - * @return int (0表示获取id成功, 负数代表错误 - 可能是内存空间不够) - */ -int idr_alloc(struct idr *idp, void *ptr, int *id) -{ - int rv = __idr_get_new_above_int(idp, ptr, 0); - if (rv < 0) - return rv; // error - *id = rv; - return 0; -} - -/** - * @brief 删除一个id, 但是不释放对应的ptr指向的空间, 同时返回这个被删除id所对应的ptr - * - * @param idp - * @param id - * @return void* - * (如果删除成功，就返回被删除id所对应的ptr；否则返回NULL。注意：如果这个id本来就和NULL绑定，那么也会返回NULL) - */ -void *idr_remove(struct idr *idp, int id) -{ - int64_t __id = (int64_t)id; - if (unlikely(idp->top == NULL || __id < 0)) - return NULL; - - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; - - if (0 == __idr_get_path(idp, __id, stk)) - return NULL; // 找不到路径 - - void *ret = stk[0]->ary[__id & IDR_MASK]; - __idr_erase_full(idp, __id, stk, 0); - - return ret; -} - -/** - * @brief 移除IDR中所有的节点,如果free=true,则同时释放所有数据指针的空间(kfree) - * - * @param idp - * @param free - */ -static void __idr_remove_all_with_free(struct idr *idp, bool free) -{ - if (unlikely(NULL == idp->top)) - { - kBUG("idr-module find a BUG: idp->top can't be NULL."); - return; - } - - int sz = sizeof(struct idr_layer); - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; - - struct idr_layer *cur_layer = idp->top; - int layer = cur_layer->layer; - BUG_ON(layer + 1 >= 7); - stk[layer + 1] = NULL; // 标记数组结尾 - - while (cur_layer != NULL) - { - if (layer > 0 && cur_layer->bitmap) // 非叶子节点 - { - stk[layer] = cur_layer; // 入栈 - int64_t id = __lowbit_id(cur_layer->bitmap); - - cur_layer->bitmap ^= (1ull << id); - cur_layer = cur_layer->ary[id]; - stk[layer]->ary[id] = NULL; - --layer; - } - else - { - if (free) - { - for (int i = 0; i < IDR_SIZE; i++) // 释放数据指针的空间 - { - kfree(cur_layer->ary[i]); - cur_layer->ary[i] = NULL; - } - } - - __idr_layer_free(cur_layer); // 释放空间记得设置为NULL - ++layer; - - cur_layer = stk[layer]; // 出栈 - } - } - idp->top = NULL; -} - -/** - * @brief 删除idr的所有节点，同时释放数据指针的空间，回收free_list的所有空间 - (数据指针指ID所绑定的pointer) - * @param idp - */ -static void __idr_destroy_with_free(struct idr *idp) -{ - if (likely(idp->top)) - __idr_remove_all_with_free(idp, 1); - idp->top = NULL; - while (idp->id_free_cnt) - __idr_layer_free(__get_from_free_list(idp)); - idp->free_list = NULL; -} - -/** - * @brief 删除所有的ID - * - * @param idp - */ -void idr_remove_all(struct idr *idp) -{ - if (unlikely(NULL == idp->top)) - return; - - __idr_remove_all_with_free(idp, 0); -} - -/** - * @brief 释放一个idr占用的所有空间 - * - * @param idp - */ -void idr_destroy(struct idr *idp) -{ - idr_remove_all(idp); - idp->top = NULL; - while (idp->id_free_cnt) - __idr_layer_free(__get_from_free_list(idp)); - idp->free_list = NULL; -} - -/** - * @brief 返回id对应的数据指针 - * - * @param idp - * @param id - * @return void* (如果id不存在返回NULL；否则返回对应的指针ptr; 注意: 有可能用户的数据本来就是NULL) - */ -void *idr_find(struct idr *idp, int id) -{ - int64_t __id = (int64_t)id; - if (unlikely(idp->top == NULL || __id < 0)) - { - // kwarn("idr-find: idp->top == NULL || id < 0."); - return NULL; - } - - struct idr_layer *cur_layer = idp->top; - int layer = cur_layer->layer; // 特判NULL - barrier(); - // 如果查询的ID的bit数量比layer*IDR_BITS还大, 直接返回NULL - if ((__id >> ((layer + 1) * IDR_BITS)) > 0) - return NULL; - barrier(); - barrier(); - int64_t layer_id = 0; - while (layer >= 0 && cur_layer != NULL) - { - barrier(); - layer_id = (__id >> (IDR_BITS * layer)) & IDR_MASK; - barrier(); - cur_layer = cur_layer->ary[layer_id]; - --layer; - } - return cur_layer; -} - -/** - * @brief 返回id大于 start_id 的数据指针(即非空闲id对应的指针), 如果没有则返回NULL; 可以传入nextid指针，获取下一个id; - * 时间复杂度O(log_64(n)), 空间复杂度O(log_64(n)) 约为 6; - * - * @param idp - * @param start_id - * @param nextid - * @return void* (如果分配,将返回该ID对应的数据指针; 否则返回NULL。注意， - * 返回NULL不一定代表这ID不存在，有可能该ID就是与空指针绑定。) - */ -void *idr_find_next_getid(struct idr *idp, int64_t start_id, int *nextid) -{ - BUG_ON(nextid == NULL); - if (unlikely(idp->top == NULL)) - { - *nextid = -1; - return NULL; - } - - ++start_id; - start_id = max(0, start_id); // 特判负数 - *nextid = 0; - - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; - - // memset(stk, 0, sizeof(struct idr_layer *) * (MAX_LEVEL + 1)); - bool state[MAX_LEVEL + 1] = {0}; // 标记是否大于等于] - int pos_i[MAX_LEVEL + 1] = {0}; - - // memset(state, 0, sizeof(state)); - // memset(pos_i, 0, sizeof(pos_i)); // 必须清空 - - struct idr_layer *cur_layer = idp->top; - bool cur_state = false; - bool init_flag = true; - int layer = cur_layer->layer; - BUG_ON(layer + 1 >= 7); - stk[layer + 1] = NULL; // 标记数组结尾 - - // 如果查询的ID的bit数量比layer*IDR_BITS还大, 直接返回NULL - if ((start_id >> ((layer + 1) * IDR_BITS)) > 0) - { - *nextid = -1; - return NULL; - } - - while (cur_layer) // layer < top->layer + 1 - { - BUG_ON(layer < 0); - if (init_flag) // 第一次入栈 - { - stk[layer] = cur_layer; - state[layer] = cur_state; - pos_i[layer] = cur_state ? 0 : ((start_id >> (layer * IDR_BITS)) & IDR_MASK); - } - else - { - pos_i[layer]++; - state[layer] = cur_state = true; - } - - BUG_ON(pos_i[layer] >= 64); - unsigned long t_bitmap = (cur_layer->bitmap >> pos_i[layer]); - if (t_bitmap) // 进一步递归到儿子下面去 - { - int64_t layer_id = __lowbit_id(t_bitmap) + pos_i[layer]; - - // 特别情况 - if ((cur_state == false) && (layer_id > pos_i[layer] > 0)) - cur_state = true; - - pos_i[layer] = layer_id; - - *nextid = (((uint64_t)*nextid) << IDR_BITS) | layer_id; // 更新答案 - if (layer == 0) - { - // 找到下一个id: nextid - return cur_layer->ary[layer_id]; - } - - cur_layer = cur_layer->ary[layer_id]; - init_flag = true; // 儿子节点第一次入栈, 需要init - --layer; - } - else // 子树搜索完毕,向上回溯 - { - (*nextid) >>= IDR_BITS; // 维护答案 - - ++layer; - cur_layer = stk[layer]; - init_flag = false; // 不是第一次入栈, 不需要init - } - } - - *nextid = -1; - return NULL; // 找不到 -} - -/** - * @brief 返回id大于 start_id 的数据指针(即非空闲id对应的指针), 如果没有则返回NULL - * - * @param idp - * @param start_id - * @return void* (如果分配,将返回该ID对应的数据指针; 否则返回NULL。注意， - * 返回NULL不一定代表这ID不存在，有可能该ID就是与空指针绑定。) - */ -void *idr_find_next(struct idr *idp, int start_id) -{ - int nextid; - void *ptr = idr_find_next_getid(idp, start_id, &nextid); - - return ptr; // 当 nextid == -1 时， 出现错误 -} - -/** - * @brief 根据id替换指针，你需要保证这个id存在于idr中，否则将会出现错误 - * - * @param idp - * @param ptr (要替换旧指针的新指针 - new_ptr) - * @param id - * @param old_ptr (返回旧指针, 注意NULL不一定是出现错误，有可能是数据本来就是NULL) - * @return int (0代表成功，否则就是负数 - 代表错误) - */ -int idr_replace_get_old(struct idr *idp, void *ptr, int id, void **old_ptr) -{ - int64_t __id = (int64_t)id; - if (unlikely(old_ptr == NULL)) - { - BUG_ON(1); - return -EINVAL; - } - *old_ptr = NULL; - - if (unlikely(idp->top == NULL || __id < 0)) - return -EDOM; // 参数错误 - - struct idr_layer *cur_layer = idp->top; - int64_t layer = cur_layer->layer; - // 如果查询的ID的bit数量比layer*IDR_BITS还大, 直接返回NULL - if ((__id >> ((layer + 1) * IDR_BITS)) > 0) - return -EDOM; - - while (layer > 0) - { - int64_t layer_id = (__id >> (layer * IDR_BITS)) & IDR_MASK; - - if (unlikely(NULL == cur_layer->ary[layer_id])) - return -ENOMEM; - - cur_layer = cur_layer->ary[layer_id]; - layer--; - } - - __id &= IDR_MASK; - *old_ptr = cur_layer->ary[__id]; - cur_layer->ary[__id] = ptr; - - return 0; -} - -/** - * @brief 根据id替换指针，你需要保证这个id存在于idr中，否则将会出现错误 - * - * @param idp - * @param ptr (要替换 '旧数据指针' 的 '新数据指针' - new_ptr) - * @param id - * @return int (0代表成功，否则就是错误码 - 代表错误) - */ -int idr_replace(struct idr *idp, void *ptr, int id) -{ - int64_t __id = (int64_t)id; - if (__id < 0) - return -EDOM; - - void *old_ptr; - int flags = idr_replace_get_old(idp, ptr, __id, &old_ptr); - - return flags; -} - -/** - * @brief 判断一个idr是否为空 - * - * @param idp - * @return true - * @return false - */ -bool idr_empty(struct idr *idp) -{ - if (idp == NULL || idp->top == NULL || !idp->top->bitmap) - return true; - - return false; -} - -static bool __idr_cnt_pd(struct idr_layer *cur_layer, int layer_id) -{ - // if(layer_id) - unsigned long flags = ((cur_layer->bitmap) >> layer_id); - if ((flags % 2) == 0) - { - barrier(); - return false; // 没有这一个儿子 - } - return true; -} - -static bool __idr_cnt(int layer, int id, struct idr_layer *cur_layer) -{ - int64_t __id = (int64_t)id; - while (layer >= 0) // 提取路径 - { - barrier(); - - int64_t layer_id = (__id >> (layer * IDR_BITS)) & IDR_MASK; - - barrier(); - - if (__idr_cnt_pd(cur_layer, layer_id) == false) - return false; - - barrier(); - - barrier(); - cur_layer = cur_layer->ary[layer_id]; - - barrier(); - --layer; - } - return true; -} - -/** - * @brief 这个函数是可以用于判断一个ID是否已经被分配的。 - * - * @param idp - * @param id - * @return true - * @return false - */ -bool idr_count(struct idr *idp, int id) -{ - int64_t __id = (int64_t)id; - barrier(); - if (unlikely(idp == NULL || idp->top == NULL || __id < 0)) - return false; - - barrier(); - struct idr_layer *cur_layer = idp->top; - barrier(); - int layer = cur_layer->layer; - - // 如果查询的ID的bit数量比 layer*IDR_BITS 还大, 直接返回false - if (unlikely((__id >> ((layer + 1ull) * IDR_BITS)) > 0)) - { - BUG_ON(1); - return false; - } - barrier(); - - return __idr_cnt(layer, id, cur_layer); -} - -/********* ****************************************** ida - idr 函数实现分割线 - * **********************************************************/ - -/** - * @brief 初始化IDA, 你需要保证调用函数之前, ida的free_list为空, 否则会导致内存泄漏 - * @param ida_p - */ -void ida_init(struct ida *ida_p) -{ - memset(ida_p, 0, sizeof(struct ida)); - idr_init(&ida_p->idr); -} - -/** - * @brief 释放bitmap空间 - * - */ -static void __ida_bitmap_free(struct ida_bitmap *bitmap) -{ - kfree(bitmap); -} - -/** - * @brief 为ida预分配空间 - * - * @param ida_p - * @param gfp_mask - * @return int (如果分配成功,将返回0; 否则返回负数错误码, 有可能是内存空间不够) - */ -int ida_preload(struct ida *ida_p, gfp_t gfp_mask) -{ - if (idr_preload(&ida_p->idr, gfp_mask) != 0) - return -ENOMEM; - - spin_lock(&ida_p->idr.lock); - - if (NULL == ida_p->free_list) - { - struct ida_bitmap *bitmap; - bitmap = kzalloc(sizeof(struct ida_bitmap), gfp_mask); - if (NULL == bitmap) - { - spin_unlock(&ida_p->idr.lock); - return -ENOMEM; - } - ida_p->free_list = bitmap; - } - - spin_unlock(&ida_p->idr.lock); - return 0; -} - -/** - * @brief Get the ida bitmap object - * - * @param ida_p - * @return void* - */ -static void *__get_ida_bitmap(struct ida *ida_p, gfp_t gfp_mask) -{ - if (NULL == ida_p->free_list) - if (ida_preload(ida_p, gfp_mask) < 0) - { - kBUG("error : no memory."); - return NULL; - } - - struct ida_bitmap *tmp = ida_p->free_list; - ida_p->free_list = NULL; - return tmp; -} - -/** - * @brief 从bitmap中获取id， 并且标记这个ID已经被使用 - * @return int - */ -static int __get_id_from_bitmap(struct ida_bitmap *bmp) -{ - int ret = 0; - for (int ary_id = 0; ary_id < IDA_BITMAP_LONGS; ary_id++) - { - if (bmp->bitmap[ary_id] != IDR_FULL) - { - int bmp_id = __lowbit_id(~bmp->bitmap[ary_id]); - bmp->bitmap[ary_id] |= (1ull << bmp_id); - bmp->count++; // 注意， 这里已经标记这一位已经使用， 同时更新了ida_count - - if (unlikely((unsigned long long)ary_id * IDA_BMP_SIZE + bmp_id > INT32_MAX)) - { - BUG_ON(1); - // kBUG("ida设置id范围为[0, INT32_MAX], 但ida获取的id数值超过INT32_MAX."); - return -EDOM; - } - - return ary_id * IDA_BMP_SIZE + bmp_id; - } - } - - return -EDOM; // 不合法 -} - -/** - * @brief 获取一个ID - * - * @param ida_p - * @param p_id - * @return int (0表示获取ID成功， 否则是负数 - 错误码) - */ -int ida_alloc(struct ida *ida_p, int *p_id) -{ - BUG_ON(p_id == NULL); - *p_id = -1; - - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; // 你可以选择memset(0) - - // memset(stk, 0, sizeof(struct idr_layer *) * (MAX_LEVEL + 1)); - - io_sfence(); - int64_t idr_id = __idr_get_empty_slot(&ida_p->idr, stk); - - // 如果stk[0]=NULL,可能是idr内部出错/内存空间不够 - if (unlikely(NULL == stk[0])) - return -ENOMEM; - - if (unlikely(idr_id < 0)) - return idr_id; - - int64_t layer_id = idr_id & IDR_MASK; - - if (NULL == stk[0]->ary[layer_id]) - stk[0]->ary[layer_id] = __get_ida_bitmap(ida_p, 0); - - if (unlikely(NULL == stk[0]->ary[layer_id])) - return -ENOMEM; - - struct ida_bitmap *bmp = (struct ida_bitmap *)stk[0]->ary[layer_id]; - int low_id = __get_id_from_bitmap(bmp); - - if (unlikely(low_id < 0)) - return low_id; - - *p_id = idr_id * IDA_BITMAP_BITS + low_id; - __idr_mark_full(&ida_p->idr, idr_id, stk, (bmp->count == IDA_FULL ? 2 : 1)); - - return 0; -} - -/** - * @brief 查询ID是否已经被分配 - * - * @param ida_p - * @param id - * @return true - * @return false - */ -bool ida_count(struct ida *ida_p, int id) -{ - int64_t __id = (int64_t)id; - if (unlikely(NULL == ida_p || NULL == ida_p->idr.top || id < 0)) - return false; - - int idr_id = __id / IDA_BITMAP_BITS; - int ary_id = (__id % IDA_BITMAP_BITS) / IDA_BMP_SIZE; - int bmp_id = (__id % IDA_BITMAP_BITS) % IDA_BMP_SIZE; - - struct ida_bitmap *bmp = idr_find(&ida_p->idr, idr_id); - if (NULL == bmp) - return false; - - return ((bmp->bitmap[ary_id] >> bmp_id) & 1); -} - -/** - * @brief 删除一个ID - * - * @param ida_p - * @param id - */ -void ida_remove(struct ida *ida_p, int id) -{ - int64_t __id = (int64_t)id; - if (unlikely(NULL == ida_p || NULL == ida_p->idr.top || id < 0)) - return; - - int64_t idr_id = __id / IDA_BITMAP_BITS; - int64_t ary_id = (__id % IDA_BITMAP_BITS) / IDA_BMP_SIZE; - int64_t bmp_id = (__id % IDA_BITMAP_BITS) % IDA_BMP_SIZE; - - struct idr_layer *stk[MAX_LEVEL + 1] = {0}; - // memset(stk, 0, sizeof(struct idr_layer *) * (MAX_LEVEL + 1)); - - if (0 == __idr_get_path(&ida_p->idr, idr_id, stk)) - return; - - struct ida_bitmap *b_p = (struct ida_bitmap *)(stk[0]->ary[idr_id & IDR_MASK]); - - // 不存在这个ID 或者 b_p == NULL - if (unlikely(NULL == b_p || 0 == ((b_p->bitmap[ary_id] >> bmp_id) & 1))) - return; - - b_p->count--; // 更新了ida_count - b_p->bitmap[ary_id] ^= (1ull << bmp_id); - - __idr_erase_full(&ida_p->idr, idr_id, stk, (b_p->count > 0 ? 1 : 0)); - if (0 == b_p->count) - { - __ida_bitmap_free(b_p); - if (stk[0]) // stk[0] 有可能在 __idr_erase_full 里面已经kfree了 - stk[0]->ary[idr_id & IDR_MASK] = NULL; // 记得设置为空 - } -} - -/** - * @brief 释放所有空间(包括: idr + ida_bitmap + free_list) - * @param ida_p - */ -void ida_destroy(struct ida *ida_p) -{ - if (unlikely(ida_p == NULL)) - { - BUG_ON(1); - return; - } - - __idr_destroy_with_free(&ida_p->idr); - ida_p->idr.top = NULL; - __ida_bitmap_free(ida_p->free_list); - ida_p->free_list = NULL; -} - -/** - * @brief 判断一个ida是否为空 - * - * @param ida_p - * @return true - * @return false - */ -bool ida_empty(struct ida *ida_p) -{ - if (ida_p == NULL || ida_p->idr.top == NULL || !ida_p->idr.top->bitmap) - return true; - - return false; -} - -#endif \ No newline at end of file