path: root/tools/testing/radix-tree/multiorder.c
diff options
authorRoss Zwisler <>2016-05-20 17:02:26 -0700
committerLinus Torvalds <>2016-05-20 17:58:30 -0700
commit21ef533931f73a8e963a6107aa5ec51b192f28be (patch)
treebc5066db87ca565cbc35e3535e88b1e5ec1beb41 /tools/testing/radix-tree/multiorder.c
parent7b60e9ad59a31dd98c2f7ef841e2882c2b0e0f3b (diff)
radix-tree: add support for multi-order iterating
This enables the macros radix_tree_for_each_slot() and friends to be used with multi-order entries. The way that this works is that we treat all entries in a given slots[] array as a single chunk. If the index given to radix_tree_next_chunk() happens to point us to a sibling entry, we will back up iter->index so that it points to the canonical entry, and that will be the place where we start our iteration. As we're processing a chunk in radix_tree_next_slot(), we process canonical entries, skip over sibling entries, and restart the chunk lookup if we find a non-sibling indirect pointer. This drops back to the radix_tree_next_chunk() code, which will re-walk the tree and look for another chunk. This allows us to properly handle multi-order entries mixed with other entries that are at various heights in the radix tree. Signed-off-by: Ross Zwisler <> Signed-off-by: Matthew Wilcox <> Cc: Konstantin Khlebnikov <> Cc: Kirill Shutemov <> Cc: Jan Kara <> Cc: Neil Brown <> Signed-off-by: Andrew Morton <> Signed-off-by: Linus Torvalds <>
Diffstat (limited to 'tools/testing/radix-tree/multiorder.c')
0 files changed, 0 insertions, 0 deletions