Commit 809d6902 authored by David Sterba's avatar David Sterba
Browse files

btrfs: make btrfs_next_leaf static inline 



btrfs_next_leaf is a simple wrapper for btrfs_next_old_leaf so move it
to header to avoid the function call overhead.

Reviewed-by: default avatarQu Wenruo <wqu@suse.com>
Signed-off-by: default avatarDavid Sterba <dsterba@suse.com>
parent f41b6ba9

fs/btrfs/ctree.c

+0 −10
Original line number Diff line number Diff line
@@ -4357,16 +4357,6 @@ int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, 
	return 1;

}



/*

 * search the tree again to find a leaf with greater keys

 * returns 0 if it found something or 1 if there are no greater leaves.

 * returns < 0 on io errors.

 */

int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)

{

	return btrfs_next_old_leaf(root, path, 0);

}



int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,

			u64 time_seq)

{

fs/btrfs/ctree.h

+12 −1
Original line number Diff line number Diff line
@@ -2899,7 +2899,6 @@ static inline int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, 
	return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1);

}



int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path);

int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path);

int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,

			u64 time_seq);
@@ -2911,6 +2910,18 @@ static inline int btrfs_next_old_item(struct btrfs_root *root, 
		return btrfs_next_old_leaf(root, p, time_seq);

	return 0;

}



/*

 * Search the tree again to find a leaf with greater keys.

 *

 * Returns 0 if it found something or 1 if there are no greater leaves.

 * Returns < 0 on error.

 */

static inline int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)

{

	return btrfs_next_old_leaf(root, path, 0);

}



static inline int btrfs_next_item(struct btrfs_root *root, struct btrfs_path *p)

{

	return btrfs_next_old_item(root, p, 0);