btrfs_free_space
struct btrfs_free_space *e;
e = rb_entry(node, struct btrfs_free_space, offset_index);
struct btrfs_free_space *entry, *next;
struct btrfs_free_space *entry, *next;
struct btrfs_free_space *new_entry)
struct btrfs_free_space *info;
info = rb_entry(parent, struct btrfs_free_space, offset_index);
static inline u64 get_max_extent_size(const struct btrfs_free_space *entry)
const struct btrfs_free_space *entry, *exist;
entry = rb_entry(node, struct btrfs_free_space, bytes_index);
exist = rb_entry(parent, struct btrfs_free_space, bytes_index);
static struct btrfs_free_space *
struct btrfs_free_space *entry = NULL, *prev = NULL;
entry = rb_entry(n, struct btrfs_free_space, offset_index);
entry = rb_entry(n, struct btrfs_free_space, offset_index);
prev = rb_entry(n, struct btrfs_free_space,
entry = rb_entry(n, struct btrfs_free_space,
prev = rb_entry(n, struct btrfs_free_space,
entry = rb_entry(n, struct btrfs_free_space, offset_index);
struct btrfs_free_space *info,
struct btrfs_free_space *info)
struct btrfs_free_space *info)
struct btrfs_free_space *info,
struct btrfs_free_space *info, u64 offset,
struct btrfs_free_space *bitmap_info, u64 *offset,
static struct btrfs_free_space *
struct btrfs_free_space *entry;
entry = rb_entry(node, struct btrfs_free_space,
entry = rb_entry(node, struct btrfs_free_space,
struct btrfs_free_space *info, u64 offset)
struct btrfs_free_space *bitmap_info)
struct btrfs_free_space *bitmap_info,
bitmap_info = rb_entry(next, struct btrfs_free_space,
struct btrfs_free_space *info, u64 offset,
struct btrfs_free_space *info)
struct btrfs_free_space *info)
struct btrfs_free_space *bitmap_info;
struct btrfs_free_space *entry;
entry = rb_entry(node, struct btrfs_free_space, offset_index);
struct btrfs_free_space *info, bool update_stat)
struct btrfs_free_space *left_info = NULL;
struct btrfs_free_space *right_info;
left_info = rb_entry(right_prev, struct btrfs_free_space, offset_index);
struct btrfs_free_space *info,
struct btrfs_free_space *bitmap;
struct btrfs_free_space *info,
struct btrfs_free_space *bitmap;
struct btrfs_free_space *info,
struct btrfs_free_space *info;
struct btrfs_free_space *info;
struct btrfs_free_space *info;
info = rb_entry(n, struct btrfs_free_space, offset_index);
ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space);
struct btrfs_free_space *entry;
entry = rb_entry(node, struct btrfs_free_space, offset_index);
struct btrfs_free_space *info;
info = rb_entry(node, struct btrfs_free_space, offset_index);
struct btrfs_free_space *entry = NULL;
struct btrfs_free_space *entry,
struct btrfs_free_space *entry = NULL;
entry = rb_entry(node, struct btrfs_free_space, offset_index);
entry = rb_entry(node, struct btrfs_free_space,
entry = rb_entry(node, struct btrfs_free_space,
struct btrfs_free_space *entry,
struct btrfs_free_space *first = NULL;
struct btrfs_free_space *entry = NULL;
struct btrfs_free_space *last;
entry = rb_entry(node, struct btrfs_free_space, offset_index);
entry = rb_entry(node, struct btrfs_free_space, offset_index);
entry = rb_entry(node, struct btrfs_free_space, offset_index);
struct btrfs_free_space *entry = NULL;
entry = list_first_entry(bitmaps, struct btrfs_free_space, list);
struct btrfs_free_space *entry, *tmp;
struct btrfs_free_space *entry;
entry = rb_entry(node, struct btrfs_free_space,
struct btrfs_free_space *entry;
struct btrfs_free_space *entry)
struct btrfs_free_space *entry;
btrfs_free_space_cachep = KMEM_CACHE(btrfs_free_space, 0);
struct btrfs_free_space *info = NULL, *bitmap_info;
struct btrfs_free_space *info;
struct btrfs_free_space *tmp;
tmp = rb_entry(n, struct btrfs_free_space,
tmp = rb_entry(n, struct btrfs_free_space,
struct btrfs_free_space *info);
struct btrfs_free_space *info, bool update_stat);
struct btrfs_free_space *bitmap_info, u64 *offset,
struct btrfs_free_space *bitmap_info);
struct btrfs_free_space *info, u64 offset,
struct btrfs_free_space *entry, u8 *type)
struct btrfs_free_space *info;
struct btrfs_free_space *entry)
info = rb_entry(node, struct btrfs_free_space, offset_index);
div_u64(extent_bytes, sizeof(struct btrfs_free_space));
struct btrfs_free_space *e, *n;
struct btrfs_free_space *info;
info = rb_entry(n, struct btrfs_free_space, offset_index);
static inline bool btrfs_free_space_trimmed(struct btrfs_free_space *info)
struct btrfs_free_space *info)
struct btrfs_free_space *info);
struct btrfs_free_space *info)
struct btrfs_free_space *info)
struct btrfs_free_space *entry;
entry = rb_entry(node, struct btrfs_free_space, bytes_index);
entry = rb_entry(node, struct btrfs_free_space, bytes_index);
struct btrfs_free_space, bytes_index);
struct btrfs_free_space, bytes_index);
struct btrfs_free_space, bytes_index);