parse.c revision 1.22 1 1.22 christos /* $NetBSD: parse.c,v 1.22 1996/03/15 21:52:41 christos Exp $ */
2 1.15 christos
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
5 1.1 cgd * Copyright (c) 1988, 1989 by Adam de Boor
6 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
7 1.1 cgd * All rights reserved.
8 1.1 cgd *
9 1.1 cgd * This code is derived from software contributed to Berkeley by
10 1.1 cgd * Adam de Boor.
11 1.1 cgd *
12 1.1 cgd * Redistribution and use in source and binary forms, with or without
13 1.1 cgd * modification, are permitted provided that the following conditions
14 1.1 cgd * are met:
15 1.1 cgd * 1. Redistributions of source code must retain the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer.
17 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 cgd * notice, this list of conditions and the following disclaimer in the
19 1.1 cgd * documentation and/or other materials provided with the distribution.
20 1.1 cgd * 3. All advertising materials mentioning features or use of this software
21 1.1 cgd * must display the following acknowledgement:
22 1.1 cgd * This product includes software developed by the University of
23 1.1 cgd * California, Berkeley and its contributors.
24 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
25 1.1 cgd * may be used to endorse or promote products derived from this software
26 1.1 cgd * without specific prior written permission.
27 1.1 cgd *
28 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.1 cgd * SUCH DAMAGE.
39 1.1 cgd */
40 1.1 cgd
41 1.1 cgd #ifndef lint
42 1.15 christos #if 0
43 1.15 christos static char sccsid[] = "@(#)parse.c 5.18 (Berkeley) 2/19/91";
44 1.15 christos #else
45 1.22 christos static char rcsid[] = "$NetBSD: parse.c,v 1.22 1996/03/15 21:52:41 christos Exp $";
46 1.15 christos #endif
47 1.1 cgd #endif /* not lint */
48 1.1 cgd
49 1.1 cgd /*-
50 1.1 cgd * parse.c --
51 1.1 cgd * Functions to parse a makefile.
52 1.1 cgd *
53 1.1 cgd * One function, Parse_Init, must be called before any functions
54 1.1 cgd * in this module are used. After that, the function Parse_File is the
55 1.1 cgd * main entry point and controls most of the other functions in this
56 1.1 cgd * module.
57 1.1 cgd *
58 1.1 cgd * Most important structures are kept in Lsts. Directories for
59 1.1 cgd * the #include "..." function are kept in the 'parseIncPath' Lst, while
60 1.1 cgd * those for the #include <...> are kept in the 'sysIncPath' Lst. The
61 1.1 cgd * targets currently being defined are kept in the 'targets' Lst.
62 1.1 cgd *
63 1.1 cgd * The variables 'fname' and 'lineno' are used to track the name
64 1.1 cgd * of the current file and the line number in that file so that error
65 1.1 cgd * messages can be more meaningful.
66 1.1 cgd *
67 1.1 cgd * Interface:
68 1.1 cgd * Parse_Init Initialization function which must be
69 1.1 cgd * called before anything else in this module
70 1.1 cgd * is used.
71 1.1 cgd *
72 1.9 jtc * Parse_End Cleanup the module
73 1.9 jtc *
74 1.1 cgd * Parse_File Function used to parse a makefile. It must
75 1.1 cgd * be given the name of the file, which should
76 1.1 cgd * already have been opened, and a function
77 1.1 cgd * to call to read a character from the file.
78 1.1 cgd *
79 1.1 cgd * Parse_IsVar Returns TRUE if the given line is a
80 1.1 cgd * variable assignment. Used by MainParseArgs
81 1.1 cgd * to determine if an argument is a target
82 1.1 cgd * or a variable assignment. Used internally
83 1.1 cgd * for pretty much the same thing...
84 1.1 cgd *
85 1.1 cgd * Parse_Error Function called when an error occurs in
86 1.1 cgd * parsing. Used by the variable and
87 1.1 cgd * conditional modules.
88 1.1 cgd * Parse_MainName Returns a Lst of the main target to create.
89 1.1 cgd */
90 1.1 cgd
91 1.5 cgd #if __STDC__
92 1.5 cgd #include <stdarg.h>
93 1.5 cgd #else
94 1.1 cgd #include <varargs.h>
95 1.5 cgd #endif
96 1.5 cgd #include <stdio.h>
97 1.4 jtc #include <ctype.h>
98 1.5 cgd #include <errno.h>
99 1.4 jtc #include <sys/wait.h>
100 1.1 cgd #include "make.h"
101 1.5 cgd #include "hash.h"
102 1.5 cgd #include "dir.h"
103 1.5 cgd #include "job.h"
104 1.1 cgd #include "buf.h"
105 1.1 cgd #include "pathnames.h"
106 1.1 cgd
107 1.1 cgd /*
108 1.1 cgd * These values are returned by ParseEOF to tell Parse_File whether to
109 1.1 cgd * CONTINUE parsing, i.e. it had only reached the end of an include file,
110 1.1 cgd * or if it's DONE.
111 1.1 cgd */
112 1.1 cgd #define CONTINUE 1
113 1.1 cgd #define DONE 0
114 1.1 cgd static Lst targets; /* targets we're working on */
115 1.9 jtc static Lst targCmds; /* command lines for targets */
116 1.1 cgd static Boolean inLine; /* true if currently in a dependency
117 1.1 cgd * line or its commands */
118 1.5 cgd typedef struct {
119 1.5 cgd char *str;
120 1.5 cgd char *ptr;
121 1.5 cgd } PTR;
122 1.1 cgd
123 1.1 cgd static char *fname; /* name of current file (for errors) */
124 1.1 cgd static int lineno; /* line number in current file */
125 1.5 cgd static FILE *curFILE = NULL; /* current makefile */
126 1.5 cgd
127 1.5 cgd static PTR *curPTR = NULL; /* current makefile */
128 1.1 cgd
129 1.1 cgd static int fatals = 0;
130 1.1 cgd
131 1.1 cgd static GNode *mainNode; /* The main target to create. This is the
132 1.1 cgd * first target on the first dependency
133 1.1 cgd * line in the first makefile */
134 1.1 cgd /*
135 1.1 cgd * Definitions for handling #include specifications
136 1.1 cgd */
137 1.1 cgd typedef struct IFile {
138 1.1 cgd char *fname; /* name of previous file */
139 1.1 cgd int lineno; /* saved line number */
140 1.5 cgd FILE * F; /* the open stream */
141 1.5 cgd PTR * p; /* the char pointer */
142 1.5 cgd } IFile;
143 1.1 cgd
144 1.1 cgd static Lst includes; /* stack of IFiles generated by
145 1.1 cgd * #includes */
146 1.1 cgd Lst parseIncPath; /* list of directories for "..." includes */
147 1.1 cgd Lst sysIncPath; /* list of directories for <...> includes */
148 1.1 cgd
149 1.1 cgd /*-
150 1.1 cgd * specType contains the SPECial TYPE of the current target. It is
151 1.1 cgd * Not if the target is unspecial. If it *is* special, however, the children
152 1.1 cgd * are linked as children of the parent but not vice versa. This variable is
153 1.1 cgd * set in ParseDoDependency
154 1.1 cgd */
155 1.1 cgd typedef enum {
156 1.1 cgd Begin, /* .BEGIN */
157 1.1 cgd Default, /* .DEFAULT */
158 1.1 cgd End, /* .END */
159 1.1 cgd Ignore, /* .IGNORE */
160 1.1 cgd Includes, /* .INCLUDES */
161 1.1 cgd Interrupt, /* .INTERRUPT */
162 1.1 cgd Libs, /* .LIBS */
163 1.1 cgd MFlags, /* .MFLAGS or .MAKEFLAGS */
164 1.1 cgd Main, /* .MAIN and we don't have anything user-specified to
165 1.1 cgd * make */
166 1.5 cgd NoExport, /* .NOEXPORT */
167 1.1 cgd Not, /* Not special */
168 1.1 cgd NotParallel, /* .NOTPARALELL */
169 1.1 cgd Null, /* .NULL */
170 1.1 cgd Order, /* .ORDER */
171 1.18 christos Parallel, /* .PARALLEL */
172 1.5 cgd ExPath, /* .PATH */
173 1.22 christos Phony, /* .PHONY */
174 1.1 cgd Precious, /* .PRECIOUS */
175 1.5 cgd ExShell, /* .SHELL */
176 1.1 cgd Silent, /* .SILENT */
177 1.1 cgd SingleShell, /* .SINGLESHELL */
178 1.1 cgd Suffixes, /* .SUFFIXES */
179 1.18 christos Wait, /* .WAIT */
180 1.5 cgd Attribute /* Generic attribute */
181 1.1 cgd } ParseSpecial;
182 1.1 cgd
183 1.5 cgd static ParseSpecial specType;
184 1.18 christos static int waiting;
185 1.1 cgd
186 1.1 cgd /*
187 1.1 cgd * Predecessor node for handling .ORDER. Initialized to NILGNODE when .ORDER
188 1.1 cgd * seen, then set to each successive source on the line.
189 1.1 cgd */
190 1.1 cgd static GNode *predecessor;
191 1.1 cgd
192 1.1 cgd /*
193 1.1 cgd * The parseKeywords table is searched using binary search when deciding
194 1.1 cgd * if a target or source is special. The 'spec' field is the ParseSpecial
195 1.1 cgd * type of the keyword ("Not" if the keyword isn't special as a target) while
196 1.1 cgd * the 'op' field is the operator to apply to the list of targets if the
197 1.1 cgd * keyword is used as a source ("0" if the keyword isn't special as a source)
198 1.1 cgd */
199 1.1 cgd static struct {
200 1.1 cgd char *name; /* Name of keyword */
201 1.1 cgd ParseSpecial spec; /* Type when used as a target */
202 1.1 cgd int op; /* Operator when used as a source */
203 1.1 cgd } parseKeywords[] = {
204 1.1 cgd { ".BEGIN", Begin, 0 },
205 1.1 cgd { ".DEFAULT", Default, 0 },
206 1.1 cgd { ".END", End, 0 },
207 1.1 cgd { ".EXEC", Attribute, OP_EXEC },
208 1.1 cgd { ".IGNORE", Ignore, OP_IGNORE },
209 1.1 cgd { ".INCLUDES", Includes, 0 },
210 1.1 cgd { ".INTERRUPT", Interrupt, 0 },
211 1.1 cgd { ".INVISIBLE", Attribute, OP_INVISIBLE },
212 1.1 cgd { ".JOIN", Attribute, OP_JOIN },
213 1.1 cgd { ".LIBS", Libs, 0 },
214 1.1 cgd { ".MAIN", Main, 0 },
215 1.1 cgd { ".MAKE", Attribute, OP_MAKE },
216 1.1 cgd { ".MAKEFLAGS", MFlags, 0 },
217 1.1 cgd { ".MFLAGS", MFlags, 0 },
218 1.1 cgd { ".NOTMAIN", Attribute, OP_NOTMAIN },
219 1.1 cgd { ".NOTPARALLEL", NotParallel, 0 },
220 1.18 christos { ".NO_PARALLEL", NotParallel, 0 },
221 1.1 cgd { ".NULL", Null, 0 },
222 1.14 ws { ".OPTIONAL", Attribute, OP_OPTIONAL },
223 1.1 cgd { ".ORDER", Order, 0 },
224 1.18 christos { ".PARALLEL", Parallel, 0 },
225 1.5 cgd { ".PATH", ExPath, 0 },
226 1.22 christos { ".PHONY", Phony, OP_PHONY },
227 1.1 cgd { ".PRECIOUS", Precious, OP_PRECIOUS },
228 1.1 cgd { ".RECURSIVE", Attribute, OP_MAKE },
229 1.5 cgd { ".SHELL", ExShell, 0 },
230 1.1 cgd { ".SILENT", Silent, OP_SILENT },
231 1.1 cgd { ".SINGLESHELL", SingleShell, 0 },
232 1.1 cgd { ".SUFFIXES", Suffixes, 0 },
233 1.1 cgd { ".USE", Attribute, OP_USE },
234 1.18 christos { ".WAIT", Wait, 0 },
235 1.1 cgd };
236 1.1 cgd
237 1.5 cgd static int ParseFindKeyword __P((char *));
238 1.9 jtc static int ParseLinkSrc __P((ClientData, ClientData));
239 1.9 jtc static int ParseDoOp __P((ClientData, ClientData));
240 1.18 christos static int ParseAddDep __P((ClientData, ClientData));
241 1.18 christos static void ParseDoSrc __P((int, char *, Lst));
242 1.9 jtc static int ParseFindMain __P((ClientData, ClientData));
243 1.9 jtc static int ParseAddDir __P((ClientData, ClientData));
244 1.9 jtc static int ParseClearPath __P((ClientData, ClientData));
245 1.5 cgd static void ParseDoDependency __P((char *));
246 1.9 jtc static int ParseAddCmd __P((ClientData, ClientData));
247 1.5 cgd static int ParseReadc __P((void));
248 1.5 cgd static void ParseUnreadc __P((int));
249 1.9 jtc static void ParseHasCommands __P((ClientData));
250 1.5 cgd static void ParseDoInclude __P((char *));
251 1.5 cgd #ifdef SYSVINCLUDE
252 1.5 cgd static void ParseTraditionalInclude __P((char *));
253 1.5 cgd #endif
254 1.5 cgd static int ParseEOF __P((int));
255 1.5 cgd static char *ParseReadLine __P((void));
256 1.5 cgd static char *ParseSkipLine __P((int));
257 1.5 cgd static void ParseFinishLine __P((void));
258 1.5 cgd
259 1.1 cgd /*-
260 1.1 cgd *----------------------------------------------------------------------
261 1.1 cgd * ParseFindKeyword --
262 1.1 cgd * Look in the table of keywords for one matching the given string.
263 1.1 cgd *
264 1.1 cgd * Results:
265 1.1 cgd * The index of the keyword, or -1 if it isn't there.
266 1.1 cgd *
267 1.1 cgd * Side Effects:
268 1.1 cgd * None
269 1.1 cgd *----------------------------------------------------------------------
270 1.1 cgd */
271 1.1 cgd static int
272 1.1 cgd ParseFindKeyword (str)
273 1.1 cgd char *str; /* String to find */
274 1.1 cgd {
275 1.1 cgd register int start,
276 1.1 cgd end,
277 1.1 cgd cur;
278 1.1 cgd register int diff;
279 1.1 cgd
280 1.1 cgd start = 0;
281 1.1 cgd end = (sizeof(parseKeywords)/sizeof(parseKeywords[0])) - 1;
282 1.1 cgd
283 1.1 cgd do {
284 1.1 cgd cur = start + ((end - start) / 2);
285 1.1 cgd diff = strcmp (str, parseKeywords[cur].name);
286 1.1 cgd
287 1.1 cgd if (diff == 0) {
288 1.1 cgd return (cur);
289 1.1 cgd } else if (diff < 0) {
290 1.1 cgd end = cur - 1;
291 1.1 cgd } else {
292 1.1 cgd start = cur + 1;
293 1.1 cgd }
294 1.1 cgd } while (start <= end);
295 1.1 cgd return (-1);
296 1.1 cgd }
297 1.1 cgd
298 1.1 cgd /*-
299 1.1 cgd * Parse_Error --
300 1.1 cgd * Error message abort function for parsing. Prints out the context
301 1.1 cgd * of the error (line number and file) as well as the message with
302 1.1 cgd * two optional arguments.
303 1.1 cgd *
304 1.1 cgd * Results:
305 1.1 cgd * None
306 1.1 cgd *
307 1.1 cgd * Side Effects:
308 1.1 cgd * "fatals" is incremented if the level is PARSE_FATAL.
309 1.1 cgd */
310 1.1 cgd /* VARARGS */
311 1.1 cgd void
312 1.5 cgd #if __STDC__
313 1.5 cgd Parse_Error(int type, char *fmt, ...)
314 1.5 cgd #else
315 1.5 cgd Parse_Error(va_alist)
316 1.1 cgd va_dcl
317 1.5 cgd #endif
318 1.1 cgd {
319 1.1 cgd va_list ap;
320 1.5 cgd #if __STDC__
321 1.5 cgd va_start(ap, fmt);
322 1.5 cgd #else
323 1.5 cgd int type; /* Error type (PARSE_WARNING, PARSE_FATAL) */
324 1.1 cgd char *fmt;
325 1.1 cgd
326 1.5 cgd va_start(ap);
327 1.5 cgd type = va_arg(ap, int);
328 1.5 cgd fmt = va_arg(ap, char *);
329 1.5 cgd #endif
330 1.5 cgd
331 1.1 cgd (void)fprintf(stderr, "\"%s\", line %d: ", fname, lineno);
332 1.1 cgd if (type == PARSE_WARNING)
333 1.1 cgd (void)fprintf(stderr, "warning: ");
334 1.1 cgd (void)vfprintf(stderr, fmt, ap);
335 1.1 cgd va_end(ap);
336 1.1 cgd (void)fprintf(stderr, "\n");
337 1.1 cgd (void)fflush(stderr);
338 1.1 cgd if (type == PARSE_FATAL)
339 1.1 cgd fatals += 1;
340 1.1 cgd }
341 1.1 cgd
342 1.1 cgd /*-
343 1.1 cgd *---------------------------------------------------------------------
344 1.1 cgd * ParseLinkSrc --
345 1.1 cgd * Link the parent node to its new child. Used in a Lst_ForEach by
346 1.1 cgd * ParseDoDependency. If the specType isn't 'Not', the parent
347 1.1 cgd * isn't linked as a parent of the child.
348 1.1 cgd *
349 1.1 cgd * Results:
350 1.1 cgd * Always = 0
351 1.1 cgd *
352 1.1 cgd * Side Effects:
353 1.1 cgd * New elements are added to the parents list of cgn and the
354 1.1 cgd * children list of cgn. the unmade field of pgn is updated
355 1.1 cgd * to reflect the additional child.
356 1.1 cgd *---------------------------------------------------------------------
357 1.1 cgd */
358 1.1 cgd static int
359 1.9 jtc ParseLinkSrc (pgnp, cgnp)
360 1.9 jtc ClientData pgnp; /* The parent node */
361 1.9 jtc ClientData cgnp; /* The child node */
362 1.1 cgd {
363 1.9 jtc GNode *pgn = (GNode *) pgnp;
364 1.9 jtc GNode *cgn = (GNode *) cgnp;
365 1.1 cgd if (Lst_Member (pgn->children, (ClientData)cgn) == NILLNODE) {
366 1.1 cgd (void)Lst_AtEnd (pgn->children, (ClientData)cgn);
367 1.1 cgd if (specType == Not) {
368 1.1 cgd (void)Lst_AtEnd (cgn->parents, (ClientData)pgn);
369 1.1 cgd }
370 1.1 cgd pgn->unmade += 1;
371 1.1 cgd }
372 1.1 cgd return (0);
373 1.1 cgd }
374 1.1 cgd
375 1.1 cgd /*-
376 1.1 cgd *---------------------------------------------------------------------
377 1.1 cgd * ParseDoOp --
378 1.1 cgd * Apply the parsed operator to the given target node. Used in a
379 1.1 cgd * Lst_ForEach call by ParseDoDependency once all targets have
380 1.1 cgd * been found and their operator parsed. If the previous and new
381 1.1 cgd * operators are incompatible, a major error is taken.
382 1.1 cgd *
383 1.1 cgd * Results:
384 1.1 cgd * Always 0
385 1.1 cgd *
386 1.1 cgd * Side Effects:
387 1.1 cgd * The type field of the node is altered to reflect any new bits in
388 1.1 cgd * the op.
389 1.1 cgd *---------------------------------------------------------------------
390 1.1 cgd */
391 1.1 cgd static int
392 1.9 jtc ParseDoOp (gnp, opp)
393 1.9 jtc ClientData gnp; /* The node to which the operator is to be
394 1.1 cgd * applied */
395 1.9 jtc ClientData opp; /* The operator to apply */
396 1.1 cgd {
397 1.9 jtc GNode *gn = (GNode *) gnp;
398 1.9 jtc int op = *(int *) opp;
399 1.1 cgd /*
400 1.1 cgd * If the dependency mask of the operator and the node don't match and
401 1.1 cgd * the node has actually had an operator applied to it before, and
402 1.1 cgd * the operator actually has some dependency information in it, complain.
403 1.1 cgd */
404 1.1 cgd if (((op & OP_OPMASK) != (gn->type & OP_OPMASK)) &&
405 1.1 cgd !OP_NOP(gn->type) && !OP_NOP(op))
406 1.1 cgd {
407 1.1 cgd Parse_Error (PARSE_FATAL, "Inconsistent operator for %s", gn->name);
408 1.1 cgd return (1);
409 1.1 cgd }
410 1.1 cgd
411 1.1 cgd if ((op == OP_DOUBLEDEP) && ((gn->type & OP_OPMASK) == OP_DOUBLEDEP)) {
412 1.1 cgd /*
413 1.1 cgd * If the node was the object of a :: operator, we need to create a
414 1.1 cgd * new instance of it for the children and commands on this dependency
415 1.1 cgd * line. The new instance is placed on the 'cohorts' list of the
416 1.1 cgd * initial one (note the initial one is not on its own cohorts list)
417 1.1 cgd * and the new instance is linked to all parents of the initial
418 1.1 cgd * instance.
419 1.1 cgd */
420 1.1 cgd register GNode *cohort;
421 1.1 cgd LstNode ln;
422 1.1 cgd
423 1.1 cgd cohort = Targ_NewGN(gn->name);
424 1.1 cgd /*
425 1.1 cgd * Duplicate links to parents so graph traversal is simple. Perhaps
426 1.1 cgd * some type bits should be duplicated?
427 1.1 cgd *
428 1.1 cgd * Make the cohort invisible as well to avoid duplicating it into
429 1.1 cgd * other variables. True, parents of this target won't tend to do
430 1.1 cgd * anything with their local variables, but better safe than
431 1.1 cgd * sorry.
432 1.1 cgd */
433 1.1 cgd Lst_ForEach(gn->parents, ParseLinkSrc, (ClientData)cohort);
434 1.1 cgd cohort->type = OP_DOUBLEDEP|OP_INVISIBLE;
435 1.1 cgd (void)Lst_AtEnd(gn->cohorts, (ClientData)cohort);
436 1.1 cgd
437 1.1 cgd /*
438 1.1 cgd * Replace the node in the targets list with the new copy
439 1.1 cgd */
440 1.1 cgd ln = Lst_Member(targets, (ClientData)gn);
441 1.1 cgd Lst_Replace(ln, (ClientData)cohort);
442 1.1 cgd gn = cohort;
443 1.1 cgd }
444 1.1 cgd /*
445 1.1 cgd * We don't want to nuke any previous flags (whatever they were) so we
446 1.1 cgd * just OR the new operator into the old
447 1.1 cgd */
448 1.1 cgd gn->type |= op;
449 1.1 cgd
450 1.1 cgd return (0);
451 1.1 cgd }
452 1.1 cgd
453 1.18 christos /*-
454 1.18 christos *---------------------------------------------------------------------
455 1.18 christos * ParseAddDep --
456 1.18 christos * Check if the pair of GNodes given needs to be synchronized.
457 1.18 christos * This has to be when two nodes are on different sides of a
458 1.18 christos * .WAIT directive.
459 1.18 christos *
460 1.18 christos * Results:
461 1.18 christos * Returns 1 if the two targets need to be ordered, 0 otherwise.
462 1.18 christos * If it returns 1, the search can stop
463 1.18 christos *
464 1.18 christos * Side Effects:
465 1.18 christos * A dependency can be added between the two nodes.
466 1.18 christos *
467 1.18 christos *---------------------------------------------------------------------
468 1.18 christos */
469 1.18 christos int
470 1.18 christos ParseAddDep(pp, sp)
471 1.18 christos ClientData pp;
472 1.18 christos ClientData sp;
473 1.18 christos {
474 1.18 christos GNode *p = (GNode *) pp;
475 1.18 christos GNode *s = (GNode *) sp;
476 1.18 christos
477 1.18 christos if (p->order < s->order) {
478 1.18 christos /*
479 1.18 christos * XXX: This can cause loops, and loops can cause unmade targets,
480 1.18 christos * but checking is tedious, and the debugging output can show the
481 1.18 christos * problem
482 1.18 christos */
483 1.18 christos (void)Lst_AtEnd(p->successors, (ClientData)s);
484 1.18 christos (void)Lst_AtEnd(s->preds, (ClientData)p);
485 1.18 christos return 0;
486 1.18 christos }
487 1.18 christos else
488 1.18 christos return 1;
489 1.18 christos }
490 1.18 christos
491 1.18 christos
492 1.1 cgd /*-
493 1.1 cgd *---------------------------------------------------------------------
494 1.1 cgd * ParseDoSrc --
495 1.1 cgd * Given the name of a source, figure out if it is an attribute
496 1.1 cgd * and apply it to the targets if it is. Else decide if there is
497 1.1 cgd * some attribute which should be applied *to* the source because
498 1.1 cgd * of some special target and apply it if so. Otherwise, make the
499 1.1 cgd * source be a child of the targets in the list 'targets'
500 1.1 cgd *
501 1.1 cgd * Results:
502 1.1 cgd * None
503 1.1 cgd *
504 1.1 cgd * Side Effects:
505 1.1 cgd * Operator bits may be added to the list of targets or to the source.
506 1.1 cgd * The targets may have a new source added to their lists of children.
507 1.1 cgd *---------------------------------------------------------------------
508 1.1 cgd */
509 1.1 cgd static void
510 1.18 christos ParseDoSrc (tOp, src, allsrc)
511 1.1 cgd int tOp; /* operator (if any) from special targets */
512 1.1 cgd char *src; /* name of the source to handle */
513 1.18 christos Lst allsrc; /* List of all sources to wait for */
514 1.18 christos
515 1.1 cgd {
516 1.18 christos GNode *gn = NULL;
517 1.1 cgd
518 1.1 cgd if (*src == '.' && isupper (src[1])) {
519 1.1 cgd int keywd = ParseFindKeyword(src);
520 1.1 cgd if (keywd != -1) {
521 1.18 christos int op = parseKeywords[keywd].op;
522 1.18 christos if (op != 0) {
523 1.18 christos Lst_ForEach (targets, ParseDoOp, (ClientData)&op);
524 1.18 christos return;
525 1.18 christos }
526 1.18 christos if (parseKeywords[keywd].spec == Wait) {
527 1.18 christos waiting++;
528 1.18 christos return;
529 1.18 christos }
530 1.1 cgd }
531 1.1 cgd }
532 1.18 christos
533 1.18 christos switch (specType) {
534 1.18 christos case Main:
535 1.1 cgd /*
536 1.1 cgd * If we have noted the existence of a .MAIN, it means we need
537 1.1 cgd * to add the sources of said target to the list of things
538 1.1 cgd * to create. The string 'src' is likely to be free, so we
539 1.1 cgd * must make a new copy of it. Note that this will only be
540 1.1 cgd * invoked if the user didn't specify a target on the command
541 1.1 cgd * line. This is to allow #ifmake's to succeed, or something...
542 1.1 cgd */
543 1.1 cgd (void) Lst_AtEnd (create, (ClientData)strdup(src));
544 1.1 cgd /*
545 1.1 cgd * Add the name to the .TARGETS variable as well, so the user cna
546 1.1 cgd * employ that, if desired.
547 1.1 cgd */
548 1.1 cgd Var_Append(".TARGETS", src, VAR_GLOBAL);
549 1.18 christos return;
550 1.18 christos
551 1.18 christos case Order:
552 1.1 cgd /*
553 1.1 cgd * Create proper predecessor/successor links between the previous
554 1.1 cgd * source and the current one.
555 1.1 cgd */
556 1.1 cgd gn = Targ_FindNode(src, TARG_CREATE);
557 1.1 cgd if (predecessor != NILGNODE) {
558 1.1 cgd (void)Lst_AtEnd(predecessor->successors, (ClientData)gn);
559 1.1 cgd (void)Lst_AtEnd(gn->preds, (ClientData)predecessor);
560 1.1 cgd }
561 1.1 cgd /*
562 1.1 cgd * The current source now becomes the predecessor for the next one.
563 1.1 cgd */
564 1.1 cgd predecessor = gn;
565 1.18 christos break;
566 1.18 christos
567 1.18 christos default:
568 1.1 cgd /*
569 1.1 cgd * If the source is not an attribute, we need to find/create
570 1.1 cgd * a node for it. After that we can apply any operator to it
571 1.1 cgd * from a special target or link it to its parents, as
572 1.1 cgd * appropriate.
573 1.1 cgd *
574 1.1 cgd * In the case of a source that was the object of a :: operator,
575 1.1 cgd * the attribute is applied to all of its instances (as kept in
576 1.1 cgd * the 'cohorts' list of the node) or all the cohorts are linked
577 1.1 cgd * to all the targets.
578 1.1 cgd */
579 1.1 cgd gn = Targ_FindNode (src, TARG_CREATE);
580 1.1 cgd if (tOp) {
581 1.1 cgd gn->type |= tOp;
582 1.1 cgd } else {
583 1.1 cgd Lst_ForEach (targets, ParseLinkSrc, (ClientData)gn);
584 1.1 cgd }
585 1.1 cgd if ((gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
586 1.1 cgd register GNode *cohort;
587 1.1 cgd register LstNode ln;
588 1.1 cgd
589 1.1 cgd for (ln=Lst_First(gn->cohorts); ln != NILLNODE; ln = Lst_Succ(ln)){
590 1.1 cgd cohort = (GNode *)Lst_Datum(ln);
591 1.1 cgd if (tOp) {
592 1.1 cgd cohort->type |= tOp;
593 1.1 cgd } else {
594 1.1 cgd Lst_ForEach(targets, ParseLinkSrc, (ClientData)cohort);
595 1.1 cgd }
596 1.1 cgd }
597 1.1 cgd }
598 1.18 christos break;
599 1.18 christos }
600 1.18 christos
601 1.18 christos gn->order = waiting;
602 1.18 christos (void)Lst_AtEnd(allsrc, (ClientData)gn);
603 1.18 christos if (waiting) {
604 1.18 christos Lst_ForEach(allsrc, ParseAddDep, (ClientData)gn);
605 1.1 cgd }
606 1.1 cgd }
607 1.1 cgd
608 1.1 cgd /*-
609 1.1 cgd *-----------------------------------------------------------------------
610 1.1 cgd * ParseFindMain --
611 1.1 cgd * Find a real target in the list and set it to be the main one.
612 1.1 cgd * Called by ParseDoDependency when a main target hasn't been found
613 1.1 cgd * yet.
614 1.1 cgd *
615 1.1 cgd * Results:
616 1.1 cgd * 0 if main not found yet, 1 if it is.
617 1.1 cgd *
618 1.1 cgd * Side Effects:
619 1.1 cgd * mainNode is changed and Targ_SetMain is called.
620 1.1 cgd *
621 1.1 cgd *-----------------------------------------------------------------------
622 1.1 cgd */
623 1.1 cgd static int
624 1.9 jtc ParseFindMain(gnp, dummy)
625 1.9 jtc ClientData gnp; /* Node to examine */
626 1.9 jtc ClientData dummy;
627 1.1 cgd {
628 1.9 jtc GNode *gn = (GNode *) gnp;
629 1.1 cgd if ((gn->type & (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM)) == 0) {
630 1.1 cgd mainNode = gn;
631 1.1 cgd Targ_SetMain(gn);
632 1.9 jtc return (dummy ? 1 : 1);
633 1.1 cgd } else {
634 1.9 jtc return (dummy ? 0 : 0);
635 1.1 cgd }
636 1.1 cgd }
637 1.1 cgd
638 1.1 cgd /*-
639 1.1 cgd *-----------------------------------------------------------------------
640 1.1 cgd * ParseAddDir --
641 1.1 cgd * Front-end for Dir_AddDir to make sure Lst_ForEach keeps going
642 1.1 cgd *
643 1.1 cgd * Results:
644 1.1 cgd * === 0
645 1.1 cgd *
646 1.1 cgd * Side Effects:
647 1.1 cgd * See Dir_AddDir.
648 1.1 cgd *
649 1.1 cgd *-----------------------------------------------------------------------
650 1.1 cgd */
651 1.1 cgd static int
652 1.1 cgd ParseAddDir(path, name)
653 1.9 jtc ClientData path;
654 1.9 jtc ClientData name;
655 1.1 cgd {
656 1.9 jtc Dir_AddDir((Lst) path, (char *) name);
657 1.1 cgd return(0);
658 1.1 cgd }
659 1.1 cgd
660 1.1 cgd /*-
661 1.1 cgd *-----------------------------------------------------------------------
662 1.1 cgd * ParseClearPath --
663 1.1 cgd * Front-end for Dir_ClearPath to make sure Lst_ForEach keeps going
664 1.1 cgd *
665 1.1 cgd * Results:
666 1.1 cgd * === 0
667 1.1 cgd *
668 1.1 cgd * Side Effects:
669 1.1 cgd * See Dir_ClearPath
670 1.1 cgd *
671 1.1 cgd *-----------------------------------------------------------------------
672 1.1 cgd */
673 1.1 cgd static int
674 1.9 jtc ParseClearPath(path, dummy)
675 1.9 jtc ClientData path;
676 1.9 jtc ClientData dummy;
677 1.1 cgd {
678 1.9 jtc Dir_ClearPath((Lst) path);
679 1.9 jtc return(dummy ? 0 : 0);
680 1.1 cgd }
681 1.1 cgd
682 1.1 cgd /*-
683 1.1 cgd *---------------------------------------------------------------------
684 1.1 cgd * ParseDoDependency --
685 1.1 cgd * Parse the dependency line in line.
686 1.1 cgd *
687 1.1 cgd * Results:
688 1.1 cgd * None
689 1.1 cgd *
690 1.1 cgd * Side Effects:
691 1.1 cgd * The nodes of the sources are linked as children to the nodes of the
692 1.1 cgd * targets. Some nodes may be created.
693 1.1 cgd *
694 1.1 cgd * We parse a dependency line by first extracting words from the line and
695 1.1 cgd * finding nodes in the list of all targets with that name. This is done
696 1.1 cgd * until a character is encountered which is an operator character. Currently
697 1.1 cgd * these are only ! and :. At this point the operator is parsed and the
698 1.1 cgd * pointer into the line advanced until the first source is encountered.
699 1.1 cgd * The parsed operator is applied to each node in the 'targets' list,
700 1.1 cgd * which is where the nodes found for the targets are kept, by means of
701 1.1 cgd * the ParseDoOp function.
702 1.1 cgd * The sources are read in much the same way as the targets were except
703 1.1 cgd * that now they are expanded using the wildcarding scheme of the C-Shell
704 1.1 cgd * and all instances of the resulting words in the list of all targets
705 1.1 cgd * are found. Each of the resulting nodes is then linked to each of the
706 1.1 cgd * targets as one of its children.
707 1.1 cgd * Certain targets are handled specially. These are the ones detailed
708 1.1 cgd * by the specType variable.
709 1.1 cgd * The storing of transformation rules is also taken care of here.
710 1.1 cgd * A target is recognized as a transformation rule by calling
711 1.1 cgd * Suff_IsTransform. If it is a transformation rule, its node is gotten
712 1.1 cgd * from the suffix module via Suff_AddTransform rather than the standard
713 1.1 cgd * Targ_FindNode in the target module.
714 1.1 cgd *---------------------------------------------------------------------
715 1.1 cgd */
716 1.1 cgd static void
717 1.1 cgd ParseDoDependency (line)
718 1.1 cgd char *line; /* the line to parse */
719 1.1 cgd {
720 1.9 jtc char *cp; /* our current position */
721 1.9 jtc GNode *gn; /* a general purpose temporary node */
722 1.9 jtc int op; /* the operator on the line */
723 1.1 cgd char savec; /* a place to save a character */
724 1.1 cgd Lst paths; /* List of search paths to alter when parsing
725 1.1 cgd * a list of .PATH targets */
726 1.1 cgd int tOp; /* operator from special target */
727 1.18 christos Lst sources; /* list of archive source names after
728 1.18 christos * expansion */
729 1.1 cgd Lst curTargs; /* list of target names to be found and added
730 1.1 cgd * to the targets list */
731 1.18 christos Lst curSrcs; /* list of sources in order */
732 1.1 cgd
733 1.1 cgd tOp = 0;
734 1.1 cgd
735 1.1 cgd specType = Not;
736 1.18 christos waiting = 0;
737 1.1 cgd paths = (Lst)NULL;
738 1.1 cgd
739 1.1 cgd curTargs = Lst_Init(FALSE);
740 1.18 christos curSrcs = Lst_Init(FALSE);
741 1.1 cgd
742 1.1 cgd do {
743 1.1 cgd for (cp = line;
744 1.1 cgd *cp && !isspace (*cp) &&
745 1.1 cgd (*cp != '!') && (*cp != ':') && (*cp != '(');
746 1.1 cgd cp++)
747 1.1 cgd {
748 1.1 cgd if (*cp == '$') {
749 1.1 cgd /*
750 1.1 cgd * Must be a dynamic source (would have been expanded
751 1.1 cgd * otherwise), so call the Var module to parse the puppy
752 1.1 cgd * so we can safely advance beyond it...There should be
753 1.1 cgd * no errors in this, as they would have been discovered
754 1.1 cgd * in the initial Var_Subst and we wouldn't be here.
755 1.1 cgd */
756 1.1 cgd int length;
757 1.1 cgd Boolean freeIt;
758 1.1 cgd char *result;
759 1.1 cgd
760 1.1 cgd result=Var_Parse(cp, VAR_CMD, TRUE, &length, &freeIt);
761 1.1 cgd
762 1.1 cgd if (freeIt) {
763 1.1 cgd free(result);
764 1.1 cgd }
765 1.1 cgd cp += length-1;
766 1.1 cgd }
767 1.1 cgd continue;
768 1.1 cgd }
769 1.1 cgd if (*cp == '(') {
770 1.1 cgd /*
771 1.1 cgd * Archives must be handled specially to make sure the OP_ARCHV
772 1.1 cgd * flag is set in their 'type' field, for one thing, and because
773 1.1 cgd * things like "archive(file1.o file2.o file3.o)" are permissible.
774 1.1 cgd * Arch_ParseArchive will set 'line' to be the first non-blank
775 1.1 cgd * after the archive-spec. It creates/finds nodes for the members
776 1.1 cgd * and places them on the given list, returning SUCCESS if all
777 1.1 cgd * went well and FAILURE if there was an error in the
778 1.1 cgd * specification. On error, line should remain untouched.
779 1.1 cgd */
780 1.1 cgd if (Arch_ParseArchive (&line, targets, VAR_CMD) != SUCCESS) {
781 1.1 cgd Parse_Error (PARSE_FATAL,
782 1.1 cgd "Error in archive specification: \"%s\"", line);
783 1.1 cgd return;
784 1.1 cgd } else {
785 1.1 cgd continue;
786 1.1 cgd }
787 1.1 cgd }
788 1.1 cgd savec = *cp;
789 1.1 cgd
790 1.1 cgd if (!*cp) {
791 1.1 cgd /*
792 1.1 cgd * Ending a dependency line without an operator is a Bozo
793 1.1 cgd * no-no
794 1.1 cgd */
795 1.1 cgd Parse_Error (PARSE_FATAL, "Need an operator");
796 1.1 cgd return;
797 1.1 cgd }
798 1.1 cgd *cp = '\0';
799 1.1 cgd /*
800 1.1 cgd * Have a word in line. See if it's a special target and set
801 1.1 cgd * specType to match it.
802 1.1 cgd */
803 1.1 cgd if (*line == '.' && isupper (line[1])) {
804 1.1 cgd /*
805 1.1 cgd * See if the target is a special target that must have it
806 1.1 cgd * or its sources handled specially.
807 1.1 cgd */
808 1.1 cgd int keywd = ParseFindKeyword(line);
809 1.1 cgd if (keywd != -1) {
810 1.5 cgd if (specType == ExPath && parseKeywords[keywd].spec != ExPath) {
811 1.1 cgd Parse_Error(PARSE_FATAL, "Mismatched special targets");
812 1.1 cgd return;
813 1.1 cgd }
814 1.1 cgd
815 1.1 cgd specType = parseKeywords[keywd].spec;
816 1.1 cgd tOp = parseKeywords[keywd].op;
817 1.1 cgd
818 1.1 cgd /*
819 1.1 cgd * Certain special targets have special semantics:
820 1.1 cgd * .PATH Have to set the dirSearchPath
821 1.1 cgd * variable too
822 1.1 cgd * .MAIN Its sources are only used if
823 1.1 cgd * nothing has been specified to
824 1.1 cgd * create.
825 1.1 cgd * .DEFAULT Need to create a node to hang
826 1.1 cgd * commands on, but we don't want
827 1.1 cgd * it in the graph, nor do we want
828 1.1 cgd * it to be the Main Target, so we
829 1.1 cgd * create it, set OP_NOTMAIN and
830 1.1 cgd * add it to the list, setting
831 1.1 cgd * DEFAULT to the new node for
832 1.1 cgd * later use. We claim the node is
833 1.1 cgd * A transformation rule to make
834 1.1 cgd * life easier later, when we'll
835 1.1 cgd * use Make_HandleUse to actually
836 1.1 cgd * apply the .DEFAULT commands.
837 1.22 christos * .PHONY The list of targets
838 1.1 cgd * .BEGIN
839 1.1 cgd * .END
840 1.1 cgd * .INTERRUPT Are not to be considered the
841 1.1 cgd * main target.
842 1.1 cgd * .NOTPARALLEL Make only one target at a time.
843 1.1 cgd * .SINGLESHELL Create a shell for each command.
844 1.1 cgd * .ORDER Must set initial predecessor to NIL
845 1.1 cgd */
846 1.1 cgd switch (specType) {
847 1.5 cgd case ExPath:
848 1.1 cgd if (paths == NULL) {
849 1.1 cgd paths = Lst_Init(FALSE);
850 1.1 cgd }
851 1.1 cgd (void)Lst_AtEnd(paths, (ClientData)dirSearchPath);
852 1.1 cgd break;
853 1.1 cgd case Main:
854 1.1 cgd if (!Lst_IsEmpty(create)) {
855 1.1 cgd specType = Not;
856 1.1 cgd }
857 1.1 cgd break;
858 1.1 cgd case Begin:
859 1.1 cgd case End:
860 1.1 cgd case Interrupt:
861 1.1 cgd gn = Targ_FindNode(line, TARG_CREATE);
862 1.1 cgd gn->type |= OP_NOTMAIN;
863 1.1 cgd (void)Lst_AtEnd(targets, (ClientData)gn);
864 1.1 cgd break;
865 1.1 cgd case Default:
866 1.1 cgd gn = Targ_NewGN(".DEFAULT");
867 1.1 cgd gn->type |= (OP_NOTMAIN|OP_TRANSFORM);
868 1.1 cgd (void)Lst_AtEnd(targets, (ClientData)gn);
869 1.1 cgd DEFAULT = gn;
870 1.1 cgd break;
871 1.1 cgd case NotParallel:
872 1.1 cgd {
873 1.1 cgd extern int maxJobs;
874 1.1 cgd
875 1.1 cgd maxJobs = 1;
876 1.1 cgd break;
877 1.1 cgd }
878 1.1 cgd case SingleShell:
879 1.5 cgd compatMake = 1;
880 1.1 cgd break;
881 1.1 cgd case Order:
882 1.1 cgd predecessor = NILGNODE;
883 1.1 cgd break;
884 1.5 cgd default:
885 1.5 cgd break;
886 1.1 cgd }
887 1.1 cgd } else if (strncmp (line, ".PATH", 5) == 0) {
888 1.1 cgd /*
889 1.1 cgd * .PATH<suffix> has to be handled specially.
890 1.1 cgd * Call on the suffix module to give us a path to
891 1.1 cgd * modify.
892 1.1 cgd */
893 1.1 cgd Lst path;
894 1.1 cgd
895 1.5 cgd specType = ExPath;
896 1.1 cgd path = Suff_GetPath (&line[5]);
897 1.1 cgd if (path == NILLST) {
898 1.1 cgd Parse_Error (PARSE_FATAL,
899 1.1 cgd "Suffix '%s' not defined (yet)",
900 1.1 cgd &line[5]);
901 1.1 cgd return;
902 1.1 cgd } else {
903 1.1 cgd if (paths == (Lst)NULL) {
904 1.1 cgd paths = Lst_Init(FALSE);
905 1.1 cgd }
906 1.1 cgd (void)Lst_AtEnd(paths, (ClientData)path);
907 1.1 cgd }
908 1.1 cgd }
909 1.1 cgd }
910 1.1 cgd
911 1.1 cgd /*
912 1.1 cgd * Have word in line. Get or create its node and stick it at
913 1.1 cgd * the end of the targets list
914 1.1 cgd */
915 1.1 cgd if ((specType == Not) && (*line != '\0')) {
916 1.1 cgd if (Dir_HasWildcards(line)) {
917 1.1 cgd /*
918 1.1 cgd * Targets are to be sought only in the current directory,
919 1.1 cgd * so create an empty path for the thing. Note we need to
920 1.1 cgd * use Dir_Destroy in the destruction of the path as the
921 1.1 cgd * Dir module could have added a directory to the path...
922 1.1 cgd */
923 1.1 cgd Lst emptyPath = Lst_Init(FALSE);
924 1.1 cgd
925 1.1 cgd Dir_Expand(line, emptyPath, curTargs);
926 1.1 cgd
927 1.1 cgd Lst_Destroy(emptyPath, Dir_Destroy);
928 1.1 cgd } else {
929 1.1 cgd /*
930 1.1 cgd * No wildcards, but we want to avoid code duplication,
931 1.1 cgd * so create a list with the word on it.
932 1.1 cgd */
933 1.1 cgd (void)Lst_AtEnd(curTargs, (ClientData)line);
934 1.1 cgd }
935 1.1 cgd
936 1.1 cgd while(!Lst_IsEmpty(curTargs)) {
937 1.1 cgd char *targName = (char *)Lst_DeQueue(curTargs);
938 1.1 cgd
939 1.1 cgd if (!Suff_IsTransform (targName)) {
940 1.1 cgd gn = Targ_FindNode (targName, TARG_CREATE);
941 1.1 cgd } else {
942 1.1 cgd gn = Suff_AddTransform (targName);
943 1.1 cgd }
944 1.1 cgd
945 1.1 cgd (void)Lst_AtEnd (targets, (ClientData)gn);
946 1.1 cgd }
947 1.5 cgd } else if (specType == ExPath && *line != '.' && *line != '\0') {
948 1.1 cgd Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", line);
949 1.1 cgd }
950 1.1 cgd
951 1.1 cgd *cp = savec;
952 1.1 cgd /*
953 1.1 cgd * If it is a special type and not .PATH, it's the only target we
954 1.1 cgd * allow on this line...
955 1.1 cgd */
956 1.5 cgd if (specType != Not && specType != ExPath) {
957 1.1 cgd Boolean warn = FALSE;
958 1.1 cgd
959 1.1 cgd while ((*cp != '!') && (*cp != ':') && *cp) {
960 1.1 cgd if (*cp != ' ' && *cp != '\t') {
961 1.1 cgd warn = TRUE;
962 1.1 cgd }
963 1.1 cgd cp++;
964 1.1 cgd }
965 1.1 cgd if (warn) {
966 1.1 cgd Parse_Error(PARSE_WARNING, "Extra target ignored");
967 1.1 cgd }
968 1.1 cgd } else {
969 1.1 cgd while (*cp && isspace (*cp)) {
970 1.1 cgd cp++;
971 1.1 cgd }
972 1.1 cgd }
973 1.1 cgd line = cp;
974 1.1 cgd } while ((*line != '!') && (*line != ':') && *line);
975 1.1 cgd
976 1.1 cgd /*
977 1.1 cgd * Don't need the list of target names anymore...
978 1.1 cgd */
979 1.1 cgd Lst_Destroy(curTargs, NOFREE);
980 1.1 cgd
981 1.1 cgd if (!Lst_IsEmpty(targets)) {
982 1.1 cgd switch(specType) {
983 1.1 cgd default:
984 1.1 cgd Parse_Error(PARSE_WARNING, "Special and mundane targets don't mix. Mundane ones ignored");
985 1.1 cgd break;
986 1.1 cgd case Default:
987 1.1 cgd case Begin:
988 1.1 cgd case End:
989 1.1 cgd case Interrupt:
990 1.1 cgd /*
991 1.1 cgd * These four create nodes on which to hang commands, so
992 1.1 cgd * targets shouldn't be empty...
993 1.1 cgd */
994 1.1 cgd case Not:
995 1.1 cgd /*
996 1.1 cgd * Nothing special here -- targets can be empty if it wants.
997 1.1 cgd */
998 1.1 cgd break;
999 1.1 cgd }
1000 1.1 cgd }
1001 1.1 cgd
1002 1.1 cgd /*
1003 1.1 cgd * Have now parsed all the target names. Must parse the operator next. The
1004 1.1 cgd * result is left in op .
1005 1.1 cgd */
1006 1.1 cgd if (*cp == '!') {
1007 1.1 cgd op = OP_FORCE;
1008 1.1 cgd } else if (*cp == ':') {
1009 1.1 cgd if (cp[1] == ':') {
1010 1.1 cgd op = OP_DOUBLEDEP;
1011 1.1 cgd cp++;
1012 1.1 cgd } else {
1013 1.1 cgd op = OP_DEPENDS;
1014 1.1 cgd }
1015 1.1 cgd } else {
1016 1.1 cgd Parse_Error (PARSE_FATAL, "Missing dependency operator");
1017 1.1 cgd return;
1018 1.1 cgd }
1019 1.1 cgd
1020 1.1 cgd cp++; /* Advance beyond operator */
1021 1.1 cgd
1022 1.9 jtc Lst_ForEach (targets, ParseDoOp, (ClientData)&op);
1023 1.1 cgd
1024 1.1 cgd /*
1025 1.1 cgd * Get to the first source
1026 1.1 cgd */
1027 1.1 cgd while (*cp && isspace (*cp)) {
1028 1.1 cgd cp++;
1029 1.1 cgd }
1030 1.1 cgd line = cp;
1031 1.1 cgd
1032 1.1 cgd /*
1033 1.1 cgd * Several special targets take different actions if present with no
1034 1.1 cgd * sources:
1035 1.1 cgd * a .SUFFIXES line with no sources clears out all old suffixes
1036 1.1 cgd * a .PRECIOUS line makes all targets precious
1037 1.1 cgd * a .IGNORE line ignores errors for all targets
1038 1.1 cgd * a .SILENT line creates silence when making all targets
1039 1.1 cgd * a .PATH removes all directories from the search path(s).
1040 1.1 cgd */
1041 1.1 cgd if (!*line) {
1042 1.1 cgd switch (specType) {
1043 1.1 cgd case Suffixes:
1044 1.1 cgd Suff_ClearSuffixes ();
1045 1.1 cgd break;
1046 1.1 cgd case Precious:
1047 1.1 cgd allPrecious = TRUE;
1048 1.1 cgd break;
1049 1.1 cgd case Ignore:
1050 1.1 cgd ignoreErrors = TRUE;
1051 1.1 cgd break;
1052 1.1 cgd case Silent:
1053 1.1 cgd beSilent = TRUE;
1054 1.1 cgd break;
1055 1.5 cgd case ExPath:
1056 1.1 cgd Lst_ForEach(paths, ParseClearPath, (ClientData)NULL);
1057 1.1 cgd break;
1058 1.5 cgd default:
1059 1.5 cgd break;
1060 1.1 cgd }
1061 1.1 cgd } else if (specType == MFlags) {
1062 1.1 cgd /*
1063 1.1 cgd * Call on functions in main.c to deal with these arguments and
1064 1.1 cgd * set the initial character to a null-character so the loop to
1065 1.1 cgd * get sources won't get anything
1066 1.1 cgd */
1067 1.1 cgd Main_ParseArgLine (line);
1068 1.1 cgd *line = '\0';
1069 1.5 cgd } else if (specType == ExShell) {
1070 1.1 cgd if (Job_ParseShell (line) != SUCCESS) {
1071 1.1 cgd Parse_Error (PARSE_FATAL, "improper shell specification");
1072 1.1 cgd return;
1073 1.1 cgd }
1074 1.1 cgd *line = '\0';
1075 1.1 cgd } else if ((specType == NotParallel) || (specType == SingleShell)) {
1076 1.1 cgd *line = '\0';
1077 1.1 cgd }
1078 1.1 cgd
1079 1.1 cgd /*
1080 1.1 cgd * NOW GO FOR THE SOURCES
1081 1.1 cgd */
1082 1.5 cgd if ((specType == Suffixes) || (specType == ExPath) ||
1083 1.1 cgd (specType == Includes) || (specType == Libs) ||
1084 1.1 cgd (specType == Null))
1085 1.1 cgd {
1086 1.1 cgd while (*line) {
1087 1.1 cgd /*
1088 1.1 cgd * If the target was one that doesn't take files as its sources
1089 1.1 cgd * but takes something like suffixes, we take each
1090 1.1 cgd * space-separated word on the line as a something and deal
1091 1.1 cgd * with it accordingly.
1092 1.1 cgd *
1093 1.1 cgd * If the target was .SUFFIXES, we take each source as a
1094 1.1 cgd * suffix and add it to the list of suffixes maintained by the
1095 1.1 cgd * Suff module.
1096 1.1 cgd *
1097 1.1 cgd * If the target was a .PATH, we add the source as a directory
1098 1.1 cgd * to search on the search path.
1099 1.1 cgd *
1100 1.1 cgd * If it was .INCLUDES, the source is taken to be the suffix of
1101 1.1 cgd * files which will be #included and whose search path should
1102 1.1 cgd * be present in the .INCLUDES variable.
1103 1.1 cgd *
1104 1.1 cgd * If it was .LIBS, the source is taken to be the suffix of
1105 1.1 cgd * files which are considered libraries and whose search path
1106 1.1 cgd * should be present in the .LIBS variable.
1107 1.1 cgd *
1108 1.1 cgd * If it was .NULL, the source is the suffix to use when a file
1109 1.1 cgd * has no valid suffix.
1110 1.1 cgd */
1111 1.1 cgd char savec;
1112 1.1 cgd while (*cp && !isspace (*cp)) {
1113 1.1 cgd cp++;
1114 1.1 cgd }
1115 1.1 cgd savec = *cp;
1116 1.1 cgd *cp = '\0';
1117 1.1 cgd switch (specType) {
1118 1.1 cgd case Suffixes:
1119 1.1 cgd Suff_AddSuffix (line);
1120 1.1 cgd break;
1121 1.5 cgd case ExPath:
1122 1.1 cgd Lst_ForEach(paths, ParseAddDir, (ClientData)line);
1123 1.1 cgd break;
1124 1.1 cgd case Includes:
1125 1.1 cgd Suff_AddInclude (line);
1126 1.1 cgd break;
1127 1.1 cgd case Libs:
1128 1.1 cgd Suff_AddLib (line);
1129 1.1 cgd break;
1130 1.1 cgd case Null:
1131 1.1 cgd Suff_SetNull (line);
1132 1.1 cgd break;
1133 1.5 cgd default:
1134 1.5 cgd break;
1135 1.1 cgd }
1136 1.1 cgd *cp = savec;
1137 1.1 cgd if (savec != '\0') {
1138 1.1 cgd cp++;
1139 1.1 cgd }
1140 1.1 cgd while (*cp && isspace (*cp)) {
1141 1.1 cgd cp++;
1142 1.1 cgd }
1143 1.1 cgd line = cp;
1144 1.1 cgd }
1145 1.1 cgd if (paths) {
1146 1.1 cgd Lst_Destroy(paths, NOFREE);
1147 1.1 cgd }
1148 1.1 cgd } else {
1149 1.1 cgd while (*line) {
1150 1.1 cgd /*
1151 1.1 cgd * The targets take real sources, so we must beware of archive
1152 1.1 cgd * specifications (i.e. things with left parentheses in them)
1153 1.1 cgd * and handle them accordingly.
1154 1.1 cgd */
1155 1.1 cgd while (*cp && !isspace (*cp)) {
1156 1.1 cgd if ((*cp == '(') && (cp > line) && (cp[-1] != '$')) {
1157 1.1 cgd /*
1158 1.1 cgd * Only stop for a left parenthesis if it isn't at the
1159 1.1 cgd * start of a word (that'll be for variable changes
1160 1.1 cgd * later) and isn't preceded by a dollar sign (a dynamic
1161 1.1 cgd * source).
1162 1.1 cgd */
1163 1.1 cgd break;
1164 1.1 cgd } else {
1165 1.1 cgd cp++;
1166 1.1 cgd }
1167 1.1 cgd }
1168 1.1 cgd
1169 1.1 cgd if (*cp == '(') {
1170 1.1 cgd GNode *gn;
1171 1.1 cgd
1172 1.1 cgd sources = Lst_Init (FALSE);
1173 1.1 cgd if (Arch_ParseArchive (&line, sources, VAR_CMD) != SUCCESS) {
1174 1.1 cgd Parse_Error (PARSE_FATAL,
1175 1.1 cgd "Error in source archive spec \"%s\"", line);
1176 1.1 cgd return;
1177 1.1 cgd }
1178 1.1 cgd
1179 1.1 cgd while (!Lst_IsEmpty (sources)) {
1180 1.1 cgd gn = (GNode *) Lst_DeQueue (sources);
1181 1.18 christos ParseDoSrc (tOp, gn->name, curSrcs);
1182 1.1 cgd }
1183 1.1 cgd Lst_Destroy (sources, NOFREE);
1184 1.1 cgd cp = line;
1185 1.1 cgd } else {
1186 1.1 cgd if (*cp) {
1187 1.1 cgd *cp = '\0';
1188 1.1 cgd cp += 1;
1189 1.1 cgd }
1190 1.1 cgd
1191 1.18 christos ParseDoSrc (tOp, line, curSrcs);
1192 1.1 cgd }
1193 1.1 cgd while (*cp && isspace (*cp)) {
1194 1.1 cgd cp++;
1195 1.1 cgd }
1196 1.1 cgd line = cp;
1197 1.1 cgd }
1198 1.1 cgd }
1199 1.1 cgd
1200 1.1 cgd if (mainNode == NILGNODE) {
1201 1.1 cgd /*
1202 1.1 cgd * If we have yet to decide on a main target to make, in the
1203 1.1 cgd * absence of any user input, we want the first target on
1204 1.1 cgd * the first dependency line that is actually a real target
1205 1.1 cgd * (i.e. isn't a .USE or .EXEC rule) to be made.
1206 1.1 cgd */
1207 1.1 cgd Lst_ForEach (targets, ParseFindMain, (ClientData)0);
1208 1.1 cgd }
1209 1.1 cgd
1210 1.18 christos /*
1211 1.18 christos * Finally, destroy the list of sources
1212 1.18 christos */
1213 1.18 christos Lst_Destroy(curSrcs, NOFREE);
1214 1.1 cgd }
1215 1.1 cgd
1216 1.1 cgd /*-
1217 1.1 cgd *---------------------------------------------------------------------
1218 1.1 cgd * Parse_IsVar --
1219 1.1 cgd * Return TRUE if the passed line is a variable assignment. A variable
1220 1.1 cgd * assignment consists of a single word followed by optional whitespace
1221 1.1 cgd * followed by either a += or an = operator.
1222 1.1 cgd * This function is used both by the Parse_File function and main when
1223 1.1 cgd * parsing the command-line arguments.
1224 1.1 cgd *
1225 1.1 cgd * Results:
1226 1.1 cgd * TRUE if it is. FALSE if it ain't
1227 1.1 cgd *
1228 1.1 cgd * Side Effects:
1229 1.1 cgd * none
1230 1.1 cgd *---------------------------------------------------------------------
1231 1.1 cgd */
1232 1.1 cgd Boolean
1233 1.1 cgd Parse_IsVar (line)
1234 1.1 cgd register char *line; /* the line to check */
1235 1.1 cgd {
1236 1.1 cgd register Boolean wasSpace = FALSE; /* set TRUE if found a space */
1237 1.1 cgd register Boolean haveName = FALSE; /* Set TRUE if have a variable name */
1238 1.16 christos int level = 0;
1239 1.16 christos #define ISEQOPERATOR(c) \
1240 1.16 christos (((c) == '+') || ((c) == ':') || ((c) == '?') || ((c) == '!'))
1241 1.1 cgd
1242 1.1 cgd /*
1243 1.1 cgd * Skip to variable name
1244 1.1 cgd */
1245 1.16 christos for (;(*line == ' ') || (*line == '\t'); line++)
1246 1.16 christos continue;
1247 1.1 cgd
1248 1.16 christos for (; *line != '=' || level != 0; line++)
1249 1.16 christos switch (*line) {
1250 1.16 christos case '\0':
1251 1.1 cgd /*
1252 1.1 cgd * end-of-line -- can't be a variable assignment.
1253 1.1 cgd */
1254 1.16 christos return FALSE;
1255 1.16 christos
1256 1.16 christos case ' ':
1257 1.16 christos case '\t':
1258 1.1 cgd /*
1259 1.1 cgd * there can be as much white space as desired so long as there is
1260 1.1 cgd * only one word before the operator
1261 1.1 cgd */
1262 1.1 cgd wasSpace = TRUE;
1263 1.16 christos break;
1264 1.16 christos
1265 1.16 christos case '(':
1266 1.16 christos case '{':
1267 1.16 christos level++;
1268 1.16 christos break;
1269 1.16 christos
1270 1.16 christos case '}':
1271 1.16 christos case ')':
1272 1.16 christos level--;
1273 1.16 christos break;
1274 1.16 christos
1275 1.16 christos default:
1276 1.16 christos if (wasSpace && haveName) {
1277 1.16 christos if (ISEQOPERATOR(*line)) {
1278 1.16 christos /*
1279 1.16 christos * When an = operator [+?!:] is found, the next
1280 1.16 christos * character * must be an = or it ain't a valid
1281 1.16 christos * assignment.
1282 1.16 christos */
1283 1.16 christos if (line[1] != '=' && level == 0)
1284 1.16 christos return FALSE;
1285 1.16 christos else
1286 1.16 christos return haveName;
1287 1.16 christos }
1288 1.16 christos else {
1289 1.16 christos /*
1290 1.16 christos * This is the start of another word, so not assignment.
1291 1.16 christos */
1292 1.16 christos return FALSE;
1293 1.16 christos }
1294 1.16 christos }
1295 1.16 christos else {
1296 1.16 christos haveName = TRUE;
1297 1.16 christos wasSpace = FALSE;
1298 1.1 cgd }
1299 1.16 christos break;
1300 1.1 cgd }
1301 1.1 cgd
1302 1.16 christos return haveName;
1303 1.1 cgd }
1304 1.1 cgd
1305 1.1 cgd /*-
1306 1.1 cgd *---------------------------------------------------------------------
1307 1.1 cgd * Parse_DoVar --
1308 1.1 cgd * Take the variable assignment in the passed line and do it in the
1309 1.1 cgd * global context.
1310 1.1 cgd *
1311 1.1 cgd * Note: There is a lexical ambiguity with assignment modifier characters
1312 1.1 cgd * in variable names. This routine interprets the character before the =
1313 1.1 cgd * as a modifier. Therefore, an assignment like
1314 1.1 cgd * C++=/usr/bin/CC
1315 1.1 cgd * is interpreted as "C+ +=" instead of "C++ =".
1316 1.1 cgd *
1317 1.1 cgd * Results:
1318 1.1 cgd * none
1319 1.1 cgd *
1320 1.1 cgd * Side Effects:
1321 1.1 cgd * the variable structure of the given variable name is altered in the
1322 1.1 cgd * global context.
1323 1.1 cgd *---------------------------------------------------------------------
1324 1.1 cgd */
1325 1.1 cgd void
1326 1.1 cgd Parse_DoVar (line, ctxt)
1327 1.1 cgd char *line; /* a line guaranteed to be a variable
1328 1.1 cgd * assignment. This reduces error checks */
1329 1.1 cgd GNode *ctxt; /* Context in which to do the assignment */
1330 1.1 cgd {
1331 1.7 cgd char *cp; /* pointer into line */
1332 1.1 cgd enum {
1333 1.1 cgd VAR_SUBST, VAR_APPEND, VAR_SHELL, VAR_NORMAL
1334 1.1 cgd } type; /* Type of assignment */
1335 1.1 cgd char *opc; /* ptr to operator character to
1336 1.1 cgd * null-terminate the variable name */
1337 1.7 cgd /*
1338 1.7 cgd * Avoid clobbered variable warnings by forcing the compiler
1339 1.7 cgd * to ``unregister'' variables
1340 1.7 cgd */
1341 1.7 cgd #if __GNUC__
1342 1.7 cgd (void) &cp;
1343 1.7 cgd (void) &line;
1344 1.7 cgd #endif
1345 1.1 cgd
1346 1.1 cgd /*
1347 1.1 cgd * Skip to variable name
1348 1.1 cgd */
1349 1.1 cgd while ((*line == ' ') || (*line == '\t')) {
1350 1.1 cgd line++;
1351 1.1 cgd }
1352 1.1 cgd
1353 1.1 cgd /*
1354 1.1 cgd * Skip to operator character, nulling out whitespace as we go
1355 1.1 cgd */
1356 1.1 cgd for (cp = line + 1; *cp != '='; cp++) {
1357 1.1 cgd if (isspace (*cp)) {
1358 1.1 cgd *cp = '\0';
1359 1.1 cgd }
1360 1.1 cgd }
1361 1.1 cgd opc = cp-1; /* operator is the previous character */
1362 1.1 cgd *cp++ = '\0'; /* nuke the = */
1363 1.1 cgd
1364 1.1 cgd /*
1365 1.1 cgd * Check operator type
1366 1.1 cgd */
1367 1.1 cgd switch (*opc) {
1368 1.1 cgd case '+':
1369 1.1 cgd type = VAR_APPEND;
1370 1.1 cgd *opc = '\0';
1371 1.1 cgd break;
1372 1.1 cgd
1373 1.1 cgd case '?':
1374 1.1 cgd /*
1375 1.1 cgd * If the variable already has a value, we don't do anything.
1376 1.1 cgd */
1377 1.1 cgd *opc = '\0';
1378 1.1 cgd if (Var_Exists(line, ctxt)) {
1379 1.1 cgd return;
1380 1.1 cgd } else {
1381 1.1 cgd type = VAR_NORMAL;
1382 1.1 cgd }
1383 1.1 cgd break;
1384 1.1 cgd
1385 1.1 cgd case ':':
1386 1.1 cgd type = VAR_SUBST;
1387 1.1 cgd *opc = '\0';
1388 1.1 cgd break;
1389 1.1 cgd
1390 1.1 cgd case '!':
1391 1.1 cgd type = VAR_SHELL;
1392 1.1 cgd *opc = '\0';
1393 1.1 cgd break;
1394 1.1 cgd
1395 1.1 cgd default:
1396 1.1 cgd type = VAR_NORMAL;
1397 1.1 cgd break;
1398 1.1 cgd }
1399 1.1 cgd
1400 1.1 cgd while (isspace (*cp)) {
1401 1.1 cgd cp++;
1402 1.1 cgd }
1403 1.1 cgd
1404 1.1 cgd if (type == VAR_APPEND) {
1405 1.1 cgd Var_Append (line, cp, ctxt);
1406 1.1 cgd } else if (type == VAR_SUBST) {
1407 1.1 cgd /*
1408 1.1 cgd * Allow variables in the old value to be undefined, but leave their
1409 1.1 cgd * invocation alone -- this is done by forcing oldVars to be false.
1410 1.1 cgd * XXX: This can cause recursive variables, but that's not hard to do,
1411 1.1 cgd * and this allows someone to do something like
1412 1.1 cgd *
1413 1.1 cgd * CFLAGS = $(.INCLUDES)
1414 1.1 cgd * CFLAGS := -I.. $(CFLAGS)
1415 1.1 cgd *
1416 1.1 cgd * And not get an error.
1417 1.1 cgd */
1418 1.1 cgd Boolean oldOldVars = oldVars;
1419 1.1 cgd
1420 1.1 cgd oldVars = FALSE;
1421 1.5 cgd cp = Var_Subst(NULL, cp, ctxt, FALSE);
1422 1.1 cgd oldVars = oldOldVars;
1423 1.1 cgd
1424 1.1 cgd Var_Set(line, cp, ctxt);
1425 1.1 cgd free(cp);
1426 1.1 cgd } else if (type == VAR_SHELL) {
1427 1.1 cgd char *args[4]; /* Args for invoking the shell */
1428 1.1 cgd int fds[2]; /* Pipe streams */
1429 1.1 cgd int cpid; /* Child PID */
1430 1.1 cgd int pid; /* PID from wait() */
1431 1.1 cgd Boolean freeCmd; /* TRUE if the command needs to be freed, i.e.
1432 1.1 cgd * if any variable expansion was performed */
1433 1.1 cgd
1434 1.7 cgd /*
1435 1.7 cgd * Avoid clobbered variable warnings by forcing the compiler
1436 1.7 cgd * to ``unregister'' variables
1437 1.7 cgd */
1438 1.7 cgd #if __GNUC__
1439 1.7 cgd (void) &freeCmd;
1440 1.7 cgd #endif
1441 1.5 cgd
1442 1.1 cgd /*
1443 1.1 cgd * Set up arguments for shell
1444 1.1 cgd */
1445 1.1 cgd args[0] = "sh";
1446 1.1 cgd args[1] = "-c";
1447 1.5 cgd if (strchr(cp, '$') != (char *)NULL) {
1448 1.1 cgd /*
1449 1.1 cgd * There's a dollar sign in the command, so perform variable
1450 1.1 cgd * expansion on the whole thing. The resulting string will need
1451 1.1 cgd * freeing when we're done, so set freeCmd to TRUE.
1452 1.1 cgd */
1453 1.5 cgd args[2] = Var_Subst(NULL, cp, VAR_CMD, TRUE);
1454 1.1 cgd freeCmd = TRUE;
1455 1.1 cgd } else {
1456 1.1 cgd args[2] = cp;
1457 1.1 cgd freeCmd = FALSE;
1458 1.1 cgd }
1459 1.1 cgd args[3] = (char *)NULL;
1460 1.1 cgd
1461 1.1 cgd /*
1462 1.1 cgd * Open a pipe for fetching its output
1463 1.1 cgd */
1464 1.1 cgd pipe(fds);
1465 1.1 cgd
1466 1.1 cgd /*
1467 1.1 cgd * Fork
1468 1.1 cgd */
1469 1.1 cgd cpid = vfork();
1470 1.1 cgd if (cpid == 0) {
1471 1.1 cgd /*
1472 1.1 cgd * Close input side of pipe
1473 1.1 cgd */
1474 1.1 cgd close(fds[0]);
1475 1.1 cgd
1476 1.1 cgd /*
1477 1.1 cgd * Duplicate the output stream to the shell's output, then
1478 1.1 cgd * shut the extra thing down. Note we don't fetch the error
1479 1.1 cgd * stream...why not? Why?
1480 1.1 cgd */
1481 1.1 cgd dup2(fds[1], 1);
1482 1.1 cgd close(fds[1]);
1483 1.1 cgd
1484 1.1 cgd execv("/bin/sh", args);
1485 1.1 cgd _exit(1);
1486 1.1 cgd } else if (cpid < 0) {
1487 1.1 cgd /*
1488 1.1 cgd * Couldn't fork -- tell the user and make the variable null
1489 1.1 cgd */
1490 1.1 cgd Parse_Error(PARSE_WARNING, "Couldn't exec \"%s\"", cp);
1491 1.1 cgd Var_Set(line, "", ctxt);
1492 1.1 cgd } else {
1493 1.1 cgd int status;
1494 1.1 cgd int cc;
1495 1.5 cgd Buffer buf;
1496 1.5 cgd char *res;
1497 1.1 cgd
1498 1.1 cgd /*
1499 1.1 cgd * No need for the writing half
1500 1.1 cgd */
1501 1.1 cgd close(fds[1]);
1502 1.1 cgd
1503 1.5 cgd buf = Buf_Init (MAKE_BSIZE);
1504 1.5 cgd
1505 1.5 cgd do {
1506 1.5 cgd char result[BUFSIZ];
1507 1.5 cgd cc = read(fds[0], result, sizeof(result));
1508 1.5 cgd if (cc > 0)
1509 1.9 jtc Buf_AddBytes(buf, cc, (Byte *) result);
1510 1.5 cgd }
1511 1.5 cgd while (cc > 0 || (cc == -1 && errno == EINTR));
1512 1.5 cgd
1513 1.1 cgd /*
1514 1.5 cgd * Close the input side of the pipe.
1515 1.1 cgd */
1516 1.5 cgd close(fds[0]);
1517 1.1 cgd
1518 1.1 cgd /*
1519 1.5 cgd * Wait for the process to exit.
1520 1.1 cgd */
1521 1.5 cgd while(((pid = wait(&status)) != cpid) && (pid >= 0))
1522 1.5 cgd continue;
1523 1.5 cgd
1524 1.5 cgd res = (char *)Buf_GetAll (buf, &cc);
1525 1.5 cgd Buf_Destroy (buf, FALSE);
1526 1.1 cgd
1527 1.5 cgd if (cc == 0) {
1528 1.1 cgd /*
1529 1.1 cgd * Couldn't read the child's output -- tell the user and
1530 1.1 cgd * set the variable to null
1531 1.1 cgd */
1532 1.1 cgd Parse_Error(PARSE_WARNING, "Couldn't read shell's output");
1533 1.1 cgd }
1534 1.1 cgd
1535 1.1 cgd if (status) {
1536 1.1 cgd /*
1537 1.1 cgd * Child returned an error -- tell the user but still use
1538 1.1 cgd * the result.
1539 1.1 cgd */
1540 1.1 cgd Parse_Error(PARSE_WARNING, "\"%s\" returned non-zero", cp);
1541 1.1 cgd }
1542 1.5 cgd
1543 1.1 cgd /*
1544 1.1 cgd * Null-terminate the result, convert newlines to spaces and
1545 1.1 cgd * install it in the variable.
1546 1.1 cgd */
1547 1.5 cgd res[cc] = '\0';
1548 1.5 cgd cp = &res[cc] - 1;
1549 1.1 cgd
1550 1.1 cgd if (*cp == '\n') {
1551 1.1 cgd /*
1552 1.1 cgd * A final newline is just stripped
1553 1.1 cgd */
1554 1.1 cgd *cp-- = '\0';
1555 1.1 cgd }
1556 1.5 cgd while (cp >= res) {
1557 1.1 cgd if (*cp == '\n') {
1558 1.1 cgd *cp = ' ';
1559 1.1 cgd }
1560 1.1 cgd cp--;
1561 1.1 cgd }
1562 1.5 cgd Var_Set(line, res, ctxt);
1563 1.5 cgd free(res);
1564 1.1 cgd
1565 1.1 cgd }
1566 1.1 cgd if (freeCmd) {
1567 1.1 cgd free(args[2]);
1568 1.1 cgd }
1569 1.1 cgd } else {
1570 1.1 cgd /*
1571 1.1 cgd * Normal assignment -- just do it.
1572 1.1 cgd */
1573 1.1 cgd Var_Set (line, cp, ctxt);
1574 1.1 cgd }
1575 1.1 cgd }
1576 1.1 cgd
1577 1.1 cgd /*-
1578 1.1 cgd * ParseAddCmd --
1579 1.1 cgd * Lst_ForEach function to add a command line to all targets
1580 1.1 cgd *
1581 1.1 cgd * Results:
1582 1.1 cgd * Always 0
1583 1.1 cgd *
1584 1.1 cgd * Side Effects:
1585 1.1 cgd * A new element is added to the commands list of the node.
1586 1.1 cgd */
1587 1.5 cgd static int
1588 1.9 jtc ParseAddCmd(gnp, cmd)
1589 1.9 jtc ClientData gnp; /* the node to which the command is to be added */
1590 1.9 jtc ClientData cmd; /* the command to add */
1591 1.9 jtc {
1592 1.9 jtc GNode *gn = (GNode *) gnp;
1593 1.9 jtc /* if target already supplied, ignore commands */
1594 1.9 jtc if (!(gn->type & OP_HAS_COMMANDS))
1595 1.9 jtc (void)Lst_AtEnd(gn->commands, cmd);
1596 1.9 jtc return(0);
1597 1.1 cgd }
1598 1.1 cgd
1599 1.1 cgd /*-
1600 1.1 cgd *-----------------------------------------------------------------------
1601 1.1 cgd * ParseHasCommands --
1602 1.1 cgd * Callback procedure for Parse_File when destroying the list of
1603 1.1 cgd * targets on the last dependency line. Marks a target as already
1604 1.1 cgd * having commands if it does, to keep from having shell commands
1605 1.1 cgd * on multiple dependency lines.
1606 1.1 cgd *
1607 1.1 cgd * Results:
1608 1.9 jtc * None
1609 1.1 cgd *
1610 1.1 cgd * Side Effects:
1611 1.1 cgd * OP_HAS_COMMANDS may be set for the target.
1612 1.1 cgd *
1613 1.1 cgd *-----------------------------------------------------------------------
1614 1.1 cgd */
1615 1.9 jtc static void
1616 1.9 jtc ParseHasCommands(gnp)
1617 1.9 jtc ClientData gnp; /* Node to examine */
1618 1.1 cgd {
1619 1.9 jtc GNode *gn = (GNode *) gnp;
1620 1.1 cgd if (!Lst_IsEmpty(gn->commands)) {
1621 1.1 cgd gn->type |= OP_HAS_COMMANDS;
1622 1.1 cgd }
1623 1.1 cgd }
1624 1.1 cgd
1625 1.1 cgd /*-
1626 1.1 cgd *-----------------------------------------------------------------------
1627 1.1 cgd * Parse_AddIncludeDir --
1628 1.1 cgd * Add a directory to the path searched for included makefiles
1629 1.1 cgd * bracketed by double-quotes. Used by functions in main.c
1630 1.1 cgd *
1631 1.1 cgd * Results:
1632 1.1 cgd * None.
1633 1.1 cgd *
1634 1.1 cgd * Side Effects:
1635 1.1 cgd * The directory is appended to the list.
1636 1.1 cgd *
1637 1.1 cgd *-----------------------------------------------------------------------
1638 1.1 cgd */
1639 1.1 cgd void
1640 1.1 cgd Parse_AddIncludeDir (dir)
1641 1.1 cgd char *dir; /* The name of the directory to add */
1642 1.1 cgd {
1643 1.1 cgd Dir_AddDir (parseIncPath, dir);
1644 1.1 cgd }
1645 1.1 cgd
1646 1.1 cgd /*-
1647 1.1 cgd *---------------------------------------------------------------------
1648 1.1 cgd * ParseDoInclude --
1649 1.1 cgd * Push to another file.
1650 1.1 cgd *
1651 1.1 cgd * The input is the line minus the #include. A file spec is a string
1652 1.1 cgd * enclosed in <> or "". The former is looked for only in sysIncPath.
1653 1.1 cgd * The latter in . and the directories specified by -I command line
1654 1.1 cgd * options
1655 1.1 cgd *
1656 1.1 cgd * Results:
1657 1.1 cgd * None
1658 1.1 cgd *
1659 1.1 cgd * Side Effects:
1660 1.1 cgd * A structure is added to the includes Lst and readProc, lineno,
1661 1.1 cgd * fname and curFILE are altered for the new file
1662 1.1 cgd *---------------------------------------------------------------------
1663 1.1 cgd */
1664 1.1 cgd static void
1665 1.1 cgd ParseDoInclude (file)
1666 1.1 cgd char *file; /* file specification */
1667 1.1 cgd {
1668 1.1 cgd char *fullname; /* full pathname of file */
1669 1.1 cgd IFile *oldFile; /* state associated with current file */
1670 1.1 cgd char endc; /* the character which ends the file spec */
1671 1.1 cgd char *cp; /* current position in file spec */
1672 1.1 cgd Boolean isSystem; /* TRUE if makefile is a system makefile */
1673 1.1 cgd
1674 1.1 cgd /*
1675 1.1 cgd * Skip to delimiter character so we know where to look
1676 1.1 cgd */
1677 1.1 cgd while ((*file == ' ') || (*file == '\t')) {
1678 1.1 cgd file++;
1679 1.1 cgd }
1680 1.1 cgd
1681 1.1 cgd if ((*file != '"') && (*file != '<')) {
1682 1.1 cgd Parse_Error (PARSE_FATAL,
1683 1.1 cgd ".include filename must be delimited by '\"' or '<'");
1684 1.1 cgd return;
1685 1.1 cgd }
1686 1.1 cgd
1687 1.1 cgd /*
1688 1.1 cgd * Set the search path on which to find the include file based on the
1689 1.1 cgd * characters which bracket its name. Angle-brackets imply it's
1690 1.1 cgd * a system Makefile while double-quotes imply it's a user makefile
1691 1.1 cgd */
1692 1.1 cgd if (*file == '<') {
1693 1.1 cgd isSystem = TRUE;
1694 1.1 cgd endc = '>';
1695 1.1 cgd } else {
1696 1.1 cgd isSystem = FALSE;
1697 1.1 cgd endc = '"';
1698 1.1 cgd }
1699 1.1 cgd
1700 1.1 cgd /*
1701 1.1 cgd * Skip to matching delimiter
1702 1.1 cgd */
1703 1.1 cgd for (cp = ++file; *cp && *cp != endc; cp++) {
1704 1.1 cgd continue;
1705 1.1 cgd }
1706 1.1 cgd
1707 1.1 cgd if (*cp != endc) {
1708 1.1 cgd Parse_Error (PARSE_FATAL,
1709 1.5 cgd "Unclosed %cinclude filename. '%c' expected",
1710 1.5 cgd '.', endc);
1711 1.1 cgd return;
1712 1.1 cgd }
1713 1.1 cgd *cp = '\0';
1714 1.1 cgd
1715 1.1 cgd /*
1716 1.1 cgd * Substitute for any variables in the file name before trying to
1717 1.1 cgd * find the thing.
1718 1.1 cgd */
1719 1.5 cgd file = Var_Subst (NULL, file, VAR_CMD, FALSE);
1720 1.1 cgd
1721 1.1 cgd /*
1722 1.1 cgd * Now we know the file's name and its search path, we attempt to
1723 1.1 cgd * find the durn thing. A return of NULL indicates the file don't
1724 1.1 cgd * exist.
1725 1.1 cgd */
1726 1.1 cgd if (!isSystem) {
1727 1.1 cgd /*
1728 1.1 cgd * Include files contained in double-quotes are first searched for
1729 1.1 cgd * relative to the including file's location. We don't want to
1730 1.1 cgd * cd there, of course, so we just tack on the old file's
1731 1.1 cgd * leading path components and call Dir_FindFile to see if
1732 1.1 cgd * we can locate the beast.
1733 1.1 cgd */
1734 1.19 thorpej char *prefEnd, *Fname;
1735 1.1 cgd
1736 1.19 thorpej /* Make a temporary copy of this, to be safe. */
1737 1.19 thorpej Fname = strdup(fname);
1738 1.19 thorpej
1739 1.19 thorpej prefEnd = strrchr (Fname, '/');
1740 1.1 cgd if (prefEnd != (char *)NULL) {
1741 1.1 cgd char *newName;
1742 1.1 cgd
1743 1.1 cgd *prefEnd = '\0';
1744 1.9 jtc if (file[0] == '/')
1745 1.9 jtc newName = strdup(file);
1746 1.9 jtc else
1747 1.19 thorpej newName = str_concat (Fname, file, STR_ADDSLASH);
1748 1.1 cgd fullname = Dir_FindFile (newName, parseIncPath);
1749 1.1 cgd if (fullname == (char *)NULL) {
1750 1.1 cgd fullname = Dir_FindFile(newName, dirSearchPath);
1751 1.1 cgd }
1752 1.1 cgd free (newName);
1753 1.1 cgd *prefEnd = '/';
1754 1.1 cgd } else {
1755 1.1 cgd fullname = (char *)NULL;
1756 1.1 cgd }
1757 1.19 thorpej free (Fname);
1758 1.1 cgd } else {
1759 1.1 cgd fullname = (char *)NULL;
1760 1.1 cgd }
1761 1.1 cgd
1762 1.1 cgd if (fullname == (char *)NULL) {
1763 1.1 cgd /*
1764 1.1 cgd * System makefile or makefile wasn't found in same directory as
1765 1.1 cgd * included makefile. Search for it first on the -I search path,
1766 1.1 cgd * then on the .PATH search path, if not found in a -I directory.
1767 1.1 cgd * XXX: Suffix specific?
1768 1.1 cgd */
1769 1.1 cgd fullname = Dir_FindFile (file, parseIncPath);
1770 1.1 cgd if (fullname == (char *)NULL) {
1771 1.1 cgd fullname = Dir_FindFile(file, dirSearchPath);
1772 1.1 cgd }
1773 1.1 cgd }
1774 1.1 cgd
1775 1.1 cgd if (fullname == (char *)NULL) {
1776 1.1 cgd /*
1777 1.1 cgd * Still haven't found the makefile. Look for it on the system
1778 1.1 cgd * path as a last resort.
1779 1.1 cgd */
1780 1.1 cgd fullname = Dir_FindFile(file, sysIncPath);
1781 1.1 cgd }
1782 1.1 cgd
1783 1.1 cgd if (fullname == (char *) NULL) {
1784 1.1 cgd *cp = endc;
1785 1.1 cgd Parse_Error (PARSE_FATAL, "Could not find %s", file);
1786 1.1 cgd return;
1787 1.1 cgd }
1788 1.1 cgd
1789 1.9 jtc free(file);
1790 1.9 jtc
1791 1.1 cgd /*
1792 1.1 cgd * Once we find the absolute path to the file, we get to save all the
1793 1.1 cgd * state from the current file before we can start reading this
1794 1.1 cgd * include file. The state is stored in an IFile structure which
1795 1.1 cgd * is placed on a list with other IFile structures. The list makes
1796 1.1 cgd * a very nice stack to track how we got here...
1797 1.1 cgd */
1798 1.1 cgd oldFile = (IFile *) emalloc (sizeof (IFile));
1799 1.1 cgd oldFile->fname = fname;
1800 1.1 cgd
1801 1.1 cgd oldFile->F = curFILE;
1802 1.5 cgd oldFile->p = curPTR;
1803 1.1 cgd oldFile->lineno = lineno;
1804 1.1 cgd
1805 1.1 cgd (void) Lst_AtFront (includes, (ClientData)oldFile);
1806 1.1 cgd
1807 1.1 cgd /*
1808 1.1 cgd * Once the previous state has been saved, we can get down to reading
1809 1.1 cgd * the new file. We set up the name of the file to be the absolute
1810 1.1 cgd * name of the include file so error messages refer to the right
1811 1.1 cgd * place. Naturally enough, we start reading at line number 0.
1812 1.1 cgd */
1813 1.1 cgd fname = fullname;
1814 1.1 cgd lineno = 0;
1815 1.1 cgd
1816 1.1 cgd curFILE = fopen (fullname, "r");
1817 1.5 cgd curPTR = NULL;
1818 1.1 cgd if (curFILE == (FILE * ) NULL) {
1819 1.1 cgd Parse_Error (PARSE_FATAL, "Cannot open %s", fullname);
1820 1.1 cgd /*
1821 1.1 cgd * Pop to previous file
1822 1.1 cgd */
1823 1.1 cgd (void) ParseEOF(0);
1824 1.1 cgd }
1825 1.1 cgd }
1826 1.1 cgd
1827 1.5 cgd
1828 1.5 cgd /*-
1829 1.5 cgd *---------------------------------------------------------------------
1830 1.5 cgd * Parse_FromString --
1831 1.5 cgd * Start Parsing from the given string
1832 1.5 cgd *
1833 1.5 cgd * Results:
1834 1.5 cgd * None
1835 1.5 cgd *
1836 1.5 cgd * Side Effects:
1837 1.5 cgd * A structure is added to the includes Lst and readProc, lineno,
1838 1.5 cgd * fname and curFILE are altered for the new file
1839 1.5 cgd *---------------------------------------------------------------------
1840 1.5 cgd */
1841 1.5 cgd void
1842 1.5 cgd Parse_FromString(str)
1843 1.5 cgd char *str;
1844 1.5 cgd {
1845 1.5 cgd IFile *oldFile; /* state associated with this file */
1846 1.5 cgd
1847 1.5 cgd if (DEBUG(FOR))
1848 1.5 cgd (void) fprintf(stderr, "%s\n----\n", str);
1849 1.5 cgd
1850 1.5 cgd oldFile = (IFile *) emalloc (sizeof (IFile));
1851 1.5 cgd oldFile->lineno = lineno;
1852 1.5 cgd oldFile->fname = fname;
1853 1.5 cgd oldFile->F = curFILE;
1854 1.5 cgd oldFile->p = curPTR;
1855 1.5 cgd
1856 1.5 cgd (void) Lst_AtFront (includes, (ClientData)oldFile);
1857 1.5 cgd
1858 1.5 cgd curFILE = NULL;
1859 1.5 cgd curPTR = (PTR *) emalloc (sizeof (PTR));
1860 1.5 cgd curPTR->str = curPTR->ptr = str;
1861 1.5 cgd lineno = 0;
1862 1.5 cgd fname = strdup(fname);
1863 1.5 cgd }
1864 1.5 cgd
1865 1.5 cgd
1866 1.5 cgd #ifdef SYSVINCLUDE
1867 1.5 cgd /*-
1868 1.5 cgd *---------------------------------------------------------------------
1869 1.5 cgd * ParseTraditionalInclude --
1870 1.5 cgd * Push to another file.
1871 1.5 cgd *
1872 1.5 cgd * The input is the line minus the "include". The file name is
1873 1.5 cgd * the string following the "include".
1874 1.5 cgd *
1875 1.5 cgd * Results:
1876 1.5 cgd * None
1877 1.5 cgd *
1878 1.5 cgd * Side Effects:
1879 1.5 cgd * A structure is added to the includes Lst and readProc, lineno,
1880 1.5 cgd * fname and curFILE are altered for the new file
1881 1.5 cgd *---------------------------------------------------------------------
1882 1.5 cgd */
1883 1.5 cgd static void
1884 1.5 cgd ParseTraditionalInclude (file)
1885 1.5 cgd char *file; /* file specification */
1886 1.5 cgd {
1887 1.5 cgd char *fullname; /* full pathname of file */
1888 1.5 cgd IFile *oldFile; /* state associated with current file */
1889 1.5 cgd char *cp; /* current position in file spec */
1890 1.5 cgd char *prefEnd;
1891 1.5 cgd
1892 1.5 cgd /*
1893 1.5 cgd * Skip over whitespace
1894 1.5 cgd */
1895 1.5 cgd while ((*file == ' ') || (*file == '\t')) {
1896 1.5 cgd file++;
1897 1.5 cgd }
1898 1.5 cgd
1899 1.5 cgd if (*file == '\0') {
1900 1.5 cgd Parse_Error (PARSE_FATAL,
1901 1.5 cgd "Filename missing from \"include\"");
1902 1.5 cgd return;
1903 1.5 cgd }
1904 1.5 cgd
1905 1.5 cgd /*
1906 1.5 cgd * Skip to end of line or next whitespace
1907 1.5 cgd */
1908 1.5 cgd for (cp = file; *cp && *cp != '\n' && *cp != '\t' && *cp != ' '; cp++) {
1909 1.5 cgd continue;
1910 1.5 cgd }
1911 1.5 cgd
1912 1.5 cgd *cp = '\0';
1913 1.5 cgd
1914 1.5 cgd /*
1915 1.5 cgd * Substitute for any variables in the file name before trying to
1916 1.5 cgd * find the thing.
1917 1.5 cgd */
1918 1.5 cgd file = Var_Subst (NULL, file, VAR_CMD, FALSE);
1919 1.5 cgd
1920 1.5 cgd /*
1921 1.5 cgd * Now we know the file's name, we attempt to find the durn thing.
1922 1.5 cgd * A return of NULL indicates the file don't exist.
1923 1.5 cgd *
1924 1.5 cgd * Include files are first searched for relative to the including
1925 1.5 cgd * file's location. We don't want to cd there, of course, so we
1926 1.5 cgd * just tack on the old file's leading path components and call
1927 1.5 cgd * Dir_FindFile to see if we can locate the beast.
1928 1.5 cgd * XXX - this *does* search in the current directory, right?
1929 1.5 cgd */
1930 1.5 cgd
1931 1.5 cgd prefEnd = strrchr (fname, '/');
1932 1.5 cgd if (prefEnd != (char *)NULL) {
1933 1.5 cgd char *newName;
1934 1.5 cgd
1935 1.5 cgd *prefEnd = '\0';
1936 1.5 cgd newName = str_concat (fname, file, STR_ADDSLASH);
1937 1.5 cgd fullname = Dir_FindFile (newName, parseIncPath);
1938 1.5 cgd if (fullname == (char *)NULL) {
1939 1.5 cgd fullname = Dir_FindFile(newName, dirSearchPath);
1940 1.5 cgd }
1941 1.5 cgd free (newName);
1942 1.5 cgd *prefEnd = '/';
1943 1.5 cgd } else {
1944 1.5 cgd fullname = (char *)NULL;
1945 1.5 cgd }
1946 1.5 cgd
1947 1.5 cgd if (fullname == (char *)NULL) {
1948 1.5 cgd /*
1949 1.5 cgd * System makefile or makefile wasn't found in same directory as
1950 1.5 cgd * included makefile. Search for it first on the -I search path,
1951 1.5 cgd * then on the .PATH search path, if not found in a -I directory.
1952 1.5 cgd * XXX: Suffix specific?
1953 1.5 cgd */
1954 1.5 cgd fullname = Dir_FindFile (file, parseIncPath);
1955 1.5 cgd if (fullname == (char *)NULL) {
1956 1.5 cgd fullname = Dir_FindFile(file, dirSearchPath);
1957 1.5 cgd }
1958 1.5 cgd }
1959 1.5 cgd
1960 1.5 cgd if (fullname == (char *)NULL) {
1961 1.5 cgd /*
1962 1.5 cgd * Still haven't found the makefile. Look for it on the system
1963 1.5 cgd * path as a last resort.
1964 1.5 cgd */
1965 1.5 cgd fullname = Dir_FindFile(file, sysIncPath);
1966 1.5 cgd }
1967 1.5 cgd
1968 1.5 cgd if (fullname == (char *) NULL) {
1969 1.5 cgd Parse_Error (PARSE_FATAL, "Could not find %s", file);
1970 1.5 cgd return;
1971 1.5 cgd }
1972 1.5 cgd
1973 1.5 cgd /*
1974 1.5 cgd * Once we find the absolute path to the file, we get to save all the
1975 1.5 cgd * state from the current file before we can start reading this
1976 1.5 cgd * include file. The state is stored in an IFile structure which
1977 1.5 cgd * is placed on a list with other IFile structures. The list makes
1978 1.5 cgd * a very nice stack to track how we got here...
1979 1.5 cgd */
1980 1.5 cgd oldFile = (IFile *) emalloc (sizeof (IFile));
1981 1.5 cgd oldFile->fname = fname;
1982 1.5 cgd
1983 1.5 cgd oldFile->F = curFILE;
1984 1.5 cgd oldFile->p = curPTR;
1985 1.5 cgd oldFile->lineno = lineno;
1986 1.5 cgd
1987 1.5 cgd (void) Lst_AtFront (includes, (ClientData)oldFile);
1988 1.5 cgd
1989 1.5 cgd /*
1990 1.5 cgd * Once the previous state has been saved, we can get down to reading
1991 1.5 cgd * the new file. We set up the name of the file to be the absolute
1992 1.5 cgd * name of the include file so error messages refer to the right
1993 1.5 cgd * place. Naturally enough, we start reading at line number 0.
1994 1.5 cgd */
1995 1.5 cgd fname = fullname;
1996 1.5 cgd lineno = 0;
1997 1.5 cgd
1998 1.5 cgd curFILE = fopen (fullname, "r");
1999 1.5 cgd curPTR = NULL;
2000 1.5 cgd if (curFILE == (FILE * ) NULL) {
2001 1.5 cgd Parse_Error (PARSE_FATAL, "Cannot open %s", fullname);
2002 1.5 cgd /*
2003 1.5 cgd * Pop to previous file
2004 1.5 cgd */
2005 1.5 cgd (void) ParseEOF(1);
2006 1.5 cgd }
2007 1.5 cgd }
2008 1.5 cgd #endif
2009 1.5 cgd
2010 1.1 cgd /*-
2011 1.1 cgd *---------------------------------------------------------------------
2012 1.1 cgd * ParseEOF --
2013 1.1 cgd * Called when EOF is reached in the current file. If we were reading
2014 1.1 cgd * an include file, the includes stack is popped and things set up
2015 1.1 cgd * to go back to reading the previous file at the previous location.
2016 1.1 cgd *
2017 1.1 cgd * Results:
2018 1.1 cgd * CONTINUE if there's more to do. DONE if not.
2019 1.1 cgd *
2020 1.1 cgd * Side Effects:
2021 1.1 cgd * The old curFILE, is closed. The includes list is shortened.
2022 1.1 cgd * lineno, curFILE, and fname are changed if CONTINUE is returned.
2023 1.1 cgd *---------------------------------------------------------------------
2024 1.1 cgd */
2025 1.1 cgd static int
2026 1.1 cgd ParseEOF (opened)
2027 1.1 cgd int opened;
2028 1.1 cgd {
2029 1.1 cgd IFile *ifile; /* the state on the top of the includes stack */
2030 1.1 cgd
2031 1.1 cgd if (Lst_IsEmpty (includes)) {
2032 1.1 cgd return (DONE);
2033 1.1 cgd }
2034 1.1 cgd
2035 1.1 cgd ifile = (IFile *) Lst_DeQueue (includes);
2036 1.5 cgd free ((Address) fname);
2037 1.1 cgd fname = ifile->fname;
2038 1.1 cgd lineno = ifile->lineno;
2039 1.5 cgd if (opened && curFILE)
2040 1.1 cgd (void) fclose (curFILE);
2041 1.5 cgd if (curPTR) {
2042 1.5 cgd free((Address) curPTR->str);
2043 1.5 cgd free((Address) curPTR);
2044 1.5 cgd }
2045 1.1 cgd curFILE = ifile->F;
2046 1.5 cgd curPTR = ifile->p;
2047 1.1 cgd free ((Address)ifile);
2048 1.1 cgd return (CONTINUE);
2049 1.1 cgd }
2050 1.1 cgd
2051 1.1 cgd /*-
2052 1.1 cgd *---------------------------------------------------------------------
2053 1.1 cgd * ParseReadc --
2054 1.5 cgd * Read a character from the current file
2055 1.1 cgd *
2056 1.1 cgd * Results:
2057 1.1 cgd * The character that was read
2058 1.1 cgd *
2059 1.1 cgd * Side Effects:
2060 1.1 cgd *---------------------------------------------------------------------
2061 1.1 cgd */
2062 1.5 cgd static int
2063 1.5 cgd ParseReadc()
2064 1.5 cgd {
2065 1.5 cgd if (curFILE)
2066 1.5 cgd return fgetc(curFILE);
2067 1.5 cgd
2068 1.5 cgd if (curPTR && *curPTR->ptr)
2069 1.5 cgd return *curPTR->ptr++;
2070 1.5 cgd return EOF;
2071 1.5 cgd }
2072 1.5 cgd
2073 1.5 cgd
2074 1.5 cgd /*-
2075 1.5 cgd *---------------------------------------------------------------------
2076 1.5 cgd * ParseUnreadc --
2077 1.5 cgd * Put back a character to the current file
2078 1.5 cgd *
2079 1.5 cgd * Results:
2080 1.5 cgd * None.
2081 1.5 cgd *
2082 1.5 cgd * Side Effects:
2083 1.5 cgd *---------------------------------------------------------------------
2084 1.5 cgd */
2085 1.5 cgd static void
2086 1.5 cgd ParseUnreadc(c)
2087 1.5 cgd int c;
2088 1.5 cgd {
2089 1.5 cgd if (curFILE) {
2090 1.5 cgd ungetc(c, curFILE);
2091 1.5 cgd return;
2092 1.5 cgd }
2093 1.5 cgd if (curPTR) {
2094 1.5 cgd *--(curPTR->ptr) = c;
2095 1.5 cgd return;
2096 1.5 cgd }
2097 1.5 cgd }
2098 1.5 cgd
2099 1.5 cgd
2100 1.5 cgd /* ParseSkipLine():
2101 1.5 cgd * Grab the next line
2102 1.5 cgd */
2103 1.5 cgd static char *
2104 1.5 cgd ParseSkipLine(skip)
2105 1.5 cgd int skip; /* Skip lines that don't start with . */
2106 1.5 cgd {
2107 1.5 cgd char *line;
2108 1.5 cgd int c, lastc = '\0', lineLength;
2109 1.5 cgd Buffer buf;
2110 1.5 cgd
2111 1.5 cgd c = ParseReadc();
2112 1.1 cgd
2113 1.5 cgd if (skip) {
2114 1.5 cgd /*
2115 1.5 cgd * Skip lines until get to one that begins with a
2116 1.5 cgd * special char.
2117 1.5 cgd */
2118 1.5 cgd while ((c != '.') && (c != EOF)) {
2119 1.5 cgd while (((c != '\n') || (lastc == '\\')) && (c != EOF))
2120 1.5 cgd {
2121 1.5 cgd /*
2122 1.5 cgd * Advance to next unescaped newline
2123 1.5 cgd */
2124 1.5 cgd if ((lastc = c) == '\n') {
2125 1.5 cgd lineno++;
2126 1.5 cgd }
2127 1.5 cgd c = ParseReadc();
2128 1.5 cgd }
2129 1.5 cgd lineno++;
2130 1.5 cgd
2131 1.5 cgd lastc = c;
2132 1.5 cgd c = ParseReadc ();
2133 1.5 cgd }
2134 1.5 cgd }
2135 1.5 cgd
2136 1.5 cgd if (c == EOF) {
2137 1.5 cgd Parse_Error (PARSE_FATAL, "Unclosed conditional/for loop");
2138 1.5 cgd return ((char *)NULL);
2139 1.5 cgd }
2140 1.5 cgd
2141 1.5 cgd /*
2142 1.5 cgd * Read the entire line into buf
2143 1.5 cgd */
2144 1.5 cgd buf = Buf_Init (MAKE_BSIZE);
2145 1.5 cgd if (c != '\n') {
2146 1.5 cgd do {
2147 1.5 cgd Buf_AddByte (buf, (Byte)c);
2148 1.5 cgd c = ParseReadc();
2149 1.5 cgd } while ((c != '\n') && (c != EOF));
2150 1.5 cgd }
2151 1.5 cgd lineno++;
2152 1.5 cgd
2153 1.5 cgd Buf_AddByte (buf, (Byte)'\0');
2154 1.5 cgd line = (char *)Buf_GetAll (buf, &lineLength);
2155 1.5 cgd Buf_Destroy (buf, FALSE);
2156 1.5 cgd return line;
2157 1.5 cgd }
2158 1.1 cgd
2159 1.1 cgd
2160 1.1 cgd /*-
2161 1.1 cgd *---------------------------------------------------------------------
2162 1.1 cgd * ParseReadLine --
2163 1.1 cgd * Read an entire line from the input file. Called only by Parse_File.
2164 1.1 cgd * To facilitate escaped newlines and what have you, a character is
2165 1.1 cgd * buffered in 'lastc', which is '\0' when no characters have been
2166 1.1 cgd * read. When we break out of the loop, c holds the terminating
2167 1.1 cgd * character and lastc holds a character that should be added to
2168 1.1 cgd * the line (unless we don't read anything but a terminator).
2169 1.1 cgd *
2170 1.1 cgd * Results:
2171 1.1 cgd * A line w/o its newline
2172 1.1 cgd *
2173 1.1 cgd * Side Effects:
2174 1.1 cgd * Only those associated with reading a character
2175 1.1 cgd *---------------------------------------------------------------------
2176 1.1 cgd */
2177 1.1 cgd static char *
2178 1.1 cgd ParseReadLine ()
2179 1.1 cgd {
2180 1.1 cgd Buffer buf; /* Buffer for current line */
2181 1.1 cgd register int c; /* the current character */
2182 1.1 cgd register int lastc; /* The most-recent character */
2183 1.1 cgd Boolean semiNL; /* treat semi-colons as newlines */
2184 1.1 cgd Boolean ignDepOp; /* TRUE if should ignore dependency operators
2185 1.1 cgd * for the purposes of setting semiNL */
2186 1.1 cgd Boolean ignComment; /* TRUE if should ignore comments (in a
2187 1.1 cgd * shell command */
2188 1.9 jtc char *line; /* Result */
2189 1.12 christos char *ep; /* to strip trailing blanks */
2190 1.1 cgd int lineLength; /* Length of result */
2191 1.1 cgd
2192 1.1 cgd semiNL = FALSE;
2193 1.1 cgd ignDepOp = FALSE;
2194 1.1 cgd ignComment = FALSE;
2195 1.1 cgd
2196 1.1 cgd /*
2197 1.1 cgd * Handle special-characters at the beginning of the line. Either a
2198 1.1 cgd * leading tab (shell command) or pound-sign (possible conditional)
2199 1.1 cgd * forces us to ignore comments and dependency operators and treat
2200 1.1 cgd * semi-colons as semi-colons (by leaving semiNL FALSE). This also
2201 1.1 cgd * discards completely blank lines.
2202 1.1 cgd */
2203 1.5 cgd for (;;) {
2204 1.1 cgd c = ParseReadc();
2205 1.1 cgd
2206 1.1 cgd if (c == '\t') {
2207 1.1 cgd ignComment = ignDepOp = TRUE;
2208 1.1 cgd break;
2209 1.1 cgd } else if (c == '\n') {
2210 1.1 cgd lineno++;
2211 1.1 cgd } else if (c == '#') {
2212 1.5 cgd ParseUnreadc(c);
2213 1.5 cgd break;
2214 1.1 cgd } else {
2215 1.1 cgd /*
2216 1.1 cgd * Anything else breaks out without doing anything
2217 1.1 cgd */
2218 1.1 cgd break;
2219 1.1 cgd }
2220 1.1 cgd }
2221 1.1 cgd
2222 1.1 cgd if (c != EOF) {
2223 1.1 cgd lastc = c;
2224 1.5 cgd buf = Buf_Init(MAKE_BSIZE);
2225 1.1 cgd
2226 1.1 cgd while (((c = ParseReadc ()) != '\n' || (lastc == '\\')) &&
2227 1.1 cgd (c != EOF))
2228 1.1 cgd {
2229 1.1 cgd test_char:
2230 1.1 cgd switch(c) {
2231 1.1 cgd case '\n':
2232 1.1 cgd /*
2233 1.1 cgd * Escaped newline: read characters until a non-space or an
2234 1.1 cgd * unescaped newline and replace them all by a single space.
2235 1.1 cgd * This is done by storing the space over the backslash and
2236 1.1 cgd * dropping through with the next nonspace. If it is a
2237 1.1 cgd * semi-colon and semiNL is TRUE, it will be recognized as a
2238 1.1 cgd * newline in the code below this...
2239 1.1 cgd */
2240 1.1 cgd lineno++;
2241 1.1 cgd lastc = ' ';
2242 1.1 cgd while ((c = ParseReadc ()) == ' ' || c == '\t') {
2243 1.1 cgd continue;
2244 1.1 cgd }
2245 1.1 cgd if (c == EOF || c == '\n') {
2246 1.1 cgd goto line_read;
2247 1.1 cgd } else {
2248 1.1 cgd /*
2249 1.1 cgd * Check for comments, semiNL's, etc. -- easier than
2250 1.5 cgd * ParseUnreadc(c); continue;
2251 1.1 cgd */
2252 1.1 cgd goto test_char;
2253 1.1 cgd }
2254 1.5 cgd /*NOTREACHED*/
2255 1.1 cgd break;
2256 1.5 cgd
2257 1.1 cgd case ';':
2258 1.1 cgd /*
2259 1.1 cgd * Semi-colon: Need to see if it should be interpreted as a
2260 1.1 cgd * newline
2261 1.1 cgd */
2262 1.1 cgd if (semiNL) {
2263 1.1 cgd /*
2264 1.1 cgd * To make sure the command that may be following this
2265 1.1 cgd * semi-colon begins with a tab, we push one back into the
2266 1.1 cgd * input stream. This will overwrite the semi-colon in the
2267 1.1 cgd * buffer. If there is no command following, this does no
2268 1.1 cgd * harm, since the newline remains in the buffer and the
2269 1.1 cgd * whole line is ignored.
2270 1.1 cgd */
2271 1.5 cgd ParseUnreadc('\t');
2272 1.1 cgd goto line_read;
2273 1.1 cgd }
2274 1.1 cgd break;
2275 1.1 cgd case '=':
2276 1.1 cgd if (!semiNL) {
2277 1.1 cgd /*
2278 1.1 cgd * Haven't seen a dependency operator before this, so this
2279 1.1 cgd * must be a variable assignment -- don't pay attention to
2280 1.1 cgd * dependency operators after this.
2281 1.1 cgd */
2282 1.1 cgd ignDepOp = TRUE;
2283 1.1 cgd } else if (lastc == ':' || lastc == '!') {
2284 1.1 cgd /*
2285 1.1 cgd * Well, we've seen a dependency operator already, but it
2286 1.1 cgd * was the previous character, so this is really just an
2287 1.1 cgd * expanded variable assignment. Revert semi-colons to
2288 1.1 cgd * being just semi-colons again and ignore any more
2289 1.1 cgd * dependency operators.
2290 1.1 cgd *
2291 1.1 cgd * XXX: Note that a line like "foo : a:=b" will blow up,
2292 1.1 cgd * but who'd write a line like that anyway?
2293 1.1 cgd */
2294 1.1 cgd ignDepOp = TRUE; semiNL = FALSE;
2295 1.1 cgd }
2296 1.1 cgd break;
2297 1.1 cgd case '#':
2298 1.1 cgd if (!ignComment) {
2299 1.17 christos if (
2300 1.17 christos #if 0
2301 1.17 christos compatMake &&
2302 1.17 christos #endif
2303 1.17 christos (lastc != '\\')) {
2304 1.1 cgd /*
2305 1.1 cgd * If the character is a hash mark and it isn't escaped
2306 1.1 cgd * (or we're being compatible), the thing is a comment.
2307 1.1 cgd * Skip to the end of the line.
2308 1.1 cgd */
2309 1.1 cgd do {
2310 1.1 cgd c = ParseReadc();
2311 1.1 cgd } while ((c != '\n') && (c != EOF));
2312 1.1 cgd goto line_read;
2313 1.5 cgd } else {
2314 1.5 cgd /*
2315 1.5 cgd * Don't add the backslash. Just let the # get copied
2316 1.5 cgd * over.
2317 1.5 cgd */
2318 1.5 cgd lastc = c;
2319 1.5 cgd continue;
2320 1.5 cgd }
2321 1.1 cgd }
2322 1.1 cgd break;
2323 1.1 cgd case ':':
2324 1.1 cgd case '!':
2325 1.1 cgd if (!ignDepOp && (c == ':' || c == '!')) {
2326 1.1 cgd /*
2327 1.1 cgd * A semi-colon is recognized as a newline only on
2328 1.1 cgd * dependency lines. Dependency lines are lines with a
2329 1.1 cgd * colon or an exclamation point. Ergo...
2330 1.1 cgd */
2331 1.1 cgd semiNL = TRUE;
2332 1.1 cgd }
2333 1.1 cgd break;
2334 1.1 cgd }
2335 1.1 cgd /*
2336 1.1 cgd * Copy in the previous character and save this one in lastc.
2337 1.1 cgd */
2338 1.1 cgd Buf_AddByte (buf, (Byte)lastc);
2339 1.1 cgd lastc = c;
2340 1.1 cgd
2341 1.1 cgd }
2342 1.1 cgd line_read:
2343 1.1 cgd lineno++;
2344 1.1 cgd
2345 1.1 cgd if (lastc != '\0') {
2346 1.1 cgd Buf_AddByte (buf, (Byte)lastc);
2347 1.1 cgd }
2348 1.1 cgd Buf_AddByte (buf, (Byte)'\0');
2349 1.1 cgd line = (char *)Buf_GetAll (buf, &lineLength);
2350 1.1 cgd Buf_Destroy (buf, FALSE);
2351 1.12 christos
2352 1.12 christos /*
2353 1.12 christos * Strip trailing blanks and tabs from the line.
2354 1.12 christos * Do not strip a blank or tab that is preceeded by
2355 1.12 christos * a '\'
2356 1.12 christos */
2357 1.12 christos ep = line;
2358 1.12 christos while (*ep)
2359 1.12 christos ++ep;
2360 1.12 christos while (ep > line && (ep[-1] == ' ' || ep[-1] == '\t')) {
2361 1.12 christos if (ep > line + 1 && ep[-2] == '\\')
2362 1.12 christos break;
2363 1.12 christos --ep;
2364 1.12 christos }
2365 1.12 christos *ep = 0;
2366 1.1 cgd
2367 1.1 cgd if (line[0] == '.') {
2368 1.1 cgd /*
2369 1.1 cgd * The line might be a conditional. Ask the conditional module
2370 1.1 cgd * about it and act accordingly
2371 1.1 cgd */
2372 1.1 cgd switch (Cond_Eval (line)) {
2373 1.1 cgd case COND_SKIP:
2374 1.5 cgd /*
2375 1.5 cgd * Skip to next conditional that evaluates to COND_PARSE.
2376 1.5 cgd */
2377 1.1 cgd do {
2378 1.1 cgd free (line);
2379 1.5 cgd line = ParseSkipLine(1);
2380 1.5 cgd } while (line && Cond_Eval(line) != COND_PARSE);
2381 1.5 cgd if (line == NULL)
2382 1.5 cgd break;
2383 1.1 cgd /*FALLTHRU*/
2384 1.1 cgd case COND_PARSE:
2385 1.5 cgd free ((Address) line);
2386 1.1 cgd line = ParseReadLine();
2387 1.1 cgd break;
2388 1.5 cgd case COND_INVALID:
2389 1.5 cgd if (For_Eval(line)) {
2390 1.5 cgd int ok;
2391 1.5 cgd free(line);
2392 1.5 cgd do {
2393 1.5 cgd /*
2394 1.5 cgd * Skip after the matching end
2395 1.5 cgd */
2396 1.5 cgd line = ParseSkipLine(0);
2397 1.5 cgd if (line == NULL) {
2398 1.5 cgd Parse_Error (PARSE_FATAL,
2399 1.5 cgd "Unexpected end of file in for loop.\n");
2400 1.5 cgd break;
2401 1.5 cgd }
2402 1.5 cgd ok = For_Eval(line);
2403 1.5 cgd free(line);
2404 1.5 cgd }
2405 1.5 cgd while (ok);
2406 1.5 cgd if (line != NULL)
2407 1.5 cgd For_Run();
2408 1.5 cgd line = ParseReadLine();
2409 1.5 cgd }
2410 1.5 cgd break;
2411 1.1 cgd }
2412 1.1 cgd }
2413 1.1 cgd return (line);
2414 1.5 cgd
2415 1.1 cgd } else {
2416 1.1 cgd /*
2417 1.1 cgd * Hit end-of-file, so return a NULL line to indicate this.
2418 1.1 cgd */
2419 1.1 cgd return((char *)NULL);
2420 1.1 cgd }
2421 1.1 cgd }
2422 1.1 cgd
2423 1.1 cgd /*-
2424 1.1 cgd *-----------------------------------------------------------------------
2425 1.1 cgd * ParseFinishLine --
2426 1.1 cgd * Handle the end of a dependency group.
2427 1.1 cgd *
2428 1.1 cgd * Results:
2429 1.1 cgd * Nothing.
2430 1.1 cgd *
2431 1.1 cgd * Side Effects:
2432 1.1 cgd * inLine set FALSE. 'targets' list destroyed.
2433 1.1 cgd *
2434 1.1 cgd *-----------------------------------------------------------------------
2435 1.1 cgd */
2436 1.1 cgd static void
2437 1.1 cgd ParseFinishLine()
2438 1.1 cgd {
2439 1.1 cgd if (inLine) {
2440 1.1 cgd Lst_ForEach(targets, Suff_EndTransform, (ClientData)NULL);
2441 1.1 cgd Lst_Destroy (targets, ParseHasCommands);
2442 1.9 jtc targets = NULL;
2443 1.1 cgd inLine = FALSE;
2444 1.1 cgd }
2445 1.1 cgd }
2446 1.1 cgd
2447 1.1 cgd
2448 1.1 cgd /*-
2449 1.1 cgd *---------------------------------------------------------------------
2450 1.1 cgd * Parse_File --
2451 1.1 cgd * Parse a file into its component parts, incorporating it into the
2452 1.1 cgd * current dependency graph. This is the main function and controls
2453 1.1 cgd * almost every other function in this module
2454 1.1 cgd *
2455 1.1 cgd * Results:
2456 1.1 cgd * None
2457 1.1 cgd *
2458 1.1 cgd * Side Effects:
2459 1.1 cgd * Loads. Nodes are added to the list of all targets, nodes and links
2460 1.1 cgd * are added to the dependency graph. etc. etc. etc.
2461 1.1 cgd *---------------------------------------------------------------------
2462 1.1 cgd */
2463 1.1 cgd void
2464 1.1 cgd Parse_File(name, stream)
2465 1.1 cgd char *name; /* the name of the file being read */
2466 1.1 cgd FILE * stream; /* Stream open to makefile to parse */
2467 1.1 cgd {
2468 1.1 cgd register char *cp, /* pointer into the line */
2469 1.1 cgd *line; /* the line we're working on */
2470 1.1 cgd
2471 1.1 cgd inLine = FALSE;
2472 1.1 cgd fname = name;
2473 1.1 cgd curFILE = stream;
2474 1.1 cgd lineno = 0;
2475 1.1 cgd fatals = 0;
2476 1.1 cgd
2477 1.1 cgd do {
2478 1.5 cgd while ((line = ParseReadLine ()) != NULL) {
2479 1.1 cgd if (*line == '.') {
2480 1.1 cgd /*
2481 1.1 cgd * Lines that begin with the special character are either
2482 1.1 cgd * include or undef directives.
2483 1.1 cgd */
2484 1.1 cgd for (cp = line + 1; isspace (*cp); cp++) {
2485 1.1 cgd continue;
2486 1.1 cgd }
2487 1.1 cgd if (strncmp (cp, "include", 7) == 0) {
2488 1.1 cgd ParseDoInclude (cp + 7);
2489 1.1 cgd goto nextLine;
2490 1.1 cgd } else if (strncmp(cp, "undef", 5) == 0) {
2491 1.1 cgd char *cp2;
2492 1.9 jtc for (cp += 5; isspace((unsigned char) *cp); cp++) {
2493 1.1 cgd continue;
2494 1.1 cgd }
2495 1.1 cgd
2496 1.9 jtc for (cp2 = cp; !isspace((unsigned char) *cp2) &&
2497 1.9 jtc (*cp2 != '\0'); cp2++) {
2498 1.1 cgd continue;
2499 1.1 cgd }
2500 1.1 cgd
2501 1.1 cgd *cp2 = '\0';
2502 1.1 cgd
2503 1.1 cgd Var_Delete(cp, VAR_GLOBAL);
2504 1.1 cgd goto nextLine;
2505 1.1 cgd }
2506 1.1 cgd }
2507 1.13 christos if (*line == '#' || *line == '\0') {
2508 1.13 christos /* If we're this far, the line must be a comment.
2509 1.13 christos (Empty lines are ignored as well) */
2510 1.1 cgd goto nextLine;
2511 1.1 cgd }
2512 1.1 cgd
2513 1.6 jtc if (*line == '\t') {
2514 1.1 cgd /*
2515 1.6 jtc * If a line starts with a tab, it can only hope to be
2516 1.6 jtc * a creation command.
2517 1.1 cgd */
2518 1.7 cgd #ifndef POSIX
2519 1.1 cgd shellCommand:
2520 1.7 cgd #endif
2521 1.1 cgd for (cp = line + 1; isspace (*cp); cp++) {
2522 1.1 cgd continue;
2523 1.1 cgd }
2524 1.1 cgd if (*cp) {
2525 1.1 cgd if (inLine) {
2526 1.1 cgd /*
2527 1.1 cgd * So long as it's not a blank line and we're actually
2528 1.1 cgd * in a dependency spec, add the command to the list of
2529 1.1 cgd * commands of all targets in the dependency spec
2530 1.1 cgd */
2531 1.9 jtc Lst_ForEach (targets, ParseAddCmd, cp);
2532 1.9 jtc Lst_AtEnd(targCmds, (ClientData) line);
2533 1.1 cgd continue;
2534 1.1 cgd } else {
2535 1.1 cgd Parse_Error (PARSE_FATAL,
2536 1.1 cgd "Unassociated shell command \"%.20s\"",
2537 1.1 cgd cp);
2538 1.1 cgd }
2539 1.1 cgd }
2540 1.5 cgd #ifdef SYSVINCLUDE
2541 1.20 christos } else if (strncmp (line, "include", 7) == 0 &&
2542 1.20 christos isspace((unsigned char) line[7]) &&
2543 1.5 cgd strchr(line, ':') == NULL) {
2544 1.5 cgd /*
2545 1.5 cgd * It's an S3/S5-style "include".
2546 1.5 cgd */
2547 1.5 cgd ParseTraditionalInclude (line + 7);
2548 1.5 cgd goto nextLine;
2549 1.5 cgd #endif
2550 1.1 cgd } else if (Parse_IsVar (line)) {
2551 1.1 cgd ParseFinishLine();
2552 1.1 cgd Parse_DoVar (line, VAR_GLOBAL);
2553 1.1 cgd } else {
2554 1.1 cgd /*
2555 1.1 cgd * We now know it's a dependency line so it needs to have all
2556 1.1 cgd * variables expanded before being parsed. Tell the variable
2557 1.1 cgd * module to complain if some variable is undefined...
2558 1.1 cgd * To make life easier on novices, if the line is indented we
2559 1.1 cgd * first make sure the line has a dependency operator in it.
2560 1.1 cgd * If it doesn't have an operator and we're in a dependency
2561 1.1 cgd * line's script, we assume it's actually a shell command
2562 1.1 cgd * and add it to the current list of targets.
2563 1.1 cgd */
2564 1.7 cgd #ifndef POSIX
2565 1.1 cgd Boolean nonSpace = FALSE;
2566 1.7 cgd #endif
2567 1.1 cgd
2568 1.1 cgd cp = line;
2569 1.11 mycroft if (isspace((unsigned char) line[0])) {
2570 1.11 mycroft while ((*cp != '\0') && isspace((unsigned char) *cp)) {
2571 1.11 mycroft cp++;
2572 1.11 mycroft }
2573 1.11 mycroft if (*cp == '\0') {
2574 1.11 mycroft goto nextLine;
2575 1.11 mycroft }
2576 1.1 cgd #ifndef POSIX
2577 1.1 cgd while ((*cp != ':') && (*cp != '!') && (*cp != '\0')) {
2578 1.11 mycroft nonSpace = TRUE;
2579 1.1 cgd cp++;
2580 1.1 cgd }
2581 1.11 mycroft #endif
2582 1.1 cgd }
2583 1.1 cgd
2584 1.11 mycroft #ifndef POSIX
2585 1.1 cgd if (*cp == '\0') {
2586 1.1 cgd if (inLine) {
2587 1.1 cgd Parse_Error (PARSE_WARNING,
2588 1.1 cgd "Shell command needs a leading tab");
2589 1.1 cgd goto shellCommand;
2590 1.1 cgd } else if (nonSpace) {
2591 1.1 cgd Parse_Error (PARSE_FATAL, "Missing operator");
2592 1.1 cgd }
2593 1.1 cgd } else {
2594 1.1 cgd #endif
2595 1.1 cgd ParseFinishLine();
2596 1.1 cgd
2597 1.5 cgd cp = Var_Subst (NULL, line, VAR_CMD, TRUE);
2598 1.1 cgd free (line);
2599 1.1 cgd line = cp;
2600 1.1 cgd
2601 1.1 cgd /*
2602 1.1 cgd * Need a non-circular list for the target nodes
2603 1.1 cgd */
2604 1.9 jtc if (targets)
2605 1.9 jtc Lst_Destroy(targets, NOFREE);
2606 1.9 jtc
2607 1.1 cgd targets = Lst_Init (FALSE);
2608 1.1 cgd inLine = TRUE;
2609 1.1 cgd
2610 1.1 cgd ParseDoDependency (line);
2611 1.1 cgd #ifndef POSIX
2612 1.1 cgd }
2613 1.1 cgd #endif
2614 1.1 cgd }
2615 1.1 cgd
2616 1.1 cgd nextLine:
2617 1.1 cgd
2618 1.1 cgd free (line);
2619 1.1 cgd }
2620 1.1 cgd /*
2621 1.1 cgd * Reached EOF, but it may be just EOF of an include file...
2622 1.1 cgd */
2623 1.1 cgd } while (ParseEOF(1) == CONTINUE);
2624 1.1 cgd
2625 1.1 cgd /*
2626 1.1 cgd * Make sure conditionals are clean
2627 1.1 cgd */
2628 1.1 cgd Cond_End();
2629 1.1 cgd
2630 1.1 cgd if (fatals) {
2631 1.1 cgd fprintf (stderr, "Fatal errors encountered -- cannot continue\n");
2632 1.1 cgd exit (1);
2633 1.1 cgd }
2634 1.1 cgd }
2635 1.1 cgd
2636 1.1 cgd /*-
2637 1.1 cgd *---------------------------------------------------------------------
2638 1.1 cgd * Parse_Init --
2639 1.1 cgd * initialize the parsing module
2640 1.1 cgd *
2641 1.1 cgd * Results:
2642 1.1 cgd * none
2643 1.1 cgd *
2644 1.1 cgd * Side Effects:
2645 1.1 cgd * the parseIncPath list is initialized...
2646 1.1 cgd *---------------------------------------------------------------------
2647 1.1 cgd */
2648 1.5 cgd void
2649 1.1 cgd Parse_Init ()
2650 1.1 cgd {
2651 1.1 cgd mainNode = NILGNODE;
2652 1.1 cgd parseIncPath = Lst_Init (FALSE);
2653 1.1 cgd sysIncPath = Lst_Init (FALSE);
2654 1.1 cgd includes = Lst_Init (FALSE);
2655 1.9 jtc targCmds = Lst_Init (FALSE);
2656 1.1 cgd }
2657 1.9 jtc
2658 1.9 jtc void
2659 1.9 jtc Parse_End()
2660 1.9 jtc {
2661 1.9 jtc Lst_Destroy(targCmds, (void (*) __P((ClientData))) free);
2662 1.9 jtc if (targets)
2663 1.9 jtc Lst_Destroy(targets, NOFREE);
2664 1.9 jtc Lst_Destroy(sysIncPath, Dir_Destroy);
2665 1.9 jtc Lst_Destroy(parseIncPath, Dir_Destroy);
2666 1.9 jtc Lst_Destroy(includes, NOFREE); /* Should be empty now */
2667 1.9 jtc }
2668 1.9 jtc
2669 1.1 cgd
2670 1.1 cgd /*-
2671 1.1 cgd *-----------------------------------------------------------------------
2672 1.1 cgd * Parse_MainName --
2673 1.1 cgd * Return a Lst of the main target to create for main()'s sake. If
2674 1.1 cgd * no such target exists, we Punt with an obnoxious error message.
2675 1.1 cgd *
2676 1.1 cgd * Results:
2677 1.1 cgd * A Lst of the single node to create.
2678 1.1 cgd *
2679 1.1 cgd * Side Effects:
2680 1.1 cgd * None.
2681 1.1 cgd *
2682 1.1 cgd *-----------------------------------------------------------------------
2683 1.1 cgd */
2684 1.1 cgd Lst
2685 1.1 cgd Parse_MainName()
2686 1.1 cgd {
2687 1.1 cgd Lst main; /* result list */
2688 1.1 cgd
2689 1.1 cgd main = Lst_Init (FALSE);
2690 1.1 cgd
2691 1.1 cgd if (mainNode == NILGNODE) {
2692 1.1 cgd Punt ("make: no target to make.\n");
2693 1.1 cgd /*NOTREACHED*/
2694 1.1 cgd } else if (mainNode->type & OP_DOUBLEDEP) {
2695 1.5 cgd (void) Lst_AtEnd (main, (ClientData)mainNode);
2696 1.1 cgd Lst_Concat(main, mainNode->cohorts, LST_CONCNEW);
2697 1.1 cgd }
2698 1.5 cgd else
2699 1.5 cgd (void) Lst_AtEnd (main, (ClientData)mainNode);
2700 1.1 cgd return (main);
2701 1.1 cgd }
2702