Matthew Wilcox d37cacc5ad ida: Use exceptional entries for small IDAs ... We can use the root entry as a bitmap and save allocating a 128 byte bitmap for an IDA that contains only a few entries (30 on a 32-bit machine, 62 on a 64-bit machine). This costs about 300 bytes of kernel text on x86-64, so as long as 3 IDAs fall into this category, this is a net win for memory consumption. Thanks to Rasmus Villemoes for his work documenting the problem and collecting statistics on IDAs. Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com>		2017-02-13 21:44:02 -05:00
..
generated	radix tree test suite: Remove obsolete CONFIG	2017-02-13 16:09:43 -05:00
linux	ida: Move ida_bitmap to a percpu variable	2017-02-13 21:44:01 -05:00
.gitignore	Reimplement IDR and IDA using the radix tree	2017-02-13 21:44:01 -05:00
Makefile	Reimplement IDR and IDA using the radix tree	2017-02-13 21:44:01 -05:00
benchmark.c	radix tree test suite: benchmark for iterator	2016-12-14 16:04:09 -08:00
idr-test.c	ida: Use exceptional entries for small IDAs	2017-02-13 21:44:02 -05:00
iteration_check.c	radix tree test suite: check multiorder iteration	2016-12-14 16:04:10 -08:00
linux.c	radix tree test suite: Remove types.h	2017-02-13 16:09:41 -05:00
main.c	Reimplement IDR and IDA using the radix tree	2017-02-13 21:44:01 -05:00
multiorder.c	radix-tree: ensure counts are initialised	2016-12-14 16:04:10 -08:00
regression.h	radix-tree tests: add regression3 test	2016-03-17 15:09:34 -07:00
regression1.c	radix-tree tests: properly initialize mutex	2016-10-11 15:06:30 -07:00
regression2.c	radix-tree: delete radix_tree_range_tag_if_tagged()	2016-12-14 16:04:10 -08:00
regression3.c	radix-tree: improve multiorder iterators	2016-12-14 16:04:10 -08:00
tag_check.c	radix tree test suite: add new tag check	2016-12-14 16:04:10 -08:00
test.c	radix-tree: delete radix_tree_range_tag_if_tagged()	2016-12-14 16:04:10 -08:00
test.h	Reimplement IDR and IDA using the radix tree	2017-02-13 21:44:01 -05:00