int node_count = 1 + height * 3;
void *content, *r_content;
unsigned long r_min, r_max;
+ unsigned char l_end;
/* Holds new left and right sub-tree */
MA_STATE(l_mas, mas->tree, mas->index, mas->index);
}
/* Copy l_mas and store the value in b_node. */
- b_node.b_end = mas_store_b_node(&l_mas, &b_node, entry,
- mas_data_end(&l_mas), mas_data_end(&l_mas),
+ l_end = mas_data_end(&l_mas);
+ b_node.b_end = mas_store_b_node(&l_mas, &b_node, entry, l_end, l_end,
content);
/* Copy r_mas into b_node. */
mas_mab_cp(&r_mas, r_mas.offset, mt_slot_count(r_mas.node),