56 static void node_shift(struct btree_node *n, int shift)  in node_shift()
82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift)  in node_copy()
111 static void delete_at(struct btree_node *n, unsigned index)  in delete_at()
131 static unsigned merge_threshold(struct btree_node *n)  in merge_threshold()
139 	struct btree_node *n;
143 		      struct btree_node *parent,  in init_child()
173 static void shift(struct btree_node *left, struct btree_node *right, int count)  in shift()
199 static void __rebalance2(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance2()
202 	struct btree_node *left = l->n;  in __rebalance2()
203 	struct btree_node *right = r->n;  in __rebalance2()
241 	struct btree_node *parent;  in rebalance2()
269 static void delete_center_node(struct dm_btree_info *info, struct btree_node *parent,  in delete_center_node()
271 			       struct btree_node *left, struct btree_node *center, struct btree_node *right,  in delete_center_node()
300 static void redistribute3(struct dm_btree_info *info, struct btree_node *parent,  in redistribute3()
302 			  struct btree_node *left, struct btree_node *center, struct btree_node *right,  in redistribute3()
347 static void __rebalance3(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance3()
350 	struct btree_node *left = l->n;  in __rebalance3()
351 	struct btree_node *center = c->n;  in __rebalance3()
352 	struct btree_node *right = r->n;  in __rebalance3()
375 	struct btree_node *parent = dm_block_data(shadow_current(s));  in rebalance3()
412 	struct btree_node *n;  in rebalance_children()
451 static int do_leaf(struct btree_node *n, uint64_t key, unsigned *index)  in do_leaf()
474 	struct btree_node *n;  in remove_raw()
524 	struct btree_node *n;  in dm_btree_remove()
567 	struct btree_node *n;  in remove_nearest()
622 	struct btree_node *n;  in remove_one()