diff options
| author | Arne Jansen <sensille@gmx.net> | 2011-09-13 13:18:10 +0400 |
|---|---|---|
| committer | Alexander Block <ablock84@googlemail.com> | 2012-07-25 19:33:18 +0400 |
| commit | e679376911d016b670c8cfc1645c178f77e8d1d3 (patch) | |
| tree | 0ecc36238400c974a6c94eee6cda7288d494f515 /fs/btrfs/ctree.h | |
| parent | 362a20c5e27614739c46707d1c5f55c214d164ce (diff) | |
| download | linux-e679376911d016b670c8cfc1645c178f77e8d1d3.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 fa5c45b39075..8cfde9326dd6 100644 --- a/fs/btrfs/ctree.h +++ b/fs/btrfs/ctree.h @@ -2711,6 +2711,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, |