100 	int from;  member
238 		(*dd)[i].old.from = a;  in readin()
240 		(*dd)[i].new.from = c;  in readin()
244 		(*dd)[i].old.from = (*dd)[i-1].old.to;  in readin()
245 		(*dd)[i].new.from = (*dd)[i-1].new.to;  in readin()
313 			d1->old.from,d1->old.to,  in merge()
314 			d1->new.from,d1->new.to,  in merge()
315 			d2->old.from,d2->old.to,  in merge()
316 			d2->new.from,d2->new.to);  in merge()
319 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
331 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
345 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
346 			d1[1].old.from = d1->old.from;  in merge()
347 			d1[1].new.from = d1->new.from;  in merge()
353 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
354 			d2[1].old.from = d2->old.from;  in merge()
355 			d2[1].new.from = d2->new.from;  in merge()
360 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
370 				d3 = d1->old.to > d1->old.from ? d1 : d2;  in merge()
382 		if (d1->new.from < d2->new.from) {  in merge()
383 			d2->old.from -= d2->new.from-d1->new.from;  in merge()
384 			d2->new.from = d1->new.from;  in merge()
385 		} else if (d2->new.from < d1->new.from) {  in merge()
386 			d1->old.from -= d1->new.from-d2->new.from;  in merge()
387 			d1->new.from = d2->new.from;  in merge()
421 	(void)skip(i, rold->from, NULL);  in change()
431 	if (rold->to <= rold->from)  in prange()
432 		printf("%da\n", rold->from - 1);  in prange()
434 		printf("%d", rold->from);  in prange()
435 		if (rold->to > rold->from+1)  in prange()
453 	trange.from = rnew->from - delta;  in keep()
463 skip(int i, int from, char *pr)  in skip()  argument
468 	for (n = 0; cline[i] < from - 1; n += j) {  in skip()
489 	if (r1->to-r1->from != r2->to-r2->from)  in duplicate()
491 	(void)skip(0, r1->from, NULL);  in duplicate()
492 	(void)skip(1, r2->from, NULL);  in duplicate()
494 	for (nline=0; nline < r1->to - r1->from; nline++) {  in duplicate()
538 	de[j].old.from = diff->old.from;  in edit()
540 	de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, NULL);  in edit()
541 	de[j].new.to = de[j].new.from + skip(2, diff->new.to, NULL);  in edit()
557 		(void)fseek(fp[2], (long)de[n].new.from, 0);  in edscript()
558 		for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {  in edscript()
568 			printf("%da\n%s\n.\n", de[n].old.from - 1, f1mark);  in edscript()