lib.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. /****************************************************************
  10. Copyright (C) Lucent Technologies 1997
  11. All Rights Reserved
  12. Permission to use, copy, modify, and distribute this software and
  13. its documentation for any purpose and without fee is hereby
  14. granted, provided that the above copyright notice appear in all
  15. copies and that both that the copyright notice and this
  16. permission notice and warranty disclaimer appear in supporting
  17. documentation, and that the name Lucent Technologies or any of
  18. its entities not be used in advertising or publicity pertaining
  19. to distribution of the software without specific, written prior
  20. permission.
  21. LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
  22. INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
  23. IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
  24. SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  25. WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
  26. IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
  27. ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
  28. THIS SOFTWARE.
  29. ****************************************************************/
  30. #define DEBUG
  31. #include <stdio.h>
  32. #include <string.h>
  33. #include <ctype.h>
  34. #include <errno.h>
  35. #include <stdlib.h>
  36. #include <stdarg.h>
  37. #include "awk.h"
  38. #include "y.tab.h"
  39. FILE *infile = NULL;
  40. char *file = "";
  41. char *record;
  42. int recsize = RECSIZE;
  43. char *fields;
  44. int fieldssize = RECSIZE;
  45. Cell **fldtab; /* pointers to Cells */
  46. char inputFS[100] = " ";
  47. #define MAXFLD 200
  48. int nfields = MAXFLD; /* last allocated slot for $i */
  49. int donefld; /* 1 = implies rec broken into fields */
  50. int donerec; /* 1 = record is valid (no flds have changed) */
  51. int lastfld = 0; /* last used field */
  52. int argno = 1; /* current input argument number */
  53. extern Awkfloat *ARGC;
  54. static Cell dollar0 = { OCELL, CFLD, NULL, "", 0.0, REC|STR|DONTFREE };
  55. static Cell dollar1 = { OCELL, CFLD, NULL, "", 0.0, FLD|STR|DONTFREE };
  56. void recinit(unsigned int n)
  57. {
  58. record = (char *) malloc(n);
  59. fields = (char *) malloc(n);
  60. fldtab = (Cell **) malloc((nfields+1) * sizeof(Cell *));
  61. if (record == NULL || fields == NULL || fldtab == NULL)
  62. FATAL("out of space for $0 and fields");
  63. fldtab[0] = (Cell *) malloc(sizeof (Cell));
  64. *fldtab[0] = dollar0;
  65. fldtab[0]->sval = record;
  66. fldtab[0]->nval = tostring("0");
  67. makefields(1, nfields);
  68. }
  69. void makefields(int n1, int n2) /* create $n1..$n2 inclusive */
  70. {
  71. char temp[50];
  72. int i;
  73. for (i = n1; i <= n2; i++) {
  74. fldtab[i] = (Cell *) malloc(sizeof (struct Cell));
  75. if (fldtab[i] == NULL)
  76. FATAL("out of space in makefields %d", i);
  77. *fldtab[i] = dollar1;
  78. sprintf(temp, "%d", i);
  79. fldtab[i]->nval = tostring(temp);
  80. }
  81. }
  82. void initgetrec(void)
  83. {
  84. int i;
  85. char *p;
  86. for (i = 1; i < *ARGC; i++) {
  87. if (!isclvar(p = getargv(i))) { /* find 1st real filename */
  88. setsval(lookup("FILENAME", symtab), getargv(i));
  89. return;
  90. }
  91. setclvar(p); /* a commandline assignment before filename */
  92. argno++;
  93. }
  94. infile = stdin; /* no filenames, so use stdin */
  95. }
  96. int getrec(char **pbuf, int *pbufsize, int isrecord) /* get next input record */
  97. { /* note: cares whether buf == record */
  98. int c;
  99. static int firsttime = 1;
  100. char *buf = *pbuf;
  101. int bufsize = *pbufsize;
  102. if (firsttime) {
  103. firsttime = 0;
  104. initgetrec();
  105. }
  106. dprintf( ("RS=<%s>, FS=<%s>, ARGC=%g, FILENAME=%s\n",
  107. *RS, *FS, *ARGC, *FILENAME) );
  108. if (isrecord) {
  109. donefld = 0;
  110. donerec = 1;
  111. }
  112. buf[0] = 0;
  113. while (argno < *ARGC || infile == stdin) {
  114. dprintf( ("argno=%d, file=|%s|\n", argno, file) );
  115. if (infile == NULL) { /* have to open a new file */
  116. file = getargv(argno);
  117. if (*file == '\0') { /* it's been zapped */
  118. argno++;
  119. continue;
  120. }
  121. if (isclvar(file)) { /* a var=value arg */
  122. setclvar(file);
  123. argno++;
  124. continue;
  125. }
  126. *FILENAME = file;
  127. dprintf( ("opening file %s\n", file) );
  128. if (*file == '-' && *(file+1) == '\0')
  129. infile = stdin;
  130. else if ((infile = fopen(file, "r")) == NULL)
  131. FATAL("can't open file %s", file);
  132. setfval(fnrloc, 0.0);
  133. }
  134. c = readrec(&buf, &bufsize, infile);
  135. if (c != 0 || buf[0] != '\0') { /* normal record */
  136. if (isrecord) {
  137. if (freeable(fldtab[0]))
  138. xfree(fldtab[0]->sval);
  139. fldtab[0]->sval = buf; /* buf == record */
  140. fldtab[0]->tval = REC | STR | DONTFREE;
  141. if (is_number(fldtab[0]->sval)) {
  142. fldtab[0]->fval = atof(fldtab[0]->sval);
  143. fldtab[0]->tval |= NUM;
  144. }
  145. }
  146. setfval(nrloc, nrloc->fval+1);
  147. setfval(fnrloc, fnrloc->fval+1);
  148. *pbuf = buf;
  149. *pbufsize = bufsize;
  150. return 1;
  151. }
  152. /* EOF arrived on this file; set up next */
  153. if (infile != stdin)
  154. fclose(infile);
  155. infile = NULL;
  156. argno++;
  157. }
  158. *pbuf = buf;
  159. *pbufsize = bufsize;
  160. return 0; /* true end of file */
  161. }
  162. void nextfile(void)
  163. {
  164. if (infile != stdin)
  165. fclose(infile);
  166. infile = NULL;
  167. argno++;
  168. }
  169. int readrec(char **pbuf, int *pbufsize, FILE *inf) /* read one record into buf */
  170. {
  171. int sep, c;
  172. char *rr, *buf = *pbuf;
  173. int bufsize = *pbufsize;
  174. if (strlen(*FS) >= sizeof(inputFS))
  175. FATAL("field separator %.10s... is too long", *FS);
  176. strcpy(inputFS, *FS); /* for subsequent field splitting */
  177. if ((sep = **RS) == 0) {
  178. sep = '\n';
  179. while ((c=getc(inf)) == '\n' && c != EOF) /* skip leading \n's */
  180. ;
  181. if (c != EOF)
  182. ungetc(c, inf);
  183. }
  184. for (rr = buf; ; ) {
  185. for (; (c=getc(inf)) != sep && c != EOF; ) {
  186. if (rr-buf+1 > bufsize)
  187. if (!adjbuf(&buf, &bufsize, 1+rr-buf, recsize, &rr, "readrec 1"))
  188. FATAL("input record `%.30s...' too long", buf);
  189. *rr++ = c;
  190. }
  191. if (**RS == sep || c == EOF)
  192. break;
  193. if ((c = getc(inf)) == '\n' || c == EOF) /* 2 in a row */
  194. break;
  195. if (!adjbuf(&buf, &bufsize, 2+rr-buf, recsize, &rr, "readrec 2"))
  196. FATAL("input record `%.30s...' too long", buf);
  197. *rr++ = '\n';
  198. *rr++ = c;
  199. }
  200. if (!adjbuf(&buf, &bufsize, 1+rr-buf, recsize, &rr, "readrec 3"))
  201. FATAL("input record `%.30s...' too long", buf);
  202. *rr = 0;
  203. dprintf( ("readrec saw <%s>, returns %d\n", buf, c == EOF && rr == buf ? 0 : 1) );
  204. *pbuf = buf;
  205. *pbufsize = bufsize;
  206. return c == EOF && rr == buf ? 0 : 1;
  207. }
  208. char *getargv(int n) /* get ARGV[n] */
  209. {
  210. Cell *x;
  211. char *s, temp[50];
  212. extern Array *ARGVtab;
  213. sprintf(temp, "%d", n);
  214. x = setsymtab(temp, "", 0.0, STR, ARGVtab);
  215. s = getsval(x);
  216. dprintf( ("getargv(%d) returns |%s|\n", n, s) );
  217. return s;
  218. }
  219. void setclvar(char *s) /* set var=value from s */
  220. {
  221. char *p;
  222. Cell *q;
  223. for (p=s; *p != '='; p++)
  224. ;
  225. *p++ = 0;
  226. p = qstring(p, '\0');
  227. q = setsymtab(s, p, 0.0, STR, symtab);
  228. setsval(q, p);
  229. if (is_number(q->sval)) {
  230. q->fval = atof(q->sval);
  231. q->tval |= NUM;
  232. }
  233. dprintf( ("command line set %s to |%s|\n", s, p) );
  234. }
  235. void fldbld(void) /* create fields from current record */
  236. {
  237. /* this relies on having fields[] the same length as $0 */
  238. /* the fields are all stored in this one array with \0's */
  239. char *r, *fr, sep;
  240. Cell *p;
  241. int i, j, n;
  242. if (donefld)
  243. return;
  244. if (!isstr(fldtab[0]))
  245. getsval(fldtab[0]);
  246. r = fldtab[0]->sval;
  247. n = strlen(r);
  248. if (n > fieldssize) {
  249. xfree(fields);
  250. if ((fields = (char *) malloc(n+1)) == NULL)
  251. FATAL("out of space for fields in fldbld %d", n);
  252. fieldssize = n;
  253. }
  254. fr = fields;
  255. i = 0; /* number of fields accumulated here */
  256. if (strlen(inputFS) > 1) { /* it's a regular expression */
  257. i = refldbld(r, inputFS);
  258. } else if ((sep = *inputFS) == ' ') { /* default whitespace */
  259. for (i = 0; ; ) {
  260. while (*r == ' ' || *r == '\t' || *r == '\n')
  261. r++;
  262. if (*r == 0)
  263. break;
  264. i++;
  265. if (i > nfields)
  266. growfldtab(i);
  267. if (freeable(fldtab[i]))
  268. xfree(fldtab[i]->sval);
  269. fldtab[i]->sval = fr;
  270. fldtab[i]->tval = FLD | STR | DONTFREE;
  271. do
  272. *fr++ = *r++;
  273. while (*r != ' ' && *r != '\t' && *r != '\n' && *r != '\0');
  274. *fr++ = 0;
  275. }
  276. *fr = 0;
  277. } else if ((sep = *inputFS) == 0) { /* new: FS="" => 1 char/field */
  278. for (i = 0; *r != 0; r++) {
  279. char buf[2];
  280. i++;
  281. if (i > nfields)
  282. growfldtab(i);
  283. if (freeable(fldtab[i]))
  284. xfree(fldtab[i]->sval);
  285. buf[0] = *r;
  286. buf[1] = 0;
  287. fldtab[i]->sval = tostring(buf);
  288. fldtab[i]->tval = FLD | STR;
  289. }
  290. *fr = 0;
  291. } else if (*r != 0) { /* if 0, it's a null field */
  292. for (;;) {
  293. i++;
  294. if (i > nfields)
  295. growfldtab(i);
  296. if (freeable(fldtab[i]))
  297. xfree(fldtab[i]->sval);
  298. fldtab[i]->sval = fr;
  299. fldtab[i]->tval = FLD | STR | DONTFREE;
  300. while (*r != sep && *r != '\n' && *r != '\0') /* \n is always a separator */
  301. *fr++ = *r++;
  302. *fr++ = 0;
  303. if (*r++ == 0)
  304. break;
  305. }
  306. *fr = 0;
  307. }
  308. if (i > nfields)
  309. FATAL("record `%.30s...' has too many fields; can't happen", r);
  310. cleanfld(i+1, lastfld); /* clean out junk from previous record */
  311. lastfld = i;
  312. donefld = 1;
  313. for (j = 1; j <= lastfld; j++) {
  314. p = fldtab[j];
  315. if(is_number(p->sval)) {
  316. p->fval = atof(p->sval);
  317. p->tval |= NUM;
  318. }
  319. }
  320. setfval(nfloc, (Awkfloat) lastfld);
  321. if (dbg) {
  322. for (j = 0; j <= lastfld; j++) {
  323. p = fldtab[j];
  324. printf("field %d (%s): |%s|\n", j, p->nval, p->sval);
  325. }
  326. }
  327. }
  328. void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */
  329. { /* nvals remain intact */
  330. Cell *p;
  331. int i;
  332. for (i = n1; i <= n2; i++) {
  333. p = fldtab[i];
  334. if (freeable(p))
  335. xfree(p->sval);
  336. p->sval = "";
  337. p->tval = FLD | STR | DONTFREE;
  338. }
  339. }
  340. void newfld(int n) /* add field n after end of existing lastfld */
  341. {
  342. if (n > nfields)
  343. growfldtab(n);
  344. cleanfld(lastfld+1, n);
  345. lastfld = n;
  346. setfval(nfloc, (Awkfloat) n);
  347. }
  348. Cell *fieldadr(int n) /* get nth field */
  349. {
  350. if (n < 0)
  351. FATAL("trying to access field %d", n);
  352. if (n > nfields) /* fields after NF are empty */
  353. growfldtab(n); /* but does not increase NF */
  354. return(fldtab[n]);
  355. }
  356. void growfldtab(int n) /* make new fields up to at least $n */
  357. {
  358. int nf = 2 * nfields;
  359. if (n > nf)
  360. nf = n;
  361. fldtab = (Cell **) realloc(fldtab, (nf+1) * (sizeof (struct Cell *)));
  362. if (fldtab == NULL)
  363. FATAL("out of space creating %d fields", nf);
  364. makefields(nfields+1, nf);
  365. nfields = nf;
  366. }
  367. int refldbld(char *rec, char *fs) /* build fields from reg expr in FS */
  368. {
  369. /* this relies on having fields[] the same length as $0 */
  370. /* the fields are all stored in this one array with \0's */
  371. char *fr;
  372. void *p;
  373. int i, tempstat, n;
  374. n = strlen(rec);
  375. if (n > fieldssize) {
  376. xfree(fields);
  377. if ((fields = (char *) malloc(n+1)) == NULL)
  378. FATAL("out of space for fields in refldbld %d", n);
  379. fieldssize = n;
  380. }
  381. fr = fields;
  382. *fr = '\0';
  383. if (*rec == '\0')
  384. return 0;
  385. p = compre(fs);
  386. dprintf( ("into refldbld, rec = <%s>, pat = <%s>\n", rec, fs) );
  387. for (i = 1; ; i++) {
  388. if (i > nfields)
  389. growfldtab(i);
  390. if (freeable(fldtab[i]))
  391. xfree(fldtab[i]->sval);
  392. fldtab[i]->tval = FLD | STR | DONTFREE;
  393. fldtab[i]->sval = fr;
  394. dprintf( ("refldbld: i=%d\n", i) );
  395. if (nematch(p, rec, rec)) {
  396. dprintf( ("match %s (%d chars)\n", patbeg, patlen) );
  397. strncpy(fr, rec, patbeg-rec);
  398. fr += patbeg - rec + 1;
  399. *(fr-1) = '\0';
  400. rec = patbeg + patlen;
  401. } else {
  402. dprintf( ("no match %s\n", rec) );
  403. strcpy(fr, rec);
  404. break;
  405. }
  406. }
  407. return i;
  408. }
  409. void recbld(void) /* create $0 from $1..$NF if necessary */
  410. {
  411. int i;
  412. char *r, *p;
  413. if (donerec == 1)
  414. return;
  415. r = record;
  416. for (i = 1; i <= *NF; i++) {
  417. p = getsval(fldtab[i]);
  418. if (!adjbuf(&record, &recsize, 1+strlen(p)+r-record, recsize, &r, "recbld 1"))
  419. FATAL("created $0 `%.30s...' too long", record);
  420. while ((*r = *p++) != 0)
  421. r++;
  422. if (i < *NF) {
  423. if (!adjbuf(&record, &recsize, 2+strlen(*OFS)+r-record, recsize, &r, "recbld 2"))
  424. FATAL("created $0 `%.30s...' too long", record);
  425. for (p = *OFS; (*r = *p++) != 0; )
  426. r++;
  427. }
  428. }
  429. if (!adjbuf(&record, &recsize, 2+r-record, recsize, &r, "recbld 3"))
  430. FATAL("built giant record `%.30s...'", record);
  431. *r = '\0';
  432. dprintf( ("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, fldtab[0]) );
  433. if (freeable(fldtab[0]))
  434. xfree(fldtab[0]->sval);
  435. fldtab[0]->tval = REC | STR | DONTFREE;
  436. fldtab[0]->sval = record;
  437. dprintf( ("in recbld inputFS=%s, fldtab[0]=%p\n", inputFS, fldtab[0]) );
  438. dprintf( ("recbld = |%s|\n", record) );
  439. donerec = 1;
  440. }
  441. int errorflag = 0;
  442. void yyerror(char *s)
  443. {
  444. SYNTAX(s);
  445. }
  446. void SYNTAX(char *fmt, ...)
  447. {
  448. extern char *cmdname, *curfname;
  449. static int been_here = 0;
  450. va_list varg;
  451. if (been_here++ > 2)
  452. return;
  453. fprintf(stderr, "%s: ", cmdname);
  454. va_start(varg, fmt);
  455. vfprintf(stderr, fmt, varg);
  456. va_end(varg);
  457. if(compile_time == 1 && cursource() != NULL)
  458. fprintf(stderr, " at %s:%d", cursource(), lineno);
  459. else
  460. fprintf(stderr, " at line %d", lineno);
  461. if (curfname != NULL)
  462. fprintf(stderr, " in function %s", curfname);
  463. fprintf(stderr, "\n");
  464. errorflag = 2;
  465. eprint();
  466. }
  467. void fpecatch(int n)
  468. {
  469. FATAL("floating point exception %d", n);
  470. }
  471. extern int bracecnt, brackcnt, parencnt;
  472. void bracecheck(void)
  473. {
  474. int c;
  475. static int beenhere = 0;
  476. if (beenhere++)
  477. return;
  478. while ((c = input()) != EOF && c != '\0')
  479. bclass(c);
  480. bcheck2(bracecnt, '{', '}');
  481. bcheck2(brackcnt, '[', ']');
  482. bcheck2(parencnt, '(', ')');
  483. }
  484. void bcheck2(int n, int c1, int c2)
  485. {
  486. if (n == 1)
  487. fprintf(stderr, "\tmissing %c\n", c2);
  488. else if (n > 1)
  489. fprintf(stderr, "\t%d missing %c's\n", n, c2);
  490. else if (n == -1)
  491. fprintf(stderr, "\textra %c\n", c2);
  492. else if (n < -1)
  493. fprintf(stderr, "\t%d extra %c's\n", -n, c2);
  494. }
  495. void FATAL(char *fmt, ...)
  496. {
  497. extern char *cmdname;
  498. va_list varg;
  499. fflush(stdout);
  500. fprintf(stderr, "%s: ", cmdname);
  501. va_start(varg, fmt);
  502. vfprintf(stderr, fmt, varg);
  503. va_end(varg);
  504. error();
  505. if (dbg > 1) /* core dump if serious debugging on */
  506. abort();
  507. exit(2);
  508. }
  509. void WARNING(char *fmt, ...)
  510. {
  511. extern char *cmdname;
  512. va_list varg;
  513. fflush(stdout);
  514. fprintf(stderr, "%s: ", cmdname);
  515. va_start(varg, fmt);
  516. vfprintf(stderr, fmt, varg);
  517. va_end(varg);
  518. error();
  519. }
  520. void error()
  521. {
  522. extern Node *curnode;
  523. int line;
  524. fprintf(stderr, "\n");
  525. if (compile_time != 2 && NR && *NR > 0) {
  526. if (strcmp(*FILENAME, "-") != 0)
  527. fprintf(stderr, " input record %s:%d", *FILENAME, (int) (*FNR));
  528. else
  529. fprintf(stderr, " input record number %d", (int) (*FNR));
  530. fprintf(stderr, "\n");
  531. }
  532. if (compile_time != 2 && curnode)
  533. line = curnode->lineno;
  534. else if (compile_time != 2 && lineno)
  535. line = lineno;
  536. else
  537. line = -1;
  538. if (compile_time == 1 && cursource() != NULL){
  539. if(line >= 0)
  540. fprintf(stderr, " source %s:%d", cursource(), line);
  541. else
  542. fprintf(stderr, " source file %s", cursource());
  543. }else if(line >= 0)
  544. fprintf(stderr, " source line %d", line);
  545. fprintf(stderr, "\n");
  546. eprint();
  547. }
  548. void eprint(void) /* try to print context around error */
  549. {
  550. char *p, *q;
  551. int c;
  552. static int been_here = 0;
  553. extern char ebuf[], *ep;
  554. if (compile_time == 2 || compile_time == 0 || been_here++ > 0)
  555. return;
  556. p = ep - 1;
  557. if (p > ebuf && *p == '\n')
  558. p--;
  559. for ( ; p > ebuf && *p != '\n' && *p != '\0'; p--)
  560. ;
  561. while (*p == '\n')
  562. p++;
  563. fprintf(stderr, " context is\n\t");
  564. for (q=ep-1; q>=p && *q!=' ' && *q!='\t' && *q!='\n'; q--)
  565. ;
  566. for ( ; p < q; p++)
  567. if (*p)
  568. putc(*p, stderr);
  569. fprintf(stderr, " >>> ");
  570. for ( ; p < ep; p++)
  571. if (*p)
  572. putc(*p, stderr);
  573. fprintf(stderr, " <<< ");
  574. if (*ep)
  575. while ((c = input()) != '\n' && c != '\0' && c != EOF) {
  576. putc(c, stderr);
  577. bclass(c);
  578. }
  579. putc('\n', stderr);
  580. ep = ebuf;
  581. }
  582. void bclass(int c)
  583. {
  584. switch (c) {
  585. case '{': bracecnt++; break;
  586. case '}': bracecnt--; break;
  587. case '[': brackcnt++; break;
  588. case ']': brackcnt--; break;
  589. case '(': parencnt++; break;
  590. case ')': parencnt--; break;
  591. }
  592. }
  593. double errcheck(double x, char *s)
  594. {
  595. if (errno == EDOM) {
  596. errno = 0;
  597. WARNING("%s argument out of domain", s);
  598. x = 1;
  599. } else if (errno == ERANGE) {
  600. errno = 0;
  601. WARNING("%s result out of range", s);
  602. x = 1;
  603. }
  604. return x;
  605. }
  606. int isclvar(char *s) /* is s of form var=something ? */
  607. {
  608. char *os = s;
  609. if (!isalpha(*s) && *s != '_')
  610. return 0;
  611. for ( ; *s; s++)
  612. if (!(isalnum(*s) || *s == '_'))
  613. break;
  614. return *s == '=' && s > os && *(s+1) != '=';
  615. }
  616. /* strtod is supposed to be a proper test of what's a valid number */
  617. #include <math.h>
  618. int is_number(char *s)
  619. {
  620. double r;
  621. char *ep;
  622. /*
  623. * fast could-it-be-a-number check before calling strtod,
  624. * which takes a surprisingly long time to reject non-numbers.
  625. */
  626. switch (*s) {
  627. case '0': case '1': case '2': case '3': case '4':
  628. case '5': case '6': case '7': case '8': case '9':
  629. case '\t':
  630. case '\n':
  631. case '\v':
  632. case '\f':
  633. case '\r':
  634. case ' ':
  635. case '-':
  636. case '+':
  637. case '.':
  638. case 'n': /* nans */
  639. case 'N':
  640. case 'i': /* infs */
  641. case 'I':
  642. break;
  643. default:
  644. return 0; /* can't be a number */
  645. }
  646. errno = 0;
  647. r = strtod(s, &ep);
  648. if (ep == s || r == HUGE_VAL || errno == ERANGE)
  649. return 0;
  650. while (*ep == ' ' || *ep == '\t' || *ep == '\n')
  651. ep++;
  652. if (*ep == '\0')
  653. return 1;
  654. else
  655. return 0;
  656. }