Lines Matching refs:ins_len
2483 * the ins_len.
2492 struct extent_buffer *b, int level, int ins_len,
2498 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=
2518 } else if (ins_len < 0 && btrfs_header_nritems(b) <
2690 * @ins_len: Indicates purpose of search, for inserts it is 1, for
2695 * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
2696 * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
2709 int ins_len, int cow)
2724 WARN_ON(lowest_level && ins_len > 0);
2726 BUG_ON(!cow && ins_len);
2728 if (ins_len < 0) {
2736 } else if (ins_len > 0) {
2819 * If we're inserting or deleting (ins_len != 0), then we might
2824 if (!ins_len && !p->keep_locks) {
2853 if (ins_len > 0 &&
2854 btrfs_leaf_free_space(b) < ins_len) {
2863 p, ins_len, ret == 0);
2881 err = setup_nodes_for_search(trans, root, p, b, level, ins_len,
2897 if (slot == 0 && ins_len && write_lock_level < level + 1) {
2961 * btrfs_search_slot at that point in time with ins_len and cow both set to 0.
4412 * We create a new leaf 'right' for the required ins_len and
4414 * the content of ins_len to 'right'.
4439 struct btrfs_path *path, int ins_len)
4454 if (btrfs_leaf_free_space(leaf) >= ins_len)
4481 if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
4492 ret = split_leaf(trans, root, &key, path, ins_len, 1);