1600 		       struct extent_buffer *b, int level, int ins_len,  in setup_nodes_for_search()  argument
1606 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=  in setup_nodes_for_search()
1619 	} else if (ins_len < 0 && btrfs_header_nritems(b) <  in setup_nodes_for_search()
1822 		       int ins_len,  in search_leaf()  argument
1838 	if (ins_len > 0) {  in search_leaf()
1849 		if (path->locks[1] && leaf_free_space >= ins_len) {  in search_leaf()
1913 	if (ins_len > 0) {  in search_leaf()
1924 			ASSERT(ins_len >= sizeof(struct btrfs_item));  in search_leaf()
1925 			ins_len -= sizeof(struct btrfs_item);  in search_leaf()
1930 		if (leaf_free_space < ins_len) {  in search_leaf()
1933 			err = split_leaf(trans, root, key, path, ins_len,  in search_leaf()
1979 		      int ins_len, int cow)  in btrfs_search_slot()  argument
2001 	WARN_ON(lowest_level && ins_len > 0);  in btrfs_search_slot()
2003 	BUG_ON(!cow && ins_len);  in btrfs_search_slot()
2012 	if (ins_len < 0) {  in btrfs_search_slot()
2020 	} else if (ins_len > 0) {  in btrfs_search_slot()
2111 		if (!ins_len && !p->keep_locks) {  in btrfs_search_slot()
2121 			if (ins_len > 0)  in btrfs_search_slot()
2124 			ret = search_leaf(trans, root, key, p, ins_len, prev_cmp);  in btrfs_search_slot()
2141 		err = setup_nodes_for_search(trans, root, p, b, level, ins_len,  in btrfs_search_slot()
2157 		if (slot == 0 && ins_len && write_lock_level < level + 1) {  in btrfs_search_slot()
3825 					 struct btrfs_path *path, int ins_len)  in setup_leaf_for_split()  argument
3841 	if (btrfs_leaf_free_space(leaf) >= ins_len)  in setup_leaf_for_split()
3868 	if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)  in setup_leaf_for_split()
3878 	ret = split_leaf(trans, root, &key, path, ins_len, 1);  in setup_leaf_for_split()