*/
/* Set up sources (up to 3) + part (always) */
sd.new_end = mas->end - part.skip + 1 + part.size;
+ max_s = 2;
if (r_mas.node != mas->node) {
sd.new_end += r_mas.end;
+ max_s++;
}
printk("\tAt %p and r_mas %p\n", mas_mn(mas), mas_mn(&r_mas));
/* Take in more nodes */
printk("!!! %d min slots not met\n", __LINE__);
if (r_parent.insert_off < r_parent.end) {
- src[2] = &other;
+ src[++max_s] = &other;
printk("%d: set src %u\n", __LINE__, 2);
mas_next_node(&r_mas, r_parent.node, ULONG_MAX);
r_parent.insert_off++;
printk("Looks like there is a left sibling\n");
} else if (r_parent.max > ULONG_MAX) {
printk("%d: set src %u\n", __LINE__, 2);
- src[2] = &other;
+ src[++max_s] = &other;
mas_next_node(&r_mas, r_parent.node, ULONG_MAX);
mni_mas_init(&other, &r_mas);
r_parent.insert_off++;
dst[d].max = src[s]->max;
printk("max dst is %u\n", d);
max_d = d;
- max_s = s;
s = d = 0;
printk("START\n");
do {