Lines Matching refs:ins_len
1652 struct extent_buffer *b, int level, int ins_len, in setup_nodes_for_search() argument
1658 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= in setup_nodes_for_search()
1671 } else if (ins_len < 0 && btrfs_header_nritems(b) < in setup_nodes_for_search()
1874 int ins_len, in search_leaf() argument
1890 if (ins_len > 0) { in search_leaf()
1901 if (path->locks[1] && leaf_free_space >= ins_len) { in search_leaf()
1965 if (ins_len > 0) { in search_leaf()
1976 ASSERT(ins_len >= sizeof(struct btrfs_item)); in search_leaf()
1977 ins_len -= sizeof(struct btrfs_item); in search_leaf()
1982 if (leaf_free_space < ins_len) { in search_leaf()
1985 err = split_leaf(trans, root, key, path, ins_len, in search_leaf()
2031 int ins_len, int cow) in btrfs_search_slot() argument
2049 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2051 BUG_ON(!cow && ins_len); in btrfs_search_slot()
2060 if (ins_len < 0) { in btrfs_search_slot()
2068 } else if (ins_len > 0) { in btrfs_search_slot()
2159 if (!ins_len && !p->keep_locks) { in btrfs_search_slot()
2169 if (ins_len > 0) in btrfs_search_slot()
2172 ret = search_leaf(trans, root, key, p, ins_len, prev_cmp); in btrfs_search_slot()
2189 err = setup_nodes_for_search(trans, root, p, b, level, ins_len, in btrfs_search_slot()
2205 if (slot == 0 && ins_len && write_lock_level < level + 1) { in btrfs_search_slot()
3757 struct btrfs_path *path, int ins_len) in setup_leaf_for_split() argument
3772 if (btrfs_leaf_free_space(leaf) >= ins_len) in setup_leaf_for_split()
3799 if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len) in setup_leaf_for_split()
3809 ret = split_leaf(trans, root, &key, path, ins_len, 1); in setup_leaf_for_split()