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