parse.c revision 1.650 1 1.650 rillig /* $NetBSD: parse.c,v 1.650 2022/01/15 18:34:41 rillig Exp $ */
2 1.15 christos
3 1.1 cgd /*
4 1.27 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.27 christos * The Regents of the University of California. All rights reserved.
6 1.94 agc *
7 1.94 agc * This code is derived from software contributed to Berkeley by
8 1.94 agc * Adam de Boor.
9 1.94 agc *
10 1.94 agc * Redistribution and use in source and binary forms, with or without
11 1.94 agc * modification, are permitted provided that the following conditions
12 1.94 agc * are met:
13 1.94 agc * 1. Redistributions of source code must retain the above copyright
14 1.94 agc * notice, this list of conditions and the following disclaimer.
15 1.94 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.94 agc * notice, this list of conditions and the following disclaimer in the
17 1.94 agc * documentation and/or other materials provided with the distribution.
18 1.94 agc * 3. Neither the name of the University nor the names of its contributors
19 1.94 agc * may be used to endorse or promote products derived from this software
20 1.94 agc * without specific prior written permission.
21 1.94 agc *
22 1.94 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.94 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.94 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.94 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.94 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.94 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.94 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.94 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.94 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.94 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.94 agc * SUCH DAMAGE.
33 1.94 agc */
34 1.94 agc
35 1.94 agc /*
36 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
37 1.1 cgd * All rights reserved.
38 1.1 cgd *
39 1.1 cgd * This code is derived from software contributed to Berkeley by
40 1.1 cgd * Adam de Boor.
41 1.1 cgd *
42 1.1 cgd * Redistribution and use in source and binary forms, with or without
43 1.1 cgd * modification, are permitted provided that the following conditions
44 1.1 cgd * are met:
45 1.1 cgd * 1. Redistributions of source code must retain the above copyright
46 1.1 cgd * notice, this list of conditions and the following disclaimer.
47 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer in the
49 1.1 cgd * documentation and/or other materials provided with the distribution.
50 1.1 cgd * 3. All advertising materials mentioning features or use of this software
51 1.1 cgd * must display the following acknowledgement:
52 1.1 cgd * This product includes software developed by the University of
53 1.1 cgd * California, Berkeley and its contributors.
54 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
55 1.1 cgd * may be used to endorse or promote products derived from this software
56 1.1 cgd * without specific prior written permission.
57 1.1 cgd *
58 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 1.1 cgd * SUCH DAMAGE.
69 1.1 cgd */
70 1.1 cgd
71 1.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.1 cgd * Interface:
78 1.402 rillig * Parse_Init Initialize the module
79 1.338 rillig *
80 1.383 rillig * Parse_End Clean up the module
81 1.338 rillig *
82 1.402 rillig * Parse_File Parse a top-level makefile. Included files are
83 1.537 rillig * handled by IncludeFile instead.
84 1.402 rillig *
85 1.609 rillig * Parse_VarAssign
86 1.609 rillig * Try to parse the given line as a variable assignment.
87 1.609 rillig * Used by MainParseArgs to determine if an argument is
88 1.609 rillig * a target or a variable assignment. Used internally
89 1.609 rillig * for pretty much the same thing.
90 1.402 rillig *
91 1.402 rillig * Parse_Error Report a parse error, a warning or an informational
92 1.402 rillig * message.
93 1.338 rillig *
94 1.609 rillig * Parse_MainName Returns a list of the single main target to create.
95 1.1 cgd */
96 1.1 cgd
97 1.170 dholland #include <sys/types.h>
98 1.171 dholland #include <sys/stat.h>
99 1.84 wiz #include <errno.h>
100 1.5 cgd #include <stdarg.h>
101 1.225 maya #include <stdint.h>
102 1.84 wiz
103 1.1 cgd #include "make.h"
104 1.5 cgd #include "dir.h"
105 1.5 cgd #include "job.h"
106 1.1 cgd #include "pathnames.h"
107 1.1 cgd
108 1.303 rillig /* "@(#)parse.c 8.3 (Berkeley) 3/19/94" */
109 1.650 rillig MAKE_RCSID("$NetBSD: parse.c,v 1.650 2022/01/15 18:34:41 rillig Exp $");
110 1.166 dholland
111 1.1 cgd /*
112 1.627 rillig * A file being read.
113 1.1 cgd */
114 1.627 rillig typedef struct IncludedFile {
115 1.576 rillig FStr name; /* absolute or relative to the cwd */
116 1.639 rillig int lineno; /* 1-based */
117 1.627 rillig int readLines; /* the number of physical lines that have
118 1.639 rillig * been read from the file */
119 1.639 rillig int forHeadLineno; /* 1-based */
120 1.627 rillig int forBodyReadLines; /* the number of physical lines that have
121 1.627 rillig * been read from the file above the body of
122 1.639 rillig * the .for loop */
123 1.469 rillig unsigned int cond_depth; /* 'if' nesting when file opened */
124 1.618 rillig bool depending; /* state of doing_depend on EOF */
125 1.469 rillig
126 1.618 rillig Buffer buf; /* the file's content or the body of the .for
127 1.618 rillig * loop; always ends with '\n' */
128 1.469 rillig char *buf_ptr; /* next char to be read */
129 1.571 rillig char *buf_end; /* buf_end[-1] == '\n' */
130 1.469 rillig
131 1.616 rillig struct ForLoop *forLoop;
132 1.627 rillig } IncludedFile;
133 1.1 cgd
134 1.628 rillig /* Special attributes for target nodes. */
135 1.386 rillig typedef enum ParseSpecial {
136 1.469 rillig SP_ATTRIBUTE, /* Generic attribute */
137 1.469 rillig SP_BEGIN, /* .BEGIN */
138 1.469 rillig SP_DEFAULT, /* .DEFAULT */
139 1.469 rillig SP_DELETE_ON_ERROR, /* .DELETE_ON_ERROR */
140 1.469 rillig SP_END, /* .END */
141 1.469 rillig SP_ERROR, /* .ERROR */
142 1.469 rillig SP_IGNORE, /* .IGNORE */
143 1.469 rillig SP_INCLUDES, /* .INCLUDES; not mentioned in the manual page */
144 1.469 rillig SP_INTERRUPT, /* .INTERRUPT */
145 1.469 rillig SP_LIBS, /* .LIBS; not mentioned in the manual page */
146 1.589 rillig SP_MAIN, /* .MAIN and no user-specified targets to make */
147 1.469 rillig SP_META, /* .META */
148 1.469 rillig SP_MFLAGS, /* .MFLAGS or .MAKEFLAGS */
149 1.469 rillig SP_NOMETA, /* .NOMETA */
150 1.469 rillig SP_NOMETA_CMP, /* .NOMETA_CMP */
151 1.469 rillig SP_NOPATH, /* .NOPATH */
152 1.469 rillig SP_NOT, /* Not special */
153 1.469 rillig SP_NOTPARALLEL, /* .NOTPARALLEL or .NO_PARALLEL */
154 1.469 rillig SP_NULL, /* .NULL; not mentioned in the manual page */
155 1.469 rillig SP_OBJDIR, /* .OBJDIR */
156 1.469 rillig SP_ORDER, /* .ORDER */
157 1.469 rillig SP_PARALLEL, /* .PARALLEL; not mentioned in the manual page */
158 1.469 rillig SP_PATH, /* .PATH or .PATH.suffix */
159 1.469 rillig SP_PHONY, /* .PHONY */
160 1.48 sjg #ifdef POSIX
161 1.469 rillig SP_POSIX, /* .POSIX; not mentioned in the manual page */
162 1.48 sjg #endif
163 1.469 rillig SP_PRECIOUS, /* .PRECIOUS */
164 1.469 rillig SP_SHELL, /* .SHELL */
165 1.469 rillig SP_SILENT, /* .SILENT */
166 1.469 rillig SP_SINGLESHELL, /* .SINGLESHELL; not mentioned in the manual page */
167 1.469 rillig SP_STALE, /* .STALE */
168 1.469 rillig SP_SUFFIXES, /* .SUFFIXES */
169 1.469 rillig SP_WAIT /* .WAIT */
170 1.1 cgd } ParseSpecial;
171 1.1 cgd
172 1.368 rillig typedef List SearchPathList;
173 1.392 rillig typedef ListNode SearchPathListNode;
174 1.368 rillig
175 1.166 dholland /*
176 1.631 rillig * The target to be made if no targets are specified in the command line.
177 1.631 rillig * This is the first target defined in any of the makefiles.
178 1.166 dholland */
179 1.631 rillig GNode *mainNode;
180 1.166 dholland
181 1.524 rillig /*
182 1.524 rillig * During parsing, the targets from the left-hand side of the currently
183 1.415 rillig * active dependency line, or NULL if the current line does not belong to a
184 1.415 rillig * dependency line, for example because it is a variable assignment.
185 1.318 rillig *
186 1.524 rillig * See unit-tests/deptgt.mk, keyword "parse.c:targets".
187 1.524 rillig */
188 1.322 rillig static GNodeList *targets;
189 1.166 dholland
190 1.166 dholland #ifdef CLEANUP
191 1.524 rillig /*
192 1.524 rillig * All shell commands for all targets, in no particular order and possibly
193 1.372 rillig * with duplicates. Kept in a separate list since the commands from .USE or
194 1.372 rillig * .USEBEFORE nodes are shared with other GNodes, thereby giving up the
195 1.524 rillig * easily understandable ownership over the allocated strings.
196 1.524 rillig */
197 1.461 rillig static StringList targCmds = LST_INIT;
198 1.166 dholland #endif
199 1.166 dholland
200 1.166 dholland /*
201 1.152 dsl * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
202 1.628 rillig * is seen, then set to each successive source on the line.
203 1.1 cgd */
204 1.407 rillig static GNode *order_pred;
205 1.1 cgd
206 1.561 rillig static int parseErrors = 0;
207 1.166 dholland
208 1.166 dholland /*
209 1.532 rillig * The include chain of makefiles. At index 0 is the top-level makefile from
210 1.532 rillig * the command line, followed by the included files or .for loops, up to and
211 1.532 rillig * including the current file.
212 1.532 rillig *
213 1.532 rillig * See PrintStackTrace for how to interpret the data.
214 1.319 rillig */
215 1.627 rillig static Vector /* of IncludedFile */ includes;
216 1.400 rillig
217 1.549 rillig SearchPath *parseIncPath; /* directories for "..." includes */
218 1.549 rillig SearchPath *sysIncPath; /* directories for <...> includes */
219 1.414 rillig SearchPath *defSysIncPath; /* default for sysIncPath */
220 1.166 dholland
221 1.1 cgd /*
222 1.1 cgd * The parseKeywords table is searched using binary search when deciding
223 1.1 cgd * if a target or source is special. The 'spec' field is the ParseSpecial
224 1.404 rillig * type of the keyword (SP_NOT if the keyword isn't special as a target) while
225 1.1 cgd * the 'op' field is the operator to apply to the list of targets if the
226 1.1 cgd * keyword is used as a source ("0" if the keyword isn't special as a source)
227 1.1 cgd */
228 1.168 dholland static const struct {
229 1.590 rillig const char name[17];
230 1.590 rillig ParseSpecial special; /* when used as a target */
231 1.590 rillig GNodeType targetAttr; /* when used as a source */
232 1.1 cgd } parseKeywords[] = {
233 1.466 rillig { ".BEGIN", SP_BEGIN, OP_NONE },
234 1.466 rillig { ".DEFAULT", SP_DEFAULT, OP_NONE },
235 1.466 rillig { ".DELETE_ON_ERROR", SP_DELETE_ON_ERROR, OP_NONE },
236 1.466 rillig { ".END", SP_END, OP_NONE },
237 1.466 rillig { ".ERROR", SP_ERROR, OP_NONE },
238 1.404 rillig { ".EXEC", SP_ATTRIBUTE, OP_EXEC },
239 1.404 rillig { ".IGNORE", SP_IGNORE, OP_IGNORE },
240 1.466 rillig { ".INCLUDES", SP_INCLUDES, OP_NONE },
241 1.466 rillig { ".INTERRUPT", SP_INTERRUPT, OP_NONE },
242 1.404 rillig { ".INVISIBLE", SP_ATTRIBUTE, OP_INVISIBLE },
243 1.404 rillig { ".JOIN", SP_ATTRIBUTE, OP_JOIN },
244 1.466 rillig { ".LIBS", SP_LIBS, OP_NONE },
245 1.404 rillig { ".MADE", SP_ATTRIBUTE, OP_MADE },
246 1.466 rillig { ".MAIN", SP_MAIN, OP_NONE },
247 1.404 rillig { ".MAKE", SP_ATTRIBUTE, OP_MAKE },
248 1.466 rillig { ".MAKEFLAGS", SP_MFLAGS, OP_NONE },
249 1.404 rillig { ".META", SP_META, OP_META },
250 1.466 rillig { ".MFLAGS", SP_MFLAGS, OP_NONE },
251 1.404 rillig { ".NOMETA", SP_NOMETA, OP_NOMETA },
252 1.404 rillig { ".NOMETA_CMP", SP_NOMETA_CMP, OP_NOMETA_CMP },
253 1.404 rillig { ".NOPATH", SP_NOPATH, OP_NOPATH },
254 1.404 rillig { ".NOTMAIN", SP_ATTRIBUTE, OP_NOTMAIN },
255 1.466 rillig { ".NOTPARALLEL", SP_NOTPARALLEL, OP_NONE },
256 1.466 rillig { ".NO_PARALLEL", SP_NOTPARALLEL, OP_NONE },
257 1.466 rillig { ".NULL", SP_NULL, OP_NONE },
258 1.466 rillig { ".OBJDIR", SP_OBJDIR, OP_NONE },
259 1.404 rillig { ".OPTIONAL", SP_ATTRIBUTE, OP_OPTIONAL },
260 1.466 rillig { ".ORDER", SP_ORDER, OP_NONE },
261 1.466 rillig { ".PARALLEL", SP_PARALLEL, OP_NONE },
262 1.466 rillig { ".PATH", SP_PATH, OP_NONE },
263 1.404 rillig { ".PHONY", SP_PHONY, OP_PHONY },
264 1.48 sjg #ifdef POSIX
265 1.466 rillig { ".POSIX", SP_POSIX, OP_NONE },
266 1.48 sjg #endif
267 1.404 rillig { ".PRECIOUS", SP_PRECIOUS, OP_PRECIOUS },
268 1.404 rillig { ".RECURSIVE", SP_ATTRIBUTE, OP_MAKE },
269 1.466 rillig { ".SHELL", SP_SHELL, OP_NONE },
270 1.404 rillig { ".SILENT", SP_SILENT, OP_SILENT },
271 1.466 rillig { ".SINGLESHELL", SP_SINGLESHELL, OP_NONE },
272 1.466 rillig { ".STALE", SP_STALE, OP_NONE },
273 1.466 rillig { ".SUFFIXES", SP_SUFFIXES, OP_NONE },
274 1.404 rillig { ".USE", SP_ATTRIBUTE, OP_USE },
275 1.404 rillig { ".USEBEFORE", SP_ATTRIBUTE, OP_USEBEFORE },
276 1.466 rillig { ".WAIT", SP_WAIT, OP_NONE },
277 1.1 cgd };
278 1.1 cgd
279 1.170 dholland
280 1.627 rillig static IncludedFile *
281 1.618 rillig GetInclude(size_t i)
282 1.618 rillig {
283 1.618 rillig return Vector_Get(&includes, i);
284 1.618 rillig }
285 1.618 rillig
286 1.618 rillig /* The file that is currently being read. */
287 1.627 rillig static IncludedFile *
288 1.618 rillig CurFile(void)
289 1.618 rillig {
290 1.618 rillig return GetInclude(includes.len - 1);
291 1.618 rillig }
292 1.618 rillig
293 1.616 rillig static Buffer
294 1.414 rillig loadfile(const char *path, int fd)
295 1.414 rillig {
296 1.522 rillig ssize_t n;
297 1.522 rillig Buffer buf;
298 1.612 rillig size_t bufSize;
299 1.612 rillig struct stat st;
300 1.414 rillig
301 1.612 rillig bufSize = fstat(fd, &st) == 0 && S_ISREG(st.st_mode) &&
302 1.634 rillig st.st_size > 0 && st.st_size < 1024 * 1024 * 1024
303 1.612 rillig ? (size_t)st.st_size : 1024;
304 1.612 rillig Buf_InitSize(&buf, bufSize);
305 1.170 dholland
306 1.428 rillig for (;;) {
307 1.522 rillig if (buf.len == buf.cap) {
308 1.634 rillig if (buf.cap >= 512 * 1024 * 1024) {
309 1.221 riastrad Error("%s: file too large", path);
310 1.518 rillig exit(2); /* Not 1 so -q can distinguish error */
311 1.221 riastrad }
312 1.523 rillig Buf_Expand(&buf);
313 1.170 dholland }
314 1.522 rillig assert(buf.len < buf.cap);
315 1.522 rillig n = read(fd, buf.data + buf.len, buf.cap - buf.len);
316 1.522 rillig if (n < 0) {
317 1.170 dholland Error("%s: read error: %s", path, strerror(errno));
318 1.518 rillig exit(2); /* Not 1 so -q can distinguish error */
319 1.170 dholland }
320 1.522 rillig if (n == 0)
321 1.170 dholland break;
322 1.430 rillig
323 1.522 rillig buf.len += (size_t)n;
324 1.170 dholland }
325 1.522 rillig assert(buf.len <= buf.cap);
326 1.170 dholland
327 1.522 rillig if (!Buf_EndsWith(&buf, '\n'))
328 1.522 rillig Buf_AddByte(&buf, '\n');
329 1.170 dholland
330 1.630 rillig return buf; /* may not be null-terminated */
331 1.170 dholland }
332 1.170 dholland
333 1.532 rillig static void
334 1.532 rillig PrintStackTrace(void)
335 1.532 rillig {
336 1.627 rillig const IncludedFile *entries;
337 1.532 rillig size_t i, n;
338 1.532 rillig
339 1.532 rillig entries = GetInclude(0);
340 1.532 rillig n = includes.len;
341 1.532 rillig if (n == 0)
342 1.532 rillig return;
343 1.643 rillig
344 1.643 rillig if (entries[n - 1].forLoop == NULL)
345 1.643 rillig n--; /* already in the diagnostic */
346 1.532 rillig
347 1.532 rillig for (i = n; i-- > 0;) {
348 1.627 rillig const IncludedFile *entry = entries + i;
349 1.576 rillig const char *fname = entry->name.str;
350 1.532 rillig char dirbuf[MAXPATHLEN + 1];
351 1.532 rillig
352 1.532 rillig if (fname[0] != '/' && strcmp(fname, "(stdin)") != 0)
353 1.532 rillig fname = realpath(fname, dirbuf);
354 1.532 rillig
355 1.643 rillig if (entry->forLoop != NULL) {
356 1.644 rillig char *details = ForLoop_Details(entry->forLoop);
357 1.644 rillig debug_printf("\tin .for loop from %s:%d with %s\n",
358 1.644 rillig fname, entry->forHeadLineno, details);
359 1.644 rillig free(details);
360 1.646 rillig } else if (i + 1 < n && entries[i + 1].forLoop != NULL) {
361 1.646 rillig /* entry->lineno is not a useful line number */
362 1.646 rillig } else
363 1.646 rillig debug_printf("\tin %s:%d\n", fname, entry->lineno);
364 1.532 rillig }
365 1.532 rillig }
366 1.77 christos
367 1.279 rillig /* Check if the current character is escaped on the current line. */
368 1.553 rillig static bool
369 1.602 rillig IsEscaped(const char *line, const char *p)
370 1.77 christos {
371 1.628 rillig bool escaped = false;
372 1.594 rillig while (p > line && *--p == '\\')
373 1.628 rillig escaped = !escaped;
374 1.628 rillig return escaped;
375 1.77 christos }
376 1.77 christos
377 1.524 rillig /*
378 1.524 rillig * Add the filename and lineno to the GNode so that we remember where it
379 1.524 rillig * was first defined.
380 1.524 rillig */
381 1.278 rillig static void
382 1.562 rillig RememberLocation(GNode *gn)
383 1.278 rillig {
384 1.627 rillig IncludedFile *curFile = CurFile();
385 1.576 rillig gn->fname = Str_Intern(curFile->name.str);
386 1.639 rillig gn->lineno = curFile->lineno;
387 1.278 rillig }
388 1.278 rillig
389 1.524 rillig /*
390 1.524 rillig * Look in the table of keywords for one matching the given string.
391 1.524 rillig * Return the index of the keyword, or -1 if it isn't there.
392 1.524 rillig */
393 1.1 cgd static int
394 1.602 rillig FindKeyword(const char *str)
395 1.1 cgd {
396 1.469 rillig int start = 0;
397 1.469 rillig int end = sizeof parseKeywords / sizeof parseKeywords[0] - 1;
398 1.1 cgd
399 1.611 rillig while (start <= end) {
400 1.469 rillig int curr = start + (end - start) / 2;
401 1.469 rillig int diff = strcmp(str, parseKeywords[curr].name);
402 1.469 rillig
403 1.469 rillig if (diff == 0)
404 1.469 rillig return curr;
405 1.469 rillig if (diff < 0)
406 1.469 rillig end = curr - 1;
407 1.469 rillig else
408 1.469 rillig start = curr + 1;
409 1.611 rillig }
410 1.430 rillig
411 1.469 rillig return -1;
412 1.1 cgd }
413 1.1 cgd
414 1.291 rillig static void
415 1.441 rillig PrintLocation(FILE *f, const char *fname, size_t lineno)
416 1.291 rillig {
417 1.469 rillig char dirbuf[MAXPATHLEN + 1];
418 1.505 rillig FStr dir, base;
419 1.291 rillig
420 1.622 rillig if (fname[0] == '/' || strcmp(fname, "(stdin)") == 0) {
421 1.481 rillig (void)fprintf(f, "\"%s\" line %u: ", fname, (unsigned)lineno);
422 1.299 rillig return;
423 1.299 rillig }
424 1.291 rillig
425 1.548 rillig dir = Var_Value(SCOPE_GLOBAL, ".PARSEDIR");
426 1.505 rillig if (dir.str == NULL)
427 1.505 rillig dir.str = ".";
428 1.505 rillig if (dir.str[0] != '/')
429 1.505 rillig dir.str = realpath(dir.str, dirbuf);
430 1.505 rillig
431 1.548 rillig base = Var_Value(SCOPE_GLOBAL, ".PARSEFILE");
432 1.505 rillig if (base.str == NULL)
433 1.505 rillig base.str = str_basename(fname);
434 1.505 rillig
435 1.505 rillig (void)fprintf(f, "\"%s/%s\" line %u: ",
436 1.505 rillig dir.str, base.str, (unsigned)lineno);
437 1.505 rillig
438 1.505 rillig FStr_Done(&base);
439 1.505 rillig FStr_Done(&dir);
440 1.291 rillig }
441 1.291 rillig
442 1.649 rillig static void MAKE_ATTR_PRINTFLIKE(5, 0)
443 1.441 rillig ParseVErrorInternal(FILE *f, const char *fname, size_t lineno,
444 1.398 rillig ParseErrorLevel type, const char *fmt, va_list ap)
445 1.38 christos {
446 1.553 rillig static bool fatal_warning_error_printed = false;
447 1.56 christos
448 1.148 sjg (void)fprintf(f, "%s: ", progname);
449 1.63 christos
450 1.441 rillig if (fname != NULL)
451 1.441 rillig PrintLocation(f, fname, lineno);
452 1.38 christos if (type == PARSE_WARNING)
453 1.127 dsl (void)fprintf(f, "warning: ");
454 1.127 dsl (void)vfprintf(f, fmt, ap);
455 1.127 dsl (void)fprintf(f, "\n");
456 1.127 dsl (void)fflush(f);
457 1.300 rillig
458 1.621 rillig if (type == PARSE_FATAL)
459 1.621 rillig parseErrors++;
460 1.621 rillig if (type == PARSE_WARNING && opts.parseWarnFatal) {
461 1.621 rillig if (!fatal_warning_error_printed) {
462 1.621 rillig Error("parsing warnings being treated as errors");
463 1.621 rillig fatal_warning_error_printed = true;
464 1.621 rillig }
465 1.621 rillig parseErrors++;
466 1.56 christos }
467 1.532 rillig
468 1.642 rillig if (DEBUG(PARSE))
469 1.642 rillig PrintStackTrace();
470 1.38 christos }
471 1.38 christos
472 1.649 rillig static void MAKE_ATTR_PRINTFLIKE(4, 5)
473 1.441 rillig ParseErrorInternal(const char *fname, size_t lineno,
474 1.441 rillig ParseErrorLevel type, const char *fmt, ...)
475 1.203 joerg {
476 1.203 joerg va_list ap;
477 1.203 joerg
478 1.441 rillig (void)fflush(stdout);
479 1.203 joerg va_start(ap, fmt);
480 1.441 rillig ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
481 1.203 joerg va_end(ap);
482 1.203 joerg
483 1.622 rillig if (opts.debug_file != stdout && opts.debug_file != stderr) {
484 1.203 joerg va_start(ap, fmt);
485 1.441 rillig ParseVErrorInternal(opts.debug_file, fname, lineno, type,
486 1.469 rillig fmt, ap);
487 1.203 joerg va_end(ap);
488 1.203 joerg }
489 1.203 joerg }
490 1.203 joerg
491 1.524 rillig /*
492 1.524 rillig * Print a parse error message, including location information.
493 1.441 rillig *
494 1.441 rillig * If the level is PARSE_FATAL, continue parsing until the end of the
495 1.441 rillig * current top-level makefile, then exit (see Parse_File).
496 1.38 christos *
497 1.524 rillig * Fmt is given without a trailing newline.
498 1.524 rillig */
499 1.1 cgd void
500 1.398 rillig Parse_Error(ParseErrorLevel type, const char *fmt, ...)
501 1.1 cgd {
502 1.1 cgd va_list ap;
503 1.156 dsl const char *fname;
504 1.156 dsl size_t lineno;
505 1.84 wiz
506 1.408 rillig if (includes.len == 0) {
507 1.156 dsl fname = NULL;
508 1.156 dsl lineno = 0;
509 1.156 dsl } else {
510 1.627 rillig IncludedFile *curFile = CurFile();
511 1.576 rillig fname = curFile->name.str;
512 1.639 rillig lineno = (size_t)curFile->lineno;
513 1.148 sjg }
514 1.156 dsl
515 1.633 rillig (void)fflush(stdout);
516 1.156 dsl va_start(ap, fmt);
517 1.156 dsl ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
518 1.1 cgd va_end(ap);
519 1.127 dsl
520 1.622 rillig if (opts.debug_file != stdout && opts.debug_file != stderr) {
521 1.127 dsl va_start(ap, fmt);
522 1.401 rillig ParseVErrorInternal(opts.debug_file, fname, lineno, type,
523 1.469 rillig fmt, ap);
524 1.127 dsl va_end(ap);
525 1.127 dsl }
526 1.1 cgd }
527 1.1 cgd
528 1.161 sjg
529 1.524 rillig /*
530 1.602 rillig * Handle an .info, .warning or .error directive. For an .error directive,
531 1.602 rillig * exit immediately.
532 1.524 rillig */
533 1.503 rillig static void
534 1.602 rillig HandleMessage(ParseErrorLevel level, const char *levelName, const char *umsg)
535 1.161 sjg {
536 1.475 rillig char *xmsg;
537 1.469 rillig
538 1.503 rillig if (umsg[0] == '\0') {
539 1.503 rillig Parse_Error(PARSE_FATAL, "Missing argument for \".%s\"",
540 1.503 rillig levelName);
541 1.503 rillig return;
542 1.503 rillig }
543 1.469 rillig
544 1.545 rillig (void)Var_Subst(umsg, SCOPE_CMDLINE, VARE_WANTRES, &xmsg);
545 1.469 rillig /* TODO: handle errors */
546 1.469 rillig
547 1.475 rillig Parse_Error(level, "%s", xmsg);
548 1.475 rillig free(xmsg);
549 1.469 rillig
550 1.475 rillig if (level == PARSE_FATAL) {
551 1.469 rillig PrintOnError(NULL, NULL);
552 1.469 rillig exit(1);
553 1.469 rillig }
554 1.161 sjg }
555 1.161 sjg
556 1.524 rillig /*
557 1.630 rillig * Add the child to the parent's children, and for non-special targets, vice
558 1.630 rillig * versa. Special targets such as .END do not need to be informed once the
559 1.630 rillig * child target has been made.
560 1.524 rillig */
561 1.382 rillig static void
562 1.553 rillig LinkSource(GNode *pgn, GNode *cgn, bool isSpecial)
563 1.382 rillig {
564 1.469 rillig if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(&pgn->cohorts))
565 1.469 rillig pgn = pgn->cohorts.last->datum;
566 1.316 rillig
567 1.469 rillig Lst_Append(&pgn->children, cgn);
568 1.469 rillig pgn->unmade++;
569 1.316 rillig
570 1.469 rillig /* Special targets like .END don't need any children. */
571 1.469 rillig if (!isSpecial)
572 1.469 rillig Lst_Append(&cgn->parents, pgn);
573 1.469 rillig
574 1.469 rillig if (DEBUG(PARSE)) {
575 1.586 rillig debug_printf("# LinkSource: added child %s - %s\n",
576 1.586 rillig pgn->name, cgn->name);
577 1.469 rillig Targ_PrintNode(pgn, 0);
578 1.469 rillig Targ_PrintNode(cgn, 0);
579 1.469 rillig }
580 1.1 cgd }
581 1.1 cgd
582 1.382 rillig /* Add the node to each target from the current dependency group. */
583 1.382 rillig static void
584 1.553 rillig LinkToTargets(GNode *gn, bool isSpecial)
585 1.382 rillig {
586 1.469 rillig GNodeListNode *ln;
587 1.469 rillig
588 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
589 1.469 rillig LinkSource(ln->datum, gn, isSpecial);
590 1.382 rillig }
591 1.382 rillig
592 1.553 rillig static bool
593 1.337 rillig TryApplyDependencyOperator(GNode *gn, GNodeType op)
594 1.1 cgd {
595 1.1 cgd /*
596 1.469 rillig * If the node occurred on the left-hand side of a dependency and the
597 1.469 rillig * operator also defines a dependency, they must match.
598 1.1 cgd */
599 1.469 rillig if ((op & OP_OPMASK) && (gn->type & OP_OPMASK) &&
600 1.469 rillig ((op & OP_OPMASK) != (gn->type & OP_OPMASK))) {
601 1.469 rillig Parse_Error(PARSE_FATAL, "Inconsistent operator for %s",
602 1.469 rillig gn->name);
603 1.553 rillig return false;
604 1.469 rillig }
605 1.469 rillig
606 1.469 rillig if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
607 1.469 rillig /*
608 1.469 rillig * If the node was of the left-hand side of a '::' operator,
609 1.469 rillig * we need to create a new instance of it for the children
610 1.469 rillig * and commands on this dependency line since each of these
611 1.469 rillig * dependency groups has its own attributes and commands,
612 1.469 rillig * separate from the others.
613 1.469 rillig *
614 1.469 rillig * The new instance is placed on the 'cohorts' list of the
615 1.469 rillig * initial one (note the initial one is not on its own
616 1.469 rillig * cohorts list) and the new instance is linked to all
617 1.469 rillig * parents of the initial instance.
618 1.469 rillig */
619 1.469 rillig GNode *cohort;
620 1.27 christos
621 1.469 rillig /*
622 1.469 rillig * Propagate copied bits to the initial node. They'll be
623 1.469 rillig * propagated back to the rest of the cohorts later.
624 1.469 rillig */
625 1.469 rillig gn->type |= op & ~OP_OPMASK;
626 1.33 mycroft
627 1.469 rillig cohort = Targ_NewInternalNode(gn->name);
628 1.469 rillig if (doing_depend)
629 1.562 rillig RememberLocation(cohort);
630 1.469 rillig /*
631 1.469 rillig * Make the cohort invisible as well to avoid duplicating it
632 1.469 rillig * into other variables. True, parents of this target won't
633 1.469 rillig * tend to do anything with their local variables, but better
634 1.469 rillig * safe than sorry.
635 1.469 rillig *
636 1.469 rillig * (I think this is pointless now, since the relevant list
637 1.469 rillig * traversals will no longer see this node anyway. -mycroft)
638 1.469 rillig */
639 1.469 rillig cohort->type = op | OP_INVISIBLE;
640 1.469 rillig Lst_Append(&gn->cohorts, cohort);
641 1.469 rillig cohort->centurion = gn;
642 1.469 rillig gn->unmade_cohorts++;
643 1.469 rillig snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
644 1.469 rillig (unsigned int)gn->unmade_cohorts % 1000000);
645 1.469 rillig } else {
646 1.469 rillig /*
647 1.469 rillig * We don't want to nuke any previous flags (whatever they
648 1.469 rillig * were) so we just OR the new operator into the old.
649 1.469 rillig */
650 1.469 rillig gn->type |= op;
651 1.469 rillig }
652 1.33 mycroft
653 1.553 rillig return true;
654 1.337 rillig }
655 1.337 rillig
656 1.337 rillig static void
657 1.337 rillig ApplyDependencyOperator(GNodeType op)
658 1.337 rillig {
659 1.469 rillig GNodeListNode *ln;
660 1.469 rillig
661 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
662 1.469 rillig if (!TryApplyDependencyOperator(ln->datum, op))
663 1.469 rillig break;
664 1.1 cgd }
665 1.1 cgd
666 1.467 rillig /*
667 1.467 rillig * We add a .WAIT node in the dependency list. After any dynamic dependencies
668 1.467 rillig * (and filename globbing) have happened, it is given a dependency on each
669 1.467 rillig * previous child, back until the previous .WAIT node. The next child won't
670 1.467 rillig * be scheduled until the .WAIT node is built.
671 1.467 rillig *
672 1.467 rillig * We give each .WAIT node a unique name (mainly for diagnostics).
673 1.467 rillig */
674 1.467 rillig static void
675 1.593 rillig ApplyDependencySourceWait(bool isSpecial)
676 1.467 rillig {
677 1.645 rillig static unsigned wait_number = 0;
678 1.467 rillig char wait_src[16];
679 1.467 rillig GNode *gn;
680 1.467 rillig
681 1.467 rillig snprintf(wait_src, sizeof wait_src, ".WAIT_%u", ++wait_number);
682 1.467 rillig gn = Targ_NewInternalNode(wait_src);
683 1.467 rillig if (doing_depend)
684 1.562 rillig RememberLocation(gn);
685 1.467 rillig gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
686 1.467 rillig LinkToTargets(gn, isSpecial);
687 1.467 rillig
688 1.467 rillig }
689 1.467 rillig
690 1.553 rillig static bool
691 1.593 rillig ApplyDependencySourceKeyword(const char *src, ParseSpecial special)
692 1.1 cgd {
693 1.468 rillig int keywd;
694 1.590 rillig GNodeType targetAttr;
695 1.1 cgd
696 1.468 rillig if (*src != '.' || !ch_isupper(src[1]))
697 1.553 rillig return false;
698 1.468 rillig
699 1.602 rillig keywd = FindKeyword(src);
700 1.468 rillig if (keywd == -1)
701 1.553 rillig return false;
702 1.468 rillig
703 1.590 rillig targetAttr = parseKeywords[keywd].targetAttr;
704 1.590 rillig if (targetAttr != OP_NONE) {
705 1.590 rillig ApplyDependencyOperator(targetAttr);
706 1.553 rillig return true;
707 1.468 rillig }
708 1.590 rillig if (parseKeywords[keywd].special == SP_WAIT) {
709 1.593 rillig ApplyDependencySourceWait(special != SP_NOT);
710 1.553 rillig return true;
711 1.1 cgd }
712 1.553 rillig return false;
713 1.368 rillig }
714 1.18 christos
715 1.630 rillig /*
716 1.630 rillig * In a line like ".MAIN: source1 source2", add all sources to the list of
717 1.630 rillig * things to create, but only if the user didn't specify a target on the
718 1.630 rillig * command line and .MAIN occurs for the first time.
719 1.630 rillig *
720 1.630 rillig * See HandleDependencyTargetSpecial, branch SP_MAIN.
721 1.630 rillig * See unit-tests/cond-func-make-main.mk.
722 1.630 rillig */
723 1.368 rillig static void
724 1.593 rillig ApplyDependencySourceMain(const char *src)
725 1.368 rillig {
726 1.469 rillig Lst_Append(&opts.create, bmake_strdup(src));
727 1.469 rillig /*
728 1.469 rillig * Add the name to the .TARGETS variable as well, so the user can
729 1.469 rillig * employ that, if desired.
730 1.469 rillig */
731 1.542 rillig Global_Append(".TARGETS", src);
732 1.368 rillig }
733 1.18 christos
734 1.368 rillig static void
735 1.593 rillig ApplyDependencySourceOrder(const char *src)
736 1.368 rillig {
737 1.469 rillig GNode *gn;
738 1.469 rillig /*
739 1.469 rillig * Create proper predecessor/successor links between the previous
740 1.469 rillig * source and the current one.
741 1.469 rillig */
742 1.469 rillig gn = Targ_GetNode(src);
743 1.469 rillig if (doing_depend)
744 1.562 rillig RememberLocation(gn);
745 1.469 rillig if (order_pred != NULL) {
746 1.469 rillig Lst_Append(&order_pred->order_succ, gn);
747 1.469 rillig Lst_Append(&gn->order_pred, order_pred);
748 1.469 rillig if (DEBUG(PARSE)) {
749 1.586 rillig debug_printf(
750 1.592 rillig "# .ORDER forces '%s' to be made before '%s'\n",
751 1.586 rillig order_pred->name, gn->name);
752 1.469 rillig Targ_PrintNode(order_pred, 0);
753 1.469 rillig Targ_PrintNode(gn, 0);
754 1.469 rillig }
755 1.469 rillig }
756 1.469 rillig /*
757 1.469 rillig * The current source now becomes the predecessor for the next one.
758 1.469 rillig */
759 1.469 rillig order_pred = gn;
760 1.368 rillig }
761 1.368 rillig
762 1.630 rillig /* The source is not an attribute, so find/create a node for it. */
763 1.368 rillig static void
764 1.593 rillig ApplyDependencySourceOther(const char *src, GNodeType targetAttr,
765 1.587 rillig ParseSpecial special)
766 1.368 rillig {
767 1.469 rillig GNode *gn;
768 1.469 rillig
769 1.469 rillig gn = Targ_GetNode(src);
770 1.469 rillig if (doing_depend)
771 1.562 rillig RememberLocation(gn);
772 1.590 rillig if (targetAttr != OP_NONE)
773 1.590 rillig gn->type |= targetAttr;
774 1.469 rillig else
775 1.587 rillig LinkToTargets(gn, special != SP_NOT);
776 1.1 cgd }
777 1.1 cgd
778 1.469 rillig /*
779 1.469 rillig * Given the name of a source in a dependency line, figure out if it is an
780 1.590 rillig * attribute (such as .SILENT) and if so, apply it to all targets. Otherwise
781 1.368 rillig * decide if there is some attribute which should be applied *to* the source
782 1.368 rillig * because of some special target (such as .PHONY) and apply it if so.
783 1.590 rillig * Otherwise, make the source a child of the targets.
784 1.368 rillig */
785 1.368 rillig static void
786 1.593 rillig ApplyDependencySource(GNodeType targetAttr, const char *src,
787 1.590 rillig ParseSpecial special)
788 1.368 rillig {
789 1.593 rillig if (ApplyDependencySourceKeyword(src, special))
790 1.469 rillig return;
791 1.368 rillig
792 1.587 rillig if (special == SP_MAIN)
793 1.593 rillig ApplyDependencySourceMain(src);
794 1.587 rillig else if (special == SP_ORDER)
795 1.593 rillig ApplyDependencySourceOrder(src);
796 1.469 rillig else
797 1.593 rillig ApplyDependencySourceOther(src, targetAttr, special);
798 1.368 rillig }
799 1.368 rillig
800 1.469 rillig /*
801 1.469 rillig * If we have yet to decide on a main target to make, in the absence of any
802 1.335 rillig * user input, we want the first target on the first dependency line that is
803 1.469 rillig * actually a real target (i.e. isn't a .USE or .EXEC rule) to be made.
804 1.469 rillig */
805 1.335 rillig static void
806 1.630 rillig MaybeUpdateMainTarget(void)
807 1.1 cgd {
808 1.469 rillig GNodeListNode *ln;
809 1.335 rillig
810 1.469 rillig if (mainNode != NULL)
811 1.469 rillig return;
812 1.335 rillig
813 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
814 1.469 rillig GNode *gn = ln->datum;
815 1.589 rillig if (GNode_IsMainCandidate(gn)) {
816 1.469 rillig DEBUG1(MAKE, "Setting main node to \"%s\"\n", gn->name);
817 1.469 rillig mainNode = gn;
818 1.469 rillig return;
819 1.469 rillig }
820 1.335 rillig }
821 1.1 cgd }
822 1.1 cgd
823 1.311 rillig static void
824 1.630 rillig InvalidLineType(const char *line)
825 1.311 rillig {
826 1.630 rillig if (strncmp(line, "<<<<<<", 6) == 0 ||
827 1.630 rillig strncmp(line, "======", 6) == 0 ||
828 1.630 rillig strncmp(line, ">>>>>>", 6) == 0)
829 1.469 rillig Parse_Error(PARSE_FATAL,
830 1.563 rillig "Makefile appears to contain unresolved CVS/RCS/??? merge conflicts");
831 1.630 rillig else if (line[0] == '.') {
832 1.630 rillig const char *dirstart = line + 1;
833 1.469 rillig const char *dirend;
834 1.469 rillig cpp_skip_whitespace(&dirstart);
835 1.469 rillig dirend = dirstart;
836 1.469 rillig while (ch_isalnum(*dirend) || *dirend == '-')
837 1.469 rillig dirend++;
838 1.469 rillig Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
839 1.311 rillig (int)(dirend - dirstart), dirstart);
840 1.469 rillig } else
841 1.535 rillig Parse_Error(PARSE_FATAL, "Invalid line type");
842 1.311 rillig }
843 1.311 rillig
844 1.314 rillig static void
845 1.599 rillig ParseDependencyTargetWord(char **pp, const char *lstart)
846 1.314 rillig {
847 1.469 rillig const char *cp = *pp;
848 1.469 rillig
849 1.469 rillig while (*cp != '\0') {
850 1.469 rillig if ((ch_isspace(*cp) || *cp == '!' || *cp == ':' ||
851 1.469 rillig *cp == '(') &&
852 1.602 rillig !IsEscaped(lstart, cp))
853 1.469 rillig break;
854 1.314 rillig
855 1.469 rillig if (*cp == '$') {
856 1.469 rillig /*
857 1.469 rillig * Must be a dynamic source (would have been expanded
858 1.619 rillig * otherwise).
859 1.469 rillig *
860 1.469 rillig * There should be no errors in this, as they would
861 1.469 rillig * have been discovered in the initial Var_Subst and
862 1.469 rillig * we wouldn't be here.
863 1.469 rillig */
864 1.624 rillig FStr val;
865 1.314 rillig
866 1.624 rillig (void)Var_Parse(&cp, SCOPE_CMDLINE,
867 1.624 rillig VARE_PARSE_ONLY, &val);
868 1.624 rillig FStr_Done(&val);
869 1.469 rillig } else
870 1.469 rillig cp++;
871 1.469 rillig }
872 1.314 rillig
873 1.599 rillig *pp += cp - *pp;
874 1.314 rillig }
875 1.314 rillig
876 1.559 rillig /*
877 1.559 rillig * Handle special targets like .PATH, .DEFAULT, .BEGIN, .ORDER.
878 1.559 rillig *
879 1.559 rillig * See the tests deptgt-*.mk.
880 1.559 rillig */
881 1.368 rillig static void
882 1.602 rillig HandleDependencyTargetSpecial(const char *targetName,
883 1.602 rillig ParseSpecial *inout_special,
884 1.602 rillig SearchPathList **inout_paths)
885 1.368 rillig {
886 1.587 rillig switch (*inout_special) {
887 1.469 rillig case SP_PATH:
888 1.469 rillig if (*inout_paths == NULL)
889 1.469 rillig *inout_paths = Lst_New();
890 1.469 rillig Lst_Append(*inout_paths, &dirSearchPath);
891 1.469 rillig break;
892 1.469 rillig case SP_MAIN:
893 1.469 rillig /*
894 1.469 rillig * Allow targets from the command line to override the
895 1.469 rillig * .MAIN node.
896 1.469 rillig */
897 1.469 rillig if (!Lst_IsEmpty(&opts.create))
898 1.587 rillig *inout_special = SP_NOT;
899 1.469 rillig break;
900 1.469 rillig case SP_BEGIN:
901 1.469 rillig case SP_END:
902 1.469 rillig case SP_STALE:
903 1.469 rillig case SP_ERROR:
904 1.469 rillig case SP_INTERRUPT: {
905 1.530 rillig GNode *gn = Targ_GetNode(targetName);
906 1.469 rillig if (doing_depend)
907 1.562 rillig RememberLocation(gn);
908 1.469 rillig gn->type |= OP_NOTMAIN | OP_SPECIAL;
909 1.469 rillig Lst_Append(targets, gn);
910 1.469 rillig break;
911 1.469 rillig }
912 1.469 rillig case SP_DEFAULT: {
913 1.469 rillig /*
914 1.469 rillig * Need to create a node to hang commands on, but we don't
915 1.469 rillig * want it in the graph, nor do we want it to be the Main
916 1.469 rillig * Target. We claim the node is a transformation rule to make
917 1.469 rillig * life easier later, when we'll use Make_HandleUse to
918 1.469 rillig * actually apply the .DEFAULT commands.
919 1.469 rillig */
920 1.469 rillig GNode *gn = GNode_New(".DEFAULT");
921 1.469 rillig gn->type |= OP_NOTMAIN | OP_TRANSFORM;
922 1.469 rillig Lst_Append(targets, gn);
923 1.469 rillig defaultNode = gn;
924 1.469 rillig break;
925 1.469 rillig }
926 1.469 rillig case SP_DELETE_ON_ERROR:
927 1.553 rillig deleteOnError = true;
928 1.469 rillig break;
929 1.469 rillig case SP_NOTPARALLEL:
930 1.469 rillig opts.maxJobs = 1;
931 1.469 rillig break;
932 1.469 rillig case SP_SINGLESHELL:
933 1.553 rillig opts.compatMake = true;
934 1.469 rillig break;
935 1.469 rillig case SP_ORDER:
936 1.469 rillig order_pred = NULL;
937 1.469 rillig break;
938 1.469 rillig default:
939 1.469 rillig break;
940 1.469 rillig }
941 1.368 rillig }
942 1.368 rillig
943 1.553 rillig static bool
944 1.602 rillig HandleDependencyTargetPath(const char *suffixName,
945 1.602 rillig SearchPathList **inout_paths)
946 1.368 rillig {
947 1.469 rillig SearchPath *path;
948 1.368 rillig
949 1.530 rillig path = Suff_GetPath(suffixName);
950 1.469 rillig if (path == NULL) {
951 1.469 rillig Parse_Error(PARSE_FATAL,
952 1.530 rillig "Suffix '%s' not defined (yet)", suffixName);
953 1.553 rillig return false;
954 1.469 rillig }
955 1.430 rillig
956 1.469 rillig if (*inout_paths == NULL)
957 1.469 rillig *inout_paths = Lst_New();
958 1.469 rillig Lst_Append(*inout_paths, path);
959 1.430 rillig
960 1.553 rillig return true;
961 1.368 rillig }
962 1.368 rillig
963 1.628 rillig /* See if it's a special target and if so set inout_special to match it. */
964 1.553 rillig static bool
965 1.602 rillig HandleDependencyTarget(const char *targetName,
966 1.602 rillig ParseSpecial *inout_special,
967 1.602 rillig GNodeType *inout_targetAttr,
968 1.602 rillig SearchPathList **inout_paths)
969 1.364 rillig {
970 1.469 rillig int keywd;
971 1.469 rillig
972 1.530 rillig if (!(targetName[0] == '.' && ch_isupper(targetName[1])))
973 1.553 rillig return true;
974 1.469 rillig
975 1.469 rillig /*
976 1.469 rillig * See if the target is a special target that must have it
977 1.469 rillig * or its sources handled specially.
978 1.469 rillig */
979 1.602 rillig keywd = FindKeyword(targetName);
980 1.469 rillig if (keywd != -1) {
981 1.587 rillig if (*inout_special == SP_PATH &&
982 1.590 rillig parseKeywords[keywd].special != SP_PATH) {
983 1.469 rillig Parse_Error(PARSE_FATAL, "Mismatched special targets");
984 1.553 rillig return false;
985 1.469 rillig }
986 1.469 rillig
987 1.590 rillig *inout_special = parseKeywords[keywd].special;
988 1.590 rillig *inout_targetAttr = parseKeywords[keywd].targetAttr;
989 1.469 rillig
990 1.602 rillig HandleDependencyTargetSpecial(targetName, inout_special,
991 1.469 rillig inout_paths);
992 1.364 rillig
993 1.530 rillig } else if (strncmp(targetName, ".PATH", 5) == 0) {
994 1.587 rillig *inout_special = SP_PATH;
995 1.602 rillig if (!HandleDependencyTargetPath(targetName + 5, inout_paths))
996 1.553 rillig return false;
997 1.469 rillig }
998 1.553 rillig return true;
999 1.368 rillig }
1000 1.368 rillig
1001 1.368 rillig static void
1002 1.602 rillig HandleDependencyTargetMundane(char *targetName)
1003 1.368 rillig {
1004 1.595 rillig StringList targetNames = LST_INIT;
1005 1.595 rillig
1006 1.530 rillig if (Dir_HasWildcards(targetName)) {
1007 1.469 rillig SearchPath *emptyPath = SearchPath_New();
1008 1.595 rillig SearchPath_Expand(emptyPath, targetName, &targetNames);
1009 1.469 rillig SearchPath_Free(emptyPath);
1010 1.595 rillig } else
1011 1.595 rillig Lst_Append(&targetNames, targetName);
1012 1.368 rillig
1013 1.595 rillig while (!Lst_IsEmpty(&targetNames)) {
1014 1.595 rillig char *targName = Lst_Dequeue(&targetNames);
1015 1.469 rillig GNode *gn = Suff_IsTransform(targName)
1016 1.368 rillig ? Suff_AddTransform(targName)
1017 1.368 rillig : Targ_GetNode(targName);
1018 1.469 rillig if (doing_depend)
1019 1.562 rillig RememberLocation(gn);
1020 1.368 rillig
1021 1.469 rillig Lst_Append(targets, gn);
1022 1.469 rillig }
1023 1.368 rillig }
1024 1.368 rillig
1025 1.368 rillig static void
1026 1.603 rillig SkipExtraTargets(char **pp, const char *lstart)
1027 1.368 rillig {
1028 1.553 rillig bool warning = false;
1029 1.628 rillig const char *p = *pp;
1030 1.368 rillig
1031 1.628 rillig while (*p != '\0') {
1032 1.628 rillig if (!IsEscaped(lstart, p) && (*p == '!' || *p == ':'))
1033 1.469 rillig break;
1034 1.628 rillig if (IsEscaped(lstart, p) || (*p != ' ' && *p != '\t'))
1035 1.553 rillig warning = true;
1036 1.628 rillig p++;
1037 1.469 rillig }
1038 1.469 rillig if (warning)
1039 1.469 rillig Parse_Error(PARSE_WARNING, "Extra target ignored");
1040 1.430 rillig
1041 1.628 rillig *pp += p - *pp;
1042 1.368 rillig }
1043 1.368 rillig
1044 1.368 rillig static void
1045 1.628 rillig CheckSpecialMundaneMixture(ParseSpecial special)
1046 1.368 rillig {
1047 1.587 rillig switch (special) {
1048 1.469 rillig case SP_DEFAULT:
1049 1.469 rillig case SP_STALE:
1050 1.469 rillig case SP_BEGIN:
1051 1.469 rillig case SP_END:
1052 1.469 rillig case SP_ERROR:
1053 1.469 rillig case SP_INTERRUPT:
1054 1.469 rillig /*
1055 1.469 rillig * These create nodes on which to hang commands, so targets
1056 1.469 rillig * shouldn't be empty.
1057 1.469 rillig */
1058 1.469 rillig case SP_NOT:
1059 1.583 rillig /*
1060 1.583 rillig * Nothing special here -- targets can be empty if it wants.
1061 1.583 rillig */
1062 1.469 rillig break;
1063 1.582 rillig default:
1064 1.582 rillig Parse_Error(PARSE_WARNING,
1065 1.582 rillig "Special and mundane targets don't mix. "
1066 1.582 rillig "Mundane ones ignored");
1067 1.582 rillig break;
1068 1.469 rillig }
1069 1.368 rillig }
1070 1.368 rillig
1071 1.560 rillig /*
1072 1.560 rillig * In a dependency line like 'targets: sources' or 'targets! sources', parse
1073 1.560 rillig * the operator ':', '::' or '!' from between the targets and the sources.
1074 1.560 rillig */
1075 1.578 rillig static GNodeType
1076 1.578 rillig ParseDependencyOp(char **pp)
1077 1.368 rillig {
1078 1.578 rillig if (**pp == '!')
1079 1.578 rillig return (*pp)++, OP_FORCE;
1080 1.578 rillig if ((*pp)[1] == ':')
1081 1.630 rillig return *pp += 2, OP_DOUBLEDEP;
1082 1.578 rillig else
1083 1.578 rillig return (*pp)++, OP_DEPENDS;
1084 1.368 rillig }
1085 1.364 rillig
1086 1.368 rillig static void
1087 1.392 rillig ClearPaths(SearchPathList *paths)
1088 1.392 rillig {
1089 1.469 rillig if (paths != NULL) {
1090 1.469 rillig SearchPathListNode *ln;
1091 1.469 rillig for (ln = paths->first; ln != NULL; ln = ln->next)
1092 1.469 rillig SearchPath_Clear(ln->datum);
1093 1.469 rillig }
1094 1.392 rillig
1095 1.469 rillig Dir_SetPATH();
1096 1.392 rillig }
1097 1.392 rillig
1098 1.630 rillig /* Handle a "dependency" line like '.SPECIAL:' without any sources. */
1099 1.392 rillig static void
1100 1.630 rillig HandleDependencySourcesEmpty(ParseSpecial special, SearchPathList *paths)
1101 1.368 rillig {
1102 1.587 rillig switch (special) {
1103 1.469 rillig case SP_SUFFIXES:
1104 1.469 rillig Suff_ClearSuffixes();
1105 1.469 rillig break;
1106 1.469 rillig case SP_PRECIOUS:
1107 1.553 rillig allPrecious = true;
1108 1.469 rillig break;
1109 1.469 rillig case SP_IGNORE:
1110 1.553 rillig opts.ignoreErrors = true;
1111 1.469 rillig break;
1112 1.469 rillig case SP_SILENT:
1113 1.584 rillig opts.silent = true;
1114 1.469 rillig break;
1115 1.469 rillig case SP_PATH:
1116 1.469 rillig ClearPaths(paths);
1117 1.469 rillig break;
1118 1.368 rillig #ifdef POSIX
1119 1.469 rillig case SP_POSIX:
1120 1.540 rillig Global_Set("%POSIX", "1003.2");
1121 1.469 rillig break;
1122 1.368 rillig #endif
1123 1.469 rillig default:
1124 1.469 rillig break;
1125 1.469 rillig }
1126 1.368 rillig }
1127 1.364 rillig
1128 1.393 rillig static void
1129 1.393 rillig AddToPaths(const char *dir, SearchPathList *paths)
1130 1.393 rillig {
1131 1.469 rillig if (paths != NULL) {
1132 1.469 rillig SearchPathListNode *ln;
1133 1.469 rillig for (ln = paths->first; ln != NULL; ln = ln->next)
1134 1.529 rillig (void)SearchPath_Add(ln->datum, dir);
1135 1.469 rillig }
1136 1.393 rillig }
1137 1.393 rillig
1138 1.368 rillig /*
1139 1.610 rillig * If the target was one that doesn't take files as its sources but takes
1140 1.610 rillig * something like suffixes, we take each space-separated word on the line as
1141 1.610 rillig * a something and deal with it accordingly.
1142 1.368 rillig */
1143 1.368 rillig static void
1144 1.622 rillig ParseDependencySourceSpecial(ParseSpecial special, const char *word,
1145 1.556 rillig SearchPathList *paths)
1146 1.368 rillig {
1147 1.587 rillig switch (special) {
1148 1.469 rillig case SP_SUFFIXES:
1149 1.632 rillig Suff_AddSuffix(word);
1150 1.469 rillig break;
1151 1.469 rillig case SP_PATH:
1152 1.469 rillig AddToPaths(word, paths);
1153 1.469 rillig break;
1154 1.469 rillig case SP_INCLUDES:
1155 1.469 rillig Suff_AddInclude(word);
1156 1.469 rillig break;
1157 1.469 rillig case SP_LIBS:
1158 1.469 rillig Suff_AddLib(word);
1159 1.469 rillig break;
1160 1.469 rillig case SP_NULL:
1161 1.469 rillig Suff_SetNull(word);
1162 1.469 rillig break;
1163 1.469 rillig case SP_OBJDIR:
1164 1.553 rillig Main_SetObjdir(false, "%s", word);
1165 1.469 rillig break;
1166 1.469 rillig default:
1167 1.469 rillig break;
1168 1.469 rillig }
1169 1.368 rillig }
1170 1.364 rillig
1171 1.553 rillig static bool
1172 1.601 rillig ApplyDependencyTarget(char *name, char *nameEnd, ParseSpecial *inout_special,
1173 1.601 rillig GNodeType *inout_targetAttr,
1174 1.601 rillig SearchPathList **inout_paths)
1175 1.601 rillig {
1176 1.601 rillig char savec = *nameEnd;
1177 1.601 rillig *nameEnd = '\0';
1178 1.601 rillig
1179 1.602 rillig if (!HandleDependencyTarget(name, inout_special,
1180 1.601 rillig inout_targetAttr, inout_paths))
1181 1.601 rillig return false;
1182 1.601 rillig
1183 1.601 rillig if (*inout_special == SP_NOT && *name != '\0')
1184 1.602 rillig HandleDependencyTargetMundane(name);
1185 1.601 rillig else if (*inout_special == SP_PATH && *name != '.' && *name != '\0')
1186 1.601 rillig Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", name);
1187 1.601 rillig
1188 1.601 rillig *nameEnd = savec;
1189 1.601 rillig return true;
1190 1.601 rillig }
1191 1.601 rillig
1192 1.601 rillig static bool
1193 1.556 rillig ParseDependencyTargets(char **inout_cp,
1194 1.556 rillig const char *lstart,
1195 1.587 rillig ParseSpecial *inout_special,
1196 1.590 rillig GNodeType *inout_targetAttr,
1197 1.595 rillig SearchPathList **inout_paths)
1198 1.368 rillig {
1199 1.625 rillig char *cp = *inout_cp;
1200 1.469 rillig
1201 1.469 rillig for (;;) {
1202 1.625 rillig char *tgt = cp;
1203 1.625 rillig
1204 1.599 rillig ParseDependencyTargetWord(&cp, lstart);
1205 1.469 rillig
1206 1.469 rillig /*
1207 1.469 rillig * If the word is followed by a left parenthesis, it's the
1208 1.596 rillig * name of one or more files inside an archive.
1209 1.469 rillig */
1210 1.602 rillig if (!IsEscaped(lstart, cp) && *cp == '(') {
1211 1.625 rillig cp = tgt;
1212 1.625 rillig if (!Arch_ParseArchive(&cp, targets, SCOPE_CMDLINE)) {
1213 1.469 rillig Parse_Error(PARSE_FATAL,
1214 1.469 rillig "Error in archive specification: \"%s\"",
1215 1.469 rillig tgt);
1216 1.553 rillig return false;
1217 1.469 rillig }
1218 1.469 rillig continue;
1219 1.469 rillig }
1220 1.444 rillig
1221 1.469 rillig if (*cp == '\0') {
1222 1.602 rillig InvalidLineType(lstart);
1223 1.553 rillig return false;
1224 1.469 rillig }
1225 1.27 christos
1226 1.601 rillig if (!ApplyDependencyTarget(tgt, cp, inout_special,
1227 1.590 rillig inout_targetAttr, inout_paths))
1228 1.553 rillig return false;
1229 1.118 dsl
1230 1.587 rillig if (*inout_special != SP_NOT && *inout_special != SP_PATH)
1231 1.603 rillig SkipExtraTargets(&cp, lstart);
1232 1.469 rillig else
1233 1.469 rillig pp_skip_whitespace(&cp);
1234 1.368 rillig
1235 1.625 rillig if (*cp == '\0')
1236 1.469 rillig break;
1237 1.625 rillig if ((*cp == '!' || *cp == ':') && !IsEscaped(lstart, cp))
1238 1.469 rillig break;
1239 1.469 rillig }
1240 1.430 rillig
1241 1.469 rillig *inout_cp = cp;
1242 1.553 rillig return true;
1243 1.368 rillig }
1244 1.27 christos
1245 1.368 rillig static void
1246 1.597 rillig ParseDependencySourcesSpecial(char *start,
1247 1.587 rillig ParseSpecial special, SearchPathList *paths)
1248 1.368 rillig {
1249 1.469 rillig char savec;
1250 1.204 dholland
1251 1.469 rillig while (*start != '\0') {
1252 1.597 rillig char *end = start;
1253 1.469 rillig while (*end != '\0' && !ch_isspace(*end))
1254 1.469 rillig end++;
1255 1.469 rillig savec = *end;
1256 1.469 rillig *end = '\0';
1257 1.587 rillig ParseDependencySourceSpecial(special, start, paths);
1258 1.469 rillig *end = savec;
1259 1.469 rillig if (savec != '\0')
1260 1.469 rillig end++;
1261 1.469 rillig pp_skip_whitespace(&end);
1262 1.469 rillig start = end;
1263 1.469 rillig }
1264 1.368 rillig }
1265 1.368 rillig
1266 1.553 rillig static bool
1267 1.597 rillig ParseDependencySourcesMundane(char *start,
1268 1.590 rillig ParseSpecial special, GNodeType targetAttr)
1269 1.368 rillig {
1270 1.469 rillig while (*start != '\0') {
1271 1.597 rillig char *end = start;
1272 1.367 rillig /*
1273 1.469 rillig * The targets take real sources, so we must beware of archive
1274 1.469 rillig * specifications (i.e. things with left parentheses in them)
1275 1.469 rillig * and handle them accordingly.
1276 1.367 rillig */
1277 1.469 rillig for (; *end != '\0' && !ch_isspace(*end); end++) {
1278 1.469 rillig if (*end == '(' && end > start && end[-1] != '$') {
1279 1.469 rillig /*
1280 1.469 rillig * Only stop for a left parenthesis if it
1281 1.469 rillig * isn't at the start of a word (that'll be
1282 1.469 rillig * for variable changes later) and isn't
1283 1.469 rillig * preceded by a dollar sign (a dynamic
1284 1.469 rillig * source).
1285 1.469 rillig */
1286 1.469 rillig break;
1287 1.469 rillig }
1288 1.469 rillig }
1289 1.368 rillig
1290 1.469 rillig if (*end == '(') {
1291 1.469 rillig GNodeList sources = LST_INIT;
1292 1.545 rillig if (!Arch_ParseArchive(&start, &sources,
1293 1.545 rillig SCOPE_CMDLINE)) {
1294 1.469 rillig Parse_Error(PARSE_FATAL,
1295 1.469 rillig "Error in source archive spec \"%s\"",
1296 1.469 rillig start);
1297 1.553 rillig return false;
1298 1.469 rillig }
1299 1.368 rillig
1300 1.469 rillig while (!Lst_IsEmpty(&sources)) {
1301 1.469 rillig GNode *gn = Lst_Dequeue(&sources);
1302 1.593 rillig ApplyDependencySource(targetAttr, gn->name,
1303 1.590 rillig special);
1304 1.469 rillig }
1305 1.469 rillig Lst_Done(&sources);
1306 1.469 rillig end = start;
1307 1.469 rillig } else {
1308 1.469 rillig if (*end != '\0') {
1309 1.469 rillig *end = '\0';
1310 1.469 rillig end++;
1311 1.469 rillig }
1312 1.368 rillig
1313 1.593 rillig ApplyDependencySource(targetAttr, start, special);
1314 1.469 rillig }
1315 1.469 rillig pp_skip_whitespace(&end);
1316 1.469 rillig start = end;
1317 1.368 rillig }
1318 1.553 rillig return true;
1319 1.368 rillig }
1320 1.1 cgd
1321 1.559 rillig /*
1322 1.626 rillig * From a dependency line like 'targets: sources', parse the sources.
1323 1.559 rillig *
1324 1.559 rillig * See the tests depsrc-*.mk.
1325 1.559 rillig */
1326 1.558 rillig static void
1327 1.597 rillig ParseDependencySources(char *p, GNodeType targetAttr,
1328 1.587 rillig ParseSpecial special, SearchPathList **inout_paths)
1329 1.558 rillig {
1330 1.597 rillig if (*p == '\0') {
1331 1.630 rillig HandleDependencySourcesEmpty(special, *inout_paths);
1332 1.587 rillig } else if (special == SP_MFLAGS) {
1333 1.597 rillig Main_ParseArgLine(p);
1334 1.626 rillig return;
1335 1.587 rillig } else if (special == SP_SHELL) {
1336 1.597 rillig if (!Job_ParseShell(p)) {
1337 1.558 rillig Parse_Error(PARSE_FATAL,
1338 1.558 rillig "improper shell specification");
1339 1.558 rillig return;
1340 1.558 rillig }
1341 1.626 rillig return;
1342 1.587 rillig } else if (special == SP_NOTPARALLEL || special == SP_SINGLESHELL ||
1343 1.587 rillig special == SP_DELETE_ON_ERROR) {
1344 1.626 rillig return;
1345 1.558 rillig }
1346 1.558 rillig
1347 1.558 rillig /* Now go for the sources. */
1348 1.587 rillig if (special == SP_SUFFIXES || special == SP_PATH ||
1349 1.587 rillig special == SP_INCLUDES || special == SP_LIBS ||
1350 1.587 rillig special == SP_NULL || special == SP_OBJDIR) {
1351 1.597 rillig ParseDependencySourcesSpecial(p, special, *inout_paths);
1352 1.558 rillig if (*inout_paths != NULL) {
1353 1.558 rillig Lst_Free(*inout_paths);
1354 1.558 rillig *inout_paths = NULL;
1355 1.558 rillig }
1356 1.587 rillig if (special == SP_PATH)
1357 1.558 rillig Dir_SetPATH();
1358 1.558 rillig } else {
1359 1.558 rillig assert(*inout_paths == NULL);
1360 1.597 rillig if (!ParseDependencySourcesMundane(p, special, targetAttr))
1361 1.558 rillig return;
1362 1.558 rillig }
1363 1.558 rillig
1364 1.630 rillig MaybeUpdateMainTarget();
1365 1.558 rillig }
1366 1.558 rillig
1367 1.524 rillig /*
1368 1.524 rillig * Parse a dependency line consisting of targets, followed by a dependency
1369 1.368 rillig * operator, optionally followed by sources.
1370 1.368 rillig *
1371 1.368 rillig * The nodes of the sources are linked as children to the nodes of the
1372 1.368 rillig * targets. Nodes are created as necessary.
1373 1.368 rillig *
1374 1.368 rillig * The operator is applied to each node in the global 'targets' list,
1375 1.585 rillig * which is where the nodes found for the targets are kept.
1376 1.368 rillig *
1377 1.368 rillig * The sources are parsed in much the same way as the targets, except
1378 1.368 rillig * that they are expanded using the wildcarding scheme of the C-Shell,
1379 1.441 rillig * and a target is created for each expanded word. Each of the resulting
1380 1.441 rillig * nodes is then linked to each of the targets as one of its children.
1381 1.368 rillig *
1382 1.368 rillig * Certain targets and sources such as .PHONY or .PRECIOUS are handled
1383 1.585 rillig * specially, see ParseSpecial.
1384 1.368 rillig *
1385 1.585 rillig * Transformation rules such as '.c.o' are also handled here, see
1386 1.585 rillig * Suff_AddTransform.
1387 1.441 rillig *
1388 1.441 rillig * Upon return, the value of the line is unspecified.
1389 1.368 rillig */
1390 1.368 rillig static void
1391 1.556 rillig ParseDependency(char *line)
1392 1.368 rillig {
1393 1.600 rillig char *p;
1394 1.583 rillig SearchPathList *paths; /* search paths to alter when parsing a list
1395 1.583 rillig * of .PATH targets */
1396 1.590 rillig GNodeType targetAttr; /* from special sources */
1397 1.600 rillig ParseSpecial special; /* in special targets, the children are
1398 1.600 rillig * linked as children of the parent but not
1399 1.600 rillig * vice versa */
1400 1.469 rillig
1401 1.556 rillig DEBUG1(PARSE, "ParseDependency(%s)\n", line);
1402 1.600 rillig p = line;
1403 1.600 rillig paths = NULL;
1404 1.590 rillig targetAttr = OP_NONE;
1405 1.600 rillig special = SP_NOT;
1406 1.469 rillig
1407 1.600 rillig if (!ParseDependencyTargets(&p, line, &special, &targetAttr, &paths))
1408 1.469 rillig goto out;
1409 1.469 rillig
1410 1.469 rillig if (!Lst_IsEmpty(targets))
1411 1.628 rillig CheckSpecialMundaneMixture(special);
1412 1.469 rillig
1413 1.600 rillig ApplyDependencyOperator(ParseDependencyOp(&p));
1414 1.469 rillig
1415 1.600 rillig pp_skip_whitespace(&p);
1416 1.469 rillig
1417 1.600 rillig ParseDependencySources(p, targetAttr, special, &paths);
1418 1.1 cgd
1419 1.112 christos out:
1420 1.469 rillig if (paths != NULL)
1421 1.469 rillig Lst_Free(paths);
1422 1.1 cgd }
1423 1.1 cgd
1424 1.605 rillig typedef enum VarAssignOp {
1425 1.605 rillig VAR_NORMAL, /* = */
1426 1.605 rillig VAR_APPEND, /* += */
1427 1.605 rillig VAR_DEFAULT, /* ?= */
1428 1.605 rillig VAR_SUBST, /* := */
1429 1.605 rillig VAR_SHELL /* != or :sh= */
1430 1.605 rillig } VarAssignOp;
1431 1.605 rillig
1432 1.605 rillig typedef struct VarAssign {
1433 1.605 rillig char *varname; /* unexpanded */
1434 1.605 rillig VarAssignOp op;
1435 1.605 rillig const char *value; /* unexpanded */
1436 1.605 rillig } VarAssign;
1437 1.605 rillig
1438 1.469 rillig /*
1439 1.469 rillig * Determine the assignment operator and adjust the end of the variable
1440 1.469 rillig * name accordingly.
1441 1.469 rillig */
1442 1.606 rillig static VarAssign
1443 1.606 rillig AdjustVarassignOp(const char *name, const char *nameEnd, const char *op,
1444 1.606 rillig const char *value)
1445 1.388 rillig {
1446 1.469 rillig VarAssignOp type;
1447 1.606 rillig VarAssign va;
1448 1.469 rillig
1449 1.469 rillig if (op > name && op[-1] == '+') {
1450 1.579 rillig op--;
1451 1.469 rillig type = VAR_APPEND;
1452 1.469 rillig
1453 1.469 rillig } else if (op > name && op[-1] == '?') {
1454 1.469 rillig op--;
1455 1.469 rillig type = VAR_DEFAULT;
1456 1.469 rillig
1457 1.469 rillig } else if (op > name && op[-1] == ':') {
1458 1.469 rillig op--;
1459 1.469 rillig type = VAR_SUBST;
1460 1.469 rillig
1461 1.469 rillig } else if (op > name && op[-1] == '!') {
1462 1.469 rillig op--;
1463 1.469 rillig type = VAR_SHELL;
1464 1.388 rillig
1465 1.469 rillig } else {
1466 1.469 rillig type = VAR_NORMAL;
1467 1.388 rillig #ifdef SUNSHCMD
1468 1.469 rillig while (op > name && ch_isspace(op[-1]))
1469 1.469 rillig op--;
1470 1.388 rillig
1471 1.608 rillig if (op - name >= 3 && memcmp(op - 3, ":sh", 3) == 0) {
1472 1.579 rillig op -= 3;
1473 1.469 rillig type = VAR_SHELL;
1474 1.469 rillig }
1475 1.469 rillig #endif
1476 1.388 rillig }
1477 1.388 rillig
1478 1.606 rillig va.varname = bmake_strsedup(name, nameEnd < op ? nameEnd : op);
1479 1.606 rillig va.op = type;
1480 1.606 rillig va.value = value;
1481 1.606 rillig return va;
1482 1.388 rillig }
1483 1.388 rillig
1484 1.469 rillig /*
1485 1.469 rillig * Parse a variable assignment, consisting of a single-word variable name,
1486 1.368 rillig * optional whitespace, an assignment operator, optional whitespace and the
1487 1.368 rillig * variable value.
1488 1.84 wiz *
1489 1.410 rillig * Note: There is a lexical ambiguity with assignment modifier characters
1490 1.410 rillig * in variable names. This routine interprets the character before the =
1491 1.410 rillig * as a modifier. Therefore, an assignment like
1492 1.410 rillig * C++=/usr/bin/CC
1493 1.410 rillig * is interpreted as "C+ +=" instead of "C++ =".
1494 1.410 rillig *
1495 1.469 rillig * Used for both lines in a file and command line arguments.
1496 1.469 rillig */
1497 1.605 rillig static bool
1498 1.368 rillig Parse_IsVar(const char *p, VarAssign *out_var)
1499 1.1 cgd {
1500 1.606 rillig const char *nameStart;
1501 1.606 rillig const char *nameEnd;
1502 1.606 rillig const char *eq;
1503 1.469 rillig const char *firstSpace = NULL;
1504 1.469 rillig int level = 0;
1505 1.469 rillig
1506 1.469 rillig cpp_skip_hspace(&p); /* Skip to variable name */
1507 1.469 rillig
1508 1.469 rillig /*
1509 1.469 rillig * During parsing, the '+' of the '+=' operator is initially parsed
1510 1.469 rillig * as part of the variable name. It is later corrected, as is the
1511 1.469 rillig * ':sh' modifier. Of these two (nameEnd and op), the earlier one
1512 1.469 rillig * determines the actual end of the variable name.
1513 1.469 rillig */
1514 1.606 rillig nameStart = p;
1515 1.368 rillig #ifdef CLEANUP
1516 1.606 rillig nameEnd = NULL;
1517 1.606 rillig eq = NULL;
1518 1.368 rillig #endif
1519 1.356 rillig
1520 1.469 rillig /*
1521 1.469 rillig * Scan for one of the assignment operators outside a variable
1522 1.469 rillig * expansion.
1523 1.469 rillig */
1524 1.469 rillig while (*p != '\0') {
1525 1.469 rillig char ch = *p++;
1526 1.469 rillig if (ch == '(' || ch == '{') {
1527 1.469 rillig level++;
1528 1.469 rillig continue;
1529 1.469 rillig }
1530 1.469 rillig if (ch == ')' || ch == '}') {
1531 1.469 rillig level--;
1532 1.469 rillig continue;
1533 1.469 rillig }
1534 1.469 rillig
1535 1.469 rillig if (level != 0)
1536 1.469 rillig continue;
1537 1.469 rillig
1538 1.469 rillig if (ch == ' ' || ch == '\t')
1539 1.469 rillig if (firstSpace == NULL)
1540 1.469 rillig firstSpace = p - 1;
1541 1.469 rillig while (ch == ' ' || ch == '\t')
1542 1.469 rillig ch = *p++;
1543 1.368 rillig
1544 1.191 sjg #ifdef SUNSHCMD
1545 1.469 rillig if (ch == ':' && p[0] == 's' && p[1] == 'h') {
1546 1.469 rillig p += 2;
1547 1.469 rillig continue;
1548 1.469 rillig }
1549 1.469 rillig #endif
1550 1.607 rillig if (ch == '=')
1551 1.606 rillig eq = p - 1;
1552 1.607 rillig else if (*p == '=' &&
1553 1.607 rillig (ch == '+' || ch == ':' || ch == '?' || ch == '!'))
1554 1.606 rillig eq = p;
1555 1.607 rillig else if (firstSpace != NULL)
1556 1.553 rillig return false;
1557 1.607 rillig else
1558 1.607 rillig continue;
1559 1.607 rillig
1560 1.607 rillig nameEnd = firstSpace != NULL ? firstSpace : eq;
1561 1.607 rillig p = eq + 1;
1562 1.607 rillig cpp_skip_whitespace(&p);
1563 1.607 rillig *out_var = AdjustVarassignOp(nameStart, nameEnd, eq, p);
1564 1.607 rillig return true;
1565 1.191 sjg }
1566 1.1 cgd
1567 1.553 rillig return false;
1568 1.1 cgd }
1569 1.1 cgd
1570 1.469 rillig /*
1571 1.469 rillig * Check for syntax errors such as unclosed expressions or unknown modifiers.
1572 1.469 rillig */
1573 1.368 rillig static void
1574 1.546 rillig VarCheckSyntax(VarAssignOp type, const char *uvalue, GNode *scope)
1575 1.368 rillig {
1576 1.515 rillig if (opts.strict) {
1577 1.469 rillig if (type != VAR_SUBST && strchr(uvalue, '$') != NULL) {
1578 1.469 rillig char *expandedValue;
1579 1.469 rillig
1580 1.551 rillig (void)Var_Subst(uvalue, scope, VARE_PARSE_ONLY,
1581 1.469 rillig &expandedValue);
1582 1.469 rillig /* TODO: handle errors */
1583 1.469 rillig free(expandedValue);
1584 1.469 rillig }
1585 1.243 sjg }
1586 1.368 rillig }
1587 1.368 rillig
1588 1.630 rillig /* Perform a variable assignment that uses the operator ':='. */
1589 1.390 rillig static void
1590 1.548 rillig VarAssign_EvalSubst(GNode *scope, const char *name, const char *uvalue,
1591 1.506 rillig FStr *out_avalue)
1592 1.390 rillig {
1593 1.469 rillig char *evalue;
1594 1.469 rillig
1595 1.469 rillig /*
1596 1.469 rillig * make sure that we set the variable the first time to nothing
1597 1.538 rillig * so that it gets substituted.
1598 1.538 rillig *
1599 1.538 rillig * TODO: Add a test that demonstrates why this code is needed,
1600 1.538 rillig * apart from making the debug log longer.
1601 1.633 rillig *
1602 1.630 rillig * XXX: The variable name is expanded up to 3 times.
1603 1.469 rillig */
1604 1.548 rillig if (!Var_ExistsExpand(scope, name))
1605 1.548 rillig Var_SetExpand(scope, name, "");
1606 1.469 rillig
1607 1.552 rillig (void)Var_Subst(uvalue, scope, VARE_KEEP_DOLLAR_UNDEF, &evalue);
1608 1.469 rillig /* TODO: handle errors */
1609 1.520 rillig
1610 1.548 rillig Var_SetExpand(scope, name, evalue);
1611 1.390 rillig
1612 1.536 rillig *out_avalue = FStr_InitOwn(evalue);
1613 1.390 rillig }
1614 1.390 rillig
1615 1.630 rillig /* Perform a variable assignment that uses the operator '!='. */
1616 1.390 rillig static void
1617 1.546 rillig VarAssign_EvalShell(const char *name, const char *uvalue, GNode *scope,
1618 1.506 rillig FStr *out_avalue)
1619 1.390 rillig {
1620 1.507 rillig FStr cmd;
1621 1.648 rillig char *output, *error;
1622 1.469 rillig
1623 1.507 rillig cmd = FStr_InitRefer(uvalue);
1624 1.650 rillig Var_Expand(&cmd, SCOPE_CMDLINE, VARE_UNDEFERR);
1625 1.469 rillig
1626 1.648 rillig output = Cmd_Exec(cmd.str, &error);
1627 1.648 rillig Var_SetExpand(scope, name, output);
1628 1.648 rillig *out_avalue = FStr_InitOwn(output);
1629 1.648 rillig if (error != NULL) {
1630 1.648 rillig Parse_Error(PARSE_WARNING, "%s", error);
1631 1.648 rillig free(error);
1632 1.648 rillig }
1633 1.390 rillig
1634 1.507 rillig FStr_Done(&cmd);
1635 1.390 rillig }
1636 1.390 rillig
1637 1.524 rillig /*
1638 1.524 rillig * Perform a variable assignment.
1639 1.391 rillig *
1640 1.554 rillig * The actual value of the variable is returned in *out_true_avalue.
1641 1.538 rillig * Especially for VAR_SUBST and VAR_SHELL this can differ from the literal
1642 1.538 rillig * value.
1643 1.538 rillig *
1644 1.538 rillig * Return whether the assignment was actually performed, which is usually
1645 1.538 rillig * the case. It is only skipped if the operator is '?=' and the variable
1646 1.538 rillig * already exists.
1647 1.524 rillig */
1648 1.553 rillig static bool
1649 1.391 rillig VarAssign_Eval(const char *name, VarAssignOp op, const char *uvalue,
1650 1.554 rillig GNode *scope, FStr *out_true_avalue)
1651 1.368 rillig {
1652 1.506 rillig FStr avalue = FStr_InitRefer(uvalue);
1653 1.469 rillig
1654 1.469 rillig if (op == VAR_APPEND)
1655 1.548 rillig Var_AppendExpand(scope, name, uvalue);
1656 1.469 rillig else if (op == VAR_SUBST)
1657 1.548 rillig VarAssign_EvalSubst(scope, name, uvalue, &avalue);
1658 1.469 rillig else if (op == VAR_SHELL)
1659 1.546 rillig VarAssign_EvalShell(name, uvalue, scope, &avalue);
1660 1.469 rillig else {
1661 1.630 rillig /* XXX: The variable name is expanded up to 2 times. */
1662 1.548 rillig if (op == VAR_DEFAULT && Var_ExistsExpand(scope, name))
1663 1.553 rillig return false;
1664 1.353 rillig
1665 1.469 rillig /* Normal assignment -- just do it. */
1666 1.548 rillig Var_SetExpand(scope, name, uvalue);
1667 1.469 rillig }
1668 1.469 rillig
1669 1.554 rillig *out_true_avalue = avalue;
1670 1.553 rillig return true;
1671 1.368 rillig }
1672 1.368 rillig
1673 1.368 rillig static void
1674 1.368 rillig VarAssignSpecial(const char *name, const char *avalue)
1675 1.368 rillig {
1676 1.469 rillig if (strcmp(name, MAKEOVERRIDES) == 0)
1677 1.583 rillig Main_ExportMAKEFLAGS(false); /* re-export MAKEFLAGS */
1678 1.469 rillig else if (strcmp(name, ".CURDIR") == 0) {
1679 1.469 rillig /*
1680 1.469 rillig * Someone is being (too?) clever...
1681 1.469 rillig * Let's pretend they know what they are doing and
1682 1.469 rillig * re-initialize the 'cur' CachedDir.
1683 1.469 rillig */
1684 1.469 rillig Dir_InitCur(avalue);
1685 1.469 rillig Dir_SetPATH();
1686 1.469 rillig } else if (strcmp(name, MAKE_JOB_PREFIX) == 0)
1687 1.469 rillig Job_SetPrefix();
1688 1.469 rillig else if (strcmp(name, MAKE_EXPORTED) == 0)
1689 1.473 rillig Var_ExportVars(avalue);
1690 1.368 rillig }
1691 1.368 rillig
1692 1.579 rillig /* Perform the variable assignment in the given scope. */
1693 1.605 rillig static void
1694 1.556 rillig Parse_Var(VarAssign *var, GNode *scope)
1695 1.368 rillig {
1696 1.583 rillig FStr avalue; /* actual value (maybe expanded) */
1697 1.368 rillig
1698 1.546 rillig VarCheckSyntax(var->op, var->value, scope);
1699 1.546 rillig if (VarAssign_Eval(var->varname, var->op, var->value, scope, &avalue)) {
1700 1.506 rillig VarAssignSpecial(var->varname, avalue.str);
1701 1.506 rillig FStr_Done(&avalue);
1702 1.506 rillig }
1703 1.368 rillig
1704 1.469 rillig free(var->varname);
1705 1.1 cgd }
1706 1.23 christos
1707 1.200 christos
1708 1.524 rillig /*
1709 1.524 rillig * See if the command possibly calls a sub-make by using the variable
1710 1.524 rillig * expressions ${.MAKE}, ${MAKE} or the plain word "make".
1711 1.524 rillig */
1712 1.553 rillig static bool
1713 1.432 rillig MaybeSubMake(const char *cmd)
1714 1.195 christos {
1715 1.469 rillig const char *start;
1716 1.432 rillig
1717 1.469 rillig for (start = cmd; *start != '\0'; start++) {
1718 1.469 rillig const char *p = start;
1719 1.469 rillig char endc;
1720 1.469 rillig
1721 1.469 rillig /* XXX: What if progname != "make"? */
1722 1.579 rillig if (strncmp(p, "make", 4) == 0)
1723 1.469 rillig if (start == cmd || !ch_isalnum(p[-1]))
1724 1.469 rillig if (!ch_isalnum(p[4]))
1725 1.553 rillig return true;
1726 1.469 rillig
1727 1.469 rillig if (*p != '$')
1728 1.469 rillig continue;
1729 1.469 rillig p++;
1730 1.469 rillig
1731 1.469 rillig if (*p == '{')
1732 1.469 rillig endc = '}';
1733 1.469 rillig else if (*p == '(')
1734 1.469 rillig endc = ')';
1735 1.469 rillig else
1736 1.469 rillig continue;
1737 1.469 rillig p++;
1738 1.432 rillig
1739 1.469 rillig if (*p == '.') /* Accept either ${.MAKE} or ${MAKE}. */
1740 1.469 rillig p++;
1741 1.432 rillig
1742 1.619 rillig if (strncmp(p, "MAKE", 4) == 0 && p[4] == endc)
1743 1.619 rillig return true;
1744 1.469 rillig }
1745 1.553 rillig return false;
1746 1.195 christos }
1747 1.195 christos
1748 1.524 rillig /*
1749 1.524 rillig * Append the command to the target node.
1750 1.1 cgd *
1751 1.327 rillig * The node may be marked as a submake node if the command is determined to
1752 1.524 rillig * be that.
1753 1.524 rillig */
1754 1.327 rillig static void
1755 1.593 rillig GNode_AddCommand(GNode *gn, char *cmd)
1756 1.9 jtc {
1757 1.469 rillig /* Add to last (ie current) cohort for :: targets */
1758 1.469 rillig if ((gn->type & OP_DOUBLEDEP) && gn->cohorts.last != NULL)
1759 1.469 rillig gn = gn->cohorts.last->datum;
1760 1.469 rillig
1761 1.469 rillig /* if target already supplied, ignore commands */
1762 1.469 rillig if (!(gn->type & OP_HAS_COMMANDS)) {
1763 1.469 rillig Lst_Append(&gn->commands, cmd);
1764 1.469 rillig if (MaybeSubMake(cmd))
1765 1.469 rillig gn->type |= OP_SUBMAKE;
1766 1.562 rillig RememberLocation(gn);
1767 1.469 rillig } else {
1768 1.327 rillig #if 0
1769 1.469 rillig /* XXX: We cannot do this until we fix the tree */
1770 1.469 rillig Lst_Append(&gn->commands, cmd);
1771 1.469 rillig Parse_Error(PARSE_WARNING,
1772 1.469 rillig "overriding commands for target \"%s\"; "
1773 1.469 rillig "previous commands defined at %s: %d ignored",
1774 1.469 rillig gn->name, gn->fname, gn->lineno);
1775 1.203 joerg #else
1776 1.469 rillig Parse_Error(PARSE_WARNING,
1777 1.374 rillig "duplicate script for target \"%s\" ignored",
1778 1.374 rillig gn->name);
1779 1.469 rillig ParseErrorInternal(gn->fname, (size_t)gn->lineno, PARSE_WARNING,
1780 1.469 rillig "using previous script for \"%s\" defined here",
1781 1.469 rillig gn->name);
1782 1.203 joerg #endif
1783 1.469 rillig }
1784 1.1 cgd }
1785 1.1 cgd
1786 1.469 rillig /*
1787 1.469 rillig * Add a directory to the path searched for included makefiles bracketed
1788 1.469 rillig * by double-quotes.
1789 1.469 rillig */
1790 1.1 cgd void
1791 1.344 rillig Parse_AddIncludeDir(const char *dir)
1792 1.1 cgd {
1793 1.529 rillig (void)SearchPath_Add(parseIncPath, dir);
1794 1.1 cgd }
1795 1.1 cgd
1796 1.524 rillig /*
1797 1.524 rillig * Handle one of the .[-ds]include directives by remembering the current file
1798 1.441 rillig * and pushing the included file on the stack. After the included file has
1799 1.574 rillig * finished, parsing continues with the including file; see Parse_PushInput
1800 1.441 rillig * and ParseEOF.
1801 1.441 rillig *
1802 1.441 rillig * System includes are looked up in sysIncPath, any other includes are looked
1803 1.441 rillig * up in the parsedir and then in the directories specified by the -I command
1804 1.441 rillig * line options.
1805 1.1 cgd */
1806 1.1 cgd static void
1807 1.567 rillig IncludeFile(const char *file, bool isSystem, bool depinc, bool silent)
1808 1.1 cgd {
1809 1.616 rillig Buffer buf;
1810 1.469 rillig char *fullname; /* full pathname of file */
1811 1.469 rillig char *newName;
1812 1.469 rillig char *slash, *incdir;
1813 1.469 rillig int fd;
1814 1.469 rillig int i;
1815 1.469 rillig
1816 1.469 rillig fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
1817 1.469 rillig
1818 1.469 rillig if (fullname == NULL && !isSystem) {
1819 1.469 rillig /*
1820 1.469 rillig * Include files contained in double-quotes are first searched
1821 1.469 rillig * relative to the including file's location. We don't want to
1822 1.469 rillig * cd there, of course, so we just tack on the old file's
1823 1.469 rillig * leading path components and call Dir_FindFile to see if
1824 1.469 rillig * we can locate the file.
1825 1.469 rillig */
1826 1.469 rillig
1827 1.576 rillig incdir = bmake_strdup(CurFile()->name.str);
1828 1.469 rillig slash = strrchr(incdir, '/');
1829 1.469 rillig if (slash != NULL) {
1830 1.469 rillig *slash = '\0';
1831 1.469 rillig /*
1832 1.469 rillig * Now do lexical processing of leading "../" on the
1833 1.469 rillig * filename.
1834 1.469 rillig */
1835 1.469 rillig for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
1836 1.469 rillig slash = strrchr(incdir + 1, '/');
1837 1.469 rillig if (slash == NULL || strcmp(slash, "/..") == 0)
1838 1.469 rillig break;
1839 1.469 rillig *slash = '\0';
1840 1.469 rillig }
1841 1.469 rillig newName = str_concat3(incdir, "/", file + i);
1842 1.469 rillig fullname = Dir_FindFile(newName, parseIncPath);
1843 1.469 rillig if (fullname == NULL)
1844 1.469 rillig fullname = Dir_FindFile(newName,
1845 1.469 rillig &dirSearchPath);
1846 1.469 rillig free(newName);
1847 1.469 rillig }
1848 1.469 rillig free(incdir);
1849 1.469 rillig
1850 1.469 rillig if (fullname == NULL) {
1851 1.469 rillig /*
1852 1.469 rillig * Makefile wasn't found in same directory as included
1853 1.469 rillig * makefile.
1854 1.469 rillig *
1855 1.469 rillig * Search for it first on the -I search path, then on
1856 1.469 rillig * the .PATH search path, if not found in a -I
1857 1.469 rillig * directory. If we have a suffix-specific path, we
1858 1.469 rillig * should use that.
1859 1.469 rillig */
1860 1.469 rillig const char *suff;
1861 1.469 rillig SearchPath *suffPath = NULL;
1862 1.469 rillig
1863 1.516 rillig if ((suff = strrchr(file, '.')) != NULL) {
1864 1.469 rillig suffPath = Suff_GetPath(suff);
1865 1.469 rillig if (suffPath != NULL)
1866 1.469 rillig fullname = Dir_FindFile(file, suffPath);
1867 1.469 rillig }
1868 1.469 rillig if (fullname == NULL) {
1869 1.469 rillig fullname = Dir_FindFile(file, parseIncPath);
1870 1.469 rillig if (fullname == NULL)
1871 1.469 rillig fullname = Dir_FindFile(file,
1872 1.469 rillig &dirSearchPath);
1873 1.469 rillig }
1874 1.469 rillig }
1875 1.1 cgd }
1876 1.140 dsl
1877 1.469 rillig /* Looking for a system file or file still not found */
1878 1.142 sjg if (fullname == NULL) {
1879 1.469 rillig /*
1880 1.469 rillig * Look for it on the system path
1881 1.469 rillig */
1882 1.531 rillig SearchPath *path = Lst_IsEmpty(&sysIncPath->dirs)
1883 1.531 rillig ? defSysIncPath : sysIncPath;
1884 1.469 rillig fullname = Dir_FindFile(file, path);
1885 1.469 rillig }
1886 1.469 rillig
1887 1.469 rillig if (fullname == NULL) {
1888 1.469 rillig if (!silent)
1889 1.469 rillig Parse_Error(PARSE_FATAL, "Could not find %s", file);
1890 1.469 rillig return;
1891 1.469 rillig }
1892 1.469 rillig
1893 1.469 rillig /* Actually open the file... */
1894 1.469 rillig fd = open(fullname, O_RDONLY);
1895 1.469 rillig if (fd == -1) {
1896 1.469 rillig if (!silent)
1897 1.469 rillig Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
1898 1.469 rillig free(fullname);
1899 1.469 rillig return;
1900 1.469 rillig }
1901 1.469 rillig
1902 1.616 rillig buf = loadfile(fullname, fd);
1903 1.613 rillig (void)close(fd);
1904 1.469 rillig
1905 1.639 rillig Parse_PushInput(fullname, 1, 0, buf, NULL);
1906 1.469 rillig if (depinc)
1907 1.469 rillig doing_depend = depinc; /* only turn it on */
1908 1.575 rillig free(fullname);
1909 1.123 dsl }
1910 1.123 dsl
1911 1.566 rillig /*
1912 1.566 rillig * Parse a directive like '.include' or '.-include'.
1913 1.566 rillig *
1914 1.566 rillig * .include "user-makefile.mk"
1915 1.566 rillig * .include <system-makefile.mk>
1916 1.566 rillig */
1917 1.123 dsl static void
1918 1.556 rillig ParseInclude(char *directive)
1919 1.123 dsl {
1920 1.567 rillig char endc; /* '>' or '"' */
1921 1.567 rillig char *p;
1922 1.553 rillig bool silent = directive[0] != 'i';
1923 1.566 rillig FStr file;
1924 1.123 dsl
1925 1.566 rillig p = directive + (silent ? 8 : 7);
1926 1.566 rillig pp_skip_hspace(&p);
1927 1.123 dsl
1928 1.566 rillig if (*p != '"' && *p != '<') {
1929 1.469 rillig Parse_Error(PARSE_FATAL,
1930 1.374 rillig ".include filename must be delimited by '\"' or '<'");
1931 1.469 rillig return;
1932 1.469 rillig }
1933 1.123 dsl
1934 1.566 rillig if (*p++ == '<')
1935 1.469 rillig endc = '>';
1936 1.469 rillig else
1937 1.469 rillig endc = '"';
1938 1.566 rillig file = FStr_InitRefer(p);
1939 1.469 rillig
1940 1.469 rillig /* Skip to matching delimiter */
1941 1.566 rillig while (*p != '\0' && *p != endc)
1942 1.566 rillig p++;
1943 1.123 dsl
1944 1.566 rillig if (*p != endc) {
1945 1.469 rillig Parse_Error(PARSE_FATAL,
1946 1.441 rillig "Unclosed .include filename. '%c' expected", endc);
1947 1.469 rillig return;
1948 1.469 rillig }
1949 1.430 rillig
1950 1.566 rillig *p = '\0';
1951 1.123 dsl
1952 1.650 rillig Var_Expand(&file, SCOPE_CMDLINE, VARE_WANTRES);
1953 1.567 rillig IncludeFile(file.str, endc == '>', directive[0] == 'd', silent);
1954 1.567 rillig FStr_Done(&file);
1955 1.1 cgd }
1956 1.1 cgd
1957 1.524 rillig /*
1958 1.524 rillig * Split filename into dirname + basename, then assign these to the
1959 1.524 rillig * given variables.
1960 1.524 rillig */
1961 1.193 christos static void
1962 1.281 rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
1963 1.193 christos {
1964 1.550 rillig const char *slash, *basename;
1965 1.550 rillig FStr dirname;
1966 1.469 rillig
1967 1.469 rillig slash = strrchr(filename, '/');
1968 1.469 rillig if (slash == NULL) {
1969 1.550 rillig dirname = FStr_InitRefer(curdir);
1970 1.469 rillig basename = filename;
1971 1.469 rillig } else {
1972 1.550 rillig dirname = FStr_InitOwn(bmake_strsedup(filename, slash));
1973 1.469 rillig basename = slash + 1;
1974 1.469 rillig }
1975 1.281 rillig
1976 1.568 rillig Global_Set(dirvar, dirname.str);
1977 1.568 rillig Global_Set(filevar, basename);
1978 1.469 rillig
1979 1.586 rillig DEBUG4(PARSE, "SetFilenameVars: ${%s} = `%s' ${%s} = `%s'\n",
1980 1.586 rillig dirvar, dirname.str, filevar, basename);
1981 1.550 rillig FStr_Done(&dirname);
1982 1.281 rillig }
1983 1.281 rillig
1984 1.469 rillig /*
1985 1.469 rillig * Return the immediately including file.
1986 1.281 rillig *
1987 1.281 rillig * This is made complicated since the .for loop is implemented as a special
1988 1.469 rillig * kind of .include; see For_Run.
1989 1.469 rillig */
1990 1.281 rillig static const char *
1991 1.281 rillig GetActuallyIncludingFile(void)
1992 1.281 rillig {
1993 1.469 rillig size_t i;
1994 1.627 rillig const IncludedFile *incs = GetInclude(0);
1995 1.193 christos
1996 1.469 rillig for (i = includes.len; i >= 2; i--)
1997 1.617 rillig if (incs[i - 1].forLoop == NULL)
1998 1.576 rillig return incs[i - 2].name.str;
1999 1.469 rillig return NULL;
2000 1.193 christos }
2001 1.281 rillig
2002 1.285 rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
2003 1.44 aidan static void
2004 1.593 rillig SetParseFile(const char *filename)
2005 1.44 aidan {
2006 1.469 rillig const char *including;
2007 1.44 aidan
2008 1.469 rillig SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
2009 1.281 rillig
2010 1.469 rillig including = GetActuallyIncludingFile();
2011 1.469 rillig if (including != NULL) {
2012 1.469 rillig SetFilenameVars(including,
2013 1.469 rillig ".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
2014 1.469 rillig } else {
2015 1.547 rillig Global_Delete(".INCLUDEDFROMDIR");
2016 1.547 rillig Global_Delete(".INCLUDEDFROMFILE");
2017 1.469 rillig }
2018 1.44 aidan }
2019 1.44 aidan
2020 1.553 rillig static bool
2021 1.418 rillig StrContainsWord(const char *str, const char *word)
2022 1.418 rillig {
2023 1.469 rillig size_t strLen = strlen(str);
2024 1.469 rillig size_t wordLen = strlen(word);
2025 1.588 rillig const char *p;
2026 1.469 rillig
2027 1.469 rillig if (strLen < wordLen)
2028 1.585 rillig return false;
2029 1.469 rillig
2030 1.469 rillig for (p = str; p != NULL; p = strchr(p, ' ')) {
2031 1.469 rillig if (*p == ' ')
2032 1.469 rillig p++;
2033 1.588 rillig if (p > str + strLen - wordLen)
2034 1.585 rillig return false;
2035 1.469 rillig
2036 1.469 rillig if (memcmp(p, word, wordLen) == 0 &&
2037 1.469 rillig (p[wordLen] == '\0' || p[wordLen] == ' '))
2038 1.553 rillig return true;
2039 1.469 rillig }
2040 1.553 rillig return false;
2041 1.469 rillig }
2042 1.469 rillig
2043 1.469 rillig /*
2044 1.469 rillig * XXX: Searching through a set of words with this linear search is
2045 1.469 rillig * inefficient for variables that contain thousands of words.
2046 1.469 rillig *
2047 1.469 rillig * XXX: The paths in this list don't seem to be normalized in any way.
2048 1.469 rillig */
2049 1.553 rillig static bool
2050 1.418 rillig VarContainsWord(const char *varname, const char *word)
2051 1.418 rillig {
2052 1.548 rillig FStr val = Var_Value(SCOPE_GLOBAL, varname);
2053 1.553 rillig bool found = val.str != NULL && StrContainsWord(val.str, word);
2054 1.505 rillig FStr_Done(&val);
2055 1.469 rillig return found;
2056 1.418 rillig }
2057 1.418 rillig
2058 1.524 rillig /*
2059 1.524 rillig * Track the makefiles we read - so makefiles can set dependencies on them.
2060 1.441 rillig * Avoid adding anything more than once.
2061 1.441 rillig *
2062 1.441 rillig * Time complexity: O(n) per call, in total O(n^2), where n is the number
2063 1.524 rillig * of makefiles that have been loaded.
2064 1.524 rillig */
2065 1.184 sjg static void
2066 1.593 rillig TrackInput(const char *name)
2067 1.184 sjg {
2068 1.469 rillig if (!VarContainsWord(MAKE_MAKEFILES, name))
2069 1.542 rillig Global_Append(MAKE_MAKEFILES, name);
2070 1.184 sjg }
2071 1.137 sjg
2072 1.44 aidan
2073 1.630 rillig /* Parse from the given buffer, later return to the current file. */
2074 1.5 cgd void
2075 1.639 rillig Parse_PushInput(const char *name, int lineno, int readLines, Buffer buf,
2076 1.616 rillig struct ForLoop *forLoop)
2077 1.5 cgd {
2078 1.627 rillig IncludedFile *curFile;
2079 1.469 rillig
2080 1.617 rillig if (forLoop != NULL)
2081 1.576 rillig name = CurFile()->name.str;
2082 1.469 rillig else
2083 1.593 rillig TrackInput(name);
2084 1.469 rillig
2085 1.574 rillig DEBUG3(PARSE, "Parse_PushInput: %s %s, line %d\n",
2086 1.617 rillig forLoop != NULL ? ".for loop in": "file", name, lineno);
2087 1.5 cgd
2088 1.469 rillig curFile = Vector_Push(&includes);
2089 1.576 rillig curFile->name = FStr_InitOwn(bmake_strdup(name));
2090 1.639 rillig curFile->lineno = lineno;
2091 1.639 rillig curFile->readLines = readLines;
2092 1.639 rillig curFile->forHeadLineno = lineno;
2093 1.639 rillig curFile->forBodyReadLines = readLines;
2094 1.616 rillig curFile->buf = buf;
2095 1.469 rillig curFile->depending = doing_depend; /* restore this on EOF */
2096 1.616 rillig curFile->forLoop = forLoop;
2097 1.469 rillig
2098 1.616 rillig if (forLoop != NULL && !For_NextIteration(forLoop, &curFile->buf))
2099 1.616 rillig abort(); /* see For_Run */
2100 1.469 rillig
2101 1.616 rillig curFile->buf_ptr = curFile->buf.data;
2102 1.616 rillig curFile->buf_end = curFile->buf.data + curFile->buf.len;
2103 1.469 rillig curFile->cond_depth = Cond_save_depth();
2104 1.593 rillig SetParseFile(name);
2105 1.5 cgd }
2106 1.5 cgd
2107 1.375 rillig /* Check if the directive is an include directive. */
2108 1.553 rillig static bool
2109 1.553 rillig IsInclude(const char *dir, bool sysv)
2110 1.228 christos {
2111 1.298 rillig if (dir[0] == 's' || dir[0] == '-' || (dir[0] == 'd' && !sysv))
2112 1.298 rillig dir++;
2113 1.228 christos
2114 1.298 rillig if (strncmp(dir, "include", 7) != 0)
2115 1.553 rillig return false;
2116 1.228 christos
2117 1.248 rillig /* Space is not mandatory for BSD .include */
2118 1.298 rillig return !sysv || ch_isspace(dir[7]);
2119 1.228 christos }
2120 1.228 christos
2121 1.228 christos
2122 1.5 cgd #ifdef SYSVINCLUDE
2123 1.284 rillig /* Check if the line is a SYSV include directive. */
2124 1.553 rillig static bool
2125 1.228 christos IsSysVInclude(const char *line)
2126 1.228 christos {
2127 1.228 christos const char *p;
2128 1.228 christos
2129 1.553 rillig if (!IsInclude(line, true))
2130 1.553 rillig return false;
2131 1.228 christos
2132 1.375 rillig /* Avoid interpreting a dependency line as an include */
2133 1.228 christos for (p = line; (p = strchr(p, ':')) != NULL;) {
2134 1.430 rillig
2135 1.430 rillig /* end of line -> it's a dependency */
2136 1.430 rillig if (*++p == '\0')
2137 1.553 rillig return false;
2138 1.430 rillig
2139 1.430 rillig /* '::' operator or ': ' -> it's a dependency */
2140 1.430 rillig if (*p == ':' || ch_isspace(*p))
2141 1.553 rillig return false;
2142 1.228 christos }
2143 1.553 rillig return true;
2144 1.228 christos }
2145 1.228 christos
2146 1.284 rillig /* Push to another file. The line points to the word "include". */
2147 1.5 cgd static void
2148 1.84 wiz ParseTraditionalInclude(char *line)
2149 1.5 cgd {
2150 1.469 rillig char *cp; /* current position in file spec */
2151 1.553 rillig bool done = false;
2152 1.553 rillig bool silent = line[0] != 'i';
2153 1.469 rillig char *file = line + (silent ? 8 : 7);
2154 1.469 rillig char *all_files;
2155 1.469 rillig
2156 1.586 rillig DEBUG1(PARSE, "ParseTraditionalInclude: %s\n", file);
2157 1.469 rillig
2158 1.469 rillig pp_skip_whitespace(&file);
2159 1.469 rillig
2160 1.545 rillig (void)Var_Subst(file, SCOPE_CMDLINE, VARE_WANTRES, &all_files);
2161 1.469 rillig /* TODO: handle errors */
2162 1.469 rillig
2163 1.469 rillig for (file = all_files; !done; file = cp + 1) {
2164 1.469 rillig /* Skip to end of line or next whitespace */
2165 1.469 rillig for (cp = file; *cp != '\0' && !ch_isspace(*cp); cp++)
2166 1.469 rillig continue;
2167 1.469 rillig
2168 1.469 rillig if (*cp != '\0')
2169 1.469 rillig *cp = '\0';
2170 1.469 rillig else
2171 1.553 rillig done = true;
2172 1.38 christos
2173 1.553 rillig IncludeFile(file, false, false, silent);
2174 1.469 rillig }
2175 1.580 rillig
2176 1.469 rillig free(all_files);
2177 1.5 cgd }
2178 1.5 cgd #endif
2179 1.5 cgd
2180 1.183 sjg #ifdef GMAKEEXPORT
2181 1.375 rillig /* Parse "export <variable>=<value>", and actually export it. */
2182 1.182 christos static void
2183 1.182 christos ParseGmakeExport(char *line)
2184 1.182 christos {
2185 1.469 rillig char *variable = line + 6;
2186 1.469 rillig char *value;
2187 1.182 christos
2188 1.586 rillig DEBUG1(PARSE, "ParseGmakeExport: %s\n", variable);
2189 1.182 christos
2190 1.469 rillig pp_skip_whitespace(&variable);
2191 1.182 christos
2192 1.526 rillig for (value = variable; *value != '\0' && *value != '='; value++)
2193 1.469 rillig continue;
2194 1.182 christos
2195 1.469 rillig if (*value != '=') {
2196 1.469 rillig Parse_Error(PARSE_FATAL,
2197 1.284 rillig "Variable/Value missing from \"export\"");
2198 1.469 rillig return;
2199 1.469 rillig }
2200 1.469 rillig *value++ = '\0'; /* terminate variable */
2201 1.323 rillig
2202 1.469 rillig /*
2203 1.469 rillig * Expand the value before putting it in the environment.
2204 1.469 rillig */
2205 1.545 rillig (void)Var_Subst(value, SCOPE_CMDLINE, VARE_WANTRES, &value);
2206 1.469 rillig /* TODO: handle errors */
2207 1.469 rillig
2208 1.469 rillig setenv(variable, value, 1);
2209 1.469 rillig free(value);
2210 1.182 christos }
2211 1.182 christos #endif
2212 1.182 christos
2213 1.469 rillig /*
2214 1.469 rillig * Called when EOF is reached in the current file. If we were reading an
2215 1.441 rillig * include file or a .for loop, the includes stack is popped and things set
2216 1.441 rillig * up to go back to reading the previous file at the previous location.
2217 1.1 cgd *
2218 1.1 cgd * Results:
2219 1.553 rillig * true to continue parsing, i.e. it had only reached the end of an
2220 1.553 rillig * included file, false if the main file has been parsed completely.
2221 1.1 cgd */
2222 1.553 rillig static bool
2223 1.123 dsl ParseEOF(void)
2224 1.1 cgd {
2225 1.627 rillig IncludedFile *curFile = CurFile();
2226 1.469 rillig
2227 1.616 rillig doing_depend = curFile->depending;
2228 1.616 rillig if (curFile->forLoop != NULL &&
2229 1.616 rillig For_NextIteration(curFile->forLoop, &curFile->buf)) {
2230 1.616 rillig curFile->buf_ptr = curFile->buf.data;
2231 1.616 rillig curFile->buf_end = curFile->buf.data + curFile->buf.len;
2232 1.627 rillig curFile->readLines = curFile->forBodyReadLines;
2233 1.616 rillig return true;
2234 1.615 rillig }
2235 1.469 rillig
2236 1.583 rillig /*
2237 1.583 rillig * Ensure the makefile (or .for loop) didn't have mismatched
2238 1.583 rillig * conditionals.
2239 1.583 rillig */
2240 1.469 rillig Cond_restore_depth(curFile->cond_depth);
2241 1.469 rillig
2242 1.576 rillig FStr_Done(&curFile->name);
2243 1.616 rillig Buf_Done(&curFile->buf);
2244 1.647 rillig if (curFile->forLoop != NULL)
2245 1.647 rillig ForLoop_Free(curFile->forLoop);
2246 1.469 rillig Vector_Pop(&includes);
2247 1.155 dsl
2248 1.469 rillig if (includes.len == 0) {
2249 1.469 rillig /* We've run out of input */
2250 1.547 rillig Global_Delete(".PARSEDIR");
2251 1.547 rillig Global_Delete(".PARSEFILE");
2252 1.547 rillig Global_Delete(".INCLUDEDFROMDIR");
2253 1.547 rillig Global_Delete(".INCLUDEDFROMFILE");
2254 1.553 rillig return false;
2255 1.469 rillig }
2256 1.170 dholland
2257 1.469 rillig curFile = CurFile();
2258 1.469 rillig DEBUG2(PARSE, "ParseEOF: returning to file %s, line %d\n",
2259 1.641 rillig curFile->name.str, curFile->readLines + 1);
2260 1.1 cgd
2261 1.593 rillig SetParseFile(curFile->name.str);
2262 1.553 rillig return true;
2263 1.1 cgd }
2264 1.1 cgd
2265 1.493 rillig typedef enum ParseRawLineResult {
2266 1.493 rillig PRLR_LINE,
2267 1.493 rillig PRLR_EOF,
2268 1.493 rillig PRLR_ERROR
2269 1.493 rillig } ParseRawLineResult;
2270 1.493 rillig
2271 1.489 rillig /*
2272 1.492 rillig * Parse until the end of a line, taking into account lines that end with
2273 1.571 rillig * backslash-newline. The resulting line goes from out_line to out_line_end;
2274 1.571 rillig * the line is not null-terminated.
2275 1.489 rillig */
2276 1.493 rillig static ParseRawLineResult
2277 1.627 rillig ParseRawLine(IncludedFile *curFile, char **out_line, char **out_line_end,
2278 1.636 rillig char **out_firstBackslash, char **out_commentLineEnd)
2279 1.489 rillig {
2280 1.493 rillig char *line = curFile->buf_ptr;
2281 1.570 rillig char *buf_end = curFile->buf_end;
2282 1.492 rillig char *p = line;
2283 1.489 rillig char *line_end = line;
2284 1.492 rillig char *firstBackslash = NULL;
2285 1.636 rillig char *commentLineEnd = NULL;
2286 1.493 rillig ParseRawLineResult res = PRLR_LINE;
2287 1.489 rillig
2288 1.627 rillig curFile->readLines++;
2289 1.490 rillig
2290 1.489 rillig for (;;) {
2291 1.492 rillig char ch;
2292 1.492 rillig
2293 1.570 rillig if (p == buf_end) {
2294 1.493 rillig res = PRLR_EOF;
2295 1.489 rillig break;
2296 1.489 rillig }
2297 1.489 rillig
2298 1.492 rillig ch = *p;
2299 1.637 rillig if (ch == '\0' || (ch == '\\' && p[1] == '\0')) {
2300 1.492 rillig Parse_Error(PARSE_FATAL, "Zero byte read from file");
2301 1.493 rillig return PRLR_ERROR;
2302 1.489 rillig }
2303 1.489 rillig
2304 1.492 rillig /* Treat next character after '\' as literal. */
2305 1.489 rillig if (ch == '\\') {
2306 1.492 rillig if (firstBackslash == NULL)
2307 1.492 rillig firstBackslash = p;
2308 1.511 rillig if (p[1] == '\n') {
2309 1.627 rillig curFile->readLines++;
2310 1.570 rillig if (p + 2 == buf_end) {
2311 1.511 rillig line_end = p;
2312 1.511 rillig *line_end = '\n';
2313 1.511 rillig p += 2;
2314 1.511 rillig continue;
2315 1.511 rillig }
2316 1.511 rillig }
2317 1.492 rillig p += 2;
2318 1.492 rillig line_end = p;
2319 1.570 rillig assert(p <= buf_end);
2320 1.489 rillig continue;
2321 1.489 rillig }
2322 1.489 rillig
2323 1.489 rillig /*
2324 1.492 rillig * Remember the first '#' for comment stripping, unless
2325 1.492 rillig * the previous char was '[', as in the modifier ':[#]'.
2326 1.492 rillig */
2327 1.636 rillig if (ch == '#' && commentLineEnd == NULL &&
2328 1.492 rillig !(p > line && p[-1] == '['))
2329 1.636 rillig commentLineEnd = line_end;
2330 1.489 rillig
2331 1.492 rillig p++;
2332 1.489 rillig if (ch == '\n')
2333 1.489 rillig break;
2334 1.489 rillig
2335 1.489 rillig /* We are not interested in trailing whitespace. */
2336 1.489 rillig if (!ch_isspace(ch))
2337 1.492 rillig line_end = p;
2338 1.489 rillig }
2339 1.489 rillig
2340 1.635 rillig curFile->buf_ptr = p;
2341 1.490 rillig *out_line = line;
2342 1.489 rillig *out_line_end = line_end;
2343 1.492 rillig *out_firstBackslash = firstBackslash;
2344 1.636 rillig *out_commentLineEnd = commentLineEnd;
2345 1.493 rillig return res;
2346 1.489 rillig }
2347 1.489 rillig
2348 1.491 rillig /*
2349 1.491 rillig * Beginning at start, unescape '\#' to '#' and replace backslash-newline
2350 1.491 rillig * with a single space.
2351 1.491 rillig */
2352 1.485 rillig static void
2353 1.508 rillig UnescapeBackslash(char *line, char *start)
2354 1.487 rillig {
2355 1.638 rillig const char *src = start;
2356 1.491 rillig char *dst = start;
2357 1.491 rillig char *spaceStart = line;
2358 1.485 rillig
2359 1.485 rillig for (;;) {
2360 1.491 rillig char ch = *src++;
2361 1.485 rillig if (ch != '\\') {
2362 1.485 rillig if (ch == '\0')
2363 1.485 rillig break;
2364 1.491 rillig *dst++ = ch;
2365 1.485 rillig continue;
2366 1.485 rillig }
2367 1.485 rillig
2368 1.491 rillig ch = *src++;
2369 1.485 rillig if (ch == '\0') {
2370 1.635 rillig /* Delete '\\' at the end of the buffer. */
2371 1.491 rillig dst--;
2372 1.485 rillig break;
2373 1.485 rillig }
2374 1.485 rillig
2375 1.635 rillig /* Delete '\\' from before '#' on non-command lines. */
2376 1.635 rillig if (ch == '#' && line[0] != '\t')
2377 1.491 rillig *dst++ = ch;
2378 1.635 rillig else if (ch == '\n') {
2379 1.638 rillig cpp_skip_hspace(&src);
2380 1.635 rillig *dst++ = ' ';
2381 1.635 rillig } else {
2382 1.635 rillig /* Leave '\\' in the buffer for later. */
2383 1.491 rillig *dst++ = '\\';
2384 1.491 rillig *dst++ = ch;
2385 1.635 rillig /* Keep an escaped ' ' at the line end. */
2386 1.635 rillig spaceStart = dst;
2387 1.485 rillig }
2388 1.485 rillig }
2389 1.485 rillig
2390 1.487 rillig /* Delete any trailing spaces - eg from empty continuations */
2391 1.491 rillig while (dst > spaceStart && ch_isspace(dst[-1]))
2392 1.491 rillig dst--;
2393 1.491 rillig *dst = '\0';
2394 1.485 rillig }
2395 1.485 rillig
2396 1.593 rillig typedef enum LineKind {
2397 1.495 rillig /*
2398 1.498 rillig * Return the next line that is neither empty nor a comment.
2399 1.495 rillig * Backslash line continuations are folded into a single space.
2400 1.495 rillig * A trailing comment, if any, is discarded.
2401 1.495 rillig */
2402 1.593 rillig LK_NONEMPTY,
2403 1.495 rillig
2404 1.495 rillig /*
2405 1.498 rillig * Return the next line, even if it is empty or a comment.
2406 1.499 rillig * Preserve backslash-newline to keep the line numbers correct.
2407 1.495 rillig *
2408 1.495 rillig * Used in .for loops to collect the body of the loop while waiting
2409 1.495 rillig * for the corresponding .endfor.
2410 1.495 rillig */
2411 1.593 rillig LK_FOR_BODY,
2412 1.495 rillig
2413 1.495 rillig /*
2414 1.499 rillig * Return the next line that starts with a dot.
2415 1.495 rillig * Backslash line continuations are folded into a single space.
2416 1.495 rillig * A trailing comment, if any, is discarded.
2417 1.495 rillig *
2418 1.495 rillig * Used in .if directives to skip over irrelevant branches while
2419 1.495 rillig * waiting for the corresponding .endif.
2420 1.495 rillig */
2421 1.593 rillig LK_DOT
2422 1.593 rillig } LineKind;
2423 1.127 dsl
2424 1.640 rillig /*
2425 1.640 rillig * Return the next "interesting" logical line from the current file. The
2426 1.640 rillig * returned string will be freed at the end of including the file.
2427 1.640 rillig */
2428 1.127 dsl static char *
2429 1.593 rillig ReadLowLevelLine(LineKind kind)
2430 1.5 cgd {
2431 1.627 rillig IncludedFile *curFile = CurFile();
2432 1.639 rillig ParseRawLineResult res;
2433 1.469 rillig char *line;
2434 1.469 rillig char *line_end;
2435 1.492 rillig char *firstBackslash;
2436 1.636 rillig char *commentLineEnd;
2437 1.469 rillig
2438 1.127 dsl for (;;) {
2439 1.639 rillig curFile->lineno = curFile->readLines + 1;
2440 1.639 rillig res = ParseRawLine(curFile,
2441 1.636 rillig &line, &line_end, &firstBackslash, &commentLineEnd);
2442 1.493 rillig if (res == PRLR_ERROR)
2443 1.489 rillig return NULL;
2444 1.27 christos
2445 1.636 rillig if (line == line_end || line == commentLineEnd) {
2446 1.493 rillig if (res == PRLR_EOF)
2447 1.469 rillig return NULL;
2448 1.593 rillig if (kind != LK_FOR_BODY)
2449 1.494 rillig continue;
2450 1.469 rillig }
2451 1.5 cgd
2452 1.469 rillig /* We now have a line of data */
2453 1.514 rillig assert(ch_isspace(*line_end));
2454 1.469 rillig *line_end = '\0';
2455 1.5 cgd
2456 1.593 rillig if (kind == LK_FOR_BODY)
2457 1.499 rillig return line; /* Don't join the physical lines. */
2458 1.5 cgd
2459 1.593 rillig if (kind == LK_DOT && line[0] != '.')
2460 1.499 rillig continue;
2461 1.127 dsl break;
2462 1.127 dsl }
2463 1.5 cgd
2464 1.636 rillig if (commentLineEnd != NULL && line[0] != '\t')
2465 1.636 rillig *commentLineEnd = '\0';
2466 1.637 rillig if (firstBackslash != NULL)
2467 1.637 rillig UnescapeBackslash(line, firstBackslash);
2468 1.469 rillig return line;
2469 1.5 cgd }
2470 1.1 cgd
2471 1.553 rillig static bool
2472 1.593 rillig SkipIrrelevantBranches(void)
2473 1.501 rillig {
2474 1.640 rillig const char *line;
2475 1.501 rillig
2476 1.593 rillig while ((line = ReadLowLevelLine(LK_DOT)) != NULL) {
2477 1.604 rillig if (Cond_EvalLine(line) == CR_TRUE)
2478 1.640 rillig return true;
2479 1.501 rillig /*
2480 1.640 rillig * TODO: Check for typos in .elif directives such as .elsif
2481 1.640 rillig * or .elseif.
2482 1.501 rillig *
2483 1.640 rillig * This check will probably duplicate some of the code in
2484 1.640 rillig * ParseLine. Most of the code there cannot apply, only
2485 1.640 rillig * ParseVarassign and ParseDependencyLine can, and to prevent
2486 1.640 rillig * code duplication, these would need to be called with a
2487 1.640 rillig * flag called onlyCheckSyntax.
2488 1.501 rillig *
2489 1.501 rillig * See directive-elif.mk for details.
2490 1.501 rillig */
2491 1.501 rillig }
2492 1.501 rillig
2493 1.640 rillig return false;
2494 1.501 rillig }
2495 1.501 rillig
2496 1.553 rillig static bool
2497 1.500 rillig ParseForLoop(const char *line)
2498 1.500 rillig {
2499 1.500 rillig int rval;
2500 1.639 rillig int forHeadLineno;
2501 1.639 rillig int bodyReadLines;
2502 1.629 rillig int forLevel;
2503 1.500 rillig
2504 1.500 rillig rval = For_Eval(line);
2505 1.500 rillig if (rval == 0)
2506 1.553 rillig return false; /* Not a .for line */
2507 1.500 rillig if (rval < 0)
2508 1.553 rillig return true; /* Syntax error - error printed, ignore line */
2509 1.500 rillig
2510 1.642 rillig forHeadLineno = CurFile()->lineno;
2511 1.642 rillig bodyReadLines = CurFile()->readLines;
2512 1.642 rillig
2513 1.616 rillig /* Accumulate the loop body until the matching '.endfor'. */
2514 1.629 rillig forLevel = 1;
2515 1.500 rillig do {
2516 1.593 rillig line = ReadLowLevelLine(LK_FOR_BODY);
2517 1.500 rillig if (line == NULL) {
2518 1.500 rillig Parse_Error(PARSE_FATAL,
2519 1.572 rillig "Unexpected end of file in .for loop");
2520 1.500 rillig break;
2521 1.500 rillig }
2522 1.629 rillig } while (For_Accum(line, &forLevel));
2523 1.500 rillig
2524 1.639 rillig For_Run(forHeadLineno, bodyReadLines);
2525 1.616 rillig return true;
2526 1.500 rillig }
2527 1.500 rillig
2528 1.469 rillig /*
2529 1.482 rillig * Read an entire line from the input file.
2530 1.482 rillig *
2531 1.482 rillig * Empty lines, .if and .for are completely handled by this function,
2532 1.482 rillig * leaving only variable assignments, other directives, dependency lines
2533 1.482 rillig * and shell commands to the caller.
2534 1.1 cgd *
2535 1.638 rillig * Return a line without trailing whitespace, or NULL for EOF. The returned
2536 1.638 rillig * string will be freed at the end of including the file.
2537 1.1 cgd */
2538 1.1 cgd static char *
2539 1.593 rillig ReadHighLevelLine(void)
2540 1.1 cgd {
2541 1.500 rillig char *line;
2542 1.469 rillig
2543 1.469 rillig for (;;) {
2544 1.593 rillig line = ReadLowLevelLine(LK_NONEMPTY);
2545 1.469 rillig if (line == NULL)
2546 1.469 rillig return NULL;
2547 1.469 rillig
2548 1.469 rillig if (line[0] != '.')
2549 1.469 rillig return line;
2550 1.469 rillig
2551 1.469 rillig switch (Cond_EvalLine(line)) {
2552 1.604 rillig case CR_FALSE: /* May also mean a syntax error. */
2553 1.593 rillig if (!SkipIrrelevantBranches())
2554 1.482 rillig return NULL;
2555 1.469 rillig continue;
2556 1.604 rillig case CR_TRUE:
2557 1.469 rillig continue;
2558 1.604 rillig case CR_ERROR: /* Not a conditional line */
2559 1.500 rillig if (ParseForLoop(line))
2560 1.469 rillig continue;
2561 1.500 rillig break;
2562 1.469 rillig }
2563 1.469 rillig return line;
2564 1.1 cgd }
2565 1.1 cgd }
2566 1.1 cgd
2567 1.331 rillig static void
2568 1.329 rillig FinishDependencyGroup(void)
2569 1.1 cgd {
2570 1.469 rillig GNodeListNode *ln;
2571 1.430 rillig
2572 1.469 rillig if (targets == NULL)
2573 1.469 rillig return;
2574 1.371 rillig
2575 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2576 1.469 rillig GNode *gn = ln->datum;
2577 1.371 rillig
2578 1.469 rillig Suff_EndTransform(gn);
2579 1.371 rillig
2580 1.469 rillig /*
2581 1.469 rillig * Mark the target as already having commands if it does, to
2582 1.469 rillig * keep from having shell commands on multiple dependency
2583 1.469 rillig * lines.
2584 1.469 rillig */
2585 1.469 rillig if (!Lst_IsEmpty(&gn->commands))
2586 1.469 rillig gn->type |= OP_HAS_COMMANDS;
2587 1.469 rillig }
2588 1.430 rillig
2589 1.469 rillig Lst_Free(targets);
2590 1.469 rillig targets = NULL;
2591 1.1 cgd }
2592 1.27 christos
2593 1.327 rillig /* Add the command to each target from the current dependency spec. */
2594 1.326 rillig static void
2595 1.375 rillig ParseLine_ShellCommand(const char *p)
2596 1.326 rillig {
2597 1.469 rillig cpp_skip_whitespace(&p);
2598 1.469 rillig if (*p == '\0')
2599 1.469 rillig return; /* skip empty commands */
2600 1.327 rillig
2601 1.469 rillig if (targets == NULL) {
2602 1.469 rillig Parse_Error(PARSE_FATAL,
2603 1.469 rillig "Unassociated shell command \"%s\"", p);
2604 1.469 rillig return;
2605 1.469 rillig }
2606 1.327 rillig
2607 1.469 rillig {
2608 1.469 rillig char *cmd = bmake_strdup(p);
2609 1.469 rillig GNodeListNode *ln;
2610 1.469 rillig
2611 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2612 1.469 rillig GNode *gn = ln->datum;
2613 1.593 rillig GNode_AddCommand(gn, cmd);
2614 1.469 rillig }
2615 1.326 rillig #ifdef CLEANUP
2616 1.469 rillig Lst_Append(&targCmds, cmd);
2617 1.326 rillig #endif
2618 1.469 rillig }
2619 1.326 rillig }
2620 1.1 cgd
2621 1.474 rillig /*
2622 1.477 rillig * See if the line starts with one of the known directives, and if so, handle
2623 1.477 rillig * the directive.
2624 1.474 rillig */
2625 1.553 rillig static bool
2626 1.379 rillig ParseDirective(char *line)
2627 1.379 rillig {
2628 1.474 rillig char *cp = line + 1;
2629 1.569 rillig const char *arg;
2630 1.569 rillig Substring dir;
2631 1.474 rillig
2632 1.474 rillig pp_skip_whitespace(&cp);
2633 1.553 rillig if (IsInclude(cp, false)) {
2634 1.556 rillig ParseInclude(cp);
2635 1.553 rillig return true;
2636 1.474 rillig }
2637 1.379 rillig
2638 1.569 rillig dir.start = cp;
2639 1.475 rillig while (ch_isalpha(*cp) || *cp == '-')
2640 1.475 rillig cp++;
2641 1.569 rillig dir.end = cp;
2642 1.475 rillig
2643 1.475 rillig if (*cp != '\0' && !ch_isspace(*cp))
2644 1.553 rillig return false;
2645 1.475 rillig
2646 1.475 rillig pp_skip_whitespace(&cp);
2647 1.475 rillig arg = cp;
2648 1.475 rillig
2649 1.581 rillig if (Substring_Equals(dir, "undef"))
2650 1.569 rillig Var_Undef(arg);
2651 1.581 rillig else if (Substring_Equals(dir, "export"))
2652 1.517 rillig Var_Export(VEM_PLAIN, arg);
2653 1.581 rillig else if (Substring_Equals(dir, "export-env"))
2654 1.517 rillig Var_Export(VEM_ENV, arg);
2655 1.581 rillig else if (Substring_Equals(dir, "export-literal"))
2656 1.476 rillig Var_Export(VEM_LITERAL, arg);
2657 1.581 rillig else if (Substring_Equals(dir, "unexport"))
2658 1.553 rillig Var_UnExport(false, arg);
2659 1.581 rillig else if (Substring_Equals(dir, "unexport-env"))
2660 1.553 rillig Var_UnExport(true, arg);
2661 1.581 rillig else if (Substring_Equals(dir, "info"))
2662 1.602 rillig HandleMessage(PARSE_INFO, "info", arg);
2663 1.581 rillig else if (Substring_Equals(dir, "warning"))
2664 1.602 rillig HandleMessage(PARSE_WARNING, "warning", arg);
2665 1.581 rillig else if (Substring_Equals(dir, "error"))
2666 1.602 rillig HandleMessage(PARSE_FATAL, "error", arg);
2667 1.581 rillig else
2668 1.581 rillig return false;
2669 1.581 rillig return true;
2670 1.379 rillig }
2671 1.379 rillig
2672 1.605 rillig bool
2673 1.605 rillig Parse_VarAssign(const char *line, bool finishDependencyGroup, GNode *scope)
2674 1.379 rillig {
2675 1.469 rillig VarAssign var;
2676 1.430 rillig
2677 1.469 rillig if (!Parse_IsVar(line, &var))
2678 1.553 rillig return false;
2679 1.605 rillig if (finishDependencyGroup)
2680 1.605 rillig FinishDependencyGroup();
2681 1.605 rillig Parse_Var(&var, scope);
2682 1.553 rillig return true;
2683 1.379 rillig }
2684 1.379 rillig
2685 1.380 rillig static char *
2686 1.380 rillig FindSemicolon(char *p)
2687 1.380 rillig {
2688 1.469 rillig int level = 0;
2689 1.469 rillig
2690 1.469 rillig for (; *p != '\0'; p++) {
2691 1.469 rillig if (*p == '\\' && p[1] != '\0') {
2692 1.469 rillig p++;
2693 1.469 rillig continue;
2694 1.469 rillig }
2695 1.380 rillig
2696 1.469 rillig if (*p == '$' && (p[1] == '(' || p[1] == '{'))
2697 1.469 rillig level++;
2698 1.469 rillig else if (level > 0 && (*p == ')' || *p == '}'))
2699 1.469 rillig level--;
2700 1.469 rillig else if (level == 0 && *p == ';')
2701 1.469 rillig break;
2702 1.469 rillig }
2703 1.469 rillig return p;
2704 1.380 rillig }
2705 1.380 rillig
2706 1.524 rillig /*
2707 1.557 rillig * dependency -> target... op [source...] [';' command]
2708 1.524 rillig * op -> ':' | '::' | '!'
2709 1.524 rillig */
2710 1.379 rillig static void
2711 1.555 rillig ParseDependencyLine(char *line)
2712 1.379 rillig {
2713 1.557 rillig VarEvalMode emode;
2714 1.469 rillig char *expanded_line;
2715 1.469 rillig const char *shellcmd = NULL;
2716 1.469 rillig
2717 1.469 rillig /*
2718 1.469 rillig * For some reason - probably to make the parser impossible -
2719 1.469 rillig * a ';' can be used to separate commands from dependencies.
2720 1.469 rillig * Attempt to avoid ';' inside substitution patterns.
2721 1.469 rillig */
2722 1.469 rillig {
2723 1.469 rillig char *semicolon = FindSemicolon(line);
2724 1.469 rillig if (*semicolon != '\0') {
2725 1.469 rillig /* Terminate the dependency list at the ';' */
2726 1.469 rillig *semicolon = '\0';
2727 1.469 rillig shellcmd = semicolon + 1;
2728 1.469 rillig }
2729 1.469 rillig }
2730 1.379 rillig
2731 1.469 rillig /*
2732 1.469 rillig * We now know it's a dependency line so it needs to have all
2733 1.469 rillig * variables expanded before being parsed.
2734 1.469 rillig *
2735 1.469 rillig * XXX: Ideally the dependency line would first be split into
2736 1.469 rillig * its left-hand side, dependency operator and right-hand side,
2737 1.469 rillig * and then each side would be expanded on its own. This would
2738 1.469 rillig * allow for the left-hand side to allow only defined variables
2739 1.469 rillig * and to allow variables on the right-hand side to be undefined
2740 1.469 rillig * as well.
2741 1.469 rillig *
2742 1.469 rillig * Parsing the line first would also prevent that targets
2743 1.469 rillig * generated from variable expressions are interpreted as the
2744 1.469 rillig * dependency operator, such as in "target${:U\:} middle: source",
2745 1.469 rillig * in which the middle is interpreted as a source, not a target.
2746 1.469 rillig */
2747 1.469 rillig
2748 1.583 rillig /*
2749 1.583 rillig * In lint mode, allow undefined variables to appear in dependency
2750 1.583 rillig * lines.
2751 1.469 rillig *
2752 1.583 rillig * Ideally, only the right-hand side would allow undefined variables
2753 1.583 rillig * since it is common to have optional dependencies. Having undefined
2754 1.583 rillig * variables on the left-hand side is more unusual though. Since
2755 1.583 rillig * both sides are expanded in a single pass, there is not much choice
2756 1.583 rillig * what to do here.
2757 1.469 rillig *
2758 1.583 rillig * In normal mode, it does not matter whether undefined variables are
2759 1.583 rillig * allowed or not since as of 2020-09-14, Var_Parse does not print
2760 1.583 rillig * any parse errors in such a case. It simply returns the special
2761 1.583 rillig * empty string var_Error, which cannot be detected in the result of
2762 1.583 rillig * Var_Subst.
2763 1.583 rillig */
2764 1.557 rillig emode = opts.strict ? VARE_WANTRES : VARE_UNDEFERR;
2765 1.557 rillig (void)Var_Subst(line, SCOPE_CMDLINE, emode, &expanded_line);
2766 1.469 rillig /* TODO: handle errors */
2767 1.469 rillig
2768 1.469 rillig /* Need a fresh list for the target nodes */
2769 1.469 rillig if (targets != NULL)
2770 1.469 rillig Lst_Free(targets);
2771 1.469 rillig targets = Lst_New();
2772 1.379 rillig
2773 1.556 rillig ParseDependency(expanded_line);
2774 1.469 rillig free(expanded_line);
2775 1.380 rillig
2776 1.469 rillig if (shellcmd != NULL)
2777 1.469 rillig ParseLine_ShellCommand(shellcmd);
2778 1.379 rillig }
2779 1.379 rillig
2780 1.381 rillig static void
2781 1.381 rillig ParseLine(char *line)
2782 1.381 rillig {
2783 1.477 rillig /*
2784 1.477 rillig * Lines that begin with '.' can be pretty much anything:
2785 1.477 rillig * - directives like '.include' or '.if',
2786 1.477 rillig * - suffix rules like '.c.o:',
2787 1.477 rillig * - dependencies for filenames that start with '.',
2788 1.477 rillig * - variable assignments like '.tmp=value'.
2789 1.477 rillig */
2790 1.474 rillig if (line[0] == '.' && ParseDirective(line))
2791 1.469 rillig return;
2792 1.381 rillig
2793 1.478 rillig if (line[0] == '\t') {
2794 1.469 rillig ParseLine_ShellCommand(line + 1);
2795 1.469 rillig return;
2796 1.469 rillig }
2797 1.381 rillig
2798 1.381 rillig #ifdef SYSVINCLUDE
2799 1.469 rillig if (IsSysVInclude(line)) {
2800 1.469 rillig /*
2801 1.469 rillig * It's an S3/S5-style "include".
2802 1.469 rillig */
2803 1.469 rillig ParseTraditionalInclude(line);
2804 1.469 rillig return;
2805 1.469 rillig }
2806 1.381 rillig #endif
2807 1.381 rillig
2808 1.381 rillig #ifdef GMAKEEXPORT
2809 1.469 rillig if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
2810 1.469 rillig strchr(line, ':') == NULL) {
2811 1.469 rillig /*
2812 1.469 rillig * It's a Gmake "export".
2813 1.469 rillig */
2814 1.469 rillig ParseGmakeExport(line);
2815 1.469 rillig return;
2816 1.469 rillig }
2817 1.381 rillig #endif
2818 1.381 rillig
2819 1.605 rillig if (Parse_VarAssign(line, true, SCOPE_GLOBAL))
2820 1.469 rillig return;
2821 1.381 rillig
2822 1.469 rillig FinishDependencyGroup();
2823 1.381 rillig
2824 1.555 rillig ParseDependencyLine(line);
2825 1.381 rillig }
2826 1.381 rillig
2827 1.469 rillig /*
2828 1.469 rillig * Parse a top-level makefile, incorporating its content into the global
2829 1.441 rillig * dependency graph.
2830 1.1 cgd */
2831 1.1 cgd void
2832 1.125 dsl Parse_File(const char *name, int fd)
2833 1.1 cgd {
2834 1.613 rillig char *line;
2835 1.616 rillig Buffer buf;
2836 1.170 dholland
2837 1.616 rillig buf = loadfile(name, fd != -1 ? fd : STDIN_FILENO);
2838 1.613 rillig if (fd != -1)
2839 1.613 rillig (void)close(fd);
2840 1.1 cgd
2841 1.469 rillig assert(targets == NULL);
2842 1.44 aidan
2843 1.639 rillig Parse_PushInput(name, 1, 0, buf, NULL);
2844 1.1 cgd
2845 1.469 rillig do {
2846 1.593 rillig while ((line = ReadHighLevelLine()) != NULL) {
2847 1.591 rillig DEBUG2(PARSE, "Parsing line %d: %s\n",
2848 1.639 rillig CurFile()->lineno, line);
2849 1.469 rillig ParseLine(line);
2850 1.469 rillig }
2851 1.469 rillig /* Reached EOF, but it may be just EOF of an include file. */
2852 1.469 rillig } while (ParseEOF());
2853 1.1 cgd
2854 1.469 rillig FinishDependencyGroup();
2855 1.328 rillig
2856 1.561 rillig if (parseErrors != 0) {
2857 1.469 rillig (void)fflush(stdout);
2858 1.469 rillig (void)fprintf(stderr,
2859 1.469 rillig "%s: Fatal errors encountered -- cannot continue",
2860 1.469 rillig progname);
2861 1.469 rillig PrintOnError(NULL, NULL);
2862 1.469 rillig exit(1);
2863 1.469 rillig }
2864 1.1 cgd }
2865 1.1 cgd
2866 1.383 rillig /* Initialize the parsing module. */
2867 1.5 cgd void
2868 1.84 wiz Parse_Init(void)
2869 1.1 cgd {
2870 1.469 rillig mainNode = NULL;
2871 1.469 rillig parseIncPath = SearchPath_New();
2872 1.469 rillig sysIncPath = SearchPath_New();
2873 1.469 rillig defSysIncPath = SearchPath_New();
2874 1.627 rillig Vector_Init(&includes, sizeof(IncludedFile));
2875 1.1 cgd }
2876 1.9 jtc
2877 1.383 rillig /* Clean up the parsing module. */
2878 1.9 jtc void
2879 1.84 wiz Parse_End(void)
2880 1.9 jtc {
2881 1.45 mycroft #ifdef CLEANUP
2882 1.469 rillig Lst_DoneCall(&targCmds, free);
2883 1.469 rillig assert(targets == NULL);
2884 1.469 rillig SearchPath_Free(defSysIncPath);
2885 1.469 rillig SearchPath_Free(sysIncPath);
2886 1.469 rillig SearchPath_Free(parseIncPath);
2887 1.469 rillig assert(includes.len == 0);
2888 1.469 rillig Vector_Done(&includes);
2889 1.45 mycroft #endif
2890 1.9 jtc }
2891 1.27 christos
2892 1.1 cgd
2893 1.441 rillig /*
2894 1.441 rillig * Return a list containing the single main target to create.
2895 1.441 rillig * If no such target exists, we Punt with an obnoxious error message.
2896 1.1 cgd */
2897 1.461 rillig void
2898 1.461 rillig Parse_MainName(GNodeList *mainList)
2899 1.1 cgd {
2900 1.469 rillig if (mainNode == NULL)
2901 1.469 rillig Punt("no target to make.");
2902 1.430 rillig
2903 1.527 rillig Lst_Append(mainList, mainNode);
2904 1.527 rillig if (mainNode->type & OP_DOUBLEDEP)
2905 1.469 rillig Lst_AppendAll(mainList, &mainNode->cohorts);
2906 1.441 rillig
2907 1.542 rillig Global_Append(".TARGETS", mainNode->name);
2908 1.59 christos }
2909 1.420 rillig
2910 1.420 rillig int
2911 1.561 rillig Parse_NumErrors(void)
2912 1.420 rillig {
2913 1.561 rillig return parseErrors;
2914 1.420 rillig }
2915