Signed-off-by: Liam R. Howlett <Liam.Howlett@Oracle.com>
// Calc the number of iterations of combining and splitting that will
// need to occur.
count = mas_cnt_positive(mas) + mas->tree->ma_height - mas->depth + 1;
- if (!count) {
- mt_dump(mas->tree);
- printk("%p insert %lu-%lu\n", mas_mn(mas), mas->index, mas->last);
- printk("%u + %u - %u + 1\n", mas_cnt_positive(mas),
- mas->tree->ma_height, mas->depth);
- }
- BUG_ON(!count);
// Combine l_mas and r_mas and split them up evenly again.
return mas_spanning_rebalance(mas, &mast, count);