1 /*- 2 * Copyright (c) 1992 Diomidis Spinellis. 3 * Copyright (c) 1992, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * Diomidis Spinellis of Imperial College, University of London. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #include <sys/cdefs.h> 35 __FBSDID("$FreeBSD$"); 36 37 #ifndef lint 38 static const char sccsid[] = "@(#)compile.c 8.1 (Berkeley) 6/6/93"; 39 #endif 40 41 #include <sys/types.h> 42 #include <sys/stat.h> 43 44 #include <ctype.h> 45 #include <err.h> 46 #include <errno.h> 47 #include <fcntl.h> 48 #include <limits.h> 49 #include <regex.h> 50 #include <stdio.h> 51 #include <stdlib.h> 52 #include <string.h> 53 #include <wchar.h> 54 55 #include "defs.h" 56 #include "extern.h" 57 58 #define LHSZ 128 59 #define LHMASK (LHSZ - 1) 60 static struct labhash { 61 struct labhash *lh_next; 62 u_int lh_hash; 63 struct s_command *lh_cmd; 64 int lh_ref; 65 } *labels[LHSZ]; 66 67 static char *compile_addr(char *, struct s_addr *); 68 static char *compile_ccl(char **, char *); 69 static char *compile_delimited(char *, char *); 70 static char *compile_flags(char *, struct s_subst *); 71 static char *compile_re(char *, regex_t **); 72 static char *compile_subst(char *, struct s_subst *); 73 static char *compile_text(void); 74 static char *compile_tr(char *, struct s_tr **); 75 static struct s_command 76 **compile_stream(struct s_command **); 77 static char *duptoeol(char *, const char *); 78 static void enterlabel(struct s_command *); 79 static struct s_command 80 *findlabel(char *); 81 static void fixuplabel(struct s_command *, struct s_command *); 82 static void uselabel(void); 83 84 /* 85 * Command specification. This is used to drive the command parser. 86 */ 87 struct s_format { 88 char code; /* Command code */ 89 int naddr; /* Number of address args */ 90 enum e_args args; /* Argument type */ 91 }; 92 93 static struct s_format cmd_fmts[] = { 94 {'{', 2, GROUP}, 95 {'}', 0, ENDGROUP}, 96 {'a', 1, TEXT}, 97 {'b', 2, BRANCH}, 98 {'c', 2, TEXT}, 99 {'d', 2, EMPTY}, 100 {'D', 2, EMPTY}, 101 {'g', 2, EMPTY}, 102 {'G', 2, EMPTY}, 103 {'h', 2, EMPTY}, 104 {'H', 2, EMPTY}, 105 {'i', 1, TEXT}, 106 {'l', 2, EMPTY}, 107 {'n', 2, EMPTY}, 108 {'N', 2, EMPTY}, 109 {'p', 2, EMPTY}, 110 {'P', 2, EMPTY}, 111 {'q', 1, EMPTY}, 112 {'r', 1, RFILE}, 113 {'s', 2, SUBST}, 114 {'t', 2, BRANCH}, 115 {'w', 2, WFILE}, 116 {'x', 2, EMPTY}, 117 {'y', 2, TR}, 118 {'!', 2, NONSEL}, 119 {':', 0, LABEL}, 120 {'#', 0, COMMENT}, 121 {'=', 1, EMPTY}, 122 {'\0', 0, COMMENT}, 123 }; 124 125 /* The compiled program. */ 126 struct s_command *prog; 127 128 /* 129 * Compile the program into prog. 130 * Initialise appends. 131 */ 132 void 133 compile(void) 134 { 135 *compile_stream(&prog) = NULL; 136 fixuplabel(prog, NULL); 137 uselabel(); 138 if (appendnum == 0) 139 appends = NULL; 140 else if ((appends = malloc(sizeof(struct s_appends) * appendnum)) == 141 NULL) 142 err(1, "malloc"); 143 if ((match = malloc((maxnsub + 1) * sizeof(regmatch_t))) == NULL) 144 err(1, "malloc"); 145 } 146 147 #define EATSPACE() do { \ 148 if (p) \ 149 while (*p && isspace((unsigned char)*p)) \ 150 p++; \ 151 } while (0) 152 153 static struct s_command ** 154 compile_stream(struct s_command **link) 155 { 156 char *p; 157 static char lbuf[_POSIX2_LINE_MAX + 1]; /* To save stack */ 158 struct s_command *cmd, *cmd2, *stack; 159 struct s_format *fp; 160 int naddr; /* Number of addresses */ 161 162 stack = 0; 163 for (;;) { 164 if ((p = cu_fgets(lbuf, sizeof(lbuf), NULL)) == NULL) { 165 if (stack != 0) 166 errx(1, "%lu: %s: unexpected EOF (pending }'s)", 167 linenum, fname); 168 return (link); 169 } 170 171 semicolon: EATSPACE(); 172 if (p) { 173 if (*p == '#' || *p == '\0') 174 continue; 175 else if (*p == ';') { 176 p++; 177 goto semicolon; 178 } 179 } 180 if ((*link = cmd = malloc(sizeof(struct s_command))) == NULL) 181 err(1, "malloc"); 182 link = &cmd->next; 183 cmd->nonsel = cmd->inrange = 0; 184 /* First parse the addresses */ 185 naddr = 0; 186 187 /* Valid characters to start an address */ 188 #define addrchar(c) (strchr("0123456789/\\$", (c))) 189 if (addrchar(*p)) { 190 naddr++; 191 if ((cmd->a1 = malloc(sizeof(struct s_addr))) == NULL) 192 err(1, "malloc"); 193 p = compile_addr(p, cmd->a1); 194 EATSPACE(); /* EXTENSION */ 195 if (*p == ',') { 196 p++; 197 EATSPACE(); /* EXTENSION */ 198 naddr++; 199 if ((cmd->a2 = malloc(sizeof(struct s_addr))) 200 == NULL) 201 err(1, "malloc"); 202 p = compile_addr(p, cmd->a2); 203 EATSPACE(); 204 } else 205 cmd->a2 = 0; 206 } else 207 cmd->a1 = cmd->a2 = 0; 208 209 nonsel: /* Now parse the command */ 210 if (!*p) 211 errx(1, "%lu: %s: command expected", linenum, fname); 212 cmd->code = *p; 213 for (fp = cmd_fmts; fp->code; fp++) 214 if (fp->code == *p) 215 break; 216 if (!fp->code) 217 errx(1, "%lu: %s: invalid command code %c", linenum, fname, *p); 218 if (naddr > fp->naddr) 219 errx(1, 220 "%lu: %s: command %c expects up to %d address(es), found %d", 221 linenum, fname, *p, fp->naddr, naddr); 222 switch (fp->args) { 223 case NONSEL: /* ! */ 224 p++; 225 EATSPACE(); 226 cmd->nonsel = ! cmd->nonsel; 227 goto nonsel; 228 case GROUP: /* { */ 229 p++; 230 EATSPACE(); 231 cmd->next = stack; 232 stack = cmd; 233 link = &cmd->u.c; 234 if (*p) 235 goto semicolon; 236 break; 237 case ENDGROUP: 238 /* 239 * Short-circuit command processing, since end of 240 * group is really just a noop. 241 */ 242 cmd->nonsel = 1; 243 if (stack == 0) 244 errx(1, "%lu: %s: unexpected }", linenum, fname); 245 cmd2 = stack; 246 stack = cmd2->next; 247 cmd2->next = cmd; 248 /*FALLTHROUGH*/ 249 case EMPTY: /* d D g G h H l n N p P q x = \0 */ 250 p++; 251 EATSPACE(); 252 if (*p == ';') { 253 p++; 254 link = &cmd->next; 255 goto semicolon; 256 } 257 if (*p) 258 errx(1, "%lu: %s: extra characters at the end of %c command", 259 linenum, fname, cmd->code); 260 break; 261 case TEXT: /* a c i */ 262 p++; 263 EATSPACE(); 264 if (*p != '\\') 265 errx(1, 266 "%lu: %s: command %c expects \\ followed by text", linenum, fname, cmd->code); 267 p++; 268 EATSPACE(); 269 if (*p) 270 errx(1, 271 "%lu: %s: extra characters after \\ at the end of %c command", 272 linenum, fname, cmd->code); 273 cmd->t = compile_text(); 274 break; 275 case COMMENT: /* \0 # */ 276 break; 277 case WFILE: /* w */ 278 p++; 279 EATSPACE(); 280 if (*p == '\0') 281 errx(1, "%lu: %s: filename expected", linenum, fname); 282 cmd->t = duptoeol(p, "w command"); 283 if (aflag) 284 cmd->u.fd = -1; 285 else if ((cmd->u.fd = open(p, 286 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC, 287 DEFFILEMODE)) == -1) 288 err(1, "%s", p); 289 break; 290 case RFILE: /* r */ 291 p++; 292 EATSPACE(); 293 if (*p == '\0') 294 errx(1, "%lu: %s: filename expected", linenum, fname); 295 else 296 cmd->t = duptoeol(p, "read command"); 297 break; 298 case BRANCH: /* b t */ 299 p++; 300 EATSPACE(); 301 if (*p == '\0') 302 cmd->t = NULL; 303 else 304 cmd->t = duptoeol(p, "branch"); 305 break; 306 case LABEL: /* : */ 307 p++; 308 EATSPACE(); 309 cmd->t = duptoeol(p, "label"); 310 if (strlen(p) == 0) 311 errx(1, "%lu: %s: empty label", linenum, fname); 312 enterlabel(cmd); 313 break; 314 case SUBST: /* s */ 315 p++; 316 if (*p == '\0' || *p == '\\') 317 errx(1, 318 "%lu: %s: substitute pattern can not be delimited by newline or backslash", 319 linenum, fname); 320 if ((cmd->u.s = malloc(sizeof(struct s_subst))) == NULL) 321 err(1, "malloc"); 322 p = compile_re(p, &cmd->u.s->re); 323 if (p == NULL) 324 errx(1, 325 "%lu: %s: unterminated substitute pattern", linenum, fname); 326 --p; 327 p = compile_subst(p, cmd->u.s); 328 p = compile_flags(p, cmd->u.s); 329 EATSPACE(); 330 if (*p == ';') { 331 p++; 332 link = &cmd->next; 333 goto semicolon; 334 } 335 break; 336 case TR: /* y */ 337 p++; 338 p = compile_tr(p, &cmd->u.y); 339 EATSPACE(); 340 if (*p == ';') { 341 p++; 342 link = &cmd->next; 343 goto semicolon; 344 } 345 if (*p) 346 errx(1, 347 "%lu: %s: extra text at the end of a transform command", linenum, fname); 348 break; 349 } 350 } 351 } 352 353 /* 354 * Get a delimited string. P points to the delimeter of the string; d points 355 * to a buffer area. Newline and delimiter escapes are processed; other 356 * escapes are ignored. 357 * 358 * Returns a pointer to the first character after the final delimiter or NULL 359 * in the case of a non-terminated string. The character array d is filled 360 * with the processed string. 361 */ 362 static char * 363 compile_delimited(char *p, char *d) 364 { 365 char c; 366 367 c = *p++; 368 if (c == '\0') 369 return (NULL); 370 else if (c == '\\') 371 errx(1, "%lu: %s: \\ can not be used as a string delimiter", 372 linenum, fname); 373 else if (c == '\n') 374 errx(1, "%lu: %s: newline can not be used as a string delimiter", 375 linenum, fname); 376 while (*p) { 377 if (*p == '[') { 378 if ((d = compile_ccl(&p, d)) == NULL) 379 errx(1, "%lu: %s: unbalanced brackets ([])", linenum, fname); 380 continue; 381 } else if (*p == '\\' && p[1] == '[') { 382 *d++ = *p++; 383 } else if (*p == '\\' && p[1] == c) 384 p++; 385 else if (*p == '\\' && p[1] == 'n') { 386 *d++ = '\n'; 387 p += 2; 388 continue; 389 } else if (*p == '\\' && p[1] == '\\') 390 *d++ = *p++; 391 else if (*p == c) { 392 *d = '\0'; 393 return (p + 1); 394 } 395 *d++ = *p++; 396 } 397 return (NULL); 398 } 399 400 401 /* compile_ccl: expand a POSIX character class */ 402 static char * 403 compile_ccl(char **sp, char *t) 404 { 405 int c, d; 406 char *s = *sp; 407 408 *t++ = *s++; 409 if (*s == '^') 410 *t++ = *s++; 411 if (*s == ']') 412 *t++ = *s++; 413 for (; *s && (*t = *s) != ']'; s++, t++) 414 if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '=')) { 415 *++t = *++s, t++, s++; 416 for (c = *s; (*t = *s) != ']' || c != d; s++, t++) 417 if ((c = *s) == '\0') 418 return NULL; 419 } else if (*s == '\\' && s[1] == 'n') 420 *t = '\n', s++; 421 return (*s == ']') ? *sp = ++s, ++t : NULL; 422 } 423 424 /* 425 * Get a regular expression. P points to the delimiter of the regular 426 * expression; repp points to the address of a regexp pointer. Newline 427 * and delimiter escapes are processed; other escapes are ignored. 428 * Returns a pointer to the first character after the final delimiter 429 * or NULL in the case of a non terminated regular expression. The regexp 430 * pointer is set to the compiled regular expression. 431 * Cflags are passed to regcomp. 432 */ 433 static char * 434 compile_re(char *p, regex_t **repp) 435 { 436 int eval; 437 char re[_POSIX2_LINE_MAX + 1]; 438 439 p = compile_delimited(p, re); 440 if (p && strlen(re) == 0) { 441 *repp = NULL; 442 return (p); 443 } 444 if ((*repp = malloc(sizeof(regex_t))) == NULL) 445 err(1, "malloc"); 446 if (p && (eval = regcomp(*repp, re, rflags)) != 0) 447 errx(1, "%lu: %s: RE error: %s", 448 linenum, fname, strregerror(eval, *repp)); 449 if (maxnsub < (*repp)->re_nsub) 450 maxnsub = (*repp)->re_nsub; 451 return (p); 452 } 453 454 /* 455 * Compile the substitution string of a regular expression and set res to 456 * point to a saved copy of it. Nsub is the number of parenthesized regular 457 * expressions. 458 */ 459 static char * 460 compile_subst(char *p, struct s_subst *s) 461 { 462 static char lbuf[_POSIX2_LINE_MAX + 1]; 463 int asize, size; 464 u_char ref; 465 char c, *text, *op, *sp; 466 int more = 1, sawesc = 0; 467 468 c = *p++; /* Terminator character */ 469 if (c == '\0') 470 return (NULL); 471 472 s->maxbref = 0; 473 s->linenum = linenum; 474 asize = 2 * _POSIX2_LINE_MAX + 1; 475 if ((text = malloc(asize)) == NULL) 476 err(1, "malloc"); 477 size = 0; 478 do { 479 op = sp = text + size; 480 for (; *p; p++) { 481 if (*p == '\\' || sawesc) { 482 /* 483 * If this is a continuation from the last 484 * buffer, we won't have a character to 485 * skip over. 486 */ 487 if (sawesc) 488 sawesc = 0; 489 else 490 p++; 491 492 if (*p == '\0') { 493 /* 494 * This escaped character is continued 495 * in the next part of the line. Note 496 * this fact, then cause the loop to 497 * exit w/ normal EOL case and reenter 498 * above with the new buffer. 499 */ 500 sawesc = 1; 501 p--; 502 continue; 503 } else if (strchr("123456789", *p) != NULL) { 504 *sp++ = '\\'; 505 ref = *p - '0'; 506 if (s->re != NULL && 507 ref > s->re->re_nsub) 508 errx(1, "%lu: %s: \\%c not defined in the RE", 509 linenum, fname, *p); 510 if (s->maxbref < ref) 511 s->maxbref = ref; 512 } else if (*p == '&' || *p == '\\') 513 *sp++ = '\\'; 514 } else if (*p == c) { 515 if (*++p == '\0' && more) { 516 if (cu_fgets(lbuf, sizeof(lbuf), &more)) 517 p = lbuf; 518 } 519 *sp++ = '\0'; 520 size += sp - op; 521 if ((s->new = realloc(text, size)) == NULL) 522 err(1, "realloc"); 523 return (p); 524 } else if (*p == '\n') { 525 errx(1, 526 "%lu: %s: unescaped newline inside substitute pattern", linenum, fname); 527 /* NOTREACHED */ 528 } 529 *sp++ = *p; 530 } 531 size += sp - op; 532 if (asize - size < _POSIX2_LINE_MAX + 1) { 533 asize *= 2; 534 if ((text = realloc(text, asize)) == NULL) 535 err(1, "realloc"); 536 } 537 } while (cu_fgets(p = lbuf, sizeof(lbuf), &more)); 538 errx(1, "%lu: %s: unterminated substitute in regular expression", 539 linenum, fname); 540 /* NOTREACHED */ 541 } 542 543 /* 544 * Compile the flags of the s command 545 */ 546 static char * 547 compile_flags(char *p, struct s_subst *s) 548 { 549 int gn; /* True if we have seen g or n */ 550 char wfile[_POSIX2_LINE_MAX + 1], *q; 551 552 s->n = 1; /* Default */ 553 s->p = 0; 554 s->wfile = NULL; 555 s->wfd = -1; 556 for (gn = 0;;) { 557 EATSPACE(); /* EXTENSION */ 558 switch (*p) { 559 case 'g': 560 if (gn) 561 errx(1, 562 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname); 563 gn = 1; 564 s->n = 0; 565 break; 566 case '\0': 567 case '\n': 568 case ';': 569 return (p); 570 case 'p': 571 s->p = 1; 572 break; 573 case '1': case '2': case '3': 574 case '4': case '5': case '6': 575 case '7': case '8': case '9': 576 if (gn) 577 errx(1, 578 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname); 579 gn = 1; 580 /* XXX Check for overflow */ 581 s->n = (int)strtol(p, &p, 10); 582 break; 583 case 'w': 584 p++; 585 #ifdef HISTORIC_PRACTICE 586 if (*p != ' ') { 587 warnx("%lu: %s: space missing before w wfile", linenum, fname); 588 return (p); 589 } 590 #endif 591 EATSPACE(); 592 q = wfile; 593 while (*p) { 594 if (*p == '\n') 595 break; 596 *q++ = *p++; 597 } 598 *q = '\0'; 599 if (q == wfile) 600 errx(1, "%lu: %s: no wfile specified", linenum, fname); 601 s->wfile = strdup(wfile); 602 if (!aflag && (s->wfd = open(wfile, 603 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC, 604 DEFFILEMODE)) == -1) 605 err(1, "%s", wfile); 606 return (p); 607 default: 608 errx(1, "%lu: %s: bad flag in substitute command: '%c'", 609 linenum, fname, *p); 610 break; 611 } 612 p++; 613 } 614 } 615 616 /* 617 * Compile a translation set of strings into a lookup table. 618 */ 619 static char * 620 compile_tr(char *p, struct s_tr **py) 621 { 622 struct s_tr *y; 623 int i; 624 const char *op, *np; 625 char old[_POSIX2_LINE_MAX + 1]; 626 char new[_POSIX2_LINE_MAX + 1]; 627 size_t oclen, oldlen, nclen, newlen; 628 mbstate_t mbs1, mbs2; 629 630 if ((*py = y = malloc(sizeof(*y))) == NULL) 631 err(1, NULL); 632 y->multis = NULL; 633 y->nmultis = 0; 634 635 if (*p == '\0' || *p == '\\') 636 errx(1, 637 "%lu: %s: transform pattern can not be delimited by newline or backslash", 638 linenum, fname); 639 p = compile_delimited(p, old); 640 if (p == NULL) 641 errx(1, "%lu: %s: unterminated transform source string", 642 linenum, fname); 643 p = compile_delimited(--p, new); 644 if (p == NULL) 645 errx(1, "%lu: %s: unterminated transform target string", 646 linenum, fname); 647 EATSPACE(); 648 op = old; 649 oldlen = mbsrtowcs(NULL, &op, 0, NULL); 650 if (oldlen == (size_t)-1) 651 err(1, NULL); 652 np = new; 653 newlen = mbsrtowcs(NULL, &np, 0, NULL); 654 if (newlen == (size_t)-1) 655 err(1, NULL); 656 if (newlen != oldlen) 657 errx(1, "%lu: %s: transform strings are not the same length", 658 linenum, fname); 659 if (MB_CUR_MAX == 1) { 660 /* 661 * The single-byte encoding case is easy: generate a 662 * lookup table. 663 */ 664 for (i = 0; i <= UCHAR_MAX; i++) 665 y->bytetab[i] = (char)i; 666 for (; *op; op++, np++) 667 y->bytetab[(u_char)*op] = *np; 668 } else { 669 /* 670 * Multi-byte encoding case: generate a lookup table as 671 * above, but only for single-byte characters. The first 672 * bytes of multi-byte characters have their lookup table 673 * entries set to 0, which causes do_tr() to search through 674 * an auxiliary vector of multi-byte mappings. 675 */ 676 memset(&mbs1, 0, sizeof(mbs1)); 677 memset(&mbs2, 0, sizeof(mbs2)); 678 for (i = 0; i <= UCHAR_MAX; i++) 679 y->bytetab[i] = (btowc(i) != WEOF) ? i : 0; 680 while (*op != '\0') { 681 oclen = mbrlen(op, MB_LEN_MAX, &mbs1); 682 if (oclen == (size_t)-1 || oclen == (size_t)-2) 683 errc(1, EILSEQ, NULL); 684 nclen = mbrlen(np, MB_LEN_MAX, &mbs2); 685 if (nclen == (size_t)-1 || nclen == (size_t)-2) 686 errc(1, EILSEQ, NULL); 687 if (oclen == 1 && nclen == 1) 688 y->bytetab[(u_char)*op] = *np; 689 else { 690 y->bytetab[(u_char)*op] = 0; 691 y->multis = realloc(y->multis, 692 (y->nmultis + 1) * sizeof(*y->multis)); 693 if (y->multis == NULL) 694 err(1, NULL); 695 i = y->nmultis++; 696 y->multis[i].fromlen = oclen; 697 memcpy(y->multis[i].from, op, oclen); 698 y->multis[i].tolen = nclen; 699 memcpy(y->multis[i].to, np, nclen); 700 } 701 op += oclen; 702 np += nclen; 703 } 704 } 705 return (p); 706 } 707 708 /* 709 * Compile the text following an a or i command. 710 */ 711 static char * 712 compile_text(void) 713 { 714 int asize, esc_nl, size; 715 char *text, *p, *op, *s; 716 char lbuf[_POSIX2_LINE_MAX + 1]; 717 718 asize = 2 * _POSIX2_LINE_MAX + 1; 719 if ((text = malloc(asize)) == NULL) 720 err(1, "malloc"); 721 size = 0; 722 while (cu_fgets(lbuf, sizeof(lbuf), NULL)) { 723 op = s = text + size; 724 p = lbuf; 725 EATSPACE(); 726 for (esc_nl = 0; *p != '\0'; p++) { 727 if (*p == '\\' && p[1] != '\0' && *++p == '\n') 728 esc_nl = 1; 729 *s++ = *p; 730 } 731 size += s - op; 732 if (!esc_nl) { 733 *s = '\0'; 734 break; 735 } 736 if (asize - size < _POSIX2_LINE_MAX + 1) { 737 asize *= 2; 738 if ((text = realloc(text, asize)) == NULL) 739 err(1, "realloc"); 740 } 741 } 742 text[size] = '\0'; 743 if ((p = realloc(text, size + 1)) == NULL) 744 err(1, "realloc"); 745 return (p); 746 } 747 748 /* 749 * Get an address and return a pointer to the first character after 750 * it. Fill the structure pointed to according to the address. 751 */ 752 static char * 753 compile_addr(char *p, struct s_addr *a) 754 { 755 char *end; 756 757 switch (*p) { 758 case '\\': /* Context address */ 759 ++p; 760 /* FALLTHROUGH */ 761 case '/': /* Context address */ 762 p = compile_re(p, &a->u.r); 763 if (p == NULL) 764 errx(1, "%lu: %s: unterminated regular expression", linenum, fname); 765 a->type = AT_RE; 766 return (p); 767 768 case '$': /* Last line */ 769 a->type = AT_LAST; 770 return (p + 1); 771 /* Line number */ 772 case '0': case '1': case '2': case '3': case '4': 773 case '5': case '6': case '7': case '8': case '9': 774 a->type = AT_LINE; 775 a->u.l = strtol(p, &end, 10); 776 return (end); 777 default: 778 errx(1, "%lu: %s: expected context address", linenum, fname); 779 return (NULL); 780 } 781 } 782 783 /* 784 * duptoeol -- 785 * Return a copy of all the characters up to \n or \0. 786 */ 787 static char * 788 duptoeol(char *s, const char *ctype) 789 { 790 size_t len; 791 int ws; 792 char *p, *start; 793 794 ws = 0; 795 for (start = s; *s != '\0' && *s != '\n'; ++s) 796 ws = isspace((unsigned char)*s); 797 *s = '\0'; 798 if (ws) 799 warnx("%lu: %s: whitespace after %s", linenum, fname, ctype); 800 len = s - start + 1; 801 if ((p = malloc(len)) == NULL) 802 err(1, "malloc"); 803 return (memmove(p, start, len)); 804 } 805 806 /* 807 * Convert goto label names to addresses, and count a and r commands, in 808 * the given subset of the script. Free the memory used by labels in b 809 * and t commands (but not by :). 810 * 811 * TODO: Remove } nodes 812 */ 813 static void 814 fixuplabel(struct s_command *cp, struct s_command *end) 815 { 816 817 for (; cp != end; cp = cp->next) 818 switch (cp->code) { 819 case 'a': 820 case 'r': 821 appendnum++; 822 break; 823 case 'b': 824 case 't': 825 /* Resolve branch target. */ 826 if (cp->t == NULL) { 827 cp->u.c = NULL; 828 break; 829 } 830 if ((cp->u.c = findlabel(cp->t)) == NULL) 831 errx(1, "%lu: %s: undefined label '%s'", linenum, fname, cp->t); 832 free(cp->t); 833 break; 834 case '{': 835 /* Do interior commands. */ 836 fixuplabel(cp->u.c, cp->next); 837 break; 838 } 839 } 840 841 /* 842 * Associate the given command label for later lookup. 843 */ 844 static void 845 enterlabel(struct s_command *cp) 846 { 847 struct labhash **lhp, *lh; 848 u_char *p; 849 u_int h, c; 850 851 for (h = 0, p = (u_char *)cp->t; (c = *p) != 0; p++) 852 h = (h << 5) + h + c; 853 lhp = &labels[h & LHMASK]; 854 for (lh = *lhp; lh != NULL; lh = lh->lh_next) 855 if (lh->lh_hash == h && strcmp(cp->t, lh->lh_cmd->t) == 0) 856 errx(1, "%lu: %s: duplicate label '%s'", linenum, fname, cp->t); 857 if ((lh = malloc(sizeof *lh)) == NULL) 858 err(1, "malloc"); 859 lh->lh_next = *lhp; 860 lh->lh_hash = h; 861 lh->lh_cmd = cp; 862 lh->lh_ref = 0; 863 *lhp = lh; 864 } 865 866 /* 867 * Find the label contained in the command l in the command linked 868 * list cp. L is excluded from the search. Return NULL if not found. 869 */ 870 static struct s_command * 871 findlabel(char *name) 872 { 873 struct labhash *lh; 874 u_char *p; 875 u_int h, c; 876 877 for (h = 0, p = (u_char *)name; (c = *p) != 0; p++) 878 h = (h << 5) + h + c; 879 for (lh = labels[h & LHMASK]; lh != NULL; lh = lh->lh_next) { 880 if (lh->lh_hash == h && strcmp(name, lh->lh_cmd->t) == 0) { 881 lh->lh_ref = 1; 882 return (lh->lh_cmd); 883 } 884 } 885 return (NULL); 886 } 887 888 /* 889 * Warn about any unused labels. As a side effect, release the label hash 890 * table space. 891 */ 892 static void 893 uselabel(void) 894 { 895 struct labhash *lh, *next; 896 int i; 897 898 for (i = 0; i < LHSZ; i++) { 899 for (lh = labels[i]; lh != NULL; lh = next) { 900 next = lh->lh_next; 901 if (!lh->lh_ref) 902 warnx("%lu: %s: unused label '%s'", 903 linenum, fname, lh->lh_cmd->t); 904 free(lh); 905 } 906 } 907 } 908