2492 		       struct extent_buffer *b, int level, int ins_len,  in setup_nodes_for_search()  argument
2498 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=  in setup_nodes_for_search()
2518 	} else if (ins_len < 0 && btrfs_header_nritems(b) <  in setup_nodes_for_search()
2709 		      int ins_len, int cow)  in btrfs_search_slot()  argument
2724 	WARN_ON(lowest_level && ins_len > 0);  in btrfs_search_slot()
2726 	BUG_ON(!cow && ins_len);  in btrfs_search_slot()
2728 	if (ins_len < 0) {  in btrfs_search_slot()
2736 	} else if (ins_len > 0) {  in btrfs_search_slot()
2824 		if (!ins_len && !p->keep_locks) {  in btrfs_search_slot()
2853 			if (ins_len > 0 &&  in btrfs_search_slot()
2854 			    btrfs_leaf_free_space(b) < ins_len) {  in btrfs_search_slot()
2863 						 p, ins_len, ret == 0);  in btrfs_search_slot()
2881 		err = setup_nodes_for_search(trans, root, p, b, level, ins_len,  in btrfs_search_slot()
2897 		if (slot == 0 && ins_len && write_lock_level < level + 1) {  in btrfs_search_slot()
4435 					 struct btrfs_path *path, int ins_len)  in setup_leaf_for_split()  argument
4450 	if (btrfs_leaf_free_space(leaf) >= ins_len)  in setup_leaf_for_split()
4477 	if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)  in setup_leaf_for_split()
4488 	ret = split_leaf(trans, root, &key, path, ins_len, 1);  in setup_leaf_for_split()