sd->states[sd->len].size, dst == left ? "left" : "right");
sd->len++;
} while (src->offset <= src->end);
+ printk("\n\nend of loop\n");
if (left_store) {
char len;
printk("sd is at offset %u splut %u\n", sd->offset, sd->split);
len = sd->split - sd->offset;
state->info = src2;
- printk("cp right->%u + %u to left\n", 0, len);
+ printk("cp from %p to right %u + %u to left\n", src2->node, 0, len);
mns_mni_init(state, left, 0, len);
if (ma_is_leaf(src->type) && mns_ends_in_null(state)) {
printk("ends in null\n");
mas_set_height(mas);
goto new_root;
}
- if (mas->end - 1 > mt_min_slots[parent.type]) {
+ if (mas->end > mt_min_slots[parent.type]) {
printk("Decrease %p to %u\n", parent.node, parent.end - 1);
break; /* Converged */