101 	struct range old;  member
284 		(*dd)[i].old.from = a;  in readin()
285 		(*dd)[i].old.to = b;  in readin()
289 			if ((*dd)[i].old.from < (*dd)[i - 1].old.to ||  in readin()
295 		(*dd)[i].old.from = (*dd)[i].old.to = (*dd)[i - 1].old.to;  in readin()
381 				change(1, &d1->old, false);  in merge()
396 				change(2, &d2->old, false);  in merge()
410 			d1[1].old.from = d1->old.from;  in merge()
418 			d2[1].old.from = d2->old.from;  in merge()
425 			dup = duplicate(&d1->old, &d2->old);  in merge()
432 				change(1, &d1->old, dup);  in merge()
433 				change(2, &d2->old, false);  in merge()
434 				d3 = d1->old.to > d1->old.from ? d1 : d2;  in merge()
449 			d2->old.from -= d2->new.from - d1->new.from;  in merge()
452 			d1->old.from -= d1->new.from - d2->new.from;  in merge()
456 			d2->old.to += d1->new.to - d2->new.to;  in merge()
459 			d1->old.to += d2->new.to - d1->new.to;  in merge()
620 	de[j].old.from = diff->old.from;  in edit()
621 	de[j].old.to = diff->old.to;  in edit()
661 	struct range *new, *old;  in edscript()  local
665 		old = &de[n].old;  in edscript()
671 			else if (old->from == new->from && old->to == new->to) {  in edscript()
672 				printf("%dc\n", old->from);  in edscript()
673 				printrange(fp[2], old);  in edscript()
679 				prange(old, delete);  in edscript()
681 				printf("%da\n", old->to - 1);  in edscript()
690 				printf("%da\n%s %s\n.\n", old->from - 1,  in edscript()
714 	struct range *new, *old;  in Ascript()  local
718 		old = &de[n].old;  in Ascript()
720 		deleteold = (old->from == old->to);  in Ascript()
724 				prange(old, deletenew);  in Ascript()
738 					printrange(fp[1], old);  in Ascript()
743 			startmark = old->to - 1;  in Ascript()
746 				prange(old, deletenew);  in Ascript()
754 					r.from = old->from-1;  in Ascript()
758 					printrange(fp[1], old);  in Ascript()
775 					startmark - (old->to - old->from),  in Ascript()
794 	struct range r, *new, *old;  in mergescript()  local
803 		old = &de[n].old;  in mergescript()
812 		else if (de[n].type == DIFF_TYPE3 && (old->from == old->to)) {  in mergescript()
813 			r.from = old->from - 1;  in mergescript()
816 			r.to = old->from;  in mergescript()
827 			printrange(fp[1], old);  in mergescript()
838 				printrange(fp[0], old);  in mergescript()
842 					if (old->from == old->to) {  in mergescript()
844 						or.from = old->from - 1;  in mergescript()
848 						printrange(fp[1], old);  in mergescript()
863 		if (old->from == old->to)  in mergescript()
866 			r.from = old->to;  in mergescript()
878 	old = &de[n-1].old;  in mergescript()
880 	if (old->from == new->from && old->to == new->to)  in mergescript()
883 		r.from = old->from;  in mergescript()