diff/src/analyze.c

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,
95   lin *const fd = fdiag;	/* Give the compiler a chance. */
96   lin *const bd = bdiag;	/* Additional help for the compiler. */
97   lin const *const xv = xvec;	/* Still more help for the compiler. */
98   lin const *const yv = yvec;	/* And more and more . . . */
99   lin const dmin = xoff - ylim;	/* Minimum valid diagonal. */
100   lin const dmax = xlim - yoff;	/* Maximum valid diagonal. */
101   lin const fmid = xoff - yoff;	/* Center diagonal of top-down search. */
102   lin const bmid = xlim - ylim;	/* Center diagonal of bottom-up search. */
103   lin fmin = fmid, fmax = fmid;	/* Limits of top-down search. */
104   lin bmin = bmid, bmax = bmid;	/* Limits of bottom-up search. */
105   lin c;			/* Cost. */
114       lin d;			/* Active diagonal. */
122 	  lin x, y, oldx, tlo = fd[d - 1], thi = fd[d + 1];
149 	  lin x, y, oldx, tlo = bd[d - 1], thi = bd[d + 1];
184 	  lin best = 0;
188 	      lin dd = d - fmid;
189 	      lin x = fd[d];
190 	      lin y = x - d;
191 	      lin v = (x - xoff) * 2 - dd;
223 	      lin dd = d - bmid;
224 	      lin x = bd[d];
225 	      lin y = x - d;
226 	      lin v = (xlim - x) * 2 + dd;
260 	  lin fxybest, fxbest;
261 	  lin bxybest, bxbest;
269 	      lin x = MIN (fd[d], xlim);
270 	      lin y = x - d;
284 	      lin x = MAX (xoff, bd[d]);
285 	      lin y = x - d;
331 compareseq (lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal)
333   lin const *xv = xvec; /* Help the compiler.  */
334   lin const *yv = yvec;
380   lin i;
382   lin *equiv_count[2];
383   lin *p;
419       lin *counts = equiv_count[1 - f];
420       lin *equivs = filevec[f].equivs;
431 	  lin nmatch;
448       lin end = filevec[f].buffered_lines;
459 	      register lin j;
460 	      lin length;
461 	      lin provisional = 0;
491 		  register lin consec;
492 		  lin minimum = 1;
493 		  lin tem = length >> 2;
558       lin end = filevec[f].buffered_lines;
559       lin j = 0;
595       lin const *equivs = filevec[f].equivs;
596       lin i = 0;
597       lin j = 0;
598       lin i_end = filevec[f].buffered_lines;
602 	  lin runlength, start, corresponding;
693 add_change (lin line0, lin line1, lin deleted, lin inserted,
715   lin len0 = filevec[0].buffered_lines;
716   lin len1 = filevec[1].buffered_lines;
720   lin i0 = 0, i1 = 0;
726 	  lin line0 = i0, line1 = i1;
752   lin i0 = filevec[0].buffered_lines, i1 = filevec[1].buffered_lines;
760 	  lin line0 = i0, line1 = i1;
799   lin diags;
935 	      lin first0, last0, first1, last1;