Lines Matching refs:vt
75 struct dm_btree_value_type *vt) in inc_children() argument
82 else if (vt->inc) in inc_children()
83 vt->inc(vt->context, value_ptr(n, 0), nr_entries); in inc_children()
655 struct dm_btree_value_type *vt, uint64_t key) in split_one_into_two() argument
707 static int shadow_child(struct dm_btree_info *info, struct dm_btree_value_type *vt, in shadow_child() argument
725 inc_children(info->tm, node, vt); in shadow_child()
738 struct dm_btree_value_type *vt, uint64_t key) in split_two_into_three() argument
752 r = shadow_child(s->info, vt, pn, parent_index + 1, &right); in split_two_into_three()
758 r = shadow_child(s->info, vt, pn, parent_index - 1, &left); in split_two_into_three()
915 static int rebalance_left(struct shadow_spine *s, struct dm_btree_value_type *vt, in rebalance_left() argument
922 r = shadow_child(s->info, vt, parent, parent_index - 1, &sib); in rebalance_left()
944 static int rebalance_right(struct shadow_spine *s, struct dm_btree_value_type *vt, in rebalance_right() argument
951 r = shadow_child(s->info, vt, parent, parent_index + 1, &sib); in rebalance_right()
1001 static int rebalance_or_split(struct shadow_spine *s, struct dm_btree_value_type *vt, in rebalance_or_split() argument
1024 return rebalance_left(s, vt, parent_index, key); in rebalance_or_split()
1042 return rebalance_right(s, vt, parent_index, key); in rebalance_or_split()
1054 return split_one_into_two(s, parent_index, vt, key); in rebalance_or_split()
1056 return split_two_into_three(s, parent_index, vt, key); in rebalance_or_split()
1093 struct dm_btree_value_type *vt, in btree_insert_raw() argument
1100 r = shadow_step(s, root, vt); in btree_insert_raw()
1125 r = rebalance_or_split(s, vt, i, key); in btree_insert_raw()