diff options
| author | Matthew Wilcox <willy@linux.intel.com> | 2016-12-15 00:09:04 +0100 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2016-12-15 01:04:10 +0100 |
| commit | 2791653a6814d170fa893344618563a7b1da95c6 (patch) | |
| tree | 635c8ca43b49ac15836e5d4b5786d64733661755 /lib/hweight.c | |
| parent | radix-tree: add radix_tree_split (diff) | |
| download | linux-2791653a6814d170fa893344618563a7b1da95c6.tar.xz linux-2791653a6814d170fa893344618563a7b1da95c6.zip | |
radix-tree: add radix_tree_split_preload()
Calculate how many nodes we need to allocate to split an old_order entry
into multiple entries, each of size new_order. The test suite checks
that we allocated exactly the right number of nodes; neither too many
(checked by rtp->nr == 0), nor too few (checked by comparing
nr_allocated before and after the call to radix_tree_split()).
Link: http://lkml.kernel.org/r/1480369871-5271-60-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.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: Matthew Wilcox <mawilcox@microsoft.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/hweight.c')
0 files changed, 0 insertions, 0 deletions