mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2025-04-05 10:30:38 +07:00
0a835c4f09
The IDR is very similar to the radix tree. It has some functionality that the radix tree did not have (alloc next free, cyclic allocation, a callback-based for_each, destroy tree), which is readily implementable on top of the radix tree. A few small changes were needed in order to use a tag to represent nodes with free space below them. More extensive changes were needed to support storing NULL as a valid entry in an IDR. Plain radix trees still interpret NULL as a not-present entry. The IDA is reimplemented as a client of the newly enhanced radix tree. As in the current implementation, it uses a bitmap at the last level of the tree. Signed-off-by: Matthew Wilcox <willy@infradead.org> Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com> Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com> Cc: Konstantin Khlebnikov <koct9i@gmail.com> Cc: Ross Zwisler <ross.zwisler@linux.intel.com> Cc: Tejun Heo <tj@kernel.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
30 lines
570 B
C
30 lines
570 B
C
#ifndef _KERNEL_H
|
|
#define _KERNEL_H
|
|
|
|
#include "../../include/linux/kernel.h"
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <limits.h>
|
|
|
|
#include <linux/compiler.h>
|
|
#include <linux/err.h>
|
|
#include <linux/bitops.h>
|
|
#include <linux/log2.h>
|
|
#include "../../../include/linux/kconfig.h"
|
|
|
|
#ifdef BENCHMARK
|
|
#define RADIX_TREE_MAP_SHIFT 6
|
|
#else
|
|
#define RADIX_TREE_MAP_SHIFT 3
|
|
#endif
|
|
|
|
#define printk printf
|
|
#define pr_debug printk
|
|
#define pr_cont printk
|
|
|
|
#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
|
|
|
|
#define xchg(ptr, x) uatomic_xchg(ptr, x)
|
|
|
|
#endif /* _KERNEL_H */
|