case 0:
if (pos->lineno & 1)
pos->lineno++;
- if (ends_mline(fm.list[m[pos->m].a + pos->o]))
+ if (ends_line(fm.list[m[pos->m].a + pos->o]))
pos->lineno++;
return fm.list[m[pos->m].a + pos->o];
case 1: return fb.list[m[pos->m].b + pos->o];
{
if (pos->s == 0) {
if (m[pos->m].a + pos->o < fm.elcnt &&
- ends_mline(fm.list[m[pos->m].a + pos->o]))
+ ends_line(fm.list[m[pos->m].a + pos->o]))
pos->lineno--;
if (pos->lineno & 1)
pos->lineno--;
rv |= CONFLICTED | CHANGES;
e = prev_melmnt(&pos.p, fm, fb, fa, m);
} while (e.start != NULL &&
- (!ends_mline(e)
+ (!ends_line(e)
|| visible(mode, m, &pos) == -1));
if (unmatched && (rv & CHANGES))
struct elmnt e = next_melmnt(&pos->p, fm, fb, fa, m);
if (e.start == NULL)
break;
- if (ends_mline(e) &&
+ if (ends_line(e) &&
visible(mode, m, pos) >= 0)
break;
}
struct elmnt e = prev_melmnt(&pos->p, fm, fb, fa, m);
if (e.start == NULL)
break;
- if (ends_mline(e) &&
+ if (ends_line(e) &&
visible(mode, m, pos) >= 0)
break;
}
}
}
} while (e.start != NULL &&
- (!ends_mline(e)
+ (!ends_line(e)
|| visible(mode, m, &pos) == -1));
break_while:
if (found) {
do
e = prev_melmnt(&pos.p, fm, fb, fa, m);
while (e.start != NULL &&
- (!ends_mline(e) ||
+ (!ends_line(e) ||
visible(mode, m, &pos) == -1));
while (1) {
int l;
e = next_melmnt(&pos.p, fm, fb, fa, m);
if (e.start == NULL ||
- (ends_mline(e)
+ (ends_line(e)
&& visible(mode, m, &pos) != -1))
break;
if (visible(mode, m, &pos) == -1)
&& ci.merger[tpos.p.m].ignored == 0)
do_ignore = 1;
e = prev_melmnt(&tpos.p, fm, fb, fa, ci.merger);
- } while (!ends_mline(e) ||
+ } while (!ends_line(e) ||
visible(mode & (RESULT|AFTER), ci.merger, &tpos) < 0);
tpos = pos;
do {
ci.merger[tpos.p.m].type == Changed)
ci.merger[tpos.p.m].ignored = do_ignore;
e = prev_melmnt(&tpos.p, fm, fb, fa, ci.merger);
- } while (!ends_mline(e) ||
+ } while (!ends_line(e) ||
visible(mode & (RESULT|AFTER), ci.merger, &tpos) < 0);
isolate_conflicts(fm, fb, fa, csl1, csl2, 0, ci.merger, 0);
refresh = 1;