GitHub-Mirror/Star64_linux
2
0
Fork 0
mirror of https://github.com/Fishwaldo/Star64_linux.git synced 2025-04-02 12:34:06 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

btrfs: Improve btrfs_search_slot description

Browse source 
Signed-off-by: Nikolay Borisov <nborisov@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Nikolay Borisov 2017-12-13 09:38:14 +02:00 • committed by David Sterba
parent 36243c9199
commit 4271ecea64
1 changed files with 21 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
fs/btrfs/ctree.c
View file

@ -2654,17 +2654,29 @@ int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *path,
} }
/* /*
* look for key in the tree. path is filled in with nodes along the way * btrfs_search_slot - look for a key in a tree and perform necessary
* if key is found, we return zero and you can find the item in the leaf * modifications to preserve tree invariants.
* level of the path (level 0)
* *
* If the key isn't found, the path points to the slot where it should * @trans: Handle of transaction, used when modifying the tree
* be inserted, and 1 is returned. If there are other errors during the * @p: Holds all btree nodes along the search path
* search a negative error number is returned. * @root: The root node of the tree
* @key: The key we are looking for
* @ins_len: Indicates purpose of search, for inserts it is 1, for
* deletions it's -1. 0 for plain searches
* @cow: boolean should CoW operations be performed. Must always be 1
* when modifying the tree.
* *
* if ins_len > 0, nodes and leaves will be split as we walk down the * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
* tree. if ins_len < 0, nodes will be merged as we walk down the tree (if * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
* possible) *
* If @key is found, 0 is returned and you can find the item in the leaf level
* of the path (level 0)
*
* If @key isn't found, 1 is returned and the leaf level of the path (level 0)
* points to the slot where it should be inserted
*
* If an error is encountered while searching the tree a negative error number
* is returned
*/ */
int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root,
const struct btrfs_key *key, struct btrfs_path *p, const struct btrfs_key *key, struct btrfs_path *p,