42 static lin *xvec, *yvec;	/* Vectors being compared. */
43 static lin *fdiag;		/* Vector, indexed by diagonal, containing
47 static lin *bdiag;		/* Vector, indexed by diagonal, containing
51 static lin too_expensive;	/* Edit scripts longer than this are too
58   lin xmid, ymid;	/* Midpoints of this partition.  */
92 diag (lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal,  in diag()
95   lin *const fd = fdiag;	/* Give the compiler a chance. */  in diag()
96   lin *const bd = bdiag;	/* Additional help for the compiler. */  in diag()
97   lin const *const xv = xvec;	/* Still more help for the compiler. */  in diag()
98   lin const *const yv = yvec;	/* And more and more . . . */  in diag()
99   lin const dmin = xoff - ylim;	/* Minimum valid diagonal. */  in diag()
100   lin const dmax = xlim - yoff;	/* Maximum valid diagonal. */  in diag()
101   lin const fmid = xoff - yoff;	/* Center diagonal of top-down search. */  in diag()
102   lin const bmid = xlim - ylim;	/* Center diagonal of bottom-up search. */  in diag()
103   lin fmin = fmid, fmax = fmid;	/* Limits of top-down search. */  in diag()
104   lin bmin = bmid, bmax = bmid;	/* Limits of bottom-up search. */  in diag()
105   lin c;			/* Cost. */  in diag()
114       lin d;			/* Active diagonal. */  in diag()
122 	  lin x, y, oldx, tlo = fd[d - 1], thi = fd[d + 1];  in diag()
149 	  lin x, y, oldx, tlo = bd[d - 1], thi = bd[d + 1];  in diag()
184 	  lin best = 0;  in diag()
188 	      lin dd = d - fmid;  in diag()
189 	      lin x = fd[d];  in diag()
190 	      lin y = x - d;  in diag()
191 	      lin v = (x - xoff) * 2 - dd;  in diag()
223 	      lin dd = d - bmid;  in diag()
224 	      lin x = bd[d];  in diag()
225 	      lin y = x - d;  in diag()
226 	      lin v = (xlim - x) * 2 + dd;  in diag()
260 	  lin fxybest, fxbest;  in diag()
261 	  lin bxybest, bxbest;  in diag()
269 	      lin x = MIN (fd[d], xlim);  in diag()
270 	      lin y = x - d;  in diag()
284 	      lin x = MAX (xoff, bd[d]);  in diag()
285 	      lin y = x - d;  in diag()
330 compareseq (lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal)  in compareseq()
332   lin const *xv = xvec; /* Help the compiler.  */  in compareseq()
333   lin const *yv = yvec;  in compareseq()
378   lin i;  in discard_confusing_lines()
380   lin *equiv_count[2];  in discard_confusing_lines()
381   lin *p;  in discard_confusing_lines()
417       lin *counts = equiv_count[1 - f];  in discard_confusing_lines()
418       lin *equivs = filevec[f].equivs;  in discard_confusing_lines()
429 	  lin nmatch;  in discard_confusing_lines()
446       lin end = filevec[f].buffered_lines;  in discard_confusing_lines()
457 	      register lin j;  in discard_confusing_lines()
458 	      lin length;  in discard_confusing_lines()
459 	      lin provisional = 0;  in discard_confusing_lines()
489 		  register lin consec;  in discard_confusing_lines()
490 		  lin minimum = 1;  in discard_confusing_lines()
491 		  lin tem = length >> 2;  in discard_confusing_lines()
556       lin end = filevec[f].buffered_lines;  in discard_confusing_lines()
557       lin j = 0;  in discard_confusing_lines()
592       lin const *equivs = filevec[f].equivs;  in shift_boundaries()
593       lin i = 0;  in shift_boundaries()
594       lin j = 0;  in shift_boundaries()
595       lin i_end = filevec[f].buffered_lines;  in shift_boundaries()
599 	  lin runlength, start, corresponding;  in shift_boundaries()
689 add_change (lin line0, lin line1, lin deleted, lin inserted,  in add_change()
711   lin len0 = filevec[0].buffered_lines;  in build_reverse_script()
712   lin len1 = filevec[1].buffered_lines;  in build_reverse_script()
716   lin i0 = 0, i1 = 0;  in build_reverse_script()
722 	  lin line0 = i0, line1 = i1;  in build_reverse_script()
748   lin i0 = filevec[0].buffered_lines, i1 = filevec[1].buffered_lines;  in build_script()
756 	  lin line0 = i0, line1 = i1;  in build_script()
794   lin diags;  in diff_2_files()
930 	      lin first0, last0, first1, last1;  in diff_2_files()