ni->insert_off = mas->offset;
}
-
/*
* Assemble all the states into the dst within those states
*
* mas_wr_rebalance_two() - rebalance data into two nodes, expects data to
* be decreasing (vs splitting pushing data to a neighbour).
*/
-static void mas_wr_rebalance_two(struct ma_wr_state *wr_mas,
- struct ma_node_info *left,
- struct ma_node_info *right,
- struct ma_node_info *src,
- struct ma_node_info *src2,
- struct ma_node_part *part,
- struct split_data *sd,
+static void rebalance_two(struct ma_node_info *left, struct ma_node_info *right,
+ struct ma_node_info *src, struct ma_node_info *src2,
+ struct ma_node_part *part, struct split_data *sd,
bool left_store)
{
struct ma_node_info *dst;
sd.new_end += src2.end + 1;
if (sd.new_end >= mt_slots[left.type]) {
mni_node_init(&right, mas_pop_node(mas), mte_node_type(mas->node));
- mas_wr_rebalance_two(wr_mas, &left, &right, &src, &src2, &part, &sd, left_store);
+ rebalance_two(&left, &right, &src, &src2, &part, &sd, left_store);
mas_ascend(mas);
mas->end = parent.end;
mas->offset = parent.insert_off;