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