Annotation of src/usr.bin/awk/lib.c, Revision 1.19
1.19 ! millert 1: /* $OpenBSD: lib.c,v 1.18 2008/10/06 20:38:33 millert Exp $ */
1.1 tholo 2: /****************************************************************
1.4 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.4 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 <string.h>
29: #include <ctype.h>
30: #include <errno.h>
31: #include <stdlib.h>
1.9 deraadt 32: #include <unistd.h>
1.7 millert 33: #include <stdarg.h>
1.1 tholo 34: #include "awk.h"
1.4 kstailey 35: #include "ytab.h"
1.1 tholo 36:
37: FILE *infile = NULL;
38: char *file = "";
1.4 kstailey 39: char *record;
1.1 tholo 40: int recsize = RECSIZE;
41: char *fields;
1.4 kstailey 42: int fieldssize = RECSIZE;
43:
44: Cell **fldtab; /* pointers to Cells */
1.5 millert 45: char inputFS[100] = " ";
1.1 tholo 46:
1.18 millert 47: #define MAXFLD 2
1.4 kstailey 48: int nfields = MAXFLD; /* last allocated slot for $i */
1.1 tholo 49:
50: int donefld; /* 1 = implies rec broken into fields */
51: int donerec; /* 1 = record is valid (no flds have changed) */
52:
1.4 kstailey 53: int lastfld = 0; /* last used field */
1.1 tholo 54: int argno = 1; /* current input argument number */
55: extern Awkfloat *ARGC;
56:
1.4 kstailey 57: static Cell dollar0 = { OCELL, CFLD, NULL, "", 0.0, REC|STR|DONTFREE };
58: static Cell dollar1 = { OCELL, CFLD, NULL, "", 0.0, FLD|STR|DONTFREE };
59:
1.1 tholo 60: void recinit(unsigned int n)
61: {
1.18 millert 62: if ( (record = (char *) malloc(n)) == NULL
63: || (fields = (char *) malloc(n+1)) == NULL
64: || (fldtab = (Cell **) calloc(nfields+1, sizeof(Cell *))) == NULL
65: || (fldtab[0] = (Cell *) malloc(sizeof(Cell))) == NULL )
1.7 millert 66: FATAL("out of space for $0 and fields");
1.4 kstailey 67: *fldtab[0] = dollar0;
68: fldtab[0]->sval = record;
69: fldtab[0]->nval = tostring("0");
70: makefields(1, nfields);
71: }
72:
73: void makefields(int n1, int n2) /* create $n1..$n2 inclusive */
74: {
75: char temp[50];
1.1 tholo 76: int i;
77:
1.4 kstailey 78: for (i = n1; i <= n2; i++) {
79: fldtab[i] = (Cell *) malloc(sizeof (struct Cell));
80: if (fldtab[i] == NULL)
1.7 millert 81: FATAL("out of space in makefields %d", i);
1.4 kstailey 82: *fldtab[i] = dollar1;
1.12 deraadt 83: snprintf(temp, sizeof temp, "%d", i);
1.4 kstailey 84: fldtab[i]->nval = tostring(temp);
85: }
1.1 tholo 86: }
87:
88: void initgetrec(void)
89: {
90: int i;
91: char *p;
92:
93: for (i = 1; i < *ARGC; i++) {
94: if (!isclvar(p = getargv(i))) { /* find 1st real filename */
95: setsval(lookup("FILENAME", symtab), getargv(i));
96: return;
97: }
98: setclvar(p); /* a commandline assignment before filename */
99: argno++;
100: }
101: infile = stdin; /* no filenames, so use stdin */
102: }
103:
1.15 millert 104: static int firsttime = 1;
105:
1.4 kstailey 106: int getrec(char **pbuf, int *pbufsize, int isrecord) /* get next input record */
107: { /* note: cares whether buf == record */
1.1 tholo 108: int c;
1.4 kstailey 109: char *buf = *pbuf;
1.18 millert 110: uschar saveb0;
111: int bufsize = *pbufsize, savebufsize = bufsize;
1.1 tholo 112:
113: if (firsttime) {
114: firsttime = 0;
115: initgetrec();
116: }
1.4 kstailey 117: dprintf( ("RS=<%s>, FS=<%s>, ARGC=%g, FILENAME=%s\n",
1.1 tholo 118: *RS, *FS, *ARGC, *FILENAME) );
1.5 millert 119: if (isrecord) {
120: donefld = 0;
121: donerec = 1;
122: }
1.18 millert 123: saveb0 = buf[0];
1.1 tholo 124: buf[0] = 0;
125: while (argno < *ARGC || infile == stdin) {
1.4 kstailey 126: dprintf( ("argno=%d, file=|%s|\n", argno, file) );
1.1 tholo 127: if (infile == NULL) { /* have to open a new file */
128: file = getargv(argno);
129: if (*file == '\0') { /* it's been zapped */
130: argno++;
131: continue;
132: }
133: if (isclvar(file)) { /* a var=value arg */
134: setclvar(file);
135: argno++;
136: continue;
137: }
138: *FILENAME = file;
1.4 kstailey 139: dprintf( ("opening file %s\n", file) );
1.1 tholo 140: if (*file == '-' && *(file+1) == '\0')
141: infile = stdin;
1.4 kstailey 142: else if ((infile = fopen(file, "r")) == NULL)
1.7 millert 143: FATAL("can't open file %s", file);
1.1 tholo 144: setfval(fnrloc, 0.0);
145: }
1.4 kstailey 146: c = readrec(&buf, &bufsize, infile);
1.1 tholo 147: if (c != 0 || buf[0] != '\0') { /* normal record */
1.4 kstailey 148: if (isrecord) {
149: if (freeable(fldtab[0]))
150: xfree(fldtab[0]->sval);
151: fldtab[0]->sval = buf; /* buf == record */
152: fldtab[0]->tval = REC | STR | DONTFREE;
1.5 millert 153: if (is_number(fldtab[0]->sval)) {
1.4 kstailey 154: fldtab[0]->fval = atof(fldtab[0]->sval);
155: fldtab[0]->tval |= NUM;
1.1 tholo 156: }
157: }
158: setfval(nrloc, nrloc->fval+1);
159: setfval(fnrloc, fnrloc->fval+1);
1.4 kstailey 160: *pbuf = buf;
161: *pbufsize = bufsize;
1.1 tholo 162: return 1;
163: }
164: /* EOF arrived on this file; set up next */
165: if (infile != stdin)
166: fclose(infile);
167: infile = NULL;
168: argno++;
169: }
1.18 millert 170: buf[0] = saveb0;
1.4 kstailey 171: *pbuf = buf;
1.18 millert 172: *pbufsize = savebufsize;
1.1 tholo 173: return 0; /* true end of file */
174: }
175:
176: void nextfile(void)
177: {
1.18 millert 178: if (infile != NULL && infile != stdin)
1.1 tholo 179: fclose(infile);
180: infile = NULL;
181: argno++;
182: }
183:
1.4 kstailey 184: int readrec(char **pbuf, int *pbufsize, FILE *inf) /* read one record into buf */
1.1 tholo 185: {
186: int sep, c;
1.4 kstailey 187: char *rr, *buf = *pbuf;
188: int bufsize = *pbufsize;
1.1 tholo 189:
1.4 kstailey 190: if (strlen(*FS) >= sizeof(inputFS))
1.7 millert 191: FATAL("field separator %.10s... is too long", *FS);
1.12 deraadt 192: strlcpy(inputFS, *FS, sizeof inputFS); /* for subsequent field splitting */
1.1 tholo 193: if ((sep = **RS) == 0) {
194: sep = '\n';
195: while ((c=getc(inf)) == '\n' && c != EOF) /* skip leading \n's */
196: ;
197: if (c != EOF)
198: ungetc(c, inf);
199: }
1.4 kstailey 200: for (rr = buf; ; ) {
201: for (; (c=getc(inf)) != sep && c != EOF; ) {
202: if (rr-buf+1 > bufsize)
203: if (!adjbuf(&buf, &bufsize, 1+rr-buf, recsize, &rr, "readrec 1"))
1.7 millert 204: FATAL("input record `%.30s...' too long", buf);
1.4 kstailey 205: *rr++ = c;
206: }
1.1 tholo 207: if (**RS == sep || c == EOF)
208: break;
209: if ((c = getc(inf)) == '\n' || c == EOF) /* 2 in a row */
210: break;
1.4 kstailey 211: if (!adjbuf(&buf, &bufsize, 2+rr-buf, recsize, &rr, "readrec 2"))
1.7 millert 212: FATAL("input record `%.30s...' too long", buf);
1.1 tholo 213: *rr++ = '\n';
214: *rr++ = c;
215: }
1.4 kstailey 216: if (!adjbuf(&buf, &bufsize, 1+rr-buf, recsize, &rr, "readrec 3"))
1.7 millert 217: FATAL("input record `%.30s...' too long", buf);
1.1 tholo 218: *rr = 0;
1.4 kstailey 219: dprintf( ("readrec saw <%s>, returns %d\n", buf, c == EOF && rr == buf ? 0 : 1) );
220: *pbuf = buf;
221: *pbufsize = bufsize;
1.1 tholo 222: return c == EOF && rr == buf ? 0 : 1;
223: }
224:
225: char *getargv(int n) /* get ARGV[n] */
226: {
227: Cell *x;
1.4 kstailey 228: char *s, temp[50];
1.1 tholo 229: extern Array *ARGVtab;
230:
1.12 deraadt 231: snprintf(temp, sizeof temp, "%d", n);
1.1 tholo 232: x = setsymtab(temp, "", 0.0, STR, ARGVtab);
233: s = getsval(x);
1.4 kstailey 234: dprintf( ("getargv(%d) returns |%s|\n", n, s) );
1.1 tholo 235: return s;
236: }
237:
238: void setclvar(char *s) /* set var=value from s */
239: {
240: char *p;
241: Cell *q;
242:
243: for (p=s; *p != '='; p++)
244: ;
245: *p++ = 0;
246: p = qstring(p, '\0');
247: q = setsymtab(s, p, 0.0, STR, symtab);
248: setsval(q, p);
1.5 millert 249: if (is_number(q->sval)) {
1.1 tholo 250: q->fval = atof(q->sval);
251: q->tval |= NUM;
252: }
1.4 kstailey 253: dprintf( ("command line set %s to |%s|\n", s, p) );
1.1 tholo 254: }
255:
256:
257: void fldbld(void) /* create fields from current record */
258: {
1.4 kstailey 259: /* this relies on having fields[] the same length as $0 */
260: /* the fields are all stored in this one array with \0's */
1.1 tholo 261: char *r, *fr, sep;
262: Cell *p;
1.4 kstailey 263: int i, j, n;
1.1 tholo 264:
265: if (donefld)
266: return;
1.4 kstailey 267: if (!isstr(fldtab[0]))
268: getsval(fldtab[0]);
269: r = fldtab[0]->sval;
270: n = strlen(r);
271: if (n > fieldssize) {
272: xfree(fields);
273: if ((fields = (char *) malloc(n+1)) == NULL)
1.7 millert 274: FATAL("out of space for fields in fldbld %d", n);
1.4 kstailey 275: fieldssize = n;
276: }
1.1 tholo 277: fr = fields;
278: i = 0; /* number of fields accumulated here */
1.19 ! millert 279: strlcpy(inputFS, *FS, sizeof(inputFS));
1.2 millert 280: if (strlen(inputFS) > 1) { /* it's a regular expression */
281: i = refldbld(r, inputFS);
282: } else if ((sep = *inputFS) == ' ') { /* default whitespace */
1.1 tholo 283: for (i = 0; ; ) {
284: while (*r == ' ' || *r == '\t' || *r == '\n')
285: r++;
286: if (*r == 0)
287: break;
288: i++;
1.4 kstailey 289: if (i > nfields)
290: growfldtab(i);
291: if (freeable(fldtab[i]))
292: xfree(fldtab[i]->sval);
293: fldtab[i]->sval = fr;
294: fldtab[i]->tval = FLD | STR | DONTFREE;
1.1 tholo 295: do
296: *fr++ = *r++;
297: while (*r != ' ' && *r != '\t' && *r != '\n' && *r != '\0');
298: *fr++ = 0;
299: }
300: *fr = 0;
1.2 millert 301: } else if ((sep = *inputFS) == 0) { /* new: FS="" => 1 char/field */
1.1 tholo 302: for (i = 0; *r != 0; r++) {
303: char buf[2];
304: i++;
1.4 kstailey 305: if (i > nfields)
306: growfldtab(i);
307: if (freeable(fldtab[i]))
308: xfree(fldtab[i]->sval);
1.1 tholo 309: buf[0] = *r;
310: buf[1] = 0;
1.4 kstailey 311: fldtab[i]->sval = tostring(buf);
312: fldtab[i]->tval = FLD | STR;
1.1 tholo 313: }
314: *fr = 0;
315: } else if (*r != 0) { /* if 0, it's a null field */
1.15 millert 316: /* subtlecase : if length(FS) == 1 && length(RS > 0)
317: * \n is NOT a field separator (cf awk book 61,84).
318: * this variable is tested in the inner while loop.
319: */
320: int rtest = '\n'; /* normal case */
321: if (strlen(*RS) > 0)
322: rtest = '\0';
1.1 tholo 323: for (;;) {
324: i++;
1.4 kstailey 325: if (i > nfields)
326: growfldtab(i);
327: if (freeable(fldtab[i]))
328: xfree(fldtab[i]->sval);
329: fldtab[i]->sval = fr;
330: fldtab[i]->tval = FLD | STR | DONTFREE;
1.15 millert 331: while (*r != sep && *r != rtest && *r != '\0') /* \n is always a separator */
1.1 tholo 332: *fr++ = *r++;
333: *fr++ = 0;
334: if (*r++ == 0)
335: break;
336: }
337: *fr = 0;
338: }
1.4 kstailey 339: if (i > nfields)
1.7 millert 340: FATAL("record `%.30s...' has too many fields; can't happen", r);
1.4 kstailey 341: cleanfld(i+1, lastfld); /* clean out junk from previous record */
342: lastfld = i;
1.1 tholo 343: donefld = 1;
1.4 kstailey 344: for (j = 1; j <= lastfld; j++) {
345: p = fldtab[j];
1.5 millert 346: if(is_number(p->sval)) {
1.1 tholo 347: p->fval = atof(p->sval);
348: p->tval |= NUM;
349: }
350: }
1.4 kstailey 351: setfval(nfloc, (Awkfloat) lastfld);
352: if (dbg) {
353: for (j = 0; j <= lastfld; j++) {
354: p = fldtab[j];
355: printf("field %d (%s): |%s|\n", j, p->nval, p->sval);
356: }
357: }
1.1 tholo 358: }
359:
1.4 kstailey 360: void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */
361: { /* nvals remain intact */
362: Cell *p;
363: int i;
1.1 tholo 364:
1.4 kstailey 365: for (i = n1; i <= n2; i++) {
366: p = fldtab[i];
367: if (freeable(p))
1.1 tholo 368: xfree(p->sval);
1.4 kstailey 369: p->sval = "";
1.1 tholo 370: p->tval = FLD | STR | DONTFREE;
371: }
372: }
373:
1.4 kstailey 374: void newfld(int n) /* add field n after end of existing lastfld */
1.1 tholo 375: {
1.4 kstailey 376: if (n > nfields)
377: growfldtab(n);
378: cleanfld(lastfld+1, n);
379: lastfld = n;
1.1 tholo 380: setfval(nfloc, (Awkfloat) n);
381: }
382:
1.4 kstailey 383: Cell *fieldadr(int n) /* get nth field */
384: {
385: if (n < 0)
1.15 millert 386: FATAL("trying to access out of range field %d", n);
1.4 kstailey 387: if (n > nfields) /* fields after NF are empty */
388: growfldtab(n); /* but does not increase NF */
389: return(fldtab[n]);
390: }
391:
392: void growfldtab(int n) /* make new fields up to at least $n */
393: {
394: int nf = 2 * nfields;
1.15 millert 395: size_t s;
1.4 kstailey 396:
397: if (n > nf)
398: nf = n;
1.15 millert 399: s = (nf+1) * (sizeof (struct Cell *)); /* freebsd: how much do we need? */
400: if (s / sizeof(struct Cell *) - 1 == nf) /* didn't overflow */
401: fldtab = (Cell **) realloc(fldtab, s);
402: else /* overflow sizeof int */
403: xfree(fldtab); /* make it null */
1.4 kstailey 404: if (fldtab == NULL)
1.7 millert 405: FATAL("out of space creating %d fields", nf);
1.4 kstailey 406: makefields(nfields+1, nf);
407: nfields = nf;
408: }
409:
1.11 millert 410: int refldbld(const char *rec, const char *fs) /* build fields from reg expr in FS */
1.1 tholo 411: {
1.4 kstailey 412: /* this relies on having fields[] the same length as $0 */
413: /* the fields are all stored in this one array with \0's */
1.1 tholo 414: char *fr;
1.4 kstailey 415: int i, tempstat, n;
1.1 tholo 416: fa *pfa;
417:
1.4 kstailey 418: n = strlen(rec);
419: if (n > fieldssize) {
420: xfree(fields);
421: if ((fields = (char *) malloc(n+1)) == NULL)
1.7 millert 422: FATAL("out of space for fields in refldbld %d", n);
1.4 kstailey 423: fieldssize = n;
424: }
1.1 tholo 425: fr = fields;
426: *fr = '\0';
427: if (*rec == '\0')
428: return 0;
429: pfa = makedfa(fs, 1);
1.4 kstailey 430: dprintf( ("into refldbld, rec = <%s>, pat = <%s>\n", rec, fs) );
1.1 tholo 431: tempstat = pfa->initstat;
1.4 kstailey 432: for (i = 1; ; i++) {
433: if (i > nfields)
434: growfldtab(i);
435: if (freeable(fldtab[i]))
436: xfree(fldtab[i]->sval);
437: fldtab[i]->tval = FLD | STR | DONTFREE;
438: fldtab[i]->sval = fr;
439: dprintf( ("refldbld: i=%d\n", i) );
1.1 tholo 440: if (nematch(pfa, rec)) {
1.4 kstailey 441: pfa->initstat = 2; /* horrible coupling to b.c */
442: dprintf( ("match %s (%d chars)\n", patbeg, patlen) );
1.1 tholo 443: strncpy(fr, rec, patbeg-rec);
444: fr += patbeg - rec + 1;
445: *(fr-1) = '\0';
446: rec = patbeg + patlen;
447: } else {
1.4 kstailey 448: dprintf( ("no match %s\n", rec) );
1.13 tedu 449: strlcpy(fr, rec, fields + fieldssize - fr);
1.1 tholo 450: pfa->initstat = tempstat;
451: break;
452: }
453: }
454: return i;
455: }
456:
457: void recbld(void) /* create $0 from $1..$NF if necessary */
458: {
459: int i;
460: char *r, *p;
461:
462: if (donerec == 1)
463: return;
1.5 millert 464: r = record;
1.1 tholo 465: for (i = 1; i <= *NF; i++) {
1.4 kstailey 466: p = getsval(fldtab[i]);
1.5 millert 467: if (!adjbuf(&record, &recsize, 1+strlen(p)+r-record, recsize, &r, "recbld 1"))
1.7 millert 468: FATAL("created $0 `%.30s...' too long", record);
1.4 kstailey 469: while ((*r = *p++) != 0)
1.1 tholo 470: r++;
1.4 kstailey 471: if (i < *NF) {
1.5 millert 472: if (!adjbuf(&record, &recsize, 2+strlen(*OFS)+r-record, recsize, &r, "recbld 2"))
1.7 millert 473: FATAL("created $0 `%.30s...' too long", record);
1.4 kstailey 474: for (p = *OFS; (*r = *p++) != 0; )
1.1 tholo 475: r++;
1.4 kstailey 476: }
1.1 tholo 477: }
1.5 millert 478: if (!adjbuf(&record, &recsize, 2+r-record, recsize, &r, "recbld 3"))
1.7 millert 479: FATAL("built giant record `%.30s...'", record);
1.1 tholo 480: *r = '\0';
1.4 kstailey 481: dprintf( ("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, fldtab[0]) );
482:
483: if (freeable(fldtab[0]))
484: xfree(fldtab[0]->sval);
485: fldtab[0]->tval = REC | STR | DONTFREE;
486: fldtab[0]->sval = record;
487:
488: dprintf( ("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, fldtab[0]) );
489: dprintf( ("recbld = |%s|\n", record) );
1.1 tholo 490: donerec = 1;
491: }
492:
493: int errorflag = 0;
494:
1.11 millert 495: void yyerror(const char *s)
1.1 tholo 496: {
1.14 grange 497: SYNTAX("%s", s);
1.7 millert 498: }
499:
1.11 millert 500: void SYNTAX(const char *fmt, ...)
1.7 millert 501: {
1.1 tholo 502: extern char *cmdname, *curfname;
503: static int been_here = 0;
1.7 millert 504: va_list varg;
1.1 tholo 505:
506: if (been_here++ > 2)
507: return;
1.7 millert 508: fprintf(stderr, "%s: ", cmdname);
509: va_start(varg, fmt);
510: vfprintf(stderr, fmt, varg);
511: va_end(varg);
1.1 tholo 512: fprintf(stderr, " at source line %d", lineno);
513: if (curfname != NULL)
514: fprintf(stderr, " in function %s", curfname);
1.6 millert 515: if (compile_time == 1 && cursource() != NULL)
516: fprintf(stderr, " source file %s", cursource());
1.1 tholo 517: fprintf(stderr, "\n");
518: errorflag = 2;
519: eprint();
520: }
521:
1.9 deraadt 522: void fpecatch(int sig)
1.1 tholo 523: {
1.9 deraadt 524: extern Node *curnode;
525: char buf[1024];
526:
527: snprintf(buf, sizeof buf, "floating point exception\n");
528: write(STDERR_FILENO, buf, strlen(buf));
529:
530: if (compile_time != 2 && NR && *NR > 0) {
531: snprintf(buf, sizeof buf, " input record number %d", (int) (*FNR));
532: write(STDERR_FILENO, buf, strlen(buf));
533:
534: if (strcmp(*FILENAME, "-") != 0) {
535: snprintf(buf, sizeof buf, ", file %s", *FILENAME);
536: write(STDERR_FILENO, buf, strlen(buf));
537: }
538: write(STDERR_FILENO, "\n", 1);
539: }
540: if (compile_time != 2 && curnode) {
541: snprintf(buf, sizeof buf, " source line number %d", curnode->lineno);
542: write(STDERR_FILENO, buf, strlen(buf));
543: } else if (compile_time != 2 && lineno) {
544: snprintf(buf, sizeof buf, " source line number %d", lineno);
545: write(STDERR_FILENO, buf, strlen(buf));
546: }
547: if (compile_time == 1 && cursource() != NULL) {
548: snprintf(buf, sizeof buf, " source file %s", cursource());
549: write(STDERR_FILENO, buf, strlen(buf));
550: }
551: write(STDERR_FILENO, "\n", 1);
552: if (dbg > 1) /* core dump if serious debugging on */
553: abort();
554: _exit(1);
1.1 tholo 555: }
556:
557: extern int bracecnt, brackcnt, parencnt;
558:
559: void bracecheck(void)
560: {
561: int c;
562: static int beenhere = 0;
563:
564: if (beenhere++)
565: return;
1.3 millert 566: while ((c = input()) != EOF && c != '\0')
1.1 tholo 567: bclass(c);
568: bcheck2(bracecnt, '{', '}');
569: bcheck2(brackcnt, '[', ']');
570: bcheck2(parencnt, '(', ')');
571: }
572:
573: void bcheck2(int n, int c1, int c2)
574: {
575: if (n == 1)
576: fprintf(stderr, "\tmissing %c\n", c2);
577: else if (n > 1)
578: fprintf(stderr, "\t%d missing %c's\n", n, c2);
579: else if (n == -1)
580: fprintf(stderr, "\textra %c\n", c2);
581: else if (n < -1)
582: fprintf(stderr, "\t%d extra %c's\n", -n, c2);
583: }
584:
1.11 millert 585: void FATAL(const char *fmt, ...)
1.7 millert 586: {
587: extern char *cmdname;
588: va_list varg;
589:
590: fflush(stdout);
591: fprintf(stderr, "%s: ", cmdname);
592: va_start(varg, fmt);
593: vfprintf(stderr, fmt, varg);
594: va_end(varg);
595: error();
596: if (dbg > 1) /* core dump if serious debugging on */
597: abort();
598: exit(2);
599: }
600:
1.11 millert 601: void WARNING(const char *fmt, ...)
1.1 tholo 602: {
603: extern char *cmdname;
1.7 millert 604: va_list varg;
1.1 tholo 605:
606: fflush(stdout);
607: fprintf(stderr, "%s: ", cmdname);
1.7 millert 608: va_start(varg, fmt);
609: vfprintf(stderr, fmt, varg);
610: va_end(varg);
611: error();
612: }
613:
614: void error()
615: {
616: extern Node *curnode;
617:
1.1 tholo 618: fprintf(stderr, "\n");
619: if (compile_time != 2 && NR && *NR > 0) {
620: fprintf(stderr, " input record number %d", (int) (*FNR));
621: if (strcmp(*FILENAME, "-") != 0)
622: fprintf(stderr, ", file %s", *FILENAME);
623: fprintf(stderr, "\n");
624: }
625: if (compile_time != 2 && curnode)
1.6 millert 626: fprintf(stderr, " source line number %d", curnode->lineno);
1.1 tholo 627: else if (compile_time != 2 && lineno)
1.6 millert 628: fprintf(stderr, " source line number %d", lineno);
629: if (compile_time == 1 && cursource() != NULL)
630: fprintf(stderr, " source file %s", cursource());
631: fprintf(stderr, "\n");
1.1 tholo 632: eprint();
633: }
634:
635: void eprint(void) /* try to print context around error */
636: {
637: char *p, *q;
638: int c;
639: static int been_here = 0;
640: extern char ebuf[], *ep;
641:
642: if (compile_time == 2 || compile_time == 0 || been_here++ > 0)
643: return;
644: p = ep - 1;
645: if (p > ebuf && *p == '\n')
646: p--;
647: for ( ; p > ebuf && *p != '\n' && *p != '\0'; p--)
648: ;
649: while (*p == '\n')
650: p++;
651: fprintf(stderr, " context is\n\t");
652: for (q=ep-1; q>=p && *q!=' ' && *q!='\t' && *q!='\n'; q--)
653: ;
654: for ( ; p < q; p++)
655: if (*p)
656: putc(*p, stderr);
657: fprintf(stderr, " >>> ");
658: for ( ; p < ep; p++)
659: if (*p)
660: putc(*p, stderr);
661: fprintf(stderr, " <<< ");
662: if (*ep)
663: while ((c = input()) != '\n' && c != '\0' && c != EOF) {
664: putc(c, stderr);
665: bclass(c);
666: }
667: putc('\n', stderr);
668: ep = ebuf;
669: }
670:
671: void bclass(int c)
672: {
673: switch (c) {
674: case '{': bracecnt++; break;
675: case '}': bracecnt--; break;
676: case '[': brackcnt++; break;
677: case ']': brackcnt--; break;
678: case '(': parencnt++; break;
679: case ')': parencnt--; break;
680: }
681: }
682:
1.11 millert 683: double errcheck(double x, const char *s)
1.1 tholo 684: {
685:
686: if (errno == EDOM) {
687: errno = 0;
1.7 millert 688: WARNING("%s argument out of domain", s);
1.1 tholo 689: x = 1;
690: } else if (errno == ERANGE) {
691: errno = 0;
1.7 millert 692: WARNING("%s result out of range", s);
1.1 tholo 693: x = 1;
694: }
695: return x;
696: }
697:
1.11 millert 698: int isclvar(const char *s) /* is s of form var=something ? */
1.1 tholo 699: {
1.11 millert 700: const char *os = s;
1.1 tholo 701:
1.8 millert 702: if (!isalpha((uschar) *s) && *s != '_')
1.1 tholo 703: return 0;
704: for ( ; *s; s++)
1.8 millert 705: if (!(isalnum((uschar) *s) || *s == '_'))
1.1 tholo 706: break;
707: return *s == '=' && s > os && *(s+1) != '=';
708: }
709:
1.4 kstailey 710: /* strtod is supposed to be a proper test of what's a valid number */
1.8 millert 711: /* appears to be broken in gcc on linux: thinks 0x123 is a valid FP number */
712: /* wrong: violates 4.10.1.4 of ansi C standard */
1.1 tholo 713:
1.4 kstailey 714: #include <math.h>
1.11 millert 715: int is_number(const char *s)
1.1 tholo 716: {
1.4 kstailey 717: double r;
718: char *ep;
719: errno = 0;
720: r = strtod(s, &ep);
721: if (ep == s || r == HUGE_VAL || errno == ERANGE)
722: return 0;
723: while (*ep == ' ' || *ep == '\t' || *ep == '\n')
724: ep++;
725: if (*ep == '\0')
726: return 1;
1.1 tholo 727: else
1.4 kstailey 728: return 0;
1.1 tholo 729: }