72 		  struct dm_btree_value_type *vt)  in inc_children()  argument
79 	else if (vt->inc)  in inc_children()
80 		vt->inc(vt->context, value_ptr(n, 0), nr_entries);  in inc_children()
646 			      struct dm_btree_value_type *vt, uint64_t key)  in split_one_into_two()  argument
698 static int shadow_child(struct dm_btree_info *info, struct dm_btree_value_type *vt,  in shadow_child()  argument
716 		inc_children(info->tm, node, vt);  in shadow_child()
729                                 struct dm_btree_value_type *vt, uint64_t key)  in split_two_into_three()  argument
743 		r = shadow_child(s->info, vt, pn, parent_index + 1, &right);  in split_two_into_three()
749 		r = shadow_child(s->info, vt, pn, parent_index - 1, &left);  in split_two_into_three()
906 static int rebalance_left(struct shadow_spine *s, struct dm_btree_value_type *vt,  in rebalance_left()  argument
913 	r = shadow_child(s->info, vt, parent, parent_index - 1, &sib);  in rebalance_left()
935 static int rebalance_right(struct shadow_spine *s, struct dm_btree_value_type *vt,  in rebalance_right()  argument
942 	r = shadow_child(s->info, vt, parent, parent_index + 1, &sib);  in rebalance_right()
992 static int rebalance_or_split(struct shadow_spine *s, struct dm_btree_value_type *vt,  in rebalance_or_split()  argument
1014 				return rebalance_left(s, vt, parent_index, key);  in rebalance_or_split()
1031 				return rebalance_right(s, vt, parent_index, key);  in rebalance_or_split()
1043 		return split_one_into_two(s, parent_index, vt, key);  in rebalance_or_split()
1045 		return split_two_into_three(s, parent_index, vt, key);  in rebalance_or_split()
1082 			    struct dm_btree_value_type *vt,  in btree_insert_raw()  argument
1089 		r = shadow_step(s, root, vt);  in btree_insert_raw()
1114 				r = rebalance_or_split(s, vt, i, key);  in btree_insert_raw()