2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 static char const copyright[] =
36 "@(#) Copyright (c) 1991, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
41 static char sccsid[] = "@(#)mknodes.c 8.2 (Berkeley) 5/4/95";
44 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
48 * This program reads the nodetypes file and nodes.c.pat file. It generates
49 * the files nodes.h and nodes.c.
58 #define MAXTYPES 50 /* max number of node types */
59 #define MAXFIELDS 20 /* max fields in a structure */
60 #define BUFLEN 100 /* size of character buffers */
63 #define T_NODE 1 /* union node *field */
64 #define T_NODELIST 2 /* struct nodelist *field */
66 #define T_INT 4 /* int field */
67 #define T_OTHER 5 /* other */
68 #define T_TEMP 6 /* don't copy this field */
71 struct field { /* a structure field */
72 char *name; /* name of field */
73 int type; /* type of field */
74 char *decl; /* declaration of field */
78 struct str { /* struct representing a node structure */
79 char *tag; /* structure tag */
80 int nfields; /* number of fields in the structure */
81 struct field field[MAXFIELDS]; /* the fields of the structure */
82 int done; /* set if fully parsed */
86 static int ntypes; /* number of node types */
87 static char *nodename[MAXTYPES]; /* names of the nodes */
88 static struct str *nodestr[MAXTYPES]; /* type of structure used by the node */
89 static int nstr; /* number of structures */
90 static struct str str[MAXTYPES]; /* the structures */
91 static struct str *curstr; /* current structure */
92 static char line[1024];
96 static void parsenode(void);
97 static void parsefield(void);
98 static void output(char *);
99 static void outsizes(FILE *);
100 static void outfunc(FILE *, int);
101 static void indent(int, FILE *);
102 static int nextfield(char *);
103 static void skipbl(void);
104 static int readline(FILE *);
105 static void error(const char *, ...) __printf0like(1, 2) __dead2;
106 static char *savestr(const char *);
110 main(int argc, char *argv[])
115 error("usage: mknodes file");
116 if ((infp = fopen(argv[1], "r")) == NULL)
117 error("Can't open %s: %s", argv[1], strerror(errno));
118 while (readline(infp)) {
119 if (line[0] == ' ' || line[0] == '\t')
121 else if (line[0] != '\0')
138 if (curstr && curstr->nfields > 0)
141 if (! nextfield(tag))
142 error("Tag expected");
144 error("Garbage at end of line");
145 nodename[ntypes] = savestr(name);
146 for (sp = str ; sp < str + nstr ; sp++) {
147 if (strcmp(sp->tag, tag) == 0)
150 if (sp >= str + nstr) {
151 sp->tag = savestr(tag);
156 nodestr[ntypes] = sp;
166 char decl[2 * BUFLEN];
169 if (curstr == NULL || curstr->done)
170 error("No current structure to add field to");
171 if (! nextfield(name))
172 error("No field name");
173 if (! nextfield(type))
174 error("No field type");
175 fp = &curstr->field[curstr->nfields];
176 fp->name = savestr(name);
177 if (strcmp(type, "nodeptr") == 0) {
179 sprintf(decl, "union node *%s", name);
180 } else if (strcmp(type, "nodelist") == 0) {
181 fp->type = T_NODELIST;
182 sprintf(decl, "struct nodelist *%s", name);
183 } else if (strcmp(type, "string") == 0) {
185 sprintf(decl, "char *%s", name);
186 } else if (strcmp(type, "int") == 0) {
188 sprintf(decl, "int %s", name);
189 } else if (strcmp(type, "other") == 0) {
191 } else if (strcmp(type, "temp") == 0) {
194 error("Unknown type %s", type);
196 if (fp->type == T_OTHER || fp->type == T_TEMP) {
198 fp->decl = savestr(linep);
201 error("Garbage at end of line");
202 fp->decl = savestr(decl);
210 * This file was generated by the mknodes program.\n\
225 if ((patfile = fopen(file, "r")) == NULL)
226 error("Can't open %s: %s", file, strerror(errno));
227 if ((hfile = fopen("nodes.h", "w")) == NULL)
228 error("Can't create nodes.h: %s", strerror(errno));
229 if ((cfile = fopen("nodes.c", "w")) == NULL)
230 error("Can't create nodes.c");
231 fputs(writer, hfile);
232 for (i = 0 ; i < ntypes ; i++)
233 fprintf(hfile, "#define %s %d\n", nodename[i], i);
234 fputs("\n\n\n", hfile);
235 for (sp = str ; sp < &str[nstr] ; sp++) {
236 fprintf(hfile, "struct %s {\n", sp->tag);
237 for (i = sp->nfields, fp = sp->field ; --i >= 0 ; fp++) {
238 fprintf(hfile, " %s;\n", fp->decl);
240 fputs("};\n\n\n", hfile);
242 fputs("union node {\n", hfile);
243 fprintf(hfile, " int type;\n");
244 for (sp = str ; sp < &str[nstr] ; sp++) {
245 fprintf(hfile, " struct %s %s;\n", sp->tag, sp->tag);
247 fputs("};\n\n\n", hfile);
248 fputs("struct nodelist {\n", hfile);
249 fputs("\tstruct nodelist *next;\n", hfile);
250 fputs("\tunion node *n;\n", hfile);
251 fputs("};\n\n\n", hfile);
252 fputs("struct funcdef;\n", hfile);
253 fputs("struct funcdef *copyfunc(union node *);\n", hfile);
254 fputs("union node *getfuncnode(struct funcdef *);\n", hfile);
255 fputs("void reffunc(struct funcdef *);\n", hfile);
256 fputs("void unreffunc(struct funcdef *);\n", hfile);
258 error("Can't write to nodes.h");
260 error("Can't close nodes.h");
262 fputs(writer, cfile);
263 while (fgets(line, sizeof line, patfile) != NULL) {
264 for (p = line ; *p == ' ' || *p == '\t' ; p++);
265 if (strcmp(p, "%SIZES\n") == 0)
267 else if (strcmp(p, "%CALCSIZE\n") == 0)
269 else if (strcmp(p, "%COPY\n") == 0)
276 error("Can't write to nodes.c");
278 error("Can't close nodes.c");
284 outsizes(FILE *cfile)
288 fprintf(cfile, "static const short nodesize[%d] = {\n", ntypes);
289 for (i = 0 ; i < ntypes ; i++) {
290 fprintf(cfile, " ALIGN(sizeof (struct %s)),\n", nodestr[i]->tag);
292 fprintf(cfile, "};\n");
297 outfunc(FILE *cfile, int calcsize)
303 fputs(" if (n == NULL)\n", cfile);
305 fputs(" return;\n", cfile);
307 fputs(" return NULL;\n", cfile);
309 fputs(" funcblocksize += nodesize[n->type];\n", cfile);
311 fputs(" new = funcblock;\n", cfile);
312 fputs(" funcblock = (char *)funcblock + nodesize[n->type];\n", cfile);
314 fputs(" switch (n->type) {\n", cfile);
315 for (sp = str ; sp < &str[nstr] ; sp++) {
316 for (i = 0 ; i < ntypes ; i++) {
317 if (nodestr[i] == sp)
318 fprintf(cfile, " case %s:\n", nodename[i]);
320 for (i = sp->nfields ; --i >= 1 ; ) {
326 fprintf(cfile, "calcsize(n->%s.%s);\n",
330 fprintf(cfile, "new->%s.%s = copynode(n->%s.%s);\n",
331 sp->tag, fp->name, sp->tag, fp->name);
337 fprintf(cfile, "sizenodelist(n->%s.%s);\n",
341 fprintf(cfile, "new->%s.%s = copynodelist(n->%s.%s);\n",
342 sp->tag, fp->name, sp->tag, fp->name);
348 fprintf(cfile, "funcstringsize += strlen(n->%s.%s) + 1;\n",
352 fprintf(cfile, "new->%s.%s = nodesavestr(n->%s.%s);\n",
353 sp->tag, fp->name, sp->tag, fp->name);
360 fprintf(cfile, "new->%s.%s = n->%s.%s;\n",
361 sp->tag, fp->name, sp->tag, fp->name);
367 fputs("break;\n", cfile);
369 fputs(" };\n", cfile);
371 fputs(" new->type = n->type;\n", cfile);
376 indent(int amount, FILE *fp)
378 while (amount >= 8) {
382 while (--amount >= 0) {
394 while (*p == ' ' || *p == '\t')
397 while (*p != ' ' && *p != '\t' && *p != '\0')
408 while (*linep == ' ' || *linep == '\t')
418 if (fgets(line, 1024, infp) == NULL)
420 for (p = line ; *p != '#' && *p != '\n' && *p != '\0' ; p++);
421 while (p > line && (p[-1] == ' ' || p[-1] == '\t'))
426 if (p - line > BUFLEN)
427 error("Line too long");
434 error(const char *msg, ...)
439 (void) fprintf(stderr, "line %d: ", linno);
440 (void) vfprintf(stderr, msg, va);
441 (void) fputc('\n', stderr);
451 savestr(const char *s)
455 if ((p = malloc(strlen(s) + 1)) == NULL)
456 error("Out of space");