btree_node
static inline __le64 *key_ptr(struct btree_node *n, uint32_t index)
static inline void *value_base(struct btree_node *n)
static inline void *value_ptr(struct btree_node *n, uint32_t index)
static inline uint64_t value64(struct btree_node *n, uint32_t index)
int lower_bound(struct btree_node *n, uint64_t key);
void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
struct btree_node *ro_node(struct ro_spine *s);
static void delete_at(struct btree_node *n, unsigned int index)
static unsigned int merge_threshold(struct btree_node *n)
struct btree_node *n;
struct btree_node *parent,
static int shift(struct btree_node *left, struct btree_node *right, int count)
static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent,
struct btree_node *left = l->n;
struct btree_node *right = r->n;
struct btree_node *parent;
static int delete_center_node(struct dm_btree_info *info, struct btree_node *parent,
struct btree_node *left, struct btree_node *center, struct btree_node *right,
static int redistribute3(struct dm_btree_info *info, struct btree_node *parent,
struct btree_node *left, struct btree_node *center, struct btree_node *right,
static int __rebalance3(struct dm_btree_info *info, struct btree_node *parent,
struct btree_node *left = l->n;
struct btree_node *center = c->n;
struct btree_node *right = r->n;
struct btree_node *parent = dm_block_data(shadow_current(s));
struct btree_node *n;
static int do_leaf(struct btree_node *n, uint64_t key, unsigned int *index)
struct btree_node *n;
static void node_shift(struct btree_node *n, int shift)
struct btree_node *n;
struct btree_node *n;
struct btree_node *n;
static int node_copy(struct btree_node *left, struct btree_node *right, int shift)
struct btree_node *ro_node(struct ro_spine *s)
struct btree_node *n = dm_block_data(b);
struct btree_node *n = dm_block_data(b);
struct btree_node *parent = dm_block_data(shadow_parent(s));
static bool contains_key(struct btree_node *node, uint64_t key)
static bool has_space_for_insert(struct btree_node *node, uint64_t key)
struct btree_node *node;
struct btree_node *node;
static bool need_insert(struct btree_node *node, uint64_t *keys,
struct btree_node *n;
struct btree_node *n;
struct btree_node *n;
struct btree_node *bn = dm_block_data(n->b);
struct btree_node *bn = dm_block_data(n->b);
struct btree_node *bn;
struct btree_node *bn;
struct btree_node *bn = dm_block_data(n->b);
struct btree_node *n;
int (*search_fn)(struct btree_node *, uint64_t),
struct btree_node *n;
static int bsearch(struct btree_node *n, uint64_t key, int want_hi)
static void copy_entries(struct btree_node *dest, unsigned int dest_offset,
struct btree_node *src, unsigned int src_offset,
static void move_entries(struct btree_node *dest, unsigned int dest_offset,
struct btree_node *src, unsigned int src_offset,
static void shift_down(struct btree_node *n, unsigned int count)
static void shift_up(struct btree_node *n, unsigned int count)
static void redistribute2(struct btree_node *left, struct btree_node *right)
static void redistribute3(struct btree_node *left, struct btree_node *center,
struct btree_node *right)
int lower_bound(struct btree_node *n, uint64_t key)
struct btree_node *ln, *rn, *pn;
static int upper_bound(struct btree_node *n, uint64_t key)
struct btree_node *parent, unsigned int index,
struct btree_node *node;
void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
struct btree_node *ln, *rn, *mn, *pn;
struct btree_node *pn, *ln, *rn;
static int insert_at(size_t value_size, struct btree_node *node, unsigned int index,
struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
struct btree_node *node;
static bool contains_key(struct btree_node *n, uint64_t key, int index)
struct btree_node *n;
struct btree_node *n;
struct btree_node *n;
struct btree_node *n;
DEFINE_EVENT(btree_node, bcache_btree_read,
DEFINE_EVENT(btree_node, bcache_btree_node_alloc,
DEFINE_EVENT(btree_node, bcache_btree_node_free,
__field(u64, btree_node )
__entry->btree_node = PTR_BUCKET_NR(b->c, &b->key, 0);
__entry->btree_node, __entry->btree_level,
DEFINE_EVENT(btree_node, bcache_btree_set_root,
DECLARE_EVENT_CLASS(btree_node,