96 	int from;  member
208 		(*dd)[i].old.from = a;  in readin()
210 		(*dd)[i].new.from = c;  in readin()
214 		(*dd)[i].old.from = (*dd)[i-1].old.to;  in readin()
215 		(*dd)[i].new.from = (*dd)[i-1].new.to;  in readin()
308 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
320 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
334 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
335 			d1[1].old.from = d1->old.from;  in merge()
336 			d1[1].new.from = d1->new.from;  in merge()
342 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
343 			d2[1].old.from = d2->old.from;  in merge()
344 			d2[1].new.from = d2->new.from;  in merge()
349 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
359 				d3 = d1->old.to > d1->old.from ? d1 : d2;  in merge()
371 		if (d1->new.from < d2->new.from) {  in merge()
372 			d2->old.from -= d2->new.from - d1->new.from;  in merge()
373 			d2->new.from = d1->new.from;  in merge()
374 		} else if (d2->new.from < d1->new.from) {  in merge()
375 			d1->old.from -= d1->new.from - d2->new.from;  in merge()
376 			d1->new.from = d2->new.from;  in merge()
405 	skip(i, rold->from, NULL);  in change()
417 	if (rold->to <= rold->from)  in prange()
418 		printf("%da\n", rold->from - 1);  in prange()
420 		printf("%d", rold->from);  in prange()
421 		if (rold->to > rold->from+1)  in prange()
439 	trange.from = rnew->from - delta;  in keep()
449 skip(int i, int from, const char *pr)  in skip()  argument
454 	for (n = 0; cline[i] < from - 1; n += j) {  in skip()
475 	if (r1->to-r1->from != r2->to-r2->from)  in duplicate()
477 	skip(0, r1->from, NULL);  in duplicate()
478 	skip(1, r2->from, NULL);  in duplicate()
480 	for (nline=0; nline < r1->to - r1->from; nline++) {  in duplicate()
518 	de[j].old.from = diff->old.from;  in edit()
520 	de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, NULL);  in edit()
521 	de[j].new.to = de[j].new.from + skip(2, diff->new.to, NULL);  in edit()
540 				fseek(fp[1], de[n].old.from, SEEK_SET);  in edscript()
541 				for (k = de[n].old.to - de[n].old.from; k > 0; k -= j) {  in edscript()
551 		fseek(fp[2], (long)de[n].new.from, SEEK_SET);  in edscript()
552 		for (k = de[n].new.to - de[n].new.from; k > 0; k-= j) {  in edscript()
562 			printf("%da\n%s\n.\n", de[n].old.from - 1, f1mark);  in edscript()