2 * Copyright (c) 1992 Diomidis Spinellis.
3 * Copyright (c) 1992, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * Diomidis Spinellis of Imperial College, University of London.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
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.
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
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
38 static const char sccsid[] = "@(#)compile.c 8.1 (Berkeley) 6/6/93";
41 #include <sys/types.h>
59 #define LHMASK (LHSZ - 1)
60 static struct labhash {
61 struct labhash *lh_next;
63 struct s_command *lh_cmd;
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 regex_t *compile_re(char *, int);
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
81 static void fixuplabel(struct s_command *, struct s_command *);
82 static void uselabel(void);
85 * Command specification. This is used to drive the command parser.
88 char code; /* Command code */
89 int naddr; /* Number of address args */
90 enum e_args args; /* Argument type */
93 static struct s_format cmd_fmts[] = {
125 /* The compiled program. */
126 struct s_command *prog;
129 * Compile the program into prog.
130 * Initialise appends.
135 *compile_stream(&prog) = NULL;
136 fixuplabel(prog, NULL);
140 else if ((appends = malloc(sizeof(struct s_appends) * appendnum)) ==
143 if ((match = malloc((maxnsub + 1) * sizeof(regmatch_t))) == NULL)
147 #define EATSPACE() do { \
149 while (*p && isspace((unsigned char)*p)) \
153 static struct s_command **
154 compile_stream(struct s_command **link)
157 static char lbuf[_POSIX2_LINE_MAX + 1]; /* To save stack */
158 struct s_command *cmd, *cmd2, *stack;
160 char re[_POSIX2_LINE_MAX + 1];
161 int naddr; /* Number of addresses */
165 if ((p = cu_fgets(lbuf, sizeof(lbuf), NULL)) == NULL) {
167 errx(1, "%lu: %s: unexpected EOF (pending }'s)",
172 semicolon: EATSPACE();
174 if (*p == '#' || *p == '\0')
176 else if (*p == ';') {
181 if ((*link = cmd = malloc(sizeof(struct s_command))) == NULL)
184 cmd->nonsel = cmd->inrange = 0;
185 /* First parse the addresses */
188 /* Valid characters to start an address */
189 #define addrchar(c) (strchr("0123456789/\\$", (c)))
192 if ((cmd->a1 = malloc(sizeof(struct s_addr))) == NULL)
194 p = compile_addr(p, cmd->a1);
195 EATSPACE(); /* EXTENSION */
198 EATSPACE(); /* EXTENSION */
200 if ((cmd->a2 = malloc(sizeof(struct s_addr)))
203 p = compile_addr(p, cmd->a2);
208 cmd->a1 = cmd->a2 = 0;
210 nonsel: /* Now parse the command */
212 errx(1, "%lu: %s: command expected", linenum, fname);
214 for (fp = cmd_fmts; fp->code; fp++)
218 errx(1, "%lu: %s: invalid command code %c", linenum, fname, *p);
219 if (naddr > fp->naddr)
221 "%lu: %s: command %c expects up to %d address(es), found %d",
222 linenum, fname, *p, fp->naddr, naddr);
227 cmd->nonsel = ! cmd->nonsel;
240 * Short-circuit command processing, since end of
241 * group is really just a noop.
245 errx(1, "%lu: %s: unexpected }", linenum, fname);
250 case EMPTY: /* d D g G h H l n N p P q x = \0 */
259 errx(1, "%lu: %s: extra characters at the end of %c command",
260 linenum, fname, cmd->code);
262 case TEXT: /* a c i */
267 "%lu: %s: command %c expects \\ followed by text", linenum, fname, cmd->code);
272 "%lu: %s: extra characters after \\ at the end of %c command",
273 linenum, fname, cmd->code);
274 cmd->t = compile_text();
276 case COMMENT: /* \0 # */
282 errx(1, "%lu: %s: filename expected", linenum, fname);
283 cmd->t = duptoeol(p, "w command");
286 else if ((cmd->u.fd = open(p,
287 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
295 errx(1, "%lu: %s: filename expected", linenum, fname);
297 cmd->t = duptoeol(p, "read command");
299 case BRANCH: /* b t */
305 cmd->t = duptoeol(p, "branch");
310 cmd->t = duptoeol(p, "label");
312 errx(1, "%lu: %s: empty label", linenum, fname);
317 if (*p == '\0' || *p == '\\')
319 "%lu: %s: substitute pattern can not be delimited by newline or backslash",
321 if ((cmd->u.s = calloc(1, sizeof(struct s_subst))) == NULL)
323 p = compile_delimited(p, re);
326 "%lu: %s: unterminated substitute pattern", linenum, fname);
328 p = compile_subst(p, cmd->u.s);
329 p = compile_flags(p, cmd->u.s);
333 cmd->u.s->re = compile_re(re, cmd->u.s->icase);
343 p = compile_tr(p, &cmd->u.y);
352 "%lu: %s: extra text at the end of a transform command", linenum, fname);
359 * Get a delimited string. P points to the delimeter of the string; d points
360 * to a buffer area. Newline and delimiter escapes are processed; other
361 * escapes are ignored.
363 * Returns a pointer to the first character after the final delimiter or NULL
364 * in the case of a non-terminated string. The character array d is filled
365 * with the processed string.
368 compile_delimited(char *p, char *d)
376 errx(1, "%lu: %s: \\ can not be used as a string delimiter",
379 errx(1, "%lu: %s: newline can not be used as a string delimiter",
383 if ((d = compile_ccl(&p, d)) == NULL)
384 errx(1, "%lu: %s: unbalanced brackets ([])", linenum, fname);
386 } else if (*p == '\\' && p[1] == '[') {
388 } else if (*p == '\\' && p[1] == c)
390 else if (*p == '\\' && p[1] == 'n') {
394 } else if (*p == '\\' && p[1] == '\\')
406 /* compile_ccl: expand a POSIX character class */
408 compile_ccl(char **sp, char *t)
418 for (; *s && (*t = *s) != ']'; s++, t++)
419 if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '=')) {
420 *++t = *++s, t++, s++;
421 for (c = *s; (*t = *s) != ']' || c != d; s++, t++)
422 if ((c = *s) == '\0')
424 } else if (*s == '\\' && s[1] == 'n')
426 return (*s == ']') ? *sp = ++s, ++t : NULL;
430 * Compiles the regular expression in RE and returns a pointer to the compiled
431 * regular expression.
432 * Cflags are passed to regcomp.
435 compile_re(char *re, int case_insensitive)
442 if (case_insensitive)
444 if ((rep = malloc(sizeof(regex_t))) == NULL)
446 if ((eval = regcomp(rep, re, flags)) != 0)
447 errx(1, "%lu: %s: RE error: %s",
448 linenum, fname, strregerror(eval, rep));
449 if (maxnsub < rep->re_nsub)
450 maxnsub = rep->re_nsub;
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
460 compile_subst(char *p, struct s_subst *s)
462 static char lbuf[_POSIX2_LINE_MAX + 1];
465 char c, *text, *op, *sp;
466 int more = 1, sawesc = 0;
468 c = *p++; /* Terminator character */
473 s->linenum = linenum;
474 asize = 2 * _POSIX2_LINE_MAX + 1;
475 if ((text = malloc(asize)) == NULL)
479 op = sp = text + size;
481 if (*p == '\\' || sawesc) {
483 * If this is a continuation from the last
484 * buffer, we won't have a character to
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.
503 } else if (strchr("123456789", *p) != NULL) {
507 ref > s->re->re_nsub)
508 errx(1, "%lu: %s: \\%c not defined in the RE",
510 if (s->maxbref < ref)
512 } else if (*p == '&' || *p == '\\')
514 } else if (*p == c) {
515 if (*++p == '\0' && more) {
516 if (cu_fgets(lbuf, sizeof(lbuf), &more))
521 if ((s->new = realloc(text, size)) == NULL)
524 } else if (*p == '\n') {
526 "%lu: %s: unescaped newline inside substitute pattern", linenum, fname);
532 if (asize - size < _POSIX2_LINE_MAX + 1) {
534 if ((text = realloc(text, asize)) == NULL)
537 } while (cu_fgets(p = lbuf, sizeof(lbuf), &more));
538 errx(1, "%lu: %s: unterminated substitute in regular expression",
544 * Compile the flags of the s command
547 compile_flags(char *p, struct s_subst *s)
549 int gn; /* True if we have seen g or n */
551 char wfile[_POSIX2_LINE_MAX + 1], *q;
553 s->n = 1; /* Default */
559 EATSPACE(); /* EXTENSION */
564 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname);
578 case '1': case '2': case '3':
579 case '4': case '5': case '6':
580 case '7': case '8': case '9':
583 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname);
586 nval = strtol(p, &p, 10);
587 if (errno == ERANGE || nval > INT_MAX)
589 "%lu: %s: overflow in the 'N' substitute flag", linenum, fname);
595 #ifdef HISTORIC_PRACTICE
597 warnx("%lu: %s: space missing before w wfile", linenum, fname);
610 errx(1, "%lu: %s: no wfile specified", linenum, fname);
611 s->wfile = strdup(wfile);
612 if (!aflag && (s->wfd = open(wfile,
613 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
618 errx(1, "%lu: %s: bad flag in substitute command: '%c'",
627 * Compile a translation set of strings into a lookup table.
630 compile_tr(char *p, struct s_tr **py)
635 char old[_POSIX2_LINE_MAX + 1];
636 char new[_POSIX2_LINE_MAX + 1];
637 size_t oclen, oldlen, nclen, newlen;
638 mbstate_t mbs1, mbs2;
640 if ((*py = y = malloc(sizeof(*y))) == NULL)
645 if (*p == '\0' || *p == '\\')
647 "%lu: %s: transform pattern can not be delimited by newline or backslash",
649 p = compile_delimited(p, old);
651 errx(1, "%lu: %s: unterminated transform source string",
653 p = compile_delimited(p - 1, new);
655 errx(1, "%lu: %s: unterminated transform target string",
659 oldlen = mbsrtowcs(NULL, &op, 0, NULL);
660 if (oldlen == (size_t)-1)
663 newlen = mbsrtowcs(NULL, &np, 0, NULL);
664 if (newlen == (size_t)-1)
666 if (newlen != oldlen)
667 errx(1, "%lu: %s: transform strings are not the same length",
669 if (MB_CUR_MAX == 1) {
671 * The single-byte encoding case is easy: generate a
674 for (i = 0; i <= UCHAR_MAX; i++)
675 y->bytetab[i] = (char)i;
676 for (; *op; op++, np++)
677 y->bytetab[(u_char)*op] = *np;
680 * Multi-byte encoding case: generate a lookup table as
681 * above, but only for single-byte characters. The first
682 * bytes of multi-byte characters have their lookup table
683 * entries set to 0, which causes do_tr() to search through
684 * an auxiliary vector of multi-byte mappings.
686 memset(&mbs1, 0, sizeof(mbs1));
687 memset(&mbs2, 0, sizeof(mbs2));
688 for (i = 0; i <= UCHAR_MAX; i++)
689 y->bytetab[i] = (btowc(i) != WEOF) ? i : 0;
690 while (*op != '\0') {
691 oclen = mbrlen(op, MB_LEN_MAX, &mbs1);
692 if (oclen == (size_t)-1 || oclen == (size_t)-2)
693 errc(1, EILSEQ, NULL);
694 nclen = mbrlen(np, MB_LEN_MAX, &mbs2);
695 if (nclen == (size_t)-1 || nclen == (size_t)-2)
696 errc(1, EILSEQ, NULL);
697 if (oclen == 1 && nclen == 1)
698 y->bytetab[(u_char)*op] = *np;
700 y->bytetab[(u_char)*op] = 0;
701 y->multis = realloc(y->multis,
702 (y->nmultis + 1) * sizeof(*y->multis));
703 if (y->multis == NULL)
706 y->multis[i].fromlen = oclen;
707 memcpy(y->multis[i].from, op, oclen);
708 y->multis[i].tolen = nclen;
709 memcpy(y->multis[i].to, np, nclen);
719 * Compile the text following an a or i command.
724 int asize, esc_nl, size;
725 char *text, *p, *op, *s;
726 char lbuf[_POSIX2_LINE_MAX + 1];
728 asize = 2 * _POSIX2_LINE_MAX + 1;
729 if ((text = malloc(asize)) == NULL)
732 while (cu_fgets(lbuf, sizeof(lbuf), NULL)) {
733 op = s = text + size;
736 for (esc_nl = 0; *p != '\0'; p++) {
737 if (*p == '\\' && p[1] != '\0' && *++p == '\n')
746 if (asize - size < _POSIX2_LINE_MAX + 1) {
748 if ((text = realloc(text, asize)) == NULL)
753 if ((p = realloc(text, size + 1)) == NULL)
759 * Get an address and return a pointer to the first character after
760 * it. Fill the structure pointed to according to the address.
763 compile_addr(char *p, struct s_addr *a)
765 char *end, re[_POSIX2_LINE_MAX + 1];
771 case '\\': /* Context address */
774 case '/': /* Context address */
775 p = compile_delimited(p, re);
777 errx(1, "%lu: %s: unterminated regular expression", linenum, fname);
778 /* Check for case insensitive regexp flag */
786 a->u.r = compile_re(re, icase);
790 case '$': /* Last line */
794 case '0': case '1': case '2': case '3': case '4':
795 case '5': case '6': case '7': case '8': case '9':
797 a->u.l = strtol(p, &end, 10);
800 errx(1, "%lu: %s: expected context address", linenum, fname);
807 * Return a copy of all the characters up to \n or \0.
810 duptoeol(char *s, const char *ctype)
817 for (start = s; *s != '\0' && *s != '\n'; ++s)
818 ws = isspace((unsigned char)*s);
821 warnx("%lu: %s: whitespace after %s", linenum, fname, ctype);
823 if ((p = malloc(len)) == NULL)
825 return (memmove(p, start, len));
829 * Convert goto label names to addresses, and count a and r commands, in
830 * the given subset of the script. Free the memory used by labels in b
831 * and t commands (but not by :).
833 * TODO: Remove } nodes
836 fixuplabel(struct s_command *cp, struct s_command *end)
839 for (; cp != end; cp = cp->next)
847 /* Resolve branch target. */
852 if ((cp->u.c = findlabel(cp->t)) == NULL)
853 errx(1, "%lu: %s: undefined label '%s'", linenum, fname, cp->t);
857 /* Do interior commands. */
858 fixuplabel(cp->u.c, cp->next);
864 * Associate the given command label for later lookup.
867 enterlabel(struct s_command *cp)
869 struct labhash **lhp, *lh;
873 for (h = 0, p = (u_char *)cp->t; (c = *p) != 0; p++)
874 h = (h << 5) + h + c;
875 lhp = &labels[h & LHMASK];
876 for (lh = *lhp; lh != NULL; lh = lh->lh_next)
877 if (lh->lh_hash == h && strcmp(cp->t, lh->lh_cmd->t) == 0)
878 errx(1, "%lu: %s: duplicate label '%s'", linenum, fname, cp->t);
879 if ((lh = malloc(sizeof *lh)) == NULL)
889 * Find the label contained in the command l in the command linked
890 * list cp. L is excluded from the search. Return NULL if not found.
892 static struct s_command *
893 findlabel(char *name)
899 for (h = 0, p = (u_char *)name; (c = *p) != 0; p++)
900 h = (h << 5) + h + c;
901 for (lh = labels[h & LHMASK]; lh != NULL; lh = lh->lh_next) {
902 if (lh->lh_hash == h && strcmp(name, lh->lh_cmd->t) == 0) {
911 * Warn about any unused labels. As a side effect, release the label hash
917 struct labhash *lh, *next;
920 for (i = 0; i < LHSZ; i++) {
921 for (lh = labels[i]; lh != NULL; lh = next) {
924 warnx("%lu: %s: unused label '%s'",
925 linenum, fname, lh->lh_cmd->t);