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