original_kernel/tools/testing/radix-tree
Matthew Wilcox 8c1244de00 radix-tree: tidy up next_chunk
Convert radix_tree_next_chunk to use 'child' instead of 'slot' as the
name of the child node.  Also use node_maxindex() where it makes sense.

The 'rnode' variable was unnecessary; it doesn't overlap in usage with
'node', so we can just use 'node' the whole way through the function.

Improve the testcase to start the walk from every index in the carefully
constructed tree, and to accept any index within the range covered by
the entry.

Signed-off-by: Matthew Wilcox <willy@linux.intel.com>
Cc: Konstantin Khlebnikov <koct9i@gmail.com>
Cc: Kirill Shutemov <kirill.shutemov@linux.intel.com>
Cc: Jan Kara <jack@suse.com>
Cc: Neil Brown <neilb@suse.de>
Cc: Ross Zwisler <ross.zwisler@linux.intel.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-05-20 17:58:30 -07:00
..
generated radix-tree: add support for multi-order iterating 2016-05-20 17:58:30 -07:00
linux radix-tree: add test for radix_tree_locate_item() 2016-05-20 17:58:30 -07:00
.gitignore
Makefile
find_next_bit.c
linux.c
main.c radix-tree: add test for radix_tree_locate_item() 2016-05-20 17:58:30 -07:00
multiorder.c radix-tree: tidy up next_chunk 2016-05-20 17:58:30 -07:00
rcupdate.c
regression.h
regression1.c
regression2.c
regression3.c
tag_check.c radix-tree: fix radix_tree_range_tag_if_tagged() for multiorder entries 2016-05-20 17:58:30 -07:00
test.c radix-tree: rename radix_tree_is_indirect_ptr() 2016-05-20 17:58:30 -07:00
test.h radix-tree: rename indirect_to_ptr() to entry_to_node() 2016-05-20 17:58:30 -07:00