diff options
| author | Matthew Wilcox <mawilcox@microsoft.com> | 2016-12-20 10:27:56 -0500 |
|---|---|---|
| committer | Matthew Wilcox <mawilcox@microsoft.com> | 2017-02-13 21:44:01 -0500 |
| commit | 0a835c4f090af2c76fc2932c539c3b32fd21fbbb (patch) | |
| tree | 729c24514309afc323ee08e6d8336eb1e558406e /tools/testing/radix-tree/.gitignore | |
| parent | 0ac398ef391b53122976325ab6953456ce8e8310 (diff) | |
| download | blackbird-obmc-linux-0a835c4f090af2c76fc2932c539c3b32fd21fbbb.tar.gz blackbird-obmc-linux-0a835c4f090af2c76fc2932c539c3b32fd21fbbb.zip | |
Reimplement IDR and IDA using the radix tree
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>
Diffstat (limited to 'tools/testing/radix-tree/.gitignore')
| -rw-r--r-- | tools/testing/radix-tree/.gitignore | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/tools/testing/radix-tree/.gitignore b/tools/testing/radix-tree/.gitignore index 11d888ca6a92..3b5534b643f0 100644 --- a/tools/testing/radix-tree/.gitignore +++ b/tools/testing/radix-tree/.gitignore @@ -1,2 +1,3 @@ main radix-tree.c +idr.c |
