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