compile.c revision 1.8 1 1.1 alm /*-
2 1.1 alm * Copyright (c) 1992 Diomidis Spinellis.
3 1.1 alm * Copyright (c) 1992 The Regents of the University of California.
4 1.1 alm * All rights reserved.
5 1.1 alm *
6 1.1 alm * This code is derived from software contributed to Berkeley by
7 1.1 alm * Diomidis Spinellis of Imperial College, University of London.
8 1.1 alm *
9 1.1 alm * Redistribution and use in source and binary forms, with or without
10 1.1 alm * modification, are permitted provided that the following conditions
11 1.1 alm * are met:
12 1.1 alm * 1. Redistributions of source code must retain the above copyright
13 1.1 alm * notice, this list of conditions and the following disclaimer.
14 1.1 alm * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 alm * notice, this list of conditions and the following disclaimer in the
16 1.1 alm * documentation and/or other materials provided with the distribution.
17 1.1 alm * 3. All advertising materials mentioning features or use of this software
18 1.1 alm * must display the following acknowledgement:
19 1.1 alm * This product includes software developed by the University of
20 1.1 alm * California, Berkeley and its contributors.
21 1.1 alm * 4. Neither the name of the University nor the names of its contributors
22 1.1 alm * may be used to endorse or promote products derived from this software
23 1.1 alm * without specific prior written permission.
24 1.1 alm *
25 1.1 alm * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 alm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 alm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 alm * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 alm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 alm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 alm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 alm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 alm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 alm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 alm * SUCH DAMAGE.
36 1.1 alm */
37 1.1 alm
38 1.1 alm #ifndef lint
39 1.4 mycroft /*static char sccsid[] = "from: @(#)compile.c 5.6 (Berkeley) 11/2/92";*/
40 1.8 mycroft static char rcsid[] = "$Id: compile.c,v 1.8 1993/12/05 21:43:57 mycroft Exp $";
41 1.1 alm #endif /* not lint */
42 1.1 alm
43 1.1 alm #include <sys/types.h>
44 1.1 alm #include <sys/stat.h>
45 1.1 alm
46 1.1 alm #include <ctype.h>
47 1.1 alm #include <errno.h>
48 1.1 alm #include <fcntl.h>
49 1.1 alm #include <limits.h>
50 1.1 alm #include <regex.h>
51 1.1 alm #include <stdio.h>
52 1.1 alm #include <stdlib.h>
53 1.1 alm #include <string.h>
54 1.1 alm
55 1.1 alm #include "defs.h"
56 1.1 alm #include "extern.h"
57 1.1 alm
58 1.1 alm static char *compile_addr __P((char *, struct s_addr *));
59 1.2 alm static char *compile_ccl __P((char **, char *));
60 1.1 alm static char *compile_delimited __P((char *, char *));
61 1.1 alm static char *compile_flags __P((char *, struct s_subst *));
62 1.1 alm static char *compile_re __P((char *, regex_t **));
63 1.1 alm static char *compile_subst __P((char *, struct s_subst *));
64 1.1 alm static char *compile_text __P((void));
65 1.1 alm static char *compile_tr __P((char *, char **));
66 1.1 alm static struct s_command
67 1.1 alm **compile_stream __P((char *, struct s_command **, char *));
68 1.1 alm static char *duptoeol __P((char *));
69 1.1 alm static struct s_command
70 1.1 alm *findlabel __P((struct s_command *, struct s_command *));
71 1.1 alm static void fixuplabel __P((struct s_command *, struct s_command *,
72 1.1 alm struct s_command *));
73 1.1 alm
74 1.1 alm /*
75 1.1 alm * Command specification. This is used to drive the command parser.
76 1.1 alm */
77 1.1 alm struct s_format {
78 1.1 alm char code; /* Command code */
79 1.1 alm int naddr; /* Number of address args */
80 1.1 alm enum e_args args; /* Argument type */
81 1.1 alm };
82 1.1 alm
83 1.1 alm static struct s_format cmd_fmts[] = {
84 1.1 alm {'{', 2, GROUP},
85 1.1 alm {'a', 1, TEXT},
86 1.1 alm {'b', 2, BRANCH},
87 1.1 alm {'c', 2, TEXT},
88 1.1 alm {'d', 2, EMPTY},
89 1.1 alm {'D', 2, EMPTY},
90 1.1 alm {'g', 2, EMPTY},
91 1.1 alm {'G', 2, EMPTY},
92 1.1 alm {'h', 2, EMPTY},
93 1.1 alm {'H', 2, EMPTY},
94 1.1 alm {'i', 1, TEXT},
95 1.1 alm {'l', 2, EMPTY},
96 1.1 alm {'n', 2, EMPTY},
97 1.1 alm {'N', 2, EMPTY},
98 1.1 alm {'p', 2, EMPTY},
99 1.1 alm {'P', 2, EMPTY},
100 1.1 alm {'q', 1, EMPTY},
101 1.1 alm {'r', 1, RFILE},
102 1.1 alm {'s', 2, SUBST},
103 1.1 alm {'t', 2, BRANCH},
104 1.1 alm {'w', 2, WFILE},
105 1.1 alm {'x', 2, EMPTY},
106 1.1 alm {'y', 2, TR},
107 1.1 alm {'!', 2, NONSEL},
108 1.1 alm {':', 0, LABEL},
109 1.1 alm {'#', 0, COMMENT},
110 1.1 alm {'=', 1, EMPTY},
111 1.1 alm {'\0', 0, COMMENT},
112 1.1 alm };
113 1.1 alm
114 1.1 alm /* The compiled program. */
115 1.1 alm struct s_command *prog;
116 1.1 alm
117 1.1 alm /*
118 1.1 alm * Compile the program into prog.
119 1.1 alm * Initialise appends.
120 1.1 alm */
121 1.1 alm void
122 1.1 alm compile()
123 1.1 alm {
124 1.1 alm *compile_stream(NULL, &prog, NULL) = NULL;
125 1.1 alm fixuplabel(prog, prog, NULL);
126 1.1 alm appends = xmalloc(sizeof(struct s_appends) * appendnum);
127 1.1 alm match = xmalloc((maxnsub + 1) * sizeof(regmatch_t));
128 1.1 alm }
129 1.1 alm
130 1.1 alm #define EATSPACE() do { \
131 1.1 alm if (p) \
132 1.1 alm while (*p && isascii(*p) && isspace(*p)) \
133 1.1 alm p++; \
134 1.1 alm } while (0)
135 1.1 alm
136 1.1 alm static struct s_command **
137 1.1 alm compile_stream(terminator, link, p)
138 1.1 alm char *terminator;
139 1.1 alm struct s_command **link;
140 1.1 alm register char *p;
141 1.1 alm {
142 1.1 alm static char lbuf[_POSIX2_LINE_MAX + 1]; /* To save stack */
143 1.1 alm struct s_command *cmd, *cmd2;
144 1.1 alm struct s_format *fp;
145 1.1 alm int naddr; /* Number of addresses */
146 1.1 alm
147 1.1 alm if (p != NULL)
148 1.1 alm goto semicolon;
149 1.1 alm for (;;) {
150 1.1 alm if ((p = cu_fgets(lbuf, sizeof(lbuf))) == NULL) {
151 1.1 alm if (terminator != NULL)
152 1.1 alm err(COMPILE, "unexpected EOF (pending }'s)");
153 1.1 alm return (link);
154 1.1 alm }
155 1.1 alm
156 1.1 alm semicolon: EATSPACE();
157 1.1 alm if (p && (*p == '#' || *p == '\0'))
158 1.1 alm continue;
159 1.1 alm if (*p == '}') {
160 1.1 alm if (terminator == NULL)
161 1.1 alm err(COMPILE, "unexpected }");
162 1.1 alm return (link);
163 1.1 alm }
164 1.1 alm *link = cmd = xmalloc(sizeof(struct s_command));
165 1.1 alm link = &cmd->next;
166 1.1 alm cmd->nonsel = cmd->inrange = 0;
167 1.1 alm /* First parse the addresses */
168 1.1 alm naddr = 0;
169 1.1 alm cmd->a1 = cmd->a2 = NULL;
170 1.1 alm
171 1.1 alm /* Valid characters to start an address */
172 1.1 alm #define addrchar(c) (strchr("0123456789/\\$", (c)))
173 1.1 alm if (addrchar(*p)) {
174 1.1 alm naddr++;
175 1.1 alm cmd->a1 = xmalloc(sizeof(struct s_addr));
176 1.1 alm p = compile_addr(p, cmd->a1);
177 1.1 alm EATSPACE(); /* EXTENSION */
178 1.1 alm if (*p == ',') {
179 1.1 alm naddr++;
180 1.1 alm p++;
181 1.1 alm EATSPACE(); /* EXTENSION */
182 1.1 alm cmd->a2 = xmalloc(sizeof(struct s_addr));
183 1.1 alm p = compile_addr(p, cmd->a2);
184 1.1 alm }
185 1.1 alm }
186 1.1 alm
187 1.1 alm nonsel: /* Now parse the command */
188 1.1 alm EATSPACE();
189 1.1 alm if (!*p)
190 1.1 alm err(COMPILE, "command expected");
191 1.1 alm cmd->code = *p;
192 1.1 alm for (fp = cmd_fmts; fp->code; fp++)
193 1.1 alm if (fp->code == *p)
194 1.1 alm break;
195 1.1 alm if (!fp->code)
196 1.1 alm err(COMPILE, "invalid command code %c", *p);
197 1.1 alm if (naddr > fp->naddr)
198 1.1 alm err(COMPILE,
199 1.1 alm "command %c expects up to %d address(es), found %d", *p, fp->naddr, naddr);
200 1.1 alm switch (fp->args) {
201 1.1 alm case NONSEL: /* ! */
202 1.1 alm cmd->nonsel = ! cmd->nonsel;
203 1.1 alm p++;
204 1.1 alm goto nonsel;
205 1.1 alm case GROUP: /* { */
206 1.1 alm p++;
207 1.1 alm EATSPACE();
208 1.1 alm if (!*p)
209 1.1 alm p = NULL;
210 1.1 alm cmd2 = xmalloc(sizeof(struct s_command));
211 1.1 alm cmd2->code = '}';
212 1.7 mycroft cmd2->a1 = cmd2->a2 = NULL;
213 1.8 mycroft cmd2->nonsel = 0;
214 1.1 alm *compile_stream("}", &cmd->u.c, p) = cmd2;
215 1.1 alm cmd->next = cmd2;
216 1.1 alm link = &cmd2->next;
217 1.1 alm break;
218 1.1 alm case EMPTY: /* d D g G h H l n N p P q x = \0 */
219 1.1 alm p++;
220 1.1 alm EATSPACE();
221 1.1 alm if (*p == ';') {
222 1.1 alm p++;
223 1.1 alm link = &cmd->next;
224 1.1 alm goto semicolon;
225 1.1 alm }
226 1.1 alm if (*p)
227 1.1 alm err(COMPILE,
228 1.1 alm "extra characters at the end of %c command", cmd->code);
229 1.1 alm break;
230 1.1 alm case TEXT: /* a c i */
231 1.1 alm p++;
232 1.1 alm EATSPACE();
233 1.1 alm if (*p != '\\')
234 1.1 alm err(COMPILE,
235 1.1 alm "command %c expects \\ followed by text", cmd->code);
236 1.1 alm p++;
237 1.1 alm EATSPACE();
238 1.1 alm if (*p)
239 1.1 alm err(COMPILE,
240 1.1 alm "extra characters after \\ at the end of %c command", cmd->code);
241 1.1 alm cmd->t = compile_text();
242 1.1 alm break;
243 1.1 alm case COMMENT: /* \0 # */
244 1.1 alm break;
245 1.1 alm case WFILE: /* w */
246 1.1 alm p++;
247 1.1 alm EATSPACE();
248 1.1 alm if (*p == '\0')
249 1.1 alm err(COMPILE, "filename expected");
250 1.1 alm cmd->t = duptoeol(p);
251 1.1 alm if (aflag)
252 1.1 alm cmd->u.fd = -1;
253 1.1 alm else if ((cmd->u.fd = open(p,
254 1.1 alm O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
255 1.1 alm DEFFILEMODE)) == -1)
256 1.1 alm err(FATAL, "%s: %s\n", p, strerror(errno));
257 1.1 alm break;
258 1.1 alm case RFILE: /* r */
259 1.1 alm p++;
260 1.1 alm EATSPACE();
261 1.1 alm if (*p == '\0')
262 1.1 alm err(COMPILE, "filename expected");
263 1.1 alm else
264 1.1 alm cmd->t = duptoeol(p);
265 1.1 alm break;
266 1.1 alm case BRANCH: /* b t */
267 1.1 alm p++;
268 1.1 alm EATSPACE();
269 1.1 alm if (*p == '\0')
270 1.1 alm cmd->t = NULL;
271 1.1 alm else
272 1.1 alm cmd->t = duptoeol(p);
273 1.1 alm break;
274 1.1 alm case LABEL: /* : */
275 1.1 alm p++;
276 1.1 alm EATSPACE();
277 1.1 alm cmd->t = duptoeol(p);
278 1.1 alm if (strlen(p) == 0)
279 1.1 alm err(COMPILE, "empty label");
280 1.1 alm break;
281 1.1 alm case SUBST: /* s */
282 1.1 alm p++;
283 1.1 alm if (*p == '\0' || *p == '\\')
284 1.1 alm err(COMPILE,
285 1.1 alm "substitute pattern can not be delimited by newline or backslash");
286 1.1 alm cmd->u.s = xmalloc(sizeof(struct s_subst));
287 1.1 alm p = compile_re(p, &cmd->u.s->re);
288 1.1 alm if (p == NULL)
289 1.1 alm err(COMPILE, "unterminated substitute pattern");
290 1.1 alm --p;
291 1.1 alm p = compile_subst(p, cmd->u.s);
292 1.1 alm p = compile_flags(p, cmd->u.s);
293 1.1 alm EATSPACE();
294 1.1 alm if (*p == ';') {
295 1.1 alm p++;
296 1.1 alm link = &cmd->next;
297 1.1 alm goto semicolon;
298 1.1 alm }
299 1.1 alm break;
300 1.1 alm case TR: /* y */
301 1.1 alm p++;
302 1.1 alm p = compile_tr(p, (char **)&cmd->u.y);
303 1.1 alm EATSPACE();
304 1.1 alm if (*p == ';') {
305 1.1 alm p++;
306 1.1 alm link = &cmd->next;
307 1.1 alm goto semicolon;
308 1.1 alm }
309 1.1 alm if (*p)
310 1.1 alm err(COMPILE,
311 1.1 alm "extra text at the end of a transform command");
312 1.1 alm break;
313 1.1 alm }
314 1.1 alm }
315 1.1 alm }
316 1.1 alm
317 1.1 alm /*
318 1.1 alm * Get a delimited string. P points to the delimeter of the string; d points
319 1.1 alm * to a buffer area. Newline and delimiter escapes are processed; other
320 1.1 alm * escapes are ignored.
321 1.1 alm *
322 1.1 alm * Returns a pointer to the first character after the final delimiter or NULL
323 1.1 alm * in the case of a non-terminated string. The character array d is filled
324 1.1 alm * with the processed string.
325 1.1 alm */
326 1.1 alm static char *
327 1.1 alm compile_delimited(p, d)
328 1.1 alm char *p, *d;
329 1.1 alm {
330 1.1 alm char c;
331 1.1 alm
332 1.1 alm c = *p++;
333 1.1 alm if (c == '\0')
334 1.1 alm return (NULL);
335 1.1 alm else if (c == '\\')
336 1.1 alm err(COMPILE, "\\ can not be used as a string delimiter");
337 1.1 alm else if (c == '\n')
338 1.1 alm err(COMPILE, "newline can not be used as a string delimiter");
339 1.1 alm while (*p) {
340 1.2 alm if (*p == '[') {
341 1.2 alm if ((d = compile_ccl(&p, d)) == NULL)
342 1.2 alm err(COMPILE, "unbalanced brackets ([])");
343 1.2 alm continue;
344 1.2 alm } else if (*p == '\\' && p[1] == c)
345 1.1 alm p++;
346 1.1 alm else if (*p == '\\' && p[1] == 'n') {
347 1.1 alm *d++ = '\n';
348 1.1 alm p += 2;
349 1.1 alm continue;
350 1.1 alm } else if (*p == '\\' && p[1] == '\\')
351 1.1 alm *d++ = *p++;
352 1.1 alm else if (*p == c) {
353 1.1 alm *d = '\0';
354 1.1 alm return (p + 1);
355 1.1 alm }
356 1.1 alm *d++ = *p++;
357 1.1 alm }
358 1.1 alm return (NULL);
359 1.2 alm }
360 1.2 alm
361 1.2 alm
362 1.2 alm /* compile_ccl: expand a POSIX character class */
363 1.2 alm static char *
364 1.2 alm compile_ccl(sp, t)
365 1.2 alm char **sp;
366 1.2 alm char *t;
367 1.2 alm {
368 1.2 alm int c, d;
369 1.2 alm char *s = *sp;
370 1.2 alm
371 1.2 alm *t++ = *s++;
372 1.2 alm if (*s == '^')
373 1.2 alm *t++ = *s++;
374 1.2 alm if (*s == ']')
375 1.2 alm *t++ = *s++;
376 1.2 alm for (; *s && (*t = *s) != ']'; s++, t++)
377 1.2 alm if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '=')) {
378 1.2 alm *++t = *++s, t++, s++;
379 1.2 alm for (c = *s; (*t = *s) != ']' || c != d; s++, t++)
380 1.2 alm if ((c = *s) == '\0')
381 1.2 alm return NULL;
382 1.2 alm } else if (*s == '\\' && s[1] == 'n')
383 1.2 alm *t = '\n', s++;
384 1.2 alm return (*s == ']') ? *sp = ++s, ++t : NULL;
385 1.1 alm }
386 1.1 alm
387 1.1 alm /*
388 1.1 alm * Get a regular expression. P points to the delimiter of the regular
389 1.1 alm * expression; repp points to the address of a regexp pointer. Newline
390 1.1 alm * and delimiter escapes are processed; other escapes are ignored.
391 1.1 alm * Returns a pointer to the first character after the final delimiter
392 1.1 alm * or NULL in the case of a non terminated regular expression. The regexp
393 1.1 alm * pointer is set to the compiled regular expression.
394 1.1 alm * Cflags are passed to regcomp.
395 1.1 alm */
396 1.1 alm static char *
397 1.1 alm compile_re(p, repp)
398 1.1 alm char *p;
399 1.1 alm regex_t **repp;
400 1.1 alm {
401 1.1 alm int eval;
402 1.1 alm char re[_POSIX2_LINE_MAX + 1];
403 1.1 alm
404 1.1 alm p = compile_delimited(p, re);
405 1.1 alm if (p && strlen(re) == 0) {
406 1.1 alm *repp = NULL;
407 1.1 alm return (p);
408 1.1 alm }
409 1.1 alm *repp = xmalloc(sizeof(regex_t));
410 1.1 alm if (p && (eval = regcomp(*repp, re, 0)) != 0)
411 1.1 alm err(COMPILE, "RE error: %s", strregerror(eval, *repp));
412 1.1 alm if (maxnsub < (*repp)->re_nsub)
413 1.1 alm maxnsub = (*repp)->re_nsub;
414 1.1 alm return (p);
415 1.1 alm }
416 1.1 alm
417 1.1 alm /*
418 1.1 alm * Compile the substitution string of a regular expression and set res to
419 1.1 alm * point to a saved copy of it. Nsub is the number of parenthesized regular
420 1.1 alm * expressions.
421 1.1 alm */
422 1.1 alm static char *
423 1.1 alm compile_subst(p, s)
424 1.1 alm char *p;
425 1.1 alm struct s_subst *s;
426 1.1 alm {
427 1.1 alm static char lbuf[_POSIX2_LINE_MAX + 1];
428 1.1 alm int asize, ref, size;
429 1.1 alm char c, *text, *op, *sp;
430 1.1 alm
431 1.1 alm c = *p++; /* Terminator character */
432 1.1 alm if (c == '\0')
433 1.1 alm return (NULL);
434 1.1 alm
435 1.1 alm s->maxbref = 0;
436 1.1 alm s->linenum = linenum;
437 1.1 alm asize = 2 * _POSIX2_LINE_MAX + 1;
438 1.1 alm text = xmalloc(asize);
439 1.1 alm size = 0;
440 1.1 alm do {
441 1.1 alm op = sp = text + size;
442 1.1 alm for (; *p; p++) {
443 1.1 alm if (*p == '\\') {
444 1.1 alm p++;
445 1.1 alm if (strchr("123456789", *p) != NULL) {
446 1.1 alm *sp++ = '\\';
447 1.1 alm ref = *p - '0';
448 1.1 alm if (s->re != NULL &&
449 1.1 alm ref > s->re->re_nsub)
450 1.1 alm err(COMPILE,
451 1.1 alm "\\%c not defined in the RE", *p);
452 1.1 alm if (s->maxbref < ref)
453 1.1 alm s->maxbref = ref;
454 1.1 alm } else if (*p == '&' || *p == '\\')
455 1.1 alm *sp++ = '\\';
456 1.1 alm } else if (*p == c) {
457 1.1 alm p++;
458 1.1 alm *sp++ = '\0';
459 1.1 alm size += sp - op;
460 1.1 alm s->new = xrealloc(text, size);
461 1.1 alm return (p);
462 1.1 alm } else if (*p == '\n') {
463 1.1 alm err(COMPILE,
464 1.1 alm "unescaped newline inside substitute pattern");
465 1.1 alm /* NOTREACHED */
466 1.1 alm }
467 1.1 alm *sp++ = *p;
468 1.1 alm }
469 1.1 alm size += sp - op;
470 1.1 alm if (asize - size < _POSIX2_LINE_MAX + 1) {
471 1.1 alm asize *= 2;
472 1.1 alm text = xmalloc(asize);
473 1.1 alm }
474 1.1 alm } while (cu_fgets(p = lbuf, sizeof(lbuf)));
475 1.1 alm err(COMPILE, "unterminated substitute in regular expression");
476 1.1 alm /* NOTREACHED */
477 1.1 alm }
478 1.1 alm
479 1.1 alm /*
480 1.1 alm * Compile the flags of the s command
481 1.1 alm */
482 1.1 alm static char *
483 1.1 alm compile_flags(p, s)
484 1.1 alm char *p;
485 1.1 alm struct s_subst *s;
486 1.1 alm {
487 1.1 alm int gn; /* True if we have seen g or n */
488 1.1 alm char wfile[_POSIX2_LINE_MAX + 1], *q;
489 1.1 alm
490 1.1 alm s->n = 1; /* Default */
491 1.1 alm s->p = 0;
492 1.1 alm s->wfile = NULL;
493 1.1 alm s->wfd = -1;
494 1.1 alm for (gn = 0;;) {
495 1.1 alm EATSPACE(); /* EXTENSION */
496 1.1 alm switch (*p) {
497 1.1 alm case 'g':
498 1.1 alm if (gn)
499 1.1 alm err(COMPILE,
500 1.1 alm "more than one number or 'g' in substitute flags");
501 1.1 alm gn = 1;
502 1.1 alm s->n = 0;
503 1.1 alm break;
504 1.1 alm case '\0':
505 1.1 alm case '\n':
506 1.1 alm case ';':
507 1.1 alm return (p);
508 1.1 alm case 'p':
509 1.1 alm s->p = 1;
510 1.1 alm break;
511 1.1 alm case '1': case '2': case '3':
512 1.1 alm case '4': case '5': case '6':
513 1.1 alm case '7': case '8': case '9':
514 1.1 alm if (gn)
515 1.1 alm err(COMPILE,
516 1.1 alm "more than one number or 'g' in substitute flags");
517 1.1 alm gn = 1;
518 1.1 alm /* XXX Check for overflow */
519 1.1 alm s->n = (int)strtol(p, &p, 10);
520 1.1 alm break;
521 1.1 alm case 'w':
522 1.1 alm p++;
523 1.6 andrew #ifdef FUSSY_HISTORIC_PRACTICE
524 1.1 alm if (*p != ' ') {
525 1.1 alm err(WARNING, "space missing before w wfile");
526 1.1 alm return (p);
527 1.1 alm }
528 1.1 alm #endif
529 1.1 alm EATSPACE();
530 1.1 alm q = wfile;
531 1.1 alm while (*p) {
532 1.1 alm if (*p == '\n')
533 1.1 alm break;
534 1.1 alm *q++ = *p++;
535 1.1 alm }
536 1.1 alm *q = '\0';
537 1.1 alm if (q == wfile)
538 1.1 alm err(COMPILE, "no wfile specified");
539 1.1 alm s->wfile = strdup(wfile);
540 1.1 alm if (!aflag && (s->wfd = open(wfile,
541 1.1 alm O_WRONLY|O_APPEND|O_CREAT|O_TRUNC,
542 1.1 alm DEFFILEMODE)) == -1)
543 1.1 alm err(FATAL, "%s: %s\n", wfile, strerror(errno));
544 1.1 alm return (p);
545 1.1 alm default:
546 1.1 alm err(COMPILE,
547 1.1 alm "bad flag in substitute command: '%c'", *p);
548 1.1 alm break;
549 1.1 alm }
550 1.1 alm p++;
551 1.1 alm }
552 1.1 alm }
553 1.1 alm
554 1.1 alm /*
555 1.1 alm * Compile a translation set of strings into a lookup table.
556 1.1 alm */
557 1.1 alm static char *
558 1.1 alm compile_tr(p, transtab)
559 1.1 alm char *p;
560 1.1 alm char **transtab;
561 1.1 alm {
562 1.1 alm int i;
563 1.1 alm char *lt, *op, *np;
564 1.1 alm char old[_POSIX2_LINE_MAX + 1];
565 1.1 alm char new[_POSIX2_LINE_MAX + 1];
566 1.1 alm
567 1.1 alm if (*p == '\0' || *p == '\\')
568 1.1 alm err(COMPILE,
569 1.1 alm "transform pattern can not be delimited by newline or backslash");
570 1.1 alm p = compile_delimited(p, old);
571 1.1 alm if (p == NULL) {
572 1.1 alm err(COMPILE, "unterminated transform source string");
573 1.1 alm return (NULL);
574 1.1 alm }
575 1.1 alm p = compile_delimited(--p, new);
576 1.1 alm if (p == NULL) {
577 1.1 alm err(COMPILE, "unterminated transform target string");
578 1.1 alm return (NULL);
579 1.1 alm }
580 1.1 alm EATSPACE();
581 1.1 alm if (strlen(new) != strlen(old)) {
582 1.1 alm err(COMPILE, "transform strings are not the same length");
583 1.1 alm return (NULL);
584 1.1 alm }
585 1.1 alm /* We assume characters are 8 bits */
586 1.1 alm lt = xmalloc(UCHAR_MAX);
587 1.1 alm for (i = 0; i <= UCHAR_MAX; i++)
588 1.1 alm lt[i] = (char)i;
589 1.1 alm for (op = old, np = new; *op; op++, np++)
590 1.1 alm lt[(u_char)*op] = *np;
591 1.1 alm *transtab = lt;
592 1.1 alm return (p);
593 1.1 alm }
594 1.1 alm
595 1.1 alm /*
596 1.1 alm * Compile the text following an a or i command.
597 1.1 alm */
598 1.1 alm static char *
599 1.1 alm compile_text()
600 1.1 alm {
601 1.1 alm int asize, size;
602 1.1 alm char *text, *p, *op, *s;
603 1.1 alm char lbuf[_POSIX2_LINE_MAX + 1];
604 1.1 alm
605 1.1 alm asize = 2 * _POSIX2_LINE_MAX + 1;
606 1.1 alm text = xmalloc(asize);
607 1.1 alm size = 0;
608 1.1 alm while (cu_fgets(lbuf, sizeof(lbuf))) {
609 1.1 alm op = s = text + size;
610 1.1 alm p = lbuf;
611 1.1 alm EATSPACE();
612 1.1 alm for (; *p; p++) {
613 1.1 alm if (*p == '\\')
614 1.1 alm p++;
615 1.1 alm *s++ = *p;
616 1.1 alm }
617 1.1 alm size += s - op;
618 1.1 alm if (p[-2] != '\\') {
619 1.1 alm *s = '\0';
620 1.1 alm break;
621 1.1 alm }
622 1.1 alm if (asize - size < _POSIX2_LINE_MAX + 1) {
623 1.1 alm asize *= 2;
624 1.1 alm text = xmalloc(asize);
625 1.1 alm }
626 1.1 alm }
627 1.1 alm return (xrealloc(text, size + 1));
628 1.1 alm }
629 1.1 alm
630 1.1 alm /*
631 1.1 alm * Get an address and return a pointer to the first character after
632 1.1 alm * it. Fill the structure pointed to according to the address.
633 1.1 alm */
634 1.1 alm static char *
635 1.1 alm compile_addr(p, a)
636 1.1 alm char *p;
637 1.1 alm struct s_addr *a;
638 1.1 alm {
639 1.1 alm char *end;
640 1.1 alm
641 1.1 alm switch (*p) {
642 1.1 alm case '\\': /* Context address */
643 1.1 alm ++p;
644 1.1 alm /* FALLTHROUGH */
645 1.1 alm case '/': /* Context address */
646 1.1 alm p = compile_re(p, &a->u.r);
647 1.1 alm if (p == NULL)
648 1.1 alm err(COMPILE, "unterminated regular expression");
649 1.1 alm a->type = AT_RE;
650 1.1 alm return (p);
651 1.1 alm
652 1.1 alm case '$': /* Last line */
653 1.1 alm a->type = AT_LAST;
654 1.1 alm return (p + 1);
655 1.1 alm /* Line number */
656 1.1 alm case '0': case '1': case '2': case '3': case '4':
657 1.1 alm case '5': case '6': case '7': case '8': case '9':
658 1.1 alm a->type = AT_LINE;
659 1.1 alm a->u.l = strtol(p, &end, 10);
660 1.1 alm return (end);
661 1.1 alm default:
662 1.1 alm err(COMPILE, "expected context address");
663 1.1 alm return (NULL);
664 1.1 alm }
665 1.1 alm }
666 1.1 alm
667 1.1 alm /*
668 1.1 alm * Return a copy of all the characters up to \n or \0
669 1.1 alm */
670 1.1 alm static char *
671 1.1 alm duptoeol(s)
672 1.1 alm register char *s;
673 1.1 alm {
674 1.1 alm size_t len;
675 1.1 alm char *start;
676 1.1 alm
677 1.1 alm for (start = s; *s != '\0' && *s != '\n'; ++s);
678 1.1 alm *s = '\0';
679 1.1 alm len = s - start + 1;
680 1.1 alm return (memmove(xmalloc(len), start, len));
681 1.1 alm }
682 1.1 alm
683 1.1 alm /*
684 1.1 alm * Find the label contained in the command l in the command linked list cp.
685 1.1 alm * L is excluded from the search. Return NULL if not found.
686 1.1 alm */
687 1.1 alm static struct s_command *
688 1.1 alm findlabel(l, cp)
689 1.1 alm struct s_command *l, *cp;
690 1.1 alm {
691 1.1 alm struct s_command *r;
692 1.1 alm
693 1.1 alm for (; cp; cp = cp->next)
694 1.1 alm if (cp->code == ':' && cp != l && strcmp(l->t, cp->t) == 0)
695 1.1 alm return (cp);
696 1.1 alm else if (cp->code == '{' && (r = findlabel(l, cp->u.c)))
697 1.1 alm return (r);
698 1.1 alm return (NULL);
699 1.1 alm }
700 1.1 alm
701 1.1 alm /*
702 1.1 alm * Convert goto label names to addresses.
703 1.1 alm * Detect duplicate labels.
704 1.1 alm * Set appendnum to the number of a and r commands in the script.
705 1.1 alm * Free the memory used by labels in b and t commands (but not by :)
706 1.1 alm * Root is a pointer to the script linked list; cp points to the
707 1.1 alm * search start.
708 1.1 alm * TODO: Remove } nodes
709 1.1 alm */
710 1.1 alm static void
711 1.1 alm fixuplabel(root, cp, end)
712 1.1 alm struct s_command *root, *cp, *end;
713 1.1 alm {
714 1.1 alm struct s_command *cp2;
715 1.1 alm
716 1.1 alm for (; cp != end; cp = cp->next)
717 1.1 alm switch (cp->code) {
718 1.1 alm case ':':
719 1.1 alm if (findlabel(cp, root))
720 1.1 alm err(COMPILE2, "duplicate label %s", cp->t);
721 1.1 alm break;
722 1.1 alm case 'a':
723 1.1 alm case 'r':
724 1.1 alm appendnum++;
725 1.1 alm break;
726 1.1 alm case 'b':
727 1.1 alm case 't':
728 1.1 alm if (cp->t == NULL) {
729 1.1 alm cp->u.c = NULL;
730 1.1 alm break;
731 1.1 alm }
732 1.1 alm if ((cp2 = findlabel(cp, root)) == NULL)
733 1.1 alm err(COMPILE2, "undefined label '%s'", cp->t);
734 1.1 alm free(cp->t);
735 1.1 alm cp->u.c = cp2;
736 1.1 alm break;
737 1.1 alm case '{':
738 1.1 alm fixuplabel(root, cp->u.c, cp->next);
739 1.1 alm break;
740 1.1 alm }
741 1.1 alm }
742