main.c revision 1.17 1 1.17 gdamore /* $NetBSD: main.c,v 1.17 2006/06/18 05:16:41 gdamore Exp $ */
2 1.9 tls
3 1.1 alm /*-
4 1.5 cgd * Copyright (c) 1992, 1993
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 alm *
7 1.1 alm * This code is derived from software contributed to Berkeley by
8 1.1 alm * Diomidis Spinellis of Imperial College, University of London.
9 1.1 alm *
10 1.1 alm * Redistribution and use in source and binary forms, with or without
11 1.1 alm * modification, are permitted provided that the following conditions
12 1.1 alm * are met:
13 1.1 alm * 1. Redistributions of source code must retain the above copyright
14 1.1 alm * notice, this list of conditions and the following disclaimer.
15 1.1 alm * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 alm * notice, this list of conditions and the following disclaimer in the
17 1.1 alm * documentation and/or other materials provided with the distribution.
18 1.14 agc * 3. Neither the name of the University nor the names of its contributors
19 1.14 agc * may be used to endorse or promote products derived from this software
20 1.14 agc * without specific prior written permission.
21 1.14 agc *
22 1.14 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.14 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.14 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.14 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.14 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.14 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.14 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.14 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.14 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.14 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.14 agc * SUCH DAMAGE.
33 1.14 agc */
34 1.14 agc
35 1.14 agc /*-
36 1.14 agc * Copyright (c) 1992 Diomidis Spinellis.
37 1.14 agc *
38 1.14 agc * This code is derived from software contributed to Berkeley by
39 1.14 agc * Diomidis Spinellis of Imperial College, University of London.
40 1.14 agc *
41 1.14 agc * Redistribution and use in source and binary forms, with or without
42 1.14 agc * modification, are permitted provided that the following conditions
43 1.14 agc * are met:
44 1.14 agc * 1. Redistributions of source code must retain the above copyright
45 1.14 agc * notice, this list of conditions and the following disclaimer.
46 1.14 agc * 2. Redistributions in binary form must reproduce the above copyright
47 1.14 agc * notice, this list of conditions and the following disclaimer in the
48 1.14 agc * documentation and/or other materials provided with the distribution.
49 1.1 alm * 3. All advertising materials mentioning features or use of this software
50 1.1 alm * must display the following acknowledgement:
51 1.1 alm * This product includes software developed by the University of
52 1.1 alm * California, Berkeley and its contributors.
53 1.1 alm * 4. Neither the name of the University nor the names of its contributors
54 1.1 alm * may be used to endorse or promote products derived from this software
55 1.1 alm * without specific prior written permission.
56 1.1 alm *
57 1.1 alm * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
58 1.1 alm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
59 1.1 alm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
60 1.1 alm * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
61 1.1 alm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
62 1.1 alm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
63 1.1 alm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
64 1.1 alm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
65 1.1 alm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
66 1.1 alm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
67 1.1 alm * SUCH DAMAGE.
68 1.1 alm */
69 1.1 alm
70 1.17 gdamore #if HAVE_NBTOOL_CONFIG_H
71 1.17 gdamore #include "nbtool_config.h"
72 1.17 gdamore #endif
73 1.17 gdamore
74 1.10 lukem #include <sys/cdefs.h>
75 1.1 alm #ifndef lint
76 1.10 lukem __COPYRIGHT("@(#) Copyright (c) 1992, 1993\n\
77 1.10 lukem The Regents of the University of California. All rights reserved.\n");
78 1.1 alm #endif /* not lint */
79 1.1 alm
80 1.1 alm #ifndef lint
81 1.10 lukem #if 0
82 1.10 lukem static char sccsid[] = "@(#)main.c 8.2 (Berkeley) 1/3/94";
83 1.10 lukem #else
84 1.17 gdamore __RCSID("$NetBSD: main.c,v 1.17 2006/06/18 05:16:41 gdamore Exp $");
85 1.10 lukem #endif
86 1.1 alm #endif /* not lint */
87 1.1 alm
88 1.1 alm #include <sys/types.h>
89 1.1 alm
90 1.1 alm #include <ctype.h>
91 1.1 alm #include <errno.h>
92 1.1 alm #include <fcntl.h>
93 1.1 alm #include <regex.h>
94 1.1 alm #include <stddef.h>
95 1.1 alm #include <stdio.h>
96 1.1 alm #include <stdlib.h>
97 1.1 alm #include <string.h>
98 1.1 alm #include <unistd.h>
99 1.1 alm
100 1.1 alm #include "defs.h"
101 1.1 alm #include "extern.h"
102 1.1 alm
103 1.1 alm /*
104 1.1 alm * Linked list of units (strings and files) to be compiled
105 1.1 alm */
106 1.1 alm struct s_compunit {
107 1.1 alm struct s_compunit *next;
108 1.1 alm enum e_cut {CU_FILE, CU_STRING} type;
109 1.1 alm char *s; /* Pointer to string or fname */
110 1.1 alm };
111 1.1 alm
112 1.1 alm /*
113 1.1 alm * Linked list pointer to compilation units and pointer to current
114 1.1 alm * next pointer.
115 1.1 alm */
116 1.1 alm static struct s_compunit *script, **cu_nextp = &script;
117 1.1 alm
118 1.1 alm /*
119 1.1 alm * Linked list of files to be processed
120 1.1 alm */
121 1.1 alm struct s_flist {
122 1.1 alm char *fname;
123 1.1 alm struct s_flist *next;
124 1.1 alm };
125 1.1 alm
126 1.1 alm /*
127 1.1 alm * Linked list pointer to files and pointer to current
128 1.1 alm * next pointer.
129 1.1 alm */
130 1.1 alm static struct s_flist *files, **fl_nextp = &files;
131 1.1 alm
132 1.11 atatat int aflag, eflag, nflag, ere;
133 1.1 alm
134 1.1 alm /*
135 1.1 alm * Current file and line number; line numbers restart across compilation
136 1.1 alm * units, but span across input files.
137 1.1 alm */
138 1.1 alm char *fname; /* File name. */
139 1.1 alm u_long linenum;
140 1.1 alm int lastline; /* TRUE on the last line of the last file */
141 1.1 alm
142 1.13 wiz static void add_compunit(enum e_cut, char *);
143 1.13 wiz static void add_file(char *);
144 1.13 wiz int main(int, char **);
145 1.1 alm
146 1.1 alm int
147 1.13 wiz main(int argc, char *argv[])
148 1.1 alm {
149 1.1 alm int c, fflag;
150 1.1 alm
151 1.15 grant setprogname(*argv);
152 1.1 alm fflag = 0;
153 1.11 atatat while ((c = getopt(argc, argv, "ae:f:nE")) != -1)
154 1.1 alm switch (c) {
155 1.1 alm case 'a':
156 1.1 alm aflag = 1;
157 1.1 alm break;
158 1.1 alm case 'e':
159 1.1 alm eflag = 1;
160 1.1 alm add_compunit(CU_STRING, optarg);
161 1.1 alm break;
162 1.1 alm case 'f':
163 1.1 alm fflag = 1;
164 1.1 alm add_compunit(CU_FILE, optarg);
165 1.1 alm break;
166 1.1 alm case 'n':
167 1.1 alm nflag = 1;
168 1.1 alm break;
169 1.11 atatat case 'E':
170 1.11 atatat ere = REG_EXTENDED;
171 1.11 atatat break;
172 1.1 alm default:
173 1.1 alm case '?':
174 1.1 alm (void)fprintf(stderr,
175 1.16 wiz "usage:\t%s [-aEn] script [file ...]\n\t%s [-aEn] [-e script] ... [-f script_file] ... [file ...]\n",
176 1.15 grant getprogname(), getprogname());
177 1.1 alm exit(1);
178 1.1 alm }
179 1.1 alm argc -= optind;
180 1.1 alm argv += optind;
181 1.1 alm
182 1.1 alm /* First usage case; script is the first arg */
183 1.1 alm if (!eflag && !fflag && *argv) {
184 1.1 alm add_compunit(CU_STRING, *argv);
185 1.1 alm argv++;
186 1.1 alm }
187 1.1 alm
188 1.1 alm compile();
189 1.1 alm
190 1.1 alm /* Continue with first and start second usage */
191 1.1 alm if (*argv)
192 1.1 alm for (; *argv; argv++)
193 1.1 alm add_file(*argv);
194 1.1 alm else
195 1.1 alm add_file(NULL);
196 1.1 alm process();
197 1.1 alm cfclose(prog, NULL);
198 1.1 alm if (fclose(stdout))
199 1.1 alm err(FATAL, "stdout: %s", strerror(errno));
200 1.1 alm exit (0);
201 1.1 alm }
202 1.1 alm
203 1.1 alm /*
204 1.1 alm * Like fgets, but go through the chain of compilation units chaining them
205 1.1 alm * together. Empty strings and files are ignored.
206 1.1 alm */
207 1.1 alm char *
208 1.13 wiz cu_fgets(char *buf, int n)
209 1.1 alm {
210 1.1 alm static enum {ST_EOF, ST_FILE, ST_STRING} state = ST_EOF;
211 1.1 alm static FILE *f; /* Current open file */
212 1.1 alm static char *s; /* Current pointer inside string */
213 1.1 alm static char string_ident[30];
214 1.1 alm char *p;
215 1.1 alm
216 1.1 alm again:
217 1.1 alm switch (state) {
218 1.1 alm case ST_EOF:
219 1.1 alm if (script == NULL)
220 1.1 alm return (NULL);
221 1.1 alm linenum = 0;
222 1.1 alm switch (script->type) {
223 1.1 alm case CU_FILE:
224 1.1 alm if ((f = fopen(script->s, "r")) == NULL)
225 1.1 alm err(FATAL,
226 1.1 alm "%s: %s", script->s, strerror(errno));
227 1.1 alm fname = script->s;
228 1.1 alm state = ST_FILE;
229 1.1 alm goto again;
230 1.1 alm case CU_STRING:
231 1.1 alm if ((snprintf(string_ident,
232 1.1 alm sizeof(string_ident), "\"%s\"", script->s)) >=
233 1.1 alm sizeof(string_ident) - 1)
234 1.1 alm (void)strcpy(string_ident +
235 1.1 alm sizeof(string_ident) - 6, " ...\"");
236 1.1 alm fname = string_ident;
237 1.1 alm s = script->s;
238 1.1 alm state = ST_STRING;
239 1.1 alm goto again;
240 1.1 alm }
241 1.1 alm case ST_FILE:
242 1.1 alm if ((p = fgets(buf, n, f)) != NULL) {
243 1.1 alm linenum++;
244 1.1 alm if (linenum == 1 && buf[0] == '#' && buf[1] == 'n')
245 1.1 alm nflag = 1;
246 1.1 alm return (p);
247 1.1 alm }
248 1.1 alm script = script->next;
249 1.1 alm (void)fclose(f);
250 1.1 alm state = ST_EOF;
251 1.1 alm goto again;
252 1.1 alm case ST_STRING:
253 1.1 alm if (linenum == 0 && s[0] == '#' && s[1] == 'n')
254 1.1 alm nflag = 1;
255 1.1 alm p = buf;
256 1.1 alm for (;;) {
257 1.1 alm if (n-- <= 1) {
258 1.1 alm *p = '\0';
259 1.1 alm linenum++;
260 1.1 alm return (buf);
261 1.1 alm }
262 1.1 alm switch (*s) {
263 1.1 alm case '\0':
264 1.1 alm state = ST_EOF;
265 1.1 alm if (s == script->s) {
266 1.1 alm script = script->next;
267 1.1 alm goto again;
268 1.1 alm } else {
269 1.1 alm script = script->next;
270 1.1 alm *p = '\0';
271 1.1 alm linenum++;
272 1.1 alm return (buf);
273 1.1 alm }
274 1.1 alm case '\n':
275 1.1 alm *p++ = '\n';
276 1.1 alm *p = '\0';
277 1.1 alm s++;
278 1.1 alm linenum++;
279 1.1 alm return (buf);
280 1.1 alm default:
281 1.1 alm *p++ = *s++;
282 1.1 alm }
283 1.1 alm }
284 1.1 alm }
285 1.1 alm /* NOTREACHED */
286 1.10 lukem return (NULL);
287 1.1 alm }
288 1.1 alm
289 1.1 alm /*
290 1.1 alm * Like fgets, but go through the list of files chaining them together.
291 1.1 alm * Set len to the length of the line.
292 1.1 alm */
293 1.1 alm int
294 1.13 wiz mf_fgets(SPACE *sp, enum e_spflag spflag)
295 1.1 alm {
296 1.1 alm static FILE *f; /* Current open file */
297 1.1 alm size_t len;
298 1.8 mark char *p;
299 1.8 mark int c;
300 1.1 alm
301 1.1 alm if (f == NULL)
302 1.1 alm /* Advance to first non-empty file */
303 1.1 alm for (;;) {
304 1.1 alm if (files == NULL) {
305 1.1 alm lastline = 1;
306 1.1 alm return (0);
307 1.1 alm }
308 1.1 alm if (files->fname == NULL) {
309 1.1 alm f = stdin;
310 1.1 alm fname = "stdin";
311 1.1 alm } else {
312 1.1 alm fname = files->fname;
313 1.1 alm if ((f = fopen(fname, "r")) == NULL)
314 1.1 alm err(FATAL, "%s: %s",
315 1.1 alm fname, strerror(errno));
316 1.1 alm }
317 1.1 alm if ((c = getc(f)) != EOF) {
318 1.1 alm (void)ungetc(c, f);
319 1.1 alm break;
320 1.1 alm }
321 1.1 alm (void)fclose(f);
322 1.1 alm files = files->next;
323 1.1 alm }
324 1.1 alm
325 1.1 alm if (lastline) {
326 1.1 alm sp->len = 0;
327 1.1 alm return (0);
328 1.1 alm }
329 1.1 alm
330 1.1 alm /*
331 1.5 cgd * Use fgetln so that we can handle essentially infinite input data.
332 1.5 cgd * Can't use the pointer into the stdio buffer as the process space
333 1.5 cgd * because the ungetc() can cause it to move.
334 1.1 alm */
335 1.4 cgd p = fgetln(f, &len);
336 1.1 alm if (ferror(f))
337 1.1 alm err(FATAL, "%s: %s", fname, strerror(errno ? errno : EIO));
338 1.1 alm cspace(sp, p, len, spflag);
339 1.1 alm
340 1.1 alm linenum++;
341 1.1 alm /* Advance to next non-empty file */
342 1.1 alm while ((c = getc(f)) == EOF) {
343 1.1 alm (void)fclose(f);
344 1.1 alm files = files->next;
345 1.1 alm if (files == NULL) {
346 1.1 alm lastline = 1;
347 1.1 alm return (1);
348 1.1 alm }
349 1.1 alm if (files->fname == NULL) {
350 1.1 alm f = stdin;
351 1.1 alm fname = "stdin";
352 1.1 alm } else {
353 1.1 alm fname = files->fname;
354 1.1 alm if ((f = fopen(fname, "r")) == NULL)
355 1.1 alm err(FATAL, "%s: %s", fname, strerror(errno));
356 1.1 alm }
357 1.1 alm }
358 1.1 alm (void)ungetc(c, f);
359 1.1 alm return (1);
360 1.1 alm }
361 1.1 alm
362 1.1 alm /*
363 1.1 alm * Add a compilation unit to the linked list
364 1.1 alm */
365 1.1 alm static void
366 1.13 wiz add_compunit(enum e_cut type, char *s)
367 1.1 alm {
368 1.1 alm struct s_compunit *cu;
369 1.1 alm
370 1.1 alm cu = xmalloc(sizeof(struct s_compunit));
371 1.1 alm cu->type = type;
372 1.1 alm cu->s = s;
373 1.1 alm cu->next = NULL;
374 1.1 alm *cu_nextp = cu;
375 1.1 alm cu_nextp = &cu->next;
376 1.1 alm }
377 1.1 alm
378 1.1 alm /*
379 1.1 alm * Add a file to the linked list
380 1.1 alm */
381 1.1 alm static void
382 1.13 wiz add_file(char *s)
383 1.1 alm {
384 1.1 alm struct s_flist *fp;
385 1.1 alm
386 1.1 alm fp = xmalloc(sizeof(struct s_flist));
387 1.1 alm fp->next = NULL;
388 1.1 alm *fl_nextp = fp;
389 1.1 alm fp->fname = s;
390 1.1 alm fl_nextp = &fp->next;
391 1.1 alm }
392