Signed-off-by: Liam R. Howlett <Liam.Howlett@oracle.com>
cp->src[cp->s_count].end = 0;
cp->src[cp->s_count].start = 0;
cp->slot[0] = l_wr_mas->entry;
- cp->max = mas->index;
+ cp->max = mas->last;
+ cp->min = mas->index;
if (l_wr_mas->entry)
cp->gap[0] = 0;
else
#if 1
{
- unsigned long min = mas->min;
+ unsigned long min = cp.min;
printk("Count is %u\n", cp.d_count);
for (int i = 0; i < cp.d_count; i++) {
printk("dump %p %lu - %lu\n", cp.dst[i].node, min, cp.dst[i].max);