Annotation of src/usr.bin/awk/lib.c, Revision 1.46
1.46 ! millert 1: /* $OpenBSD: lib.c,v 1.45 2021/04/19 14:08:55 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.7 millert 32: #include <stdarg.h>
1.33 millert 33: #include <limits.h>
1.44 millert 34: #include <math.h>
1.1 tholo 35: #include "awk.h"
36:
1.33 millert 37: char EMPTY[] = { '\0' };
1.1 tholo 38: FILE *infile = NULL;
1.34 millert 39: bool innew; /* true = infile has not been read by readrec */
1.33 millert 40: char *file = EMPTY;
1.4 kstailey 41: char *record;
1.1 tholo 42: int recsize = RECSIZE;
43: char *fields;
1.4 kstailey 44: int fieldssize = RECSIZE;
45:
46: Cell **fldtab; /* pointers to Cells */
1.33 millert 47: static size_t len_inputFS = 0;
48: static char *inputFS = NULL; /* FS at time of input, for field splitting */
1.1 tholo 49:
1.18 millert 50: #define MAXFLD 2
1.4 kstailey 51: int nfields = MAXFLD; /* last allocated slot for $i */
1.1 tholo 52:
1.32 millert 53: bool donefld; /* true = implies rec broken into fields */
54: bool donerec; /* true = record is valid (no flds have changed) */
1.1 tholo 55:
1.4 kstailey 56: int lastfld = 0; /* last used field */
1.1 tholo 57: int argno = 1; /* current input argument number */
58: extern Awkfloat *ARGC;
59:
1.34 millert 60: static Cell dollar0 = { OCELL, CFLD, NULL, EMPTY, 0.0, REC|STR|DONTFREE, NULL, NULL };
61: static Cell dollar1 = { OCELL, CFLD, NULL, EMPTY, 0.0, FLD|STR|DONTFREE, NULL, NULL };
1.4 kstailey 62:
1.1 tholo 63: void recinit(unsigned int n)
64: {
1.42 millert 65: if ( (record = (char *) malloc(n)) == NULL
66: || (fields = (char *) malloc(n+1)) == NULL
67: || (fldtab = (Cell **) calloc(nfields+2, sizeof(*fldtab))) == NULL
68: || (fldtab[0] = (Cell *) malloc(sizeof(**fldtab))) == NULL)
1.7 millert 69: FATAL("out of space for $0 and fields");
1.22 millert 70: *record = '\0';
1.4 kstailey 71: *fldtab[0] = dollar0;
72: fldtab[0]->sval = record;
73: fldtab[0]->nval = tostring("0");
74: makefields(1, nfields);
75: }
76:
77: void makefields(int n1, int n2) /* create $n1..$n2 inclusive */
78: {
79: char temp[50];
1.1 tholo 80: int i;
81:
1.4 kstailey 82: for (i = n1; i <= n2; i++) {
1.42 millert 83: fldtab[i] = (Cell *) malloc(sizeof(**fldtab));
1.4 kstailey 84: if (fldtab[i] == NULL)
1.7 millert 85: FATAL("out of space in makefields %d", i);
1.4 kstailey 86: *fldtab[i] = dollar1;
1.31 millert 87: snprintf(temp, sizeof(temp), "%d", i);
1.4 kstailey 88: fldtab[i]->nval = tostring(temp);
89: }
1.1 tholo 90: }
91:
92: void initgetrec(void)
93: {
94: int i;
95: char *p;
96:
97: for (i = 1; i < *ARGC; i++) {
1.20 millert 98: p = getargv(i); /* find 1st real filename */
99: if (p == NULL || *p == '\0') { /* deleted or zapped */
100: argno++;
101: continue;
102: }
103: if (!isclvar(p)) {
104: setsval(lookup("FILENAME", symtab), p);
1.1 tholo 105: return;
106: }
107: setclvar(p); /* a commandline assignment before filename */
108: argno++;
109: }
110: infile = stdin; /* no filenames, so use stdin */
1.34 millert 111: innew = true;
1.1 tholo 112: }
113:
1.29 millert 114: /*
115: * POSIX specifies that fields are supposed to be evaluated as if they were
116: * split using the value of FS at the time that the record's value ($0) was
117: * read.
118: *
119: * Since field-splitting is done lazily, we save the current value of FS
120: * whenever a new record is read in (implicitly or via getline), or when
121: * a new value is assigned to $0.
122: */
123: void savefs(void)
124: {
1.37 millert 125: size_t len = strlen(getsval(fsloc));
126: if (len >= len_inputFS) {
127: len_inputFS = len + 1;
1.42 millert 128: inputFS = (char *) realloc(inputFS, len_inputFS);
1.37 millert 129: if (inputFS == NULL)
130: FATAL("field separator %.10s... is too long", *FS);
1.33 millert 131: }
1.37 millert 132: if (strlcpy(inputFS, *FS, len_inputFS) >= len_inputFS)
1.29 millert 133: FATAL("field separator %.10s... is too long", *FS);
134: }
135:
1.32 millert 136: static bool firsttime = true;
1.15 millert 137:
1.32 millert 138: int getrec(char **pbuf, int *pbufsize, bool isrecord) /* get next input record */
1.4 kstailey 139: { /* note: cares whether buf == record */
1.1 tholo 140: int c;
1.4 kstailey 141: char *buf = *pbuf;
1.18 millert 142: uschar saveb0;
143: int bufsize = *pbufsize, savebufsize = bufsize;
1.1 tholo 144:
145: if (firsttime) {
1.32 millert 146: firsttime = false;
1.1 tholo 147: initgetrec();
148: }
1.39 millert 149: DPRINTF("RS=<%s>, FS=<%s>, ARGC=%g, FILENAME=%s\n",
150: *RS, *FS, *ARGC, *FILENAME);
1.5 millert 151: if (isrecord) {
1.32 millert 152: donefld = false;
153: donerec = true;
1.29 millert 154: savefs();
1.5 millert 155: }
1.18 millert 156: saveb0 = buf[0];
1.1 tholo 157: buf[0] = 0;
158: while (argno < *ARGC || infile == stdin) {
1.39 millert 159: DPRINTF("argno=%d, file=|%s|\n", argno, file);
1.1 tholo 160: if (infile == NULL) { /* have to open a new file */
161: file = getargv(argno);
1.20 millert 162: if (file == NULL || *file == '\0') { /* deleted or zapped */
1.1 tholo 163: argno++;
164: continue;
165: }
166: if (isclvar(file)) { /* a var=value arg */
167: setclvar(file);
168: argno++;
169: continue;
170: }
171: *FILENAME = file;
1.39 millert 172: DPRINTF("opening file %s\n", file);
1.1 tholo 173: if (*file == '-' && *(file+1) == '\0')
174: infile = stdin;
1.4 kstailey 175: else if ((infile = fopen(file, "r")) == NULL)
1.7 millert 176: FATAL("can't open file %s", file);
1.45 millert 177: innew = true;
1.1 tholo 178: setfval(fnrloc, 0.0);
179: }
1.34 millert 180: c = readrec(&buf, &bufsize, infile, innew);
181: if (innew)
182: innew = false;
1.1 tholo 183: if (c != 0 || buf[0] != '\0') { /* normal record */
1.4 kstailey 184: if (isrecord) {
1.42 millert 185: double result;
186:
1.4 kstailey 187: if (freeable(fldtab[0]))
188: xfree(fldtab[0]->sval);
189: fldtab[0]->sval = buf; /* buf == record */
190: fldtab[0]->tval = REC | STR | DONTFREE;
1.42 millert 191: if (is_number(fldtab[0]->sval, & result)) {
192: fldtab[0]->fval = result;
1.4 kstailey 193: fldtab[0]->tval |= NUM;
1.1 tholo 194: }
195: }
196: setfval(nrloc, nrloc->fval+1);
197: setfval(fnrloc, fnrloc->fval+1);
1.4 kstailey 198: *pbuf = buf;
199: *pbufsize = bufsize;
1.1 tholo 200: return 1;
201: }
202: /* EOF arrived on this file; set up next */
203: if (infile != stdin)
204: fclose(infile);
205: infile = NULL;
206: argno++;
207: }
1.18 millert 208: buf[0] = saveb0;
1.4 kstailey 209: *pbuf = buf;
1.18 millert 210: *pbufsize = savebufsize;
1.1 tholo 211: return 0; /* true end of file */
212: }
213:
214: void nextfile(void)
215: {
1.18 millert 216: if (infile != NULL && infile != stdin)
1.1 tholo 217: fclose(infile);
218: infile = NULL;
219: argno++;
220: }
221:
1.34 millert 222: int readrec(char **pbuf, int *pbufsize, FILE *inf, bool newflag) /* read one record into buf */
1.1 tholo 223: {
1.30 millert 224: int sep, c, isrec;
1.4 kstailey 225: char *rr, *buf = *pbuf;
226: int bufsize = *pbufsize;
1.27 millert 227: char *rs = getsval(rsloc);
1.1 tholo 228:
1.30 millert 229: if (*rs && rs[1]) {
1.32 millert 230: bool found;
1.30 millert 231:
232: fa *pfa = makedfa(rs, 1);
1.34 millert 233: if (newflag)
234: found = fnematch(pfa, inf, &buf, &bufsize, recsize);
235: else {
236: int tempstat = pfa->initstat;
237: pfa->initstat = 2;
238: found = fnematch(pfa, inf, &buf, &bufsize, recsize);
239: pfa->initstat = tempstat;
240: }
1.30 millert 241: if (found)
1.31 millert 242: setptr(patbeg, '\0');
1.46 ! millert 243: isrec = (found == 0 && *buf == '\0') ? 0 : 1;
1.30 millert 244: } else {
245: if ((sep = *rs) == 0) {
246: sep = '\n';
247: while ((c=getc(inf)) == '\n' && c != EOF) /* skip leading \n's */
248: ;
249: if (c != EOF)
250: ungetc(c, inf);
251: }
252: for (rr = buf; ; ) {
253: for (; (c=getc(inf)) != sep && c != EOF; ) {
254: if (rr-buf+1 > bufsize)
255: if (!adjbuf(&buf, &bufsize, 1+rr-buf,
256: recsize, &rr, "readrec 1"))
257: FATAL("input record `%.30s...' too long", buf);
258: *rr++ = c;
259: }
260: if (*rs == sep || c == EOF)
261: break;
262: if ((c = getc(inf)) == '\n' || c == EOF) /* 2 in a row */
263: break;
264: if (!adjbuf(&buf, &bufsize, 2+rr-buf, recsize, &rr,
265: "readrec 2"))
266: FATAL("input record `%.30s...' too long", buf);
267: *rr++ = '\n';
1.4 kstailey 268: *rr++ = c;
269: }
1.30 millert 270: if (!adjbuf(&buf, &bufsize, 1+rr-buf, recsize, &rr, "readrec 3"))
1.7 millert 271: FATAL("input record `%.30s...' too long", buf);
1.30 millert 272: *rr = 0;
1.46 ! millert 273: isrec = (c == EOF && rr == buf) ? 0 : 1;
1.1 tholo 274: }
1.4 kstailey 275: *pbuf = buf;
276: *pbufsize = bufsize;
1.39 millert 277: DPRINTF("readrec saw <%s>, returns %d\n", buf, isrec);
1.30 millert 278: return isrec;
1.1 tholo 279: }
280:
281: char *getargv(int n) /* get ARGV[n] */
282: {
283: Cell *x;
1.4 kstailey 284: char *s, temp[50];
1.1 tholo 285: extern Array *ARGVtab;
286:
1.31 millert 287: snprintf(temp, sizeof(temp), "%d", n);
1.20 millert 288: if (lookup(temp, ARGVtab) == NULL)
289: return NULL;
1.1 tholo 290: x = setsymtab(temp, "", 0.0, STR, ARGVtab);
291: s = getsval(x);
1.39 millert 292: DPRINTF("getargv(%d) returns |%s|\n", n, s);
1.1 tholo 293: return s;
294: }
295:
296: void setclvar(char *s) /* set var=value from s */
297: {
298: char *p;
299: Cell *q;
1.42 millert 300: double result;
1.1 tholo 301:
302: for (p=s; *p != '='; p++)
303: ;
304: *p++ = 0;
305: p = qstring(p, '\0');
306: q = setsymtab(s, p, 0.0, STR, symtab);
307: setsval(q, p);
1.42 millert 308: if (is_number(q->sval, & result)) {
309: q->fval = result;
1.1 tholo 310: q->tval |= NUM;
311: }
1.39 millert 312: DPRINTF("command line set %s to |%s|\n", s, p);
1.1 tholo 313: }
314:
315:
316: void fldbld(void) /* create fields from current record */
317: {
1.4 kstailey 318: /* this relies on having fields[] the same length as $0 */
319: /* the fields are all stored in this one array with \0's */
1.20 millert 320: /* possibly with a final trailing \0 not associated with any field */
1.1 tholo 321: char *r, *fr, sep;
322: Cell *p;
1.4 kstailey 323: int i, j, n;
1.1 tholo 324:
325: if (donefld)
326: return;
1.4 kstailey 327: if (!isstr(fldtab[0]))
328: getsval(fldtab[0]);
329: r = fldtab[0]->sval;
330: n = strlen(r);
331: if (n > fieldssize) {
332: xfree(fields);
1.42 millert 333: if ((fields = (char *) malloc(n+2)) == NULL) /* possibly 2 final \0s */
1.7 millert 334: FATAL("out of space for fields in fldbld %d", n);
1.4 kstailey 335: fieldssize = n;
336: }
1.1 tholo 337: fr = fields;
338: i = 0; /* number of fields accumulated here */
1.35 millert 339: if (inputFS == NULL) /* make sure we have a copy of FS */
340: savefs();
1.2 millert 341: if (strlen(inputFS) > 1) { /* it's a regular expression */
342: i = refldbld(r, inputFS);
343: } else if ((sep = *inputFS) == ' ') { /* default whitespace */
1.1 tholo 344: for (i = 0; ; ) {
345: while (*r == ' ' || *r == '\t' || *r == '\n')
346: r++;
347: if (*r == 0)
348: break;
349: i++;
1.4 kstailey 350: if (i > nfields)
351: growfldtab(i);
352: if (freeable(fldtab[i]))
353: xfree(fldtab[i]->sval);
354: fldtab[i]->sval = fr;
355: fldtab[i]->tval = FLD | STR | DONTFREE;
1.1 tholo 356: do
357: *fr++ = *r++;
358: while (*r != ' ' && *r != '\t' && *r != '\n' && *r != '\0');
359: *fr++ = 0;
360: }
361: *fr = 0;
1.2 millert 362: } else if ((sep = *inputFS) == 0) { /* new: FS="" => 1 char/field */
1.32 millert 363: for (i = 0; *r != '\0'; r += n) {
1.33 millert 364: char buf[MB_LEN_MAX + 1];
1.32 millert 365:
1.1 tholo 366: i++;
1.4 kstailey 367: if (i > nfields)
368: growfldtab(i);
369: if (freeable(fldtab[i]))
370: xfree(fldtab[i]->sval);
1.33 millert 371: n = mblen(r, MB_LEN_MAX);
1.32 millert 372: if (n < 0)
373: n = 1;
374: memcpy(buf, r, n);
375: buf[n] = '\0';
1.4 kstailey 376: fldtab[i]->sval = tostring(buf);
377: fldtab[i]->tval = FLD | STR;
1.1 tholo 378: }
379: *fr = 0;
380: } else if (*r != 0) { /* if 0, it's a null field */
1.15 millert 381: /* subtlecase : if length(FS) == 1 && length(RS > 0)
382: * \n is NOT a field separator (cf awk book 61,84).
383: * this variable is tested in the inner while loop.
384: */
385: int rtest = '\n'; /* normal case */
386: if (strlen(*RS) > 0)
387: rtest = '\0';
1.1 tholo 388: for (;;) {
389: i++;
1.4 kstailey 390: if (i > nfields)
391: growfldtab(i);
392: if (freeable(fldtab[i]))
393: xfree(fldtab[i]->sval);
394: fldtab[i]->sval = fr;
395: fldtab[i]->tval = FLD | STR | DONTFREE;
1.15 millert 396: while (*r != sep && *r != rtest && *r != '\0') /* \n is always a separator */
1.1 tholo 397: *fr++ = *r++;
398: *fr++ = 0;
399: if (*r++ == 0)
400: break;
401: }
402: *fr = 0;
403: }
1.4 kstailey 404: if (i > nfields)
1.7 millert 405: FATAL("record `%.30s...' has too many fields; can't happen", r);
1.4 kstailey 406: cleanfld(i+1, lastfld); /* clean out junk from previous record */
407: lastfld = i;
1.32 millert 408: donefld = true;
1.4 kstailey 409: for (j = 1; j <= lastfld; j++) {
1.42 millert 410: double result;
411:
1.4 kstailey 412: p = fldtab[j];
1.42 millert 413: if(is_number(p->sval, & result)) {
414: p->fval = result;
1.1 tholo 415: p->tval |= NUM;
416: }
417: }
1.4 kstailey 418: setfval(nfloc, (Awkfloat) lastfld);
1.32 millert 419: donerec = true; /* restore */
1.4 kstailey 420: if (dbg) {
421: for (j = 0; j <= lastfld; j++) {
422: p = fldtab[j];
423: printf("field %d (%s): |%s|\n", j, p->nval, p->sval);
424: }
425: }
1.1 tholo 426: }
427:
1.4 kstailey 428: void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */
429: { /* nvals remain intact */
430: Cell *p;
431: int i;
1.1 tholo 432:
1.4 kstailey 433: for (i = n1; i <= n2; i++) {
434: p = fldtab[i];
435: if (freeable(p))
1.1 tholo 436: xfree(p->sval);
1.33 millert 437: p->sval = EMPTY,
1.1 tholo 438: p->tval = FLD | STR | DONTFREE;
439: }
440: }
441:
1.4 kstailey 442: void newfld(int n) /* add field n after end of existing lastfld */
1.1 tholo 443: {
1.4 kstailey 444: if (n > nfields)
445: growfldtab(n);
446: cleanfld(lastfld+1, n);
447: lastfld = n;
1.1 tholo 448: setfval(nfloc, (Awkfloat) n);
1.26 millert 449: }
450:
451: void setlastfld(int n) /* set lastfld cleaning fldtab cells if necessary */
452: {
1.27 millert 453: if (n < 0)
454: FATAL("cannot set NF to a negative value");
1.26 millert 455: if (n > nfields)
456: growfldtab(n);
457:
458: if (lastfld < n)
459: cleanfld(lastfld+1, n);
460: else
461: cleanfld(n+1, lastfld);
462:
463: lastfld = n;
1.1 tholo 464: }
465:
1.4 kstailey 466: Cell *fieldadr(int n) /* get nth field */
467: {
468: if (n < 0)
1.15 millert 469: FATAL("trying to access out of range field %d", n);
1.4 kstailey 470: if (n > nfields) /* fields after NF are empty */
471: growfldtab(n); /* but does not increase NF */
472: return(fldtab[n]);
473: }
474:
475: void growfldtab(int n) /* make new fields up to at least $n */
476: {
477: int nf = 2 * nfields;
1.15 millert 478: size_t s;
1.4 kstailey 479:
480: if (n > nf)
481: nf = n;
1.15 millert 482: s = (nf+1) * (sizeof (struct Cell *)); /* freebsd: how much do we need? */
1.34 millert 483: if (s / sizeof(struct Cell *) - 1 == (size_t)nf) /* didn't overflow */
1.42 millert 484: fldtab = (Cell **) realloc(fldtab, s);
1.15 millert 485: else /* overflow sizeof int */
486: xfree(fldtab); /* make it null */
1.4 kstailey 487: if (fldtab == NULL)
1.7 millert 488: FATAL("out of space creating %d fields", nf);
1.4 kstailey 489: makefields(nfields+1, nf);
490: nfields = nf;
491: }
492:
1.11 millert 493: int refldbld(const char *rec, const char *fs) /* build fields from reg expr in FS */
1.1 tholo 494: {
1.4 kstailey 495: /* this relies on having fields[] the same length as $0 */
496: /* the fields are all stored in this one array with \0's */
1.1 tholo 497: char *fr;
1.4 kstailey 498: int i, tempstat, n;
1.1 tholo 499: fa *pfa;
500:
1.4 kstailey 501: n = strlen(rec);
502: if (n > fieldssize) {
503: xfree(fields);
1.42 millert 504: if ((fields = (char *) malloc(n+1)) == NULL)
1.7 millert 505: FATAL("out of space for fields in refldbld %d", n);
1.4 kstailey 506: fieldssize = n;
507: }
1.1 tholo 508: fr = fields;
509: *fr = '\0';
510: if (*rec == '\0')
511: return 0;
512: pfa = makedfa(fs, 1);
1.39 millert 513: DPRINTF("into refldbld, rec = <%s>, pat = <%s>\n", rec, fs);
1.1 tholo 514: tempstat = pfa->initstat;
1.4 kstailey 515: for (i = 1; ; i++) {
1.37 millert 516: const size_t fss_rem = fields + fieldssize + 1 - fr;
1.4 kstailey 517: if (i > nfields)
518: growfldtab(i);
519: if (freeable(fldtab[i]))
520: xfree(fldtab[i]->sval);
521: fldtab[i]->tval = FLD | STR | DONTFREE;
522: fldtab[i]->sval = fr;
1.39 millert 523: DPRINTF("refldbld: i=%d\n", i);
1.1 tholo 524: if (nematch(pfa, rec)) {
1.37 millert 525: const size_t reclen = patbeg - rec;
1.4 kstailey 526: pfa->initstat = 2; /* horrible coupling to b.c */
1.39 millert 527: DPRINTF("match %s (%d chars)\n", patbeg, patlen);
1.37 millert 528: if (reclen >= fss_rem)
529: FATAL("out of space for fields in refldbld");
530: memcpy(fr, rec, reclen);
531: fr += reclen;
532: *fr++ = '\0';
1.1 tholo 533: rec = patbeg + patlen;
534: } else {
1.39 millert 535: DPRINTF("no match %s\n", rec);
1.37 millert 536: if (strlcpy(fr, rec, fss_rem) >= fss_rem)
537: FATAL("out of space for fields in refldbld");
1.1 tholo 538: pfa->initstat = tempstat;
539: break;
540: }
541: }
1.29 millert 542: return i;
1.1 tholo 543: }
544:
545: void recbld(void) /* create $0 from $1..$NF if necessary */
546: {
547: int i;
548: char *r, *p;
1.27 millert 549: char *sep = getsval(ofsloc);
1.1 tholo 550:
1.32 millert 551: if (donerec)
1.1 tholo 552: return;
1.5 millert 553: r = record;
1.1 tholo 554: for (i = 1; i <= *NF; i++) {
1.4 kstailey 555: p = getsval(fldtab[i]);
1.5 millert 556: if (!adjbuf(&record, &recsize, 1+strlen(p)+r-record, recsize, &r, "recbld 1"))
1.7 millert 557: FATAL("created $0 `%.30s...' too long", record);
1.4 kstailey 558: while ((*r = *p++) != 0)
1.1 tholo 559: r++;
1.4 kstailey 560: if (i < *NF) {
1.27 millert 561: if (!adjbuf(&record, &recsize, 2+strlen(sep)+r-record, recsize, &r, "recbld 2"))
1.7 millert 562: FATAL("created $0 `%.30s...' too long", record);
1.27 millert 563: for (p = sep; (*r = *p++) != 0; )
1.1 tholo 564: r++;
1.4 kstailey 565: }
1.1 tholo 566: }
1.5 millert 567: if (!adjbuf(&record, &recsize, 2+r-record, recsize, &r, "recbld 3"))
1.7 millert 568: FATAL("built giant record `%.30s...'", record);
1.1 tholo 569: *r = '\0';
1.39 millert 570: DPRINTF("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, (void*)fldtab[0]);
1.4 kstailey 571:
572: if (freeable(fldtab[0]))
573: xfree(fldtab[0]->sval);
574: fldtab[0]->tval = REC | STR | DONTFREE;
575: fldtab[0]->sval = record;
576:
1.39 millert 577: DPRINTF("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, (void*)fldtab[0]);
578: DPRINTF("recbld = |%s|\n", record);
1.32 millert 579: donerec = true;
1.1 tholo 580: }
581:
582: int errorflag = 0;
583:
1.11 millert 584: void yyerror(const char *s)
1.1 tholo 585: {
1.14 grange 586: SYNTAX("%s", s);
1.7 millert 587: }
588:
1.11 millert 589: void SYNTAX(const char *fmt, ...)
1.7 millert 590: {
1.1 tholo 591: extern char *cmdname, *curfname;
592: static int been_here = 0;
1.7 millert 593: va_list varg;
1.1 tholo 594:
595: if (been_here++ > 2)
596: return;
1.7 millert 597: fprintf(stderr, "%s: ", cmdname);
598: va_start(varg, fmt);
599: vfprintf(stderr, fmt, varg);
600: va_end(varg);
1.1 tholo 601: fprintf(stderr, " at source line %d", lineno);
602: if (curfname != NULL)
603: fprintf(stderr, " in function %s", curfname);
1.32 millert 604: if (compile_time == COMPILING && cursource() != NULL)
1.6 millert 605: fprintf(stderr, " source file %s", cursource());
1.1 tholo 606: fprintf(stderr, "\n");
607: errorflag = 2;
608: eprint();
609: }
610:
611: extern int bracecnt, brackcnt, parencnt;
612:
613: void bracecheck(void)
614: {
615: int c;
616: static int beenhere = 0;
617:
618: if (beenhere++)
619: return;
1.3 millert 620: while ((c = input()) != EOF && c != '\0')
1.1 tholo 621: bclass(c);
622: bcheck2(bracecnt, '{', '}');
623: bcheck2(brackcnt, '[', ']');
624: bcheck2(parencnt, '(', ')');
625: }
626:
627: void bcheck2(int n, int c1, int c2)
628: {
629: if (n == 1)
630: fprintf(stderr, "\tmissing %c\n", c2);
631: else if (n > 1)
632: fprintf(stderr, "\t%d missing %c's\n", n, c2);
633: else if (n == -1)
634: fprintf(stderr, "\textra %c\n", c2);
635: else if (n < -1)
636: fprintf(stderr, "\t%d extra %c's\n", -n, c2);
637: }
638:
1.35 millert 639: void FATAL(const char *fmt, ...)
1.7 millert 640: {
641: extern char *cmdname;
642: va_list varg;
643:
644: fflush(stdout);
645: fprintf(stderr, "%s: ", cmdname);
646: va_start(varg, fmt);
647: vfprintf(stderr, fmt, varg);
648: va_end(varg);
649: error();
650: if (dbg > 1) /* core dump if serious debugging on */
651: abort();
652: exit(2);
653: }
654:
1.11 millert 655: void WARNING(const char *fmt, ...)
1.1 tholo 656: {
657: extern char *cmdname;
1.7 millert 658: va_list varg;
1.1 tholo 659:
660: fflush(stdout);
661: fprintf(stderr, "%s: ", cmdname);
1.7 millert 662: va_start(varg, fmt);
663: vfprintf(stderr, fmt, varg);
664: va_end(varg);
665: error();
666: }
667:
668: void error()
669: {
670: extern Node *curnode;
671:
1.1 tholo 672: fprintf(stderr, "\n");
1.32 millert 673: if (compile_time != ERROR_PRINTING) {
674: if (NR && *NR > 0) {
675: fprintf(stderr, " input record number %d", (int) (*FNR));
676: if (strcmp(*FILENAME, "-") != 0)
677: fprintf(stderr, ", file %s", *FILENAME);
678: fprintf(stderr, "\n");
679: }
680: if (curnode)
681: fprintf(stderr, " source line number %d", curnode->lineno);
682: else if (lineno)
683: fprintf(stderr, " source line number %d", lineno);
1.41 millert 684: if (compile_time == COMPILING && cursource() != NULL)
685: fprintf(stderr, " source file %s", cursource());
686: fprintf(stderr, "\n");
687: eprint();
1.32 millert 688: }
1.1 tholo 689: }
690:
691: void eprint(void) /* try to print context around error */
692: {
693: char *p, *q;
694: int c;
695: static int been_here = 0;
696: extern char ebuf[], *ep;
697:
1.32 millert 698: if (compile_time != COMPILING || been_here++ > 0 || ebuf == ep)
1.1 tholo 699: return;
700: p = ep - 1;
701: if (p > ebuf && *p == '\n')
702: p--;
703: for ( ; p > ebuf && *p != '\n' && *p != '\0'; p--)
704: ;
705: while (*p == '\n')
706: p++;
707: fprintf(stderr, " context is\n\t");
708: for (q=ep-1; q>=p && *q!=' ' && *q!='\t' && *q!='\n'; q--)
709: ;
710: for ( ; p < q; p++)
711: if (*p)
712: putc(*p, stderr);
713: fprintf(stderr, " >>> ");
714: for ( ; p < ep; p++)
715: if (*p)
716: putc(*p, stderr);
717: fprintf(stderr, " <<< ");
718: if (*ep)
719: while ((c = input()) != '\n' && c != '\0' && c != EOF) {
720: putc(c, stderr);
721: bclass(c);
722: }
723: putc('\n', stderr);
724: ep = ebuf;
725: }
726:
727: void bclass(int c)
728: {
729: switch (c) {
730: case '{': bracecnt++; break;
731: case '}': bracecnt--; break;
732: case '[': brackcnt++; break;
733: case ']': brackcnt--; break;
734: case '(': parencnt++; break;
735: case ')': parencnt--; break;
736: }
737: }
738:
1.11 millert 739: double errcheck(double x, const char *s)
1.1 tholo 740: {
741:
742: if (errno == EDOM) {
743: errno = 0;
1.7 millert 744: WARNING("%s argument out of domain", s);
1.1 tholo 745: x = 1;
746: } else if (errno == ERANGE) {
747: errno = 0;
1.7 millert 748: WARNING("%s result out of range", s);
1.1 tholo 749: x = 1;
750: }
751: return x;
752: }
753:
1.11 millert 754: int isclvar(const char *s) /* is s of form var=something ? */
1.1 tholo 755: {
1.11 millert 756: const char *os = s;
1.1 tholo 757:
1.8 millert 758: if (!isalpha((uschar) *s) && *s != '_')
1.1 tholo 759: return 0;
760: for ( ; *s; s++)
1.8 millert 761: if (!(isalnum((uschar) *s) || *s == '_'))
1.1 tholo 762: break;
1.28 millert 763: return *s == '=' && s > os;
1.1 tholo 764: }
765:
1.4 kstailey 766: /* strtod is supposed to be a proper test of what's a valid number */
1.8 millert 767: /* appears to be broken in gcc on linux: thinks 0x123 is a valid FP number */
768: /* wrong: violates 4.10.1.4 of ansi C standard */
1.42 millert 769:
1.38 millert 770: /* well, not quite. As of C99, hex floating point is allowed. so this is
1.42 millert 771: * a bit of a mess. We work around the mess by checking for a hexadecimal
772: * value and disallowing it. Similarly, we now follow gawk and allow only
773: * +nan, -nan, +inf, and -inf for NaN and infinity values.
1.38 millert 774: */
1.1 tholo 775:
1.42 millert 776: /*
777: * This routine now has a more complicated interface, the main point
778: * being to avoid the double conversion of a string to double, and
779: * also to convey out, if requested, the information that the numeric
780: * value was a leading string or is all of the string. The latter bit
781: * is used in getfval().
782: */
783:
784: bool is_valid_number(const char *s, bool trailing_stuff_ok,
785: bool *no_trailing, double *result)
1.1 tholo 786: {
1.4 kstailey 787: double r;
788: char *ep;
1.42 millert 789: bool retval = false;
1.44 millert 790: bool is_nan = false;
791: bool is_inf = false;
1.42 millert 792:
793: if (no_trailing)
794: *no_trailing = false;
795:
1.43 millert 796: while (isspace((uschar)*s))
1.42 millert 797: s++;
798:
1.43 millert 799: // no hex floating point, sorry
1.44 millert 800: if (s[0] == '0' && tolower((uschar)s[1]) == 'x')
1.42 millert 801: return false;
802:
803: // allow +nan, -nan, +inf, -inf, any other letter, no
804: if (s[0] == '+' || s[0] == '-') {
1.44 millert 805: is_nan = (strncasecmp(s+1, "nan", 3) == 0);
806: is_inf = (strncasecmp(s+1, "inf", 3) == 0);
807: if ((is_nan || is_inf)
808: && (isspace((uschar)s[4]) || s[4] == '\0'))
809: goto convert;
810: else if (! isdigit((uschar)s[1]) && s[1] != '.')
1.42 millert 811: return false;
1.44 millert 812: }
813: else if (! isdigit((uschar)s[0]) && s[0] != '.')
1.42 millert 814: return false;
815:
1.44 millert 816: convert:
1.4 kstailey 817: errno = 0;
818: r = strtod(s, &ep);
1.43 millert 819: if (ep == s || errno == ERANGE)
1.42 millert 820: return false;
821:
1.44 millert 822: if (isnan(r) && s[0] == '-' && signbit(r) == 0)
823: r = -r;
824:
1.42 millert 825: if (result != NULL)
826: *result = r;
827:
1.44 millert 828: retval = (isspace((uschar)*ep) || *ep == '\0' || trailing_stuff_ok);
1.42 millert 829:
1.44 millert 830: if (no_trailing != NULL)
1.42 millert 831: *no_trailing = (*ep == '\0');
832:
833: return retval;
1.1 tholo 834: }
![[BACK]](/icons/back.gif){kind=icon}
Return to lib.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / awk