Lines Matching defs:n
125 program(NODE **a, int n)
171 array(NODE **a, int n)
208 matchop(NODE **a, int n)
218 if (n == MATCH && i == 1 || n == NOTMATCH && i == 0)
228 boolop(NODE **a, int n)
239 switch (n) {
258 error(FATAL, "unknown boolean operator %d", n);
267 relop(NODE **a, int n)
292 switch (n) {
306 error(FATAL, "unknown relational operator %d", n);
341 indirect(NODE **a, int n)
362 int k, m, n;
383 n = getfval(x);
387 n = k - 1;
388 if (n < 0)
389 n = 0;
390 else if (n > k - m)
391 n = k - m;
392 dprintf("substr: m=%d, n=%d, s=%ws\n", m, n, s);
394 temp = s[n+m-1];
395 s[n+m-1] = (wchar_t)0x0;
397 s[n+m-1] = temp;
575 a_sprintf(NODE **a, int n)
593 arith(NODE **a, int n)
601 if (n != UMINUS) {
607 switch (n) {
631 error(FATAL, "illegal arithmetic operator %d", n);
641 incrdecr(NODE **a, int n)
649 k = (n == PREINCR || n == POSTINCR) ? 1 : -1;
650 if (n == PREINCR || n == PREDECR) {
664 assign(NODE **a, int n)
674 if (n == ASSIGN) { /* ordinary assignment */
689 switch (n) {
710 error(FATAL, "illegal assignment operator %d", n);
753 pastat(NODE **a, int n)
775 dopa2(NODE **a, int n)
805 aprintf(NODE **a, int n)
812 x = a_sprintf(a, n);
833 int n, flag;
850 dprintf("split: s=|%ws|, a=%ws, sep=|%wc|\n", s, ap->nval, sep);
858 n = 0;
860 for (n = 0; /* dummy */; /* dummy */) {
862 while (iswblank(c) || c == '\t' || c == '\n')
866 n++;
871 c != '\n' && c != '\0');
874 wsprintf(num, "%d", n);
886 n++;
888 while ((c = *s) != sep && c != '\n' && c != '\0')
892 wsprintf(num, "%d", n);
904 x->fval = n;
912 ifstat(NODE **a, int n)
935 whilestat(NODE **a, int n)
961 forstat(NODE **a, int n)
994 instat(NODE **a, int n)
1028 jump(NODE **a, int n)
1035 switch (n) {
1049 error(FATAL, "illegal jump type %d", n);
1058 fncn(NODE **a, int n)
1089 print(NODE **a, int n)