diff options
| author | Arne Jansen <sensille@gmx.net> | 2011-09-13 09:18:10 (GMT) |
|---|---|---|
| committer | Jan Schmidt <list.btrfs@jan-o-sch.net> | 2012-07-10 13:14:42 (GMT) |
| commit | 2f38b3e1900634e64a186873b3388b1bf85dabc0 (patch) | |
| tree | 21017a51174be9ba31696e4e4c8daa18ce2d59f8 /fs/btrfs/ctree.h | |
| parent | 630dc772ea51bca3ec6fac609f450cbe0cafd1d6 (diff) | |
| download | linux-fsl-qoriq-2f38b3e1900634e64a186873b3388b1bf85dabc0.tar.xz | |
Btrfs: add helper for tree enumeration
Often no exact match is wanted but just the next lower or
higher item. There's a lot of duplicated code throughout
btrfs to deal with the corner cases. This patch adds a
helper function that can facilitate searching.
Signed-off-by: Arne Jansen <sensille@gmx.net>
Diffstat (limited to 'fs/btrfs/ctree.h')
| -rw-r--r-- | fs/btrfs/ctree.h | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/fs/btrfs/ctree.h b/fs/btrfs/ctree.h index 33088b0..27cf995 100644 --- a/fs/btrfs/ctree.h +++ b/fs/btrfs/ctree.h @@ -2856,6 +2856,9 @@ int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root ins_len, int cow); int btrfs_search_old_slot(struct btrfs_root *root, struct btrfs_key *key, struct btrfs_path *p, u64 time_seq); +int btrfs_search_slot_for_read(struct btrfs_root *root, + struct btrfs_key *key, struct btrfs_path *p, + int find_higher, int return_any); int btrfs_realloc_node(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *parent, int start_slot, int cache_only, u64 *last_ret, |