1527 		       struct extent_buffer *b, int level, int ins_len)  in setup_nodes_for_search()  argument
1530 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=  in setup_nodes_for_search()
1548 	} else if (ins_len < 0 && btrfs_header_nritems(b) <  in setup_nodes_for_search()
1594 		      ins_len, int cow)  in btrfs_search_slot()  argument
1605 	WARN_ON(lowest_level && ins_len > 0);  in btrfs_search_slot()
1608 	if (ins_len < 0)  in btrfs_search_slot()
1655 		BUG_ON(!cow && ins_len);  in btrfs_search_slot()
1690 						     ins_len);  in btrfs_search_slot()
1729 			if (ins_len > 0 &&  in btrfs_search_slot()
1730 			    btrfs_leaf_free_space(root, b) < ins_len) {  in btrfs_search_slot()
1733 						 p, ins_len, ret == 0);  in btrfs_search_slot()
3005 					 struct btrfs_path *path, int ins_len)  in setup_leaf_for_split()  argument
3020 	if (btrfs_leaf_free_space(root, leaf) >= ins_len)  in setup_leaf_for_split()
3045 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len)  in setup_leaf_for_split()
3056 	ret = split_leaf(trans, root, &key, path, ins_len, 1);  in setup_leaf_for_split()