2523 		       struct extent_buffer *b, int level, int ins_len,  in setup_nodes_for_search()  argument
2527 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=  in setup_nodes_for_search()
2548 	} else if (ins_len < 0 && btrfs_header_nritems(b) <  in setup_nodes_for_search()
2666 		      ins_len, int cow)  in btrfs_search_slot()  argument
2682 	WARN_ON(lowest_level && ins_len > 0);  in btrfs_search_slot()
2684 	BUG_ON(!cow && ins_len);  in btrfs_search_slot()
2686 	if (ins_len < 0) {  in btrfs_search_slot()
2694 	} else if (ins_len > 0) {  in btrfs_search_slot()
2810 		if (!ins_len && !p->keep_locks) {  in btrfs_search_slot()
2829 					     ins_len, &write_lock_level);  in btrfs_search_slot()
2845 			if (slot == 0 && ins_len &&  in btrfs_search_slot()
2895 			if (ins_len > 0 &&  in btrfs_search_slot()
2896 			    btrfs_leaf_free_space(root, b) < ins_len) {  in btrfs_search_slot()
2905 						 p, ins_len, ret == 0);  in btrfs_search_slot()
4328 					 struct btrfs_path *path, int ins_len)  in setup_leaf_for_split()  argument
4343 	if (btrfs_leaf_free_space(root, leaf) >= ins_len)  in setup_leaf_for_split()
4370 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len)  in setup_leaf_for_split()
4381 	ret = split_leaf(trans, root, &key, path, ins_len, 1);  in setup_leaf_for_split()