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
33 * @(#)compile.c 8.1 (Berkeley) 6/6/93
34 * $FreeBSD: src/usr.bin/sed/compile.c,v 1.34 2009/05/25 06:45:33 brian Exp $
35 * $DragonFly: src/usr.bin/sed/compile.c,v 1.4 2008/04/08 13:23:38 swildner Exp $
38 #include <sys/types.h>
56 #define LHMASK (LHSZ - 1)
57 static struct labhash {
58 struct labhash *lh_next;
60 struct s_command *lh_cmd;
64 static char *compile_addr(char *, struct s_addr *);
65 static char *compile_ccl(char **, char *);
66 static char *compile_delimited(char *, char *);
67 static char *compile_flags(char *, struct s_subst *);
68 static regex_t *compile_re(char *, int);
69 static char *compile_subst(char *, struct s_subst *);
70 static char *compile_text(void);
71 static char *compile_tr(char *, struct s_tr **);
72 static struct s_command
73 **compile_stream(struct s_command **);
74 static char *duptoeol(char *, const char *);
75 static void enterlabel(struct s_command *);
76 static struct s_command
78 static void fixuplabel(struct s_command *, struct s_command *);
79 static void uselabel(void);
82 * Command specification. This is used to drive the command parser.
85 char code; /* Command code */
86 int naddr; /* Number of address args */
87 enum e_args args; /* Argument type */
90 static struct s_format cmd_fmts[] = {
122 /* The compiled program. */
123 struct s_command *prog;
126 * Compile the program into prog.
127 * Initialise appends.
132 *compile_stream(&prog) = NULL;
133 fixuplabel(prog, NULL);
137 else if ((appends = malloc(sizeof(struct s_appends) * appendnum)) ==
140 if ((match = malloc((maxnsub + 1) * sizeof(regmatch_t))) == NULL)
144 #define EATSPACE() do { \
146 while (*p && isspace((unsigned char)*p)) \
150 static struct s_command **
151 compile_stream(struct s_command **link)
154 static char lbuf[_POSIX2_LINE_MAX + 1]; /* To save stack */
155 struct s_command *cmd, *cmd2, *stack;
157 char re[_POSIX2_LINE_MAX + 1];
158 int naddr; /* Number of addresses */
162 if ((p = cu_fgets(lbuf, sizeof(lbuf), NULL)) == NULL) {
164 errx(1, "%lu: %s: unexpected EOF (pending }'s)",
169 semicolon: EATSPACE();
171 if (*p == '#' || *p == '\0')
173 else if (*p == ';') {
178 if ((*link = cmd = malloc(sizeof(struct s_command))) == NULL)
181 cmd->startline = cmd->nonsel = 0;
182 /* First parse the addresses */
185 /* Valid characters to start an address */
186 #define addrchar(c) (strchr("0123456789/\\$", (c)))
189 if ((cmd->a1 = malloc(sizeof(struct s_addr))) == NULL)
191 p = compile_addr(p, cmd->a1);
192 EATSPACE(); /* EXTENSION */
195 EATSPACE(); /* EXTENSION */
197 if ((cmd->a2 = malloc(sizeof(struct s_addr)))
200 p = compile_addr(p, cmd->a2);
205 cmd->a1 = cmd->a2 = 0;
207 nonsel: /* Now parse the command */
209 errx(1, "%lu: %s: command expected", linenum, fname);
211 for (fp = cmd_fmts; fp->code; fp++)
215 errx(1, "%lu: %s: invalid command code %c", linenum, fname, *p);
216 if (naddr > fp->naddr)
218 "%lu: %s: command %c expects up to %d address(es), found %d",
219 linenum, fname, *p, fp->naddr, naddr);
237 * Short-circuit command processing, since end of
238 * group is really just a noop.
242 errx(1, "%lu: %s: unexpected }", linenum, fname);
247 case EMPTY: /* d D g G h H l n N p P q x = \0 */
256 errx(1, "%lu: %s: extra characters at the end of %c command",
257 linenum, fname, cmd->code);
259 case TEXT: /* a c i */
264 "%lu: %s: command %c expects \\ followed by text", linenum, fname, cmd->code);
269 "%lu: %s: extra characters after \\ at the end of %c command",
270 linenum, fname, cmd->code);
271 cmd->t = compile_text();
273 case COMMENT: /* \0 # */
279 errx(1, "%lu: %s: filename expected", linenum, fname);
280 cmd->t = duptoeol(p, "w command");
283 else if ((cmd->u.fd = open(p,
284 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
292 errx(1, "%lu: %s: filename expected", linenum, fname);
294 cmd->t = duptoeol(p, "read command");
296 case BRANCH: /* b t */
302 cmd->t = duptoeol(p, "branch");
307 cmd->t = duptoeol(p, "label");
309 errx(1, "%lu: %s: empty label", linenum, fname);
314 if (*p == '\0' || *p == '\\')
316 "%lu: %s: substitute pattern can not be delimited by newline or backslash",
318 if ((cmd->u.s = calloc(1, sizeof(struct s_subst))) == NULL)
320 p = compile_delimited(p, re);
323 "%lu: %s: unterminated substitute pattern", linenum, fname);
325 /* Compile RE with no case sensitivity temporarily */
329 cmd->u.s->re = compile_re(re, 0);
331 p = compile_subst(p, cmd->u.s);
332 p = compile_flags(p, cmd->u.s);
334 /* Recompile RE with case sensitivity from "I" flag if any */
338 cmd->u.s->re = compile_re(re, cmd->u.s->icase);
348 p = compile_tr(p, &cmd->u.y);
357 "%lu: %s: extra text at the end of a transform command", linenum, fname);
364 * Get a delimited string. P points to the delimeter of the string; d points
365 * to a buffer area. Newline and delimiter escapes are processed; other
366 * escapes are ignored.
368 * Returns a pointer to the first character after the final delimiter or NULL
369 * in the case of a non-terminated string. The character array d is filled
370 * with the processed string.
373 compile_delimited(char *p, char *d)
381 errx(1, "%lu: %s: \\ can not be used as a string delimiter",
384 errx(1, "%lu: %s: newline can not be used as a string delimiter",
388 if ((d = compile_ccl(&p, d)) == NULL)
389 errx(1, "%lu: %s: unbalanced brackets ([])", linenum, fname);
391 } else if (*p == '\\' && p[1] == '[') {
393 } else if (*p == '\\' && p[1] == c)
395 else if (*p == '\\' && p[1] == 'n') {
399 } else if (*p == '\\' && p[1] == '\\')
411 /* compile_ccl: expand a POSIX character class */
413 compile_ccl(char **sp, char *t)
423 for (; *s && (*t = *s) != ']'; s++, t++)
424 if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '=')) {
425 *++t = *++s, t++, s++;
426 for (c = *s; (*t = *s) != ']' || c != d; s++, t++)
427 if ((c = *s) == '\0')
429 } else if (*s == '\\' && s[1] == 'n')
431 return (*s == ']') ? *sp = ++s, ++t : NULL;
435 * Compiles the regular expression in RE and returns a pointer to the compiled
436 * regular expression.
437 * Cflags are passed to regcomp.
440 compile_re(char *re, int case_insensitive)
447 if (case_insensitive)
449 if ((rep = malloc(sizeof(regex_t))) == NULL)
451 if ((eval = regcomp(rep, re, flags)) != 0)
452 errx(1, "%lu: %s: RE error: %s",
453 linenum, fname, strregerror(eval, rep));
454 if (maxnsub < rep->re_nsub)
455 maxnsub = rep->re_nsub;
460 * Compile the substitution string of a regular expression and set res to
461 * point to a saved copy of it. Nsub is the number of parenthesized regular
465 compile_subst(char *p, struct s_subst *s)
467 static char lbuf[_POSIX2_LINE_MAX + 1];
470 char c, *text, *op, *sp;
471 int more = 1, sawesc = 0;
473 c = *p++; /* Terminator character */
478 s->linenum = linenum;
479 asize = 2 * _POSIX2_LINE_MAX + 1;
480 if ((text = malloc(asize)) == NULL)
484 op = sp = text + size;
486 if (*p == '\\' || sawesc) {
488 * If this is a continuation from the last
489 * buffer, we won't have a character to
499 * This escaped character is continued
500 * in the next part of the line. Note
501 * this fact, then cause the loop to
502 * exit w/ normal EOL case and reenter
503 * above with the new buffer.
508 } else if (strchr("123456789", *p) != NULL) {
512 ref > s->re->re_nsub)
513 errx(1, "%lu: %s: \\%c not defined in the RE",
515 if (s->maxbref < ref)
517 } else if (*p == '&' || *p == '\\')
519 } else if (*p == c) {
520 if (*++p == '\0' && more) {
521 if (cu_fgets(lbuf, sizeof(lbuf), &more))
526 if ((s->new = realloc(text, size)) == NULL)
529 } else if (*p == '\n') {
531 "%lu: %s: unescaped newline inside substitute pattern", linenum, fname);
537 if (asize - size < _POSIX2_LINE_MAX + 1) {
539 if ((text = realloc(text, asize)) == NULL)
542 } while (cu_fgets(p = lbuf, sizeof(lbuf), &more));
543 errx(1, "%lu: %s: unterminated substitute in regular expression",
549 * Compile the flags of the s command
552 compile_flags(char *p, struct s_subst *s)
554 int gn; /* True if we have seen g or n */
556 char wfile[_POSIX2_LINE_MAX + 1], *q;
558 s->n = 1; /* Default */
564 EATSPACE(); /* EXTENSION */
569 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname);
583 case '1': case '2': case '3':
584 case '4': case '5': case '6':
585 case '7': case '8': case '9':
588 "%lu: %s: more than one number or 'g' in substitute flags", linenum, fname);
591 nval = strtol(p, &p, 10);
592 if (errno == ERANGE || nval > INT_MAX)
594 "%lu: %s: overflow in the 'N' substitute flag", linenum, fname);
600 #ifdef HISTORIC_PRACTICE
602 warnx("%lu: %s: space missing before w wfile", linenum, fname);
615 errx(1, "%lu: %s: no wfile specified", linenum, fname);
616 s->wfile = strdup(wfile);
617 if (!aflag && (s->wfd = open(wfile,
618 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
623 errx(1, "%lu: %s: bad flag in substitute command: '%c'",
632 * Compile a translation set of strings into a lookup table.
635 compile_tr(char *p, struct s_tr **py)
640 char old[_POSIX2_LINE_MAX + 1];
641 char new[_POSIX2_LINE_MAX + 1];
642 size_t oclen, oldlen, nclen, newlen;
643 mbstate_t mbs1, mbs2;
645 if ((*py = y = malloc(sizeof(*y))) == NULL)
650 if (*p == '\0' || *p == '\\')
652 "%lu: %s: transform pattern can not be delimited by newline or backslash",
654 p = compile_delimited(p, old);
656 errx(1, "%lu: %s: unterminated transform source string",
658 p = compile_delimited(p - 1, new);
660 errx(1, "%lu: %s: unterminated transform target string",
664 oldlen = mbsrtowcs(NULL, &op, 0, NULL);
665 if (oldlen == (size_t)-1)
668 newlen = mbsrtowcs(NULL, &np, 0, NULL);
669 if (newlen == (size_t)-1)
671 if (newlen != oldlen)
672 errx(1, "%lu: %s: transform strings are not the same length",
674 if (MB_CUR_MAX == 1) {
676 * The single-byte encoding case is easy: generate a
679 for (i = 0; i <= UCHAR_MAX; i++)
680 y->bytetab[i] = (char)i;
681 for (; *op; op++, np++)
682 y->bytetab[(u_char)*op] = *np;
685 * Multi-byte encoding case: generate a lookup table as
686 * above, but only for single-byte characters. The first
687 * bytes of multi-byte characters have their lookup table
688 * entries set to 0, which causes do_tr() to search through
689 * an auxiliary vector of multi-byte mappings.
691 memset(&mbs1, 0, sizeof(mbs1));
692 memset(&mbs2, 0, sizeof(mbs2));
693 for (i = 0; i <= UCHAR_MAX; i++)
694 y->bytetab[i] = (btowc(i) != WEOF) ? i : 0;
695 while (*op != '\0') {
696 oclen = mbrlen(op, MB_LEN_MAX, &mbs1);
697 if (oclen == (size_t)-1 || oclen == (size_t)-2)
698 errc(1, EILSEQ, NULL);
699 nclen = mbrlen(np, MB_LEN_MAX, &mbs2);
700 if (nclen == (size_t)-1 || nclen == (size_t)-2)
701 errc(1, EILSEQ, NULL);
702 if (oclen == 1 && nclen == 1)
703 y->bytetab[(u_char)*op] = *np;
705 y->bytetab[(u_char)*op] = 0;
706 y->multis = realloc(y->multis,
707 (y->nmultis + 1) * sizeof(*y->multis));
708 if (y->multis == NULL)
711 y->multis[i].fromlen = oclen;
712 memcpy(y->multis[i].from, op, oclen);
713 y->multis[i].tolen = nclen;
714 memcpy(y->multis[i].to, np, nclen);
724 * Compile the text following an a or i command.
729 int asize, esc_nl, size;
730 char *text, *p, *op, *s;
731 char lbuf[_POSIX2_LINE_MAX + 1];
733 asize = 2 * _POSIX2_LINE_MAX + 1;
734 if ((text = malloc(asize)) == NULL)
737 while (cu_fgets(lbuf, sizeof(lbuf), NULL)) {
738 op = s = text + size;
741 for (esc_nl = 0; *p != '\0'; p++) {
742 if (*p == '\\' && p[1] != '\0' && *++p == '\n')
751 if (asize - size < _POSIX2_LINE_MAX + 1) {
753 if ((text = realloc(text, asize)) == NULL)
758 if ((p = realloc(text, size + 1)) == NULL)
764 * Get an address and return a pointer to the first character after
765 * it. Fill the structure pointed to according to the address.
768 compile_addr(char *p, struct s_addr *a)
770 char *end, re[_POSIX2_LINE_MAX + 1];
777 case '\\': /* Context address */
780 case '/': /* Context address */
781 p = compile_delimited(p, re);
783 errx(1, "%lu: %s: unterminated regular expression", linenum, fname);
784 /* Check for case insensitive regexp flag */
792 a->u.r = compile_re(re, icase);
796 case '$': /* Last line */
800 case '+': /* Relative line number */
801 a->type = AT_RELLINE;
805 case '0': case '1': case '2': case '3': case '4':
806 case '5': case '6': case '7': case '8': case '9':
809 a->u.l = strtol(p, &end, 10);
812 errx(1, "%lu: %s: expected context address", linenum, fname);
819 * Return a copy of all the characters up to \n or \0.
822 duptoeol(char *s, const char *ctype)
829 for (start = s; *s != '\0' && *s != '\n'; ++s)
830 ws = isspace((unsigned char)*s);
833 warnx("%lu: %s: whitespace after %s", linenum, fname, ctype);
835 if ((p = malloc(len)) == NULL)
837 return (memmove(p, start, len));
841 * Convert goto label names to addresses, and count a and r commands, in
842 * the given subset of the script. Free the memory used by labels in b
843 * and t commands (but not by :).
845 * TODO: Remove } nodes
848 fixuplabel(struct s_command *cp, struct s_command *end)
851 for (; cp != end; cp = cp->next)
859 /* Resolve branch target. */
864 if ((cp->u.c = findlabel(cp->t)) == NULL)
865 errx(1, "%lu: %s: undefined label '%s'", linenum, fname, cp->t);
869 /* Do interior commands. */
870 fixuplabel(cp->u.c, cp->next);
876 * Associate the given command label for later lookup.
879 enterlabel(struct s_command *cp)
881 struct labhash **lhp, *lh;
885 for (h = 0, p = (u_char *)cp->t; (c = *p) != 0; p++)
886 h = (h << 5) + h + c;
887 lhp = &labels[h & LHMASK];
888 for (lh = *lhp; lh != NULL; lh = lh->lh_next)
889 if (lh->lh_hash == h && strcmp(cp->t, lh->lh_cmd->t) == 0)
890 errx(1, "%lu: %s: duplicate label '%s'", linenum, fname, cp->t);
891 if ((lh = malloc(sizeof *lh)) == NULL)
901 * Find the label contained in the command l in the command linked
902 * list cp. L is excluded from the search. Return NULL if not found.
904 static struct s_command *
905 findlabel(char *name)
911 for (h = 0, p = (u_char *)name; (c = *p) != 0; p++)
912 h = (h << 5) + h + c;
913 for (lh = labels[h & LHMASK]; lh != NULL; lh = lh->lh_next) {
914 if (lh->lh_hash == h && strcmp(name, lh->lh_cmd->t) == 0) {
923 * Warn about any unused labels. As a side effect, release the label hash
929 struct labhash *lh, *next;
932 for (i = 0; i < LHSZ; i++) {
933 for (lh = labels[i]; lh != NULL; lh = next) {
936 warnx("%lu: %s: unused label '%s'",
937 linenum, fname, lh->lh_cmd->t);