parse.c revision 1.293 1 1.293 rillig /* $NetBSD: parse.c,v 1.293 2020/09/12 15:21:25 rillig Exp $ */
2 1.15 christos
3 1.1 cgd /*
4 1.27 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.27 christos * The Regents of the University of California. All rights reserved.
6 1.94 agc *
7 1.94 agc * This code is derived from software contributed to Berkeley by
8 1.94 agc * Adam de Boor.
9 1.94 agc *
10 1.94 agc * Redistribution and use in source and binary forms, with or without
11 1.94 agc * modification, are permitted provided that the following conditions
12 1.94 agc * are met:
13 1.94 agc * 1. Redistributions of source code must retain the above copyright
14 1.94 agc * notice, this list of conditions and the following disclaimer.
15 1.94 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.94 agc * notice, this list of conditions and the following disclaimer in the
17 1.94 agc * documentation and/or other materials provided with the distribution.
18 1.94 agc * 3. Neither the name of the University nor the names of its contributors
19 1.94 agc * may be used to endorse or promote products derived from this software
20 1.94 agc * without specific prior written permission.
21 1.94 agc *
22 1.94 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.94 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.94 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.94 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.94 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.94 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.94 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.94 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.94 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.94 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.94 agc * SUCH DAMAGE.
33 1.94 agc */
34 1.94 agc
35 1.94 agc /*
36 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
37 1.1 cgd * All rights reserved.
38 1.1 cgd *
39 1.1 cgd * This code is derived from software contributed to Berkeley by
40 1.1 cgd * Adam de Boor.
41 1.1 cgd *
42 1.1 cgd * Redistribution and use in source and binary forms, with or without
43 1.1 cgd * modification, are permitted provided that the following conditions
44 1.1 cgd * are met:
45 1.1 cgd * 1. Redistributions of source code must retain the above copyright
46 1.1 cgd * notice, this list of conditions and the following disclaimer.
47 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer in the
49 1.1 cgd * documentation and/or other materials provided with the distribution.
50 1.1 cgd * 3. All advertising materials mentioning features or use of this software
51 1.1 cgd * must display the following acknowledgement:
52 1.1 cgd * This product includes software developed by the University of
53 1.1 cgd * California, Berkeley and its contributors.
54 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
55 1.1 cgd * may be used to endorse or promote products derived from this software
56 1.1 cgd * without specific prior written permission.
57 1.1 cgd *
58 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 1.1 cgd * SUCH DAMAGE.
69 1.1 cgd */
70 1.1 cgd
71 1.96 ross #ifndef MAKE_NATIVE
72 1.293 rillig static char rcsid[] = "$NetBSD: parse.c,v 1.293 2020/09/12 15:21:25 rillig Exp $";
73 1.36 lukem #else
74 1.34 christos #include <sys/cdefs.h>
75 1.1 cgd #ifndef lint
76 1.15 christos #if 0
77 1.27 christos static char sccsid[] = "@(#)parse.c 8.3 (Berkeley) 3/19/94";
78 1.15 christos #else
79 1.293 rillig __RCSID("$NetBSD: parse.c,v 1.293 2020/09/12 15:21:25 rillig Exp $");
80 1.15 christos #endif
81 1.1 cgd #endif /* not lint */
82 1.36 lukem #endif
83 1.1 cgd
84 1.1 cgd /*-
85 1.1 cgd * parse.c --
86 1.1 cgd * Functions to parse a makefile.
87 1.1 cgd *
88 1.1 cgd * One function, Parse_Init, must be called before any functions
89 1.1 cgd * in this module are used. After that, the function Parse_File is the
90 1.1 cgd * main entry point and controls most of the other functions in this
91 1.1 cgd * module.
92 1.1 cgd *
93 1.1 cgd * Most important structures are kept in Lsts. Directories for
94 1.123 dsl * the .include "..." function are kept in the 'parseIncPath' Lst, while
95 1.123 dsl * those for the .include <...> are kept in the 'sysIncPath' Lst. The
96 1.1 cgd * targets currently being defined are kept in the 'targets' Lst.
97 1.1 cgd *
98 1.1 cgd * The variables 'fname' and 'lineno' are used to track the name
99 1.1 cgd * of the current file and the line number in that file so that error
100 1.1 cgd * messages can be more meaningful.
101 1.1 cgd *
102 1.1 cgd * Interface:
103 1.1 cgd * Parse_Init Initialization function which must be
104 1.1 cgd * called before anything else in this module
105 1.1 cgd * is used.
106 1.1 cgd *
107 1.9 jtc * Parse_End Cleanup the module
108 1.9 jtc *
109 1.1 cgd * Parse_File Function used to parse a makefile. It must
110 1.1 cgd * be given the name of the file, which should
111 1.1 cgd * already have been opened, and a function
112 1.1 cgd * to call to read a character from the file.
113 1.1 cgd *
114 1.1 cgd * Parse_IsVar Returns TRUE if the given line is a
115 1.1 cgd * variable assignment. Used by MainParseArgs
116 1.1 cgd * to determine if an argument is a target
117 1.1 cgd * or a variable assignment. Used internally
118 1.1 cgd * for pretty much the same thing...
119 1.1 cgd *
120 1.1 cgd * Parse_Error Function called when an error occurs in
121 1.1 cgd * parsing. Used by the variable and
122 1.1 cgd * conditional modules.
123 1.1 cgd * Parse_MainName Returns a Lst of the main target to create.
124 1.1 cgd */
125 1.1 cgd
126 1.170 dholland #include <sys/types.h>
127 1.170 dholland #include <sys/mman.h>
128 1.171 dholland #include <sys/stat.h>
129 1.84 wiz #include <errno.h>
130 1.5 cgd #include <stdarg.h>
131 1.5 cgd #include <stdio.h>
132 1.225 maya #include <stdint.h>
133 1.84 wiz
134 1.177 nakayama #ifndef MAP_FILE
135 1.177 nakayama #define MAP_FILE 0
136 1.177 nakayama #endif
137 1.170 dholland #ifndef MAP_COPY
138 1.170 dholland #define MAP_COPY MAP_PRIVATE
139 1.170 dholland #endif
140 1.170 dholland
141 1.1 cgd #include "make.h"
142 1.5 cgd #include "dir.h"
143 1.5 cgd #include "job.h"
144 1.1 cgd #include "pathnames.h"
145 1.1 cgd
146 1.248 rillig /* types and constants */
147 1.166 dholland
148 1.1 cgd /*
149 1.166 dholland * Structure for a file being read ("included file")
150 1.1 cgd */
151 1.1 cgd typedef struct IFile {
152 1.189 sjg char *fname; /* name of file */
153 1.281 rillig Boolean fromForLoop; /* simulated .include by the .for loop */
154 1.155 dsl int lineno; /* current line number in file */
155 1.155 dsl int first_lineno; /* line number of start of text */
156 1.155 dsl int cond_depth; /* 'if' nesting when file opened */
157 1.210 sjg Boolean depending; /* state of doing_depend on EOF */
158 1.123 dsl char *P_str; /* point to base of string buffer */
159 1.123 dsl char *P_ptr; /* point to next char of string buffer */
160 1.125 dsl char *P_end; /* point to the end of string buffer */
161 1.170 dholland char *(*nextbuf)(void *, size_t *); /* Function to get more data */
162 1.155 dsl void *nextbuf_arg; /* Opaque arg for nextbuf() */
163 1.170 dholland struct loadedfile *lf; /* loadedfile object, if any */
164 1.5 cgd } IFile;
165 1.1 cgd
166 1.82 reinoud
167 1.82 reinoud /*
168 1.166 dholland * These values are returned by ParseEOF to tell Parse_File whether to
169 1.166 dholland * CONTINUE parsing, i.e. it had only reached the end of an include file,
170 1.166 dholland * or if it's DONE.
171 1.82 reinoud */
172 1.166 dholland #define CONTINUE 1
173 1.166 dholland #define DONE 0
174 1.82 reinoud
175 1.166 dholland /*
176 1.166 dholland * Tokens for target attributes
177 1.1 cgd */
178 1.1 cgd typedef enum {
179 1.1 cgd Begin, /* .BEGIN */
180 1.1 cgd Default, /* .DEFAULT */
181 1.215 dholland DeleteOnError, /* .DELETE_ON_ERROR */
182 1.1 cgd End, /* .END */
183 1.162 sjg dotError, /* .ERROR */
184 1.1 cgd Ignore, /* .IGNORE */
185 1.1 cgd Includes, /* .INCLUDES */
186 1.1 cgd Interrupt, /* .INTERRUPT */
187 1.1 cgd Libs, /* .LIBS */
188 1.165 sjg Meta, /* .META */
189 1.1 cgd MFlags, /* .MFLAGS or .MAKEFLAGS */
190 1.1 cgd Main, /* .MAIN and we don't have anything user-specified to
191 1.1 cgd * make */
192 1.5 cgd NoExport, /* .NOEXPORT */
193 1.165 sjg NoMeta, /* .NOMETA */
194 1.165 sjg NoMetaCmp, /* .NOMETA_CMP */
195 1.32 gwr NoPath, /* .NOPATH */
196 1.1 cgd Not, /* Not special */
197 1.75 tv NotParallel, /* .NOTPARALLEL */
198 1.1 cgd Null, /* .NULL */
199 1.75 tv ExObjdir, /* .OBJDIR */
200 1.1 cgd Order, /* .ORDER */
201 1.18 christos Parallel, /* .PARALLEL */
202 1.5 cgd ExPath, /* .PATH */
203 1.22 christos Phony, /* .PHONY */
204 1.48 sjg #ifdef POSIX
205 1.48 sjg Posix, /* .POSIX */
206 1.48 sjg #endif
207 1.1 cgd Precious, /* .PRECIOUS */
208 1.5 cgd ExShell, /* .SHELL */
209 1.1 cgd Silent, /* .SILENT */
210 1.1 cgd SingleShell, /* .SINGLESHELL */
211 1.187 christos Stale, /* .STALE */
212 1.1 cgd Suffixes, /* .SUFFIXES */
213 1.18 christos Wait, /* .WAIT */
214 1.5 cgd Attribute /* Generic attribute */
215 1.1 cgd } ParseSpecial;
216 1.1 cgd
217 1.166 dholland /*
218 1.166 dholland * Other tokens
219 1.166 dholland */
220 1.166 dholland #define LPAREN '('
221 1.166 dholland #define RPAREN ')'
222 1.166 dholland
223 1.166 dholland
224 1.248 rillig /* result data */
225 1.166 dholland
226 1.166 dholland /*
227 1.166 dholland * The main target to create. This is the first target on the first
228 1.166 dholland * dependency line in the first makefile.
229 1.166 dholland */
230 1.166 dholland static GNode *mainNode;
231 1.166 dholland
232 1.248 rillig /* eval state */
233 1.166 dholland
234 1.166 dholland /* targets we're working on */
235 1.166 dholland static Lst targets;
236 1.166 dholland
237 1.166 dholland #ifdef CLEANUP
238 1.166 dholland /* command lines for targets */
239 1.166 dholland static Lst targCmds;
240 1.166 dholland #endif
241 1.166 dholland
242 1.166 dholland /*
243 1.166 dholland * specType contains the SPECial TYPE of the current target. It is
244 1.166 dholland * Not if the target is unspecial. If it *is* special, however, the children
245 1.166 dholland * are linked as children of the parent but not vice versa. This variable is
246 1.166 dholland * set in ParseDoDependency
247 1.166 dholland */
248 1.5 cgd static ParseSpecial specType;
249 1.1 cgd
250 1.1 cgd /*
251 1.152 dsl * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
252 1.1 cgd * seen, then set to each successive source on the line.
253 1.1 cgd */
254 1.1 cgd static GNode *predecessor;
255 1.1 cgd
256 1.248 rillig /* parser state */
257 1.166 dholland
258 1.166 dholland /* true if currently in a dependency line or its commands */
259 1.166 dholland static Boolean inLine;
260 1.166 dholland
261 1.166 dholland /* number of fatal errors */
262 1.166 dholland static int fatals = 0;
263 1.166 dholland
264 1.166 dholland /*
265 1.166 dholland * Variables for doing includes
266 1.166 dholland */
267 1.166 dholland
268 1.166 dholland /* current file being read */
269 1.166 dholland static IFile *curFile;
270 1.166 dholland
271 1.276 rillig /* The current file from the command line (at the bottom of the stack) and
272 1.276 rillig * further up all the files that are currently being read due to nested
273 1.281 rillig * .include or .for directives. */
274 1.276 rillig static Stack /* of *IFile */ includes;
275 1.166 dholland
276 1.166 dholland /* include paths (lists of directories) */
277 1.166 dholland Lst parseIncPath; /* dirs for "..." includes */
278 1.166 dholland Lst sysIncPath; /* dirs for <...> includes */
279 1.166 dholland Lst defIncPath; /* default for sysIncPath */
280 1.166 dholland
281 1.248 rillig /* parser tables */
282 1.166 dholland
283 1.1 cgd /*
284 1.1 cgd * The parseKeywords table is searched using binary search when deciding
285 1.1 cgd * if a target or source is special. The 'spec' field is the ParseSpecial
286 1.1 cgd * type of the keyword ("Not" if the keyword isn't special as a target) while
287 1.1 cgd * the 'op' field is the operator to apply to the list of targets if the
288 1.1 cgd * keyword is used as a source ("0" if the keyword isn't special as a source)
289 1.1 cgd */
290 1.168 dholland static const struct {
291 1.93 christos const char *name; /* Name of keyword */
292 1.1 cgd ParseSpecial spec; /* Type when used as a target */
293 1.1 cgd int op; /* Operator when used as a source */
294 1.1 cgd } parseKeywords[] = {
295 1.1 cgd { ".BEGIN", Begin, 0 },
296 1.1 cgd { ".DEFAULT", Default, 0 },
297 1.215 dholland { ".DELETE_ON_ERROR", DeleteOnError, 0 },
298 1.1 cgd { ".END", End, 0 },
299 1.162 sjg { ".ERROR", dotError, 0 },
300 1.1 cgd { ".EXEC", Attribute, OP_EXEC },
301 1.1 cgd { ".IGNORE", Ignore, OP_IGNORE },
302 1.1 cgd { ".INCLUDES", Includes, 0 },
303 1.1 cgd { ".INTERRUPT", Interrupt, 0 },
304 1.1 cgd { ".INVISIBLE", Attribute, OP_INVISIBLE },
305 1.1 cgd { ".JOIN", Attribute, OP_JOIN },
306 1.1 cgd { ".LIBS", Libs, 0 },
307 1.29 christos { ".MADE", Attribute, OP_MADE },
308 1.1 cgd { ".MAIN", Main, 0 },
309 1.1 cgd { ".MAKE", Attribute, OP_MAKE },
310 1.1 cgd { ".MAKEFLAGS", MFlags, 0 },
311 1.165 sjg { ".META", Meta, OP_META },
312 1.1 cgd { ".MFLAGS", MFlags, 0 },
313 1.165 sjg { ".NOMETA", NoMeta, OP_NOMETA },
314 1.165 sjg { ".NOMETA_CMP", NoMetaCmp, OP_NOMETA_CMP },
315 1.32 gwr { ".NOPATH", NoPath, OP_NOPATH },
316 1.1 cgd { ".NOTMAIN", Attribute, OP_NOTMAIN },
317 1.1 cgd { ".NOTPARALLEL", NotParallel, 0 },
318 1.18 christos { ".NO_PARALLEL", NotParallel, 0 },
319 1.1 cgd { ".NULL", Null, 0 },
320 1.75 tv { ".OBJDIR", ExObjdir, 0 },
321 1.14 ws { ".OPTIONAL", Attribute, OP_OPTIONAL },
322 1.1 cgd { ".ORDER", Order, 0 },
323 1.18 christos { ".PARALLEL", Parallel, 0 },
324 1.5 cgd { ".PATH", ExPath, 0 },
325 1.22 christos { ".PHONY", Phony, OP_PHONY },
326 1.48 sjg #ifdef POSIX
327 1.48 sjg { ".POSIX", Posix, 0 },
328 1.48 sjg #endif
329 1.1 cgd { ".PRECIOUS", Precious, OP_PRECIOUS },
330 1.1 cgd { ".RECURSIVE", Attribute, OP_MAKE },
331 1.5 cgd { ".SHELL", ExShell, 0 },
332 1.1 cgd { ".SILENT", Silent, OP_SILENT },
333 1.1 cgd { ".SINGLESHELL", SingleShell, 0 },
334 1.187 christos { ".STALE", Stale, 0 },
335 1.1 cgd { ".SUFFIXES", Suffixes, 0 },
336 1.1 cgd { ".USE", Attribute, OP_USE },
337 1.71 christos { ".USEBEFORE", Attribute, OP_USEBEFORE },
338 1.18 christos { ".WAIT", Wait, 0 },
339 1.1 cgd };
340 1.1 cgd
341 1.248 rillig /* file loader */
342 1.170 dholland
343 1.170 dholland struct loadedfile {
344 1.170 dholland const char *path; /* name, for error reports */
345 1.170 dholland char *buf; /* contents buffer */
346 1.170 dholland size_t len; /* length of contents */
347 1.170 dholland size_t maplen; /* length of mmap area, or 0 */
348 1.170 dholland Boolean used; /* XXX: have we used the data yet */
349 1.170 dholland };
350 1.170 dholland
351 1.170 dholland static struct loadedfile *
352 1.170 dholland loadedfile_create(const char *path)
353 1.170 dholland {
354 1.170 dholland struct loadedfile *lf;
355 1.170 dholland
356 1.170 dholland lf = bmake_malloc(sizeof(*lf));
357 1.242 rillig lf->path = path == NULL ? "(stdin)" : path;
358 1.170 dholland lf->buf = NULL;
359 1.170 dholland lf->len = 0;
360 1.170 dholland lf->maplen = 0;
361 1.170 dholland lf->used = FALSE;
362 1.170 dholland return lf;
363 1.170 dholland }
364 1.170 dholland
365 1.170 dholland static void
366 1.170 dholland loadedfile_destroy(struct loadedfile *lf)
367 1.170 dholland {
368 1.170 dholland if (lf->buf != NULL) {
369 1.170 dholland if (lf->maplen > 0) {
370 1.170 dholland munmap(lf->buf, lf->maplen);
371 1.170 dholland } else {
372 1.170 dholland free(lf->buf);
373 1.170 dholland }
374 1.170 dholland }
375 1.170 dholland free(lf);
376 1.170 dholland }
377 1.170 dholland
378 1.170 dholland /*
379 1.170 dholland * nextbuf() operation for loadedfile, as needed by the weird and twisted
380 1.170 dholland * logic below. Once that's cleaned up, we can get rid of lf->used...
381 1.170 dholland */
382 1.170 dholland static char *
383 1.170 dholland loadedfile_nextbuf(void *x, size_t *len)
384 1.170 dholland {
385 1.170 dholland struct loadedfile *lf = x;
386 1.170 dholland
387 1.170 dholland if (lf->used) {
388 1.170 dholland return NULL;
389 1.170 dholland }
390 1.170 dholland lf->used = TRUE;
391 1.170 dholland *len = lf->len;
392 1.170 dholland return lf->buf;
393 1.170 dholland }
394 1.170 dholland
395 1.170 dholland /*
396 1.170 dholland * Try to get the size of a file.
397 1.170 dholland */
398 1.272 rillig static Boolean
399 1.170 dholland load_getsize(int fd, size_t *ret)
400 1.170 dholland {
401 1.170 dholland struct stat st;
402 1.170 dholland
403 1.170 dholland if (fstat(fd, &st) < 0) {
404 1.272 rillig return FALSE;
405 1.170 dholland }
406 1.170 dholland
407 1.170 dholland if (!S_ISREG(st.st_mode)) {
408 1.272 rillig return FALSE;
409 1.170 dholland }
410 1.170 dholland
411 1.170 dholland /*
412 1.170 dholland * st_size is an off_t, which is 64 bits signed; *ret is
413 1.170 dholland * size_t, which might be 32 bits unsigned or 64 bits
414 1.170 dholland * unsigned. Rather than being elaborate, just punt on
415 1.170 dholland * files that are more than 2^31 bytes. We should never
416 1.170 dholland * see a makefile that size in practice...
417 1.170 dholland *
418 1.170 dholland * While we're at it reject negative sizes too, just in case.
419 1.170 dholland */
420 1.170 dholland if (st.st_size < 0 || st.st_size > 0x7fffffff) {
421 1.272 rillig return FALSE;
422 1.170 dholland }
423 1.170 dholland
424 1.170 dholland *ret = (size_t) st.st_size;
425 1.272 rillig return TRUE;
426 1.170 dholland }
427 1.170 dholland
428 1.170 dholland /*
429 1.170 dholland * Read in a file.
430 1.170 dholland *
431 1.170 dholland * Until the path search logic can be moved under here instead of
432 1.170 dholland * being in the caller in another source file, we need to have the fd
433 1.170 dholland * passed in already open. Bleh.
434 1.170 dholland *
435 1.170 dholland * If the path is NULL use stdin and (to insure against fd leaks)
436 1.170 dholland * assert that the caller passed in -1.
437 1.170 dholland */
438 1.170 dholland static struct loadedfile *
439 1.170 dholland loadfile(const char *path, int fd)
440 1.170 dholland {
441 1.170 dholland struct loadedfile *lf;
442 1.227 sjg static long pagesize = 0;
443 1.170 dholland ssize_t result;
444 1.170 dholland size_t bufpos;
445 1.170 dholland
446 1.170 dholland lf = loadedfile_create(path);
447 1.170 dholland
448 1.170 dholland if (path == NULL) {
449 1.170 dholland assert(fd == -1);
450 1.170 dholland fd = STDIN_FILENO;
451 1.170 dholland } else {
452 1.170 dholland #if 0 /* notyet */
453 1.170 dholland fd = open(path, O_RDONLY);
454 1.170 dholland if (fd < 0) {
455 1.170 dholland ...
456 1.170 dholland Error("%s: %s", path, strerror(errno));
457 1.170 dholland exit(1);
458 1.170 dholland }
459 1.170 dholland #endif
460 1.170 dholland }
461 1.170 dholland
462 1.272 rillig if (load_getsize(fd, &lf->len)) {
463 1.170 dholland /* found a size, try mmap */
464 1.227 sjg if (pagesize == 0)
465 1.227 sjg pagesize = sysconf(_SC_PAGESIZE);
466 1.170 dholland if (pagesize <= 0) {
467 1.170 dholland pagesize = 0x1000;
468 1.170 dholland }
469 1.170 dholland /* round size up to a page */
470 1.170 dholland lf->maplen = pagesize * ((lf->len + pagesize - 1)/pagesize);
471 1.170 dholland
472 1.170 dholland /*
473 1.170 dholland * XXX hack for dealing with empty files; remove when
474 1.170 dholland * we're no longer limited by interfacing to the old
475 1.170 dholland * logic elsewhere in this file.
476 1.170 dholland */
477 1.170 dholland if (lf->maplen == 0) {
478 1.170 dholland lf->maplen = pagesize;
479 1.170 dholland }
480 1.170 dholland
481 1.170 dholland /*
482 1.170 dholland * FUTURE: remove PROT_WRITE when the parser no longer
483 1.170 dholland * needs to scribble on the input.
484 1.170 dholland */
485 1.170 dholland lf->buf = mmap(NULL, lf->maplen, PROT_READ|PROT_WRITE,
486 1.170 dholland MAP_FILE|MAP_COPY, fd, 0);
487 1.170 dholland if (lf->buf != MAP_FAILED) {
488 1.170 dholland /* succeeded */
489 1.178 dsl if (lf->len == lf->maplen && lf->buf[lf->len - 1] != '\n') {
490 1.220 maya char *b = bmake_malloc(lf->len + 1);
491 1.178 dsl b[lf->len] = '\n';
492 1.178 dsl memcpy(b, lf->buf, lf->len++);
493 1.178 dsl munmap(lf->buf, lf->maplen);
494 1.178 dsl lf->maplen = 0;
495 1.178 dsl lf->buf = b;
496 1.178 dsl }
497 1.170 dholland goto done;
498 1.170 dholland }
499 1.170 dholland }
500 1.170 dholland
501 1.170 dholland /* cannot mmap; load the traditional way */
502 1.170 dholland
503 1.170 dholland lf->maplen = 0;
504 1.170 dholland lf->len = 1024;
505 1.170 dholland lf->buf = bmake_malloc(lf->len);
506 1.170 dholland
507 1.170 dholland bufpos = 0;
508 1.170 dholland while (1) {
509 1.170 dholland assert(bufpos <= lf->len);
510 1.170 dholland if (bufpos == lf->len) {
511 1.221 riastrad if (lf->len > SIZE_MAX/2) {
512 1.221 riastrad errno = EFBIG;
513 1.221 riastrad Error("%s: file too large", path);
514 1.221 riastrad exit(1);
515 1.221 riastrad }
516 1.170 dholland lf->len *= 2;
517 1.170 dholland lf->buf = bmake_realloc(lf->buf, lf->len);
518 1.170 dholland }
519 1.221 riastrad assert(bufpos < lf->len);
520 1.170 dholland result = read(fd, lf->buf + bufpos, lf->len - bufpos);
521 1.170 dholland if (result < 0) {
522 1.170 dholland Error("%s: read error: %s", path, strerror(errno));
523 1.170 dholland exit(1);
524 1.170 dholland }
525 1.170 dholland if (result == 0) {
526 1.170 dholland break;
527 1.170 dholland }
528 1.170 dholland bufpos += result;
529 1.170 dholland }
530 1.170 dholland assert(bufpos <= lf->len);
531 1.173 dholland lf->len = bufpos;
532 1.170 dholland
533 1.170 dholland /* truncate malloc region to actual length (maybe not useful) */
534 1.172 dholland if (lf->len > 0) {
535 1.218 sjg /* as for mmap case, ensure trailing \n */
536 1.218 sjg if (lf->buf[lf->len - 1] != '\n')
537 1.218 sjg lf->len++;
538 1.172 dholland lf->buf = bmake_realloc(lf->buf, lf->len);
539 1.218 sjg lf->buf[lf->len - 1] = '\n';
540 1.172 dholland }
541 1.170 dholland
542 1.170 dholland done:
543 1.170 dholland if (path != NULL) {
544 1.170 dholland close(fd);
545 1.170 dholland }
546 1.170 dholland return lf;
547 1.170 dholland }
548 1.170 dholland
549 1.248 rillig /* old code */
550 1.77 christos
551 1.279 rillig /* Check if the current character is escaped on the current line. */
552 1.279 rillig static Boolean
553 1.84 wiz ParseIsEscaped(const char *line, const char *c)
554 1.77 christos {
555 1.280 rillig Boolean active = FALSE;
556 1.77 christos for (;;) {
557 1.77 christos if (line == c)
558 1.77 christos return active;
559 1.77 christos if (*--c != '\\')
560 1.77 christos return active;
561 1.77 christos active = !active;
562 1.77 christos }
563 1.77 christos }
564 1.77 christos
565 1.278 rillig /* Add the filename and lineno to the GNode so that we remember where it
566 1.278 rillig * was first defined. */
567 1.278 rillig static void
568 1.278 rillig ParseMark(GNode *gn)
569 1.278 rillig {
570 1.278 rillig gn->fname = curFile->fname;
571 1.278 rillig gn->lineno = curFile->lineno;
572 1.278 rillig }
573 1.278 rillig
574 1.1 cgd /*-
575 1.1 cgd *----------------------------------------------------------------------
576 1.1 cgd * ParseFindKeyword --
577 1.1 cgd * Look in the table of keywords for one matching the given string.
578 1.1 cgd *
579 1.84 wiz * Input:
580 1.84 wiz * str String to find
581 1.84 wiz *
582 1.1 cgd * Results:
583 1.1 cgd * The index of the keyword, or -1 if it isn't there.
584 1.1 cgd *
585 1.1 cgd * Side Effects:
586 1.1 cgd * None
587 1.1 cgd *----------------------------------------------------------------------
588 1.1 cgd */
589 1.1 cgd static int
590 1.120 dsl ParseFindKeyword(const char *str)
591 1.1 cgd {
592 1.84 wiz int start, end, cur;
593 1.84 wiz int diff;
594 1.27 christos
595 1.1 cgd start = 0;
596 1.1 cgd end = (sizeof(parseKeywords)/sizeof(parseKeywords[0])) - 1;
597 1.1 cgd
598 1.1 cgd do {
599 1.1 cgd cur = start + ((end - start) / 2);
600 1.103 christos diff = strcmp(str, parseKeywords[cur].name);
601 1.1 cgd
602 1.1 cgd if (diff == 0) {
603 1.235 rillig return cur;
604 1.1 cgd } else if (diff < 0) {
605 1.1 cgd end = cur - 1;
606 1.1 cgd } else {
607 1.1 cgd start = cur + 1;
608 1.1 cgd }
609 1.1 cgd } while (start <= end);
610 1.235 rillig return -1;
611 1.1 cgd }
612 1.1 cgd
613 1.291 rillig static void
614 1.291 rillig PrintLocation(FILE *f, const char *cfname, size_t clineno)
615 1.291 rillig {
616 1.291 rillig char dirbuf[MAXPATHLEN+1];
617 1.291 rillig
618 1.291 rillig (void)fprintf(f, "\"");
619 1.291 rillig if (*cfname != '/' && strcmp(cfname, "(stdin)") != 0) {
620 1.291 rillig char *cp, *cp2;
621 1.291 rillig const char *dir, *fname;
622 1.291 rillig
623 1.291 rillig /*
624 1.291 rillig * Nothing is more annoying than not knowing
625 1.291 rillig * which Makefile is the culprit; we try ${.PARSEDIR}
626 1.291 rillig * and apply realpath(3) if not absolute.
627 1.291 rillig */
628 1.291 rillig dir = Var_Value(".PARSEDIR", VAR_GLOBAL, &cp);
629 1.291 rillig if (dir == NULL)
630 1.291 rillig dir = ".";
631 1.291 rillig if (*dir != '/') {
632 1.291 rillig dir = realpath(dir, dirbuf);
633 1.291 rillig }
634 1.291 rillig fname = Var_Value(".PARSEFILE", VAR_GLOBAL, &cp2);
635 1.291 rillig if (fname == NULL) {
636 1.291 rillig if ((fname = strrchr(cfname, '/')))
637 1.291 rillig fname++;
638 1.291 rillig else
639 1.291 rillig fname = cfname;
640 1.291 rillig }
641 1.291 rillig (void)fprintf(f, "%s/%s", dir, fname);
642 1.291 rillig bmake_free(cp2);
643 1.291 rillig bmake_free(cp);
644 1.291 rillig } else
645 1.291 rillig (void)fprintf(f, "%s", cfname);
646 1.291 rillig
647 1.291 rillig (void)fprintf(f, "\" line %d: ", (int)clineno);
648 1.291 rillig }
649 1.291 rillig
650 1.1 cgd /*-
651 1.38 christos * ParseVErrorInternal --
652 1.1 cgd * Error message abort function for parsing. Prints out the context
653 1.1 cgd * of the error (line number and file) as well as the message with
654 1.1 cgd * two optional arguments.
655 1.1 cgd *
656 1.1 cgd * Results:
657 1.1 cgd * None
658 1.1 cgd *
659 1.1 cgd * Side Effects:
660 1.1 cgd * "fatals" is incremented if the level is PARSE_FATAL.
661 1.1 cgd */
662 1.1 cgd /* VARARGS */
663 1.38 christos static void
664 1.127 dsl ParseVErrorInternal(FILE *f, const char *cfname, size_t clineno, int type,
665 1.122 dsl const char *fmt, va_list ap)
666 1.38 christos {
667 1.56 christos static Boolean fatal_warning_error_printed = FALSE;
668 1.56 christos
669 1.148 sjg (void)fprintf(f, "%s: ", progname);
670 1.63 christos
671 1.291 rillig if (cfname != NULL)
672 1.291 rillig PrintLocation(f, cfname, clineno);
673 1.38 christos if (type == PARSE_WARNING)
674 1.127 dsl (void)fprintf(f, "warning: ");
675 1.127 dsl (void)vfprintf(f, fmt, ap);
676 1.127 dsl (void)fprintf(f, "\n");
677 1.127 dsl (void)fflush(f);
678 1.226 sjg if (type == PARSE_INFO)
679 1.226 sjg return;
680 1.56 christos if (type == PARSE_FATAL || parseWarnFatal)
681 1.38 christos fatals += 1;
682 1.56 christos if (parseWarnFatal && !fatal_warning_error_printed) {
683 1.56 christos Error("parsing warnings being treated as errors");
684 1.56 christos fatal_warning_error_printed = TRUE;
685 1.56 christos }
686 1.38 christos }
687 1.38 christos
688 1.38 christos /*-
689 1.203 joerg * ParseErrorInternal --
690 1.203 joerg * Error function
691 1.203 joerg *
692 1.203 joerg * Results:
693 1.203 joerg * None
694 1.203 joerg *
695 1.203 joerg * Side Effects:
696 1.203 joerg * None
697 1.203 joerg */
698 1.203 joerg /* VARARGS */
699 1.203 joerg static void
700 1.203 joerg ParseErrorInternal(const char *cfname, size_t clineno, int type,
701 1.203 joerg const char *fmt, ...)
702 1.203 joerg {
703 1.203 joerg va_list ap;
704 1.203 joerg
705 1.203 joerg va_start(ap, fmt);
706 1.203 joerg (void)fflush(stdout);
707 1.203 joerg ParseVErrorInternal(stderr, cfname, clineno, type, fmt, ap);
708 1.203 joerg va_end(ap);
709 1.203 joerg
710 1.203 joerg if (debug_file != stderr && debug_file != stdout) {
711 1.203 joerg va_start(ap, fmt);
712 1.203 joerg ParseVErrorInternal(debug_file, cfname, clineno, type, fmt, ap);
713 1.203 joerg va_end(ap);
714 1.203 joerg }
715 1.203 joerg }
716 1.203 joerg
717 1.289 rillig /* External interface to ParseErrorInternal; uses the default filename and
718 1.289 rillig * line number.
719 1.38 christos *
720 1.289 rillig * Fmt is given without a trailing newline. */
721 1.38 christos /* VARARGS */
722 1.1 cgd void
723 1.93 christos Parse_Error(int type, const char *fmt, ...)
724 1.1 cgd {
725 1.1 cgd va_list ap;
726 1.156 dsl const char *fname;
727 1.156 dsl size_t lineno;
728 1.84 wiz
729 1.152 dsl if (curFile == NULL) {
730 1.156 dsl fname = NULL;
731 1.156 dsl lineno = 0;
732 1.156 dsl } else {
733 1.156 dsl fname = curFile->fname;
734 1.156 dsl lineno = curFile->lineno;
735 1.148 sjg }
736 1.156 dsl
737 1.156 dsl va_start(ap, fmt);
738 1.163 sjg (void)fflush(stdout);
739 1.156 dsl ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
740 1.1 cgd va_end(ap);
741 1.127 dsl
742 1.131 dsl if (debug_file != stderr && debug_file != stdout) {
743 1.127 dsl va_start(ap, fmt);
744 1.156 dsl ParseVErrorInternal(debug_file, fname, lineno, type, fmt, ap);
745 1.127 dsl va_end(ap);
746 1.127 dsl }
747 1.1 cgd }
748 1.1 cgd
749 1.161 sjg
750 1.161 sjg /*
751 1.161 sjg * ParseMessage
752 1.161 sjg * Parse a .info .warning or .error directive
753 1.161 sjg *
754 1.161 sjg * The input is the line minus the ".". We substitute
755 1.161 sjg * variables, print the message and exit(1) (for .error) or just print
756 1.161 sjg * a warning if the directive is malformed.
757 1.161 sjg */
758 1.164 sjg static Boolean
759 1.161 sjg ParseMessage(char *line)
760 1.161 sjg {
761 1.161 sjg int mtype;
762 1.164 sjg
763 1.161 sjg switch(*line) {
764 1.161 sjg case 'i':
765 1.226 sjg mtype = PARSE_INFO;
766 1.161 sjg break;
767 1.161 sjg case 'w':
768 1.161 sjg mtype = PARSE_WARNING;
769 1.161 sjg break;
770 1.161 sjg case 'e':
771 1.161 sjg mtype = PARSE_FATAL;
772 1.161 sjg break;
773 1.161 sjg default:
774 1.161 sjg Parse_Error(PARSE_WARNING, "invalid syntax: \".%s\"", line);
775 1.164 sjg return FALSE;
776 1.161 sjg }
777 1.161 sjg
778 1.290 rillig while (ch_isalpha(*line))
779 1.161 sjg line++;
780 1.290 rillig if (!ch_isspace(*line))
781 1.164 sjg return FALSE; /* not for us */
782 1.290 rillig while (ch_isspace(*line))
783 1.161 sjg line++;
784 1.161 sjg
785 1.239 rillig line = Var_Subst(line, VAR_CMD, VARE_WANTRES);
786 1.161 sjg Parse_Error(mtype, "%s", line);
787 1.161 sjg free(line);
788 1.161 sjg
789 1.161 sjg if (mtype == PARSE_FATAL) {
790 1.161 sjg /* Terminate immediately. */
791 1.161 sjg exit(1);
792 1.161 sjg }
793 1.164 sjg return TRUE;
794 1.161 sjg }
795 1.161 sjg
796 1.1 cgd /*-
797 1.1 cgd *---------------------------------------------------------------------
798 1.1 cgd * ParseLinkSrc --
799 1.1 cgd * Link the parent node to its new child. Used in a Lst_ForEach by
800 1.1 cgd * ParseDoDependency. If the specType isn't 'Not', the parent
801 1.1 cgd * isn't linked as a parent of the child.
802 1.1 cgd *
803 1.84 wiz * Input:
804 1.84 wiz * pgnp The parent node
805 1.84 wiz * cgpn The child node
806 1.84 wiz *
807 1.1 cgd * Results:
808 1.1 cgd * Always = 0
809 1.1 cgd *
810 1.1 cgd * Side Effects:
811 1.1 cgd * New elements are added to the parents list of cgn and the
812 1.1 cgd * children list of cgn. the unmade field of pgn is updated
813 1.1 cgd * to reflect the additional child.
814 1.1 cgd *---------------------------------------------------------------------
815 1.1 cgd */
816 1.1 cgd static int
817 1.157 dsl ParseLinkSrc(void *pgnp, void *cgnp)
818 1.1 cgd {
819 1.105 christos GNode *pgn = (GNode *)pgnp;
820 1.105 christos GNode *cgn = (GNode *)cgnp;
821 1.52 mycroft
822 1.268 rillig if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(pgn->cohorts))
823 1.274 rillig pgn = LstNode_Datum(Lst_Last(pgn->cohorts));
824 1.268 rillig Lst_Append(pgn->children, cgn);
825 1.52 mycroft if (specType == Not)
826 1.268 rillig Lst_Append(cgn->parents, pgn);
827 1.52 mycroft pgn->unmade += 1;
828 1.109 dsl if (DEBUG(PARSE)) {
829 1.193 christos fprintf(debug_file, "# %s: added child %s - %s\n", __func__,
830 1.193 christos pgn->name, cgn->name);
831 1.109 dsl Targ_PrintNode(pgn, 0);
832 1.109 dsl Targ_PrintNode(cgn, 0);
833 1.109 dsl }
834 1.235 rillig return 0;
835 1.1 cgd }
836 1.1 cgd
837 1.1 cgd /*-
838 1.1 cgd *---------------------------------------------------------------------
839 1.1 cgd * ParseDoOp --
840 1.1 cgd * Apply the parsed operator to the given target node. Used in a
841 1.1 cgd * Lst_ForEach call by ParseDoDependency once all targets have
842 1.1 cgd * been found and their operator parsed. If the previous and new
843 1.1 cgd * operators are incompatible, a major error is taken.
844 1.1 cgd *
845 1.84 wiz * Input:
846 1.84 wiz * gnp The node to which the operator is to be applied
847 1.84 wiz * opp The operator to apply
848 1.84 wiz *
849 1.1 cgd * Results:
850 1.1 cgd * Always 0
851 1.1 cgd *
852 1.1 cgd * Side Effects:
853 1.1 cgd * The type field of the node is altered to reflect any new bits in
854 1.1 cgd * the op.
855 1.1 cgd *---------------------------------------------------------------------
856 1.1 cgd */
857 1.1 cgd static int
858 1.157 dsl ParseDoOp(void *gnp, void *opp)
859 1.1 cgd {
860 1.105 christos GNode *gn = (GNode *)gnp;
861 1.105 christos int op = *(int *)opp;
862 1.1 cgd /*
863 1.1 cgd * If the dependency mask of the operator and the node don't match and
864 1.1 cgd * the node has actually had an operator applied to it before, and
865 1.27 christos * the operator actually has some dependency information in it, complain.
866 1.1 cgd */
867 1.1 cgd if (((op & OP_OPMASK) != (gn->type & OP_OPMASK)) &&
868 1.1 cgd !OP_NOP(gn->type) && !OP_NOP(op))
869 1.1 cgd {
870 1.97 christos Parse_Error(PARSE_FATAL, "Inconsistent operator for %s", gn->name);
871 1.235 rillig return 1;
872 1.1 cgd }
873 1.1 cgd
874 1.242 rillig if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
875 1.1 cgd /*
876 1.1 cgd * If the node was the object of a :: operator, we need to create a
877 1.1 cgd * new instance of it for the children and commands on this dependency
878 1.1 cgd * line. The new instance is placed on the 'cohorts' list of the
879 1.1 cgd * initial one (note the initial one is not on its own cohorts list)
880 1.1 cgd * and the new instance is linked to all parents of the initial
881 1.1 cgd * instance.
882 1.1 cgd */
883 1.84 wiz GNode *cohort;
884 1.27 christos
885 1.33 mycroft /*
886 1.46 mycroft * Propagate copied bits to the initial node. They'll be propagated
887 1.46 mycroft * back to the rest of the cohorts later.
888 1.33 mycroft */
889 1.46 mycroft gn->type |= op & ~OP_OPMASK;
890 1.33 mycroft
891 1.120 dsl cohort = Targ_FindNode(gn->name, TARG_NOHASH);
892 1.186 christos if (doing_depend)
893 1.186 christos ParseMark(cohort);
894 1.1 cgd /*
895 1.1 cgd * Make the cohort invisible as well to avoid duplicating it into
896 1.1 cgd * other variables. True, parents of this target won't tend to do
897 1.1 cgd * anything with their local variables, but better safe than
898 1.46 mycroft * sorry. (I think this is pointless now, since the relevant list
899 1.46 mycroft * traversals will no longer see this node anyway. -mycroft)
900 1.1 cgd */
901 1.46 mycroft cohort->type = op | OP_INVISIBLE;
902 1.268 rillig Lst_Append(gn->cohorts, cohort);
903 1.83 pk cohort->centurion = gn;
904 1.83 pk gn->unmade_cohorts += 1;
905 1.120 dsl snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
906 1.120 dsl gn->unmade_cohorts);
907 1.46 mycroft } else {
908 1.1 cgd /*
909 1.46 mycroft * We don't want to nuke any previous flags (whatever they were) so we
910 1.46 mycroft * just OR the new operator into the old
911 1.1 cgd */
912 1.46 mycroft gn->type |= op;
913 1.1 cgd }
914 1.33 mycroft
915 1.235 rillig return 0;
916 1.1 cgd }
917 1.1 cgd
918 1.27 christos /*-
919 1.18 christos *---------------------------------------------------------------------
920 1.1 cgd * ParseDoSrc --
921 1.1 cgd * Given the name of a source, figure out if it is an attribute
922 1.1 cgd * and apply it to the targets if it is. Else decide if there is
923 1.1 cgd * some attribute which should be applied *to* the source because
924 1.1 cgd * of some special target and apply it if so. Otherwise, make the
925 1.1 cgd * source be a child of the targets in the list 'targets'
926 1.1 cgd *
927 1.84 wiz * Input:
928 1.84 wiz * tOp operator (if any) from special targets
929 1.84 wiz * src name of the source to handle
930 1.84 wiz *
931 1.1 cgd * Results:
932 1.1 cgd * None
933 1.1 cgd *
934 1.1 cgd * Side Effects:
935 1.1 cgd * Operator bits may be added to the list of targets or to the source.
936 1.1 cgd * The targets may have a new source added to their lists of children.
937 1.1 cgd *---------------------------------------------------------------------
938 1.1 cgd */
939 1.1 cgd static void
940 1.120 dsl ParseDoSrc(int tOp, const char *src)
941 1.1 cgd {
942 1.18 christos GNode *gn = NULL;
943 1.120 dsl static int wait_number = 0;
944 1.120 dsl char wait_src[16];
945 1.1 cgd
946 1.290 rillig if (*src == '.' && ch_isupper(src[1])) {
947 1.1 cgd int keywd = ParseFindKeyword(src);
948 1.1 cgd if (keywd != -1) {
949 1.18 christos int op = parseKeywords[keywd].op;
950 1.18 christos if (op != 0) {
951 1.265 rillig if (targets != NULL)
952 1.268 rillig Lst_ForEach(targets, ParseDoOp, &op);
953 1.18 christos return;
954 1.18 christos }
955 1.18 christos if (parseKeywords[keywd].spec == Wait) {
956 1.120 dsl /*
957 1.120 dsl * We add a .WAIT node in the dependency list.
958 1.120 dsl * After any dynamic dependencies (and filename globbing)
959 1.120 dsl * have happened, it is given a dependency on the each
960 1.120 dsl * previous child back to and previous .WAIT node.
961 1.120 dsl * The next child won't be scheduled until the .WAIT node
962 1.120 dsl * is built.
963 1.120 dsl * We give each .WAIT node a unique name (mainly for diag).
964 1.120 dsl */
965 1.120 dsl snprintf(wait_src, sizeof wait_src, ".WAIT_%u", ++wait_number);
966 1.120 dsl gn = Targ_FindNode(wait_src, TARG_NOHASH);
967 1.186 christos if (doing_depend)
968 1.186 christos ParseMark(gn);
969 1.120 dsl gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
970 1.265 rillig if (targets != NULL)
971 1.268 rillig Lst_ForEach(targets, ParseLinkSrc, gn);
972 1.18 christos return;
973 1.18 christos }
974 1.1 cgd }
975 1.1 cgd }
976 1.18 christos
977 1.18 christos switch (specType) {
978 1.18 christos case Main:
979 1.1 cgd /*
980 1.1 cgd * If we have noted the existence of a .MAIN, it means we need
981 1.1 cgd * to add the sources of said target to the list of things
982 1.1 cgd * to create. The string 'src' is likely to be free, so we
983 1.1 cgd * must make a new copy of it. Note that this will only be
984 1.1 cgd * invoked if the user didn't specify a target on the command
985 1.1 cgd * line. This is to allow #ifmake's to succeed, or something...
986 1.1 cgd */
987 1.268 rillig Lst_Append(create, bmake_strdup(src));
988 1.1 cgd /*
989 1.118 dsl * Add the name to the .TARGETS variable as well, so the user can
990 1.1 cgd * employ that, if desired.
991 1.1 cgd */
992 1.1 cgd Var_Append(".TARGETS", src, VAR_GLOBAL);
993 1.18 christos return;
994 1.18 christos
995 1.18 christos case Order:
996 1.1 cgd /*
997 1.1 cgd * Create proper predecessor/successor links between the previous
998 1.1 cgd * source and the current one.
999 1.1 cgd */
1000 1.1 cgd gn = Targ_FindNode(src, TARG_CREATE);
1001 1.186 christos if (doing_depend)
1002 1.186 christos ParseMark(gn);
1003 1.152 dsl if (predecessor != NULL) {
1004 1.268 rillig Lst_Append(predecessor->order_succ, gn);
1005 1.268 rillig Lst_Append(gn->order_pred, predecessor);
1006 1.109 dsl if (DEBUG(PARSE)) {
1007 1.193 christos fprintf(debug_file, "# %s: added Order dependency %s - %s\n",
1008 1.193 christos __func__, predecessor->name, gn->name);
1009 1.109 dsl Targ_PrintNode(predecessor, 0);
1010 1.109 dsl Targ_PrintNode(gn, 0);
1011 1.109 dsl }
1012 1.1 cgd }
1013 1.1 cgd /*
1014 1.1 cgd * The current source now becomes the predecessor for the next one.
1015 1.1 cgd */
1016 1.1 cgd predecessor = gn;
1017 1.18 christos break;
1018 1.18 christos
1019 1.18 christos default:
1020 1.1 cgd /*
1021 1.1 cgd * If the source is not an attribute, we need to find/create
1022 1.1 cgd * a node for it. After that we can apply any operator to it
1023 1.1 cgd * from a special target or link it to its parents, as
1024 1.1 cgd * appropriate.
1025 1.1 cgd *
1026 1.1 cgd * In the case of a source that was the object of a :: operator,
1027 1.1 cgd * the attribute is applied to all of its instances (as kept in
1028 1.1 cgd * the 'cohorts' list of the node) or all the cohorts are linked
1029 1.1 cgd * to all the targets.
1030 1.1 cgd */
1031 1.118 dsl
1032 1.118 dsl /* Find/create the 'src' node and attach to all targets */
1033 1.97 christos gn = Targ_FindNode(src, TARG_CREATE);
1034 1.186 christos if (doing_depend)
1035 1.186 christos ParseMark(gn);
1036 1.1 cgd if (tOp) {
1037 1.1 cgd gn->type |= tOp;
1038 1.1 cgd } else {
1039 1.265 rillig if (targets != NULL)
1040 1.268 rillig Lst_ForEach(targets, ParseLinkSrc, gn);
1041 1.1 cgd }
1042 1.18 christos break;
1043 1.18 christos }
1044 1.1 cgd }
1045 1.1 cgd
1046 1.1 cgd /*-
1047 1.1 cgd *-----------------------------------------------------------------------
1048 1.1 cgd * ParseFindMain --
1049 1.1 cgd * Find a real target in the list and set it to be the main one.
1050 1.1 cgd * Called by ParseDoDependency when a main target hasn't been found
1051 1.1 cgd * yet.
1052 1.1 cgd *
1053 1.84 wiz * Input:
1054 1.84 wiz * gnp Node to examine
1055 1.84 wiz *
1056 1.1 cgd * Results:
1057 1.1 cgd * 0 if main not found yet, 1 if it is.
1058 1.1 cgd *
1059 1.1 cgd * Side Effects:
1060 1.1 cgd * mainNode is changed and Targ_SetMain is called.
1061 1.1 cgd *
1062 1.1 cgd *-----------------------------------------------------------------------
1063 1.1 cgd */
1064 1.1 cgd static int
1065 1.219 riastrad ParseFindMain(void *gnp, void *dummy MAKE_ATTR_UNUSED)
1066 1.1 cgd {
1067 1.105 christos GNode *gn = (GNode *)gnp;
1068 1.242 rillig if (!(gn->type & OP_NOTARGET)) {
1069 1.1 cgd mainNode = gn;
1070 1.1 cgd Targ_SetMain(gn);
1071 1.219 riastrad return 1;
1072 1.1 cgd } else {
1073 1.219 riastrad return 0;
1074 1.1 cgd }
1075 1.1 cgd }
1076 1.1 cgd
1077 1.1 cgd /*-
1078 1.1 cgd *-----------------------------------------------------------------------
1079 1.1 cgd * ParseAddDir --
1080 1.1 cgd * Front-end for Dir_AddDir to make sure Lst_ForEach keeps going
1081 1.1 cgd *
1082 1.1 cgd * Results:
1083 1.1 cgd * === 0
1084 1.1 cgd *
1085 1.1 cgd * Side Effects:
1086 1.1 cgd * See Dir_AddDir.
1087 1.1 cgd *
1088 1.1 cgd *-----------------------------------------------------------------------
1089 1.1 cgd */
1090 1.1 cgd static int
1091 1.157 dsl ParseAddDir(void *path, void *name)
1092 1.1 cgd {
1093 1.105 christos (void)Dir_AddDir((Lst) path, (char *)name);
1094 1.235 rillig return 0;
1095 1.1 cgd }
1096 1.1 cgd
1097 1.1 cgd /*-
1098 1.1 cgd *-----------------------------------------------------------------------
1099 1.1 cgd * ParseClearPath --
1100 1.1 cgd * Front-end for Dir_ClearPath to make sure Lst_ForEach keeps going
1101 1.1 cgd *
1102 1.1 cgd * Results:
1103 1.1 cgd * === 0
1104 1.1 cgd *
1105 1.1 cgd * Side Effects:
1106 1.1 cgd * See Dir_ClearPath
1107 1.1 cgd *
1108 1.1 cgd *-----------------------------------------------------------------------
1109 1.1 cgd */
1110 1.1 cgd static int
1111 1.219 riastrad ParseClearPath(void *path, void *dummy MAKE_ATTR_UNUSED)
1112 1.1 cgd {
1113 1.9 jtc Dir_ClearPath((Lst) path);
1114 1.219 riastrad return 0;
1115 1.1 cgd }
1116 1.1 cgd
1117 1.1 cgd /*-
1118 1.1 cgd *---------------------------------------------------------------------
1119 1.1 cgd * ParseDoDependency --
1120 1.1 cgd * Parse the dependency line in line.
1121 1.1 cgd *
1122 1.84 wiz * Input:
1123 1.84 wiz * line the line to parse
1124 1.84 wiz *
1125 1.1 cgd * Results:
1126 1.1 cgd * None
1127 1.1 cgd *
1128 1.1 cgd * Side Effects:
1129 1.1 cgd * The nodes of the sources are linked as children to the nodes of the
1130 1.1 cgd * targets. Some nodes may be created.
1131 1.1 cgd *
1132 1.1 cgd * We parse a dependency line by first extracting words from the line and
1133 1.1 cgd * finding nodes in the list of all targets with that name. This is done
1134 1.1 cgd * until a character is encountered which is an operator character. Currently
1135 1.1 cgd * these are only ! and :. At this point the operator is parsed and the
1136 1.1 cgd * pointer into the line advanced until the first source is encountered.
1137 1.1 cgd * The parsed operator is applied to each node in the 'targets' list,
1138 1.1 cgd * which is where the nodes found for the targets are kept, by means of
1139 1.1 cgd * the ParseDoOp function.
1140 1.1 cgd * The sources are read in much the same way as the targets were except
1141 1.1 cgd * that now they are expanded using the wildcarding scheme of the C-Shell
1142 1.1 cgd * and all instances of the resulting words in the list of all targets
1143 1.1 cgd * are found. Each of the resulting nodes is then linked to each of the
1144 1.1 cgd * targets as one of its children.
1145 1.1 cgd * Certain targets are handled specially. These are the ones detailed
1146 1.1 cgd * by the specType variable.
1147 1.1 cgd * The storing of transformation rules is also taken care of here.
1148 1.1 cgd * A target is recognized as a transformation rule by calling
1149 1.1 cgd * Suff_IsTransform. If it is a transformation rule, its node is gotten
1150 1.1 cgd * from the suffix module via Suff_AddTransform rather than the standard
1151 1.1 cgd * Targ_FindNode in the target module.
1152 1.1 cgd *---------------------------------------------------------------------
1153 1.1 cgd */
1154 1.1 cgd static void
1155 1.84 wiz ParseDoDependency(char *line)
1156 1.1 cgd {
1157 1.9 jtc char *cp; /* our current position */
1158 1.98 christos GNode *gn = NULL; /* a general purpose temporary node */
1159 1.9 jtc int op; /* the operator on the line */
1160 1.1 cgd char savec; /* a place to save a character */
1161 1.1 cgd Lst paths; /* List of search paths to alter when parsing
1162 1.1 cgd * a list of .PATH targets */
1163 1.1 cgd int tOp; /* operator from special target */
1164 1.18 christos Lst sources; /* list of archive source names after
1165 1.18 christos * expansion */
1166 1.1 cgd Lst curTargs; /* list of target names to be found and added
1167 1.1 cgd * to the targets list */
1168 1.77 christos char *lstart = line;
1169 1.1 cgd
1170 1.120 dsl if (DEBUG(PARSE))
1171 1.120 dsl fprintf(debug_file, "ParseDoDependency(%s)\n", line);
1172 1.1 cgd tOp = 0;
1173 1.1 cgd
1174 1.1 cgd specType = Not;
1175 1.179 plunky paths = NULL;
1176 1.1 cgd
1177 1.252 rillig curTargs = Lst_Init();
1178 1.27 christos
1179 1.204 dholland /*
1180 1.204 dholland * First, grind through the targets.
1181 1.204 dholland */
1182 1.204 dholland
1183 1.1 cgd do {
1184 1.204 dholland /*
1185 1.204 dholland * Here LINE points to the beginning of the next word, and
1186 1.204 dholland * LSTART points to the actual beginning of the line.
1187 1.204 dholland */
1188 1.204 dholland
1189 1.204 dholland /* Find the end of the next word. */
1190 1.203 joerg for (cp = line; *cp && (ParseIsEscaped(lstart, cp) ||
1191 1.290 rillig !(ch_isspace(*cp) ||
1192 1.287 rillig *cp == '!' || *cp == ':' || *cp == LPAREN));) {
1193 1.1 cgd if (*cp == '$') {
1194 1.1 cgd /*
1195 1.1 cgd * Must be a dynamic source (would have been expanded
1196 1.1 cgd * otherwise), so call the Var module to parse the puppy
1197 1.1 cgd * so we can safely advance beyond it...There should be
1198 1.1 cgd * no errors in this, as they would have been discovered
1199 1.1 cgd * in the initial Var_Subst and we wouldn't be here.
1200 1.1 cgd */
1201 1.287 rillig const char *nested_p = cp;
1202 1.114 christos void *freeIt;
1203 1.1 cgd
1204 1.287 rillig (void)Var_ParsePP(&nested_p, VAR_CMD,
1205 1.287 rillig VARE_UNDEFERR|VARE_WANTRES, &freeIt);
1206 1.209 christos free(freeIt);
1207 1.287 rillig cp += nested_p - cp;
1208 1.287 rillig } else
1209 1.292 rillig cp++;
1210 1.1 cgd }
1211 1.121 dsl
1212 1.204 dholland /*
1213 1.204 dholland * If the word is followed by a left parenthesis, it's the
1214 1.204 dholland * name of an object file inside an archive (ar file).
1215 1.204 dholland */
1216 1.77 christos if (!ParseIsEscaped(lstart, cp) && *cp == LPAREN) {
1217 1.1 cgd /*
1218 1.203 joerg * Archives must be handled specially to make sure the OP_ARCHV
1219 1.203 joerg * flag is set in their 'type' field, for one thing, and because
1220 1.203 joerg * things like "archive(file1.o file2.o file3.o)" are permissible.
1221 1.203 joerg * Arch_ParseArchive will set 'line' to be the first non-blank
1222 1.203 joerg * after the archive-spec. It creates/finds nodes for the members
1223 1.272 rillig * and places them on the given list, returning TRUE if all
1224 1.272 rillig * went well and FALSE if there was an error in the
1225 1.203 joerg * specification. On error, line should remain untouched.
1226 1.1 cgd */
1227 1.264 rillig if (!Arch_ParseArchive(&line, targets, VAR_CMD)) {
1228 1.97 christos Parse_Error(PARSE_FATAL,
1229 1.203 joerg "Error in archive specification: \"%s\"", line);
1230 1.112 christos goto out;
1231 1.203 joerg } else {
1232 1.204 dholland /* Done with this word; on to the next. */
1233 1.213 matthias cp = line;
1234 1.1 cgd continue;
1235 1.203 joerg }
1236 1.1 cgd }
1237 1.27 christos
1238 1.1 cgd if (!*cp) {
1239 1.1 cgd /*
1240 1.204 dholland * We got to the end of the line while we were still
1241 1.204 dholland * looking at targets.
1242 1.204 dholland *
1243 1.1 cgd * Ending a dependency line without an operator is a Bozo
1244 1.65 sommerfe * no-no. As a heuristic, this is also often triggered by
1245 1.65 sommerfe * undetected conflicts from cvs/rcs merges.
1246 1.1 cgd */
1247 1.65 sommerfe if ((strncmp(line, "<<<<<<", 6) == 0) ||
1248 1.65 sommerfe (strncmp(line, "======", 6) == 0) ||
1249 1.65 sommerfe (strncmp(line, ">>>>>>", 6) == 0))
1250 1.97 christos Parse_Error(PARSE_FATAL,
1251 1.67 sommerfe "Makefile appears to contain unresolved cvs/rcs/??? merge conflicts");
1252 1.240 rillig else if (lstart[0] == '.') {
1253 1.240 rillig const char *dirstart = lstart + 1;
1254 1.247 rillig const char *dirend;
1255 1.290 rillig while (ch_isspace(*dirstart))
1256 1.240 rillig dirstart++;
1257 1.247 rillig dirend = dirstart;
1258 1.290 rillig while (ch_isalnum(*dirend) || *dirend == '-')
1259 1.240 rillig dirend++;
1260 1.240 rillig Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
1261 1.240 rillig (int)(dirend - dirstart), dirstart);
1262 1.240 rillig } else
1263 1.241 rillig Parse_Error(PARSE_FATAL, "Need an operator");
1264 1.112 christos goto out;
1265 1.1 cgd }
1266 1.204 dholland
1267 1.204 dholland /* Insert a null terminator. */
1268 1.204 dholland savec = *cp;
1269 1.1 cgd *cp = '\0';
1270 1.118 dsl
1271 1.1 cgd /*
1272 1.204 dholland * Got the word. See if it's a special target and if so set
1273 1.1 cgd * specType to match it.
1274 1.1 cgd */
1275 1.290 rillig if (*line == '.' && ch_isupper(line[1])) {
1276 1.1 cgd /*
1277 1.1 cgd * See if the target is a special target that must have it
1278 1.27 christos * or its sources handled specially.
1279 1.1 cgd */
1280 1.1 cgd int keywd = ParseFindKeyword(line);
1281 1.1 cgd if (keywd != -1) {
1282 1.5 cgd if (specType == ExPath && parseKeywords[keywd].spec != ExPath) {
1283 1.1 cgd Parse_Error(PARSE_FATAL, "Mismatched special targets");
1284 1.112 christos goto out;
1285 1.1 cgd }
1286 1.27 christos
1287 1.1 cgd specType = parseKeywords[keywd].spec;
1288 1.1 cgd tOp = parseKeywords[keywd].op;
1289 1.1 cgd
1290 1.1 cgd /*
1291 1.1 cgd * Certain special targets have special semantics:
1292 1.1 cgd * .PATH Have to set the dirSearchPath
1293 1.1 cgd * variable too
1294 1.1 cgd * .MAIN Its sources are only used if
1295 1.1 cgd * nothing has been specified to
1296 1.1 cgd * create.
1297 1.1 cgd * .DEFAULT Need to create a node to hang
1298 1.1 cgd * commands on, but we don't want
1299 1.1 cgd * it in the graph, nor do we want
1300 1.1 cgd * it to be the Main Target, so we
1301 1.1 cgd * create it, set OP_NOTMAIN and
1302 1.1 cgd * add it to the list, setting
1303 1.1 cgd * DEFAULT to the new node for
1304 1.1 cgd * later use. We claim the node is
1305 1.1 cgd * A transformation rule to make
1306 1.1 cgd * life easier later, when we'll
1307 1.1 cgd * use Make_HandleUse to actually
1308 1.1 cgd * apply the .DEFAULT commands.
1309 1.22 christos * .PHONY The list of targets
1310 1.32 gwr * .NOPATH Don't search for file in the path
1311 1.187 christos * .STALE
1312 1.1 cgd * .BEGIN
1313 1.1 cgd * .END
1314 1.162 sjg * .ERROR
1315 1.215 dholland * .DELETE_ON_ERROR
1316 1.1 cgd * .INTERRUPT Are not to be considered the
1317 1.1 cgd * main target.
1318 1.1 cgd * .NOTPARALLEL Make only one target at a time.
1319 1.1 cgd * .SINGLESHELL Create a shell for each command.
1320 1.152 dsl * .ORDER Must set initial predecessor to NULL
1321 1.1 cgd */
1322 1.1 cgd switch (specType) {
1323 1.187 christos case ExPath:
1324 1.187 christos if (paths == NULL) {
1325 1.252 rillig paths = Lst_Init();
1326 1.187 christos }
1327 1.268 rillig Lst_Append(paths, dirSearchPath);
1328 1.187 christos break;
1329 1.187 christos case Main:
1330 1.268 rillig if (!Lst_IsEmpty(create)) {
1331 1.187 christos specType = Not;
1332 1.187 christos }
1333 1.187 christos break;
1334 1.187 christos case Begin:
1335 1.187 christos case End:
1336 1.187 christos case Stale:
1337 1.187 christos case dotError:
1338 1.187 christos case Interrupt:
1339 1.187 christos gn = Targ_FindNode(line, TARG_CREATE);
1340 1.187 christos if (doing_depend)
1341 1.187 christos ParseMark(gn);
1342 1.187 christos gn->type |= OP_NOTMAIN|OP_SPECIAL;
1343 1.268 rillig Lst_Append(targets, gn);
1344 1.187 christos break;
1345 1.187 christos case Default:
1346 1.187 christos gn = Targ_NewGN(".DEFAULT");
1347 1.187 christos gn->type |= (OP_NOTMAIN|OP_TRANSFORM);
1348 1.268 rillig Lst_Append(targets, gn);
1349 1.187 christos DEFAULT = gn;
1350 1.187 christos break;
1351 1.215 dholland case DeleteOnError:
1352 1.215 dholland deleteOnError = TRUE;
1353 1.215 dholland break;
1354 1.187 christos case NotParallel:
1355 1.187 christos maxJobs = 1;
1356 1.187 christos break;
1357 1.187 christos case SingleShell:
1358 1.187 christos compatMake = TRUE;
1359 1.187 christos break;
1360 1.187 christos case Order:
1361 1.187 christos predecessor = NULL;
1362 1.187 christos break;
1363 1.187 christos default:
1364 1.187 christos break;
1365 1.1 cgd }
1366 1.103 christos } else if (strncmp(line, ".PATH", 5) == 0) {
1367 1.1 cgd /*
1368 1.1 cgd * .PATH<suffix> has to be handled specially.
1369 1.1 cgd * Call on the suffix module to give us a path to
1370 1.1 cgd * modify.
1371 1.1 cgd */
1372 1.1 cgd Lst path;
1373 1.27 christos
1374 1.5 cgd specType = ExPath;
1375 1.97 christos path = Suff_GetPath(&line[5]);
1376 1.152 dsl if (path == NULL) {
1377 1.97 christos Parse_Error(PARSE_FATAL,
1378 1.1 cgd "Suffix '%s' not defined (yet)",
1379 1.1 cgd &line[5]);
1380 1.112 christos goto out;
1381 1.1 cgd } else {
1382 1.179 plunky if (paths == NULL) {
1383 1.252 rillig paths = Lst_Init();
1384 1.1 cgd }
1385 1.268 rillig Lst_Append(paths, path);
1386 1.1 cgd }
1387 1.1 cgd }
1388 1.1 cgd }
1389 1.27 christos
1390 1.1 cgd /*
1391 1.1 cgd * Have word in line. Get or create its node and stick it at
1392 1.27 christos * the end of the targets list
1393 1.1 cgd */
1394 1.242 rillig if (specType == Not && *line != '\0') {
1395 1.1 cgd if (Dir_HasWildcards(line)) {
1396 1.1 cgd /*
1397 1.1 cgd * Targets are to be sought only in the current directory,
1398 1.1 cgd * so create an empty path for the thing. Note we need to
1399 1.1 cgd * use Dir_Destroy in the destruction of the path as the
1400 1.1 cgd * Dir module could have added a directory to the path...
1401 1.1 cgd */
1402 1.252 rillig Lst emptyPath = Lst_Init();
1403 1.27 christos
1404 1.1 cgd Dir_Expand(line, emptyPath, curTargs);
1405 1.27 christos
1406 1.268 rillig Lst_Destroy(emptyPath, Dir_Destroy);
1407 1.1 cgd } else {
1408 1.1 cgd /*
1409 1.1 cgd * No wildcards, but we want to avoid code duplication,
1410 1.1 cgd * so create a list with the word on it.
1411 1.1 cgd */
1412 1.268 rillig Lst_Append(curTargs, line);
1413 1.1 cgd }
1414 1.27 christos
1415 1.204 dholland /* Apply the targets. */
1416 1.204 dholland
1417 1.268 rillig while(!Lst_IsEmpty(curTargs)) {
1418 1.268 rillig char *targName = Lst_Dequeue(curTargs);
1419 1.27 christos
1420 1.203 joerg if (!Suff_IsTransform (targName)) {
1421 1.97 christos gn = Targ_FindNode(targName, TARG_CREATE);
1422 1.1 cgd } else {
1423 1.203 joerg gn = Suff_AddTransform(targName);
1424 1.1 cgd }
1425 1.186 christos if (doing_depend)
1426 1.186 christos ParseMark(gn);
1427 1.27 christos
1428 1.268 rillig Lst_Append(targets, gn);
1429 1.1 cgd }
1430 1.5 cgd } else if (specType == ExPath && *line != '.' && *line != '\0') {
1431 1.1 cgd Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", line);
1432 1.1 cgd }
1433 1.27 christos
1434 1.204 dholland /* Don't need the inserted null terminator any more. */
1435 1.1 cgd *cp = savec;
1436 1.204 dholland
1437 1.1 cgd /*
1438 1.1 cgd * If it is a special type and not .PATH, it's the only target we
1439 1.1 cgd * allow on this line...
1440 1.1 cgd */
1441 1.5 cgd if (specType != Not && specType != ExPath) {
1442 1.115 christos Boolean warning = FALSE;
1443 1.27 christos
1444 1.77 christos while (*cp && (ParseIsEscaped(lstart, cp) ||
1445 1.242 rillig (*cp != '!' && *cp != ':'))) {
1446 1.77 christos if (ParseIsEscaped(lstart, cp) ||
1447 1.77 christos (*cp != ' ' && *cp != '\t')) {
1448 1.115 christos warning = TRUE;
1449 1.1 cgd }
1450 1.1 cgd cp++;
1451 1.1 cgd }
1452 1.115 christos if (warning) {
1453 1.1 cgd Parse_Error(PARSE_WARNING, "Extra target ignored");
1454 1.1 cgd }
1455 1.1 cgd } else {
1456 1.290 rillig while (*cp && ch_isspace(*cp)) {
1457 1.1 cgd cp++;
1458 1.1 cgd }
1459 1.1 cgd }
1460 1.203 joerg line = cp;
1461 1.203 joerg } while (*line && (ParseIsEscaped(lstart, line) ||
1462 1.242 rillig (*line != '!' && *line != ':')));
1463 1.1 cgd
1464 1.1 cgd /*
1465 1.1 cgd * Don't need the list of target names anymore...
1466 1.1 cgd */
1467 1.268 rillig Lst_Free(curTargs);
1468 1.112 christos curTargs = NULL;
1469 1.1 cgd
1470 1.268 rillig if (targets != NULL && !Lst_IsEmpty(targets)) {
1471 1.1 cgd switch(specType) {
1472 1.1 cgd default:
1473 1.1 cgd Parse_Error(PARSE_WARNING, "Special and mundane targets don't mix. Mundane ones ignored");
1474 1.1 cgd break;
1475 1.1 cgd case Default:
1476 1.187 christos case Stale:
1477 1.1 cgd case Begin:
1478 1.1 cgd case End:
1479 1.162 sjg case dotError:
1480 1.1 cgd case Interrupt:
1481 1.1 cgd /*
1482 1.1 cgd * These four create nodes on which to hang commands, so
1483 1.1 cgd * targets shouldn't be empty...
1484 1.1 cgd */
1485 1.1 cgd case Not:
1486 1.1 cgd /*
1487 1.1 cgd * Nothing special here -- targets can be empty if it wants.
1488 1.1 cgd */
1489 1.1 cgd break;
1490 1.1 cgd }
1491 1.1 cgd }
1492 1.1 cgd
1493 1.1 cgd /*
1494 1.1 cgd * Have now parsed all the target names. Must parse the operator next. The
1495 1.1 cgd * result is left in op .
1496 1.1 cgd */
1497 1.1 cgd if (*cp == '!') {
1498 1.1 cgd op = OP_FORCE;
1499 1.1 cgd } else if (*cp == ':') {
1500 1.1 cgd if (cp[1] == ':') {
1501 1.1 cgd op = OP_DOUBLEDEP;
1502 1.1 cgd cp++;
1503 1.1 cgd } else {
1504 1.1 cgd op = OP_DEPENDS;
1505 1.1 cgd }
1506 1.1 cgd } else {
1507 1.159 dsl Parse_Error(PARSE_FATAL, lstart[0] == '.' ? "Unknown directive"
1508 1.159 dsl : "Missing dependency operator");
1509 1.112 christos goto out;
1510 1.1 cgd }
1511 1.1 cgd
1512 1.204 dholland /* Advance beyond the operator */
1513 1.204 dholland cp++;
1514 1.1 cgd
1515 1.204 dholland /*
1516 1.204 dholland * Apply the operator to the target. This is how we remember which
1517 1.204 dholland * operator a target was defined with. It fails if the operator
1518 1.204 dholland * used isn't consistent across all references.
1519 1.204 dholland */
1520 1.265 rillig if (targets != NULL)
1521 1.268 rillig Lst_ForEach(targets, ParseDoOp, &op);
1522 1.1 cgd
1523 1.1 cgd /*
1524 1.204 dholland * Onward to the sources.
1525 1.204 dholland *
1526 1.204 dholland * LINE will now point to the first source word, if any, or the
1527 1.204 dholland * end of the string if not.
1528 1.1 cgd */
1529 1.290 rillig while (*cp && ch_isspace(*cp)) {
1530 1.1 cgd cp++;
1531 1.1 cgd }
1532 1.1 cgd line = cp;
1533 1.1 cgd
1534 1.1 cgd /*
1535 1.1 cgd * Several special targets take different actions if present with no
1536 1.1 cgd * sources:
1537 1.1 cgd * a .SUFFIXES line with no sources clears out all old suffixes
1538 1.1 cgd * a .PRECIOUS line makes all targets precious
1539 1.1 cgd * a .IGNORE line ignores errors for all targets
1540 1.1 cgd * a .SILENT line creates silence when making all targets
1541 1.1 cgd * a .PATH removes all directories from the search path(s).
1542 1.1 cgd */
1543 1.1 cgd if (!*line) {
1544 1.1 cgd switch (specType) {
1545 1.1 cgd case Suffixes:
1546 1.97 christos Suff_ClearSuffixes();
1547 1.1 cgd break;
1548 1.1 cgd case Precious:
1549 1.1 cgd allPrecious = TRUE;
1550 1.1 cgd break;
1551 1.1 cgd case Ignore:
1552 1.1 cgd ignoreErrors = TRUE;
1553 1.1 cgd break;
1554 1.1 cgd case Silent:
1555 1.1 cgd beSilent = TRUE;
1556 1.1 cgd break;
1557 1.5 cgd case ExPath:
1558 1.265 rillig if (paths != NULL)
1559 1.268 rillig Lst_ForEach(paths, ParseClearPath, NULL);
1560 1.85 sjg Dir_SetPATH();
1561 1.1 cgd break;
1562 1.48 sjg #ifdef POSIX
1563 1.246 rillig case Posix:
1564 1.246 rillig Var_Set("%POSIX", "1003.2", VAR_GLOBAL);
1565 1.246 rillig break;
1566 1.48 sjg #endif
1567 1.5 cgd default:
1568 1.5 cgd break;
1569 1.1 cgd }
1570 1.1 cgd } else if (specType == MFlags) {
1571 1.1 cgd /*
1572 1.1 cgd * Call on functions in main.c to deal with these arguments and
1573 1.1 cgd * set the initial character to a null-character so the loop to
1574 1.1 cgd * get sources won't get anything
1575 1.1 cgd */
1576 1.97 christos Main_ParseArgLine(line);
1577 1.1 cgd *line = '\0';
1578 1.5 cgd } else if (specType == ExShell) {
1579 1.272 rillig if (!Job_ParseShell(line)) {
1580 1.97 christos Parse_Error(PARSE_FATAL, "improper shell specification");
1581 1.112 christos goto out;
1582 1.1 cgd }
1583 1.1 cgd *line = '\0';
1584 1.242 rillig } else if (specType == NotParallel || specType == SingleShell ||
1585 1.242 rillig specType == DeleteOnError) {
1586 1.1 cgd *line = '\0';
1587 1.1 cgd }
1588 1.27 christos
1589 1.1 cgd /*
1590 1.27 christos * NOW GO FOR THE SOURCES
1591 1.1 cgd */
1592 1.242 rillig if (specType == Suffixes || specType == ExPath ||
1593 1.242 rillig specType == Includes || specType == Libs ||
1594 1.242 rillig specType == Null || specType == ExObjdir)
1595 1.1 cgd {
1596 1.203 joerg while (*line) {
1597 1.1 cgd /*
1598 1.1 cgd * If the target was one that doesn't take files as its sources
1599 1.1 cgd * but takes something like suffixes, we take each
1600 1.1 cgd * space-separated word on the line as a something and deal
1601 1.1 cgd * with it accordingly.
1602 1.1 cgd *
1603 1.1 cgd * If the target was .SUFFIXES, we take each source as a
1604 1.1 cgd * suffix and add it to the list of suffixes maintained by the
1605 1.203 joerg * Suff module.
1606 1.1 cgd *
1607 1.1 cgd * If the target was a .PATH, we add the source as a directory
1608 1.1 cgd * to search on the search path.
1609 1.1 cgd *
1610 1.1 cgd * If it was .INCLUDES, the source is taken to be the suffix of
1611 1.1 cgd * files which will be #included and whose search path should
1612 1.1 cgd * be present in the .INCLUDES variable.
1613 1.1 cgd *
1614 1.1 cgd * If it was .LIBS, the source is taken to be the suffix of
1615 1.1 cgd * files which are considered libraries and whose search path
1616 1.1 cgd * should be present in the .LIBS variable.
1617 1.1 cgd *
1618 1.1 cgd * If it was .NULL, the source is the suffix to use when a file
1619 1.1 cgd * has no valid suffix.
1620 1.75 tv *
1621 1.75 tv * If it was .OBJDIR, the source is a new definition for .OBJDIR,
1622 1.75 tv * and will cause make to do a new chdir to that path.
1623 1.1 cgd */
1624 1.290 rillig while (*cp && !ch_isspace(*cp)) {
1625 1.1 cgd cp++;
1626 1.203 joerg }
1627 1.1 cgd savec = *cp;
1628 1.1 cgd *cp = '\0';
1629 1.1 cgd switch (specType) {
1630 1.1 cgd case Suffixes:
1631 1.203 joerg Suff_AddSuffix(line, &mainNode);
1632 1.1 cgd break;
1633 1.5 cgd case ExPath:
1634 1.265 rillig if (paths != NULL)
1635 1.268 rillig Lst_ForEach(paths, ParseAddDir, line);
1636 1.1 cgd break;
1637 1.1 cgd case Includes:
1638 1.97 christos Suff_AddInclude(line);
1639 1.1 cgd break;
1640 1.1 cgd case Libs:
1641 1.97 christos Suff_AddLib(line);
1642 1.1 cgd break;
1643 1.1 cgd case Null:
1644 1.97 christos Suff_SetNull(line);
1645 1.75 tv break;
1646 1.75 tv case ExObjdir:
1647 1.216 christos Main_SetObjdir("%s", line);
1648 1.1 cgd break;
1649 1.5 cgd default:
1650 1.5 cgd break;
1651 1.1 cgd }
1652 1.1 cgd *cp = savec;
1653 1.203 joerg if (savec != '\0') {
1654 1.203 joerg cp++;
1655 1.203 joerg }
1656 1.290 rillig while (*cp && ch_isspace(*cp)) {
1657 1.1 cgd cp++;
1658 1.203 joerg }
1659 1.203 joerg line = cp;
1660 1.1 cgd }
1661 1.1 cgd if (paths) {
1662 1.268 rillig Lst_Free(paths);
1663 1.222 riastrad paths = NULL;
1664 1.1 cgd }
1665 1.85 sjg if (specType == ExPath)
1666 1.85 sjg Dir_SetPATH();
1667 1.1 cgd } else {
1668 1.222 riastrad assert(paths == NULL);
1669 1.1 cgd while (*line) {
1670 1.1 cgd /*
1671 1.1 cgd * The targets take real sources, so we must beware of archive
1672 1.1 cgd * specifications (i.e. things with left parentheses in them)
1673 1.1 cgd * and handle them accordingly.
1674 1.1 cgd */
1675 1.290 rillig for (; *cp && !ch_isspace(*cp); cp++) {
1676 1.242 rillig if (*cp == LPAREN && cp > line && cp[-1] != '$') {
1677 1.1 cgd /*
1678 1.1 cgd * Only stop for a left parenthesis if it isn't at the
1679 1.1 cgd * start of a word (that'll be for variable changes
1680 1.1 cgd * later) and isn't preceded by a dollar sign (a dynamic
1681 1.1 cgd * source).
1682 1.1 cgd */
1683 1.1 cgd break;
1684 1.1 cgd }
1685 1.1 cgd }
1686 1.1 cgd
1687 1.77 christos if (*cp == LPAREN) {
1688 1.252 rillig sources = Lst_Init();
1689 1.264 rillig if (!Arch_ParseArchive(&line, sources, VAR_CMD)) {
1690 1.97 christos Parse_Error(PARSE_FATAL,
1691 1.1 cgd "Error in source archive spec \"%s\"", line);
1692 1.112 christos goto out;
1693 1.1 cgd }
1694 1.1 cgd
1695 1.268 rillig while (!Lst_IsEmpty(sources)) {
1696 1.268 rillig gn = Lst_Dequeue(sources);
1697 1.120 dsl ParseDoSrc(tOp, gn->name);
1698 1.1 cgd }
1699 1.268 rillig Lst_Free(sources);
1700 1.1 cgd cp = line;
1701 1.1 cgd } else {
1702 1.1 cgd if (*cp) {
1703 1.1 cgd *cp = '\0';
1704 1.1 cgd cp += 1;
1705 1.1 cgd }
1706 1.1 cgd
1707 1.120 dsl ParseDoSrc(tOp, line);
1708 1.1 cgd }
1709 1.290 rillig while (*cp && ch_isspace(*cp)) {
1710 1.1 cgd cp++;
1711 1.1 cgd }
1712 1.1 cgd line = cp;
1713 1.1 cgd }
1714 1.1 cgd }
1715 1.27 christos
1716 1.265 rillig if (mainNode == NULL && targets != NULL) {
1717 1.1 cgd /*
1718 1.1 cgd * If we have yet to decide on a main target to make, in the
1719 1.1 cgd * absence of any user input, we want the first target on
1720 1.1 cgd * the first dependency line that is actually a real target
1721 1.1 cgd * (i.e. isn't a .USE or .EXEC rule) to be made.
1722 1.1 cgd */
1723 1.268 rillig Lst_ForEach(targets, ParseFindMain, NULL);
1724 1.1 cgd }
1725 1.1 cgd
1726 1.112 christos out:
1727 1.263 rillig if (paths != NULL)
1728 1.268 rillig Lst_Free(paths);
1729 1.263 rillig if (curTargs != NULL)
1730 1.268 rillig Lst_Free(curTargs);
1731 1.1 cgd }
1732 1.1 cgd
1733 1.1 cgd /*-
1734 1.1 cgd *---------------------------------------------------------------------
1735 1.1 cgd * Parse_IsVar --
1736 1.1 cgd * Return TRUE if the passed line is a variable assignment. A variable
1737 1.1 cgd * assignment consists of a single word followed by optional whitespace
1738 1.1 cgd * followed by either a += or an = operator.
1739 1.1 cgd * This function is used both by the Parse_File function and main when
1740 1.1 cgd * parsing the command-line arguments.
1741 1.1 cgd *
1742 1.84 wiz * Input:
1743 1.84 wiz * line the line to check
1744 1.84 wiz *
1745 1.1 cgd * Results:
1746 1.1 cgd * TRUE if it is. FALSE if it ain't
1747 1.1 cgd *
1748 1.1 cgd * Side Effects:
1749 1.1 cgd * none
1750 1.1 cgd *---------------------------------------------------------------------
1751 1.1 cgd */
1752 1.1 cgd Boolean
1753 1.286 rillig Parse_IsVar(const char *line)
1754 1.1 cgd {
1755 1.84 wiz Boolean wasSpace = FALSE; /* set TRUE if found a space */
1756 1.154 dsl char ch;
1757 1.16 christos int level = 0;
1758 1.16 christos #define ISEQOPERATOR(c) \
1759 1.16 christos (((c) == '+') || ((c) == ':') || ((c) == '?') || ((c) == '!'))
1760 1.1 cgd
1761 1.1 cgd /*
1762 1.1 cgd * Skip to variable name
1763 1.1 cgd */
1764 1.242 rillig while (*line == ' ' || *line == '\t')
1765 1.242 rillig line++;
1766 1.1 cgd
1767 1.154 dsl /* Scan for one of the assignment operators outside a variable expansion */
1768 1.154 dsl while ((ch = *line++) != 0) {
1769 1.154 dsl if (ch == '(' || ch == '{') {
1770 1.16 christos level++;
1771 1.154 dsl continue;
1772 1.154 dsl }
1773 1.154 dsl if (ch == ')' || ch == '}') {
1774 1.16 christos level--;
1775 1.154 dsl continue;
1776 1.154 dsl }
1777 1.154 dsl if (level != 0)
1778 1.154 dsl continue;
1779 1.154 dsl while (ch == ' ' || ch == '\t') {
1780 1.154 dsl ch = *line++;
1781 1.154 dsl wasSpace = TRUE;
1782 1.1 cgd }
1783 1.191 sjg #ifdef SUNSHCMD
1784 1.191 sjg if (ch == ':' && strncmp(line, "sh", 2) == 0) {
1785 1.191 sjg line += 2;
1786 1.191 sjg continue;
1787 1.191 sjg }
1788 1.191 sjg #endif
1789 1.154 dsl if (ch == '=')
1790 1.154 dsl return TRUE;
1791 1.154 dsl if (*line == '=' && ISEQOPERATOR(ch))
1792 1.154 dsl return TRUE;
1793 1.154 dsl if (wasSpace)
1794 1.154 dsl return FALSE;
1795 1.154 dsl }
1796 1.1 cgd
1797 1.154 dsl return FALSE;
1798 1.1 cgd }
1799 1.1 cgd
1800 1.1 cgd /*-
1801 1.1 cgd *---------------------------------------------------------------------
1802 1.1 cgd * Parse_DoVar --
1803 1.1 cgd * Take the variable assignment in the passed line and do it in the
1804 1.1 cgd * global context.
1805 1.1 cgd *
1806 1.1 cgd * Note: There is a lexical ambiguity with assignment modifier characters
1807 1.1 cgd * in variable names. This routine interprets the character before the =
1808 1.1 cgd * as a modifier. Therefore, an assignment like
1809 1.1 cgd * C++=/usr/bin/CC
1810 1.1 cgd * is interpreted as "C+ +=" instead of "C++ =".
1811 1.1 cgd *
1812 1.84 wiz * Input:
1813 1.84 wiz * line a line guaranteed to be a variable assignment.
1814 1.84 wiz * This reduces error checks
1815 1.84 wiz * ctxt Context in which to do the assignment
1816 1.84 wiz *
1817 1.1 cgd * Results:
1818 1.1 cgd * none
1819 1.1 cgd *
1820 1.1 cgd * Side Effects:
1821 1.1 cgd * the variable structure of the given variable name is altered in the
1822 1.1 cgd * global context.
1823 1.1 cgd *---------------------------------------------------------------------
1824 1.1 cgd */
1825 1.1 cgd void
1826 1.84 wiz Parse_DoVar(char *line, GNode *ctxt)
1827 1.1 cgd {
1828 1.7 cgd char *cp; /* pointer into line */
1829 1.1 cgd enum {
1830 1.1 cgd VAR_SUBST, VAR_APPEND, VAR_SHELL, VAR_NORMAL
1831 1.1 cgd } type; /* Type of assignment */
1832 1.27 christos char *opc; /* ptr to operator character to
1833 1.1 cgd * null-terminate the variable name */
1834 1.86 sjg Boolean freeCp = FALSE; /* TRUE if cp needs to be freed,
1835 1.86 sjg * i.e. if any variable expansion was
1836 1.86 sjg * performed */
1837 1.153 dsl int depth;
1838 1.1 cgd
1839 1.1 cgd /*
1840 1.1 cgd * Skip to variable name
1841 1.1 cgd */
1842 1.242 rillig while (*line == ' ' || *line == '\t')
1843 1.1 cgd line++;
1844 1.1 cgd
1845 1.1 cgd /*
1846 1.1 cgd * Skip to operator character, nulling out whitespace as we go
1847 1.153 dsl * XXX Rather than counting () and {} we should look for $ and
1848 1.153 dsl * then expand the variable.
1849 1.1 cgd */
1850 1.259 rillig for (depth = 0, cp = line; depth > 0 || *cp != '='; cp++) {
1851 1.153 dsl if (*cp == '(' || *cp == '{') {
1852 1.153 dsl depth++;
1853 1.153 dsl continue;
1854 1.153 dsl }
1855 1.153 dsl if (*cp == ')' || *cp == '}') {
1856 1.153 dsl depth--;
1857 1.153 dsl continue;
1858 1.153 dsl }
1859 1.290 rillig if (depth == 0 && ch_isspace(*cp)) {
1860 1.1 cgd *cp = '\0';
1861 1.1 cgd }
1862 1.1 cgd }
1863 1.1 cgd opc = cp-1; /* operator is the previous character */
1864 1.1 cgd *cp++ = '\0'; /* nuke the = */
1865 1.1 cgd
1866 1.1 cgd /*
1867 1.1 cgd * Check operator type
1868 1.1 cgd */
1869 1.1 cgd switch (*opc) {
1870 1.1 cgd case '+':
1871 1.1 cgd type = VAR_APPEND;
1872 1.1 cgd *opc = '\0';
1873 1.1 cgd break;
1874 1.1 cgd
1875 1.1 cgd case '?':
1876 1.1 cgd /*
1877 1.1 cgd * If the variable already has a value, we don't do anything.
1878 1.1 cgd */
1879 1.1 cgd *opc = '\0';
1880 1.1 cgd if (Var_Exists(line, ctxt)) {
1881 1.1 cgd return;
1882 1.1 cgd } else {
1883 1.1 cgd type = VAR_NORMAL;
1884 1.1 cgd }
1885 1.1 cgd break;
1886 1.1 cgd
1887 1.1 cgd case ':':
1888 1.1 cgd type = VAR_SUBST;
1889 1.1 cgd *opc = '\0';
1890 1.1 cgd break;
1891 1.1 cgd
1892 1.1 cgd case '!':
1893 1.1 cgd type = VAR_SHELL;
1894 1.1 cgd *opc = '\0';
1895 1.1 cgd break;
1896 1.1 cgd
1897 1.1 cgd default:
1898 1.23 christos #ifdef SUNSHCMD
1899 1.39 christos while (opc > line && *opc != ':')
1900 1.39 christos opc--;
1901 1.23 christos
1902 1.23 christos if (strncmp(opc, ":sh", 3) == 0) {
1903 1.23 christos type = VAR_SHELL;
1904 1.23 christos *opc = '\0';
1905 1.23 christos break;
1906 1.23 christos }
1907 1.23 christos #endif
1908 1.1 cgd type = VAR_NORMAL;
1909 1.1 cgd break;
1910 1.1 cgd }
1911 1.1 cgd
1912 1.290 rillig while (ch_isspace(*cp))
1913 1.1 cgd cp++;
1914 1.1 cgd
1915 1.243 sjg if (DEBUG(LINT)) {
1916 1.243 sjg if (type != VAR_SUBST && strchr(cp, '$') != NULL) {
1917 1.243 sjg /* sanity check now */
1918 1.243 sjg char *cp2;
1919 1.243 sjg
1920 1.249 sjg cp2 = Var_Subst(cp, ctxt, VARE_ASSIGN);
1921 1.243 sjg free(cp2);
1922 1.243 sjg }
1923 1.243 sjg }
1924 1.243 sjg
1925 1.1 cgd if (type == VAR_APPEND) {
1926 1.97 christos Var_Append(line, cp, ctxt);
1927 1.1 cgd } else if (type == VAR_SUBST) {
1928 1.1 cgd /*
1929 1.1 cgd * Allow variables in the old value to be undefined, but leave their
1930 1.1 cgd * invocation alone -- this is done by forcing oldVars to be false.
1931 1.1 cgd * XXX: This can cause recursive variables, but that's not hard to do,
1932 1.1 cgd * and this allows someone to do something like
1933 1.1 cgd *
1934 1.1 cgd * CFLAGS = $(.INCLUDES)
1935 1.1 cgd * CFLAGS := -I.. $(CFLAGS)
1936 1.1 cgd *
1937 1.1 cgd * And not get an error.
1938 1.1 cgd */
1939 1.1 cgd Boolean oldOldVars = oldVars;
1940 1.1 cgd
1941 1.1 cgd oldVars = FALSE;
1942 1.42 christos
1943 1.42 christos /*
1944 1.42 christos * make sure that we set the variable the first time to nothing
1945 1.42 christos * so that it gets substituted!
1946 1.42 christos */
1947 1.42 christos if (!Var_Exists(line, ctxt))
1948 1.234 rillig Var_Set(line, "", ctxt);
1949 1.42 christos
1950 1.239 rillig cp = Var_Subst(cp, ctxt, VARE_WANTRES|VARE_ASSIGN);
1951 1.1 cgd oldVars = oldOldVars;
1952 1.86 sjg freeCp = TRUE;
1953 1.1 cgd
1954 1.234 rillig Var_Set(line, cp, ctxt);
1955 1.1 cgd } else if (type == VAR_SHELL) {
1956 1.93 christos char *res;
1957 1.115 christos const char *error;
1958 1.5 cgd
1959 1.23 christos if (strchr(cp, '$') != NULL) {
1960 1.1 cgd /*
1961 1.1 cgd * There's a dollar sign in the command, so perform variable
1962 1.1 cgd * expansion on the whole thing. The resulting string will need
1963 1.238 rillig * freeing when we're done.
1964 1.1 cgd */
1965 1.239 rillig cp = Var_Subst(cp, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES);
1966 1.86 sjg freeCp = TRUE;
1967 1.1 cgd }
1968 1.1 cgd
1969 1.115 christos res = Cmd_Exec(cp, &error);
1970 1.234 rillig Var_Set(line, res, ctxt);
1971 1.23 christos free(res);
1972 1.1 cgd
1973 1.115 christos if (error)
1974 1.115 christos Parse_Error(PARSE_WARNING, error, cp);
1975 1.1 cgd } else {
1976 1.1 cgd /*
1977 1.1 cgd * Normal assignment -- just do it.
1978 1.1 cgd */
1979 1.234 rillig Var_Set(line, cp, ctxt);
1980 1.1 cgd }
1981 1.69 sjg if (strcmp(line, MAKEOVERRIDES) == 0)
1982 1.74 tv Main_ExportMAKEFLAGS(FALSE); /* re-export MAKEFLAGS */
1983 1.85 sjg else if (strcmp(line, ".CURDIR") == 0) {
1984 1.85 sjg /*
1985 1.85 sjg * Somone is being (too?) clever...
1986 1.85 sjg * Let's pretend they know what they are doing and
1987 1.85 sjg * re-initialize the 'cur' Path.
1988 1.85 sjg */
1989 1.85 sjg Dir_InitCur(cp);
1990 1.85 sjg Dir_SetPATH();
1991 1.136 sjg } else if (strcmp(line, MAKE_JOB_PREFIX) == 0) {
1992 1.135 sjg Job_SetPrefix();
1993 1.136 sjg } else if (strcmp(line, MAKE_EXPORTED) == 0) {
1994 1.250 rillig Var_Export(cp, FALSE);
1995 1.85 sjg }
1996 1.86 sjg if (freeCp)
1997 1.86 sjg free(cp);
1998 1.1 cgd }
1999 1.23 christos
2000 1.200 christos
2001 1.203 joerg /*
2002 1.195 christos * ParseMaybeSubMake --
2003 1.195 christos * Scan the command string to see if it a possible submake node
2004 1.195 christos * Input:
2005 1.195 christos * cmd the command to scan
2006 1.195 christos * Results:
2007 1.195 christos * TRUE if the command is possibly a submake, FALSE if not.
2008 1.195 christos */
2009 1.195 christos static Boolean
2010 1.195 christos ParseMaybeSubMake(const char *cmd)
2011 1.195 christos {
2012 1.197 justin size_t i;
2013 1.195 christos static struct {
2014 1.195 christos const char *name;
2015 1.195 christos size_t len;
2016 1.195 christos } vals[] = {
2017 1.195 christos #define MKV(A) { A, sizeof(A) - 1 }
2018 1.195 christos MKV("${MAKE}"),
2019 1.195 christos MKV("${.MAKE}"),
2020 1.195 christos MKV("$(MAKE)"),
2021 1.195 christos MKV("$(.MAKE)"),
2022 1.195 christos MKV("make"),
2023 1.195 christos };
2024 1.198 justin for (i = 0; i < sizeof(vals)/sizeof(vals[0]); i++) {
2025 1.195 christos char *ptr;
2026 1.195 christos if ((ptr = strstr(cmd, vals[i].name)) == NULL)
2027 1.195 christos continue;
2028 1.290 rillig if ((ptr == cmd || !ch_isalnum(ptr[-1]))
2029 1.290 rillig && !ch_isalnum(ptr[vals[i].len]))
2030 1.195 christos return TRUE;
2031 1.195 christos }
2032 1.195 christos return FALSE;
2033 1.195 christos }
2034 1.195 christos
2035 1.1 cgd /*-
2036 1.1 cgd * ParseAddCmd --
2037 1.1 cgd * Lst_ForEach function to add a command line to all targets
2038 1.1 cgd *
2039 1.84 wiz * Input:
2040 1.84 wiz * gnp the node to which the command is to be added
2041 1.84 wiz * cmd the command to add
2042 1.84 wiz *
2043 1.1 cgd * Results:
2044 1.1 cgd * Always 0
2045 1.1 cgd *
2046 1.1 cgd * Side Effects:
2047 1.195 christos * A new element is added to the commands list of the node,
2048 1.195 christos * and the node can be marked as a submake node if the command is
2049 1.195 christos * determined to be that.
2050 1.1 cgd */
2051 1.5 cgd static int
2052 1.157 dsl ParseAddCmd(void *gnp, void *cmd)
2053 1.9 jtc {
2054 1.105 christos GNode *gn = (GNode *)gnp;
2055 1.120 dsl
2056 1.120 dsl /* Add to last (ie current) cohort for :: targets */
2057 1.268 rillig if ((gn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(gn->cohorts))
2058 1.274 rillig gn = LstNode_Datum(Lst_Last(gn->cohorts));
2059 1.120 dsl
2060 1.203 joerg /* if target already supplied, ignore commands */
2061 1.203 joerg if (!(gn->type & OP_HAS_COMMANDS)) {
2062 1.268 rillig Lst_Append(gn->commands, cmd);
2063 1.203 joerg if (ParseMaybeSubMake(cmd))
2064 1.203 joerg gn->type |= OP_SUBMAKE;
2065 1.203 joerg ParseMark(gn);
2066 1.203 joerg } else {
2067 1.203 joerg #ifdef notyet
2068 1.203 joerg /* XXX: We cannot do this until we fix the tree */
2069 1.268 rillig Lst_Append(gn->commands, cmd);
2070 1.203 joerg Parse_Error(PARSE_WARNING,
2071 1.203 joerg "overriding commands for target \"%s\"; "
2072 1.203 joerg "previous commands defined at %s: %d ignored",
2073 1.203 joerg gn->name, gn->fname, gn->lineno);
2074 1.203 joerg #else
2075 1.203 joerg Parse_Error(PARSE_WARNING,
2076 1.203 joerg "duplicate script for target \"%s\" ignored",
2077 1.203 joerg gn->name);
2078 1.203 joerg ParseErrorInternal(gn->fname, gn->lineno, PARSE_WARNING,
2079 1.203 joerg "using previous script for \"%s\" defined here",
2080 1.203 joerg gn->name);
2081 1.203 joerg #endif
2082 1.200 christos }
2083 1.235 rillig return 0;
2084 1.1 cgd }
2085 1.1 cgd
2086 1.284 rillig /* Callback procedure for Parse_File when destroying the list of targets on
2087 1.284 rillig * the last dependency line. Marks a target as already having commands if it
2088 1.284 rillig * does, to keep from having shell commands on multiple dependency lines. */
2089 1.9 jtc static void
2090 1.157 dsl ParseHasCommands(void *gnp)
2091 1.1 cgd {
2092 1.105 christos GNode *gn = (GNode *)gnp;
2093 1.268 rillig if (!Lst_IsEmpty(gn->commands)) {
2094 1.1 cgd gn->type |= OP_HAS_COMMANDS;
2095 1.1 cgd }
2096 1.1 cgd }
2097 1.1 cgd
2098 1.284 rillig /* Add a directory to the path searched for included makefiles bracketed
2099 1.284 rillig * by double-quotes. */
2100 1.1 cgd void
2101 1.84 wiz Parse_AddIncludeDir(char *dir)
2102 1.1 cgd {
2103 1.103 christos (void)Dir_AddDir(parseIncPath, dir);
2104 1.1 cgd }
2105 1.1 cgd
2106 1.284 rillig /* Push to another file.
2107 1.1 cgd *
2108 1.284 rillig * The input is the line minus the '.'. A file spec is a string enclosed in
2109 1.284 rillig * <> or "". The <> file is looked for only in sysIncPath. The "" file is
2110 1.284 rillig * first searched in the parsedir and then in the directories specified by
2111 1.284 rillig * the -I command line options.
2112 1.1 cgd */
2113 1.1 cgd static void
2114 1.210 sjg Parse_include_file(char *file, Boolean isSystem, Boolean depinc, int silent)
2115 1.1 cgd {
2116 1.170 dholland struct loadedfile *lf;
2117 1.1 cgd char *fullname; /* full pathname of file */
2118 1.140 dsl char *newName;
2119 1.140 dsl char *prefEnd, *incdir;
2120 1.125 dsl int fd;
2121 1.140 dsl int i;
2122 1.1 cgd
2123 1.1 cgd /*
2124 1.1 cgd * Now we know the file's name and its search path, we attempt to
2125 1.1 cgd * find the durn thing. A return of NULL indicates the file don't
2126 1.1 cgd * exist.
2127 1.1 cgd */
2128 1.147 joerg fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
2129 1.76 reinoud
2130 1.140 dsl if (fullname == NULL && !isSystem) {
2131 1.1 cgd /*
2132 1.1 cgd * Include files contained in double-quotes are first searched for
2133 1.1 cgd * relative to the including file's location. We don't want to
2134 1.1 cgd * cd there, of course, so we just tack on the old file's
2135 1.1 cgd * leading path components and call Dir_FindFile to see if
2136 1.1 cgd * we can locate the beast.
2137 1.1 cgd */
2138 1.1 cgd
2139 1.147 joerg incdir = bmake_strdup(curFile->fname);
2140 1.140 dsl prefEnd = strrchr(incdir, '/');
2141 1.105 christos if (prefEnd != NULL) {
2142 1.1 cgd *prefEnd = '\0';
2143 1.140 dsl /* Now do lexical processing of leading "../" on the filename */
2144 1.140 dsl for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
2145 1.140 dsl prefEnd = strrchr(incdir + 1, '/');
2146 1.140 dsl if (prefEnd == NULL || strcmp(prefEnd, "/..") == 0)
2147 1.140 dsl break;
2148 1.140 dsl *prefEnd = '\0';
2149 1.140 dsl }
2150 1.251 rillig newName = str_concat3(incdir, "/", file + i);
2151 1.97 christos fullname = Dir_FindFile(newName, parseIncPath);
2152 1.140 dsl if (fullname == NULL)
2153 1.1 cgd fullname = Dir_FindFile(newName, dirSearchPath);
2154 1.103 christos free(newName);
2155 1.1 cgd }
2156 1.140 dsl free(incdir);
2157 1.140 dsl
2158 1.142 sjg if (fullname == NULL) {
2159 1.76 reinoud /*
2160 1.246 rillig * Makefile wasn't found in same directory as included makefile.
2161 1.76 reinoud * Search for it first on the -I search path,
2162 1.76 reinoud * then on the .PATH search path, if not found in a -I directory.
2163 1.142 sjg * If we have a suffix specific path we should use that.
2164 1.76 reinoud */
2165 1.142 sjg char *suff;
2166 1.152 dsl Lst suffPath = NULL;
2167 1.142 sjg
2168 1.145 christos if ((suff = strrchr(file, '.'))) {
2169 1.142 sjg suffPath = Suff_GetPath(suff);
2170 1.152 dsl if (suffPath != NULL) {
2171 1.142 sjg fullname = Dir_FindFile(file, suffPath);
2172 1.142 sjg }
2173 1.142 sjg }
2174 1.105 christos if (fullname == NULL) {
2175 1.142 sjg fullname = Dir_FindFile(file, parseIncPath);
2176 1.142 sjg if (fullname == NULL) {
2177 1.142 sjg fullname = Dir_FindFile(file, dirSearchPath);
2178 1.142 sjg }
2179 1.76 reinoud }
2180 1.142 sjg }
2181 1.1 cgd }
2182 1.1 cgd
2183 1.76 reinoud /* Looking for a system file or file still not found */
2184 1.105 christos if (fullname == NULL) {
2185 1.1 cgd /*
2186 1.76 reinoud * Look for it on the system path
2187 1.1 cgd */
2188 1.123 dsl fullname = Dir_FindFile(file,
2189 1.268 rillig Lst_IsEmpty(sysIncPath) ? defIncPath : sysIncPath);
2190 1.1 cgd }
2191 1.1 cgd
2192 1.105 christos if (fullname == NULL) {
2193 1.38 christos if (!silent)
2194 1.97 christos Parse_Error(PARSE_FATAL, "Could not find %s", file);
2195 1.1 cgd return;
2196 1.1 cgd }
2197 1.1 cgd
2198 1.125 dsl /* Actually open the file... */
2199 1.125 dsl fd = open(fullname, O_RDONLY);
2200 1.125 dsl if (fd == -1) {
2201 1.38 christos if (!silent)
2202 1.97 christos Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
2203 1.140 dsl free(fullname);
2204 1.125 dsl return;
2205 1.123 dsl }
2206 1.125 dsl
2207 1.170 dholland /* load it */
2208 1.170 dholland lf = loadfile(fullname, fd);
2209 1.170 dholland
2210 1.125 dsl /* Start reading from this file next */
2211 1.170 dholland Parse_SetInput(fullname, 0, -1, loadedfile_nextbuf, lf);
2212 1.170 dholland curFile->lf = lf;
2213 1.210 sjg if (depinc)
2214 1.210 sjg doing_depend = depinc; /* only turn it on */
2215 1.123 dsl }
2216 1.123 dsl
2217 1.123 dsl static void
2218 1.123 dsl ParseDoInclude(char *line)
2219 1.123 dsl {
2220 1.123 dsl char endc; /* the character which ends the file spec */
2221 1.123 dsl char *cp; /* current position in file spec */
2222 1.242 rillig int silent = *line != 'i';
2223 1.123 dsl char *file = &line[7 + silent];
2224 1.123 dsl
2225 1.123 dsl /* Skip to delimiter character so we know where to look */
2226 1.123 dsl while (*file == ' ' || *file == '\t')
2227 1.123 dsl file++;
2228 1.123 dsl
2229 1.123 dsl if (*file != '"' && *file != '<') {
2230 1.123 dsl Parse_Error(PARSE_FATAL,
2231 1.123 dsl ".include filename must be delimited by '\"' or '<'");
2232 1.123 dsl return;
2233 1.123 dsl }
2234 1.123 dsl
2235 1.123 dsl /*
2236 1.123 dsl * Set the search path on which to find the include file based on the
2237 1.123 dsl * characters which bracket its name. Angle-brackets imply it's
2238 1.123 dsl * a system Makefile while double-quotes imply it's a user makefile
2239 1.123 dsl */
2240 1.123 dsl if (*file == '<') {
2241 1.123 dsl endc = '>';
2242 1.123 dsl } else {
2243 1.123 dsl endc = '"';
2244 1.123 dsl }
2245 1.123 dsl
2246 1.123 dsl /* Skip to matching delimiter */
2247 1.123 dsl for (cp = ++file; *cp && *cp != endc; cp++)
2248 1.123 dsl continue;
2249 1.123 dsl
2250 1.123 dsl if (*cp != endc) {
2251 1.123 dsl Parse_Error(PARSE_FATAL,
2252 1.123 dsl "Unclosed %cinclude filename. '%c' expected",
2253 1.123 dsl '.', endc);
2254 1.123 dsl return;
2255 1.1 cgd }
2256 1.123 dsl *cp = '\0';
2257 1.123 dsl
2258 1.123 dsl /*
2259 1.123 dsl * Substitute for any variables in the file name before trying to
2260 1.123 dsl * find the thing.
2261 1.123 dsl */
2262 1.239 rillig file = Var_Subst(file, VAR_CMD, VARE_WANTRES);
2263 1.123 dsl
2264 1.242 rillig Parse_include_file(file, endc == '>', *line == 'd', silent);
2265 1.123 dsl free(file);
2266 1.1 cgd }
2267 1.1 cgd
2268 1.281 rillig /* Split filename into dirname + basename, then assign these to the
2269 1.281 rillig * given variables. */
2270 1.193 christos static void
2271 1.281 rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
2272 1.193 christos {
2273 1.281 rillig const char *slash, *dirname, *basename;
2274 1.281 rillig void *freeIt;
2275 1.281 rillig
2276 1.281 rillig slash = strrchr(filename, '/');
2277 1.281 rillig if (slash == NULL) {
2278 1.281 rillig dirname = curdir;
2279 1.281 rillig basename = filename;
2280 1.281 rillig freeIt = NULL;
2281 1.281 rillig } else {
2282 1.281 rillig dirname = freeIt = bmake_strsedup(filename, slash);
2283 1.281 rillig basename = slash + 1;
2284 1.281 rillig }
2285 1.193 christos
2286 1.281 rillig Var_Set(dirvar, dirname, VAR_GLOBAL);
2287 1.281 rillig Var_Set(filevar, basename, VAR_GLOBAL);
2288 1.193 christos
2289 1.193 christos if (DEBUG(PARSE))
2290 1.281 rillig fprintf(debug_file, "%s: ${%s} = `%s' ${%s} = `%s'\n",
2291 1.281 rillig __func__, dirvar, dirname, filevar, basename);
2292 1.281 rillig free(freeIt);
2293 1.281 rillig }
2294 1.281 rillig
2295 1.281 rillig /* Return the immediately including file.
2296 1.281 rillig *
2297 1.281 rillig * This is made complicated since the .for loop is implemented as a special
2298 1.281 rillig * kind of .include; see For_Run. */
2299 1.281 rillig static const char *
2300 1.281 rillig GetActuallyIncludingFile(void)
2301 1.281 rillig {
2302 1.281 rillig size_t i;
2303 1.193 christos
2304 1.281 rillig /* XXX: Stack was supposed to be an opaque data structure. */
2305 1.282 rillig for (i = includes.len; i > 0; i--) {
2306 1.282 rillig IFile *parent = includes.items[i - 1];
2307 1.284 rillig IFile *child = i < includes.len ? includes.items[i] : curFile;
2308 1.281 rillig if (!child->fromForLoop)
2309 1.282 rillig return parent->fname;
2310 1.281 rillig }
2311 1.282 rillig return NULL;
2312 1.193 christos }
2313 1.281 rillig
2314 1.285 rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
2315 1.44 aidan static void
2316 1.122 dsl ParseSetParseFile(const char *filename)
2317 1.44 aidan {
2318 1.281 rillig const char *including;
2319 1.44 aidan
2320 1.281 rillig SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
2321 1.281 rillig
2322 1.281 rillig including = GetActuallyIncludingFile();
2323 1.281 rillig if (including != NULL) {
2324 1.281 rillig SetFilenameVars(including,
2325 1.281 rillig ".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
2326 1.44 aidan } else {
2327 1.281 rillig Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
2328 1.281 rillig Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
2329 1.44 aidan }
2330 1.44 aidan }
2331 1.44 aidan
2332 1.284 rillig /* Track the makefiles we read - so makefiles can set dependencies on them.
2333 1.284 rillig * Avoid adding anything more than once. */
2334 1.184 sjg static void
2335 1.184 sjg ParseTrackInput(const char *name)
2336 1.184 sjg {
2337 1.184 sjg char *fp = NULL;
2338 1.236 rillig
2339 1.244 rillig const char *old = Var_Value(MAKE_MAKEFILES, VAR_GLOBAL, &fp);
2340 1.184 sjg if (old) {
2341 1.244 rillig size_t name_len = strlen(name);
2342 1.244 rillig const char *ep = old + strlen(old) - name_len;
2343 1.184 sjg /* does it contain name? */
2344 1.184 sjg for (; old != NULL; old = strchr(old, ' ')) {
2345 1.184 sjg if (*old == ' ')
2346 1.184 sjg old++;
2347 1.206 sjg if (old >= ep)
2348 1.206 sjg break; /* cannot contain name */
2349 1.184 sjg if (memcmp(old, name, name_len) == 0
2350 1.184 sjg && (old[name_len] == 0 || old[name_len] == ' '))
2351 1.184 sjg goto cleanup;
2352 1.184 sjg }
2353 1.184 sjg }
2354 1.184 sjg Var_Append (MAKE_MAKEFILES, name, VAR_GLOBAL);
2355 1.184 sjg cleanup:
2356 1.245 rillig bmake_free(fp);
2357 1.184 sjg }
2358 1.137 sjg
2359 1.44 aidan
2360 1.276 rillig /* Start Parsing from the given source.
2361 1.5 cgd *
2362 1.276 rillig * The given file is added to the includes stack. */
2363 1.5 cgd void
2364 1.170 dholland Parse_SetInput(const char *name, int line, int fd,
2365 1.170 dholland char *(*nextbuf)(void *, size_t *), void *arg)
2366 1.5 cgd {
2367 1.155 dsl char *buf;
2368 1.170 dholland size_t len;
2369 1.281 rillig Boolean fromForLoop = name == NULL;
2370 1.155 dsl
2371 1.281 rillig if (fromForLoop)
2372 1.127 dsl name = curFile->fname;
2373 1.139 dsl else
2374 1.184 sjg ParseTrackInput(name);
2375 1.127 dsl
2376 1.127 dsl if (DEBUG(PARSE))
2377 1.288 rillig fprintf(debug_file, "%s: file %s, line %d, fd %d, nextbuf %s, arg %p\n",
2378 1.288 rillig __func__, name, line, fd,
2379 1.288 rillig nextbuf == loadedfile_nextbuf ? "loadedfile" : "other", arg);
2380 1.127 dsl
2381 1.155 dsl if (fd == -1 && nextbuf == NULL)
2382 1.125 dsl /* sanity */
2383 1.125 dsl return;
2384 1.125 dsl
2385 1.132 dsl if (curFile != NULL)
2386 1.281 rillig /* Save existing file info */
2387 1.276 rillig Stack_Push(&includes, curFile);
2388 1.5 cgd
2389 1.125 dsl /* Allocate and fill in new structure */
2390 1.147 joerg curFile = bmake_malloc(sizeof *curFile);
2391 1.125 dsl
2392 1.125 dsl /*
2393 1.125 dsl * Once the previous state has been saved, we can get down to reading
2394 1.125 dsl * the new file. We set up the name of the file to be the absolute
2395 1.125 dsl * name of the include file so error messages refer to the right
2396 1.125 dsl * place.
2397 1.125 dsl */
2398 1.189 sjg curFile->fname = bmake_strdup(name);
2399 1.281 rillig curFile->fromForLoop = fromForLoop;
2400 1.125 dsl curFile->lineno = line;
2401 1.155 dsl curFile->first_lineno = line;
2402 1.155 dsl curFile->nextbuf = nextbuf;
2403 1.155 dsl curFile->nextbuf_arg = arg;
2404 1.170 dholland curFile->lf = NULL;
2405 1.212 sjg curFile->depending = doing_depend; /* restore this on EOF */
2406 1.170 dholland
2407 1.170 dholland assert(nextbuf != NULL);
2408 1.125 dsl
2409 1.170 dholland /* Get first block of input data */
2410 1.170 dholland buf = curFile->nextbuf(curFile->nextbuf_arg, &len);
2411 1.170 dholland if (buf == NULL) {
2412 1.246 rillig /* Was all a waste of time ... */
2413 1.189 sjg if (curFile->fname)
2414 1.189 sjg free(curFile->fname);
2415 1.170 dholland free(curFile);
2416 1.170 dholland return;
2417 1.125 dsl }
2418 1.170 dholland curFile->P_str = buf;
2419 1.170 dholland curFile->P_ptr = buf;
2420 1.170 dholland curFile->P_end = buf+len;
2421 1.5 cgd
2422 1.155 dsl curFile->cond_depth = Cond_save_depth();
2423 1.155 dsl ParseSetParseFile(name);
2424 1.5 cgd }
2425 1.5 cgd
2426 1.284 rillig /* Check if the line is an include directive. */
2427 1.228 christos static Boolean
2428 1.228 christos IsInclude(const char *line, Boolean sysv)
2429 1.228 christos {
2430 1.228 christos static const char inc[] = "include";
2431 1.228 christos static const size_t inclen = sizeof(inc) - 1;
2432 1.228 christos
2433 1.248 rillig /* 'd' is not valid for sysv */
2434 1.269 rillig int o = strchr(sysv ? "s-" : "ds-", *line) != NULL;
2435 1.228 christos
2436 1.228 christos if (strncmp(line + o, inc, inclen) != 0)
2437 1.228 christos return FALSE;
2438 1.228 christos
2439 1.248 rillig /* Space is not mandatory for BSD .include */
2440 1.290 rillig return !sysv || ch_isspace(line[inclen + o]);
2441 1.228 christos }
2442 1.228 christos
2443 1.228 christos
2444 1.5 cgd #ifdef SYSVINCLUDE
2445 1.284 rillig /* Check if the line is a SYSV include directive. */
2446 1.228 christos static Boolean
2447 1.228 christos IsSysVInclude(const char *line)
2448 1.228 christos {
2449 1.228 christos const char *p;
2450 1.228 christos
2451 1.228 christos if (!IsInclude(line, TRUE))
2452 1.228 christos return FALSE;
2453 1.228 christos
2454 1.228 christos /* Avoid interpeting a dependency line as an include */
2455 1.228 christos for (p = line; (p = strchr(p, ':')) != NULL;) {
2456 1.228 christos if (*++p == '\0') {
2457 1.228 christos /* end of line -> dependency */
2458 1.228 christos return FALSE;
2459 1.228 christos }
2460 1.290 rillig if (*p == ':' || ch_isspace(*p)) {
2461 1.228 christos /* :: operator or ': ' -> dependency */
2462 1.228 christos return FALSE;
2463 1.228 christos }
2464 1.228 christos }
2465 1.228 christos return TRUE;
2466 1.228 christos }
2467 1.228 christos
2468 1.284 rillig /* Push to another file. The line points to the word "include". */
2469 1.5 cgd static void
2470 1.84 wiz ParseTraditionalInclude(char *line)
2471 1.5 cgd {
2472 1.5 cgd char *cp; /* current position in file spec */
2473 1.38 christos int done = 0;
2474 1.242 rillig int silent = line[0] != 'i';
2475 1.38 christos char *file = &line[silent + 7];
2476 1.123 dsl char *all_files;
2477 1.5 cgd
2478 1.284 rillig if (DEBUG(PARSE))
2479 1.284 rillig fprintf(debug_file, "%s: %s\n", __func__, file);
2480 1.111 ginsbach
2481 1.5 cgd /*
2482 1.5 cgd * Skip over whitespace
2483 1.5 cgd */
2484 1.290 rillig while (ch_isspace(*file))
2485 1.5 cgd file++;
2486 1.5 cgd
2487 1.111 ginsbach /*
2488 1.111 ginsbach * Substitute for any variables in the file name before trying to
2489 1.111 ginsbach * find the thing.
2490 1.111 ginsbach */
2491 1.239 rillig all_files = Var_Subst(file, VAR_CMD, VARE_WANTRES);
2492 1.111 ginsbach
2493 1.5 cgd if (*file == '\0') {
2494 1.97 christos Parse_Error(PARSE_FATAL,
2495 1.5 cgd "Filename missing from \"include\"");
2496 1.224 riastrad goto out;
2497 1.5 cgd }
2498 1.5 cgd
2499 1.123 dsl for (file = all_files; !done; file = cp + 1) {
2500 1.123 dsl /* Skip to end of line or next whitespace */
2501 1.290 rillig for (cp = file; *cp && !ch_isspace(*cp); cp++)
2502 1.38 christos continue;
2503 1.38 christos
2504 1.38 christos if (*cp)
2505 1.38 christos *cp = '\0';
2506 1.38 christos else
2507 1.38 christos done = 1;
2508 1.38 christos
2509 1.210 sjg Parse_include_file(file, FALSE, FALSE, silent);
2510 1.5 cgd }
2511 1.224 riastrad out:
2512 1.123 dsl free(all_files);
2513 1.5 cgd }
2514 1.5 cgd #endif
2515 1.5 cgd
2516 1.183 sjg #ifdef GMAKEEXPORT
2517 1.284 rillig /* Parse export <variable>=<value>, and actually export it. */
2518 1.182 christos static void
2519 1.182 christos ParseGmakeExport(char *line)
2520 1.182 christos {
2521 1.182 christos char *variable = &line[6];
2522 1.182 christos char *value;
2523 1.182 christos
2524 1.284 rillig if (DEBUG(PARSE))
2525 1.284 rillig fprintf(debug_file, "%s: %s\n", __func__, variable);
2526 1.182 christos
2527 1.182 christos /*
2528 1.182 christos * Skip over whitespace
2529 1.182 christos */
2530 1.290 rillig while (ch_isspace(*variable))
2531 1.182 christos variable++;
2532 1.182 christos
2533 1.182 christos for (value = variable; *value && *value != '='; value++)
2534 1.182 christos continue;
2535 1.182 christos
2536 1.182 christos if (*value != '=') {
2537 1.182 christos Parse_Error(PARSE_FATAL,
2538 1.284 rillig "Variable/Value missing from \"export\"");
2539 1.182 christos return;
2540 1.182 christos }
2541 1.188 sjg *value++ = '\0'; /* terminate variable */
2542 1.182 christos
2543 1.182 christos /*
2544 1.183 sjg * Expand the value before putting it in the environment.
2545 1.182 christos */
2546 1.239 rillig value = Var_Subst(value, VAR_CMD, VARE_WANTRES);
2547 1.182 christos setenv(variable, value, 1);
2548 1.223 riastrad free(value);
2549 1.182 christos }
2550 1.182 christos #endif
2551 1.182 christos
2552 1.284 rillig /* Called when EOF is reached in the current file. If we were reading an
2553 1.284 rillig * include file, the includes stack is popped and things set up to go back
2554 1.284 rillig * to reading the previous file at the previous location.
2555 1.1 cgd *
2556 1.1 cgd * Results:
2557 1.1 cgd * CONTINUE if there's more to do. DONE if not.
2558 1.1 cgd */
2559 1.1 cgd static int
2560 1.123 dsl ParseEOF(void)
2561 1.1 cgd {
2562 1.155 dsl char *ptr;
2563 1.170 dholland size_t len;
2564 1.170 dholland
2565 1.170 dholland assert(curFile->nextbuf != NULL);
2566 1.155 dsl
2567 1.210 sjg doing_depend = curFile->depending; /* restore this */
2568 1.170 dholland /* get next input buffer, if any */
2569 1.170 dholland ptr = curFile->nextbuf(curFile->nextbuf_arg, &len);
2570 1.170 dholland curFile->P_ptr = ptr;
2571 1.170 dholland curFile->P_str = ptr;
2572 1.170 dholland curFile->P_end = ptr + len;
2573 1.170 dholland curFile->lineno = curFile->first_lineno;
2574 1.170 dholland if (ptr != NULL) {
2575 1.170 dholland /* Iterate again */
2576 1.170 dholland return CONTINUE;
2577 1.155 dsl }
2578 1.155 dsl
2579 1.132 dsl /* Ensure the makefile (or loop) didn't have mismatched conditionals */
2580 1.132 dsl Cond_restore_depth(curFile->cond_depth);
2581 1.131 dsl
2582 1.170 dholland if (curFile->lf != NULL) {
2583 1.170 dholland loadedfile_destroy(curFile->lf);
2584 1.170 dholland curFile->lf = NULL;
2585 1.170 dholland }
2586 1.170 dholland
2587 1.125 dsl /* Dispose of curFile info */
2588 1.125 dsl /* Leak curFile->fname because all the gnodes have pointers to it */
2589 1.125 dsl free(curFile->P_str);
2590 1.125 dsl free(curFile);
2591 1.125 dsl
2592 1.276 rillig if (Stack_IsEmpty(&includes)) {
2593 1.258 rillig curFile = NULL;
2594 1.125 dsl /* We've run out of input */
2595 1.44 aidan Var_Delete(".PARSEDIR", VAR_GLOBAL);
2596 1.44 aidan Var_Delete(".PARSEFILE", VAR_GLOBAL);
2597 1.194 christos Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
2598 1.194 christos Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
2599 1.125 dsl return DONE;
2600 1.1 cgd }
2601 1.1 cgd
2602 1.276 rillig curFile = Stack_Pop(&includes);
2603 1.127 dsl if (DEBUG(PARSE))
2604 1.170 dholland fprintf(debug_file, "ParseEOF: returning to file %s, line %d\n",
2605 1.170 dholland curFile->fname, curFile->lineno);
2606 1.127 dsl
2607 1.125 dsl ParseSetParseFile(curFile->fname);
2608 1.235 rillig return CONTINUE;
2609 1.1 cgd }
2610 1.1 cgd
2611 1.127 dsl #define PARSE_RAW 1
2612 1.127 dsl #define PARSE_SKIP 2
2613 1.127 dsl
2614 1.127 dsl static char *
2615 1.127 dsl ParseGetLine(int flags, int *length)
2616 1.5 cgd {
2617 1.125 dsl IFile *cf = curFile;
2618 1.127 dsl char *ptr;
2619 1.125 dsl char ch;
2620 1.127 dsl char *line;
2621 1.127 dsl char *line_end;
2622 1.127 dsl char *escaped;
2623 1.127 dsl char *comment;
2624 1.127 dsl char *tp;
2625 1.125 dsl
2626 1.127 dsl /* Loop through blank lines and comment lines */
2627 1.125 dsl for (;;) {
2628 1.127 dsl cf->lineno++;
2629 1.127 dsl line = cf->P_ptr;
2630 1.127 dsl ptr = line;
2631 1.127 dsl line_end = line;
2632 1.127 dsl escaped = NULL;
2633 1.127 dsl comment = NULL;
2634 1.127 dsl for (;;) {
2635 1.170 dholland if (cf->P_end != NULL && ptr == cf->P_end) {
2636 1.170 dholland /* end of buffer */
2637 1.170 dholland ch = 0;
2638 1.170 dholland break;
2639 1.170 dholland }
2640 1.127 dsl ch = *ptr;
2641 1.127 dsl if (ch == 0 || (ch == '\\' && ptr[1] == 0)) {
2642 1.127 dsl if (cf->P_end == NULL)
2643 1.127 dsl /* End of string (aka for loop) data */
2644 1.127 dsl break;
2645 1.190 sjg /* see if there is more we can parse */
2646 1.190 sjg while (ptr++ < cf->P_end) {
2647 1.190 sjg if ((ch = *ptr) == '\n') {
2648 1.190 sjg if (ptr > line && ptr[-1] == '\\')
2649 1.190 sjg continue;
2650 1.190 sjg Parse_Error(PARSE_WARNING,
2651 1.190 sjg "Zero byte read from file, skipping rest of line.");
2652 1.190 sjg break;
2653 1.190 sjg }
2654 1.190 sjg }
2655 1.170 dholland if (cf->nextbuf != NULL) {
2656 1.170 dholland /*
2657 1.170 dholland * End of this buffer; return EOF and outer logic
2658 1.170 dholland * will get the next one. (eww)
2659 1.170 dholland */
2660 1.127 dsl break;
2661 1.127 dsl }
2662 1.170 dholland Parse_Error(PARSE_FATAL, "Zero byte read from file");
2663 1.170 dholland return NULL;
2664 1.127 dsl }
2665 1.127 dsl
2666 1.127 dsl if (ch == '\\') {
2667 1.127 dsl /* Don't treat next character as special, remember first one */
2668 1.127 dsl if (escaped == NULL)
2669 1.127 dsl escaped = ptr;
2670 1.127 dsl if (ptr[1] == '\n')
2671 1.127 dsl cf->lineno++;
2672 1.127 dsl ptr += 2;
2673 1.127 dsl line_end = ptr;
2674 1.127 dsl continue;
2675 1.127 dsl }
2676 1.127 dsl if (ch == '#' && comment == NULL) {
2677 1.127 dsl /* Remember first '#' for comment stripping */
2678 1.181 sjg /* Unless previous char was '[', as in modifier :[#] */
2679 1.181 sjg if (!(ptr > line && ptr[-1] == '['))
2680 1.181 sjg comment = line_end;
2681 1.127 dsl }
2682 1.127 dsl ptr++;
2683 1.125 dsl if (ch == '\n')
2684 1.127 dsl break;
2685 1.290 rillig if (!ch_isspace(ch))
2686 1.127 dsl /* We are not interested in trailing whitespace */
2687 1.127 dsl line_end = ptr;
2688 1.127 dsl }
2689 1.125 dsl
2690 1.127 dsl /* Save next 'to be processed' location */
2691 1.127 dsl cf->P_ptr = ptr;
2692 1.127 dsl
2693 1.127 dsl /* Check we have a non-comment, non-blank line */
2694 1.127 dsl if (line_end == line || comment == line) {
2695 1.127 dsl if (ch == 0)
2696 1.127 dsl /* At end of file */
2697 1.127 dsl return NULL;
2698 1.127 dsl /* Parse another line */
2699 1.125 dsl continue;
2700 1.127 dsl }
2701 1.125 dsl
2702 1.127 dsl /* We now have a line of data */
2703 1.127 dsl *line_end = 0;
2704 1.27 christos
2705 1.127 dsl if (flags & PARSE_RAW) {
2706 1.127 dsl /* Leave '\' (etc) in line buffer (eg 'for' lines) */
2707 1.127 dsl *length = line_end - line;
2708 1.127 dsl return line;
2709 1.127 dsl }
2710 1.5 cgd
2711 1.127 dsl if (flags & PARSE_SKIP) {
2712 1.127 dsl /* Completely ignore non-directives */
2713 1.127 dsl if (line[0] != '.')
2714 1.127 dsl continue;
2715 1.127 dsl /* We could do more of the .else/.elif/.endif checks here */
2716 1.127 dsl }
2717 1.127 dsl break;
2718 1.127 dsl }
2719 1.5 cgd
2720 1.127 dsl /* Brutally ignore anything after a non-escaped '#' in non-commands */
2721 1.127 dsl if (comment != NULL && line[0] != '\t') {
2722 1.127 dsl line_end = comment;
2723 1.127 dsl *line_end = 0;
2724 1.127 dsl }
2725 1.5 cgd
2726 1.127 dsl /* If we didn't see a '\\' then the in-situ data is fine */
2727 1.127 dsl if (escaped == NULL) {
2728 1.127 dsl *length = line_end - line;
2729 1.127 dsl return line;
2730 1.127 dsl }
2731 1.5 cgd
2732 1.127 dsl /* Remove escapes from '\n' and '#' */
2733 1.127 dsl tp = ptr = escaped;
2734 1.127 dsl escaped = line;
2735 1.127 dsl for (; ; *tp++ = ch) {
2736 1.127 dsl ch = *ptr++;
2737 1.127 dsl if (ch != '\\') {
2738 1.127 dsl if (ch == 0)
2739 1.127 dsl break;
2740 1.127 dsl continue;
2741 1.127 dsl }
2742 1.5 cgd
2743 1.127 dsl ch = *ptr++;
2744 1.127 dsl if (ch == 0) {
2745 1.127 dsl /* Delete '\\' at end of buffer */
2746 1.127 dsl tp--;
2747 1.127 dsl break;
2748 1.127 dsl }
2749 1.27 christos
2750 1.130 dsl if (ch == '#' && line[0] != '\t')
2751 1.130 dsl /* Delete '\\' from before '#' on non-command lines */
2752 1.127 dsl continue;
2753 1.27 christos
2754 1.127 dsl if (ch != '\n') {
2755 1.127 dsl /* Leave '\\' in buffer for later */
2756 1.127 dsl *tp++ = '\\';
2757 1.127 dsl /* Make sure we don't delete an escaped ' ' from the line end */
2758 1.127 dsl escaped = tp + 1;
2759 1.127 dsl continue;
2760 1.127 dsl }
2761 1.27 christos
2762 1.203 joerg /* Escaped '\n' replace following whitespace with a single ' ' */
2763 1.203 joerg while (ptr[0] == ' ' || ptr[0] == '\t')
2764 1.203 joerg ptr++;
2765 1.203 joerg ch = ' ';
2766 1.127 dsl }
2767 1.27 christos
2768 1.127 dsl /* Delete any trailing spaces - eg from empty continuations */
2769 1.290 rillig while (tp > escaped && ch_isspace(tp[-1]))
2770 1.127 dsl tp--;
2771 1.27 christos
2772 1.127 dsl *tp = 0;
2773 1.127 dsl *length = tp - line;
2774 1.5 cgd return line;
2775 1.5 cgd }
2776 1.1 cgd
2777 1.284 rillig /* Read an entire line from the input file. Called only by Parse_File.
2778 1.1 cgd *
2779 1.1 cgd * Results:
2780 1.284 rillig * A line without its newline.
2781 1.1 cgd *
2782 1.1 cgd * Side Effects:
2783 1.1 cgd * Only those associated with reading a character
2784 1.1 cgd */
2785 1.1 cgd static char *
2786 1.84 wiz ParseReadLine(void)
2787 1.1 cgd {
2788 1.9 jtc char *line; /* Result */
2789 1.1 cgd int lineLength; /* Length of result */
2790 1.95 enami int lineno; /* Saved line # */
2791 1.151 dsl int rval;
2792 1.1 cgd
2793 1.5 cgd for (;;) {
2794 1.127 dsl line = ParseGetLine(0, &lineLength);
2795 1.127 dsl if (line == NULL)
2796 1.127 dsl return NULL;
2797 1.1 cgd
2798 1.127 dsl if (line[0] != '.')
2799 1.127 dsl return line;
2800 1.121 dsl
2801 1.121 dsl /*
2802 1.127 dsl * The line might be a conditional. Ask the conditional module
2803 1.127 dsl * about it and act accordingly
2804 1.121 dsl */
2805 1.127 dsl switch (Cond_Eval(line)) {
2806 1.127 dsl case COND_SKIP:
2807 1.127 dsl /* Skip to next conditional that evaluates to COND_PARSE. */
2808 1.127 dsl do {
2809 1.127 dsl line = ParseGetLine(PARSE_SKIP, &lineLength);
2810 1.127 dsl } while (line && Cond_Eval(line) != COND_PARSE);
2811 1.127 dsl if (line == NULL)
2812 1.121 dsl break;
2813 1.127 dsl continue;
2814 1.127 dsl case COND_PARSE:
2815 1.127 dsl continue;
2816 1.127 dsl case COND_INVALID: /* Not a conditional line */
2817 1.151 dsl /* Check for .for loops */
2818 1.151 dsl rval = For_Eval(line);
2819 1.151 dsl if (rval == 0)
2820 1.151 dsl /* Not a .for line */
2821 1.1 cgd break;
2822 1.151 dsl if (rval < 0)
2823 1.151 dsl /* Syntax error - error printed, ignore line */
2824 1.151 dsl continue;
2825 1.151 dsl /* Start of a .for loop */
2826 1.127 dsl lineno = curFile->lineno;
2827 1.151 dsl /* Accumulate loop lines until matching .endfor */
2828 1.121 dsl do {
2829 1.127 dsl line = ParseGetLine(PARSE_RAW, &lineLength);
2830 1.121 dsl if (line == NULL) {
2831 1.121 dsl Parse_Error(PARSE_FATAL,
2832 1.174 dholland "Unexpected end of file in for loop.");
2833 1.5 cgd break;
2834 1.121 dsl }
2835 1.151 dsl } while (For_Accum(line));
2836 1.127 dsl /* Stash each iteration as a new 'input file' */
2837 1.127 dsl For_Run(lineno);
2838 1.127 dsl /* Read next line from for-loop buffer */
2839 1.127 dsl continue;
2840 1.1 cgd }
2841 1.235 rillig return line;
2842 1.1 cgd }
2843 1.1 cgd }
2844 1.1 cgd
2845 1.293 rillig static int
2846 1.293 rillig SuffEndTransform(void *target, void *unused MAKE_ATTR_UNUSED)
2847 1.293 rillig {
2848 1.293 rillig Suff_EndTransform(target);
2849 1.293 rillig return 0;
2850 1.293 rillig }
2851 1.293 rillig
2852 1.1 cgd /*-
2853 1.1 cgd *-----------------------------------------------------------------------
2854 1.1 cgd * ParseFinishLine --
2855 1.1 cgd * Handle the end of a dependency group.
2856 1.1 cgd *
2857 1.1 cgd * Results:
2858 1.1 cgd * Nothing.
2859 1.1 cgd *
2860 1.1 cgd * Side Effects:
2861 1.1 cgd * inLine set FALSE. 'targets' list destroyed.
2862 1.1 cgd *
2863 1.1 cgd *-----------------------------------------------------------------------
2864 1.1 cgd */
2865 1.1 cgd static void
2866 1.84 wiz ParseFinishLine(void)
2867 1.1 cgd {
2868 1.1 cgd if (inLine) {
2869 1.292 rillig if (targets != NULL) {
2870 1.293 rillig Lst_ForEach(targets, SuffEndTransform, NULL);
2871 1.268 rillig Lst_Destroy(targets, ParseHasCommands);
2872 1.263 rillig }
2873 1.9 jtc targets = NULL;
2874 1.1 cgd inLine = FALSE;
2875 1.1 cgd }
2876 1.1 cgd }
2877 1.27 christos
2878 1.1 cgd
2879 1.1 cgd /*-
2880 1.1 cgd *---------------------------------------------------------------------
2881 1.1 cgd * Parse_File --
2882 1.1 cgd * Parse a file into its component parts, incorporating it into the
2883 1.1 cgd * current dependency graph. This is the main function and controls
2884 1.1 cgd * almost every other function in this module
2885 1.1 cgd *
2886 1.84 wiz * Input:
2887 1.84 wiz * name the name of the file being read
2888 1.125 dsl * fd Open file to makefile to parse
2889 1.84 wiz *
2890 1.1 cgd * Results:
2891 1.1 cgd * None
2892 1.1 cgd *
2893 1.1 cgd * Side Effects:
2894 1.125 dsl * closes fd.
2895 1.1 cgd * Loads. Nodes are added to the list of all targets, nodes and links
2896 1.1 cgd * are added to the dependency graph. etc. etc. etc.
2897 1.1 cgd *---------------------------------------------------------------------
2898 1.1 cgd */
2899 1.1 cgd void
2900 1.125 dsl Parse_File(const char *name, int fd)
2901 1.1 cgd {
2902 1.117 dsl char *cp; /* pointer into the line */
2903 1.117 dsl char *line; /* the line we're working on */
2904 1.170 dholland struct loadedfile *lf;
2905 1.170 dholland
2906 1.170 dholland lf = loadfile(name, fd);
2907 1.1 cgd
2908 1.1 cgd inLine = FALSE;
2909 1.1 cgd fatals = 0;
2910 1.44 aidan
2911 1.242 rillig if (name == NULL)
2912 1.242 rillig name = "(stdin)";
2913 1.170 dholland
2914 1.170 dholland Parse_SetInput(name, 0, -1, loadedfile_nextbuf, lf);
2915 1.170 dholland curFile->lf = lf;
2916 1.1 cgd
2917 1.1 cgd do {
2918 1.127 dsl for (; (line = ParseReadLine()) != NULL; ) {
2919 1.120 dsl if (DEBUG(PARSE))
2920 1.145 christos fprintf(debug_file, "ParseReadLine (%d): '%s'\n",
2921 1.145 christos curFile->lineno, line);
2922 1.1 cgd if (*line == '.') {
2923 1.1 cgd /*
2924 1.159 dsl * Lines that begin with the special character may be
2925 1.1 cgd * include or undef directives.
2926 1.159 dsl * On the other hand they can be suffix rules (.c.o: ...)
2927 1.159 dsl * or just dependencies for filenames that start '.'.
2928 1.1 cgd */
2929 1.290 rillig for (cp = line + 1; ch_isspace(*cp); cp++) {
2930 1.1 cgd continue;
2931 1.1 cgd }
2932 1.228 christos if (IsInclude(cp, FALSE)) {
2933 1.97 christos ParseDoInclude(cp);
2934 1.117 dsl continue;
2935 1.117 dsl }
2936 1.117 dsl if (strncmp(cp, "undef", 5) == 0) {
2937 1.1 cgd char *cp2;
2938 1.290 rillig for (cp += 5; ch_isspace(*cp); cp++)
2939 1.1 cgd continue;
2940 1.290 rillig for (cp2 = cp; !ch_isspace(*cp2) && *cp2 != '\0'; cp2++)
2941 1.1 cgd continue;
2942 1.1 cgd *cp2 = '\0';
2943 1.1 cgd Var_Delete(cp, VAR_GLOBAL);
2944 1.117 dsl continue;
2945 1.136 sjg } else if (strncmp(cp, "export", 6) == 0) {
2946 1.290 rillig for (cp += 6; ch_isspace(*cp); cp++)
2947 1.136 sjg continue;
2948 1.250 rillig Var_Export(cp, TRUE);
2949 1.136 sjg continue;
2950 1.160 sjg } else if (strncmp(cp, "unexport", 8) == 0) {
2951 1.160 sjg Var_UnExport(cp);
2952 1.160 sjg continue;
2953 1.161 sjg } else if (strncmp(cp, "info", 4) == 0 ||
2954 1.161 sjg strncmp(cp, "error", 5) == 0 ||
2955 1.161 sjg strncmp(cp, "warning", 7) == 0) {
2956 1.164 sjg if (ParseMessage(cp))
2957 1.164 sjg continue;
2958 1.236 rillig }
2959 1.1 cgd }
2960 1.27 christos
2961 1.6 jtc if (*line == '\t') {
2962 1.1 cgd /*
2963 1.6 jtc * If a line starts with a tab, it can only hope to be
2964 1.6 jtc * a creation command.
2965 1.1 cgd */
2966 1.133 dsl cp = line + 1;
2967 1.127 dsl shellCommand:
2968 1.290 rillig for (; ch_isspace(*cp); cp++) {
2969 1.1 cgd continue;
2970 1.1 cgd }
2971 1.1 cgd if (*cp) {
2972 1.117 dsl if (!inLine)
2973 1.97 christos Parse_Error(PARSE_FATAL,
2974 1.25 christos "Unassociated shell command \"%s\"",
2975 1.1 cgd cp);
2976 1.117 dsl /*
2977 1.117 dsl * So long as it's not a blank line and we're actually
2978 1.117 dsl * in a dependency spec, add the command to the list of
2979 1.117 dsl * commands of all targets in the dependency spec
2980 1.117 dsl */
2981 1.129 christos if (targets) {
2982 1.147 joerg cp = bmake_strdup(cp);
2983 1.268 rillig Lst_ForEach(targets, ParseAddCmd, cp);
2984 1.117 dsl #ifdef CLEANUP
2985 1.268 rillig Lst_Append(targCmds, cp);
2986 1.117 dsl #endif
2987 1.129 christos }
2988 1.1 cgd }
2989 1.117 dsl continue;
2990 1.117 dsl }
2991 1.117 dsl
2992 1.5 cgd #ifdef SYSVINCLUDE
2993 1.228 christos if (IsSysVInclude(line)) {
2994 1.5 cgd /*
2995 1.5 cgd * It's an S3/S5-style "include".
2996 1.5 cgd */
2997 1.97 christos ParseTraditionalInclude(line);
2998 1.117 dsl continue;
2999 1.117 dsl }
3000 1.5 cgd #endif
3001 1.182 christos #ifdef GMAKEEXPORT
3002 1.290 rillig if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
3003 1.182 christos strchr(line, ':') == NULL) {
3004 1.182 christos /*
3005 1.183 sjg * It's a Gmake "export".
3006 1.182 christos */
3007 1.182 christos ParseGmakeExport(line);
3008 1.182 christos continue;
3009 1.182 christos }
3010 1.182 christos #endif
3011 1.117 dsl if (Parse_IsVar(line)) {
3012 1.1 cgd ParseFinishLine();
3013 1.97 christos Parse_DoVar(line, VAR_GLOBAL);
3014 1.117 dsl continue;
3015 1.117 dsl }
3016 1.117 dsl
3017 1.127 dsl #ifndef POSIX
3018 1.117 dsl /*
3019 1.117 dsl * To make life easier on novices, if the line is indented we
3020 1.117 dsl * first make sure the line has a dependency operator in it.
3021 1.117 dsl * If it doesn't have an operator and we're in a dependency
3022 1.117 dsl * line's script, we assume it's actually a shell command
3023 1.117 dsl * and add it to the current list of targets.
3024 1.117 dsl */
3025 1.117 dsl cp = line;
3026 1.290 rillig if (ch_isspace(line[0])) {
3027 1.290 rillig while (ch_isspace(*cp))
3028 1.117 dsl cp++;
3029 1.117 dsl while (*cp && (ParseIsEscaped(line, cp) ||
3030 1.242 rillig *cp != ':' && *cp != '!')) {
3031 1.117 dsl cp++;
3032 1.117 dsl }
3033 1.127 dsl if (*cp == '\0') {
3034 1.127 dsl if (inLine) {
3035 1.127 dsl Parse_Error(PARSE_WARNING,
3036 1.127 dsl "Shell command needs a leading tab");
3037 1.127 dsl goto shellCommand;
3038 1.127 dsl }
3039 1.127 dsl }
3040 1.127 dsl }
3041 1.11 mycroft #endif
3042 1.127 dsl ParseFinishLine();
3043 1.27 christos
3044 1.127 dsl /*
3045 1.127 dsl * For some reason - probably to make the parser impossible -
3046 1.127 dsl * a ';' can be used to separate commands from dependencies.
3047 1.158 sjg * Attempt to avoid ';' inside substitution patterns.
3048 1.127 dsl */
3049 1.158 sjg {
3050 1.158 sjg int level = 0;
3051 1.158 sjg
3052 1.158 sjg for (cp = line; *cp != 0; cp++) {
3053 1.158 sjg if (*cp == '\\' && cp[1] != 0) {
3054 1.158 sjg cp++;
3055 1.158 sjg continue;
3056 1.158 sjg }
3057 1.158 sjg if (*cp == '$' &&
3058 1.158 sjg (cp[1] == '(' || cp[1] == '{')) {
3059 1.158 sjg level++;
3060 1.158 sjg continue;
3061 1.158 sjg }
3062 1.158 sjg if (level > 0) {
3063 1.158 sjg if (*cp == ')' || *cp == '}') {
3064 1.158 sjg level--;
3065 1.158 sjg continue;
3066 1.158 sjg }
3067 1.158 sjg } else if (*cp == ';') {
3068 1.158 sjg break;
3069 1.158 sjg }
3070 1.117 dsl }
3071 1.117 dsl }
3072 1.127 dsl if (*cp != 0)
3073 1.127 dsl /* Terminate the dependency list at the ';' */
3074 1.133 dsl *cp++ = 0;
3075 1.127 dsl else
3076 1.127 dsl cp = NULL;
3077 1.1 cgd
3078 1.127 dsl /*
3079 1.127 dsl * We now know it's a dependency line so it needs to have all
3080 1.127 dsl * variables expanded before being parsed. Tell the variable
3081 1.127 dsl * module to complain if some variable is undefined...
3082 1.127 dsl */
3083 1.239 rillig line = Var_Subst(line, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES);
3084 1.27 christos
3085 1.117 dsl /*
3086 1.117 dsl * Need a non-circular list for the target nodes
3087 1.117 dsl */
3088 1.263 rillig if (targets != NULL)
3089 1.268 rillig Lst_Free(targets);
3090 1.9 jtc
3091 1.252 rillig targets = Lst_Init();
3092 1.117 dsl inLine = TRUE;
3093 1.27 christos
3094 1.117 dsl ParseDoDependency(line);
3095 1.127 dsl free(line);
3096 1.127 dsl
3097 1.127 dsl /* If there were commands after a ';', add them now */
3098 1.127 dsl if (cp != NULL) {
3099 1.127 dsl goto shellCommand;
3100 1.127 dsl }
3101 1.1 cgd }
3102 1.1 cgd /*
3103 1.27 christos * Reached EOF, but it may be just EOF of an include file...
3104 1.1 cgd */
3105 1.123 dsl } while (ParseEOF() == CONTINUE);
3106 1.1 cgd
3107 1.1 cgd if (fatals) {
3108 1.163 sjg (void)fflush(stdout);
3109 1.63 christos (void)fprintf(stderr,
3110 1.175 dholland "%s: Fatal errors encountered -- cannot continue",
3111 1.63 christos progname);
3112 1.161 sjg PrintOnError(NULL, NULL);
3113 1.103 christos exit(1);
3114 1.1 cgd }
3115 1.1 cgd }
3116 1.1 cgd
3117 1.1 cgd /*-
3118 1.1 cgd *---------------------------------------------------------------------
3119 1.1 cgd * Parse_Init --
3120 1.1 cgd * initialize the parsing module
3121 1.1 cgd *
3122 1.1 cgd * Results:
3123 1.1 cgd * none
3124 1.1 cgd *
3125 1.1 cgd * Side Effects:
3126 1.1 cgd * the parseIncPath list is initialized...
3127 1.1 cgd *---------------------------------------------------------------------
3128 1.1 cgd */
3129 1.5 cgd void
3130 1.84 wiz Parse_Init(void)
3131 1.1 cgd {
3132 1.152 dsl mainNode = NULL;
3133 1.252 rillig parseIncPath = Lst_Init();
3134 1.252 rillig sysIncPath = Lst_Init();
3135 1.252 rillig defIncPath = Lst_Init();
3136 1.276 rillig Stack_Init(&includes);
3137 1.45 mycroft #ifdef CLEANUP
3138 1.252 rillig targCmds = Lst_Init();
3139 1.45 mycroft #endif
3140 1.1 cgd }
3141 1.9 jtc
3142 1.9 jtc void
3143 1.84 wiz Parse_End(void)
3144 1.9 jtc {
3145 1.45 mycroft #ifdef CLEANUP
3146 1.268 rillig Lst_Destroy(targCmds, free);
3147 1.9 jtc if (targets)
3148 1.268 rillig Lst_Free(targets);
3149 1.268 rillig Lst_Destroy(defIncPath, Dir_Destroy);
3150 1.268 rillig Lst_Destroy(sysIncPath, Dir_Destroy);
3151 1.268 rillig Lst_Destroy(parseIncPath, Dir_Destroy);
3152 1.276 rillig assert(Stack_IsEmpty(&includes));
3153 1.276 rillig Stack_Done(&includes);
3154 1.45 mycroft #endif
3155 1.9 jtc }
3156 1.27 christos
3157 1.1 cgd
3158 1.1 cgd /*-
3159 1.1 cgd *-----------------------------------------------------------------------
3160 1.1 cgd * Parse_MainName --
3161 1.1 cgd * Return a Lst of the main target to create for main()'s sake. If
3162 1.1 cgd * no such target exists, we Punt with an obnoxious error message.
3163 1.1 cgd *
3164 1.1 cgd * Results:
3165 1.1 cgd * A Lst of the single node to create.
3166 1.1 cgd *
3167 1.1 cgd * Side Effects:
3168 1.1 cgd * None.
3169 1.1 cgd *
3170 1.1 cgd *-----------------------------------------------------------------------
3171 1.1 cgd */
3172 1.1 cgd Lst
3173 1.84 wiz Parse_MainName(void)
3174 1.1 cgd {
3175 1.37 fair Lst mainList; /* result list */
3176 1.1 cgd
3177 1.252 rillig mainList = Lst_Init();
3178 1.1 cgd
3179 1.152 dsl if (mainNode == NULL) {
3180 1.97 christos Punt("no target to make.");
3181 1.246 rillig /*NOTREACHED*/
3182 1.1 cgd } else if (mainNode->type & OP_DOUBLEDEP) {
3183 1.268 rillig Lst_Append(mainList, mainNode);
3184 1.268 rillig Lst_AppendAll(mainList, mainNode->cohorts);
3185 1.1 cgd }
3186 1.5 cgd else
3187 1.268 rillig Lst_Append(mainList, mainNode);
3188 1.81 pk Var_Append(".TARGETS", mainNode->name, VAR_GLOBAL);
3189 1.235 rillig return mainList;
3190 1.59 christos }
3191