98 diag (xoff, xlim, yoff, ylim, minimal, part)  in diag()  argument
99      int xoff, xlim, yoff, ylim, minimal;  in diag()
106   int const dmin = xoff - ylim;	/* Minimum valid diagonal. */
108   int const fmid = xoff - yoff;	/* Center diagonal of top-down search. */
116   fd[fmid] = xoff;
164 	  while (x > xoff && y > yoff && xv[x - 1] == yv[y - 1])
199 	      int v = (x - xoff) * 2 - dd;
203 		      && xoff + SNAKE_LIMIT <= x && x < xlim
238 		      && xoff < x && x <= xlim - SNAKE_LIMIT
292 	      int x = max (xoff, bd[d]);
304 	  if ((xlim + ylim) - bxybest < fxybest - (xoff + yoff))
338 compareseq (xoff, xlim, yoff, ylim, minimal)  in compareseq()  argument
339      int xoff, xlim, yoff, ylim, minimal;  in compareseq()
345   while (xoff < xlim && yoff < ylim && xv[xoff] == yv[yoff])
346     ++xoff, ++yoff;
348   while (xlim > xoff && ylim > yoff && xv[xlim - 1] == yv[ylim - 1])
352   if (xoff == xlim)
356     while (xoff < xlim)
357       files[0].changed_flag[files[0].realindexes[xoff++]] = 1;
365       c = diag (xoff, xlim, yoff, ylim, minimal, &part);
377 	  if (part.xmid - part.ymid < xoff - yoff)
386 	  compareseq (xoff, part.xmid, yoff, part.ymid, part.lo_minimal);