btrfs_leaf_free_space
leaf_free_space = btrfs_leaf_free_space(leaf);
int space = btrfs_leaf_free_space(left);
free_space = btrfs_leaf_free_space(right);
int space = btrfs_leaf_free_space(right);
free_space = btrfs_leaf_free_space(left);
space_needed -= btrfs_leaf_free_space(path->nodes[0]);
if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
space_needed -= btrfs_leaf_free_space(path->nodes[0]);
space_needed -= btrfs_leaf_free_space(l);
space_needed -= btrfs_leaf_free_space(l);
if (btrfs_leaf_free_space(l) >= data_size)
if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
if (btrfs_leaf_free_space(leaf) >= ins_len)
if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
if (WARN_ON(btrfs_leaf_free_space(leaf) < sizeof(struct btrfs_item)))
BUG_ON(btrfs_leaf_free_space(leaf) < 0);
if (unlikely(btrfs_leaf_free_space(leaf) < 0)) {
if (unlikely(btrfs_leaf_free_space(leaf) < data_size)) {
if (unlikely(btrfs_leaf_free_space(leaf) < 0)) {
if (unlikely(btrfs_leaf_free_space(leaf) < total_size)) {
total_size, btrfs_leaf_free_space(leaf));
if (unlikely(btrfs_leaf_free_space(leaf) < 0)) {
int btrfs_leaf_free_space(const struct extent_buffer *leaf);
if (btrfs_leaf_free_space(leaf) >= csum_size) {
diff = min_t(u32, btrfs_leaf_free_space(leaf), diff);
btrfs_leaf_free_space(leaf) >=
btrfs_leaf_free_space(l), btrfs_header_owner(l));
if (btrfs_leaf_free_space(leaf) <