1 /* $OpenBSD: main.c,v 1.81 2012/04/12 17:00:11 espie Exp $ */
2 /* $NetBSD: main.c,v 1.12 1997/02/08 23:54:49 cgd Exp $ */
5 * Copyright (c) 1989, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * Ozan Yigit at York University.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * Facility: m4 macro processor
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
59 #include "pathnames.h"
61 stae *mstack; /* stack of m4 machine */
62 char *sstack; /* shadow stack, for string space extension */
63 static size_t STACKMAX; /* current maximum size of stack */
64 int sp; /* current m4 stack pointer */
65 int fp; /* m4 call frame pointer */
66 struct input_file infile[MAXINP];/* input file stack (0=stdin) */
67 FILE **outfile; /* diversion array(0=bitbucket)*/
69 FILE *active; /* active output file pointer */
70 int ilevel = 0; /* input file stack pointer */
71 int oindex = 0; /* diversion index.. */
72 const char *null = ""; /* as it says.. just a null.. */
73 char **m4wraps = NULL; /* m4wraps array. */
74 int maxwraps = 0; /* size of m4wraps array */
75 int wrapindex = 0; /* current offset in m4wraps */
76 char lquote[MAXCCHARS+1] = {LQUOTE}; /* left quote character (`) */
77 char rquote[MAXCCHARS+1] = {RQUOTE}; /* right quote character (') */
78 char scommt[MAXCCHARS+1] = {SCOMMT}; /* start character for comment */
79 char ecommt[MAXCCHARS+1] = {ECOMMT}; /* end character for comment */
80 int synch_lines = 0; /* line synchronisation for C preprocessor */
81 int prefix_builtins = 0; /* -P option to prefix builtin keywords */
84 const char *knam; /* keyword name */
85 int ktyp; /* keyword type */
88 struct keyblk keywrds[] = { /* m4 keywords to be installed */
89 { "include", INCLTYPE },
90 { "sinclude", SINCTYPE },
91 { "define", DEFITYPE },
93 { "divert", DIVRTYPE | NOARGS },
96 { "substr", SUBSTYPE },
97 { "ifelse", IFELTYPE },
98 { "ifdef", IFDFTYPE },
100 { "incr", INCRTYPE },
101 { "decr", DECRTYPE },
102 { "dnl", DNLNTYPE | NOARGS },
103 { "changequote", CHNQTYPE | NOARGS },
104 { "changecom", CHNCTYPE | NOARGS },
105 { "index", INDXTYPE },
107 { "paste", PASTTYPE },
108 { "spaste", SPASTYPE },
109 /* Newer extensions, needed to handle gnu-m4 scripts */
110 { "indir", INDIRTYPE},
111 { "builtin", BUILTINTYPE},
112 { "patsubst", PATSTYPE},
113 { "regexp", REGEXPTYPE},
114 { "esyscmd", ESYSCMDTYPE},
115 { "__file__", FILENAMETYPE | NOARGS},
116 { "__line__", LINETYPE | NOARGS},
118 { "popdef", POPDTYPE },
119 { "pushdef", PUSDTYPE },
120 { "dumpdef", DUMPTYPE | NOARGS },
121 { "shift", SHIFTYPE | NOARGS },
122 { "translit", TRNLTYPE },
123 { "undefine", UNDFTYPE },
124 { "undivert", UNDVTYPE | NOARGS },
125 { "divnum", DIVNTYPE | NOARGS },
126 { "maketemp", MKTMTYPE },
127 { "mkstemp", MKTMTYPE },
128 { "errprint", ERRPTYPE | NOARGS },
129 { "m4wrap", M4WRTYPE | NOARGS },
130 { "m4exit", EXITTYPE | NOARGS },
131 { "syscmd", SYSCTYPE },
132 { "sysval", SYSVTYPE | NOARGS },
133 { "traceon", TRACEONTYPE | NOARGS },
134 { "traceoff", TRACEOFFTYPE | NOARGS },
136 #if defined(unix) || defined(__unix__)
137 { "unix", SELFTYPE | NOARGS },
140 { "vms", SELFTYPE | NOARGS },
145 #define MAXKEYS (sizeof(keywrds)/sizeof(struct keyblk))
148 static struct position {
151 } quotes[MAXRECORD], paren[MAXRECORD];
153 static void record(struct position *, int);
154 static void dump_stack(struct position *, int);
156 static void macro(void);
157 static void initkwds(void);
158 static ndptr inspect(int, char *);
159 static int do_look_ahead(int, const char *);
160 static void reallyoutputstr(const char *);
161 static void reallyputchar(int);
163 static void enlarge_stack(void);
165 int main(int, char *[]);
170 main(int argc, char *argv[])
176 if (signal(SIGINT, SIG_IGN) != SIG_IGN)
177 signal(SIGINT, onintr);
181 STACKMAX = INITSTACKMAX;
183 mstack = (stae *)xalloc(sizeof(stae) * STACKMAX, NULL);
184 sstack = (char *)xalloc(STACKMAX, NULL);
190 while ((c = getopt(argc, argv, "gst:d:D:U:o:I:P")) != -1)
193 case 'D': /* define something..*/
194 for (p = optarg; *p; p++)
202 addtoincludepath(optarg);
207 case 'U': /* undefine... */
208 macro_popdef(optarg);
214 set_trace_flags(optarg);
220 mark_traced(optarg, 1);
234 setup_builtin("format", FORMATTYPE);
236 active = stdout; /* default active output */
239 sp = -1; /* stack pointer initialized */
240 fp = 0; /* frame pointer initialized */
241 set_input(infile+0, stdin, "stdin");
242 /* default input (naturally) */
245 for (; argc--; ++argv) {
247 if (p[0] == '-' && p[1] == EOS)
248 set_input(infile, stdin, "stdin");
249 else if (fopen_trypath(infile, p) == NULL)
254 release_input(infile);
260 ilevel = 0; /* in case m4wrap includes.. */
261 bufbase = bp = buf; /* use the entire buffer */
263 while (wrapindex != 0) {
264 for (i = 0; i < wrapindex; i++)
270 for (i = 0; i < wrapindex; i++) {
277 if (active != stdout)
278 active = stdout; /* reset output just in case */
279 for (n = 1; n < maxout; n++) /* default wrap-up: undivert */
280 if (outfile[n] != NULL)
282 /* remove bitbucket if used */
283 if (outfile[0] != NULL) {
284 (void) fclose(outfile[0]);
291 * Look ahead for `token'.
292 * (on input `t == token[0]')
293 * Used for comment and quoting delimiters.
294 * Returns 1 if `token' present; copied to output.
295 * 0 if `token' not found; all characters pushed back
298 do_look_ahead(int t, const char *token)
302 assert((unsigned char)t == (unsigned char)token[0]);
304 for (i = 1; *++token; i++) {
306 if (t == EOF || (unsigned char)t != (unsigned char)*token) {
316 #define LOOK_AHEAD(t, token) (t != EOF && \
317 (unsigned char)(t)==(unsigned char)(token)[0] && \
318 do_look_ahead(t,token))
321 * macro - the work horse..
326 char token[MAXTOK+1];
334 if (LOOK_AHEAD(t,lquote)) { /* strip quotes */
336 record(quotes, nlpar++);
338 * Opening quote: scan forward until matching
339 * closing quote has been found.
344 if (LOOK_AHEAD(l,rquote)) {
347 } else if (LOOK_AHEAD(l,lquote)) {
348 record(quotes, nlpar++);
350 } else if (l == EOF) {
352 warnx("unclosed quote:");
354 warnx("%d unclosed quotes:", nlpar);
355 dump_stack(quotes, nlpar);
367 } else if (sp < 0 && LOOK_AHEAD(t, scommt)) {
368 reallyoutputstr(scommt);
372 if (LOOK_AHEAD(t, ecommt)) {
373 reallyoutputstr(ecommt);
380 } else if (t == '_' || isalpha(t)) {
381 p = inspect(t, token);
383 pushback(l = gpbc());
384 if (p == NULL || (l != LPAREN &&
385 (macro_getdef(p)->type & NEEDARGS) != 0))
389 * real thing.. First build a call frame:
391 pushf(fp); /* previous call frm */
392 pushf(macro_getdef(p)->type); /* type of the call */
394 pushf(0); /* parenthesis level */
395 fp = sp; /* new frame pointer */
397 * now push the string arguments:
399 pushs1(macro_getdef(p)->defn); /* defn string */
400 pushs1((char *)macro_name(p)); /* macro name */
401 pushs(ep); /* start next..*/
403 if (l != LPAREN && PARLEV == 0) {
407 if (sp == (int)STACKMAX)
408 errx(1, "internal stack overflow");
409 eval((const char **) mstack+fp+1, 2,
410 CALTYP, TRACESTATUS);
412 ep = PREVEP; /* flush strspace */
413 sp = PREVSP; /* previous sp.. */
414 fp = PREVFP; /* rewind stack...*/
417 } else if (t == EOF) {
418 if (sp > -1 && ilevel <= 0) {
419 warnx( "unexpected end of input, unclosed parenthesis:");
420 dump_stack(paren, PARLEV);
424 break; /* all done thanks.. */
425 release_input(infile+ilevel--);
427 bufbase = bbase[ilevel];
429 } else if (sp < 0) { /* not in a macro at all */
430 reallyputchar(t); /* output directly.. */
438 while (isspace(l = gpbc())) /* skip blank, tab, nl.. */
442 record(paren, PARLEV++);
448 else { /* end of argument list */
451 if (sp == (int)STACKMAX)
452 errx(1, "internal stack overflow");
454 eval((const char **) mstack+fp+1, sp-fp,
455 CALTYP, TRACESTATUS);
457 ep = PREVEP; /* flush strspace */
458 sp = PREVSP; /* previous sp.. */
459 fp = PREVFP; /* rewind stack...*/
465 chrsave(EOS); /* new argument */
466 while (isspace(l = gpbc()))
475 if (LOOK_AHEAD(t, scommt)) {
477 for (cp = scommt; *cp; cp++)
481 if (LOOK_AHEAD(t, ecommt)) {
482 for (cp = ecommt; *cp; cp++)
491 CHRSAVE(t); /* stack the char */
498 * output string directly, without pushing it for reparses.
501 outputstr(const char *s)
511 reallyoutputstr(const char *s)
517 infile[ilevel].synch_lineno++;
518 if (infile[ilevel].synch_lineno !=
519 infile[ilevel].lineno)
531 if (synch_lines && c == '\n') {
532 infile[ilevel].synch_lineno++;
533 if (infile[ilevel].synch_lineno != infile[ilevel].lineno)
539 * build an input token..
540 * consider only those starting with _ or A-Za-z.
543 inspect(int c, char *tp)
546 char *etp = tp+MAXTOK;
551 while ((isalnum(c = gpbc()) || c == '_') && tp < etp)
556 /* token is too long, it won't match anything, but it can still
560 while (isalnum(c = gpbc()) || c == '_') {
570 p = ohash_find(¯os, ohash_qlookupi(¯os, name, (const char **)&tp));
573 if (macro_getdef(p) == NULL)
579 * initkwds - initialise m4 keywords as fast as possible.
580 * This very similar to install, but without certain overheads,
581 * such as calling lookup. Malloc is not used for storing the
582 * keyword strings, since we simply use the static pointers
583 * within keywrds block.
591 for (i = 0; i < (int)MAXKEYS; i++) {
592 type = keywrds[i].ktyp & TYPEMASK;
593 if ((keywrds[i].ktyp & NOARGS) == 0)
595 setup_builtin(keywrds[i].knam, type);
600 record(struct position *t, int lev)
602 if (lev < MAXRECORD) {
603 t[lev].name = CURRENT_NAME;
604 t[lev].line = CURRENT_LINE;
609 dump_stack(struct position *t, int lev)
613 for (i = 0; i < lev; i++) {
614 if (i == MAXRECORD) {
615 fprintf(stderr, " ...\n");
618 fprintf(stderr, " %s at line %lu\n",
619 t[i].name, t[i].line);
627 STACKMAX += STACKMAX/2;
628 mstack = xrealloc(mstack, sizeof(stae) * STACKMAX,
629 "Evaluation stack overflow (%lu)",
630 (unsigned long)STACKMAX);
631 sstack = xrealloc(sstack, STACKMAX,
632 "Evaluation stack overflow (%lu)",
633 (unsigned long)STACKMAX);