Annotation of src/usr.bin/awk/run.c, Revision 1.57
1.57 ! millert 1: /* $OpenBSD: run.c,v 1.56 2020/06/10 21:05:02 millert Exp $ */
1.1 tholo 2: /****************************************************************
1.13 kstailey 3: Copyright (C) Lucent Technologies 1997
1.1 tholo 4: All Rights Reserved
5:
6: Permission to use, copy, modify, and distribute this software and
7: its documentation for any purpose and without fee is hereby
8: granted, provided that the above copyright notice appear in all
9: copies and that both that the copyright notice and this
10: permission notice and warranty disclaimer appear in supporting
1.13 kstailey 11: documentation, and that the name Lucent Technologies or any of
12: its entities not be used in advertising or publicity pertaining
13: to distribution of the software without specific, written prior
14: permission.
15:
16: LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
17: INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
18: IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
19: SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
20: WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
21: IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
22: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
23: THIS SOFTWARE.
1.1 tholo 24: ****************************************************************/
25:
26: #define DEBUG
27: #include <stdio.h>
28: #include <ctype.h>
1.57 ! millert 29: #include <wchar.h>
! 30: #include <wctype.h>
1.45 guenther 31: #include <errno.h>
1.56 millert 32: #include <fcntl.h>
1.1 tholo 33: #include <setjmp.h>
1.25 millert 34: #include <limits.h>
1.1 tholo 35: #include <math.h>
36: #include <string.h>
37: #include <stdlib.h>
38: #include <time.h>
1.47 millert 39: #include <sys/types.h>
40: #include <sys/wait.h>
1.1 tholo 41: #include "awk.h"
1.13 kstailey 42: #include "ytab.h"
1.1 tholo 43:
1.57 ! millert 44: static void stdinit(void);
! 45: static void flush_all(void);
1.1 tholo 46:
1.57 ! millert 47: #if 1
! 48: #define tempfree(x) do { if (istemp(x)) tfree(x); } while (/*CONSTCOND*/0)
! 49: #else
1.1 tholo 50: void tempfree(Cell *p) {
51: if (p->ctype == OCELL && (p->csub < CUNK || p->csub > CFREE)) {
1.16 millert 52: WARNING("bad csub %d in Cell %d %s",
53: p->csub, p->ctype, p->sval);
1.1 tholo 54: }
55: if (istemp(p))
56: tfree(p);
57: }
1.57 ! millert 58: #endif
1.1 tholo 59:
1.30 millert 60: /* do we really need these? */
61: /* #ifdef _NFILE */
62: /* #ifndef FOPEN_MAX */
63: /* #define FOPEN_MAX _NFILE */
64: /* #endif */
65: /* #endif */
66: /* */
67: /* #ifndef FOPEN_MAX */
68: /* #define FOPEN_MAX 40 */ /* max number of open files */
69: /* #endif */
70: /* */
71: /* #ifndef RAND_MAX */
72: /* #define RAND_MAX 32767 */ /* all that ansi guarantees */
73: /* #endif */
1.1 tholo 74:
75: jmp_buf env;
1.13 kstailey 76: extern int pairstack[];
1.33 millert 77: extern Awkfloat srand_seed;
1.1 tholo 78:
79: Node *winner = NULL; /* root of parse tree */
80: Cell *tmps; /* free temporary cells for execution */
81:
1.57 ! millert 82: static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM, NULL, NULL };
1.15 millert 83: Cell *True = &truecell;
1.57 ! millert 84: static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM, NULL, NULL };
1.15 millert 85: Cell *False = &falsecell;
1.57 ! millert 86: static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 87: Cell *jbreak = &breakcell;
1.57 ! millert 88: static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 89: Cell *jcont = &contcell;
1.57 ! millert 90: static Cell nextcell ={ OJUMP, JNEXT, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 91: Cell *jnext = &nextcell;
1.57 ! millert 92: static Cell nextfilecell ={ OJUMP, JNEXTFILE, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 93: Cell *jnextfile = &nextfilecell;
1.57 ! millert 94: static Cell exitcell ={ OJUMP, JEXIT, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 95: Cell *jexit = &exitcell;
1.57 ! millert 96: static Cell retcell ={ OJUMP, JRET, 0, 0, 0.0, NUM, NULL, NULL };
1.1 tholo 97: Cell *jret = &retcell;
1.57 ! millert 98: static Cell tempcell ={ OCELL, CTEMP, 0, EMPTY, 0.0, NUM|STR|DONTFREE, NULL, NULL };
1.1 tholo 99:
100: Node *curnode = NULL; /* the node being executed, for debugging */
1.22 deraadt 101:
1.13 kstailey 102: /* buffer memory management */
103: int adjbuf(char **pbuf, int *psiz, int minlen, int quantum, char **pbptr,
1.18 millert 104: const char *whatrtn)
1.13 kstailey 105: /* pbuf: address of pointer to buffer being managed
106: * psiz: address of buffer size variable
107: * minlen: minimum length of buffer needed
108: * quantum: buffer size quantum
109: * pbptr: address of movable pointer into buffer, or 0 if none
110: * whatrtn: name of the calling routine if failure should cause fatal error
111: *
112: * return 0 for realloc failure, !=0 for success
113: */
114: {
115: if (minlen > *psiz) {
116: char *tbuf;
117: int rminlen = quantum ? minlen % quantum : 0;
118: int boff = pbptr ? *pbptr - *pbuf : 0;
119: /* round up to next multiple of quantum */
120: if (rminlen)
121: minlen += quantum - rminlen;
1.53 millert 122: tbuf = realloc(*pbuf, minlen);
123: DPRINTF( ("adjbuf %s: %d %d (pbuf=%p, tbuf=%p)\n", whatrtn, *psiz, minlen, *pbuf, tbuf) );
1.13 kstailey 124: if (tbuf == NULL) {
125: if (whatrtn)
1.16 millert 126: FATAL("out of memory in %s", whatrtn);
1.13 kstailey 127: return 0;
128: }
129: *pbuf = tbuf;
130: *psiz = minlen;
131: if (pbptr)
132: *pbptr = tbuf + boff;
133: }
134: return 1;
135: }
136:
1.1 tholo 137: void run(Node *a) /* execution of parse tree starts here */
138: {
1.16 millert 139: stdinit();
1.1 tholo 140: execute(a);
141: closeall();
142: }
143:
144: Cell *execute(Node *u) /* execute a node of the parse tree */
145: {
146: Cell *(*proc)(Node **, int);
147: Cell *x;
148: Node *a;
149:
150: if (u == NULL)
1.15 millert 151: return(True);
1.1 tholo 152: for (a = u; ; a = a->nnext) {
153: curnode = a;
154: if (isvalue(a)) {
1.2 millert 155: x = (Cell *) (a->narg[0]);
1.13 kstailey 156: if (isfld(x) && !donefld)
1.1 tholo 157: fldbld();
1.13 kstailey 158: else if (isrec(x) && !donerec)
1.1 tholo 159: recbld();
160: return(x);
161: }
162: if (notlegal(a->nobj)) /* probably a Cell* but too risky to print */
1.16 millert 163: FATAL("illegal statement");
1.1 tholo 164: proc = proctab[a->nobj-FIRSTTOKEN];
165: x = (*proc)(a->narg, a->nobj);
1.13 kstailey 166: if (isfld(x) && !donefld)
1.1 tholo 167: fldbld();
1.13 kstailey 168: else if (isrec(x) && !donerec)
1.1 tholo 169: recbld();
170: if (isexpr(a))
171: return(x);
172: if (isjump(x))
173: return(x);
174: if (a->nnext == NULL)
175: return(x);
176: tempfree(x);
177: }
178: }
179:
180:
181: Cell *program(Node **a, int n) /* execute an awk program */
182: { /* a[0] = BEGIN, a[1] = body, a[2] = END */
183: Cell *x;
184:
185: if (setjmp(env) != 0)
186: goto ex;
187: if (a[0]) { /* BEGIN */
188: x = execute(a[0]);
189: if (isexit(x))
1.15 millert 190: return(True);
1.1 tholo 191: if (isjump(x))
1.16 millert 192: FATAL("illegal break, continue, next or nextfile from BEGIN");
1.1 tholo 193: tempfree(x);
194: }
195: if (a[1] || a[2])
1.54 millert 196: while (getrec(&record, &recsize, true) > 0) {
1.1 tholo 197: x = execute(a[1]);
198: if (isexit(x))
199: break;
200: tempfree(x);
201: }
202: ex:
203: if (setjmp(env) != 0) /* handles exit within END */
204: goto ex1;
205: if (a[2]) { /* END */
206: x = execute(a[2]);
207: if (isbreak(x) || isnext(x) || iscont(x))
1.16 millert 208: FATAL("illegal break, continue, next or nextfile from END");
1.1 tholo 209: tempfree(x);
210: }
211: ex1:
1.15 millert 212: return(True);
1.1 tholo 213: }
214:
215: struct Frame { /* stack frame for awk function calls */
216: int nargs; /* number of arguments in this call */
217: Cell *fcncell; /* pointer to Cell for function */
218: Cell **args; /* pointer to array of arguments after execute */
219: Cell *retval; /* return value */
220: };
221:
222: #define NARGS 50 /* max args in a call */
223:
224: struct Frame *frame = NULL; /* base of stack frames; dynamically allocated */
225: int nframe = 0; /* number of frames allocated */
1.57 ! millert 226: struct Frame *frp = NULL; /* frame pointer. bottom level unused */
1.1 tholo 227:
228: Cell *call(Node **a, int n) /* function call. very kludgy and fragile */
229: {
1.57 ! millert 230: static const Cell newcopycell = { OCELL, CCOPY, 0, EMPTY, 0.0, NUM|STR|DONTFREE, NULL, NULL };
1.1 tholo 231: int i, ncall, ndef;
1.25 millert 232: int freed = 0; /* handles potential double freeing when fcn & param share a tempcell */
1.1 tholo 233: Node *x;
1.13 kstailey 234: Cell *args[NARGS], *oargs[NARGS]; /* BUG: fixed size arrays */
235: Cell *y, *z, *fcn;
1.1 tholo 236: char *s;
237:
238: fcn = execute(a[0]); /* the function itself */
239: s = fcn->nval;
1.13 kstailey 240: if (!isfcn(fcn))
1.16 millert 241: FATAL("calling undefined function %s", s);
1.1 tholo 242: if (frame == NULL) {
1.57 ! millert 243: frp = frame = calloc(nframe += 100, sizeof(*frame));
1.1 tholo 244: if (frame == NULL)
1.16 millert 245: FATAL("out of space for stack frames calling %s", s);
1.1 tholo 246: }
247: for (ncall = 0, x = a[1]; x != NULL; x = x->nnext) /* args in call */
248: ncall++;
1.12 millert 249: ndef = (int) fcn->fval; /* args in defn */
1.57 ! millert 250: DPRINTF( ("calling %s, %d args (%d in defn), frp=%d\n", s, ncall, ndef, (int) (frp-frame)) );
1.1 tholo 251: if (ncall > ndef)
1.16 millert 252: WARNING("function %s called with %d args, uses only %d",
253: s, ncall, ndef);
1.1 tholo 254: if (ncall + ndef > NARGS)
1.16 millert 255: FATAL("function %s has %d arguments, limit %d", s, ncall+ndef, NARGS);
1.1 tholo 256: for (i = 0, x = a[1]; x != NULL; i++, x = x->nnext) { /* get call args */
1.57 ! millert 257: DPRINTF( ("evaluate args[%d], frp=%d:\n", i, (int) (frp-frame)) );
1.1 tholo 258: y = execute(x);
259: oargs[i] = y;
1.42 deraadt 260: DPRINTF( ("args[%d]: %s %f <%s>, t=%o\n",
1.18 millert 261: i, NN(y->nval), y->fval, isarr(y) ? "(array)" : NN(y->sval), y->tval) );
1.13 kstailey 262: if (isfcn(y))
1.16 millert 263: FATAL("can't use function %s as argument in %s", y->nval, s);
1.1 tholo 264: if (isarr(y))
265: args[i] = y; /* arrays by ref */
266: else
267: args[i] = copycell(y);
268: tempfree(y);
269: }
270: for ( ; i < ndef; i++) { /* add null args for ones not provided */
271: args[i] = gettemp();
272: *args[i] = newcopycell;
273: }
1.57 ! millert 274: frp++; /* now ok to up frame */
! 275: if (frp >= frame + nframe) {
! 276: int dfp = frp - frame; /* old index */
! 277: frame = reallocarray(frame, (nframe += 100), sizeof(*frame));
1.1 tholo 278: if (frame == NULL)
1.16 millert 279: FATAL("out of space for stack frames in %s", s);
1.57 ! millert 280: frp = frame + dfp;
1.1 tholo 281: }
1.57 ! millert 282: frp->fcncell = fcn;
! 283: frp->args = args;
! 284: frp->nargs = ndef; /* number defined with (excess are locals) */
! 285: frp->retval = gettemp();
1.1 tholo 286:
1.57 ! millert 287: DPRINTF( ("start exec of %s, frp=%d\n", s, (int) (frp-frame)) );
1.1 tholo 288: y = execute((Node *)(fcn->sval)); /* execute body */
1.57 ! millert 289: DPRINTF( ("finished exec of %s, frp=%d\n", s, (int) (frp-frame)) );
1.1 tholo 290:
291: for (i = 0; i < ndef; i++) {
1.57 ! millert 292: Cell *t = frp->args[i];
1.1 tholo 293: if (isarr(t)) {
294: if (t->csub == CCOPY) {
295: if (i >= ncall) {
296: freesymtab(t);
297: t->csub = CTEMP;
1.14 millert 298: tempfree(t);
1.1 tholo 299: } else {
300: oargs[i]->tval = t->tval;
301: oargs[i]->tval &= ~(STR|NUM|DONTFREE);
302: oargs[i]->sval = t->sval;
303: tempfree(t);
304: }
305: }
306: } else if (t != y) { /* kludge to prevent freeing twice */
307: t->csub = CTEMP;
308: tempfree(t);
1.25 millert 309: } else if (t == y && t->csub == CCOPY) {
310: t->csub = CTEMP;
311: tempfree(t);
312: freed = 1;
1.1 tholo 313: }
314: }
315: tempfree(fcn);
1.17 millert 316: if (isexit(y) || isnext(y))
1.1 tholo 317: return y;
1.25 millert 318: if (freed == 0) {
319: tempfree(y); /* don't free twice! */
320: }
1.57 ! millert 321: z = frp->retval; /* return value */
1.42 deraadt 322: DPRINTF( ("%s returns %g |%s| %o\n", s, getfval(z), getsval(z), z->tval) );
1.57 ! millert 323: frp--;
1.1 tholo 324: return(z);
325: }
326:
327: Cell *copycell(Cell *x) /* make a copy of a cell in a temp */
328: {
329: Cell *y;
330:
1.47 millert 331: /* copy is not constant or field */
332:
1.1 tholo 333: y = gettemp();
1.47 millert 334: y->tval = x->tval & ~(CON|FLD|REC);
1.1 tholo 335: y->csub = CCOPY; /* prevents freeing until call is over */
1.13 kstailey 336: y->nval = x->nval; /* BUG? */
1.47 millert 337: if (isstr(x) /* || x->ctype == OCELL */) {
1.17 millert 338: y->sval = tostring(x->sval);
1.47 millert 339: y->tval &= ~DONTFREE;
340: } else
341: y->tval |= DONTFREE;
1.1 tholo 342: y->fval = x->fval;
343: return y;
344: }
345:
346: Cell *arg(Node **a, int n) /* nth argument of a function */
347: {
348:
1.15 millert 349: n = ptoi(a[0]); /* argument number, counting from 0 */
1.57 ! millert 350: DPRINTF( ("arg(%d), frp->nargs=%d\n", n, frp->nargs) );
! 351: if (n+1 > frp->nargs)
1.16 millert 352: FATAL("argument #%d of function %s was not supplied",
1.57 ! millert 353: n+1, frp->fcncell->nval);
! 354: return frp->args[n];
1.1 tholo 355: }
356:
357: Cell *jump(Node **a, int n) /* break, continue, next, nextfile, return */
358: {
359: Cell *y;
360:
361: switch (n) {
362: case EXIT:
363: if (a[0] != NULL) {
364: y = execute(a[0]);
1.14 millert 365: errorflag = (int) getfval(y);
1.1 tholo 366: tempfree(y);
367: }
368: longjmp(env, 1);
369: case RETURN:
370: if (a[0] != NULL) {
371: y = execute(a[0]);
372: if ((y->tval & (STR|NUM)) == (STR|NUM)) {
1.57 ! millert 373: setsval(frp->retval, getsval(y));
! 374: frp->retval->fval = getfval(y);
! 375: frp->retval->tval |= NUM;
1.1 tholo 376: }
377: else if (y->tval & STR)
1.57 ! millert 378: setsval(frp->retval, getsval(y));
1.1 tholo 379: else if (y->tval & NUM)
1.57 ! millert 380: setfval(frp->retval, getfval(y));
1.1 tholo 381: else /* can't happen */
1.16 millert 382: FATAL("bad type variable %d", y->tval);
1.1 tholo 383: tempfree(y);
384: }
385: return(jret);
386: case NEXT:
387: return(jnext);
388: case NEXTFILE:
389: nextfile();
390: return(jnextfile);
391: case BREAK:
392: return(jbreak);
393: case CONTINUE:
394: return(jcont);
395: default: /* can't happen */
1.16 millert 396: FATAL("illegal jump type %d", n);
1.1 tholo 397: }
398: return 0; /* not reached */
399: }
400:
1.31 millert 401: Cell *awkgetline(Node **a, int n) /* get next line from specific input */
1.1 tholo 402: { /* a[0] is variable, a[1] is operator, a[2] is filename */
403: Cell *r, *x;
1.13 kstailey 404: extern Cell **fldtab;
1.1 tholo 405: FILE *fp;
1.13 kstailey 406: char *buf;
407: int bufsize = recsize;
1.15 millert 408: int mode;
1.57 ! millert 409: bool newflag;
1.13 kstailey 410:
1.53 millert 411: if ((buf = malloc(bufsize)) == NULL)
1.16 millert 412: FATAL("out of memory in getline");
1.1 tholo 413:
414: fflush(stdout); /* in case someone is waiting for a prompt */
415: r = gettemp();
416: if (a[1] != NULL) { /* getline < file */
417: x = execute(a[2]); /* filename */
1.15 millert 418: mode = ptoi(a[1]);
419: if (mode == '|') /* input pipe */
420: mode = LE; /* arbitrary flag */
1.57 ! millert 421: fp = openfile(mode, getsval(x), &newflag);
1.1 tholo 422: tempfree(x);
423: if (fp == NULL)
424: n = -1;
425: else
1.57 ! millert 426: n = readrec(&buf, &bufsize, fp, newflag);
1.1 tholo 427: if (n <= 0) {
428: ;
429: } else if (a[0] != NULL) { /* getline var <file */
1.13 kstailey 430: x = execute(a[0]);
431: setsval(x, buf);
1.49 millert 432: if (is_number(x->sval)) {
433: x->fval = atof(x->sval);
434: x->tval |= NUM;
435: }
1.13 kstailey 436: tempfree(x);
1.1 tholo 437: } else { /* getline <file */
1.13 kstailey 438: setsval(fldtab[0], buf);
1.14 millert 439: if (is_number(fldtab[0]->sval)) {
1.13 kstailey 440: fldtab[0]->fval = atof(fldtab[0]->sval);
441: fldtab[0]->tval |= NUM;
1.1 tholo 442: }
443: }
444: } else { /* bare getline; use current input */
445: if (a[0] == NULL) /* getline */
1.54 millert 446: n = getrec(&record, &recsize, true);
1.1 tholo 447: else { /* getline var */
1.54 millert 448: n = getrec(&buf, &bufsize, false);
1.13 kstailey 449: x = execute(a[0]);
450: setsval(x, buf);
1.49 millert 451: if (is_number(x->sval)) {
452: x->fval = atof(x->sval);
453: x->tval |= NUM;
454: }
1.13 kstailey 455: tempfree(x);
1.1 tholo 456: }
457: }
458: setfval(r, (Awkfloat) n);
1.13 kstailey 459: free(buf);
1.1 tholo 460: return r;
461: }
462:
463: Cell *getnf(Node **a, int n) /* get NF */
464: {
1.54 millert 465: if (!donefld)
1.1 tholo 466: fldbld();
467: return (Cell *) a[0];
468: }
469:
1.53 millert 470: static char *
471: makearraystring(Node *p, const char *func)
1.1 tholo 472: {
1.13 kstailey 473: char *buf;
474: int bufsz = recsize;
1.53 millert 475: size_t blen, seplen;
476:
477: if ((buf = malloc(bufsz)) == NULL) {
478: FATAL("%s: out of memory", func);
479: }
1.13 kstailey 480:
1.53 millert 481: blen = 0;
482: buf[blen] = '\0';
483: seplen = strlen(getsval(subseploc));
484:
485: for (; p; p = p->nnext) {
486: Cell *x = execute(p); /* expr */
487: char *s = getsval(x);
488: size_t nsub = p->nnext ? seplen : 0;
489: size_t slen = strlen(s);
490: size_t tlen = blen + slen + nsub;
491:
492: if (!adjbuf(&buf, &bufsz, tlen + 1, recsize, 0, func)) {
493: FATAL("%s: out of memory %s[%s...]",
494: func, x->nval, buf);
495: }
496: memcpy(buf + blen, s, slen);
497: if (nsub) {
498: memcpy(buf + blen + slen, *SUBSEP, nsub);
499: }
500: buf[tlen] = '\0';
501: blen = tlen;
502: tempfree(x);
503: }
504: return buf;
505: }
506:
507: Cell *array(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
508: {
509: Cell *x, *z;
510: char *buf;
1.1 tholo 511:
512: x = execute(a[0]); /* Cell* for symbol table */
1.53 millert 513: buf = makearraystring(a[1], __func__);
1.1 tholo 514: if (!isarr(x)) {
1.42 deraadt 515: DPRINTF( ("making %s into an array\n", NN(x->nval)) );
1.1 tholo 516: if (freeable(x))
517: xfree(x->sval);
518: x->tval &= ~(STR|NUM|DONTFREE);
519: x->tval |= ARR;
520: x->sval = (char *) makesymtab(NSYMTAB);
521: }
522: z = setsymtab(buf, "", 0.0, STR|NUM, (Array *) x->sval);
523: z->ctype = OCELL;
524: z->csub = CVAR;
525: tempfree(x);
1.13 kstailey 526: free(buf);
1.1 tholo 527: return(z);
528: }
529:
1.14 millert 530: Cell *awkdelete(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
1.1 tholo 531: {
1.53 millert 532: Cell *x;
1.1 tholo 533:
534: x = execute(a[0]); /* Cell* for symbol table */
1.50 millert 535: if (x == symtabloc) {
536: FATAL("cannot delete SYMTAB or its elements");
537: }
1.1 tholo 538: if (!isarr(x))
1.15 millert 539: return True;
1.51 millert 540: if (a[1] == NULL) { /* delete the elements, not the table */
1.1 tholo 541: freesymtab(x);
542: x->tval &= ~STR;
543: x->tval |= ARR;
544: x->sval = (char *) makesymtab(NSYMTAB);
545: } else {
1.53 millert 546: char *buf = makearraystring(a[1], __func__);
1.1 tholo 547: freeelem(x, buf);
1.13 kstailey 548: free(buf);
1.1 tholo 549: }
550: tempfree(x);
1.15 millert 551: return True;
1.1 tholo 552: }
553:
554: Cell *intest(Node **a, int n) /* a[0] is index (list), a[1] is symtab */
555: {
1.53 millert 556: Cell *ap, *k;
1.13 kstailey 557: char *buf;
1.1 tholo 558:
559: ap = execute(a[1]); /* array name */
560: if (!isarr(ap)) {
1.42 deraadt 561: DPRINTF( ("making %s into an array\n", ap->nval) );
1.1 tholo 562: if (freeable(ap))
563: xfree(ap->sval);
564: ap->tval &= ~(STR|NUM|DONTFREE);
565: ap->tval |= ARR;
566: ap->sval = (char *) makesymtab(NSYMTAB);
567: }
1.53 millert 568: buf = makearraystring(a[0], __func__);
1.1 tholo 569: k = lookup(buf, (Array *) ap->sval);
570: tempfree(ap);
1.13 kstailey 571: free(buf);
1.1 tholo 572: if (k == NULL)
1.15 millert 573: return(False);
1.1 tholo 574: else
1.15 millert 575: return(True);
1.1 tholo 576: }
577:
578:
579: Cell *matchop(Node **a, int n) /* ~ and match() */
580: {
581: Cell *x, *y;
582: char *s, *t;
583: int i;
584: fa *pfa;
1.18 millert 585: int (*mf)(fa *, const char *) = match, mode = 0;
1.1 tholo 586:
587: if (n == MATCHFCN) {
588: mf = pmatch;
589: mode = 1;
590: }
591: x = execute(a[1]); /* a[1] = target text */
592: s = getsval(x);
1.51 millert 593: if (a[0] == NULL) /* a[1] == 0: already-compiled reg expr */
1.1 tholo 594: i = (*mf)((fa *) a[2], s);
595: else {
596: y = execute(a[2]); /* a[2] = regular expr */
597: t = getsval(y);
598: pfa = makedfa(t, mode);
599: i = (*mf)(pfa, s);
600: tempfree(y);
601: }
602: tempfree(x);
603: if (n == MATCHFCN) {
604: int start = patbeg - s + 1;
605: if (patlen < 0)
606: start = 0;
607: setfval(rstartloc, (Awkfloat) start);
608: setfval(rlengthloc, (Awkfloat) patlen);
609: x = gettemp();
610: x->tval = NUM;
611: x->fval = start;
612: return x;
613: } else if ((n == MATCH && i == 1) || (n == NOTMATCH && i == 0))
1.15 millert 614: return(True);
1.1 tholo 615: else
1.15 millert 616: return(False);
1.1 tholo 617: }
618:
619:
620: Cell *boolop(Node **a, int n) /* a[0] || a[1], a[0] && a[1], !a[0] */
621: {
622: Cell *x, *y;
623: int i;
624:
625: x = execute(a[0]);
626: i = istrue(x);
627: tempfree(x);
628: switch (n) {
629: case BOR:
1.15 millert 630: if (i) return(True);
1.1 tholo 631: y = execute(a[1]);
632: i = istrue(y);
633: tempfree(y);
1.15 millert 634: if (i) return(True);
635: else return(False);
1.1 tholo 636: case AND:
1.15 millert 637: if ( !i ) return(False);
1.1 tholo 638: y = execute(a[1]);
639: i = istrue(y);
640: tempfree(y);
1.15 millert 641: if (i) return(True);
642: else return(False);
1.1 tholo 643: case NOT:
1.15 millert 644: if (i) return(False);
645: else return(True);
1.1 tholo 646: default: /* can't happen */
1.16 millert 647: FATAL("unknown boolean operator %d", n);
1.1 tholo 648: }
649: return 0; /*NOTREACHED*/
650: }
651:
652: Cell *relop(Node **a, int n) /* a[0 < a[1], etc. */
653: {
654: int i;
655: Cell *x, *y;
656: Awkfloat j;
657:
658: x = execute(a[0]);
659: y = execute(a[1]);
660: if (x->tval&NUM && y->tval&NUM) {
661: j = x->fval - y->fval;
662: i = j<0? -1: (j>0? 1: 0);
663: } else {
664: i = strcmp(getsval(x), getsval(y));
665: }
666: tempfree(x);
667: tempfree(y);
668: switch (n) {
1.15 millert 669: case LT: if (i<0) return(True);
670: else return(False);
671: case LE: if (i<=0) return(True);
672: else return(False);
673: case NE: if (i!=0) return(True);
674: else return(False);
675: case EQ: if (i == 0) return(True);
676: else return(False);
677: case GE: if (i>=0) return(True);
678: else return(False);
679: case GT: if (i>0) return(True);
680: else return(False);
1.1 tholo 681: default: /* can't happen */
1.16 millert 682: FATAL("unknown relational operator %d", n);
1.1 tholo 683: }
684: return 0; /*NOTREACHED*/
685: }
686:
687: void tfree(Cell *a) /* free a tempcell */
688: {
1.13 kstailey 689: if (freeable(a)) {
1.42 deraadt 690: DPRINTF( ("freeing %s %s %o\n", NN(a->nval), NN(a->sval), a->tval) );
1.1 tholo 691: xfree(a->sval);
1.13 kstailey 692: }
1.1 tholo 693: if (a == tmps)
1.16 millert 694: FATAL("tempcell list is curdled");
1.1 tholo 695: a->cnext = tmps;
696: tmps = a;
697: }
698:
699: Cell *gettemp(void) /* get a tempcell */
700: { int i;
701: Cell *x;
702:
703: if (!tmps) {
1.53 millert 704: tmps = calloc(100, sizeof(*tmps));
1.1 tholo 705: if (!tmps)
1.16 millert 706: FATAL("out of space for temporaries");
1.52 millert 707: for (i = 1; i < 100; i++)
1.1 tholo 708: tmps[i-1].cnext = &tmps[i];
1.51 millert 709: tmps[i-1].cnext = NULL;
1.1 tholo 710: }
711: x = tmps;
712: tmps = x->cnext;
713: *x = tempcell;
714: return(x);
715: }
716:
717: Cell *indirect(Node **a, int n) /* $( a[0] ) */
718: {
1.25 millert 719: Awkfloat val;
1.1 tholo 720: Cell *x;
721: int m;
722: char *s;
723:
724: x = execute(a[0]);
1.25 millert 725: val = getfval(x); /* freebsd: defend against super large field numbers */
726: if ((Awkfloat)INT_MAX < val)
727: FATAL("trying to access out of range field %s", x->nval);
728: m = (int) val;
1.14 millert 729: if (m == 0 && !is_number(s = getsval(x))) /* suspicion! */
1.16 millert 730: FATAL("illegal field $(%s), name \"%s\"", s, x->nval);
1.13 kstailey 731: /* BUG: can x->nval ever be null??? */
1.1 tholo 732: tempfree(x);
733: x = fieldadr(m);
1.13 kstailey 734: x->ctype = OCELL; /* BUG? why are these needed? */
1.1 tholo 735: x->csub = CFLD;
736: return(x);
737: }
738:
739: Cell *substr(Node **a, int nnn) /* substr(a[0], a[1], a[2]) */
740: {
741: int k, m, n;
742: char *s;
743: int temp;
1.51 millert 744: Cell *x, *y, *z = NULL;
1.1 tholo 745:
746: x = execute(a[0]);
747: y = execute(a[1]);
1.51 millert 748: if (a[2] != NULL)
1.1 tholo 749: z = execute(a[2]);
750: s = getsval(x);
751: k = strlen(s) + 1;
752: if (k <= 1) {
753: tempfree(x);
754: tempfree(y);
1.51 millert 755: if (a[2] != NULL) {
1.1 tholo 756: tempfree(z);
1.17 millert 757: }
1.1 tholo 758: x = gettemp();
759: setsval(x, "");
760: return(x);
761: }
1.14 millert 762: m = (int) getfval(y);
1.1 tholo 763: if (m <= 0)
764: m = 1;
765: else if (m > k)
766: m = k;
767: tempfree(y);
1.51 millert 768: if (a[2] != NULL) {
1.14 millert 769: n = (int) getfval(z);
1.1 tholo 770: tempfree(z);
771: } else
772: n = k - 1;
773: if (n < 0)
774: n = 0;
775: else if (n > k - m)
776: n = k - m;
1.42 deraadt 777: DPRINTF( ("substr: m=%d, n=%d, s=%s\n", m, n, s) );
1.1 tholo 778: y = gettemp();
779: temp = s[n+m-1]; /* with thanks to John Linderman */
780: s[n+m-1] = '\0';
781: setsval(y, s + m - 1);
782: s[n+m-1] = temp;
783: tempfree(x);
784: return(y);
785: }
786:
787: Cell *sindex(Node **a, int nnn) /* index(a[0], a[1]) */
788: {
789: Cell *x, *y, *z;
790: char *s1, *s2, *p1, *p2, *q;
791: Awkfloat v = 0.0;
792:
793: x = execute(a[0]);
794: s1 = getsval(x);
795: y = execute(a[1]);
796: s2 = getsval(y);
797:
798: z = gettemp();
799: for (p1 = s1; *p1 != '\0'; p1++) {
1.57 ! millert 800: for (q = p1, p2 = s2; *p2 != '\0' && *q == *p2; q++, p2++)
! 801: continue;
1.1 tholo 802: if (*p2 == '\0') {
803: v = (Awkfloat) (p1 - s1 + 1); /* origin 1 */
804: break;
805: }
806: }
807: tempfree(x);
808: tempfree(y);
809: setfval(z, v);
810: return(z);
811: }
812:
1.13 kstailey 813: #define MAXNUMSIZE 50
814:
1.18 millert 815: int format(char **pbuf, int *pbufsize, const char *s, Node *a) /* printf-like conversions */
1.1 tholo 816: {
1.13 kstailey 817: char *fmt;
1.18 millert 818: char *p, *t;
819: const char *os;
1.1 tholo 820: Cell *x;
1.10 kstailey 821: int flag = 0, n;
1.13 kstailey 822: int fmtwd; /* format width */
823: int fmtsz = recsize;
824: char *buf = *pbuf;
825: int bufsize = *pbufsize;
1.53 millert 826: #define FMTSZ(a) (fmtsz - ((a) - fmt))
827: #define BUFSZ(a) (bufsize - ((a) - buf))
1.1 tholo 828:
1.54 millert 829: static bool first = true;
830: static bool have_a_format = false;
1.47 millert 831:
832: if (first) {
1.57 ! millert 833: char xbuf[100];
1.47 millert 834:
1.57 ! millert 835: snprintf(xbuf, sizeof(xbuf), "%a", 42.0);
! 836: have_a_format = (strcmp(xbuf, "0x1.5p+5") == 0);
1.54 millert 837: first = false;
1.47 millert 838: }
839:
1.1 tholo 840: os = s;
841: p = buf;
1.53 millert 842: if ((fmt = malloc(fmtsz)) == NULL)
1.16 millert 843: FATAL("out of memory in format()");
1.1 tholo 844: while (*s) {
1.30 millert 845: adjbuf(&buf, &bufsize, MAXNUMSIZE+1+p-buf, recsize, &p, "format1");
1.1 tholo 846: if (*s != '%') {
847: *p++ = *s++;
848: continue;
849: }
850: if (*(s+1) == '%') {
851: *p++ = '%';
852: s += 2;
853: continue;
854: }
1.13 kstailey 855: /* have to be real careful in case this is a huge number, eg, %100000d */
856: fmtwd = atoi(s+1);
857: if (fmtwd < 0)
858: fmtwd = -fmtwd;
1.30 millert 859: adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format2");
1.13 kstailey 860: for (t = fmt; (*t++ = *s) != '\0'; s++) {
1.30 millert 861: if (!adjbuf(&fmt, &fmtsz, MAXNUMSIZE+1+t-fmt, recsize, &t, "format3"))
1.16 millert 862: FATAL("format item %.30s... ran format() out of memory", os);
1.55 millert 863: /* Ignore size specifiers */
864: if (strchr("hjLlqtz", *s) != NULL) { /* the ansi panoply */
865: t--;
866: continue;
867: }
868: if (isalpha((uschar)*s))
869: break;
1.48 millert 870: if (*s == '$') {
871: FATAL("'$' not permitted in awk formats");
872: }
1.1 tholo 873: if (*s == '*') {
1.49 millert 874: if (a == NULL) {
1.27 deraadt 875: FATAL("not enough args in printf(%s)", os);
1.49 millert 876: }
1.1 tholo 877: x = execute(a);
878: a = a->nnext;
1.53 millert 879: snprintf(t - 1, FMTSZ(t - 1),
880: "%d", fmtwd=(int) getfval(x));
1.13 kstailey 881: if (fmtwd < 0)
882: fmtwd = -fmtwd;
883: adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format");
1.1 tholo 884: t = fmt + strlen(fmt);
885: tempfree(x);
886: }
887: }
888: *t = '\0';
1.13 kstailey 889: if (fmtwd < 0)
890: fmtwd = -fmtwd;
1.30 millert 891: adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format4");
1.1 tholo 892: switch (*s) {
1.47 millert 893: case 'a': case 'A':
894: if (have_a_format)
895: flag = *s;
896: else
897: flag = 'f';
898: break;
1.1 tholo 899: case 'f': case 'e': case 'g': case 'E': case 'G':
1.18 millert 900: flag = 'f';
1.1 tholo 901: break;
1.55 millert 902: case 'd': case 'i': case 'o': case 'x': case 'X': case 'u':
903: flag = (*s == 'd' || *s == 'i') ? 'd' : 'u';
1.53 millert 904: *(t-1) = 'j';
905: *t = *s;
906: *++t = '\0';
1.1 tholo 907: break;
908: case 's':
1.18 millert 909: flag = 's';
1.1 tholo 910: break;
911: case 'c':
1.18 millert 912: flag = 'c';
1.1 tholo 913: break;
914: default:
1.16 millert 915: WARNING("weird printf conversion %s", fmt);
1.18 millert 916: flag = '?';
1.1 tholo 917: break;
918: }
919: if (a == NULL)
1.16 millert 920: FATAL("not enough args in printf(%s)", os);
1.1 tholo 921: x = execute(a);
922: a = a->nnext;
1.13 kstailey 923: n = MAXNUMSIZE;
924: if (fmtwd > n)
925: n = fmtwd;
1.30 millert 926: adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, "format5");
1.1 tholo 927: switch (flag) {
1.21 tedu 928: case '?': /* unknown, so dump it too */
1.53 millert 929: snprintf(p, BUFSZ(p), "%s", fmt);
1.13 kstailey 930: t = getsval(x);
931: n = strlen(t);
932: if (fmtwd > n)
933: n = fmtwd;
1.30 millert 934: adjbuf(&buf, &bufsize, 1+strlen(p)+n+p-buf, recsize, &p, "format6");
1.5 kstailey 935: p += strlen(p);
1.53 millert 936: snprintf(p, BUFSZ(p), "%s", t);
1.1 tholo 937: break;
1.47 millert 938: case 'a':
939: case 'A':
1.53 millert 940: case 'f': snprintf(p, BUFSZ(p), fmt, getfval(x)); break;
1.55 millert 941: case 'd': snprintf(p, BUFSZ(p), fmt, (intmax_t) getfval(x)); break;
942: case 'u': snprintf(p, BUFSZ(p), fmt, (uintmax_t) getfval(x)); break;
1.18 millert 943: case 's':
1.1 tholo 944: t = getsval(x);
945: n = strlen(t);
1.13 kstailey 946: if (fmtwd > n)
947: n = fmtwd;
1.30 millert 948: if (!adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, "format7"))
1.16 millert 949: FATAL("huge string/format (%d chars) in printf %.30s... ran format() out of memory", n, t);
1.53 millert 950: snprintf(p, BUFSZ(p), fmt, t);
1.1 tholo 951: break;
1.18 millert 952: case 'c':
1.13 kstailey 953: if (isnum(x)) {
1.36 millert 954: if ((int)getfval(x))
1.53 millert 955: snprintf(p, BUFSZ(p), fmt, (int) getfval(x));
1.18 millert 956: else {
957: *p++ = '\0'; /* explicit null byte */
958: *p = '\0'; /* next output will start here */
959: }
1.13 kstailey 960: } else
1.53 millert 961: snprintf(p, BUFSZ(p), fmt, getsval(x)[0]);
1.1 tholo 962: break;
1.18 millert 963: default:
964: FATAL("can't happen: bad conversion %c in format()", flag);
1.1 tholo 965: }
966: tempfree(x);
1.5 kstailey 967: p += strlen(p);
1.1 tholo 968: s++;
969: }
970: *p = '\0';
1.13 kstailey 971: free(fmt);
1.1 tholo 972: for ( ; a; a = a->nnext) /* evaluate any remaining args */
973: execute(a);
1.13 kstailey 974: *pbuf = buf;
975: *pbufsize = bufsize;
976: return p - buf;
1.1 tholo 977: }
978:
979: Cell *awksprintf(Node **a, int n) /* sprintf(a[0]) */
980: {
981: Cell *x;
982: Node *y;
1.13 kstailey 983: char *buf;
984: int bufsz=3*recsize;
1.1 tholo 985:
1.53 millert 986: if ((buf = malloc(bufsz)) == NULL)
1.16 millert 987: FATAL("out of memory in awksprintf");
1.1 tholo 988: y = a[0]->nnext;
989: x = execute(a[0]);
1.13 kstailey 990: if (format(&buf, &bufsz, getsval(x), y) == -1)
1.16 millert 991: FATAL("sprintf string %.30s... too long. can't happen.", buf);
1.1 tholo 992: tempfree(x);
993: x = gettemp();
1.13 kstailey 994: x->sval = buf;
1.1 tholo 995: x->tval = STR;
996: return(x);
997: }
998:
999: Cell *awkprintf(Node **a, int n) /* printf */
1000: { /* a[0] is list of args, starting with format string */
1001: /* a[1] is redirection operator, a[2] is redirection file */
1002: FILE *fp;
1003: Cell *x;
1004: Node *y;
1.13 kstailey 1005: char *buf;
1.9 kstailey 1006: int len;
1.13 kstailey 1007: int bufsz=3*recsize;
1.1 tholo 1008:
1.53 millert 1009: if ((buf = malloc(bufsz)) == NULL)
1.16 millert 1010: FATAL("out of memory in awkprintf");
1.1 tholo 1011: y = a[0]->nnext;
1012: x = execute(a[0]);
1.13 kstailey 1013: if ((len = format(&buf, &bufsz, getsval(x), y)) == -1)
1.16 millert 1014: FATAL("printf string %.30s... too long. can't happen.", buf);
1.1 tholo 1015: tempfree(x);
1016: if (a[1] == NULL) {
1.13 kstailey 1017: /* fputs(buf, stdout); */
1.9 kstailey 1018: fwrite(buf, len, 1, stdout);
1.8 kstailey 1019: if (ferror(stdout))
1.16 millert 1020: FATAL("write error on stdout");
1.1 tholo 1021: } else {
1.15 millert 1022: fp = redirect(ptoi(a[1]), a[2]);
1.13 kstailey 1023: /* fputs(buf, fp); */
1.9 kstailey 1024: fwrite(buf, len, 1, fp);
1.8 kstailey 1025: fflush(fp);
1026: if (ferror(fp))
1.16 millert 1027: FATAL("write error on %s", filename(fp));
1.1 tholo 1028: }
1.13 kstailey 1029: free(buf);
1.15 millert 1030: return(True);
1.1 tholo 1031: }
1032:
1033: Cell *arith(Node **a, int n) /* a[0] + a[1], etc. also -a[0] */
1034: {
1035: Awkfloat i, j = 0;
1036: double v;
1037: Cell *x, *y, *z;
1038:
1039: x = execute(a[0]);
1040: i = getfval(x);
1041: tempfree(x);
1.47 millert 1042: if (n != UMINUS && n != UPLUS) {
1.1 tholo 1043: y = execute(a[1]);
1044: j = getfval(y);
1045: tempfree(y);
1046: }
1047: z = gettemp();
1048: switch (n) {
1049: case ADD:
1050: i += j;
1051: break;
1052: case MINUS:
1053: i -= j;
1054: break;
1055: case MULT:
1056: i *= j;
1057: break;
1058: case DIVIDE:
1059: if (j == 0)
1.16 millert 1060: FATAL("division by zero");
1.1 tholo 1061: i /= j;
1062: break;
1063: case MOD:
1064: if (j == 0)
1.16 millert 1065: FATAL("division by zero in mod");
1.1 tholo 1066: modf(i/j, &v);
1067: i = i - j * v;
1068: break;
1069: case UMINUS:
1070: i = -i;
1071: break;
1.57 ! millert 1072: case UPLUS: /* handled by getfval(), above */
1.47 millert 1073: break;
1.1 tholo 1074: case POWER:
1075: if (j >= 0 && modf(j, &v) == 0.0) /* pos integer exponent */
1.12 millert 1076: i = ipow(i, (int) j);
1.45 guenther 1077: else {
1078: errno = 0;
1.1 tholo 1079: i = errcheck(pow(i, j), "pow");
1.45 guenther 1080: }
1.1 tholo 1081: break;
1082: default: /* can't happen */
1.16 millert 1083: FATAL("illegal arithmetic operator %d", n);
1.1 tholo 1084: }
1085: setfval(z, i);
1086: return(z);
1087: }
1088:
1089: double ipow(double x, int n) /* x**n. ought to be done by pow, but isn't always */
1090: {
1091: double v;
1092:
1093: if (n <= 0)
1094: return 1;
1095: v = ipow(x, n/2);
1096: if (n % 2 == 0)
1097: return v * v;
1098: else
1099: return x * v * v;
1100: }
1101:
1102: Cell *incrdecr(Node **a, int n) /* a[0]++, etc. */
1103: {
1104: Cell *x, *z;
1105: int k;
1106: Awkfloat xf;
1107:
1108: x = execute(a[0]);
1109: xf = getfval(x);
1110: k = (n == PREINCR || n == POSTINCR) ? 1 : -1;
1111: if (n == PREINCR || n == PREDECR) {
1112: setfval(x, xf + k);
1113: return(x);
1114: }
1115: z = gettemp();
1116: setfval(z, xf);
1117: setfval(x, xf + k);
1118: tempfree(x);
1119: return(z);
1120: }
1121:
1122: Cell *assign(Node **a, int n) /* a[0] = a[1], a[0] += a[1], etc. */
1123: { /* this is subtle; don't muck with it. */
1124: Cell *x, *y;
1125: Awkfloat xf, yf;
1126: double v;
1127:
1128: y = execute(a[1]);
1129: x = execute(a[0]);
1130: if (n == ASSIGN) { /* ordinary assignment */
1.49 millert 1131: if (x == y && !(x->tval & (FLD|REC)) && x != nfloc)
1132: ; /* self-assignment: leave alone unless it's a field or NF */
1.1 tholo 1133: else if ((y->tval & (STR|NUM)) == (STR|NUM)) {
1134: setsval(x, getsval(y));
1135: x->fval = getfval(y);
1136: x->tval |= NUM;
1137: }
1.13 kstailey 1138: else if (isstr(y))
1.1 tholo 1139: setsval(x, getsval(y));
1.13 kstailey 1140: else if (isnum(y))
1.1 tholo 1141: setfval(x, getfval(y));
1142: else
1143: funnyvar(y, "read value of");
1144: tempfree(y);
1145: return(x);
1146: }
1147: xf = getfval(x);
1148: yf = getfval(y);
1149: switch (n) {
1150: case ADDEQ:
1151: xf += yf;
1152: break;
1153: case SUBEQ:
1154: xf -= yf;
1155: break;
1156: case MULTEQ:
1157: xf *= yf;
1158: break;
1159: case DIVEQ:
1160: if (yf == 0)
1.16 millert 1161: FATAL("division by zero in /=");
1.1 tholo 1162: xf /= yf;
1163: break;
1164: case MODEQ:
1165: if (yf == 0)
1.16 millert 1166: FATAL("division by zero in %%=");
1.1 tholo 1167: modf(xf/yf, &v);
1168: xf = xf - yf * v;
1169: break;
1170: case POWEQ:
1171: if (yf >= 0 && modf(yf, &v) == 0.0) /* pos integer exponent */
1.12 millert 1172: xf = ipow(xf, (int) yf);
1.45 guenther 1173: else {
1174: errno = 0;
1.1 tholo 1175: xf = errcheck(pow(xf, yf), "pow");
1.45 guenther 1176: }
1.1 tholo 1177: break;
1178: default:
1.16 millert 1179: FATAL("illegal assignment operator %d", n);
1.1 tholo 1180: break;
1181: }
1182: tempfree(y);
1183: setfval(x, xf);
1184: return(x);
1185: }
1186:
1187: Cell *cat(Node **a, int q) /* a[0] cat a[1] */
1188: {
1189: Cell *x, *y, *z;
1190: int n1, n2;
1.49 millert 1191: char *s = NULL;
1192: int ssz = 0;
1.1 tholo 1193:
1194: x = execute(a[0]);
1.49 millert 1195: n1 = strlen(getsval(x));
1196:
1.1 tholo 1197: y = execute(a[1]);
1.49 millert 1198: n2 = strlen(getsval(y));
1.53 millert 1199:
1200: adjbuf(&s, &ssz, n1 + n2 + 1, recsize, 0, "cat");
1201: memcpy(s, x->sval, n1);
1202: memcpy(s + n1, y->sval, n2);
1203: s[n1 + n2] = '\0';
1.49 millert 1204:
1.31 millert 1205: tempfree(x);
1.1 tholo 1206: tempfree(y);
1.49 millert 1207:
1.1 tholo 1208: z = gettemp();
1209: z->sval = s;
1210: z->tval = STR;
1.49 millert 1211:
1.1 tholo 1212: return(z);
1213: }
1214:
1215: Cell *pastat(Node **a, int n) /* a[0] { a[1] } */
1216: {
1217: Cell *x;
1218:
1.51 millert 1219: if (a[0] == NULL)
1.1 tholo 1220: x = execute(a[1]);
1221: else {
1222: x = execute(a[0]);
1223: if (istrue(x)) {
1224: tempfree(x);
1225: x = execute(a[1]);
1226: }
1227: }
1228: return x;
1229: }
1230:
1231: Cell *dopa2(Node **a, int n) /* a[0], a[1] { a[2] } */
1232: {
1233: Cell *x;
1234: int pair;
1235:
1.15 millert 1236: pair = ptoi(a[3]);
1.1 tholo 1237: if (pairstack[pair] == 0) {
1238: x = execute(a[0]);
1239: if (istrue(x))
1240: pairstack[pair] = 1;
1241: tempfree(x);
1242: }
1243: if (pairstack[pair] == 1) {
1244: x = execute(a[1]);
1245: if (istrue(x))
1246: pairstack[pair] = 0;
1247: tempfree(x);
1248: x = execute(a[2]);
1249: return(x);
1250: }
1.15 millert 1251: return(False);
1.1 tholo 1252: }
1253:
1254: Cell *split(Node **a, int nnn) /* split(a[0], a[1], a[2]); a[3] is type */
1255: {
1.51 millert 1256: Cell *x = NULL, *y, *ap;
1.53 millert 1257: const char *s, *origs, *t;
1.56 millert 1258: const char *fs = NULL;
1259: char *origfs = NULL;
1.1 tholo 1260: int sep;
1.53 millert 1261: char temp, num[50];
1.15 millert 1262: int n, tempstat, arg3type;
1.1 tholo 1263:
1264: y = execute(a[0]); /* source string */
1.43 fcambus 1265: origs = s = strdup(getsval(y));
1.44 fcambus 1266: if (s == NULL)
1267: FATAL("out of space in split");
1.15 millert 1268: arg3type = ptoi(a[3]);
1.51 millert 1269: if (a[2] == NULL) /* fs string */
1.49 millert 1270: fs = getsval(fsloc);
1.15 millert 1271: else if (arg3type == STRING) { /* split(str,arr,"string") */
1.1 tholo 1272: x = execute(a[2]);
1.56 millert 1273: fs = origfs = strdup(getsval(x));
1.49 millert 1274: if (fs == NULL)
1275: FATAL("out of space in split");
1276: tempfree(x);
1.15 millert 1277: } else if (arg3type == REGEXPR)
1.13 kstailey 1278: fs = "(regexpr)"; /* split(str,arr,/regexpr/) */
1.1 tholo 1279: else
1.16 millert 1280: FATAL("illegal type of split");
1.1 tholo 1281: sep = *fs;
1282: ap = execute(a[1]); /* array name */
1283: freesymtab(ap);
1.42 deraadt 1284: DPRINTF( ("split: s=|%s|, a=%s, sep=|%s|\n", s, NN(ap->nval), fs) );
1.1 tholo 1285: ap->tval &= ~STR;
1286: ap->tval |= ARR;
1287: ap->sval = (char *) makesymtab(NSYMTAB);
1288:
1289: n = 0;
1.33 millert 1290: if (arg3type == REGEXPR && strlen((char*)((fa*)a[2])->restr) == 0) {
1291: /* split(s, a, //); have to arrange that it looks like empty sep */
1292: arg3type = 0;
1293: fs = "";
1294: sep = 0;
1295: }
1.25 millert 1296: if (*s != '\0' && (strlen(fs) > 1 || arg3type == REGEXPR)) { /* reg expr */
1.1 tholo 1297: fa *pfa;
1.15 millert 1298: if (arg3type == REGEXPR) { /* it's ready already */
1.1 tholo 1299: pfa = (fa *) a[2];
1300: } else {
1301: pfa = makedfa(fs, 1);
1302: }
1303: if (nematch(pfa,s)) {
1304: tempstat = pfa->initstat;
1305: pfa->initstat = 2;
1306: do {
1307: n++;
1.53 millert 1308: snprintf(num, sizeof(num), "%d", n);
1.1 tholo 1309: temp = *patbeg;
1.53 millert 1310: setptr(patbeg, '\0');
1.14 millert 1311: if (is_number(s))
1.13 kstailey 1312: setsymtab(num, s, atof(s), STR|NUM, (Array *) ap->sval);
1.1 tholo 1313: else
1314: setsymtab(num, s, 0.0, STR, (Array *) ap->sval);
1.53 millert 1315: setptr(patbeg, temp);
1.1 tholo 1316: s = patbeg + patlen;
1.57 ! millert 1317: if (*(patbeg+patlen-1) == '\0' || *s == '\0') {
1.1 tholo 1318: n++;
1.53 millert 1319: snprintf(num, sizeof(num), "%d", n);
1.1 tholo 1320: setsymtab(num, "", 0.0, STR, (Array *) ap->sval);
1321: pfa->initstat = tempstat;
1322: goto spdone;
1323: }
1324: } while (nematch(pfa,s));
1.25 millert 1325: pfa->initstat = tempstat; /* bwk: has to be here to reset */
1326: /* cf gsub and refldbld */
1.1 tholo 1327: }
1328: n++;
1.53 millert 1329: snprintf(num, sizeof(num), "%d", n);
1.14 millert 1330: if (is_number(s))
1.13 kstailey 1331: setsymtab(num, s, atof(s), STR|NUM, (Array *) ap->sval);
1.1 tholo 1332: else
1333: setsymtab(num, s, 0.0, STR, (Array *) ap->sval);
1334: spdone:
1335: pfa = NULL;
1336: } else if (sep == ' ') {
1337: for (n = 0; ; ) {
1.57 ! millert 1338: #define ISWS(c) ((c) == ' ' || (c) == '\t' || (c) == '\n')
! 1339: while (ISWS(*s))
1.1 tholo 1340: s++;
1.57 ! millert 1341: if (*s == '\0')
1.1 tholo 1342: break;
1343: n++;
1344: t = s;
1345: do
1346: s++;
1.57 ! millert 1347: while (*s != '\0' && !ISWS(*s));
1.1 tholo 1348: temp = *s;
1.53 millert 1349: setptr(s, '\0');
1350: snprintf(num, sizeof(num), "%d", n);
1.14 millert 1351: if (is_number(t))
1.13 kstailey 1352: setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1.1 tholo 1353: else
1354: setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1.53 millert 1355: setptr(s, temp);
1.57 ! millert 1356: if (*s != '\0')
1.1 tholo 1357: s++;
1358: }
1359: } else if (sep == 0) { /* new: split(s, a, "") => 1 char/elem */
1.57 ! millert 1360: for (n = 0; *s != '\0'; s++) {
1.1 tholo 1361: char buf[2];
1362: n++;
1.53 millert 1363: snprintf(num, sizeof(num), "%d", n);
1.1 tholo 1364: buf[0] = *s;
1.57 ! millert 1365: buf[1] = '\0';
1.17 millert 1366: if (isdigit((uschar)buf[0]))
1.1 tholo 1367: setsymtab(num, buf, atof(buf), STR|NUM, (Array *) ap->sval);
1368: else
1369: setsymtab(num, buf, 0.0, STR, (Array *) ap->sval);
1370: }
1.57 ! millert 1371: } else if (*s != '\0') {
1.1 tholo 1372: for (;;) {
1373: n++;
1374: t = s;
1375: while (*s != sep && *s != '\n' && *s != '\0')
1376: s++;
1377: temp = *s;
1.53 millert 1378: setptr(s, '\0');
1379: snprintf(num, sizeof(num), "%d", n);
1.14 millert 1380: if (is_number(t))
1.13 kstailey 1381: setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1.1 tholo 1382: else
1383: setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1.53 millert 1384: setptr(s, temp);
1.57 ! millert 1385: if (*s++ == '\0')
1.1 tholo 1386: break;
1387: }
1388: }
1389: tempfree(ap);
1390: tempfree(y);
1.53 millert 1391: xfree(origs);
1392: xfree(origfs);
1.1 tholo 1393: x = gettemp();
1394: x->tval = NUM;
1395: x->fval = n;
1396: return(x);
1397: }
1398:
1399: Cell *condexpr(Node **a, int n) /* a[0] ? a[1] : a[2] */
1400: {
1401: Cell *x;
1402:
1403: x = execute(a[0]);
1404: if (istrue(x)) {
1405: tempfree(x);
1406: x = execute(a[1]);
1407: } else {
1408: tempfree(x);
1409: x = execute(a[2]);
1410: }
1411: return(x);
1412: }
1413:
1414: Cell *ifstat(Node **a, int n) /* if (a[0]) a[1]; else a[2] */
1415: {
1416: Cell *x;
1417:
1418: x = execute(a[0]);
1419: if (istrue(x)) {
1420: tempfree(x);
1421: x = execute(a[1]);
1.51 millert 1422: } else if (a[2] != NULL) {
1.1 tholo 1423: tempfree(x);
1424: x = execute(a[2]);
1425: }
1426: return(x);
1427: }
1428:
1429: Cell *whilestat(Node **a, int n) /* while (a[0]) a[1] */
1430: {
1431: Cell *x;
1432:
1433: for (;;) {
1434: x = execute(a[0]);
1435: if (!istrue(x))
1436: return(x);
1437: tempfree(x);
1438: x = execute(a[1]);
1439: if (isbreak(x)) {
1.15 millert 1440: x = True;
1.1 tholo 1441: return(x);
1442: }
1443: if (isnext(x) || isexit(x) || isret(x))
1444: return(x);
1445: tempfree(x);
1446: }
1447: }
1448:
1449: Cell *dostat(Node **a, int n) /* do a[0]; while(a[1]) */
1450: {
1451: Cell *x;
1452:
1453: for (;;) {
1454: x = execute(a[0]);
1455: if (isbreak(x))
1.15 millert 1456: return True;
1.17 millert 1457: if (isnext(x) || isexit(x) || isret(x))
1.1 tholo 1458: return(x);
1459: tempfree(x);
1460: x = execute(a[1]);
1461: if (!istrue(x))
1462: return(x);
1463: tempfree(x);
1464: }
1465: }
1466:
1467: Cell *forstat(Node **a, int n) /* for (a[0]; a[1]; a[2]) a[3] */
1468: {
1469: Cell *x;
1470:
1471: x = execute(a[0]);
1472: tempfree(x);
1473: for (;;) {
1.51 millert 1474: if (a[1]!=NULL) {
1.1 tholo 1475: x = execute(a[1]);
1476: if (!istrue(x)) return(x);
1477: else tempfree(x);
1478: }
1479: x = execute(a[3]);
1480: if (isbreak(x)) /* turn off break */
1.15 millert 1481: return True;
1.1 tholo 1482: if (isnext(x) || isexit(x) || isret(x))
1483: return(x);
1484: tempfree(x);
1485: x = execute(a[2]);
1486: tempfree(x);
1487: }
1488: }
1489:
1490: Cell *instat(Node **a, int n) /* for (a[0] in a[1]) a[2] */
1491: {
1492: Cell *x, *vp, *arrayp, *cp, *ncp;
1493: Array *tp;
1494: int i;
1495:
1496: vp = execute(a[0]);
1497: arrayp = execute(a[1]);
1498: if (!isarr(arrayp)) {
1.15 millert 1499: return True;
1.1 tholo 1500: }
1501: tp = (Array *) arrayp->sval;
1502: tempfree(arrayp);
1503: for (i = 0; i < tp->size; i++) { /* this routine knows too much */
1504: for (cp = tp->tab[i]; cp != NULL; cp = ncp) {
1505: setsval(vp, cp->nval);
1506: ncp = cp->cnext;
1507: x = execute(a[2]);
1508: if (isbreak(x)) {
1509: tempfree(vp);
1.15 millert 1510: return True;
1.1 tholo 1511: }
1512: if (isnext(x) || isexit(x) || isret(x)) {
1513: tempfree(vp);
1514: return(x);
1515: }
1516: tempfree(x);
1517: }
1518: }
1.15 millert 1519: return True;
1.1 tholo 1520: }
1521:
1.57 ! millert 1522: static char *nawk_convert(const char *s, int (*fun_c)(int),
! 1523: wint_t (*fun_wc)(wint_t))
! 1524: {
! 1525: char *buf = NULL;
! 1526: char *pbuf = NULL;
! 1527: const char *ps = NULL;
! 1528: size_t n = 0;
! 1529: mbstate_t mbs, mbs2;
! 1530: wchar_t wc;
! 1531: size_t sz = MB_CUR_MAX;
! 1532:
! 1533: if (sz == 1) {
! 1534: buf = tostring(s);
! 1535:
! 1536: for (pbuf = buf; *pbuf; pbuf++)
! 1537: *pbuf = fun_c((uschar)*pbuf);
! 1538:
! 1539: return buf;
! 1540: } else {
! 1541: /* upper/lower character may be shorter/longer */
! 1542: buf = tostringN(s, strlen(s) * sz + 1);
! 1543:
! 1544: memset(&mbs, 0, sizeof(mbs));
! 1545: memset(&mbs2, 0, sizeof(mbs2));
! 1546:
! 1547: ps = s;
! 1548: pbuf = buf;
! 1549: while (n = mbrtowc(&wc, ps, sz, &mbs),
! 1550: n > 0 && n != (size_t)-1 && n != (size_t)-2)
! 1551: {
! 1552: ps += n;
! 1553:
! 1554: n = wcrtomb(pbuf, fun_wc(wc), &mbs2);
! 1555: if (n == (size_t)-1)
! 1556: FATAL("illegal wide character %s", s);
! 1557:
! 1558: pbuf += n;
! 1559: }
! 1560:
! 1561: *pbuf = '\0';
! 1562:
! 1563: if (n)
! 1564: FATAL("illegal byte sequence %s", s);
! 1565:
! 1566: return buf;
! 1567: }
! 1568: }
! 1569:
! 1570: static char *nawk_toupper(const char *s)
! 1571: {
! 1572: return nawk_convert(s, toupper, towupper);
! 1573: }
! 1574:
! 1575: static char *nawk_tolower(const char *s)
! 1576: {
! 1577: return nawk_convert(s, tolower, towlower);
! 1578: }
! 1579:
1.1 tholo 1580: Cell *bltin(Node **a, int n) /* builtin functions. a[0] is type, a[1] is arg list */
1581: {
1582: Cell *x, *y;
1583: Awkfloat u;
1584: int t;
1.33 millert 1585: Awkfloat tmp;
1.57 ! millert 1586: char *buf;
1.1 tholo 1587: Node *nextarg;
1588: FILE *fp;
1.47 millert 1589: int status = 0;
1.1 tholo 1590:
1.15 millert 1591: t = ptoi(a[0]);
1.1 tholo 1592: x = execute(a[1]);
1593: nextarg = a[1]->nnext;
1594: switch (t) {
1595: case FLENGTH:
1.18 millert 1596: if (isarr(x))
1597: u = ((Array *) x->sval)->nelem; /* GROT. should be function*/
1598: else
1599: u = strlen(getsval(x));
1600: break;
1.1 tholo 1601: case FLOG:
1.45 guenther 1602: errno = 0;
1.1 tholo 1603: u = errcheck(log(getfval(x)), "log"); break;
1604: case FINT:
1605: modf(getfval(x), &u); break;
1606: case FEXP:
1.45 guenther 1607: errno = 0;
1.1 tholo 1608: u = errcheck(exp(getfval(x)), "exp"); break;
1609: case FSQRT:
1.45 guenther 1610: errno = 0;
1.1 tholo 1611: u = errcheck(sqrt(getfval(x)), "sqrt"); break;
1612: case FSIN:
1613: u = sin(getfval(x)); break;
1614: case FCOS:
1615: u = cos(getfval(x)); break;
1616: case FATAN:
1.51 millert 1617: if (nextarg == NULL) {
1.16 millert 1618: WARNING("atan2 requires two arguments; returning 1.0");
1.1 tholo 1619: u = 1.0;
1620: } else {
1621: y = execute(a[1]->nnext);
1622: u = atan2(getfval(x), getfval(y));
1623: tempfree(y);
1624: nextarg = nextarg->nnext;
1625: }
1.29 pyr 1626: break;
1627: case FCOMPL:
1628: u = ~((int)getfval(x));
1629: break;
1630: case FAND:
1631: if (nextarg == 0) {
1632: WARNING("and requires two arguments; returning 0");
1633: u = 0;
1634: break;
1635: }
1636: y = execute(a[1]->nnext);
1637: u = ((int)getfval(x)) & ((int)getfval(y));
1638: tempfree(y);
1639: nextarg = nextarg->nnext;
1640: break;
1641: case FFOR:
1642: if (nextarg == 0) {
1643: WARNING("or requires two arguments; returning 0");
1644: u = 0;
1645: break;
1646: }
1647: y = execute(a[1]->nnext);
1648: u = ((int)getfval(x)) | ((int)getfval(y));
1649: tempfree(y);
1650: nextarg = nextarg->nnext;
1651: break;
1652: case FXOR:
1653: if (nextarg == 0) {
1.41 ajacouto 1654: WARNING("xor requires two arguments; returning 0");
1.29 pyr 1655: u = 0;
1656: break;
1657: }
1658: y = execute(a[1]->nnext);
1659: u = ((int)getfval(x)) ^ ((int)getfval(y));
1660: tempfree(y);
1661: nextarg = nextarg->nnext;
1662: break;
1663: case FLSHIFT:
1664: if (nextarg == 0) {
1.41 ajacouto 1665: WARNING("lshift requires two arguments; returning 0");
1.29 pyr 1666: u = 0;
1667: break;
1668: }
1669: y = execute(a[1]->nnext);
1670: u = ((int)getfval(x)) << ((int)getfval(y));
1671: tempfree(y);
1672: nextarg = nextarg->nnext;
1673: break;
1674: case FRSHIFT:
1675: if (nextarg == 0) {
1.41 ajacouto 1676: WARNING("rshift requires two arguments; returning 0");
1.29 pyr 1677: u = 0;
1678: break;
1679: }
1680: y = execute(a[1]->nnext);
1681: u = ((int)getfval(x)) >> ((int)getfval(y));
1682: tempfree(y);
1683: nextarg = nextarg->nnext;
1.1 tholo 1684: break;
1685: case FSYSTEM:
1686: fflush(stdout); /* in case something is buffered already */
1.47 millert 1687: status = system(getsval(x));
1688: u = status;
1689: if (status != -1) {
1690: if (WIFEXITED(status)) {
1691: u = WEXITSTATUS(status);
1692: } else if (WIFSIGNALED(status)) {
1693: u = WTERMSIG(status) + 256;
1694: #ifdef WCOREDUMP
1695: if (WCOREDUMP(status))
1696: u += 256;
1697: #endif
1698: } else /* something else?!? */
1699: u = 0;
1700: }
1.1 tholo 1701: break;
1702: case FRAND:
1.51 millert 1703: /* random() returns numbers in [0..2^31-1]
1704: * in order to get a number in [0, 1), divide it by 2^31
1705: */
1706: u = (Awkfloat) random() / (0x7fffffffL + 0x1UL);
1.1 tholo 1707: break;
1708: case FSRAND:
1.39 deraadt 1709: if (isrec(x)) { /* no argument provided */
1710: u = time(NULL);
1711: tmp = u;
1712: srandom((unsigned int) u);
1713: } else {
1.33 millert 1714: u = getfval(x);
1715: tmp = u;
1.37 deraadt 1716: srandom_deterministic((unsigned int) u);
1.24 millert 1717: }
1.39 deraadt 1718: u = srand_seed;
1719: srand_seed = tmp;
1.1 tholo 1720: break;
1721: case FTOUPPER:
1722: case FTOLOWER:
1.57 ! millert 1723: if (t == FTOUPPER)
! 1724: buf = nawk_toupper(getsval(x));
! 1725: else
! 1726: buf = nawk_tolower(getsval(x));
1.1 tholo 1727: tempfree(x);
1728: x = gettemp();
1729: setsval(x, buf);
1.13 kstailey 1730: free(buf);
1.1 tholo 1731: return x;
1732: case FFLUSH:
1.18 millert 1733: if (isrec(x) || strlen(getsval(x)) == 0) {
1734: flush_all(); /* fflush() or fflush("") -> all */
1735: u = 0;
1.57 ! millert 1736: } else if ((fp = openfile(FFLUSH, getsval(x), NULL)) == NULL)
1.1 tholo 1737: u = EOF;
1738: else
1739: u = fflush(fp);
1740: break;
1741: default: /* can't happen */
1.16 millert 1742: FATAL("illegal function type %d", t);
1.1 tholo 1743: break;
1744: }
1745: tempfree(x);
1746: x = gettemp();
1747: setfval(x, u);
1.51 millert 1748: if (nextarg != NULL) {
1.16 millert 1749: WARNING("warning: function has too many arguments");
1.1 tholo 1750: for ( ; nextarg; nextarg = nextarg->nnext)
1751: execute(nextarg);
1752: }
1753: return(x);
1754: }
1755:
1756: Cell *printstat(Node **a, int n) /* print a[0] */
1757: {
1758: Node *x;
1759: Cell *y;
1760: FILE *fp;
1761:
1.51 millert 1762: if (a[1] == NULL) /* a[1] is redirection operator, a[2] is file */
1.1 tholo 1763: fp = stdout;
1764: else
1.15 millert 1765: fp = redirect(ptoi(a[1]), a[2]);
1.1 tholo 1766: for (x = a[0]; x != NULL; x = x->nnext) {
1767: y = execute(x);
1.18 millert 1768: fputs(getpssval(y), fp);
1.1 tholo 1769: tempfree(y);
1770: if (x->nnext == NULL)
1.49 millert 1771: fputs(getsval(orsloc), fp);
1.1 tholo 1772: else
1.49 millert 1773: fputs(getsval(ofsloc), fp);
1.1 tholo 1774: }
1.51 millert 1775: if (a[1] != NULL)
1.1 tholo 1776: fflush(fp);
1777: if (ferror(fp))
1.16 millert 1778: FATAL("write error on %s", filename(fp));
1.15 millert 1779: return(True);
1.1 tholo 1780: }
1781:
1782: Cell *nullproc(Node **a, int n)
1783: {
1784: return 0;
1785: }
1786:
1787:
1788: FILE *redirect(int a, Node *b) /* set up all i/o redirections */
1789: {
1790: FILE *fp;
1791: Cell *x;
1792: char *fname;
1793:
1794: x = execute(b);
1795: fname = getsval(x);
1.57 ! millert 1796: fp = openfile(a, fname, NULL);
1.1 tholo 1797: if (fp == NULL)
1.16 millert 1798: FATAL("can't open file %s", fname);
1.1 tholo 1799: tempfree(x);
1800: return fp;
1801: }
1802:
1803: struct files {
1804: FILE *fp;
1.18 millert 1805: const char *fname;
1.1 tholo 1806: int mode; /* '|', 'a', 'w' => LE/LT, GT */
1.33 millert 1807: } *files;
1808:
1.57 ! millert 1809: size_t nfiles;
1.1 tholo 1810:
1.57 ! millert 1811: static void stdinit(void) /* in case stdin, etc., are not constants */
1.16 millert 1812: {
1.33 millert 1813: nfiles = FOPEN_MAX;
1814: files = calloc(nfiles, sizeof(*files));
1815: if (files == NULL)
1.57 ! millert 1816: FATAL("can't allocate file memory for %zu files", nfiles);
1.33 millert 1817: files[0].fp = stdin;
1818: files[0].fname = "/dev/stdin";
1819: files[0].mode = LT;
1820: files[1].fp = stdout;
1821: files[1].fname = "/dev/stdout";
1822: files[1].mode = GT;
1823: files[2].fp = stderr;
1824: files[2].fname = "/dev/stderr";
1825: files[2].mode = GT;
1.16 millert 1826: }
1827:
1.57 ! millert 1828: FILE *openfile(int a, const char *us, bool *pnewflag)
1.1 tholo 1829: {
1.18 millert 1830: const char *s = us;
1.57 ! millert 1831: size_t i;
! 1832: int m;
1.51 millert 1833: FILE *fp = NULL;
1.1 tholo 1834:
1835: if (*s == '\0')
1.16 millert 1836: FATAL("null file name in print or getline");
1.57 ! millert 1837: for (i = 0; i < nfiles; i++)
! 1838: if (files[i].fname && strcmp(s, files[i].fname) == 0 &&
! 1839: (a == files[i].mode || (a==APPEND && files[i].mode==GT) ||
! 1840: a == FFLUSH)) {
! 1841: if (pnewflag)
! 1842: *pnewflag = false;
! 1843: return files[i].fp;
1.13 kstailey 1844: }
1845: if (a == FFLUSH) /* didn't find it, so don't create it! */
1846: return NULL;
1847:
1.57 ! millert 1848: for (i = 0; i < nfiles; i++)
1.51 millert 1849: if (files[i].fp == NULL)
1.1 tholo 1850: break;
1.33 millert 1851: if (i >= nfiles) {
1852: struct files *nf;
1.57 ! millert 1853: size_t nnf = nfiles + FOPEN_MAX;
1.35 doug 1854: nf = reallocarray(files, nnf, sizeof(*nf));
1.33 millert 1855: if (nf == NULL)
1.57 ! millert 1856: FATAL("cannot grow files for %s and %zu files", s, nnf);
1.33 millert 1857: memset(&nf[nfiles], 0, FOPEN_MAX * sizeof(*nf));
1858: nfiles = nnf;
1859: files = nf;
1860: }
1.1 tholo 1861: fflush(stdout); /* force a semblance of order */
1862: m = a;
1863: if (a == GT) {
1864: fp = fopen(s, "w");
1865: } else if (a == APPEND) {
1866: fp = fopen(s, "a");
1867: m = GT; /* so can mix > and >> */
1868: } else if (a == '|') { /* output pipe */
1869: fp = popen(s, "w");
1870: } else if (a == LE) { /* input pipe */
1871: fp = popen(s, "r");
1872: } else if (a == LT) { /* getline <file */
1873: fp = strcmp(s, "-") == 0 ? stdin : fopen(s, "r"); /* "-" is stdin */
1874: } else /* can't happen */
1.16 millert 1875: FATAL("illegal redirection %d", a);
1.1 tholo 1876: if (fp != NULL) {
1877: files[i].fname = tostring(s);
1878: files[i].fp = fp;
1879: files[i].mode = m;
1.57 ! millert 1880: if (pnewflag)
! 1881: *pnewflag = true;
1.56 millert 1882: if (fp != stdin && fp != stdout && fp != stderr)
1883: (void) fcntl(fileno(fp), F_SETFD, FD_CLOEXEC);
1.1 tholo 1884: }
1885: return fp;
1886: }
1887:
1.18 millert 1888: const char *filename(FILE *fp)
1.1 tholo 1889: {
1.57 ! millert 1890: size_t i;
1.1 tholo 1891:
1.33 millert 1892: for (i = 0; i < nfiles; i++)
1.1 tholo 1893: if (fp == files[i].fp)
1894: return files[i].fname;
1895: return "???";
1896: }
1897:
1.57 ! millert 1898: Cell *closefile(Node **a, int n)
! 1899: {
! 1900: Cell *x;
! 1901: size_t i;
! 1902: bool stat;
! 1903:
! 1904: x = execute(a[0]);
! 1905: getsval(x);
! 1906: stat = true;
! 1907: for (i = 0; i < nfiles; i++) {
! 1908: if (!files[i].fname || strcmp(x->sval, files[i].fname) != 0)
! 1909: continue;
! 1910: if (ferror(files[i].fp))
! 1911: FATAL("i/o error occurred on %s", files[i].fname);
! 1912: if (files[i].mode == '|' || files[i].mode == LE)
! 1913: stat = pclose(files[i].fp) == -1;
! 1914: else
! 1915: stat = fclose(files[i].fp) == EOF;
! 1916: if (stat)
! 1917: FATAL("i/o error occurred closing %s", files[i].fname);
! 1918: if (i > 2) /* don't do /dev/std... */
! 1919: xfree(files[i].fname);
! 1920: files[i].fname = NULL; /* watch out for ref thru this */
! 1921: files[i].fp = NULL;
! 1922: }
! 1923: tempfree(x);
! 1924: x = gettemp();
! 1925: setfval(x, (Awkfloat) (stat ? -1 : 0));
! 1926: return(x);
! 1927: }
1.1 tholo 1928:
1929: void closeall(void)
1930: {
1.57 ! millert 1931: size_t i;
! 1932: bool stat = false;
1.1 tholo 1933:
1.57 ! millert 1934: for (i = 0; i < nfiles; i++) {
! 1935: if (! files[i].fp)
! 1936: continue;
! 1937: if (ferror(files[i].fp))
! 1938: FATAL( "i/o error occurred on %s", files[i].fname );
! 1939: if (files[i].mode == '|' || files[i].mode == LE)
! 1940: stat = pclose(files[i].fp) == -1;
! 1941: else
! 1942: stat = fclose(files[i].fp) == EOF;
! 1943: if (stat)
! 1944: FATAL( "i/o error occurred while closing %s", files[i].fname );
1.17 millert 1945: }
1.18 millert 1946: }
1947:
1.57 ! millert 1948: static void flush_all(void)
1.18 millert 1949: {
1.57 ! millert 1950: size_t i;
1.18 millert 1951:
1.33 millert 1952: for (i = 0; i < nfiles; i++)
1.18 millert 1953: if (files[i].fp)
1954: fflush(files[i].fp);
1.1 tholo 1955: }
1956:
1.53 millert 1957: void backsub(char **pb_ptr, const char **sptr_ptr);
1.1 tholo 1958:
1959: Cell *sub(Node **a, int nnn) /* substitute command */
1960: {
1.53 millert 1961: const char *sptr, *q;
1.1 tholo 1962: Cell *x, *y, *result;
1.53 millert 1963: char *t, *buf, *pb;
1.1 tholo 1964: fa *pfa;
1.13 kstailey 1965: int bufsz = recsize;
1.1 tholo 1966:
1.53 millert 1967: if ((buf = malloc(bufsz)) == NULL)
1.16 millert 1968: FATAL("out of memory in sub");
1.1 tholo 1969: x = execute(a[3]); /* target string */
1970: t = getsval(x);
1.51 millert 1971: if (a[0] == NULL) /* 0 => a[1] is already-compiled regexpr */
1.1 tholo 1972: pfa = (fa *) a[1]; /* regular expression */
1973: else {
1974: y = execute(a[1]);
1975: pfa = makedfa(getsval(y), 1);
1976: tempfree(y);
1977: }
1978: y = execute(a[2]); /* replacement string */
1.15 millert 1979: result = False;
1.1 tholo 1980: if (pmatch(pfa, t)) {
1.13 kstailey 1981: sptr = t;
1982: adjbuf(&buf, &bufsz, 1+patbeg-sptr, recsize, 0, "sub");
1.1 tholo 1983: pb = buf;
1984: while (sptr < patbeg)
1985: *pb++ = *sptr++;
1986: sptr = getsval(y);
1.57 ! millert 1987: while (*sptr != '\0') {
1.13 kstailey 1988: adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "sub");
1989: if (*sptr == '\\') {
1990: backsub(&pb, &sptr);
1.1 tholo 1991: } else if (*sptr == '&') {
1992: sptr++;
1.13 kstailey 1993: adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "sub");
1.1 tholo 1994: for (q = patbeg; q < patbeg+patlen; )
1995: *pb++ = *q++;
1996: } else
1997: *pb++ = *sptr++;
1.13 kstailey 1998: }
1.1 tholo 1999: *pb = '\0';
1.13 kstailey 2000: if (pb > buf + bufsz)
1.16 millert 2001: FATAL("sub result1 %.30s too big; can't happen", buf);
1.1 tholo 2002: sptr = patbeg + patlen;
1.13 kstailey 2003: if ((patlen == 0 && *patbeg) || (patlen && *(sptr-1))) {
2004: adjbuf(&buf, &bufsz, 1+strlen(sptr)+pb-buf, 0, &pb, "sub");
1.57 ! millert 2005: while ((*pb++ = *sptr++) != '\0')
! 2006: continue;
1.13 kstailey 2007: }
2008: if (pb > buf + bufsz)
1.16 millert 2009: FATAL("sub result2 %.30s too big; can't happen", buf);
1.13 kstailey 2010: setsval(x, buf); /* BUG: should be able to avoid copy */
1.23 millert 2011: result = True;
1.1 tholo 2012: }
2013: tempfree(x);
2014: tempfree(y);
1.13 kstailey 2015: free(buf);
1.1 tholo 2016: return result;
2017: }
2018:
2019: Cell *gsub(Node **a, int nnn) /* global substitute */
2020: {
2021: Cell *x, *y;
1.53 millert 2022: char *rptr, *pb;
2023: const char *q, *t, *sptr;
1.13 kstailey 2024: char *buf;
1.1 tholo 2025: fa *pfa;
2026: int mflag, tempstat, num;
1.13 kstailey 2027: int bufsz = recsize;
1.1 tholo 2028:
1.53 millert 2029: if ((buf = malloc(bufsz)) == NULL)
1.16 millert 2030: FATAL("out of memory in gsub");
1.1 tholo 2031: mflag = 0; /* if mflag == 0, can replace empty string */
2032: num = 0;
2033: x = execute(a[3]); /* target string */
2034: t = getsval(x);
1.51 millert 2035: if (a[0] == NULL) /* 0 => a[1] is already-compiled regexpr */
1.1 tholo 2036: pfa = (fa *) a[1]; /* regular expression */
2037: else {
2038: y = execute(a[1]);
2039: pfa = makedfa(getsval(y), 1);
2040: tempfree(y);
2041: }
2042: y = execute(a[2]); /* replacement string */
2043: if (pmatch(pfa, t)) {
2044: tempstat = pfa->initstat;
2045: pfa->initstat = 2;
2046: pb = buf;
2047: rptr = getsval(y);
2048: do {
1.57 ! millert 2049: if (patlen == 0 && *patbeg != '\0') { /* matched empty string */
1.1 tholo 2050: if (mflag == 0) { /* can replace empty */
2051: num++;
2052: sptr = rptr;
1.57 ! millert 2053: while (*sptr != '\0') {
1.13 kstailey 2054: adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "gsub");
2055: if (*sptr == '\\') {
2056: backsub(&pb, &sptr);
1.1 tholo 2057: } else if (*sptr == '&') {
2058: sptr++;
1.13 kstailey 2059: adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "gsub");
1.1 tholo 2060: for (q = patbeg; q < patbeg+patlen; )
2061: *pb++ = *q++;
2062: } else
2063: *pb++ = *sptr++;
1.13 kstailey 2064: }
1.1 tholo 2065: }
1.57 ! millert 2066: if (*t == '\0') /* at end */
1.1 tholo 2067: goto done;
1.13 kstailey 2068: adjbuf(&buf, &bufsz, 2+pb-buf, recsize, &pb, "gsub");
1.1 tholo 2069: *pb++ = *t++;
1.13 kstailey 2070: if (pb > buf + bufsz) /* BUG: not sure of this test */
1.16 millert 2071: FATAL("gsub result0 %.30s too big; can't happen", buf);
1.1 tholo 2072: mflag = 0;
2073: }
2074: else { /* matched nonempty string */
2075: num++;
2076: sptr = t;
1.13 kstailey 2077: adjbuf(&buf, &bufsz, 1+(patbeg-sptr)+pb-buf, recsize, &pb, "gsub");
2078: while (sptr < patbeg)
1.1 tholo 2079: *pb++ = *sptr++;
2080: sptr = rptr;
1.57 ! millert 2081: while (*sptr != '\0') {
1.13 kstailey 2082: adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "gsub");
2083: if (*sptr == '\\') {
2084: backsub(&pb, &sptr);
1.1 tholo 2085: } else if (*sptr == '&') {
2086: sptr++;
1.13 kstailey 2087: adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "gsub");
1.1 tholo 2088: for (q = patbeg; q < patbeg+patlen; )
2089: *pb++ = *q++;
2090: } else
2091: *pb++ = *sptr++;
1.13 kstailey 2092: }
1.1 tholo 2093: t = patbeg + patlen;
1.57 ! millert 2094: if (patlen == 0 || *t == '\0' || *(t-1) == '\0')
1.1 tholo 2095: goto done;
1.13 kstailey 2096: if (pb > buf + bufsz)
1.16 millert 2097: FATAL("gsub result1 %.30s too big; can't happen", buf);
1.1 tholo 2098: mflag = 1;
2099: }
2100: } while (pmatch(pfa,t));
2101: sptr = t;
1.13 kstailey 2102: adjbuf(&buf, &bufsz, 1+strlen(sptr)+pb-buf, 0, &pb, "gsub");
1.57 ! millert 2103: while ((*pb++ = *sptr++) != '\0')
! 2104: continue;
1.31 millert 2105: done: if (pb < buf + bufsz)
2106: *pb = '\0';
2107: else if (*(pb-1) != '\0')
2108: FATAL("gsub result2 %.30s truncated; can't happen", buf);
1.13 kstailey 2109: setsval(x, buf); /* BUG: should be able to avoid copy + free */
1.1 tholo 2110: pfa->initstat = tempstat;
2111: }
2112: tempfree(x);
2113: tempfree(y);
2114: x = gettemp();
2115: x->tval = NUM;
2116: x->fval = num;
1.13 kstailey 2117: free(buf);
1.1 tholo 2118: return(x);
1.13 kstailey 2119: }
2120:
1.53 millert 2121: void backsub(char **pb_ptr, const char **sptr_ptr) /* handle \\& variations */
1.13 kstailey 2122: { /* sptr[0] == '\\' */
1.53 millert 2123: char *pb = *pb_ptr;
2124: const char *sptr = *sptr_ptr;
1.56 millert 2125: static bool first = true;
2126: static bool do_posix = false;
2127:
2128: if (first) {
2129: first = false;
2130: do_posix = (getenv("POSIXLY_CORRECT") != NULL);
2131: }
1.13 kstailey 2132:
2133: if (sptr[1] == '\\') {
2134: if (sptr[2] == '\\' && sptr[3] == '&') { /* \\\& -> \& */
2135: *pb++ = '\\';
2136: *pb++ = '&';
2137: sptr += 4;
2138: } else if (sptr[2] == '&') { /* \\& -> \ + matched */
2139: *pb++ = '\\';
2140: sptr += 2;
1.56 millert 2141: } else if (do_posix) { /* \\x -> \x */
2142: sptr++;
2143: *pb++ = *sptr++;
1.13 kstailey 2144: } else { /* \\x -> \\x */
2145: *pb++ = *sptr++;
2146: *pb++ = *sptr++;
2147: }
2148: } else if (sptr[1] == '&') { /* literal & */
2149: sptr++;
2150: *pb++ = *sptr++;
2151: } else /* literal \ */
2152: *pb++ = *sptr++;
2153:
2154: *pb_ptr = pb;
2155: *sptr_ptr = sptr;
1.1 tholo 2156: }
![[BACK]](/icons/back.gif){kind=icon}
Return to run.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / awk