Lines Matching refs:from

52 struct  range {int from, to; };  member
111 static int skip(int i, int from, char *pr);
220 dd[i].old.from = a; in readin()
222 dd[i].new.from = c; in readin()
225 dd[i].old.from = dd[i-1].old.to; in readin()
226 dd[i].new.from = dd[i-1].new.to; in readin()
288 d1->old.from, d1->old.to, in merge()
289 d1->new.from, d1->new.to, in merge()
290 d2->old.from, d2->old.to, in merge()
291 d2->new.from, d2->new.to); in merge()
295 if (!t2 || t1 && d1->new.to < d2->new.from) { in merge()
308 if (!t1 || t2 && d2->new.to < d1->new.from) { in merge()
322 if (d1+1 < d13+m1 && d1->new.to >= d1[1].new.from) { in merge()
323 d1[1].old.from = d1->old.from; in merge()
324 d1[1].new.from = d1->new.from; in merge()
330 if (d2+1 < d23+m2 && d2->new.to >= d2[1].new.from) { in merge()
331 d2[1].old.from = d2->old.from; in merge()
332 d2[1].new.from = d2->new.from; in merge()
338 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) { in merge()
348 d3 = d1->old.to > d1->old.from ? d1 : d2; in merge()
361 if (d1->new.from < d2->new.from) { in merge()
362 d2->old.from -= d2->new.from-d1->new.from; in merge()
363 d2->new.from = d1->new.from; in merge()
364 } else if (d2->new.from < d1->new.from) { in merge()
365 d1->old.from -= d1->new.from-d2->new.from; in merge()
366 d1->new.from = d2->new.from; in merge()
406 (void) skip(i, rold->from, (char *)0); in change()
417 if (rold->to <= rold->from) in prange()
418 (void) printf("%da\n", rold->from-1); in prange()
420 (void) printf("%d", rold->from); in prange()
421 if (rold->to > rold->from+1) in prange()
439 trange.from = rnew->from - delta; in keep()
450 skip(int i, int from, char *pr) in skip() argument
453 for (n = 0; cline[i] < from-1; n += j) { in skip()
474 if (r1->to-r1->from != r2->to-r2->from) in duplicate()
476 (void) skip(0, r1->from, (char *)0); in duplicate()
477 (void) skip(1, r2->from, (char *)0); in duplicate()
479 for (nline = 0; nline < r1->to-r1->from; nline++) { in duplicate()
522 de[j].old.from = diff->old.from; in edit()
524 de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, (char *)0); in edit()
525 de[j].new.to = de[j].new.from + skip(2, diff->new.to, (char *)0); in edit()
541 (void) fseek(fp[2], (long)de[n].new.from, 0); in edscript()
542 for (k = de[n].new.to-de[n].new.from; k > 0; k -= j) { in edscript()
552 (void) printf("%da\n%s\n.\n", de[n].old.from-1, f1mark); in edscript()