2 * Copyright (c) 1992 Diomidis Spinellis.
3 * Copyright (c) 1992, 1993, 1994
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[] = "@(#)process.c 8.6 (Berkeley) 4/20/94";
41 #include <sys/types.h>
43 #include <sys/ioctl.h>
62 static SPACE HS, PS, SS, YS;
69 static __inline int applies(struct s_command *);
70 static void do_tr(struct s_tr *);
71 static void flush_appends(void);
72 static void lputs(char *, size_t);
73 static __inline int regexec_e(regex_t *, const char *, int, int, size_t);
74 static void regsub(SPACE *, char *, char *);
75 static int substitute(struct s_command *);
77 struct s_appends *appends; /* Array of pointers to strings to append. */
78 static int appendx; /* Index into appends array. */
79 int appendnum; /* Size of appends array. */
81 static int lastaddr; /* Set by applies if last address of a range. */
82 static int sdone; /* If any substitutes since last line input. */
83 /* Iov structure for 'w' commands. */
84 static regex_t *defpreg;
88 #define OUT(s) { fwrite(s, sizeof(u_char), psl, outfile); fputc('\n', outfile); }
100 for (linenum = 0; mf_fgets(&PS, REPLACE);) {
115 if (appendx >= appendnum)
116 if ((appends = realloc(appends,
117 sizeof(struct s_appends) *
118 (appendnum *= 2))) == NULL)
120 appends[appendx].type = AP_STRING;
121 appends[appendx].s = cp->t;
122 appends[appendx].len = strlen(cp->t);
131 if (cp->a2 == NULL || lastaddr || lastline())
132 (void)fprintf(outfile, "%s", cp->t);
141 (p = memchr(ps, '\n', psl)) == NULL) {
146 memmove(ps, p + 1, psl);
150 cspace(&PS, hs, hsl, REPLACE);
153 cspace(&PS, "\n", 1, 0);
154 cspace(&PS, hs, hsl, 0);
157 cspace(&HS, ps, psl, REPLACE);
160 cspace(&HS, "\n", 1, 0);
161 cspace(&HS, ps, psl, 0);
164 (void)fprintf(outfile, "%s", cp->t);
173 if (!mf_fgets(&PS, REPLACE))
179 cspace(&PS, "\n", 1, 0);
180 if (!mf_fgets(&PS, 0))
191 if ((p = memchr(ps, '\n', psl)) != NULL) {
205 if (appendx >= appendnum)
206 if ((appends = realloc(appends,
207 sizeof(struct s_appends) *
208 (appendnum *= 2))) == NULL)
210 appends[appendx].type = AP_FILE;
211 appends[appendx].s = cp->t;
212 appends[appendx].len = strlen(cp->t);
216 sdone |= substitute(cp);
228 if (cp->u.fd == -1 && (cp->u.fd = open(cp->t,
229 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
232 if (write(cp->u.fd, ps, psl) != psl ||
233 write(cp->u.fd, "\n", 1) != 1)
238 cspace(&HS, "", 0, REPLACE);
252 (void)fprintf(outfile, "%lu\n", linenum);
257 new: if (!nflag && !pd)
260 } /* for all lines */
264 * TRUE if the address passed matches the current program state
265 * (lastline, linenumber, ps).
268 ((a)->type == AT_RE ? regexec_e((a)->u.r, ps, 0, 1, psl) : \
269 (a)->type == AT_LINE ? linenum == (a)->u.l : lastline())
272 * Return TRUE if the command applies to the current line. Sets the inrange
273 * flag to process ranges. Interprets the non-select (``!'') flag.
276 applies(struct s_command *cp)
281 if (cp->a1 == NULL && cp->a2 == NULL)
289 } else if (cp->a2->type == AT_LINE &&
290 linenum > cp->a2->u.l) {
292 * We missed the 2nd address due to a branch,
293 * so just close the range and return false.
299 } else if (MATCH(cp->a1)) {
301 * If the second address is a number less than or
302 * equal to the line number first selected, only
303 * one line shall be selected.
306 if (cp->a2->type == AT_LINE &&
307 linenum >= cp->a2->u.l)
316 return (cp->nonsel ? ! r : r);
321 * Do substitutions in the pattern space. Currently, we build a
322 * copy of the new pattern space in the substitute space structure
323 * and then swap them.
326 substitute(struct s_command *cp)
330 regoff_t re_off, slen;
337 if (defpreg != NULL && cp->u.s->maxbref > defpreg->re_nsub) {
338 linenum = cp->u.s->linenum;
339 errx(1, "%lu: %s: \\%d not defined in the RE",
340 linenum, fname, cp->u.s->maxbref);
343 if (!regexec_e(re, s, 0, 0, psl))
346 SS.len = 0; /* Clean substitute space. */
354 if (lastempty || match[0].rm_so != match[0].rm_eo) {
355 /* Locate start of replaced string. */
356 re_off = match[0].rm_so;
357 /* Copy leading retained string. */
358 cspace(&SS, s, re_off, APPEND);
359 /* Add in regular expression. */
360 regsub(&SS, s, cp->u.s->new);
363 /* Move past this match. */
364 if (match[0].rm_so != match[0].rm_eo) {
366 slen -= match[0].rm_eo;
369 if (match[0].rm_so < slen)
370 cspace(&SS, s + match[0].rm_so, 1,
372 s += match[0].rm_so + 1;
373 slen -= match[0].rm_so + 1;
376 } while (slen >= 0 && regexec_e(re, s, REG_NOTBOL, 0, slen));
377 /* Copy trailing retained string. */
379 cspace(&SS, s, slen, APPEND);
381 default: /* Nth occurrence */
383 if (match[0].rm_eo == match[0].rm_so)
384 match[0].rm_eo = match[0].rm_so + 1;
386 slen -= match[0].rm_eo;
389 if (!regexec_e(re, s, REG_NOTBOL, 0, slen))
393 case 1: /* 1st occurrence */
394 /* Locate start of replaced string. */
395 re_off = match[0].rm_so + (s - ps);
396 /* Copy leading retained string. */
397 cspace(&SS, ps, re_off, APPEND);
398 /* Add in regular expression. */
399 regsub(&SS, s, cp->u.s->new);
400 /* Copy trailing retained string. */
402 slen -= match[0].rm_eo;
403 cspace(&SS, s, slen, APPEND);
408 * Swap the substitute space and the pattern space, and make sure
409 * that any leftover pointers into stdio memory get lost.
416 /* Handle the 'p' flag. */
420 /* Handle the 'w' flag. */
421 if (cp->u.s->wfile && !pd) {
422 if (cp->u.s->wfd == -1 && (cp->u.s->wfd = open(cp->u.s->wfile,
423 O_WRONLY|O_APPEND|O_CREAT|O_TRUNC, DEFFILEMODE)) == -1)
424 err(1, "%s", cp->u.s->wfile);
425 if (write(cp->u.s->wfd, ps, psl) != psl ||
426 write(cp->u.s->wfd, "\n", 1) != 1)
427 err(1, "%s", cp->u.s->wfile);
434 * Perform translation ('y' command) in the pattern space.
437 do_tr(struct s_tr *y)
444 if (MB_CUR_MAX == 1) {
446 * Single-byte encoding: perform in-place translation
447 * of the pattern space.
449 for (p = ps; p < &ps[psl]; p++)
450 *p = y->bytetab[(u_char)*p];
453 * Multi-byte encoding: perform translation into the
454 * translation space, then swap the translation and
457 /* Clean translation space. */
459 for (p = ps, left = psl; left > 0; p += clen, left -= clen) {
460 if ((c = y->bytetab[(u_char)*p]) != '\0') {
461 cspace(&YS, &c, 1, APPEND);
465 for (i = 0; i < y->nmultis; i++)
466 if (left >= y->multis[i].fromlen &&
467 memcmp(p, y->multis[i].from,
468 y->multis[i].fromlen) == 0)
470 if (i < y->nmultis) {
471 cspace(&YS, y->multis[i].to,
472 y->multis[i].tolen, APPEND);
473 clen = y->multis[i].fromlen;
475 cspace(&YS, p, 1, APPEND);
479 /* Swap the translation space and the pattern space. */
488 * Flush append requests. Always called before reading a line,
489 * therefore it also resets the substitution done (sdone) flag.
498 for (i = 0; i < appendx; i++)
499 switch (appends[i].type) {
501 fwrite(appends[i].s, sizeof(char), appends[i].len,
506 * Read files probably shouldn't be cached. Since
507 * it's not an error to read a non-existent file,
508 * it's possible that another program is interacting
509 * with the sed script through the filesystem. It
510 * would be truly bizarre, but possible. It's probably
511 * not that big a performance win, anyhow.
513 if ((f = fopen(appends[i].s, "r")) == NULL)
515 while ((count = fread(buf, sizeof(char), sizeof(buf), f)))
516 (void)fwrite(buf, sizeof(char), count, outfile);
521 errx(1, "%s: %s", outfname, strerror(errno ? errno : EIO));
526 lputs(char *s, size_t len)
528 static const char escapes[] = "\\\a\b\f\r\t\v";
532 static int termwidth = -1;
537 if (outfile != stdout)
539 if (termwidth == -1) {
540 if ((p = getenv("COLUMNS")) && *p != '\0')
542 else if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &win) == 0 &&
544 termwidth = win.ws_col;
549 memset(&mbs, 0, sizeof(mbs));
552 clen = mbrtowc(&wc, s, len, &mbs);
555 if (clen == (size_t)-1 || clen == (size_t)-2) {
556 wc = (unsigned char)*s;
558 memset(&mbs, 0, sizeof(mbs));
561 if (col + 1 >= termwidth)
562 fprintf(outfile, "\\\n");
564 fputc('\n', outfile);
566 } else if (iswprint(wc)) {
568 if (col + width >= termwidth) {
569 fprintf(outfile, "\\\n");
572 fwrite(s, 1, clen, outfile);
574 } else if (wc != L'\0' && (c = wctob(wc)) != EOF &&
575 (p = strchr(escapes, c)) != NULL) {
576 if (col + 2 >= termwidth) {
577 fprintf(outfile, "\\\n");
580 fprintf(outfile, "\\%c", "\\abfrtv"[p - escapes]);
583 if (col + 4 * clen >= termwidth) {
584 fprintf(outfile, "\\\n");
587 for (i = 0; i < clen; i++)
588 fprintf(outfile, "\\%03o",
589 (int)(unsigned char)s[i]);
595 if (col + 1 >= termwidth)
596 fprintf(outfile, "\\\n");
597 (void)fputc('$', outfile);
598 (void)fputc('\n', outfile);
600 errx(1, "%s: %s", outfname, strerror(errno ? errno : EIO));
604 regexec_e(regex_t *preg, const char *string, int eflags, int nomatch,
611 errx(1, "first RE may not be empty");
617 match[0].rm_eo = slen;
619 eval = regexec(defpreg, string,
620 nomatch ? 0 : maxnsub + 1, match, eflags | REG_STARTEND);
627 errx(1, "RE error: %s", strregerror(eval, defpreg));
632 * regsub - perform substitutions after a regexp match
633 * Based on a routine by Henry Spencer
636 regsub(SPACE *sp, char *string, char *src)
641 #define NEEDSP(reqlen) \
642 /* XXX What is the +1 for? */ \
643 if (sp->len + (reqlen) + 1 >= sp->blen) { \
644 sp->blen += (reqlen) + 1024; \
645 if ((sp->space = sp->back = realloc(sp->back, sp->blen)) \
648 dst = sp->space + sp->len; \
651 dst = sp->space + sp->len;
652 while ((c = *src++) != '\0') {
655 else if (c == '\\' && isdigit((unsigned char)*src))
659 if (no < 0) { /* Ordinary character. */
660 if (c == '\\' && (*src == '\\' || *src == '&'))
665 } else if (match[no].rm_so != -1 && match[no].rm_eo != -1) {
666 len = match[no].rm_eo - match[no].rm_so;
668 memmove(dst, string + match[no].rm_so, len);
679 * Concatenate space: append the source space to the destination space,
680 * allocating new space as necessary.
683 cspace(SPACE *sp, const char *p, size_t len, enum e_spflag spflag)
687 /* Make sure SPACE has enough memory and ramp up quickly. */
688 tlen = sp->len + len + 1;
689 if (tlen > sp->blen) {
690 sp->blen = tlen + 1024;
691 if ((sp->space = sp->back = realloc(sp->back, sp->blen)) ==
696 if (spflag == REPLACE)
699 memmove(sp->space + sp->len, p, len);
701 sp->space[sp->len += len] = '\0';
705 * Close all cached opened files and report any errors
708 cfclose(struct s_command *cp, struct s_command *end)
711 for (; cp != end; cp = cp->next)
714 if (cp->u.s->wfd != -1 && close(cp->u.s->wfd))
715 err(1, "%s", cp->u.s->wfile);
719 if (cp->u.fd != -1 && close(cp->u.fd))
724 cfclose(cp->u.c, cp->next);