Lines Matching defs:from
52 struct range {int from, to; };
54 * from is first in range of changed lines
56 * from = to = line after point of insertion
111 static int skip(int i, int from, char *pr);
175 * pick up the line numbers of all changes from
220 dd[i].old.from = a;
222 dd[i].new.from = c;
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);
294 /* first file is different from others */
295 if (!t2 || t1 && d1->new.to < d2->new.from) {
307 /* second file is different from others */
308 if (!t1 || t2 && d2->new.to < d1->new.from) {
322 if (d1+1 < d13+m1 && d1->new.to >= d1[1].new.from) {
323 d1[1].old.from = d1->old.from;
324 d1[1].new.from = d1->new.from;
330 if (d2+1 < d23+m2 && d2->new.to >= d2[1].new.from) {
331 d2[1].old.from = d2->old.from;
332 d2[1].new.from = d2->new.from;
338 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
348 d3 = d1->old.to > d1->old.from ? d1 : d2;
357 * overlapping changes from file1 & 2
361 if (d1->new.from < d2->new.from) {
362 d2->old.from -= d2->new.from-d1->new.from;
363 d2->new.from = d1->new.from;
364 } else if (d2->new.from < d1->new.from) {
365 d1->old.from -= d1->new.from-d2->new.from;
366 d1->new.from = d2->new.from;
391 * the range of ines rold.from thru rold.to in file i
406 (void) skip(i, rold->from, (char *)0);
411 * print the range of line numbers, rold.from thru rold.to
417 if (rold->to <= rold->from)
418 (void) printf("%da\n", rold->from-1);
420 (void) printf("%d", rold->from);
421 if (rold->to > rold->from+1)
439 trange.from = rnew->from - delta;
445 * skip to just befor line number from in file i
450 skip(int i, int from, char *pr)
453 for (n = 0; cline[i] < from-1; n += j) {
474 if (r1->to-r1->from != r2->to-r2->from)
476 (void) skip(0, r1->from, (char *)0);
477 (void) skip(1, r2->from, (char *)0);
479 for (nline = 0; nline < r1->to-r1->from; nline++) {
522 de[j].old.from = diff->old.from;
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);
541 (void) fseek(fp[2], (long)de[n].new.from, 0);
542 for (k = de[n].new.to-de[n].new.from; k > 0; k -= j) {
552 (void) printf("%da\n%s\n.\n", de[n].old.from-1, f1mark);