fs/btrfs/ctree.c

1611  * the ins_len.
1620 		       struct extent_buffer *b, int level, int ins_len,
1626 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=
1639 	} else if (ins_len < 0 && btrfs_header_nritems(b) <
1842 		       int ins_len,
1858 	if (ins_len > 0) {
1869 		if (path->locks[1] && leaf_free_space >= ins_len) {
1933 	if (ins_len > 0) {
1939 		 * added. If search_for_extension is not set, ins_len already
1944 			ASSERT(ins_len >= sizeof(struct btrfs_item));
1945 			ins_len -= sizeof(struct btrfs_item);
1950 		if (leaf_free_space < ins_len) {
1953 			err = split_leaf(trans, root, key, path, ins_len,
1974  * @ins_len:	Indicates purpose of search:
1985  * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
1986  * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
1999 		      int ins_len, int cow)
2017 	WARN_ON(lowest_level && ins_len > 0);
2019 	BUG_ON(!cow && ins_len);
2028 	if (ins_len < 0) {
2036 	} else if (ins_len > 0) {
2122 		 * If we're inserting or deleting (ins_len != 0), then we might
2127 		if (!ins_len && !p->keep_locks) {
2137 			if (ins_len > 0)
2140 			ret = search_leaf(trans, root, key, p, ins_len, prev_cmp);
2157 		err = setup_nodes_for_search(trans, root, p, b, level, ins_len,
2173 		if (slot == 0 && ins_len && write_lock_level < level + 1) {
2246  * btrfs_search_slot at that point in time with ins_len and cow both set to 0.
3805 		 * We create a new leaf 'right' for the required ins_len and
3807 		 * the content of ins_len to 'right'.
3837 					 struct btrfs_path *path, int ins_len)
3852 	if (btrfs_leaf_free_space(leaf) >= ins_len)
3879 	if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
3889 	ret = split_leaf(trans, root, &key, path, ins_len, 1);