diff options
| author | Fengguang Wu <wfg@mail.ustc.edu.cn> | 2007-10-16 01:24:33 -0700 |
|---|---|---|
| committer | Linus Torvalds <torvalds@woody.linux-foundation.org> | 2007-10-16 09:42:52 -0700 |
| commit | 6df8ba4f8a4c4abca9ccad10441d0dddbdff301c (patch) | |
| tree | 6ac5cd48d3400a9d32f8affd31106f7942df9547 /include/linux/radix-tree.h | |
| parent | f4e6b498d6e06742d72706ef50593a9c4dd72214 (diff) | |
| download | linux-6df8ba4f8a4c4abca9ccad10441d0dddbdff301c.tar.gz linux-6df8ba4f8a4c4abca9ccad10441d0dddbdff301c.tar.bz2 linux-6df8ba4f8a4c4abca9ccad10441d0dddbdff301c.zip | |
radixtree: introduce radix_tree_next_hole()
Introduce radix_tree_next_hole(root, index, max_scan) to scan radix tree for
the first hole. It will be used in interleaved readahead.
The implementation is dumb and obviously correct. It can help debug(and
document) the possible smart one in future.
Cc: Nick Piggin <nickpiggin@yahoo.com.au>
Signed-off-by: Fengguang Wu <wfg@mail.ustc.edu.cn>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'include/linux/radix-tree.h')
| -rw-r--r-- | include/linux/radix-tree.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/include/linux/radix-tree.h b/include/linux/radix-tree.h index f9e77d2ee320..430e4a8c1382 100644 --- a/include/linux/radix-tree.h +++ b/include/linux/radix-tree.h @@ -155,6 +155,8 @@ void *radix_tree_delete(struct radix_tree_root *, unsigned long); unsigned int radix_tree_gang_lookup(struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items); +unsigned long radix_tree_next_hole(struct radix_tree_root *root, + unsigned long index, unsigned long max_scan); int radix_tree_preload(gfp_t gfp_mask); void radix_tree_init(void); void *radix_tree_tag_set(struct radix_tree_root *root, |