HomeSort by: relevance | last modified time | path
    Searched defs:nls (Results 1 - 4 of 4) sorted by relevancy

  /src/bin/sh/
arithmetic.c 429 int nls = 0; local in function:arith
444 nls++, p++;
445 VTRACE(DBG_ARITH, ("Arith found %d newlines\n", nls));
446 arith_lno -= nls;
expand.c 2128 int nls = 0, holdnl = 0, holdlast; local in function:rmescapes_nl
2145 nls++;
2163 if (nls > 0 && holdnl != holdlast) {
2164 while (nls > 0)
2165 *q++ = '\n', nls--;
2170 while (--nls >= 0)
  /src/usr.bin/qsubst/
qsubst.c 132 static long nls[MAX_C_A + 1]; variable in typeref:typename:long[]
270 for (i = MAX_C_A - cabove; nls[i] < 0; i++);
271 fseek(workf, nls[i], 0);
272 for (i = save - nls[i] - rahead; i; i--) {
380 nls[i] = -1;
382 nls[MAX_C_A] = 0;
441 add_shift(nls, ftell(workf), MAX_C_A + 1);
463 add_shift(nls, ftell(workf), MAX_C_A + 1);
  /src/lib/libedit/
refresh.c 544 wchar_t *ofd, *ols, *oe, *nfd, *nls, *ne; local in function:re_update_line
599 nls = ++n;
605 nsb = nls;
607 nse = nls;
610 * case 1: insert: scan from nfd to nls looking for *ofd
613 for (c = *ofd, n = nfd; n < nls; n++) {
616 p < nls && o < ols && *o == *p;
640 p < ols && n < nls && *p == *n;
663 nls = ne;
679 sx = (int)((nls - nse) - (ols - ose))
    [all...]

Completed in 14 milliseconds