Lines Matching refs:to
4 * The contents of this file are subject to the terms of the
48 * to mark the overlaps; otherwise, the file names f1 and f3 are used
52 struct range {int from, to; };
55 * to is last+1
56 * from = to = line after point of insertion
63 * de is used to gather editing scripts,
73 * array overlap indicates which sections in de correspond to
94 static int oflag; /* indicates whether to mark overlaps (-E or -X) */
221 dd[i].old.to = b;
223 dd[i].new.to = d;
225 dd[i].old.from = dd[i-1].old.to;
226 dd[i].new.from = dd[i-1].new.to;
288 d1->old.from, d1->old.to,
289 d1->new.from, d1->new.to,
290 d2->old.from, d2->old.to,
291 d2->new.from, d2->new.to);
295 if (!t2 || t1 && d1->new.to < d2->new.from) {
296 /* stuff peculiar to 1st file */
308 if (!t1 || t2 && d2->new.to < d1->new.from) {
322 if (d1+1 < d13+m1 && d1->new.to >= d1[1].new.from) {
330 if (d2+1 < d23+m2 && d2->new.to >= d2[1].new.from) {
337 /* stuff peculiar to third file or different in all */
338 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
348 d3 = d1->old.to > d1->old.from ? d1 : d2;
358 * extend changes appropriately to
369 if (d1->new.to > d2->new.to) {
370 d2->old.to += d1->new.to - d2->new.to;
371 d2->new.to = d1->new.to;
372 } else if (d2->new.to > d1->new.to) {
373 d1->old.to += d2->new.to - d1->new.to;
374 d1->new.to = d2->new.to;
391 * the range of ines rold.from thru rold.to in file i
392 * is to be changed. it is to be printed only if
393 * it does not duplicate something to be printed later
399 last[i] = rold->to;
407 (void) skip(i, rold->to, " ");
411 * print the range of line numbers, rold.from thru rold.to
417 if (rold->to <= rold->from)
421 if (rold->to > rold->from+1)
422 (void) printf(",%d", rold->to-1);
430 * must be ginned up to correspond to the change reported
440 trange.to = rnew->to - delta;
445 * skip to just befor line number from in file i
474 if (r1->to-r1->from != r2->to-r2->from)
479 for (nline = 0; nline < r1->to-r1->from; nline++) {
523 de[j].old.to = diff->old.to;
524 de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, (char *)0);
525 de[j].new.to = de[j].new.from + skip(2, diff->new.to, (char *)0);
540 (void) printf("%da\n=======\n", de[n].old.to -1);
542 for (k = de[n].new.to-de[n].new.from; k > 0; k -= j) {