| /netbsd-current/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| H A D | fstrcmp.c | 131 int diag(int xoff, int xlim, int yoff, int ylim, int minimal,
172 diag (int xoff, int xlim, int yoff, int ylim, int minimal, argument
180 const int dmax = xlim - yoff; /* Maximum valid diagonal. */
182 const int bmid = xlim - ylim; /* Center diagonal of bottom-up search. */
195 bd[bmid] = xlim;
228 while (x < xlim && y < ylim && xv[x] == yv[y])
322 x < xlim
363 v = (xlim - x) * 2 + dd;
367 if (v > best && xoff < x && x <= xlim - SNAKE_LIMIT &&
416 x = fd[d] < xlim
493 compareseq(int xoff, int xlim, int yoff, int ylim, int minimal, struct context *ctxt) argument
[all...] |
| /netbsd-current/external/gpl2/gettext/dist/gettext-tools/libgettextpo/ |
| H A D | fstrcmp.c | 131 int diag(int xoff, int xlim, int yoff, int ylim, int minimal,
172 diag (int xoff, int xlim, int yoff, int ylim, int minimal, argument
180 const int dmax = xlim - yoff; /* Maximum valid diagonal. */
182 const int bmid = xlim - ylim; /* Center diagonal of bottom-up search. */
195 bd[bmid] = xlim;
228 while (x < xlim && y < ylim && xv[x] == yv[y])
322 x < xlim
363 v = (xlim - x) * 2 + dd;
367 if (v > best && xoff < x && x <= xlim - SNAKE_LIMIT &&
416 x = fd[d] < xlim
493 compareseq(int xoff, int xlim, int yoff, int ylim, int minimal, struct context *ctxt) argument
[all...] |
| /netbsd-current/external/gpl2/gettext/dist/gnulib-local/lib/ |
| H A D | fstrcmp.c | 131 int diag(int xoff, int xlim, int yoff, int ylim, int minimal,
172 diag (int xoff, int xlim, int yoff, int ylim, int minimal, argument
180 const int dmax = xlim - yoff; /* Maximum valid diagonal. */
182 const int bmid = xlim - ylim; /* Center diagonal of bottom-up search. */
195 bd[bmid] = xlim;
228 while (x < xlim && y < ylim && xv[x] == yv[y])
322 x < xlim
363 v = (xlim - x) * 2 + dd;
367 if (v > best && xoff < x && x <= xlim - SNAKE_LIMIT &&
416 x = fd[d] < xlim
493 compareseq(int xoff, int xlim, int yoff, int ylim, int minimal, struct context *ctxt) argument
[all...] |
| /netbsd-current/external/gpl2/xcvs/dist/diff/ |
| H A D | analyze.c | 98 diag (xoff, xlim, yoff, ylim, minimal, part)
99 int xoff, xlim, yoff, ylim, minimal;
107 int const dmax = xlim - yoff; /* Maximum valid diagonal. */
109 int const bmid = xlim - ylim; /* Center diagonal of bottom-up search. */
117 bd[bmid] = xlim;
137 while (x < xlim && y < ylim && xv[x] == yv[y])
203 && xoff + SNAKE_LIMIT <= x && x < xlim
234 int v = (xlim - x) * 2 + dd;
238 && xoff < x && x <= xlim - SNAKE_LIMIT
277 int x = min (fd[d], xlim);
[all...] |
| /netbsd-current/external/gpl2/diffutils/dist/src/ |
| H A D | analyze.c | 97 diag (lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal, argument
105 lin const dmax = xlim - yoff; /* Maximum valid diagonal. */
107 lin const bmid = xlim - ylim; /* Center diagonal of bottom-up search. */
115 bd[bmid] = xlim;
135 while (x < xlim && y < ylim && xv[x] == yv[y])
201 && xoff + SNAKE_LIMIT <= x && x < xlim
232 lin v = (xlim - x) * 2 + dd;
236 && xoff < x && x <= xlim - SNAKE_LIMIT
275 lin x = MIN (fd[d], xlim);
302 if ((xlim
336 compareseq(lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal) argument
[all...] |
| /netbsd-current/usr.sbin/timed/timed/ |
| H A D | networkdelta.c | 156 long *x, long *xlim, /* the data */
186 for (xptr = x; xptr != xlim; xptr++) {
244 if (((x - xlim) % 2) != 0) { /* even number of points? */
154 median(float a, float *eps_ptr, long *x, long *xlim, unsigned int gnuf) argument
|
| /netbsd-current/games/hack/ |
| H A D | hack.mklev.c | 233 int tryct = 0, xlim, ylim; local
236 xlim = XLIM + secret;
271 if (hx - lx < dx + dx / 2 + 2 * xlim || hy - ly < dy + dy / 3 + 2 * ylim) {
284 lowx = lx + xlim + rn2(hx - lx - dx - 2 * xlim + 1);
304 int lx, ly, hx, hy, xlim, ylim; local
307 xlim = XLIM + secret;
327 if (lowx - lx > 2 * xlim + 4)
331 if (hx - hix > 2 * xlim + 4)
464 int xlim local
[all...] |