1 63a68686 2008-11-03 jas /****************************************************************
2 63a68686 2008-11-03 jas Copyright (C) Lucent Technologies 1997
3 63a68686 2008-11-03 jas All Rights Reserved
5 63a68686 2008-11-03 jas Permission to use, copy, modify, and distribute this software and
6 63a68686 2008-11-03 jas its documentation for any purpose and without fee is hereby
7 63a68686 2008-11-03 jas granted, provided that the above copyright notice appear in all
8 63a68686 2008-11-03 jas copies and that both that the copyright notice and this
9 63a68686 2008-11-03 jas permission notice and warranty disclaimer appear in supporting
10 63a68686 2008-11-03 jas documentation, and that the name Lucent Technologies or any of
11 63a68686 2008-11-03 jas its entities not be used in advertising or publicity pertaining
12 63a68686 2008-11-03 jas to distribution of the software without specific, written prior
15 63a68686 2008-11-03 jas LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
16 63a68686 2008-11-03 jas INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
17 63a68686 2008-11-03 jas IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
18 63a68686 2008-11-03 jas SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
19 63a68686 2008-11-03 jas WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
20 63a68686 2008-11-03 jas IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
21 63a68686 2008-11-03 jas ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
22 63a68686 2008-11-03 jas THIS SOFTWARE.
23 63a68686 2008-11-03 jas ****************************************************************/
25 63a68686 2008-11-03 jas #define DEBUG
26 63a68686 2008-11-03 jas #include <stdio.h>
27 63a68686 2008-11-03 jas #include <ctype.h>
28 63a68686 2008-11-03 jas #include <setjmp.h>
29 63a68686 2008-11-03 jas #include <math.h>
30 63a68686 2008-11-03 jas #include <string.h>
31 63a68686 2008-11-03 jas #include <stdlib.h>
32 63a68686 2008-11-03 jas #include <time.h>
33 63a68686 2008-11-03 jas #include "awk.h"
34 63a68686 2008-11-03 jas #include "y.tab.h"
36 63a68686 2008-11-03 jas #define tempfree(x) if (istemp(x)) tfree(x); else
39 63a68686 2008-11-03 jas #undef tempfree
41 63a68686 2008-11-03 jas void tempfree(Cell *p) {
42 63a68686 2008-11-03 jas if (p->ctype == OCELL && (p->csub < CUNK || p->csub > CFREE)) {
43 63a68686 2008-11-03 jas WARNING("bad csub %d in Cell %d %s",
44 63a68686 2008-11-03 jas p->csub, p->ctype, p->sval);
46 63a68686 2008-11-03 jas if (istemp(p))
51 63a68686 2008-11-03 jas #ifdef _NFILE
52 63a68686 2008-11-03 jas #ifndef FOPEN_MAX
53 63a68686 2008-11-03 jas #define FOPEN_MAX _NFILE
57 63a68686 2008-11-03 jas #ifndef FOPEN_MAX
58 63a68686 2008-11-03 jas #define FOPEN_MAX 40 /* max number of open files */
61 63a68686 2008-11-03 jas #ifndef RAND_MAX
62 63a68686 2008-11-03 jas #define RAND_MAX 32767 /* all that ansi guarantees */
66 63a68686 2008-11-03 jas extern int pairstack[];
68 63a68686 2008-11-03 jas Node *winner = NULL; /* root of parse tree */
69 63a68686 2008-11-03 jas Cell *tmps; /* free temporary cells for execution */
71 63a68686 2008-11-03 jas static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM };
72 63a68686 2008-11-03 jas Cell *True = &truecell;
73 63a68686 2008-11-03 jas static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM };
74 63a68686 2008-11-03 jas Cell *False = &falsecell;
75 63a68686 2008-11-03 jas static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM };
76 63a68686 2008-11-03 jas Cell *jbreak = &breakcell;
77 63a68686 2008-11-03 jas static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM };
78 63a68686 2008-11-03 jas Cell *jcont = &contcell;
79 63a68686 2008-11-03 jas static Cell nextcell ={ OJUMP, JNEXT, 0, 0, 0.0, NUM };
80 63a68686 2008-11-03 jas Cell *jnext = &nextcell;
81 63a68686 2008-11-03 jas static Cell nextfilecell ={ OJUMP, JNEXTFILE, 0, 0, 0.0, NUM };
82 63a68686 2008-11-03 jas Cell *jnextfile = &nextfilecell;
83 63a68686 2008-11-03 jas static Cell exitcell ={ OJUMP, JEXIT, 0, 0, 0.0, NUM };
84 63a68686 2008-11-03 jas Cell *jexit = &exitcell;
85 63a68686 2008-11-03 jas static Cell retcell ={ OJUMP, JRET, 0, 0, 0.0, NUM };
86 63a68686 2008-11-03 jas Cell *jret = &retcell;
87 63a68686 2008-11-03 jas static Cell tempcell ={ OCELL, CTEMP, 0, "", 0.0, NUM|STR|DONTFREE };
89 63a68686 2008-11-03 jas Node *curnode = NULL; /* the node being executed, for debugging */
91 63a68686 2008-11-03 jas /* buffer memory management */
92 63a68686 2008-11-03 jas int adjbuf(char **pbuf, int *psiz, int minlen, int quantum, char **pbptr,
93 63a68686 2008-11-03 jas char *whatrtn)
94 63a68686 2008-11-03 jas /* pbuf: address of pointer to buffer being managed
95 63a68686 2008-11-03 jas * psiz: address of buffer size variable
96 63a68686 2008-11-03 jas * minlen: minimum length of buffer needed
97 63a68686 2008-11-03 jas * quantum: buffer size quantum
98 63a68686 2008-11-03 jas * pbptr: address of movable pointer into buffer, or 0 if none
99 63a68686 2008-11-03 jas * whatrtn: name of the calling routine if failure should cause fatal error
101 63a68686 2008-11-03 jas * return 0 for realloc failure, !=0 for success
104 63a68686 2008-11-03 jas if (minlen > *psiz) {
106 63a68686 2008-11-03 jas int rminlen = quantum ? minlen % quantum : 0;
107 63a68686 2008-11-03 jas int boff = pbptr ? *pbptr - *pbuf : 0;
108 63a68686 2008-11-03 jas /* round up to next multiple of quantum */
109 63a68686 2008-11-03 jas if (rminlen)
110 63a68686 2008-11-03 jas minlen += quantum - rminlen;
111 63a68686 2008-11-03 jas tbuf = (char *) realloc(*pbuf, minlen);
112 63a68686 2008-11-03 jas if (tbuf == NULL) {
113 63a68686 2008-11-03 jas if (whatrtn)
114 63a68686 2008-11-03 jas FATAL("out of memory in %s", whatrtn);
117 63a68686 2008-11-03 jas *pbuf = tbuf;
118 63a68686 2008-11-03 jas *psiz = minlen;
120 63a68686 2008-11-03 jas *pbptr = tbuf + boff;
125 63a68686 2008-11-03 jas void run(Node *a) /* execution of parse tree starts here */
127 63a68686 2008-11-03 jas extern void stdinit(void);
134 63a68686 2008-11-03 jas Cell *execute(Node *u) /* execute a node of the parse tree */
137 63a68686 2008-11-03 jas Cell *(*proc)(Node **, int);
141 63a68686 2008-11-03 jas if (u == NULL)
142 63a68686 2008-11-03 jas return(True);
143 63a68686 2008-11-03 jas for (a = u; ; a = a->nnext) {
144 63a68686 2008-11-03 jas curnode = a;
145 63a68686 2008-11-03 jas if (isvalue(a)) {
146 63a68686 2008-11-03 jas x = (Cell *) (a->narg[0]);
147 63a68686 2008-11-03 jas if (isfld(x) && !donefld)
149 63a68686 2008-11-03 jas else if (isrec(x) && !donerec)
153 63a68686 2008-11-03 jas nobj = a->nobj;
154 63a68686 2008-11-03 jas if (notlegal(nobj)) /* probably a Cell* but too risky to print */
155 63a68686 2008-11-03 jas FATAL("illegal statement");
156 63a68686 2008-11-03 jas proc = proctab[nobj-FIRSTTOKEN];
157 63a68686 2008-11-03 jas x = (*proc)(a->narg, nobj);
158 63a68686 2008-11-03 jas if (isfld(x) && !donefld)
160 63a68686 2008-11-03 jas else if (isrec(x) && !donerec)
162 63a68686 2008-11-03 jas if (isexpr(a))
164 63a68686 2008-11-03 jas if (isjump(x))
166 63a68686 2008-11-03 jas if (a->nnext == NULL)
168 63a68686 2008-11-03 jas tempfree(x);
173 63a68686 2008-11-03 jas Cell *program(Node **a, int n) /* execute an awk program */
174 63a68686 2008-11-03 jas { /* a[0] = BEGIN, a[1] = body, a[2] = END */
177 63a68686 2008-11-03 jas if (setjmp(env) != 0)
179 63a68686 2008-11-03 jas if (a[0]) { /* BEGIN */
180 63a68686 2008-11-03 jas x = execute(a[0]);
181 63a68686 2008-11-03 jas if (isexit(x))
182 63a68686 2008-11-03 jas return(True);
183 63a68686 2008-11-03 jas if (isjump(x))
184 63a68686 2008-11-03 jas FATAL("illegal break, continue, next or nextfile from BEGIN");
185 63a68686 2008-11-03 jas tempfree(x);
187 63a68686 2008-11-03 jas if (a[1] || a[2])
188 63a68686 2008-11-03 jas while (getrec(&record, &recsize, 1) > 0) {
189 63a68686 2008-11-03 jas x = execute(a[1]);
190 63a68686 2008-11-03 jas if (isexit(x))
192 63a68686 2008-11-03 jas tempfree(x);
195 63a68686 2008-11-03 jas if (setjmp(env) != 0) /* handles exit within END */
197 63a68686 2008-11-03 jas if (a[2]) { /* END */
198 63a68686 2008-11-03 jas x = execute(a[2]);
199 63a68686 2008-11-03 jas if (isbreak(x) || isnext(x) || iscont(x))
200 63a68686 2008-11-03 jas FATAL("illegal break, continue, next or nextfile from END");
201 63a68686 2008-11-03 jas tempfree(x);
204 63a68686 2008-11-03 jas return(True);
207 63a68686 2008-11-03 jas struct Frame { /* stack frame for awk function calls */
208 63a68686 2008-11-03 jas int nargs; /* number of arguments in this call */
209 63a68686 2008-11-03 jas Cell *fcncell; /* pointer to Cell for function */
210 63a68686 2008-11-03 jas Cell **args; /* pointer to array of arguments after execute */
211 63a68686 2008-11-03 jas Cell *retval; /* return value */
214 63a68686 2008-11-03 jas #define NARGS 50 /* max args in a call */
216 63a68686 2008-11-03 jas struct Frame *frame = NULL; /* base of stack frames; dynamically allocated */
217 63a68686 2008-11-03 jas int nframe = 0; /* number of frames allocated */
218 63a68686 2008-11-03 jas struct Frame *fp = NULL; /* frame pointer. bottom level unused */
220 63a68686 2008-11-03 jas Cell *call(Node **a, int n) /* function call. very kludgy and fragile */
222 63a68686 2008-11-03 jas static Cell newcopycell = { OCELL, CCOPY, 0, "", 0.0, NUM|STR|DONTFREE };
223 63a68686 2008-11-03 jas int i, ncall, ndef;
225 63a68686 2008-11-03 jas Cell *args[NARGS], *oargs[NARGS]; /* BUG: fixed size arrays */
226 63a68686 2008-11-03 jas Cell *y, *z, *fcn;
229 63a68686 2008-11-03 jas fcn = execute(a[0]); /* the function itself */
230 63a68686 2008-11-03 jas s = fcn->nval;
231 63a68686 2008-11-03 jas if (!isfcn(fcn))
232 63a68686 2008-11-03 jas FATAL("calling undefined function %s", s);
233 63a68686 2008-11-03 jas if (frame == NULL) {
234 63a68686 2008-11-03 jas fp = frame = (struct Frame *) calloc(nframe += 100, sizeof(struct Frame));
235 63a68686 2008-11-03 jas if (frame == NULL)
236 63a68686 2008-11-03 jas FATAL("out of space for stack frames calling %s", s);
238 63a68686 2008-11-03 jas for (ncall = 0, x = a[1]; x != NULL; x = x->nnext) /* args in call */
240 63a68686 2008-11-03 jas ndef = (int) fcn->fval; /* args in defn */
241 63a68686 2008-11-03 jas dprintf( ("calling %s, %d args (%d in defn), fp=%d\n", s, ncall, ndef, (int) (fp-frame)) );
242 63a68686 2008-11-03 jas if (ncall > ndef)
243 63a68686 2008-11-03 jas WARNING("function %s called with %d args, uses only %d",
244 63a68686 2008-11-03 jas s, ncall, ndef);
245 63a68686 2008-11-03 jas if (ncall + ndef > NARGS)
246 63a68686 2008-11-03 jas FATAL("function %s has %d arguments, limit %d", s, ncall+ndef, NARGS);
247 63a68686 2008-11-03 jas for (i = 0, x = a[1]; x != NULL; i++, x = x->nnext) { /* get call args */
248 63a68686 2008-11-03 jas dprintf( ("evaluate args[%d], fp=%d:\n", i, (int) (fp-frame)) );
249 63a68686 2008-11-03 jas y = execute(x);
250 63a68686 2008-11-03 jas oargs[i] = y;
251 63a68686 2008-11-03 jas dprintf( ("args[%d]: %s %f <%s>, t=%o\n",
252 63a68686 2008-11-03 jas i, y->nval, y->fval, isarr(y) ? "(array)" : y->sval, y->tval) );
253 63a68686 2008-11-03 jas if (isfcn(y))
254 63a68686 2008-11-03 jas FATAL("can't use function %s as argument in %s", y->nval, s);
255 63a68686 2008-11-03 jas if (isarr(y))
256 63a68686 2008-11-03 jas args[i] = y; /* arrays by ref */
258 63a68686 2008-11-03 jas args[i] = copycell(y);
259 63a68686 2008-11-03 jas tempfree(y);
261 63a68686 2008-11-03 jas for ( ; i < ndef; i++) { /* add null args for ones not provided */
262 63a68686 2008-11-03 jas args[i] = gettemp();
263 63a68686 2008-11-03 jas *args[i] = newcopycell;
265 63a68686 2008-11-03 jas fp++; /* now ok to up frame */
266 63a68686 2008-11-03 jas if (fp >= frame + nframe) {
267 63a68686 2008-11-03 jas int dfp = fp - frame; /* old index */
268 63a68686 2008-11-03 jas frame = (struct Frame *)
269 63a68686 2008-11-03 jas realloc((char *) frame, (nframe += 100) * sizeof(struct Frame));
270 63a68686 2008-11-03 jas if (frame == NULL)
271 63a68686 2008-11-03 jas FATAL("out of space for stack frames in %s", s);
272 63a68686 2008-11-03 jas fp = frame + dfp;
274 63a68686 2008-11-03 jas fp->fcncell = fcn;
275 63a68686 2008-11-03 jas fp->args = args;
276 63a68686 2008-11-03 jas fp->nargs = ndef; /* number defined with (excess are locals) */
277 63a68686 2008-11-03 jas fp->retval = gettemp();
279 63a68686 2008-11-03 jas dprintf( ("start exec of %s, fp=%d\n", s, (int) (fp-frame)) );
280 63a68686 2008-11-03 jas y = execute((Node *)(fcn->sval)); /* execute body */
281 63a68686 2008-11-03 jas dprintf( ("finished exec of %s, fp=%d\n", s, (int) (fp-frame)) );
283 63a68686 2008-11-03 jas for (i = 0; i < ndef; i++) {
284 63a68686 2008-11-03 jas Cell *t = fp->args[i];
285 63a68686 2008-11-03 jas if (isarr(t)) {
286 63a68686 2008-11-03 jas if (t->csub == CCOPY) {
287 63a68686 2008-11-03 jas if (i >= ncall) {
288 63a68686 2008-11-03 jas freesymtab(t);
289 63a68686 2008-11-03 jas t->csub = CTEMP;
290 63a68686 2008-11-03 jas tempfree(t);
292 63a68686 2008-11-03 jas oargs[i]->tval = t->tval;
293 63a68686 2008-11-03 jas oargs[i]->tval &= ~(STR|NUM|DONTFREE);
294 63a68686 2008-11-03 jas oargs[i]->sval = t->sval;
295 63a68686 2008-11-03 jas tempfree(t);
298 63a68686 2008-11-03 jas } else if (t != y) { /* kludge to prevent freeing twice */
299 63a68686 2008-11-03 jas t->csub = CTEMP;
300 63a68686 2008-11-03 jas tempfree(t);
303 63a68686 2008-11-03 jas tempfree(fcn);
304 63a68686 2008-11-03 jas if (isexit(y) || isnext(y) || isnextfile(y))
306 63a68686 2008-11-03 jas tempfree(y); /* this can free twice! */
307 63a68686 2008-11-03 jas z = fp->retval; /* return value */
308 63a68686 2008-11-03 jas dprintf( ("%s returns %g |%s| %o\n", s, getfval(z), getsval(z), z->tval) );
313 63a68686 2008-11-03 jas Cell *copycell(Cell *x) /* make a copy of a cell in a temp */
317 63a68686 2008-11-03 jas y = gettemp();
318 63a68686 2008-11-03 jas y->csub = CCOPY; /* prevents freeing until call is over */
319 63a68686 2008-11-03 jas y->nval = x->nval; /* BUG? */
320 63a68686 2008-11-03 jas y->sval = x->sval ? tostring(x->sval) : NULL;
321 63a68686 2008-11-03 jas y->fval = x->fval;
322 63a68686 2008-11-03 jas y->tval = x->tval & ~(CON|FLD|REC|DONTFREE); /* copy is not constant or field */
323 63a68686 2008-11-03 jas /* is DONTFREE right? */
327 63a68686 2008-11-03 jas Cell *arg(Node **a, int n) /* nth argument of a function */
330 63a68686 2008-11-03 jas n = ptoi(a[0]); /* argument number, counting from 0 */
331 63a68686 2008-11-03 jas dprintf( ("arg(%d), fp->nargs=%d\n", n, fp->nargs) );
332 63a68686 2008-11-03 jas if (n+1 > fp->nargs)
333 63a68686 2008-11-03 jas FATAL("argument #%d of function %s was not supplied",
334 63a68686 2008-11-03 jas n+1, fp->fcncell->nval);
335 63a68686 2008-11-03 jas return fp->args[n];
338 63a68686 2008-11-03 jas Cell *jump(Node **a, int n) /* break, continue, next, nextfile, return */
342 63a68686 2008-11-03 jas switch (n) {
344 63a68686 2008-11-03 jas if (a[0] != NULL) {
345 63a68686 2008-11-03 jas y = execute(a[0]);
346 63a68686 2008-11-03 jas errorflag = (int) getfval(y);
347 63a68686 2008-11-03 jas tempfree(y);
349 63a68686 2008-11-03 jas longjmp(env, 1);
350 63a68686 2008-11-03 jas case RETURN:
351 63a68686 2008-11-03 jas if (a[0] != NULL) {
352 63a68686 2008-11-03 jas y = execute(a[0]);
353 63a68686 2008-11-03 jas if ((y->tval & (STR|NUM)) == (STR|NUM)) {
354 63a68686 2008-11-03 jas setsval(fp->retval, getsval(y));
355 63a68686 2008-11-03 jas fp->retval->fval = getfval(y);
356 63a68686 2008-11-03 jas fp->retval->tval |= NUM;
358 63a68686 2008-11-03 jas else if (y->tval & STR)
359 63a68686 2008-11-03 jas setsval(fp->retval, getsval(y));
360 63a68686 2008-11-03 jas else if (y->tval & NUM)
361 63a68686 2008-11-03 jas setfval(fp->retval, getfval(y));
362 63a68686 2008-11-03 jas else /* can't happen */
363 63a68686 2008-11-03 jas FATAL("bad type variable %d", y->tval);
364 63a68686 2008-11-03 jas tempfree(y);
366 63a68686 2008-11-03 jas return(jret);
368 63a68686 2008-11-03 jas return(jnext);
369 63a68686 2008-11-03 jas case NEXTFILE:
371 63a68686 2008-11-03 jas return(jnextfile);
373 63a68686 2008-11-03 jas return(jbreak);
374 63a68686 2008-11-03 jas case CONTINUE:
375 63a68686 2008-11-03 jas return(jcont);
376 63a68686 2008-11-03 jas default: /* can't happen */
377 63a68686 2008-11-03 jas FATAL("illegal jump type %d", n);
379 63a68686 2008-11-03 jas return 0; /* not reached */
382 63a68686 2008-11-03 jas Cell *getline(Node **a, int n) /* get next line from specific input */
383 63a68686 2008-11-03 jas { /* a[0] is variable, a[1] is operator, a[2] is filename */
384 63a68686 2008-11-03 jas Cell *r, *x;
385 63a68686 2008-11-03 jas extern Cell **fldtab;
388 63a68686 2008-11-03 jas int bufsize = recsize;
391 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsize)) == NULL)
392 63a68686 2008-11-03 jas FATAL("out of memory in getline");
394 63a68686 2008-11-03 jas fflush(stdout); /* in case someone is waiting for a prompt */
395 63a68686 2008-11-03 jas r = gettemp();
396 63a68686 2008-11-03 jas if (a[1] != NULL) { /* getline < file */
397 63a68686 2008-11-03 jas x = execute(a[2]); /* filename */
398 63a68686 2008-11-03 jas mode = ptoi(a[1]);
399 63a68686 2008-11-03 jas if (mode == '|') /* input pipe */
400 63a68686 2008-11-03 jas mode = LE; /* arbitrary flag */
401 63a68686 2008-11-03 jas fp = openfile(mode, getsval(x));
402 63a68686 2008-11-03 jas tempfree(x);
403 63a68686 2008-11-03 jas if (fp == NULL)
406 63a68686 2008-11-03 jas n = readrec(&buf, &bufsize, fp);
407 63a68686 2008-11-03 jas if (n <= 0) {
409 63a68686 2008-11-03 jas } else if (a[0] != NULL) { /* getline var <file */
410 63a68686 2008-11-03 jas x = execute(a[0]);
411 63a68686 2008-11-03 jas setsval(x, buf);
412 63a68686 2008-11-03 jas tempfree(x);
413 63a68686 2008-11-03 jas } else { /* getline <file */
414 63a68686 2008-11-03 jas setsval(fldtab[0], buf);
415 63a68686 2008-11-03 jas if (is_number(fldtab[0]->sval)) {
416 63a68686 2008-11-03 jas fldtab[0]->fval = atof(fldtab[0]->sval);
417 63a68686 2008-11-03 jas fldtab[0]->tval |= NUM;
420 63a68686 2008-11-03 jas } else { /* bare getline; use current input */
421 63a68686 2008-11-03 jas if (a[0] == NULL) /* getline */
422 63a68686 2008-11-03 jas n = getrec(&record, &recsize, 1);
423 63a68686 2008-11-03 jas else { /* getline var */
424 63a68686 2008-11-03 jas n = getrec(&buf, &bufsize, 0);
425 63a68686 2008-11-03 jas x = execute(a[0]);
426 63a68686 2008-11-03 jas setsval(x, buf);
427 63a68686 2008-11-03 jas tempfree(x);
430 63a68686 2008-11-03 jas setfval(r, (Awkfloat) n);
435 63a68686 2008-11-03 jas Cell *getnf(Node **a, int n) /* get NF */
437 63a68686 2008-11-03 jas if (donefld == 0)
439 63a68686 2008-11-03 jas return (Cell *) a[0];
442 63a68686 2008-11-03 jas Cell *array(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
444 63a68686 2008-11-03 jas Cell *x, *y, *z;
448 63a68686 2008-11-03 jas int bufsz = recsize;
449 63a68686 2008-11-03 jas int nsub = strlen(*SUBSEP);
451 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL)
452 63a68686 2008-11-03 jas FATAL("out of memory in array");
454 63a68686 2008-11-03 jas x = execute(a[0]); /* Cell* for symbol table */
456 63a68686 2008-11-03 jas for (np = a[1]; np; np = np->nnext) {
457 63a68686 2008-11-03 jas y = execute(np); /* subscript */
458 63a68686 2008-11-03 jas s = getsval(y);
459 63a68686 2008-11-03 jas if (!adjbuf(&buf, &bufsz, strlen(buf)+strlen(s)+nsub+1, recsize, 0, 0))
460 63a68686 2008-11-03 jas FATAL("out of memory for %s[%s...]", x->nval, buf);
461 63a68686 2008-11-03 jas strcat(buf, s);
462 63a68686 2008-11-03 jas if (np->nnext)
463 63a68686 2008-11-03 jas strcat(buf, *SUBSEP);
464 63a68686 2008-11-03 jas tempfree(y);
466 63a68686 2008-11-03 jas if (!isarr(x)) {
467 63a68686 2008-11-03 jas dprintf( ("making %s into an array\n", x->nval) );
468 63a68686 2008-11-03 jas if (freeable(x))
469 63a68686 2008-11-03 jas xfree(x->sval);
470 63a68686 2008-11-03 jas x->tval &= ~(STR|NUM|DONTFREE);
471 63a68686 2008-11-03 jas x->tval |= ARR;
472 63a68686 2008-11-03 jas x->sval = (char *) makesymtab(NSYMTAB);
474 63a68686 2008-11-03 jas z = setsymtab(buf, "", 0.0, STR|NUM, (Array *) x->sval);
475 63a68686 2008-11-03 jas z->ctype = OCELL;
476 63a68686 2008-11-03 jas z->csub = CVAR;
477 63a68686 2008-11-03 jas tempfree(x);
482 63a68686 2008-11-03 jas Cell *awkdelete(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
484 63a68686 2008-11-03 jas Cell *x, *y;
487 63a68686 2008-11-03 jas int nsub = strlen(*SUBSEP);
489 63a68686 2008-11-03 jas x = execute(a[0]); /* Cell* for symbol table */
490 63a68686 2008-11-03 jas if (!isarr(x))
491 63a68686 2008-11-03 jas return True;
492 63a68686 2008-11-03 jas if (a[1] == 0) { /* delete the elements, not the table */
493 63a68686 2008-11-03 jas freesymtab(x);
494 63a68686 2008-11-03 jas x->tval &= ~STR;
495 63a68686 2008-11-03 jas x->tval |= ARR;
496 63a68686 2008-11-03 jas x->sval = (char *) makesymtab(NSYMTAB);
498 63a68686 2008-11-03 jas int bufsz = recsize;
500 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL)
501 63a68686 2008-11-03 jas FATAL("out of memory in adelete");
503 63a68686 2008-11-03 jas for (np = a[1]; np; np = np->nnext) {
504 63a68686 2008-11-03 jas y = execute(np); /* subscript */
505 63a68686 2008-11-03 jas s = getsval(y);
506 63a68686 2008-11-03 jas if (!adjbuf(&buf, &bufsz, strlen(buf)+strlen(s)+nsub+1, recsize, 0, 0))
507 63a68686 2008-11-03 jas FATAL("out of memory deleting %s[%s...]", x->nval, buf);
508 63a68686 2008-11-03 jas strcat(buf, s);
509 63a68686 2008-11-03 jas if (np->nnext)
510 63a68686 2008-11-03 jas strcat(buf, *SUBSEP);
511 63a68686 2008-11-03 jas tempfree(y);
513 63a68686 2008-11-03 jas freeelem(x, buf);
516 63a68686 2008-11-03 jas tempfree(x);
517 63a68686 2008-11-03 jas return True;
520 63a68686 2008-11-03 jas Cell *intest(Node **a, int n) /* a[0] is index (list), a[1] is symtab */
522 63a68686 2008-11-03 jas Cell *x, *ap, *k;
526 63a68686 2008-11-03 jas int bufsz = recsize;
527 63a68686 2008-11-03 jas int nsub = strlen(*SUBSEP);
529 63a68686 2008-11-03 jas ap = execute(a[1]); /* array name */
530 63a68686 2008-11-03 jas if (!isarr(ap)) {
531 63a68686 2008-11-03 jas dprintf( ("making %s into an array\n", ap->nval) );
532 63a68686 2008-11-03 jas if (freeable(ap))
533 63a68686 2008-11-03 jas xfree(ap->sval);
534 63a68686 2008-11-03 jas ap->tval &= ~(STR|NUM|DONTFREE);
535 63a68686 2008-11-03 jas ap->tval |= ARR;
536 63a68686 2008-11-03 jas ap->sval = (char *) makesymtab(NSYMTAB);
538 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL) {
539 63a68686 2008-11-03 jas FATAL("out of memory in intest");
542 63a68686 2008-11-03 jas for (p = a[0]; p; p = p->nnext) {
543 63a68686 2008-11-03 jas x = execute(p); /* expr */
544 63a68686 2008-11-03 jas s = getsval(x);
545 63a68686 2008-11-03 jas if (!adjbuf(&buf, &bufsz, strlen(buf)+strlen(s)+nsub+1, recsize, 0, 0))
546 63a68686 2008-11-03 jas FATAL("out of memory deleting %s[%s...]", x->nval, buf);
547 63a68686 2008-11-03 jas strcat(buf, s);
548 63a68686 2008-11-03 jas tempfree(x);
549 63a68686 2008-11-03 jas if (p->nnext)
550 63a68686 2008-11-03 jas strcat(buf, *SUBSEP);
552 63a68686 2008-11-03 jas k = lookup(buf, (Array *) ap->sval);
553 63a68686 2008-11-03 jas tempfree(ap);
555 63a68686 2008-11-03 jas if (k == NULL)
556 63a68686 2008-11-03 jas return(False);
558 63a68686 2008-11-03 jas return(True);
562 63a68686 2008-11-03 jas Cell *matchop(Node **a, int n) /* ~ and match() */
564 63a68686 2008-11-03 jas Cell *x, *y;
565 63a68686 2008-11-03 jas char *s, *t;
569 63a68686 2008-11-03 jas x = execute(a[1]); /* a[1] = target text */
570 63a68686 2008-11-03 jas s = getsval(x);
571 63a68686 2008-11-03 jas if (a[0] == 0) /* a[1] == 0: already-compiled reg expr */
572 63a68686 2008-11-03 jas p = (void *) a[2];
574 63a68686 2008-11-03 jas y = execute(a[2]); /* a[2] = regular expr */
575 63a68686 2008-11-03 jas t = getsval(y);
576 63a68686 2008-11-03 jas p = compre(t);
577 63a68686 2008-11-03 jas tempfree(y);
579 63a68686 2008-11-03 jas if (n == MATCHFCN)
580 63a68686 2008-11-03 jas i = pmatch(p, s, s);
582 63a68686 2008-11-03 jas i = match(p, s, s);
583 63a68686 2008-11-03 jas tempfree(x);
584 63a68686 2008-11-03 jas if (n == MATCHFCN) {
585 63a68686 2008-11-03 jas int start = countposn(s, patbeg-s)+1;
586 63a68686 2008-11-03 jas if (patlen < 0)
588 63a68686 2008-11-03 jas setfval(rstartloc, (Awkfloat) start);
589 63a68686 2008-11-03 jas setfval(rlengthloc, (Awkfloat) countposn(patbeg, patlen));
590 63a68686 2008-11-03 jas x = gettemp();
591 63a68686 2008-11-03 jas x->tval = NUM;
592 63a68686 2008-11-03 jas x->fval = start;
594 63a68686 2008-11-03 jas } else if ((n == MATCH && i == 1) || (n == NOTMATCH && i == 0))
595 63a68686 2008-11-03 jas return(True);
597 63a68686 2008-11-03 jas return(False);
601 63a68686 2008-11-03 jas Cell *boolop(Node **a, int n) /* a[0] || a[1], a[0] && a[1], !a[0] */
603 63a68686 2008-11-03 jas Cell *x, *y;
606 63a68686 2008-11-03 jas x = execute(a[0]);
607 63a68686 2008-11-03 jas i = istrue(x);
608 63a68686 2008-11-03 jas tempfree(x);
609 63a68686 2008-11-03 jas switch (n) {
611 63a68686 2008-11-03 jas if (i) return(True);
612 63a68686 2008-11-03 jas y = execute(a[1]);
613 63a68686 2008-11-03 jas i = istrue(y);
614 63a68686 2008-11-03 jas tempfree(y);
615 63a68686 2008-11-03 jas if (i) return(True);
616 63a68686 2008-11-03 jas else return(False);
618 63a68686 2008-11-03 jas if ( !i ) return(False);
619 63a68686 2008-11-03 jas y = execute(a[1]);
620 63a68686 2008-11-03 jas i = istrue(y);
621 63a68686 2008-11-03 jas tempfree(y);
622 63a68686 2008-11-03 jas if (i) return(True);
623 63a68686 2008-11-03 jas else return(False);
625 63a68686 2008-11-03 jas if (i) return(False);
626 63a68686 2008-11-03 jas else return(True);
627 63a68686 2008-11-03 jas default: /* can't happen */
628 63a68686 2008-11-03 jas FATAL("unknown boolean operator %d", n);
630 63a68686 2008-11-03 jas return 0; /*NOTREACHED*/
633 63a68686 2008-11-03 jas Cell *relop(Node **a, int n) /* a[0 < a[1], etc. */
636 63a68686 2008-11-03 jas Cell *x, *y;
639 63a68686 2008-11-03 jas x = execute(a[0]);
640 63a68686 2008-11-03 jas y = execute(a[1]);
641 63a68686 2008-11-03 jas if (x->tval&NUM && y->tval&NUM) {
642 63a68686 2008-11-03 jas j = x->fval - y->fval;
643 63a68686 2008-11-03 jas i = j<0? -1: (j>0? 1: 0);
645 63a68686 2008-11-03 jas i = strcmp(getsval(x), getsval(y));
647 63a68686 2008-11-03 jas tempfree(x);
648 63a68686 2008-11-03 jas tempfree(y);
649 63a68686 2008-11-03 jas switch (n) {
650 63a68686 2008-11-03 jas case LT: if (i<0) return(True);
651 63a68686 2008-11-03 jas else return(False);
652 63a68686 2008-11-03 jas case LE: if (i<=0) return(True);
653 63a68686 2008-11-03 jas else return(False);
654 63a68686 2008-11-03 jas case NE: if (i!=0) return(True);
655 63a68686 2008-11-03 jas else return(False);
656 63a68686 2008-11-03 jas case EQ: if (i == 0) return(True);
657 63a68686 2008-11-03 jas else return(False);
658 63a68686 2008-11-03 jas case GE: if (i>=0) return(True);
659 63a68686 2008-11-03 jas else return(False);
660 63a68686 2008-11-03 jas case GT: if (i>0) return(True);
661 63a68686 2008-11-03 jas else return(False);
662 63a68686 2008-11-03 jas default: /* can't happen */
663 63a68686 2008-11-03 jas FATAL("unknown relational operator %d", n);
665 63a68686 2008-11-03 jas return 0; /*NOTREACHED*/
668 63a68686 2008-11-03 jas void tfree(Cell *a) /* free a tempcell */
670 63a68686 2008-11-03 jas if (freeable(a)) {
671 63a68686 2008-11-03 jas dprintf( ("freeing %s %s %o\n", a->nval, a->sval, a->tval) );
672 63a68686 2008-11-03 jas xfree(a->sval);
674 63a68686 2008-11-03 jas if (a == tmps)
675 63a68686 2008-11-03 jas FATAL("tempcell list is curdled");
676 63a68686 2008-11-03 jas a->cnext = tmps;
680 63a68686 2008-11-03 jas Cell *gettemp(void) /* get a tempcell */
684 63a68686 2008-11-03 jas if (!tmps) {
685 63a68686 2008-11-03 jas tmps = (Cell *) calloc(100, sizeof(Cell));
687 63a68686 2008-11-03 jas FATAL("out of space for temporaries");
688 63a68686 2008-11-03 jas for(i = 1; i < 100; i++)
689 63a68686 2008-11-03 jas tmps[i-1].cnext = &tmps[i];
690 63a68686 2008-11-03 jas tmps[i-1].cnext = 0;
693 63a68686 2008-11-03 jas tmps = x->cnext;
694 63a68686 2008-11-03 jas *x = tempcell;
698 63a68686 2008-11-03 jas Cell *indirect(Node **a, int n) /* $( a[0] ) */
704 63a68686 2008-11-03 jas x = execute(a[0]);
705 63a68686 2008-11-03 jas m = (int) getfval(x);
706 63a68686 2008-11-03 jas if (m == 0 && !is_number(s = getsval(x))) /* suspicion! */
707 63a68686 2008-11-03 jas FATAL("illegal field $(%s), name \"%s\"", s, x->nval);
708 63a68686 2008-11-03 jas /* BUG: can x->nval ever be null??? */
709 63a68686 2008-11-03 jas tempfree(x);
710 63a68686 2008-11-03 jas x = fieldadr(m);
711 63a68686 2008-11-03 jas x->ctype = OCELL; /* BUG? why are these needed? */
712 63a68686 2008-11-03 jas x->csub = CFLD;
716 63a68686 2008-11-03 jas Cell *substr(Node **a, int nnn) /* substr(a[0], a[1], a[2]) */
718 63a68686 2008-11-03 jas int k, m, n;
719 63a68686 2008-11-03 jas char *s, *p;
721 63a68686 2008-11-03 jas Cell *x, *y, *z = 0;
723 63a68686 2008-11-03 jas x = execute(a[0]);
724 63a68686 2008-11-03 jas y = execute(a[1]);
725 63a68686 2008-11-03 jas if (a[2] != 0)
726 63a68686 2008-11-03 jas z = execute(a[2]);
727 63a68686 2008-11-03 jas s = getsval(x);
728 63a68686 2008-11-03 jas k = countposn(s, strlen(s)) + 1;
729 63a68686 2008-11-03 jas if (k <= 1) {
730 63a68686 2008-11-03 jas tempfree(x);
731 63a68686 2008-11-03 jas tempfree(y);
732 63a68686 2008-11-03 jas if (a[2] != 0)
733 63a68686 2008-11-03 jas tempfree(z);
734 63a68686 2008-11-03 jas x = gettemp();
735 63a68686 2008-11-03 jas setsval(x, "");
738 63a68686 2008-11-03 jas m = (int) getfval(y);
741 63a68686 2008-11-03 jas else if (m > k)
743 63a68686 2008-11-03 jas tempfree(y);
744 63a68686 2008-11-03 jas if (a[2] != 0) {
745 63a68686 2008-11-03 jas n = (int) getfval(z);
746 63a68686 2008-11-03 jas tempfree(z);
751 63a68686 2008-11-03 jas else if (n > k - m)
753 63a68686 2008-11-03 jas dprintf( ("substr: m=%d, n=%d, s=%s\n", m, n, s) );
754 63a68686 2008-11-03 jas y = gettemp();
755 63a68686 2008-11-03 jas while (*s && --m)
756 63a68686 2008-11-03 jas s += mblen(s, k);
757 63a68686 2008-11-03 jas for (p = s; *p && n--; p += mblen(p, k))
759 63a68686 2008-11-03 jas temp = *p; /* with thanks to John Linderman */
761 63a68686 2008-11-03 jas setsval(y, s);
763 63a68686 2008-11-03 jas tempfree(x);
767 63a68686 2008-11-03 jas Cell *sindex(Node **a, int nnn) /* index(a[0], a[1]) */
769 63a68686 2008-11-03 jas Cell *x, *y, *z;
770 63a68686 2008-11-03 jas char *s1, *s2, *p1, *p2, *q;
771 63a68686 2008-11-03 jas Awkfloat v = 0.0;
773 63a68686 2008-11-03 jas x = execute(a[0]);
774 63a68686 2008-11-03 jas s1 = getsval(x);
775 63a68686 2008-11-03 jas y = execute(a[1]);
776 63a68686 2008-11-03 jas s2 = getsval(y);
778 63a68686 2008-11-03 jas z = gettemp();
779 63a68686 2008-11-03 jas for (p1 = s1; *p1 != '\0'; p1++) {
780 63a68686 2008-11-03 jas for (q=p1, p2=s2; *p2 != '\0' && *q == *p2; q++, p2++)
782 63a68686 2008-11-03 jas if (*p2 == '\0') {
783 63a68686 2008-11-03 jas v = (Awkfloat) countposn(s1, p1-s1) + 1; /* origin 1 */
787 63a68686 2008-11-03 jas tempfree(x);
788 63a68686 2008-11-03 jas tempfree(y);
789 63a68686 2008-11-03 jas setfval(z, v);
793 63a68686 2008-11-03 jas #define MAXNUMSIZE 50
795 63a68686 2008-11-03 jas int format(char **pbuf, int *pbufsize, char *s, Node *a) /* printf-like conversions */
798 63a68686 2008-11-03 jas char *p, *t, *os;
800 63a68686 2008-11-03 jas int flag = 0, n;
801 63a68686 2008-11-03 jas int fmtwd; /* format width */
802 63a68686 2008-11-03 jas int fmtsz = recsize;
803 63a68686 2008-11-03 jas char *buf = *pbuf;
804 63a68686 2008-11-03 jas int bufsize = *pbufsize;
808 63a68686 2008-11-03 jas if ((fmt = (char *) malloc(fmtsz)) == NULL)
809 63a68686 2008-11-03 jas FATAL("out of memory in format()");
810 63a68686 2008-11-03 jas while (*s) {
811 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, MAXNUMSIZE+1+p-buf, recsize, &p, "format");
812 63a68686 2008-11-03 jas if (*s != '%') {
813 63a68686 2008-11-03 jas *p++ = *s++;
816 63a68686 2008-11-03 jas if (*(s+1) == '%') {
821 63a68686 2008-11-03 jas /* have to be real careful in case this is a huge number, eg, %100000d */
822 63a68686 2008-11-03 jas fmtwd = atoi(s+1);
823 63a68686 2008-11-03 jas if (fmtwd < 0)
824 63a68686 2008-11-03 jas fmtwd = -fmtwd;
825 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format");
826 63a68686 2008-11-03 jas for (t = fmt; (*t++ = *s) != '\0'; s++) {
827 63a68686 2008-11-03 jas if (!adjbuf(&fmt, &fmtsz, MAXNUMSIZE+1+t-fmt, recsize, &t, 0))
828 63a68686 2008-11-03 jas FATAL("format item %.30s... ran format() out of memory", os);
829 63a68686 2008-11-03 jas if (isalpha(*s) && *s != 'l' && *s != 'h' && *s != 'L')
830 63a68686 2008-11-03 jas break; /* the ansi panoply */
831 63a68686 2008-11-03 jas if (*s == '*') {
832 63a68686 2008-11-03 jas x = execute(a);
833 63a68686 2008-11-03 jas a = a->nnext;
834 63a68686 2008-11-03 jas sprintf(t-1, "%d", fmtwd=(int) getfval(x));
835 63a68686 2008-11-03 jas if (fmtwd < 0)
836 63a68686 2008-11-03 jas fmtwd = -fmtwd;
837 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format");
838 63a68686 2008-11-03 jas t = fmt + strlen(fmt);
839 63a68686 2008-11-03 jas tempfree(x);
843 63a68686 2008-11-03 jas if (fmtwd < 0)
844 63a68686 2008-11-03 jas fmtwd = -fmtwd;
845 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, fmtwd+1+p-buf, recsize, &p, "format");
847 63a68686 2008-11-03 jas switch (*s) {
848 63a68686 2008-11-03 jas case 'f': case 'e': case 'g': case 'E': case 'G':
851 63a68686 2008-11-03 jas case 'd': case 'i':
853 63a68686 2008-11-03 jas if(*(s-1) == 'l') break;
854 63a68686 2008-11-03 jas *(t-1) = 'l';
856 63a68686 2008-11-03 jas *++t = '\0';
858 63a68686 2008-11-03 jas case 'o': case 'x': case 'X': case 'u':
859 63a68686 2008-11-03 jas flag = *(s-1) == 'l' ? 2 : 3;
868 63a68686 2008-11-03 jas WARNING("weird printf conversion %s", fmt);
872 63a68686 2008-11-03 jas if (a == NULL)
873 63a68686 2008-11-03 jas FATAL("not enough args in printf(%s)", os);
874 63a68686 2008-11-03 jas x = execute(a);
875 63a68686 2008-11-03 jas a = a->nnext;
876 63a68686 2008-11-03 jas n = MAXNUMSIZE;
877 63a68686 2008-11-03 jas if (fmtwd > n)
879 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, "format");
880 63a68686 2008-11-03 jas switch (flag) {
881 63a68686 2008-11-03 jas case 0: sprintf(p, "%s", fmt); /* unknown, so dump it too */
882 63a68686 2008-11-03 jas t = getsval(x);
883 63a68686 2008-11-03 jas n = strlen(t);
884 63a68686 2008-11-03 jas if (fmtwd > n)
886 63a68686 2008-11-03 jas adjbuf(&buf, &bufsize, 1+strlen(p)+n+p-buf, recsize, &p, "format");
887 63a68686 2008-11-03 jas p += strlen(p);
888 63a68686 2008-11-03 jas sprintf(p, "%s", t);
890 63a68686 2008-11-03 jas case 1: sprintf(p, fmt, getfval(x)); break;
891 63a68686 2008-11-03 jas case 2: sprintf(p, fmt, (long) getfval(x)); break;
892 63a68686 2008-11-03 jas case 3: sprintf(p, fmt, (int) getfval(x)); break;
894 63a68686 2008-11-03 jas t = getsval(x);
895 63a68686 2008-11-03 jas n = strlen(t);
896 63a68686 2008-11-03 jas if (fmtwd > n)
898 63a68686 2008-11-03 jas if (!adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, 0))
899 63a68686 2008-11-03 jas FATAL("huge string/format (%d chars) in printf %.30s... ran format() out of memory", n, t);
900 63a68686 2008-11-03 jas sprintf(p, fmt, t);
903 63a68686 2008-11-03 jas if (isnum(x)) {
904 63a68686 2008-11-03 jas if (getfval(x))
905 63a68686 2008-11-03 jas sprintf(p, fmt, (int) getfval(x));
907 63a68686 2008-11-03 jas *p++ = '\0';
911 63a68686 2008-11-03 jas sprintf(p, fmt, getsval(x)[0]);
914 63a68686 2008-11-03 jas tempfree(x);
915 63a68686 2008-11-03 jas p += strlen(p);
920 63a68686 2008-11-03 jas for ( ; a; a = a->nnext) /* evaluate any remaining args */
922 63a68686 2008-11-03 jas *pbuf = buf;
923 63a68686 2008-11-03 jas *pbufsize = bufsize;
924 63a68686 2008-11-03 jas return p - buf;
927 63a68686 2008-11-03 jas Cell *awksprintf(Node **a, int n) /* sprintf(a[0]) */
932 63a68686 2008-11-03 jas int bufsz=3*recsize;
934 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL)
935 63a68686 2008-11-03 jas FATAL("out of memory in awksprintf");
936 63a68686 2008-11-03 jas y = a[0]->nnext;
937 63a68686 2008-11-03 jas x = execute(a[0]);
938 63a68686 2008-11-03 jas if (format(&buf, &bufsz, getsval(x), y) == -1)
939 63a68686 2008-11-03 jas FATAL("sprintf string %.30s... too long. can't happen.", buf);
940 63a68686 2008-11-03 jas tempfree(x);
941 63a68686 2008-11-03 jas x = gettemp();
942 63a68686 2008-11-03 jas x->sval = buf;
943 63a68686 2008-11-03 jas x->tval = STR;
947 63a68686 2008-11-03 jas Cell *awkprintf(Node **a, int n) /* printf */
948 63a68686 2008-11-03 jas { /* a[0] is list of args, starting with format string */
949 63a68686 2008-11-03 jas /* a[1] is redirection operator, a[2] is redirection file */
955 63a68686 2008-11-03 jas int bufsz=3*recsize;
957 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL)
958 63a68686 2008-11-03 jas FATAL("out of memory in awkprintf");
959 63a68686 2008-11-03 jas y = a[0]->nnext;
960 63a68686 2008-11-03 jas x = execute(a[0]);
961 63a68686 2008-11-03 jas if ((len = format(&buf, &bufsz, getsval(x), y)) == -1)
962 63a68686 2008-11-03 jas FATAL("printf string %.30s... too long. can't happen.", buf);
963 63a68686 2008-11-03 jas tempfree(x);
964 63a68686 2008-11-03 jas if (a[1] == NULL) {
965 63a68686 2008-11-03 jas /* fputs(buf, stdout); */
966 63a68686 2008-11-03 jas fwrite(buf, len, 1, stdout);
967 63a68686 2008-11-03 jas if (ferror(stdout))
968 63a68686 2008-11-03 jas FATAL("write error on stdout");
970 63a68686 2008-11-03 jas fp = redirect(ptoi(a[1]), a[2]);
971 63a68686 2008-11-03 jas /* fputs(buf, fp); */
972 63a68686 2008-11-03 jas fwrite(buf, len, 1, fp);
974 63a68686 2008-11-03 jas if (ferror(fp))
975 63a68686 2008-11-03 jas FATAL("write error on %s", filename(fp));
978 63a68686 2008-11-03 jas return(True);
981 63a68686 2008-11-03 jas Cell *arith(Node **a, int n) /* a[0] + a[1], etc. also -a[0] */
983 63a68686 2008-11-03 jas Awkfloat i, j = 0;
985 63a68686 2008-11-03 jas Cell *x, *y, *z;
987 63a68686 2008-11-03 jas x = execute(a[0]);
988 63a68686 2008-11-03 jas i = getfval(x);
989 63a68686 2008-11-03 jas tempfree(x);
990 63a68686 2008-11-03 jas if (n != UMINUS) {
991 63a68686 2008-11-03 jas y = execute(a[1]);
992 63a68686 2008-11-03 jas j = getfval(y);
993 63a68686 2008-11-03 jas tempfree(y);
995 63a68686 2008-11-03 jas z = gettemp();
996 63a68686 2008-11-03 jas switch (n) {
1000 63a68686 2008-11-03 jas case MINUS:
1006 63a68686 2008-11-03 jas case DIVIDE:
1007 63a68686 2008-11-03 jas if (j == 0)
1008 63a68686 2008-11-03 jas FATAL("division by zero");
1012 63a68686 2008-11-03 jas if (j == 0)
1013 63a68686 2008-11-03 jas FATAL("division by zero in mod");
1014 63a68686 2008-11-03 jas modf(i/j, &v);
1015 63a68686 2008-11-03 jas i = i - j * v;
1017 63a68686 2008-11-03 jas case UMINUS:
1020 63a68686 2008-11-03 jas case POWER:
1021 63a68686 2008-11-03 jas if (j >= 0 && modf(j, &v) == 0.0) /* pos integer exponent */
1022 63a68686 2008-11-03 jas i = ipow(i, (int) j);
1024 63a68686 2008-11-03 jas i = errcheck(pow(i, j), "pow");
1026 63a68686 2008-11-03 jas default: /* can't happen */
1027 63a68686 2008-11-03 jas FATAL("illegal arithmetic operator %d", n);
1029 63a68686 2008-11-03 jas setfval(z, i);
1033 63a68686 2008-11-03 jas double ipow(double x, int n) /* x**n. ought to be done by pow, but isn't always */
1037 63a68686 2008-11-03 jas if (n <= 0)
1039 63a68686 2008-11-03 jas v = ipow(x, n/2);
1040 63a68686 2008-11-03 jas if (n % 2 == 0)
1041 63a68686 2008-11-03 jas return v * v;
1043 63a68686 2008-11-03 jas return x * v * v;
1046 63a68686 2008-11-03 jas Cell *incrdecr(Node **a, int n) /* a[0]++, etc. */
1048 63a68686 2008-11-03 jas Cell *x, *z;
1050 63a68686 2008-11-03 jas Awkfloat xf;
1052 63a68686 2008-11-03 jas x = execute(a[0]);
1053 63a68686 2008-11-03 jas xf = getfval(x);
1054 63a68686 2008-11-03 jas k = (n == PREINCR || n == POSTINCR) ? 1 : -1;
1055 63a68686 2008-11-03 jas if (n == PREINCR || n == PREDECR) {
1056 63a68686 2008-11-03 jas setfval(x, xf + k);
1059 63a68686 2008-11-03 jas z = gettemp();
1060 63a68686 2008-11-03 jas setfval(z, xf);
1061 63a68686 2008-11-03 jas setfval(x, xf + k);
1062 63a68686 2008-11-03 jas tempfree(x);
1066 63a68686 2008-11-03 jas Cell *assign(Node **a, int n) /* a[0] = a[1], a[0] += a[1], etc. */
1067 63a68686 2008-11-03 jas { /* this is subtle; don't muck with it. */
1068 63a68686 2008-11-03 jas Cell *x, *y;
1069 63a68686 2008-11-03 jas Awkfloat xf, yf;
1072 63a68686 2008-11-03 jas y = execute(a[1]);
1073 63a68686 2008-11-03 jas x = execute(a[0]);
1074 63a68686 2008-11-03 jas if (n == ASSIGN) { /* ordinary assignment */
1075 63a68686 2008-11-03 jas if (x == y && !(x->tval & (FLD|REC))) /* self-assignment: */
1076 63a68686 2008-11-03 jas ; /* leave alone unless it's a field */
1077 63a68686 2008-11-03 jas else if ((y->tval & (STR|NUM)) == (STR|NUM)) {
1078 63a68686 2008-11-03 jas setsval(x, getsval(y));
1079 63a68686 2008-11-03 jas x->fval = getfval(y);
1080 63a68686 2008-11-03 jas x->tval |= NUM;
1082 63a68686 2008-11-03 jas else if (isstr(y))
1083 63a68686 2008-11-03 jas setsval(x, getsval(y));
1084 63a68686 2008-11-03 jas else if (isnum(y))
1085 63a68686 2008-11-03 jas setfval(x, getfval(y));
1087 63a68686 2008-11-03 jas funnyvar(y, "read value of");
1088 63a68686 2008-11-03 jas tempfree(y);
1091 63a68686 2008-11-03 jas xf = getfval(x);
1092 63a68686 2008-11-03 jas yf = getfval(y);
1093 63a68686 2008-11-03 jas switch (n) {
1094 63a68686 2008-11-03 jas case ADDEQ:
1097 63a68686 2008-11-03 jas case SUBEQ:
1100 63a68686 2008-11-03 jas case MULTEQ:
1103 63a68686 2008-11-03 jas case DIVEQ:
1104 63a68686 2008-11-03 jas if (yf == 0)
1105 63a68686 2008-11-03 jas FATAL("division by zero in /=");
1108 63a68686 2008-11-03 jas case MODEQ:
1109 63a68686 2008-11-03 jas if (yf == 0)
1110 63a68686 2008-11-03 jas FATAL("division by zero in %%=");
1111 63a68686 2008-11-03 jas modf(xf/yf, &v);
1112 63a68686 2008-11-03 jas xf = xf - yf * v;
1114 63a68686 2008-11-03 jas case POWEQ:
1115 63a68686 2008-11-03 jas if (yf >= 0 && modf(yf, &v) == 0.0) /* pos integer exponent */
1116 63a68686 2008-11-03 jas xf = ipow(xf, (int) yf);
1118 63a68686 2008-11-03 jas xf = errcheck(pow(xf, yf), "pow");
1121 63a68686 2008-11-03 jas FATAL("illegal assignment operator %d", n);
1124 63a68686 2008-11-03 jas tempfree(y);
1125 63a68686 2008-11-03 jas setfval(x, xf);
1129 63a68686 2008-11-03 jas Cell *cat(Node **a, int q) /* a[0] cat a[1] */
1131 63a68686 2008-11-03 jas Cell *x, *y, *z;
1132 63a68686 2008-11-03 jas int n1, n2;
1135 63a68686 2008-11-03 jas x = execute(a[0]);
1136 63a68686 2008-11-03 jas y = execute(a[1]);
1137 63a68686 2008-11-03 jas getsval(x);
1138 63a68686 2008-11-03 jas getsval(y);
1139 63a68686 2008-11-03 jas n1 = strlen(x->sval);
1140 63a68686 2008-11-03 jas n2 = strlen(y->sval);
1141 63a68686 2008-11-03 jas s = (char *) malloc(n1 + n2 + 1);
1142 63a68686 2008-11-03 jas if (s == NULL)
1143 63a68686 2008-11-03 jas FATAL("out of space concatenating %.15s... and %.15s...",
1144 63a68686 2008-11-03 jas x->sval, y->sval);
1145 63a68686 2008-11-03 jas strcpy(s, x->sval);
1146 63a68686 2008-11-03 jas strcpy(s+n1, y->sval);
1147 63a68686 2008-11-03 jas tempfree(y);
1148 63a68686 2008-11-03 jas z = gettemp();
1149 63a68686 2008-11-03 jas z->sval = s;
1150 63a68686 2008-11-03 jas z->tval = STR;
1151 63a68686 2008-11-03 jas tempfree(x);
1155 63a68686 2008-11-03 jas Cell *pastat(Node **a, int n) /* a[0] { a[1] } */
1159 63a68686 2008-11-03 jas if (a[0] == 0)
1160 63a68686 2008-11-03 jas x = execute(a[1]);
1162 63a68686 2008-11-03 jas x = execute(a[0]);
1163 63a68686 2008-11-03 jas if (istrue(x)) {
1164 63a68686 2008-11-03 jas tempfree(x);
1165 63a68686 2008-11-03 jas x = execute(a[1]);
1171 63a68686 2008-11-03 jas Cell *dopa2(Node **a, int n) /* a[0], a[1] { a[2] } */
1176 63a68686 2008-11-03 jas pair = ptoi(a[3]);
1177 63a68686 2008-11-03 jas if (pairstack[pair] == 0) {
1178 63a68686 2008-11-03 jas x = execute(a[0]);
1179 63a68686 2008-11-03 jas if (istrue(x))
1180 63a68686 2008-11-03 jas pairstack[pair] = 1;
1181 63a68686 2008-11-03 jas tempfree(x);
1183 63a68686 2008-11-03 jas if (pairstack[pair] == 1) {
1184 63a68686 2008-11-03 jas x = execute(a[1]);
1185 63a68686 2008-11-03 jas if (istrue(x))
1186 63a68686 2008-11-03 jas pairstack[pair] = 0;
1187 63a68686 2008-11-03 jas tempfree(x);
1188 63a68686 2008-11-03 jas x = execute(a[2]);
1191 63a68686 2008-11-03 jas return(False);
1194 63a68686 2008-11-03 jas Cell *split(Node **a, int nnn) /* split(a[0], a[1], a[2]); a[3] is type */
1196 63a68686 2008-11-03 jas Cell *x = 0, *y, *ap;
1199 63a68686 2008-11-03 jas char *t, temp, num[50], *fs = 0;
1200 63a68686 2008-11-03 jas int n, arg3type;
1202 63a68686 2008-11-03 jas y = execute(a[0]); /* source string */
1203 63a68686 2008-11-03 jas s = getsval(y);
1204 63a68686 2008-11-03 jas arg3type = ptoi(a[3]);
1205 63a68686 2008-11-03 jas if (a[2] == 0) /* fs string */
1207 63a68686 2008-11-03 jas else if (arg3type == STRING) { /* split(str,arr,"string") */
1208 63a68686 2008-11-03 jas x = execute(a[2]);
1209 63a68686 2008-11-03 jas fs = getsval(x);
1210 63a68686 2008-11-03 jas } else if (arg3type == REGEXPR)
1211 63a68686 2008-11-03 jas fs = "(regexpr)"; /* split(str,arr,/regexpr/) */
1213 63a68686 2008-11-03 jas FATAL("illegal type of split");
1215 63a68686 2008-11-03 jas ap = execute(a[1]); /* array name */
1216 63a68686 2008-11-03 jas freesymtab(ap);
1217 63a68686 2008-11-03 jas dprintf( ("split: s=|%s|, a=%s, sep=|%s|\n", s, ap->nval, fs) );
1218 63a68686 2008-11-03 jas ap->tval &= ~STR;
1219 63a68686 2008-11-03 jas ap->tval |= ARR;
1220 63a68686 2008-11-03 jas ap->sval = (char *) makesymtab(NSYMTAB);
1223 63a68686 2008-11-03 jas if ((*s != '\0' && strlen(fs) > 1) || arg3type == REGEXPR) { /* reg expr */
1225 63a68686 2008-11-03 jas if (arg3type == REGEXPR) { /* it's ready already */
1226 63a68686 2008-11-03 jas p = (void *) a[2];
1228 63a68686 2008-11-03 jas p = compre(fs);
1231 63a68686 2008-11-03 jas if (nematch(p,s,t)) {
1234 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1235 63a68686 2008-11-03 jas temp = *patbeg;
1236 63a68686 2008-11-03 jas *patbeg = '\0';
1237 63a68686 2008-11-03 jas if (is_number(t))
1238 63a68686 2008-11-03 jas setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1240 63a68686 2008-11-03 jas setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1241 63a68686 2008-11-03 jas *patbeg = temp;
1242 63a68686 2008-11-03 jas t = patbeg + patlen;
1243 63a68686 2008-11-03 jas if (t[-1] == 0 || *t == 0) {
1245 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1246 63a68686 2008-11-03 jas setsymtab(num, "", 0.0, STR, (Array *) ap->sval);
1247 63a68686 2008-11-03 jas goto spdone;
1249 63a68686 2008-11-03 jas } while (nematch(p,s,t));
1252 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1253 63a68686 2008-11-03 jas if (is_number(t))
1254 63a68686 2008-11-03 jas setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1256 63a68686 2008-11-03 jas setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1259 63a68686 2008-11-03 jas } else if (sep == ' ') {
1260 63a68686 2008-11-03 jas for (n = 0; ; ) {
1261 63a68686 2008-11-03 jas while (*s == ' ' || *s == '\t' || *s == '\n')
1263 63a68686 2008-11-03 jas if (*s == 0)
1269 63a68686 2008-11-03 jas while (*s!=' ' && *s!='\t' && *s!='\n' && *s!='\0');
1272 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1273 63a68686 2008-11-03 jas if (is_number(t))
1274 63a68686 2008-11-03 jas setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1276 63a68686 2008-11-03 jas setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1278 63a68686 2008-11-03 jas if (*s != 0)
1281 63a68686 2008-11-03 jas } else if (sep == 0) { /* new: split(s, a, "") => 1 char/elem */
1282 63a68686 2008-11-03 jas for (n = 0; *s != 0; s++) {
1283 63a68686 2008-11-03 jas char buf[2];
1285 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1286 63a68686 2008-11-03 jas buf[0] = *s;
1287 63a68686 2008-11-03 jas buf[1] = 0;
1288 63a68686 2008-11-03 jas if (isdigit(buf[0]))
1289 63a68686 2008-11-03 jas setsymtab(num, buf, atof(buf), STR|NUM, (Array *) ap->sval);
1291 63a68686 2008-11-03 jas setsymtab(num, buf, 0.0, STR, (Array *) ap->sval);
1293 63a68686 2008-11-03 jas } else if (*s != 0) {
1297 63a68686 2008-11-03 jas while (*s != sep && *s != '\n' && *s != '\0')
1301 63a68686 2008-11-03 jas sprintf(num, "%d", n);
1302 63a68686 2008-11-03 jas if (is_number(t))
1303 63a68686 2008-11-03 jas setsymtab(num, t, atof(t), STR|NUM, (Array *) ap->sval);
1305 63a68686 2008-11-03 jas setsymtab(num, t, 0.0, STR, (Array *) ap->sval);
1307 63a68686 2008-11-03 jas if (*s++ == 0)
1311 63a68686 2008-11-03 jas tempfree(ap);
1312 63a68686 2008-11-03 jas tempfree(y);
1313 63a68686 2008-11-03 jas if (a[2] != 0 && arg3type == STRING)
1314 63a68686 2008-11-03 jas tempfree(x);
1315 63a68686 2008-11-03 jas x = gettemp();
1316 63a68686 2008-11-03 jas x->tval = NUM;
1317 63a68686 2008-11-03 jas x->fval = n;
1321 63a68686 2008-11-03 jas Cell *condexpr(Node **a, int n) /* a[0] ? a[1] : a[2] */
1325 63a68686 2008-11-03 jas x = execute(a[0]);
1326 63a68686 2008-11-03 jas if (istrue(x)) {
1327 63a68686 2008-11-03 jas tempfree(x);
1328 63a68686 2008-11-03 jas x = execute(a[1]);
1330 63a68686 2008-11-03 jas tempfree(x);
1331 63a68686 2008-11-03 jas x = execute(a[2]);
1336 63a68686 2008-11-03 jas Cell *ifstat(Node **a, int n) /* if (a[0]) a[1]; else a[2] */
1340 63a68686 2008-11-03 jas x = execute(a[0]);
1341 63a68686 2008-11-03 jas if (istrue(x)) {
1342 63a68686 2008-11-03 jas tempfree(x);
1343 63a68686 2008-11-03 jas x = execute(a[1]);
1344 63a68686 2008-11-03 jas } else if (a[2] != 0) {
1345 63a68686 2008-11-03 jas tempfree(x);
1346 63a68686 2008-11-03 jas x = execute(a[2]);
1351 63a68686 2008-11-03 jas Cell *whilestat(Node **a, int n) /* while (a[0]) a[1] */
1356 63a68686 2008-11-03 jas x = execute(a[0]);
1357 63a68686 2008-11-03 jas if (!istrue(x))
1359 63a68686 2008-11-03 jas tempfree(x);
1360 63a68686 2008-11-03 jas x = execute(a[1]);
1361 63a68686 2008-11-03 jas if (isbreak(x)) {
1365 63a68686 2008-11-03 jas if (isnext(x) || isexit(x) || isret(x))
1367 63a68686 2008-11-03 jas tempfree(x);
1371 63a68686 2008-11-03 jas Cell *dostat(Node **a, int n) /* do a[0]; while(a[1]) */
1376 63a68686 2008-11-03 jas x = execute(a[0]);
1377 63a68686 2008-11-03 jas if (isbreak(x))
1378 63a68686 2008-11-03 jas return True;
1379 63a68686 2008-11-03 jas if (isnext(x) || isnextfile(x) || isexit(x) || isret(x))
1381 63a68686 2008-11-03 jas tempfree(x);
1382 63a68686 2008-11-03 jas x = execute(a[1]);
1383 63a68686 2008-11-03 jas if (!istrue(x))
1385 63a68686 2008-11-03 jas tempfree(x);
1389 63a68686 2008-11-03 jas Cell *forstat(Node **a, int n) /* for (a[0]; a[1]; a[2]) a[3] */
1393 63a68686 2008-11-03 jas x = execute(a[0]);
1394 63a68686 2008-11-03 jas tempfree(x);
1396 63a68686 2008-11-03 jas if (a[1]!=0) {
1397 63a68686 2008-11-03 jas x = execute(a[1]);
1398 63a68686 2008-11-03 jas if (!istrue(x)) return(x);
1399 63a68686 2008-11-03 jas else tempfree(x);
1401 63a68686 2008-11-03 jas x = execute(a[3]);
1402 63a68686 2008-11-03 jas if (isbreak(x)) /* turn off break */
1403 63a68686 2008-11-03 jas return True;
1404 63a68686 2008-11-03 jas if (isnext(x) || isexit(x) || isret(x))
1406 63a68686 2008-11-03 jas tempfree(x);
1407 63a68686 2008-11-03 jas x = execute(a[2]);
1408 63a68686 2008-11-03 jas tempfree(x);
1412 63a68686 2008-11-03 jas Cell *instat(Node **a, int n) /* for (a[0] in a[1]) a[2] */
1414 63a68686 2008-11-03 jas Cell *x, *vp, *arrayp, *cp, *ncp;
1418 63a68686 2008-11-03 jas vp = execute(a[0]);
1419 63a68686 2008-11-03 jas arrayp = execute(a[1]);
1420 63a68686 2008-11-03 jas if (!isarr(arrayp)) {
1421 63a68686 2008-11-03 jas return True;
1423 63a68686 2008-11-03 jas tp = (Array *) arrayp->sval;
1424 63a68686 2008-11-03 jas tempfree(arrayp);
1425 63a68686 2008-11-03 jas for (i = 0; i < tp->size; i++) { /* this routine knows too much */
1426 63a68686 2008-11-03 jas for (cp = tp->tab[i]; cp != NULL; cp = ncp) {
1427 63a68686 2008-11-03 jas setsval(vp, cp->nval);
1428 63a68686 2008-11-03 jas ncp = cp->cnext;
1429 63a68686 2008-11-03 jas x = execute(a[2]);
1430 63a68686 2008-11-03 jas if (isbreak(x)) {
1431 63a68686 2008-11-03 jas tempfree(vp);
1432 63a68686 2008-11-03 jas return True;
1434 63a68686 2008-11-03 jas if (isnext(x) || isexit(x) || isret(x)) {
1435 63a68686 2008-11-03 jas tempfree(vp);
1438 63a68686 2008-11-03 jas tempfree(x);
1441 63a68686 2008-11-03 jas return True;
1444 63a68686 2008-11-03 jas Cell *bltin(Node **a, int n) /* builtin functions. a[0] is type, a[1] is arg list */
1446 63a68686 2008-11-03 jas Cell *x, *y;
1447 63a68686 2008-11-03 jas Awkfloat u;
1449 63a68686 2008-11-03 jas wchar_t wc;
1450 63a68686 2008-11-03 jas char *p, *buf;
1451 63a68686 2008-11-03 jas char mbc[50];
1452 63a68686 2008-11-03 jas Node *nextarg;
1455 63a68686 2008-11-03 jas t = ptoi(a[0]);
1456 63a68686 2008-11-03 jas x = execute(a[1]);
1457 63a68686 2008-11-03 jas nextarg = a[1]->nnext;
1458 63a68686 2008-11-03 jas switch (t) {
1459 63a68686 2008-11-03 jas case FLENGTH:
1460 63a68686 2008-11-03 jas p = getsval(x);
1461 63a68686 2008-11-03 jas u = (Awkfloat) countposn(p, strlen(p)); break;
1463 63a68686 2008-11-03 jas u = errcheck(log(getfval(x)), "log"); break;
1465 63a68686 2008-11-03 jas modf(getfval(x), &u); break;
1467 63a68686 2008-11-03 jas u = errcheck(exp(getfval(x)), "exp"); break;
1468 63a68686 2008-11-03 jas case FSQRT:
1469 63a68686 2008-11-03 jas u = errcheck(sqrt(getfval(x)), "sqrt"); break;
1471 63a68686 2008-11-03 jas u = sin(getfval(x)); break;
1473 63a68686 2008-11-03 jas u = cos(getfval(x)); break;
1474 63a68686 2008-11-03 jas case FATAN:
1475 63a68686 2008-11-03 jas if (nextarg == 0) {
1476 63a68686 2008-11-03 jas WARNING("atan2 requires two arguments; returning 1.0");
1479 63a68686 2008-11-03 jas y = execute(a[1]->nnext);
1480 63a68686 2008-11-03 jas u = atan2(getfval(x), getfval(y));
1481 63a68686 2008-11-03 jas tempfree(y);
1482 63a68686 2008-11-03 jas nextarg = nextarg->nnext;
1485 63a68686 2008-11-03 jas case FSYSTEM:
1486 63a68686 2008-11-03 jas fflush(stdout); /* in case something is buffered already */
1487 63a68686 2008-11-03 jas u = (Awkfloat) system(getsval(x)) / 256; /* 256 is unix-dep */
1489 63a68686 2008-11-03 jas case FRAND:
1490 63a68686 2008-11-03 jas /* in principle, rand() returns something in 0..RAND_MAX */
1491 63a68686 2008-11-03 jas u = (Awkfloat) (rand() % RAND_MAX) / RAND_MAX;
1493 63a68686 2008-11-03 jas case FSRAND:
1494 63a68686 2008-11-03 jas if (isrec(x)) /* no argument provided */
1495 63a68686 2008-11-03 jas u = time((time_t *)0);
1497 63a68686 2008-11-03 jas u = getfval(x);
1498 63a68686 2008-11-03 jas srand((unsigned int) u);
1500 63a68686 2008-11-03 jas case FTOUPPER:
1501 63a68686 2008-11-03 jas case FTOLOWER:
1502 63a68686 2008-11-03 jas buf = tostring(getsval(x));
1503 63a68686 2008-11-03 jas if (t == FTOUPPER) {
1504 63a68686 2008-11-03 jas for (p = buf; *p; p++)
1505 63a68686 2008-11-03 jas if (islower(*p))
1506 63a68686 2008-11-03 jas *p = toupper(*p);
1508 63a68686 2008-11-03 jas for (p = buf; *p; p++)
1509 63a68686 2008-11-03 jas if (isupper(*p))
1510 63a68686 2008-11-03 jas *p = tolower(*p);
1512 63a68686 2008-11-03 jas tempfree(x);
1513 63a68686 2008-11-03 jas x = gettemp();
1514 63a68686 2008-11-03 jas setsval(x, buf);
1517 63a68686 2008-11-03 jas case FFLUSH:
1518 63a68686 2008-11-03 jas if ((fp = openfile(FFLUSH, getsval(x))) == NULL)
1521 63a68686 2008-11-03 jas u = fflush(fp);
1524 63a68686 2008-11-03 jas wc = (int)getfval(x);
1525 63a68686 2008-11-03 jas mbc[wctomb(mbc, wc)] = 0;
1526 63a68686 2008-11-03 jas tempfree(x);
1527 63a68686 2008-11-03 jas x = gettemp();
1528 63a68686 2008-11-03 jas setsval(x, mbc);
1530 63a68686 2008-11-03 jas default: /* can't happen */
1531 63a68686 2008-11-03 jas FATAL("illegal function type %d", t);
1534 63a68686 2008-11-03 jas tempfree(x);
1535 63a68686 2008-11-03 jas x = gettemp();
1536 63a68686 2008-11-03 jas setfval(x, u);
1537 63a68686 2008-11-03 jas if (nextarg != 0) {
1538 63a68686 2008-11-03 jas WARNING("warning: function has too many arguments");
1539 63a68686 2008-11-03 jas for ( ; nextarg; nextarg = nextarg->nnext)
1540 63a68686 2008-11-03 jas execute(nextarg);
1545 63a68686 2008-11-03 jas Cell *printstat(Node **a, int n) /* print a[0] */
1552 63a68686 2008-11-03 jas if (a[1] == 0) /* a[1] is redirection operator, a[2] is file */
1553 63a68686 2008-11-03 jas fp = stdout;
1555 63a68686 2008-11-03 jas fp = redirect(ptoi(a[1]), a[2]);
1556 63a68686 2008-11-03 jas for (x = a[0]; x != NULL; x = x->nnext) {
1557 63a68686 2008-11-03 jas y = execute(x);
1558 63a68686 2008-11-03 jas fputs(getsval(y), fp);
1559 63a68686 2008-11-03 jas tempfree(y);
1560 63a68686 2008-11-03 jas if (x->nnext == NULL)
1561 63a68686 2008-11-03 jas r = fputs(*ORS, fp);
1563 63a68686 2008-11-03 jas r = fputs(*OFS, fp);
1564 63a68686 2008-11-03 jas if (r == EOF)
1565 63a68686 2008-11-03 jas FATAL("write error on %s", filename(fp));
1567 63a68686 2008-11-03 jas if (a[1] != 0)
1568 63a68686 2008-11-03 jas if (fflush(fp) == EOF)
1569 63a68686 2008-11-03 jas FATAL("write error on %s", filename(fp));
1570 63a68686 2008-11-03 jas return(True);
1573 63a68686 2008-11-03 jas Cell *nullproc(Node **a, int n)
1581 63a68686 2008-11-03 jas FILE *redirect(int a, Node *b) /* set up all i/o redirections */
1585 63a68686 2008-11-03 jas char *fname;
1587 63a68686 2008-11-03 jas x = execute(b);
1588 63a68686 2008-11-03 jas fname = getsval(x);
1589 63a68686 2008-11-03 jas fp = openfile(a, fname);
1590 63a68686 2008-11-03 jas if (fp == NULL)
1591 63a68686 2008-11-03 jas FATAL("can't open file %s", fname);
1592 63a68686 2008-11-03 jas tempfree(x);
1596 63a68686 2008-11-03 jas struct files {
1598 63a68686 2008-11-03 jas char *fname;
1599 63a68686 2008-11-03 jas int mode; /* '|', 'a', 'w' => LE/LT, GT */
1600 63a68686 2008-11-03 jas } files[FOPEN_MAX] ={
1601 63a68686 2008-11-03 jas { NULL, "/dev/stdin", LT }, /* watch out: don't free this! */
1602 63a68686 2008-11-03 jas { NULL, "/dev/stdout", GT },
1603 63a68686 2008-11-03 jas { NULL, "/dev/stderr", GT }
1606 63a68686 2008-11-03 jas void stdinit(void) /* in case stdin, etc., are not constants */
1608 63a68686 2008-11-03 jas files[0].fp = stdin;
1609 63a68686 2008-11-03 jas files[1].fp = stdout;
1610 63a68686 2008-11-03 jas files[2].fp = stderr;
1613 63a68686 2008-11-03 jas FILE *openfile(int a, char *us)
1615 63a68686 2008-11-03 jas char *s = us;
1617 63a68686 2008-11-03 jas FILE *fp = 0;
1619 63a68686 2008-11-03 jas if (*s == '\0')
1620 63a68686 2008-11-03 jas FATAL("null file name in print or getline");
1621 63a68686 2008-11-03 jas for (i=0; i < FOPEN_MAX; i++)
1622 63a68686 2008-11-03 jas if (files[i].fname && strcmp(s, files[i].fname) == 0) {
1623 63a68686 2008-11-03 jas if (a == files[i].mode || (a==APPEND && files[i].mode==GT))
1624 63a68686 2008-11-03 jas return files[i].fp;
1625 63a68686 2008-11-03 jas if (a == FFLUSH)
1626 63a68686 2008-11-03 jas return files[i].fp;
1628 63a68686 2008-11-03 jas if (a == FFLUSH) /* didn't find it, so don't create it! */
1629 63a68686 2008-11-03 jas return NULL;
1631 63a68686 2008-11-03 jas for (i=0; i < FOPEN_MAX; i++)
1632 63a68686 2008-11-03 jas if (files[i].fp == 0)
1634 63a68686 2008-11-03 jas if (i >= FOPEN_MAX)
1635 63a68686 2008-11-03 jas FATAL("%s makes too many open files", s);
1636 63a68686 2008-11-03 jas fflush(stdout); /* force a semblance of order */
1638 63a68686 2008-11-03 jas if (a == GT) {
1639 63a68686 2008-11-03 jas fp = fopen(s, "w");
1640 63a68686 2008-11-03 jas } else if (a == APPEND) {
1641 63a68686 2008-11-03 jas fp = fopen(s, "a");
1642 63a68686 2008-11-03 jas m = GT; /* so can mix > and >> */
1643 63a68686 2008-11-03 jas } else if (a == '|') { /* output pipe */
1644 63a68686 2008-11-03 jas fp = popen(s, "w");
1645 63a68686 2008-11-03 jas } else if (a == LE) { /* input pipe */
1646 63a68686 2008-11-03 jas fp = popen(s, "r");
1647 63a68686 2008-11-03 jas } else if (a == LT) { /* getline <file */
1648 63a68686 2008-11-03 jas fp = strcmp(s, "-") == 0 ? stdin : fopen(s, "r"); /* "-" is stdin */
1649 63a68686 2008-11-03 jas } else /* can't happen */
1650 63a68686 2008-11-03 jas FATAL("illegal redirection %d", a);
1651 63a68686 2008-11-03 jas if (fp != NULL) {
1652 63a68686 2008-11-03 jas files[i].fname = tostring(s);
1653 63a68686 2008-11-03 jas files[i].fp = fp;
1654 63a68686 2008-11-03 jas files[i].mode = m;
1659 63a68686 2008-11-03 jas char *filename(FILE *fp)
1663 63a68686 2008-11-03 jas for (i = 0; i < FOPEN_MAX; i++)
1664 63a68686 2008-11-03 jas if (fp == files[i].fp)
1665 63a68686 2008-11-03 jas return files[i].fname;
1666 63a68686 2008-11-03 jas return "???";
1669 63a68686 2008-11-03 jas Cell *closefile(Node **a, int n)
1672 63a68686 2008-11-03 jas int i, stat;
1675 63a68686 2008-11-03 jas x = execute(a[0]);
1676 63a68686 2008-11-03 jas getsval(x);
1677 63a68686 2008-11-03 jas for (i = 0; i < FOPEN_MAX; i++)
1678 63a68686 2008-11-03 jas if (files[i].fname && strcmp(x->sval, files[i].fname) == 0) {
1679 63a68686 2008-11-03 jas if (ferror(files[i].fp))
1680 63a68686 2008-11-03 jas WARNING( "i/o error occurred on %s", files[i].fname );
1681 63a68686 2008-11-03 jas if (files[i].mode == '|' || files[i].mode == LE)
1682 63a68686 2008-11-03 jas stat = pclose(files[i].fp);
1684 63a68686 2008-11-03 jas stat = fclose(files[i].fp);
1685 63a68686 2008-11-03 jas if (stat == EOF)
1686 63a68686 2008-11-03 jas WARNING( "i/o error occurred closing %s", files[i].fname );
1687 63a68686 2008-11-03 jas if (i > 2) /* don't do /dev/std... */
1688 63a68686 2008-11-03 jas xfree(files[i].fname);
1689 63a68686 2008-11-03 jas files[i].fname = NULL; /* watch out for ref thru this */
1690 63a68686 2008-11-03 jas files[i].fp = NULL;
1692 63a68686 2008-11-03 jas tempfree(x);
1693 63a68686 2008-11-03 jas return(True);
1696 63a68686 2008-11-03 jas void closeall(void)
1698 63a68686 2008-11-03 jas int i, stat;
1700 63a68686 2008-11-03 jas for (i = 0; i < FOPEN_MAX; i++)
1701 63a68686 2008-11-03 jas if (files[i].fp) {
1702 63a68686 2008-11-03 jas if (ferror(files[i].fp))
1703 63a68686 2008-11-03 jas WARNING( "i/o error occurred on %s", files[i].fname );
1704 63a68686 2008-11-03 jas if (files[i].mode == '|' || files[i].mode == LE)
1705 63a68686 2008-11-03 jas stat = pclose(files[i].fp);
1707 63a68686 2008-11-03 jas stat = fclose(files[i].fp);
1708 63a68686 2008-11-03 jas if (stat == EOF)
1709 63a68686 2008-11-03 jas WARNING( "i/o error occurred while closing %s", files[i].fname );
1713 63a68686 2008-11-03 jas void backsub(char **pb_ptr, char **sptr_ptr);
1715 63a68686 2008-11-03 jas Cell *sub(Node **a, int nnn) /* substitute command */
1717 63a68686 2008-11-03 jas char *sptr, *pb, *q;
1718 63a68686 2008-11-03 jas Cell *x, *y, *result;
1719 63a68686 2008-11-03 jas char *t, *buf;
1721 63a68686 2008-11-03 jas int bufsz = recsize;
1723 63a68686 2008-11-03 jas if ((buf = (char *) malloc(bufsz)) == NULL)
1724 63a68686 2008-11-03 jas FATAL("out of memory in sub");
1725 63a68686 2008-11-03 jas x = execute(a[3]); /* target string */
1726 63a68686 2008-11-03 jas t = getsval(x);
1727 63a68686 2008-11-03 jas if (a[0] == 0) /* 0 => a[1] is already-compiled regexpr */
1728 63a68686 2008-11-03 jas p = (void *) a[1]; /* regular expression */
1730 63a68686 2008-11-03 jas y = execute(a[1]);
1731 63a68686 2008-11-03 jas p = compre(getsval(y));
1732 63a68686 2008-11-03 jas tempfree(y);
1734 63a68686 2008-11-03 jas y = execute(a[2]); /* replacement string */
1735 63a68686 2008-11-03 jas result = False;
1736 63a68686 2008-11-03 jas if (pmatch(p, t, t)) {
1738 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+patbeg-sptr, recsize, 0, "sub");
1740 63a68686 2008-11-03 jas while (sptr < patbeg)
1741 63a68686 2008-11-03 jas *pb++ = *sptr++;
1742 63a68686 2008-11-03 jas sptr = getsval(y);
1743 63a68686 2008-11-03 jas while (*sptr != 0) {
1744 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "sub");
1745 63a68686 2008-11-03 jas if (*sptr == '\\') {
1746 63a68686 2008-11-03 jas backsub(&pb, &sptr);
1747 63a68686 2008-11-03 jas } else if (*sptr == '&') {
1749 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "sub");
1750 63a68686 2008-11-03 jas for (q = patbeg; q < patbeg+patlen; )
1751 63a68686 2008-11-03 jas *pb++ = *q++;
1753 63a68686 2008-11-03 jas *pb++ = *sptr++;
1755 63a68686 2008-11-03 jas *pb = '\0';
1756 63a68686 2008-11-03 jas if (pb > buf + bufsz)
1757 63a68686 2008-11-03 jas FATAL("sub result1 %.30s too big; can't happen", buf);
1758 63a68686 2008-11-03 jas sptr = patbeg + patlen;
1759 63a68686 2008-11-03 jas if ((patlen == 0 && *patbeg) || (patlen && *(sptr-1))) {
1760 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+strlen(sptr)+pb-buf, 0, &pb, "sub");
1761 63a68686 2008-11-03 jas while ((*pb++ = *sptr++) != 0)
1764 63a68686 2008-11-03 jas if (pb > buf + bufsz)
1765 63a68686 2008-11-03 jas FATAL("sub result2 %.30s too big; can't happen", buf);
1766 63a68686 2008-11-03 jas setsval(x, buf); /* BUG: should be able to avoid copy */
1767 63a68686 2008-11-03 jas result = True;;
1769 63a68686 2008-11-03 jas tempfree(x);
1770 63a68686 2008-11-03 jas tempfree(y);
1772 63a68686 2008-11-03 jas return result;
1775 63a68686 2008-11-03 jas Cell *gsub(Node **a, int nnn) /* global substitute */
1777 63a68686 2008-11-03 jas Cell *x, *y;
1778 63a68686 2008-11-03 jas char *rptr, *sptr, *t, *pb, *c;
1781 63a68686 2008-11-03 jas int mflag, num;
1782 63a68686 2008-11-03 jas int bufsz = recsize;
1784 63a68686 2008-11-03 jas if ((buf = (char *)malloc(bufsz)) == NULL)
1785 63a68686 2008-11-03 jas FATAL("out of memory in gsub");
1786 63a68686 2008-11-03 jas mflag = 0; /* if mflag == 0, can replace empty string */
1788 63a68686 2008-11-03 jas x = execute(a[3]); /* target string */
1789 63a68686 2008-11-03 jas c = t = getsval(x);
1790 63a68686 2008-11-03 jas if (a[0] == 0) /* 0 => a[1] is already-compiled regexpr */
1791 63a68686 2008-11-03 jas p = (void *) a[1]; /* regular expression */
1793 63a68686 2008-11-03 jas y = execute(a[1]);
1794 63a68686 2008-11-03 jas p = compre(getsval(y));
1795 63a68686 2008-11-03 jas tempfree(y);
1797 63a68686 2008-11-03 jas y = execute(a[2]); /* replacement string */
1798 63a68686 2008-11-03 jas if (pmatch(p, t, c)) {
1800 63a68686 2008-11-03 jas rptr = getsval(y);
1802 63a68686 2008-11-03 jas if (patlen == 0 && *patbeg != 0) { /* matched empty string */
1803 63a68686 2008-11-03 jas if (mflag == 0) { /* can replace empty */
1805 63a68686 2008-11-03 jas sptr = rptr;
1806 63a68686 2008-11-03 jas while (*sptr != 0) {
1807 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "gsub");
1808 63a68686 2008-11-03 jas if (*sptr == '\\') {
1809 63a68686 2008-11-03 jas backsub(&pb, &sptr);
1810 63a68686 2008-11-03 jas } else if (*sptr == '&') {
1813 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "gsub");
1814 63a68686 2008-11-03 jas for (q = patbeg; q < patbeg+patlen; )
1815 63a68686 2008-11-03 jas *pb++ = *q++;
1817 63a68686 2008-11-03 jas *pb++ = *sptr++;
1820 63a68686 2008-11-03 jas if (*c == 0) /* at end */
1822 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 2+pb-buf, recsize, &pb, "gsub");
1823 63a68686 2008-11-03 jas *pb++ = *c++;
1824 63a68686 2008-11-03 jas if (pb > buf + bufsz) /* BUG: not sure of this test */
1825 63a68686 2008-11-03 jas FATAL("gsub result0 %.30s too big; can't happen", buf);
1828 63a68686 2008-11-03 jas else { /* matched nonempty string */
1831 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+(patbeg-sptr)+pb-buf, recsize, &pb, "gsub");
1832 63a68686 2008-11-03 jas while (sptr < patbeg)
1833 63a68686 2008-11-03 jas *pb++ = *sptr++;
1834 63a68686 2008-11-03 jas sptr = rptr;
1835 63a68686 2008-11-03 jas while (*sptr != 0) {
1836 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 5+pb-buf, recsize, &pb, "gsub");
1837 63a68686 2008-11-03 jas if (*sptr == '\\') {
1838 63a68686 2008-11-03 jas backsub(&pb, &sptr);
1839 63a68686 2008-11-03 jas } else if (*sptr == '&') {
1842 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+patlen+pb-buf, recsize, &pb, "gsub");
1843 63a68686 2008-11-03 jas for (q = patbeg; q < patbeg+patlen; )
1844 63a68686 2008-11-03 jas *pb++ = *q++;
1846 63a68686 2008-11-03 jas *pb++ = *sptr++;
1848 63a68686 2008-11-03 jas c = patbeg + patlen;
1849 63a68686 2008-11-03 jas if ((c[-1] == 0) || (*c == 0))
1851 63a68686 2008-11-03 jas if (pb > buf + bufsz)
1852 63a68686 2008-11-03 jas FATAL("gsub result1 %.30s too big; can't happen", buf);
1855 63a68686 2008-11-03 jas } while (pmatch(p, t, c));
1857 63a68686 2008-11-03 jas adjbuf(&buf, &bufsz, 1+strlen(sptr)+pb-buf, 0, &pb, "gsub");
1858 63a68686 2008-11-03 jas while ((*pb++ = *sptr++) != 0)
1860 63a68686 2008-11-03 jas done: if (pb > buf + bufsz)
1861 63a68686 2008-11-03 jas FATAL("gsub result2 %.30s too big; can't happen", buf);
1862 63a68686 2008-11-03 jas *pb = '\0';
1863 63a68686 2008-11-03 jas setsval(x, buf); /* BUG: should be able to avoid copy + free */
1865 63a68686 2008-11-03 jas tempfree(x);
1866 63a68686 2008-11-03 jas tempfree(y);
1867 63a68686 2008-11-03 jas x = gettemp();
1868 63a68686 2008-11-03 jas x->tval = NUM;
1869 63a68686 2008-11-03 jas x->fval = num;
1874 63a68686 2008-11-03 jas void backsub(char **pb_ptr, char **sptr_ptr) /* handle \\& variations */
1875 63a68686 2008-11-03 jas { /* sptr[0] == '\\' */
1876 63a68686 2008-11-03 jas char *pb = *pb_ptr, *sptr = *sptr_ptr;
1878 63a68686 2008-11-03 jas if (sptr[1] == '\\') {
1879 63a68686 2008-11-03 jas if (sptr[2] == '\\' && sptr[3] == '&') { /* \\\& -> \& */
1880 63a68686 2008-11-03 jas *pb++ = '\\';
1881 63a68686 2008-11-03 jas *pb++ = '&';
1883 63a68686 2008-11-03 jas } else if (sptr[2] == '&') { /* \\& -> \ + matched */
1884 63a68686 2008-11-03 jas *pb++ = '\\';
1886 63a68686 2008-11-03 jas } else { /* \\x -> \\x */
1887 63a68686 2008-11-03 jas *pb++ = *sptr++;
1888 63a68686 2008-11-03 jas *pb++ = *sptr++;
1890 63a68686 2008-11-03 jas } else if (sptr[1] == '&') { /* literal & */
1892 63a68686 2008-11-03 jas *pb++ = *sptr++;
1893 63a68686 2008-11-03 jas } else /* literal \ */
1894 63a68686 2008-11-03 jas *pb++ = *sptr++;
1896 63a68686 2008-11-03 jas *pb_ptr = pb;
1897 63a68686 2008-11-03 jas *sptr_ptr = sptr;
