59 static void node_shift(struct btree_node *n, int shift)  in node_shift()
85 static int node_copy(struct btree_node *left, struct btree_node *right, int shift)  in node_copy()
127 static void delete_at(struct btree_node *n, unsigned index)  in delete_at()
147 static unsigned merge_threshold(struct btree_node *n)  in merge_threshold()
155 	struct btree_node *n;
159 		      struct btree_node *parent,  in init_child()
189 static int shift(struct btree_node *left, struct btree_node *right, int count)  in shift()
233 static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance2()
237 	struct btree_node *left = l->n;  in __rebalance2()
238 	struct btree_node *right = r->n;  in __rebalance2()
279 	struct btree_node *parent;  in rebalance2()
307 static int delete_center_node(struct dm_btree_info *info, struct btree_node *parent,  in delete_center_node()
309 			      struct btree_node *left, struct btree_node *center, struct btree_node *right,  in delete_center_node()
347 static int redistribute3(struct dm_btree_info *info, struct btree_node *parent,  in redistribute3()
349 			 struct btree_node *left, struct btree_node *center, struct btree_node *right,  in redistribute3()
414 static int __rebalance3(struct dm_btree_info *info, struct btree_node *parent,  in __rebalance3()
417 	struct btree_node *left = l->n;  in __rebalance3()
418 	struct btree_node *center = c->n;  in __rebalance3()
419 	struct btree_node *right = r->n;  in __rebalance3()
446 	struct btree_node *parent = dm_block_data(shadow_current(s));  in rebalance3()
483 	struct btree_node *n;  in rebalance_children()
522 static int do_leaf(struct btree_node *n, uint64_t key, unsigned *index)  in do_leaf()
545 	struct btree_node *n;  in remove_raw()
595 	struct btree_node *n;  in dm_btree_remove()
638 	struct btree_node *n;  in remove_nearest()
693 	struct btree_node *n;  in remove_one()