Lines Matching defs:n
425 "Usage: ed [- | -s] [-p string] [-x] [-C] [file]\n"
426 " red [- | -s] [-p string] [-x] [-C] [file]\n"));
493 int fsave, m, n;
666 case '\n':
672 case 'n':
716 lastc = '\n';
739 n = zero != dol;
747 fchange = n;
795 n = 1; /* set n so newtime will not execute */
834 if (!(n = m))
854 if (!n)
864 n = 1; /* set n so newtime will not execute */
873 if (!n) newtime();
914 putchr('\n');
945 int n, relerr, retval;
952 n = 0;
954 n *= 10;
955 n += c - '0';
961 n = -n;
962 a1 += n;
1097 if ((c = getchr()) == '\n')
1099 if (c == 'p' || c == 'l' || c == 'n') {
1102 if (c == 'n') listn++;
1103 if ((c = getchr()) == '\n')
1118 if (c == '\n' || c == EOF) {
1136 if (c == '\n')
1145 } while ((c = getchr()) != '\n');
1180 putchr('\n');
1198 putchr('\n');
1199 lastc = '\n';
1281 putchr('\n');
1286 lastc = '\n';
1290 while ((c = getchr()) != '\n' && c != EOF);
1333 while ((c = getchr()) != '\n') {
1355 * "\.\n").
1358 * entering line consisting of only 2 characters: ".\n"
1380 puts(gettext("'\\n' appended"));
1381 *genbuf = '\n';
1397 lastc = '\n';
1411 } while (c != '\n');
1422 putchr('\n');
1430 int n;
1447 putchr('\n');
1451 n = fp-genbuf;
1453 if (run_crypt(count-n, genbuf, n, perm) == -1)
1455 if (write(io, genbuf, n) != n)
1463 fp[-1] = '\n';
1468 n = fp-genbuf;
1470 if (run_crypt(count-n, genbuf, n, perm) == -1)
1472 if (write(io, genbuf, n) != n)
1487 lastc = '\n';
1541 while ((c = get_wchr()) != '\n' && c != '%' && c != '\\') {
1699 if (*bp++ == '\n') {
1719 int n;
1726 lastc = '\n';
1755 n = 512;
1756 while (n--)
1832 int n;
1839 if ((n = _mbftowc(multic, &l, getchr, &peekc)) <= 0)
1841 if (l == '\n')
1846 while ((c = get_wchr()) != '\n') {
1850 /* '\\' has special meaning only if preceding a '\n' */
1853 if (c != '\n')
1866 *gp++ = '\n';
1874 * Special case: g/.../d (avoid n^2 algorithm)
1876 if (globuf[0] == 'd' && globuf[1] == '\n' && globuf[2] == '\0') {
1971 int n;
1976 if ((n = _mbftowc(multic, &seof, getchr, &peekc)) <= 0)
1978 if (seof == '\n' || seof == ' ')
1984 if ((n = _mbftowc(multic, &cl, getchr, &peekc)) <= 0)
1990 if ((n = _mbftowc(multic, &cl, getchr, &peekc)) <= 0)
1992 } else if (cl == '\n') {
1998 UNGETC('\n');
2004 if (p + n > &rhsbuf[RHSIZE])
2006 (void) strncpy(p, multic, n);
2007 p += n;
2126 int n;
2131 if ((n = _mbftowc(multic, &c, getchr, &peekc)) < 0)
2133 if (n == 0 || c == '\n') {
2153 if ((n = _mbftowc(multic, &c, getchr, &peekc)) < 0)
2155 if (n == 0 || c == '\n')
2162 if ((n = _mbftowc(multic, &c, getchr, &peekc)) < 0)
2164 if (n == 0 || c == '\n')
2167 if (cp + n > &genbuf[LBSIZE-1])
2169 (void) strncpy(cp, multic, n);
2170 cp += n;
2173 if (n != 0 && c == '\n')
2174 UNGETC('\n');
2175 if (n == 0 || c == '\n')
2307 int n;
2317 putchr('\n');
2323 putchr('\n');
2325 write(1, gettext("tab count\n"),
2326 strlen(gettext("tab count\n")));
2331 n = mbtowc(&c, sp, MB_LEN_MAX);
2333 if (n < 1)
2335 else if (n == 1)
2338 sp += n;
2358 putchr('\n');
2384 *lp++ = '\n';
2397 *lp++ = '\n';
2413 if (c == '\n' || lp >= &line[64]) {
2430 if (listf && c != '\n') {
2495 *lp++ = '\n';
2499 if (c == '\n' || lp >= &line[64]) {
2526 while (((c = getchr()) != EOF) && (c != '\n')) {
2531 write(1, "\n", 1);
2544 int n;
2559 if ((n = _mbftowc(multic, &cl, getchr, &peekc)) <= 0)
2561 if (cl == '\n')
2573 * preserve the p, l, and n suffix commands of the G and V
2592 if (c == '\n') {
2603 while ((c = get_wchr()) != '\n') {
2605 /* '\\' has special meaning only if preceding a '\n' */
2608 if (c != '\n')
2621 *gp++ = '\n';
2624 } else if ((c = get_wchr()) != '\n')
2818 int havespec, n;
2824 for (fsp = line; *fsp && *fsp != '\n'; fsp += len) {
2843 case 's': if (havespec && (n = numb()) >= 0)
2844 f->Flim = n;
2852 case 'm': if (havespec) n = numb();
2871 int n;
2873 n = 0;
2875 n = 10*n + *fsp-'0';
2877 return (n);
2900 tincr(int n, struct Fspec *f)
2906 f->Ftabs[i] = l += n;
2928 int n, last, i;
2934 if ((n = numb()) <= last || i >= 20) {
2938 f->Ftabs[i++] = last = n;
2957 while (*++l && *l != '\n' && b < 511) {
2967 if (*l != '\0' && *l != '\n') {
2968 buf[b-1] = '\n';
2996 while (*++l && *l != '\n' && b < 511) {
3003 if ((*l != '\0' && *l != '\n') || (f->Flim && (b-1 > (int)f->Flim)))