Lines Matching defs:n
128 program(Node **a, int n)
182 call(Node **a, int n)
206 dprintf(("calling %s, %d args (%d in defn), fp=%d\n",
218 dprintf(("evaluate args[%d], fp=%d:\n", i, fp-frame));
221 dprintf(("args[%d]: %s %f <%s>, t=%o\n",
252 dprintf(("start exec of %s, fp=%d\n", s, fp-frame));
255 dprintf(("finished exec of %s, fp=%d\n", s, fp-frame));
283 dprintf(("%s returns %g |%s| %o\n",
308 int n;
310 n = (int)a[0]; /* argument number, counting from 0 */
311 dprintf(("arg(%d), fp->nargs=%d\n", n, fp->nargs));
312 if (n+1 > fp->nargs) {
314 n+1, fp->fcncell->nval FATAL;
316 return (fp->args[n]);
320 jump(Node **a, int n)
324 switch (n) {
354 ERROR "illegal jump type %d", n FATAL;
361 getaline(Node **a, int n)
379 n = -1;
381 n = readrec(&buf, &len, fp);
382 if (n > 0) {
400 n = getrec(&record, &record_size);
403 n = getrec(&buf, &len);
408 (void) setfval(r, (Awkfloat)n);
414 getnf(Node **a, int n)
423 array(Node **a, int n)
451 dprintf(("making %s into an array\n", x->nval));
469 delete(Node **a, int n)
505 intest(Node **a, int n)
546 matchop(Node **a, int n)
554 if (n == MATCHFCN) {
570 if (n == MATCHFCN) {
580 } else if (n == MATCH && i == 1 || n == NOTMATCH && i == 0)
588 boolop(Node **a, int n)
596 switch (n) {
614 ERROR "unknown boolean operator %d", n FATAL;
621 relop(Node **a, int n)
637 switch (n) {
645 ERROR "unknown relational operator %d", n FATAL;
655 (void) printf("## tfree %.8s %06lo %s\n",
684 (void) printf("## gtemp %.8s %06lo\n", s, (ulong_t)x);
690 indirect(Node **a, int n)
711 register int k, m, n;
738 n = (int)getfval(z);
741 n = k - 1;
742 if (n < 0)
743 n = 0;
744 else if (n > k - m)
745 n = k - m;
746 dprintf(("substr: m=%d, n=%d, s=%s\n", m, n, s));
748 temp = s[n + m - 1]; /* with thanks to John Linderman */
749 s[n + m - 1] = '\0';
751 s[n + m - 1] = temp;
931 a_sprintf(Node **a, int n)
949 aprintf(Node **a, int n)
972 arith(Node **a, int n)
981 if (n != UMINUS) {
987 switch (n) {
1018 ERROR "illegal arithmetic operator %d", n FATAL;
1025 ipow(double x, int n)
1029 if (n <= 0)
1031 v = ipow(x, n/2);
1032 if (n % 2 == 0)
1039 incrdecr(Node **a, int n)
1047 k = (n == PREINCR || n == POSTINCR) ? 1 : -1;
1048 if (n == PREINCR || n == PREDECR) {
1060 assign(Node **a, int n)
1068 if (n == ASSIGN) { /* ordinary assignment */
1084 switch (n) {
1112 ERROR "illegal assignment operator %d", n FATAL;
1151 pastat(Node **a, int n)
1169 dopa2(Node **a, int n)
1177 dprintf(("paircnt: %d\n", paircnt));
1210 int n, tempstat;
1226 dprintf(("split: s=|%s|, a=%s, sep=|%s|\n", s, ap->nval, fs));
1231 n = 0;
1244 n++;
1245 (void) sprintf((char *)num, "%d", n);
1261 n++;
1262 (void) sprintf((char *)num, "%d", n);
1271 n++;
1272 (void) sprintf((char *)num, "%d", n);
1284 for (n = 0; ; ) {
1285 while (*s == ' ' || *s == '\t' || *s == '\n')
1289 n++;
1294 *s != '\n' && *s != '\0')
1298 (void) sprintf((char *)num, "%d", n);
1314 n++;
1316 while (*s != sep && *s != '\n' && *s != '\0')
1320 (void) sprintf((char *)num, "%d", n);
1341 x->fval = n;
1347 condexpr(Node **a, int n)
1364 ifstat(Node **a, int n)
1381 whilestat(Node **a, int n)
1403 dostat(Node **a, int n)
1423 forstat(Node **a, int n)
1450 instat(Node **a, int n)
1484 bltin(Node **a, int n)
1572 print(Node **a, int n)
1598 nullproc(Node **a, int n)
1674 closefile(Node **a, int n)