dm_btree_info
struct dm_btree_info writeset_tree_info;
struct dm_btree_info *info;
struct dm_btree_info info;
struct dm_btree_info nb_info;
struct dm_btree_info tl_info;
struct dm_btree_info bl_info;
struct dm_btree_info details_info;
struct dm_btree_info *info = context;
struct dm_btree_info *info = context;
struct dm_btree_info btree_info;
int btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root,
int bn_read_lock(struct dm_btree_info *info, dm_block_t b,
int new_block(struct dm_btree_info *info, struct dm_block **result);
void unlock_block(struct dm_btree_info *info, struct dm_block *b);
struct dm_btree_info *info;
void init_ro_spine(struct ro_spine *s, struct dm_btree_info *info);
struct dm_btree_info *info;
void init_shadow_spine(struct shadow_spine *s, struct dm_btree_info *info);
static int init_child(struct dm_btree_info *info, struct dm_btree_value_type *vt,
static void exit_child(struct dm_btree_info *info, struct child *c)
static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent,
static int rebalance2(struct shadow_spine *s, struct dm_btree_info *info,
static int delete_center_node(struct dm_btree_info *info, struct btree_node *parent,
static int redistribute3(struct dm_btree_info *info, struct btree_node *parent,
static int __rebalance3(struct dm_btree_info *info, struct btree_node *parent,
static int rebalance3(struct shadow_spine *s, struct dm_btree_info *info,
struct dm_btree_info *info,
static int remove_raw(struct shadow_spine *s, struct dm_btree_info *info,
int dm_btree_remove(struct dm_btree_info *info, dm_block_t root,
static int remove_nearest(struct shadow_spine *s, struct dm_btree_info *info,
static int remove_one(struct dm_btree_info *info, dm_block_t root,
int dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root,
int new_block(struct dm_btree_info *info, struct dm_block **result)
void unlock_block(struct dm_btree_info *info, struct dm_block *b)
void init_ro_spine(struct ro_spine *s, struct dm_btree_info *info)
void init_shadow_spine(struct shadow_spine *s, struct dm_btree_info *info)
int bn_read_lock(struct dm_btree_info *info, dm_block_t b,
static int bn_shadow(struct dm_btree_info *info, dm_block_t orig,
int btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root,
static int insert(struct dm_btree_info *info, dm_block_t root,
int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root)
int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,
int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,
static int dm_btree_find_key(struct dm_btree_info *info, dm_block_t root,
int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,
int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,
static int walk_node(struct dm_btree_info *info, dm_block_t block,
int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,
int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root,
struct dm_btree_info *info;
static bool is_internal_level(struct dm_btree_info *info, struct frame *f)
int dm_btree_del(struct dm_btree_info *info, dm_block_t root)
int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,
static int dm_btree_lookup_next_single(struct dm_btree_info *info, dm_block_t root,
int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,
static int shadow_child(struct dm_btree_info *info, struct dm_btree_value_type *vt,
static int get_node_free_space(struct dm_btree_info *info, dm_block_t b, unsigned int *space)
int dm_btree_del(struct dm_btree_info *info, dm_block_t root);
int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root,
int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root,
int dm_btree_insert(struct dm_btree_info *info, dm_block_t root,
int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root,
int dm_btree_remove(struct dm_btree_info *info, dm_block_t root,
int dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root,
int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root,
int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root,
int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,
struct dm_btree_info *info;
int dm_btree_cursor_begin(struct dm_btree_info *info, dm_block_t root,
int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root);
struct dm_btree_info bitmap_info;
struct dm_btree_info ref_count_info;