Annotation of src/usr.bin/make/parse.c, Revision 1.130
1.130 ! espie 1: /* $OpenBSD: parse.c,v 1.129 2020/01/13 14:07:35 espie Exp $ */
1.13 millert 2: /* $NetBSD: parse.c,v 1.29 1997/03/10 21:20:04 christos Exp $ */
1.1 deraadt 3:
4: /*
1.59 espie 5: * Copyright (c) 1999 Marc Espie.
6: *
7: * Extensive code changes for the OpenBSD project.
8: *
9: * Redistribution and use in source and binary forms, with or without
10: * modification, are permitted provided that the following conditions
11: * are met:
12: * 1. Redistributions of source code must retain the above copyright
13: * notice, this list of conditions and the following disclaimer.
14: * 2. Redistributions in binary form must reproduce the above copyright
15: * notice, this list of conditions and the following disclaimer in the
16: * documentation and/or other materials provided with the distribution.
17: *
18: * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
19: * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21: * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
22: * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23: * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24: * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29: */
30: /*
1.11 millert 31: * Copyright (c) 1988, 1989, 1990, 1993
32: * The Regents of the University of California. All rights reserved.
1.1 deraadt 33: * Copyright (c) 1989 by Berkeley Softworks
34: * All rights reserved.
35: *
36: * This code is derived from software contributed to Berkeley by
37: * Adam de Boor.
38: *
39: * Redistribution and use in source and binary forms, with or without
40: * modification, are permitted provided that the following conditions
41: * are met:
42: * 1. Redistributions of source code must retain the above copyright
43: * notice, this list of conditions and the following disclaimer.
44: * 2. Redistributions in binary form must reproduce the above copyright
45: * notice, this list of conditions and the following disclaimer in the
46: * documentation and/or other materials provided with the distribution.
1.68 millert 47: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 48: * may be used to endorse or promote products derived from this software
49: * without specific prior written permission.
50: *
51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61: * SUCH DAMAGE.
62: */
63:
1.59 espie 64: #include <assert.h>
1.61 espie 65: #include <ctype.h>
1.113 espie 66: #include <stddef.h>
1.1 deraadt 67: #include <stdio.h>
1.62 espie 68: #include <stdlib.h>
1.61 espie 69: #include <string.h>
1.113 espie 70: #include <ohash.h>
1.61 espie 71: #include "config.h"
72: #include "defines.h"
1.1 deraadt 73: #include "dir.h"
1.81 espie 74: #include "direxpand.h"
1.1 deraadt 75: #include "job.h"
76: #include "buf.h"
1.61 espie 77: #include "for.h"
1.50 espie 78: #include "lowparse.h"
1.61 espie 79: #include "arch.h"
80: #include "cond.h"
81: #include "suff.h"
82: #include "parse.h"
83: #include "var.h"
84: #include "targ.h"
85: #include "error.h"
86: #include "str.h"
87: #include "main.h"
88: #include "gnode.h"
89: #include "memory.h"
90: #include "extern.h"
91: #include "lst.h"
92: #include "parsevar.h"
1.63 espie 93: #include "stats.h"
94: #include "garray.h"
1.92 espie 95: #include "node_int.h"
96: #include "nodehashconsts.h"
1.63 espie 97:
98:
1.92 espie 99: /* gsources and gtargets should be local to some functions, but they're
100: * set as persistent arrays for performance reasons.
101: */
1.63 espie 102: static struct growableArray gsources, gtargets;
1.114 espie 103: static struct ohash htargets;
104: static bool htargets_setup = false;
1.63 espie 105: #define SOURCES_SIZE 128
106: #define TARGETS_SIZE 32
1.61 espie 107:
1.89 espie 108: static LIST theUserIncPath;/* list of directories for "..." includes */
1.61 espie 109: static LIST theSysIncPath; /* list of directories for <...> includes */
1.89 espie 110: Lst systemIncludePath = &theSysIncPath;
111: Lst userIncludePath = &theUserIncPath;
1.59 espie 112:
1.1 deraadt 113: static GNode *mainNode; /* The main target to create. This is the
114: * first target on the first dependency
115: * line in the first makefile */
116: /*-
1.92 espie 117: * specType contains the special TYPE of the current target. It is
118: * SPECIAL_NONE if the target is unspecial. If it *is* special, however,
119: * the children are linked as children of the parent but not vice versa.
120: * This variable is set in ParseDoDependency
1.1 deraadt 121: */
122:
1.97 espie 123: static unsigned int specType;
1.3 deraadt 124: static int waiting;
1.1 deraadt 125:
126: /*
1.33 espie 127: * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
1.1 deraadt 128: * seen, then set to each successive source on the line.
129: */
130: static GNode *predecessor;
131:
1.59 espie 132: static void ParseLinkSrc(GNode *, GNode *);
1.97 espie 133: static int ParseDoOp(GNode **, unsigned int);
1.123 espie 134: static void ParseDoSpecial(GNode *, unsigned int);
1.63 espie 135: static int ParseAddDep(GNode *, GNode *);
1.92 espie 136: static void ParseDoSrc(struct growableArray *, struct growableArray *, int,
137: const char *, const char *);
1.59 espie 138: static int ParseFindMain(void *, void *);
139: static void ParseClearPath(void *);
1.77 espie 140:
1.92 espie 141: static void add_target_node(const char *, const char *);
142: static void add_target_nodes(const char *, const char *);
1.97 espie 143: static void apply_op(struct growableArray *, unsigned int, GNode *);
1.92 espie 144: static void ParseDoDependency(const char *);
1.59 espie 145: static void ParseAddCmd(void *, void *);
146: static void ParseHasCommands(void *);
1.79 espie 147: static bool handle_poison(const char *);
148: static bool handle_for_loop(Buffer, const char *);
149: static bool handle_undef(const char *);
1.61 espie 150: #define ParseReadLoopLine(linebuf) Parse_ReadUnparsedLine(linebuf, "for loop")
1.79 espie 151: static bool handle_bsd_command(Buffer, Buffer, const char *);
1.117 espie 152: static bool register_target(GNode *, struct ohash *);
1.59 espie 153: static char *strip_comments(Buffer, const char *);
1.116 espie 154: static char *resolve_include_filename(const char *, const char *, bool);
1.79 espie 155: static void handle_include_file(const char *, const char *, bool, bool);
156: static bool lookup_bsd_include(const char *);
157: static void lookup_sysv_style_include(const char *, const char *, bool);
158: static void lookup_sysv_include(const char *, const char *);
159: static void lookup_conditional_include(const char *, const char *);
1.91 espie 160: static bool parse_as_special_line(Buffer, Buffer, const char *);
1.97 espie 161: static unsigned int parse_operator(const char **);
1.92 espie 162:
1.97 espie 163: static const char *parse_do_targets(Lst, unsigned int *, const char *);
1.91 espie 164: static void parse_target_line(struct growableArray *, const char *,
1.107 espie 165: const char *, bool *);
1.1 deraadt 166:
1.92 espie 167: static void finish_commands(struct growableArray *);
168: static void parse_commands(struct growableArray *, const char *);
169: static void create_special_nodes(void);
170: static bool found_delimiter(const char *);
1.97 espie 171: static unsigned int handle_special_targets(Lst);
1.93 espie 172: static void dump_targets(void);
1.114 espie 173: static void dedup_targets(struct growableArray *);
174: static void build_target_group(struct growableArray *, struct ohash *t);
175: static void reset_target_hash(void);
1.92 espie 176:
177:
178: #define P(k) k, sizeof(k), K_##k
179:
180: static struct {
181: const char *keyword;
182: size_t sz;
183: uint32_t hv;
1.124 espie 184: unsigned int special;
1.97 espie 185: unsigned int special_op;
1.92 espie 186: } specials[] = {
1.129 espie 187: { P(NODE_EXEC), SPECIAL_EXEC, OP_EXEC },
188: { P(NODE_IGNORE), SPECIAL_IGNORE, OP_IGNORE },
189: { P(NODE_INCLUDES), SPECIAL_NOTHING, 0 },
190: { P(NODE_INVISIBLE), SPECIAL_INVISIBLE, OP_INVISIBLE },
191: { P(NODE_JOIN), SPECIAL_JOIN, OP_JOIN },
192: { P(NODE_LIBS), SPECIAL_NOTHING, 0 },
193: { P(NODE_MADE), SPECIAL_MADE, OP_MADE },
194: { P(NODE_MAIN), SPECIAL_MAIN, 0 },
195: { P(NODE_MAKE), SPECIAL_MAKE, OP_MAKE },
196: { P(NODE_MAKEFLAGS), SPECIAL_MFLAGS, 0 },
197: { P(NODE_MFLAGS), SPECIAL_MFLAGS, 0 },
198: { P(NODE_NOTMAIN), SPECIAL_NOTMAIN, OP_NOTMAIN },
199: { P(NODE_NOTPARALLEL), SPECIAL_NOTPARALLEL, 0 },
200: { P(NODE_NO_PARALLEL), SPECIAL_NOTPARALLEL, 0 },
201: { P(NODE_NULL), SPECIAL_NOTHING, 0 },
202: { P(NODE_OPTIONAL), SPECIAL_OPTIONAL, OP_OPTIONAL },
203: { P(NODE_ORDER), SPECIAL_ORDER, 0 },
204: { P(NODE_PARALLEL), SPECIAL_PARALLEL, 0 },
205: { P(NODE_PATH), SPECIAL_PATH, 0 },
206: { P(NODE_PHONY), SPECIAL_PHONY, OP_PHONY },
207: { P(NODE_PRECIOUS), SPECIAL_PRECIOUS, OP_PRECIOUS },
208: { P(NODE_RECURSIVE), SPECIAL_MAKE, OP_MAKE },
209: { P(NODE_SILENT), SPECIAL_SILENT, OP_SILENT },
210: { P(NODE_SINGLESHELL), SPECIAL_NOTHING, 0 },
211: { P(NODE_SUFFIXES), SPECIAL_SUFFIXES, 0 },
212: { P(NODE_USE), SPECIAL_USE, OP_USE },
213: { P(NODE_WAIT), SPECIAL_WAIT, 0 },
214: { P(NODE_CHEAP), SPECIAL_CHEAP, OP_CHEAP },
215: { P(NODE_EXPENSIVE), SPECIAL_EXPENSIVE, OP_EXPENSIVE },
216: { P(NODE_POSIX), SPECIAL_NOTHING, 0 },
217: { P(NODE_SCCS_GET), SPECIAL_NOTHING, 0 },
1.92 espie 218: };
219:
220: #undef P
221:
222: static void
223: create_special_nodes()
1.1 deraadt 224: {
1.92 espie 225: unsigned int i;
226:
227: for (i = 0; i < sizeof(specials)/sizeof(specials[0]); i++) {
1.125 espie 228: (void)Targ_mk_special_node(specials[i].keyword,
229: specials[i].sz, specials[i].hv,
230: OP_ZERO, specials[i].special, specials[i].special_op);
1.1 deraadt 231: }
232: }
1.92 espie 233:
1.1 deraadt 234: /*-
235: *---------------------------------------------------------------------
236: * ParseLinkSrc --
1.59 espie 237: * Link the parent node to its new child. Used by
1.1 deraadt 238: * ParseDoDependency. If the specType isn't 'Not', the parent
239: * isn't linked as a parent of the child.
240: *
241: * Side Effects:
242: * New elements are added to the parents list of cgn and the
1.122 espie 243: * children list of cgn. the children_left field of pgn is updated
1.1 deraadt 244: * to reflect the additional child.
245: *---------------------------------------------------------------------
246: */
1.41 espie 247: static void
1.94 espie 248: ParseLinkSrc(GNode *pgn, GNode *cgn)
249: {
250: if (Lst_AddNew(&pgn->children, cgn)) {
251: if (specType == SPECIAL_NONE)
252: Lst_AtEnd(&cgn->parents, pgn);
1.122 espie 253: pgn->children_left++;
1.94 espie 254: }
1.1 deraadt 255: }
256:
1.103 espie 257: static char *
258: operator_string(int op)
259: {
260: /* XXX we don't bother freeing this, it's used for a fatal error
261: * anyways
262: */
263: char *result = emalloc(5);
264: char *t = result;
265: if (op & OP_DEPENDS) {
266: *t++ = ':';
267: }
268: if (op & OP_FORCE) {
269: *t++ = '!';
270: }
271: if (op & OP_DOUBLEDEP) {
272: *t++ = ':';
273: *t++ = ':';
274: }
275: *t = 0;
276: return result;
277: }
278:
1.1 deraadt 279: /*-
280: *---------------------------------------------------------------------
281: * ParseDoOp --
282: * Apply the parsed operator to the given target node. Used in a
1.92 espie 283: * Array_Find call by ParseDoDependency once all targets have
1.1 deraadt 284: * been found and their operator parsed. If the previous and new
1.123 espie 285: * operators are incompatible, a major error is taken, and the find
286: * stops early
1.1 deraadt 287: *
288: * Side Effects:
1.123 espie 289: * The node gets the right dependency operator.
290: * Cohorts may be created for double dep.
1.1 deraadt 291: *---------------------------------------------------------------------
292: */
293: static int
1.97 espie 294: ParseDoOp(GNode **gnp, unsigned int op)
1.94 espie 295: {
296: GNode *gn = *gnp;
297:
1.123 espie 298: assert(op == (op & OP_OPMASK));
299:
300: /* if the node didn't already appear on the left hand side (no known
301: * dependency operator), we don't need to do much. */
302: if (!OP_NOP(gn->type)) {
303: /*
304: * If the dependency mask of the operator and the node don't
305: * match and the node has actually had an operator applied to
306: * it before, and the operator actually has some dependency
307: * information in it, complain. */
308: if (op != (gn->type & OP_OPMASK)) {
309: Parse_Error(PARSE_FATAL,
310: "Inconsistent dependency operator for target %s\n"
311: "\t(was %s%s, now %s%s)",
312: gn->name, gn->name, operator_string(gn->type),
313: gn->name, operator_string(op));
314: return 0;
315: }
316:
317: if (op == OP_DOUBLEDEP) {
318: /* If the node was the object of a :: operator, we need
319: * to create a new instance of it for the children and
320: * commands on this dependency line. The new instance
321: * is placed on the 'cohorts' list of the initial one
322: * (note the initial one is not on its own cohorts
323: * list) and the new instance is linked to all parents
324: * of the initial instance. */
325: GNode *cohort;
326: LstNode ln;
327:
328: cohort = Targ_NewGN(gn->name);
329: /* Duplicate links to parents so graph traversal is
330: * simple. Perhaps some type bits should be
331: * duplicated?
332: *
333: * Make the cohort invisible as well to avoid
334: * duplicating it into other variables. True, parents
335: * of this target won't tend to do anything with their
336: * local variables, but better safe than sorry. */
337: for (ln = Lst_First(&gn->parents); ln != NULL;
338: ln = Lst_Adv(ln))
339: ParseLinkSrc(Lst_Datum(ln), cohort);
340: cohort->type = OP_DOUBLEDEP|OP_INVISIBLE;
341: Lst_AtEnd(&gn->cohorts, cohort);
342:
343: /* Replace the node in the targets list with the new
344: * copy */
345: *gnp = cohort;
346: gn = cohort;
347: }
1.94 espie 348: }
1.123 espie 349: /* Preserve possible special flags already applied to the operator */
1.94 espie 350: gn->type |= op;
351: return 1;
1.1 deraadt 352: }
353:
1.123 espie 354: static void
355: ParseDoSpecial(GNode *gn, unsigned int special_op)
356: {
357: gn->type |= special_op;
358: }
359:
1.11 millert 360: /*-
1.3 deraadt 361: *---------------------------------------------------------------------
1.59 espie 362: * ParseAddDep --
1.3 deraadt 363: * Check if the pair of GNodes given needs to be synchronized.
364: * This has to be when two nodes are on different sides of a
365: * .WAIT directive.
366: *
367: * Results:
1.40 espie 368: * Returns 0 if the two targets need to be ordered, 1 otherwise.
1.59 espie 369: * If it returns 0, the search can stop.
1.3 deraadt 370: *
371: * Side Effects:
372: * A dependency can be added between the two nodes.
1.11 millert 373: *
1.3 deraadt 374: *---------------------------------------------------------------------
375: */
1.13 millert 376: static int
1.69 espie 377: ParseAddDep(GNode *p, GNode *s)
1.3 deraadt 378: {
1.94 espie 379: if (p->order < s->order) {
1.122 espie 380: /* XXX: This can cause cycles but finding them is hard
381: * and debugging output will show the problem. */
382: Lst_AtEnd(&s->predecessors, p);
1.94 espie 383: Lst_AtEnd(&p->successors, s);
384: return 1;
385: } else
386: return 0;
1.92 espie 387: }
388:
389: static void
1.97 espie 390: apply_op(struct growableArray *targets, unsigned int op, GNode *gn)
1.92 espie 391: {
392: if (op)
393: gn->type |= op;
1.86 espie 394: else
1.92 espie 395: Array_ForEach(targets, ParseLinkSrc, gn);
1.3 deraadt 396: }
397:
1.1 deraadt 398: /*-
399: *---------------------------------------------------------------------
400: * ParseDoSrc --
401: * Given the name of a source, figure out if it is an attribute
402: * and apply it to the targets if it is. Else decide if there is
403: * some attribute which should be applied *to* the source because
404: * of some special target and apply it if so. Otherwise, make the
405: * source be a child of the targets in the list 'targets'
406: *
407: * Side Effects:
408: * Operator bits may be added to the list of targets or to the source.
409: * The targets may have a new source added to their lists of children.
410: *---------------------------------------------------------------------
411: */
412: static void
1.69 espie 413: ParseDoSrc(
1.92 espie 414: struct growableArray *targets,
415: struct growableArray *sources,
1.69 espie 416: int tOp, /* operator (if any) from special targets */
1.92 espie 417: const char *src, /* name of the source to handle */
418: const char *esrc)
1.1 deraadt 419: {
1.92 espie 420: GNode *gn = Targ_FindNodei(src, esrc, TARG_CREATE);
1.129 espie 421: if (gn->special_op) {
422: Array_ForEach(targets, ParseDoSpecial, gn->special_op);
423: return;
424: }
425: if (gn->special == SPECIAL_WAIT) {
426: waiting++;
427: return;
1.1 deraadt 428: }
1.3 deraadt 429:
1.86 espie 430: switch (specType) {
1.92 espie 431: case SPECIAL_MAIN:
1.86 espie 432: /*
433: * If we have noted the existence of a .MAIN, it means we need
434: * to add the sources of said target to the list of things
1.92 espie 435: * to create. Note that this will only be invoked if the user
436: * didn't specify a target on the command line. This is to
437: * allow #ifmake's to succeed, or something...
1.86 espie 438: */
1.92 espie 439: Lst_AtEnd(create, gn->name);
1.86 espie 440: /*
441: * Add the name to the .TARGETS variable as well, so the user
442: * can employ that, if desired.
443: */
1.92 espie 444: Var_Append(".TARGETS", gn->name);
1.86 espie 445: return;
1.3 deraadt 446:
1.92 espie 447: case SPECIAL_ORDER:
1.86 espie 448: /*
449: * Create proper predecessor/successor links between the
450: * previous source and the current one.
451: */
452: if (predecessor != NULL) {
453: Lst_AtEnd(&predecessor->successors, gn);
1.122 espie 454: Lst_AtEnd(&gn->predecessors, predecessor);
1.86 espie 455: }
456: predecessor = gn;
457: break;
1.3 deraadt 458:
1.86 espie 459: default:
460: /*
461: * In the case of a source that was the object of a :: operator,
462: * the attribute is applied to all of its instances (as kept in
463: * the 'cohorts' list of the node) or all the cohorts are linked
464: * to all the targets.
465: */
1.92 espie 466: apply_op(targets, tOp, gn);
1.86 espie 467: if ((gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
468: LstNode ln;
469:
1.92 espie 470: for (ln=Lst_First(&gn->cohorts); ln != NULL;
1.86 espie 471: ln = Lst_Adv(ln)){
1.117 espie 472: apply_op(targets, tOp, Lst_Datum(ln));
1.86 espie 473: }
1.1 deraadt 474: }
1.86 espie 475: break;
1.1 deraadt 476: }
1.3 deraadt 477:
1.86 espie 478: gn->order = waiting;
1.92 espie 479: Array_AtEnd(sources, gn);
480: if (waiting)
481: Array_Find(sources, ParseAddDep, gn);
1.1 deraadt 482: }
483:
484: /*-
485: *-----------------------------------------------------------------------
486: * ParseFindMain --
487: * Find a real target in the list and set it to be the main one.
488: * Called by ParseDoDependency when a main target hasn't been found
489: * yet.
490: *
491: * Results:
1.40 espie 492: * 1 if main not found yet, 0 if it is.
1.1 deraadt 493: *
494: * Side Effects:
1.92 espie 495: * mainNode is changed and.
1.1 deraadt 496: *-----------------------------------------------------------------------
497: */
498: static int
1.94 espie 499: ParseFindMain(void *gnp, void *dummy UNUSED)
500: {
1.111 espie 501: GNode *gn = gnp;
1.112 espie 502:
1.94 espie 503: if ((gn->type & OP_NOTARGET) == 0 && gn->special == SPECIAL_NONE) {
504: mainNode = gn;
505: return 0;
506: } else {
507: return 1;
508: }
1.1 deraadt 509: }
510:
511: /*-
512: *-----------------------------------------------------------------------
513: * ParseClearPath --
1.59 espie 514: * Reinit path to an empty path
1.1 deraadt 515: *-----------------------------------------------------------------------
516: */
1.41 espie 517: static void
1.69 espie 518: ParseClearPath(void *p)
1.1 deraadt 519: {
1.111 espie 520: Lst path = p;
1.59 espie 521:
1.94 espie 522: Lst_Destroy(path, Dir_Destroy);
523: Lst_Init(path);
1.1 deraadt 524: }
525:
1.77 espie 526: static void
1.92 espie 527: add_target_node(const char *line, const char *end)
1.77 espie 528: {
529: GNode *gn;
530:
1.92 espie 531: gn = Suff_ParseAsTransform(line, end);
532:
533: if (gn == NULL) {
534: gn = Targ_FindNodei(line, end, TARG_CREATE);
535: gn->type &= ~OP_DUMMY;
536: }
1.77 espie 537:
1.105 espie 538: Array_AtEnd(>argets, gn);
1.77 espie 539: }
540:
541: static void
1.92 espie 542: add_target_nodes(const char *line, const char *end)
1.77 espie 543: {
544:
1.92 espie 545: if (Dir_HasWildcardsi(line, end)) {
1.77 espie 546: /*
547: * Targets are to be sought only in the current directory,
548: * so create an empty path for the thing. Note we need to
549: * use Dir_Destroy in the destruction of the path as the
550: * Dir module could have added a directory to the path...
551: */
552: char *targName;
553: LIST emptyPath;
554: LIST curTargs;
555:
556: Lst_Init(&emptyPath);
557: Lst_Init(&curTargs);
1.92 espie 558: Dir_Expandi(line, end, &emptyPath, &curTargs);
1.77 espie 559: Lst_Destroy(&emptyPath, Dir_Destroy);
1.117 espie 560: while ((targName = Lst_DeQueue(&curTargs)) != NULL) {
1.92 espie 561: add_target_node(targName, targName + strlen(targName));
1.77 espie 562: }
563: Lst_Destroy(&curTargs, NOFREE);
564: } else {
1.92 espie 565: add_target_node(line, end);
566: }
567: }
568:
569: /* special target line check: a proper delimiter is a ':' or '!', but
570: * we don't want to end a target on such a character if there is a better
571: * match later on.
572: * By "better" I mean one that is followed by whitespace. This allows the
573: * user to have targets like:
574: * fie::fi:fo: fum
575: * where "fie::fi:fo" is the target. In real life this is used for perl5
576: * library man pages where "::" separates an object from its class. Ie:
577: * "File::Spec::Unix".
578: * This behaviour is also consistent with other versions of make.
579: */
580: static bool
581: found_delimiter(const char *s)
582: {
583: if (*s == '!' || *s == ':') {
584: const char *p = s + 1;
585:
586: if (*s == ':' && *p == ':')
587: p++;
588:
589: /* Found the best match already. */
1.110 espie 590: if (ISSPACE(*p) || *p == '\0')
1.92 espie 591: return true;
592:
593: do {
594: p += strcspn(p, "!:");
595: if (*p == '\0')
596: break;
597: p++;
1.120 zhuk 598: } while (*p != '\0' && !ISSPACE(*p));
1.92 espie 599:
600: /* No better match later on... */
601: if (*p == '\0')
602: return true;
603: }
604: return false;
605: }
606:
607: static const char *
1.97 espie 608: parse_do_targets(Lst paths, unsigned int *op, const char *line)
1.92 espie 609: {
610: const char *cp;
611:
612: do {
1.110 espie 613: for (cp = line; *cp && !ISSPACE(*cp) && *cp != '(';) {
1.92 espie 614: if (*cp == '$')
615: /* Must be a dynamic source (would have been
616: * expanded otherwise), so call the Var module
617: * to parse the puppy so we can safely advance
618: * beyond it...There should be no errors in
619: * this, as they would have been discovered in
620: * the initial Var_Subst and we wouldn't be
621: * here. */
622: Var_ParseSkip(&cp, NULL);
623: else {
624: if (found_delimiter(cp))
625: break;
626: cp++;
627: }
628: }
629:
630: if (*cp == '(') {
631: LIST temp;
632: Lst_Init(&temp);
633: /* Archives must be handled specially to make sure the
634: * OP_ARCHV flag is set in their 'type' field, for one
635: * thing, and because things like "archive(file1.o
636: * file2.o file3.o)" are permissible.
637: * Arch_ParseArchive will set 'line' to be the first
638: * non-blank after the archive-spec. It creates/finds
639: * nodes for the members and places them on the given
640: * list, returning true if all went well and false if
641: * there was an error in the specification. On error,
642: * line should remain untouched. */
643: if (!Arch_ParseArchive(&line, &temp, NULL)) {
644: Parse_Error(PARSE_FATAL,
645: "Error in archive specification: \"%s\"",
646: line);
647: return NULL;
648: } else {
649: AppendList2Array(&temp, >argets);
650: Lst_Destroy(&temp, NOFREE);
651: cp = line;
652: continue;
653: }
654: }
655: if (*cp == '\0') {
656: /* Ending a dependency line without an operator is a
657: * Bozo no-no */
1.96 espie 658: /* Deeper check for cvs conflicts */
659: if (gtargets.n > 0 &&
660: (strcmp(gtargets.a[0]->name, "<<<<<<<") == 0 ||
661: strcmp(gtargets.a[0]->name, ">>>>>>>") == 0)) {
1.98 espie 662: Parse_Error(PARSE_FATAL,
1.96 espie 663: "Need an operator (likely from a cvs update conflict)");
664: } else {
1.109 espie 665: Parse_Error(PARSE_FATAL,
666: "Need an operator in '%s'", line);
1.96 espie 667: }
1.92 espie 668: return NULL;
669: }
670: /*
671: * Have word in line. Get or create its nodes and stick it at
672: * the end of the targets list
673: */
674: if (*line != '\0')
675: add_target_nodes(line, cp);
676:
1.110 espie 677: while (ISSPACE(*cp))
1.92 espie 678: cp++;
679: line = cp;
680: } while (*line != '!' && *line != ':' && *line);
681: *op = handle_special_targets(paths);
682: return cp;
683: }
684:
685: static void
686: dump_targets()
687: {
688: size_t i;
689: for (i = 0; i < gtargets.n; i++)
690: fprintf(stderr, "%s", gtargets.a[i]->name);
691: fprintf(stderr, "\n");
692: }
693:
1.97 espie 694: static unsigned int
1.92 espie 695: handle_special_targets(Lst paths)
696: {
697: size_t i;
698: int seen_path = 0;
699: int seen_special = 0;
700: int seen_normal = 0;
701: int type;
702:
703: for (i = 0; i < gtargets.n; i++) {
704: type = gtargets.a[i]->special;
1.129 espie 705: if (type == SPECIAL_PATH) {
1.92 espie 706: seen_path++;
707: Lst_AtEnd(paths, find_suffix_path(gtargets.a[i]));
1.129 espie 708: } else if (type != 0)
1.92 espie 709: seen_special++;
710: else
711: seen_normal++;
712: }
713: if ((seen_path != 0) + (seen_special != 0) + (seen_normal != 0) > 1) {
714: Parse_Error(PARSE_FATAL, "Wrong mix of special targets");
715: dump_targets();
716: specType = SPECIAL_ERROR;
717: return 0;
718: }
719: if (seen_normal != 0) {
720: specType = SPECIAL_NONE;
721: return 0;
1.106 espie 722: } else if (seen_path != 0) {
1.92 espie 723: specType = SPECIAL_PATH;
724: return 0;
725: } else if (seen_special == 0) {
726: specType = SPECIAL_NONE;
727: return 0;
728: } else if (seen_special != 1) {
1.98 espie 729: Parse_Error(PARSE_FATAL,
1.94 espie 730: "Mixing special targets is not allowed");
1.92 espie 731: dump_targets();
732: return 0;
733: } else if (seen_special == 1) {
1.129 espie 734: specType = gtargets.a[0]->special;
1.92 espie 735: switch (specType) {
736: case SPECIAL_MAIN:
737: if (!Lst_IsEmpty(create)) {
738: specType = SPECIAL_NONE;
739: }
740: break;
741: case SPECIAL_NOTPARALLEL:
1.130 ! espie 742: set_notparallel();
1.92 espie 743: break;
744: case SPECIAL_ORDER:
745: predecessor = NULL;
746: break;
747: default:
748: break;
749: }
750: return gtargets.a[0]->special_op;
751: } else {
752: /* we're allowed to have 0 target */
753: specType = SPECIAL_NONE;
754: return 0;
1.77 espie 755: }
756: }
757:
1.97 espie 758: static unsigned int
1.95 espie 759: parse_operator(const char **pos)
760: {
761: const char *cp = *pos;
1.97 espie 762: unsigned int op = OP_ERROR;
1.95 espie 763:
764: if (*cp == '!') {
765: op = OP_FORCE;
766: } else if (*cp == ':') {
767: if (cp[1] == ':') {
768: op = OP_DOUBLEDEP;
769: cp++;
770: } else {
771: op = OP_DEPENDS;
772: }
773: } else {
774: Parse_Error(PARSE_FATAL, "Missing dependency operator");
775: return OP_ERROR;
776: }
777:
778: cp++; /* Advance beyond operator */
779:
780: /* Get to the first source */
1.110 espie 781: while (ISSPACE(*cp))
1.95 espie 782: cp++;
783: *pos = cp;
784: return op;
785: }
786:
1.1 deraadt 787: /*-
788: *---------------------------------------------------------------------
789: * ParseDoDependency --
790: * Parse the dependency line in line.
791: *
792: * Side Effects:
793: * The nodes of the sources are linked as children to the nodes of the
794: * targets. Some nodes may be created.
795: *
796: * We parse a dependency line by first extracting words from the line and
797: * finding nodes in the list of all targets with that name. This is done
798: * until a character is encountered which is an operator character. Currently
799: * these are only ! and :. At this point the operator is parsed and the
800: * pointer into the line advanced until the first source is encountered.
1.59 espie 801: * The parsed operator is applied to each node in the 'targets' list,
1.1 deraadt 802: * which is where the nodes found for the targets are kept, by means of
803: * the ParseDoOp function.
804: * The sources are read in much the same way as the targets were except
805: * that now they are expanded using the wildcarding scheme of the C-Shell
806: * and all instances of the resulting words in the list of all targets
807: * are found. Each of the resulting nodes is then linked to each of the
808: * targets as one of its children.
809: * Certain targets are handled specially. These are the ones detailed
810: * by the specType variable.
811: * The storing of transformation rules is also taken care of here.
812: * A target is recognized as a transformation rule by calling
813: * Suff_IsTransform. If it is a transformation rule, its node is gotten
814: * from the suffix module via Suff_AddTransform rather than the standard
815: * Targ_FindNode in the target module.
816: *---------------------------------------------------------------------
817: */
818: static void
1.92 espie 819: ParseDoDependency(const char *line) /* the line to parse */
1.1 deraadt 820: {
1.92 espie 821: const char *cp; /* our current position */
1.97 espie 822: unsigned int op; /* the operator on the line */
1.92 espie 823: LIST paths; /* List of search paths to alter when parsing
824: * a list of .PATH targets */
1.97 espie 825: unsigned int tOp; /* operator from special target */
1.59 espie 826:
1.92 espie 827: waiting = 0;
828: Lst_Init(&paths);
1.59 espie 829:
1.92 espie 830: Array_Reset(&gsources);
1.1 deraadt 831:
1.92 espie 832: cp = parse_do_targets(&paths, &tOp, line);
1.127 espie 833: assert(specType == SPECIAL_PATH || Lst_IsEmpty(&paths));
1.115 espie 834: if (cp == NULL || specType == SPECIAL_ERROR) {
835: /* invalidate targets for further processing */
836: Array_Reset(>argets);
1.92 espie 837: return;
1.115 espie 838: }
1.1 deraadt 839:
1.95 espie 840: op = parse_operator(&cp);
1.115 espie 841: if (op == OP_ERROR) {
842: /* invalidate targets for further processing */
843: Array_Reset(>argets);
1.1 deraadt 844: return;
1.115 espie 845: }
1.11 millert 846:
1.92 espie 847: Array_FindP(>argets, ParseDoOp, op);
1.114 espie 848: dedup_targets(>argets);
1.1 deraadt 849:
1.92 espie 850: line = cp;
851:
1.127 espie 852: /* Several special targets have specific semantics with no source:
853: * .SUFFIXES clears out all old suffixes
854: * .PRECIOUS/.IGNORE/.SILENT
855: * apply to all target
856: * .PATH clears out all search paths. */
1.92 espie 857: if (!*line) {
1.1 deraadt 858: switch (specType) {
1.92 espie 859: case SPECIAL_SUFFIXES:
1.128 espie 860: Suff_DisableAllSuffixes();
1.1 deraadt 861: break;
1.92 espie 862: case SPECIAL_PRECIOUS:
863: allPrecious = true;
1.1 deraadt 864: break;
1.92 espie 865: case SPECIAL_IGNORE:
866: ignoreErrors = true;
1.1 deraadt 867: break;
1.92 espie 868: case SPECIAL_SILENT:
869: beSilent = true;
1.1 deraadt 870: break;
1.92 espie 871: case SPECIAL_PATH:
872: Lst_Every(&paths, ParseClearPath);
1.1 deraadt 873: break;
1.92 espie 874: default:
1.1 deraadt 875: break;
876: }
1.92 espie 877: } else if (specType == SPECIAL_MFLAGS) {
878: Main_ParseArgLine(line);
879: return;
1.107 espie 880: } else if (specType == SPECIAL_NOTPARALLEL) {
1.92 espie 881: return;
1.1 deraadt 882: }
1.11 millert 883:
1.127 espie 884: /* NOW GO FOR THE SOURCES */
1.92 espie 885: if (specType == SPECIAL_SUFFIXES || specType == SPECIAL_PATH ||
1.107 espie 886: specType == SPECIAL_NOTHING) {
1.92 espie 887: while (*line) {
1.127 espie 888: /* Some special targets take a list of space-separated
889: * words. For each word,
1.92 espie 890: *
1.127 espie 891: * if .SUFFIXES, add it to the list of suffixes maintained
892: * by suff.c.
1.92 espie 893: *
1.127 espie 894: * if .PATHS, add it as a directory on the main search path.
1.92 espie 895: *
1.127 espie 896: * if .LIBS/.INCLUDE/.NULL... this has been deprecated,
897: * ignore
1.92 espie 898: */
1.110 espie 899: while (*cp && !ISSPACE(*cp))
1.92 espie 900: cp++;
901: switch (specType) {
902: case SPECIAL_SUFFIXES:
903: Suff_AddSuffixi(line, cp);
904: break;
905: case SPECIAL_PATH:
906: {
907: LstNode ln;
908:
909: for (ln = Lst_First(&paths); ln != NULL;
910: ln = Lst_Adv(ln))
1.117 espie 911: Dir_AddDiri(Lst_Datum(ln), line, cp);
1.92 espie 912: break;
1.127 espie 913: Lst_Destroy(&paths, NOFREE);
1.92 espie 914: }
915: default:
916: break;
917: }
918: if (*cp != '\0')
919: cp++;
1.110 espie 920: while (ISSPACE(*cp))
1.92 espie 921: cp++;
922: line = cp;
1.1 deraadt 923: }
924: } else {
1.92 espie 925: while (*line) {
926: /*
927: * The targets take real sources, so we must beware of
928: * archive specifications (i.e. things with left
929: * parentheses in them) and handle them accordingly.
930: */
1.110 espie 931: while (*cp && !ISSPACE(*cp)) {
1.92 espie 932: if (*cp == '(' && cp > line && cp[-1] != '$') {
933: /*
934: * Only stop for a left parenthesis if
935: * it isn't at the start of a word
936: * (that'll be for variable changes
937: * later) and isn't preceded by a
938: * dollar sign (a dynamic source).
939: */
940: break;
941: } else {
942: cp++;
943: }
944: }
1.1 deraadt 945:
1.92 espie 946: if (*cp == '(') {
947: GNode *gn;
948: LIST sources; /* list of archive source
949: * names after expansion */
1.1 deraadt 950:
1.92 espie 951: Lst_Init(&sources);
952: if (!Arch_ParseArchive(&line, &sources, NULL)) {
953: Parse_Error(PARSE_FATAL,
954: "Error in source archive spec \"%s\"",
955: line);
956: return;
957: }
1.1 deraadt 958:
1.117 espie 959: while ((gn = Lst_DeQueue(&sources)) != NULL)
1.92 espie 960: ParseDoSrc(>argets, &gsources, tOp,
961: gn->name, NULL);
962: cp = line;
963: } else {
964: const char *endSrc = cp;
1.1 deraadt 965:
1.92 espie 966: ParseDoSrc(>argets, &gsources, tOp, line,
967: endSrc);
968: if (*cp)
969: cp++;
970: }
1.110 espie 971: while (ISSPACE(*cp))
1.92 espie 972: cp++;
973: line = cp;
974: }
1.1 deraadt 975: }
1.11 millert 976:
1.92 espie 977: if (mainNode == NULL) {
978: /* If we have yet to decide on a main target to make, in the
979: * absence of any user input, we want the first target on
980: * the first dependency line that is actually a real target
981: * (i.e. isn't a .USE or .EXEC rule) to be made. */
982: Array_Find(>argets, ParseFindMain, NULL);
1.1 deraadt 983: }
984: }
985:
986: /*-
1.59 espie 987: * ParseAddCmd --
1.1 deraadt 988: * Lst_ForEach function to add a command line to all targets
989: *
1.107 espie 990: * The new command may be added to the commands list of the node.
991: *
992: * If the target already had commands, we ignore the new ones, but
993: * we note that we got double commands (in case we actually get to run
994: * that ambiguous target).
995: *
996: * Note this does not apply to :: dependency lines, since those
997: * will generate fresh cloned nodes and add them to the cohorts
998: * field of the main node.
1.1 deraadt 999: */
1.41 espie 1000: static void
1.94 espie 1001: ParseAddCmd(void *gnp, void *cmd)
1.1 deraadt 1002: {
1.111 espie 1003: GNode *gn = gnp;
1.107 espie 1004:
1.105 espie 1005: if (!(gn->type & OP_HAS_COMMANDS))
1.86 espie 1006: Lst_AtEnd(&gn->commands, cmd);
1.107 espie 1007: else
1008: gn->type |= OP_DOUBLE;
1.1 deraadt 1009: }
1010:
1011: /*-
1012: *-----------------------------------------------------------------------
1013: * ParseHasCommands --
1.107 espie 1014: * Record that the target gained commands through OP_HAS_COMMANDS,
1015: * so that double command lists may be ignored.
1.1 deraadt 1016: *-----------------------------------------------------------------------
1017: */
1018: static void
1.107 espie 1019: ParseHasCommands(void *gnp)
1.1 deraadt 1020: {
1.111 espie 1021: GNode *gn = gnp;
1.107 espie 1022: gn->type |= OP_HAS_COMMANDS;
1023:
1.1 deraadt 1024: }
1025:
1.79 espie 1026:
1.91 espie 1027: /* Strip comments from line. Build a copy in buffer if necessary, */
1028: static char *
1029: strip_comments(Buffer copy, const char *line)
1030: {
1031: const char *comment;
1032: const char *p;
1033:
1034: comment = strchr(line, '#');
1035: if (comment == NULL)
1036: return (char *)line;
1037: else {
1038: Buf_Reset(copy);
1039:
1040: for (p = line; *p != '\0'; p++) {
1041: if (*p == '\\') {
1042: if (p[1] == '#') {
1043: Buf_Addi(copy, line, p);
1044: Buf_AddChar(copy, '#');
1045: line = p+2;
1046: }
1047: if (p[1] != '\0')
1048: p++;
1049: } else if (*p == '#')
1050: break;
1051: }
1052: Buf_Addi(copy, line, p);
1053: return Buf_Retrieve(copy);
1054: }
1055: }
1056:
1057:
1058:
1.79 espie 1059: /***
1060: *** Support for various include constructs
1061: ***/
1062:
1063:
1.1 deraadt 1064: void
1.79 espie 1065: Parse_AddIncludeDir(const char *dir)
1.1 deraadt 1066: {
1.89 espie 1067: Dir_AddDir(userIncludePath, dir);
1.1 deraadt 1068: }
1069:
1.79 espie 1070: static char *
1.116 espie 1071: resolve_include_filename(const char *file, const char *efile, bool isSystem)
1.1 deraadt 1072: {
1.79 espie 1073: char *fullname;
1.87 espie 1074:
1.79 espie 1075: /* Look up system files on the system path first */
1076: if (isSystem) {
1.116 espie 1077: fullname = Dir_FindFileNoDoti(file, efile, systemIncludePath);
1.79 espie 1078: if (fullname)
1079: return fullname;
1080: }
1081:
1082: /* Handle non-system non-absolute files... */
1083: if (!isSystem && file[0] != '/') {
1.85 espie 1084: /* ... by looking first under the same directory as the
1.79 espie 1085: * current file */
1.100 espie 1086: char *slash = NULL;
1.79 espie 1087: const char *fname;
1088:
1089: fname = Parse_Getfilename();
1090:
1.100 espie 1091: if (fname != NULL)
1092: slash = strrchr(fname, '/');
1093:
1.79 espie 1094: if (slash != NULL) {
1095: char *newName;
1096:
1.116 espie 1097: newName = Str_concati(fname, slash, file, efile, '/');
1.89 espie 1098: fullname = Dir_FindFile(newName, userIncludePath);
1.79 espie 1099: if (fullname == NULL)
1.83 espie 1100: fullname = Dir_FindFile(newName, defaultPath);
1.79 espie 1101: free(newName);
1102: if (fullname)
1103: return fullname;
1104: }
1105: }
1.1 deraadt 1106:
1.79 espie 1107: /* Now look first on the -I search path, then on the .PATH
1108: * search path, if not found in a -I directory.
1109: * XXX: Suffix specific? */
1.116 espie 1110: fullname = Dir_FindFilei(file, efile, userIncludePath);
1.79 espie 1111: if (fullname)
1112: return fullname;
1.116 espie 1113: fullname = Dir_FindFilei(file, efile, defaultPath);
1.79 espie 1114: if (fullname)
1115: return fullname;
1.1 deraadt 1116:
1.79 espie 1117: /* Still haven't found the makefile. Look for it on the system
1118: * path as a last resort (if we haven't already). */
1119: if (isSystem)
1120: return NULL;
1121: else
1.116 espie 1122: return Dir_FindFilei(file, efile, systemIncludePath);
1.1 deraadt 1123: }
1124:
1125: static void
1.116 espie 1126: handle_include_file(const char *file, const char *efile, bool isSystem,
1.79 espie 1127: bool errIfNotFound)
1.1 deraadt 1128: {
1.79 espie 1129: char *fullname;
1130:
1.116 espie 1131: fullname = resolve_include_filename(file, efile, isSystem);
1.79 espie 1132: if (fullname == NULL && errIfNotFound)
1.116 espie 1133: Parse_Error(PARSE_FATAL, "Could not find %.*s",
1134: (int)(efile - file), file);
1.1 deraadt 1135:
1.79 espie 1136: if (fullname != NULL) {
1137: FILE *f;
1.59 espie 1138:
1.79 espie 1139: f = fopen(fullname, "r");
1140: if (f == NULL && errIfNotFound)
1141: Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
1142: else
1143: Parse_FromFile(fullname, f);
1144: }
1.59 espie 1145: }
1146:
1.79 espie 1147: /* .include <file> (system) or .include "file" (normal) */
1148: static bool
1149: lookup_bsd_include(const char *file)
1.59 espie 1150: {
1.85 espie 1151: char endc;
1.79 espie 1152: const char *efile;
1.116 espie 1153: char *file2;
1.79 espie 1154: bool isSystem;
1155:
1156: /* find starting delimiter */
1.110 espie 1157: while (ISSPACE(*file))
1.79 espie 1158: file++;
1159:
1160: /* determine type of file */
1161: if (*file == '<') {
1162: isSystem = true;
1163: endc = '>';
1164: } else if (*file == '"') {
1165: isSystem = false;
1166: endc = '"';
1167: } else {
1168: Parse_Error(PARSE_WARNING,
1169: ".include filename must be delimited by '\"' or '<'");
1170: return false;
1171: }
1.1 deraadt 1172:
1.79 espie 1173: /* delimit file name between file and efile */
1174: for (efile = ++file; *efile != endc; efile++) {
1175: if (*efile == '\0') {
1176: Parse_Error(PARSE_WARNING,
1177: "Unclosed .include filename. '%c' expected", endc);
1178: return false;
1179: }
1180: }
1.116 espie 1181: /* Substitute for any variables in the file name before trying to
1182: * find the thing. */
1183: file2 = Var_Substi(file, efile, NULL, false);
1184: handle_include_file(file2, strchr(file2, '\0'), isSystem, true);
1185: free(file2);
1.79 espie 1186: return true;
1187: }
1.1 deraadt 1188:
1189:
1.79 espie 1190: static void
1.116 espie 1191: lookup_sysv_style_include(const char *line, const char *directive,
1.79 espie 1192: bool errIfMissing)
1.50 espie 1193: {
1.116 espie 1194: char *file;
1195: char *name;
1196: char *ename;
1197: bool okay = false;
1198:
1199: /* Substitute for any variables in the file name before trying to
1200: * find the thing. */
1201: file = Var_Subst(line, NULL, false);
1202:
1203: /* sys5 allows for list of files separated by spaces */
1204: name = file;
1205: while (1) {
1206: /* find beginning of name */
1207: while (ISSPACE(*name))
1208: name++;
1209: if (*name == '\0')
1210: break;
1211: for (ename = name; *ename != '\0' && !ISSPACE(*ename);)
1212: ename++;
1213: handle_include_file(name, ename, true, errIfMissing);
1214: okay = true;
1215: name = ename;
1216: }
1.50 espie 1217:
1.116 espie 1218: free(file);
1219: if (!okay) {
1.79 espie 1220: Parse_Error(PARSE_FATAL, "Filename missing from \"%s\"",
1.116 espie 1221: directive);
1.50 espie 1222: }
1.70 espie 1223: }
1224:
1.79 espie 1225:
1226: /* system V construct: include file */
1.70 espie 1227: static void
1.79 espie 1228: lookup_sysv_include(const char *file, const char *directive)
1.70 espie 1229: {
1.79 espie 1230: lookup_sysv_style_include(file, directive, true);
1231: }
1.1 deraadt 1232:
1233:
1.79 espie 1234: /* sinclude file and -include file */
1235: static void
1236: lookup_conditional_include(const char *file, const char *directive)
1237: {
1238: lookup_sysv_style_include(file, directive, false);
1.1 deraadt 1239: }
1240:
1.59 espie 1241:
1.91 espie 1242: /***
1243: *** BSD-specific . constructs
1244: *** They all follow the same pattern:
1245: *** if the syntax matches BSD stuff, then we're committed to handle
1246: *** them and report fatal errors (like, include file not existing)
1247: *** otherwise, we return false, and hope somebody else will handle it.
1248: ***/
1249:
1.79 espie 1250: static bool
1251: handle_poison(const char *line)
1.72 espie 1252: {
1.79 espie 1253: const char *p = line;
1.72 espie 1254: int type = POISON_NORMAL;
1255: bool not = false;
1256: bool paren_to_match = false;
1.79 espie 1257: const char *name, *ename;
1.72 espie 1258:
1.110 espie 1259: while (ISSPACE(*p))
1.72 espie 1260: p++;
1261: if (*p == '!') {
1262: not = true;
1263: p++;
1264: }
1.110 espie 1265: while (ISSPACE(*p))
1.72 espie 1266: p++;
1267: if (strncmp(p, "defined", 7) == 0) {
1268: type = POISON_DEFINED;
1269: p += 7;
1270: } else if (strncmp(p, "empty", 5) == 0) {
1271: type = POISON_EMPTY;
1272: p += 5;
1273: }
1.110 espie 1274: while (ISSPACE(*p))
1.72 espie 1275: p++;
1276: if (*p == '(') {
1277: paren_to_match = true;
1278: p++;
1279: }
1.110 espie 1280: while (ISSPACE(*p))
1.72 espie 1281: p++;
1282: name = ename = p;
1.110 espie 1283: while (*p != '\0' && !ISSPACE(*p)) {
1.72 espie 1284: if (*p == ')' && paren_to_match) {
1285: paren_to_match = false;
1286: p++;
1287: break;
1288: }
1289: p++;
1290: ename = p;
1291: }
1.110 espie 1292: while (ISSPACE(*p))
1.72 espie 1293: p++;
1294: switch(type) {
1295: case POISON_NORMAL:
1296: case POISON_EMPTY:
1297: if (not)
1298: type = POISON_INVALID;
1299: break;
1300: case POISON_DEFINED:
1301: if (not)
1302: type = POISON_NOT_DEFINED;
1303: else
1304: type = POISON_INVALID;
1305: break;
1306: }
1.79 espie 1307: if ((*p != '\0' && *p != '#') || type == POISON_INVALID) {
1.85 espie 1308: Parse_Error(PARSE_WARNING, "Invalid syntax for .poison: %s",
1.72 espie 1309: line);
1.79 espie 1310: return false;
1311: } else {
1.118 espie 1312: Var_Mark(name, ename, type);
1.79 espie 1313: return true;
1314: }
1.72 espie 1315: }
1.59 espie 1316:
1.92 espie 1317:
1.61 espie 1318: static bool
1.79 espie 1319: handle_for_loop(Buffer linebuf, const char *line)
1.59 espie 1320: {
1.79 espie 1321: For *loop;
1.59 espie 1322:
1.91 espie 1323: loop = For_Eval(line);
1.79 espie 1324: if (loop != NULL) {
1325: bool ok;
1326: do {
1327: /* Find the matching endfor. */
1328: line = ParseReadLoopLine(linebuf);
1329: if (line == NULL) {
1330: Parse_Error(PARSE_FATAL,
1331: "Unexpected end of file in for loop.\n");
1332: return false;
1333: }
1334: ok = For_Accumulate(loop, line);
1335: } while (ok);
1336: For_Run(loop);
1337: return true;
1338: } else
1339: return false;
1340: }
1.59 espie 1341:
1.79 espie 1342: static bool
1343: handle_undef(const char *line)
1344: {
1345: const char *eline;
1.59 espie 1346:
1.110 espie 1347: while (ISSPACE(*line))
1.79 espie 1348: line++;
1.110 espie 1349: for (eline = line; !ISSPACE(*eline) && *eline != '\0';)
1.79 espie 1350: eline++;
1351: Var_Deletei(line, eline);
1.61 espie 1352: return true;
1.79 espie 1353: }
1.67 espie 1354:
1.92 espie 1355: /* global hub for the construct */
1.79 espie 1356: static bool
1357: handle_bsd_command(Buffer linebuf, Buffer copy, const char *line)
1358: {
1359: char *stripped;
1.59 espie 1360:
1.110 espie 1361: while (ISSPACE(*line))
1.79 espie 1362: line++;
1363:
1.91 espie 1364: /* delegate basic classification to the conditional module */
1.79 espie 1365: switch (Cond_Eval(line)) {
1366: case COND_SKIP:
1367: /* Skip to next conditional that evaluates to COND_PARSE. */
1368: do {
1369: line = Parse_ReadNextConditionalLine(linebuf);
1370: if (line != NULL) {
1.110 espie 1371: while (ISSPACE(*line))
1.79 espie 1372: line++;
1.121 jsg 1373: stripped = strip_comments(copy, line);
1.79 espie 1374: }
1375: } while (line != NULL && Cond_Eval(stripped) != COND_PARSE);
1376: /* FALLTHROUGH */
1377: case COND_PARSE:
1378: return true;
1.85 espie 1379: case COND_ISFOR:
1.91 espie 1380: return handle_for_loop(linebuf, line + 3);
1.79 espie 1381: case COND_ISINCLUDE:
1382: return lookup_bsd_include(line + 7);
1383: case COND_ISPOISON:
1.91 espie 1384: return handle_poison(line + 6);
1.85 espie 1385: case COND_ISUNDEF:
1.79 espie 1386: return handle_undef(line + 5);
1387: default:
1388: break;
1389: }
1.67 espie 1390:
1.79 espie 1391: return false;
1.59 espie 1392: }
1393:
1.114 espie 1394: /* postprocess group of targets prior to linking stuff with them */
1.117 espie 1395: static bool
1.114 espie 1396: register_target(GNode *gn, struct ohash *t)
1.113 espie 1397: {
1398: unsigned int slot;
1399: uint32_t hv;
1400: const char *ename = NULL;
1401: GNode *gn2;
1402:
1403: hv = ohash_interval(gn->name, &ename);
1404:
1.114 espie 1405: slot = ohash_lookup_interval(t, gn->name, ename, hv);
1406: gn2 = ohash_find(t, slot);
1.113 espie 1407:
1.114 espie 1408: if (gn2 == NULL) {
1409: ohash_insert(t, slot, gn);
1410: return true;
1411: } else
1412: return false;
1.113 espie 1413: }
1414:
1415: static void
1.114 espie 1416: build_target_group(struct growableArray *targets, struct ohash *t)
1.107 espie 1417: {
1418: LstNode ln;
1419: bool seen_target = false;
1.113 espie 1420: unsigned int i;
1.107 espie 1421:
1.113 espie 1422: /* may be 0 if wildcard expansion resulted in zero match */
1423: if (targets->n <= 1)
1.107 espie 1424: return;
1.114 espie 1425:
1426: /* Perform checks to see if we must tie targets together */
1.107 espie 1427: /* XXX */
1428: if (targets->a[0]->type & OP_TRANSFORM)
1429: return;
1.114 espie 1430:
1.107 espie 1431: for (ln = Lst_First(&targets->a[0]->commands); ln != NULL;
1432: ln = Lst_Adv(ln)) {
1433: struct command *cmd = Lst_Datum(ln);
1434: if (Var_Check_for_target(cmd->string)) {
1435: seen_target = true;
1436: break;
1437: }
1438: }
1439: if (DEBUG(TARGGROUP)) {
1440: fprintf(stderr,
1441: seen_target ? "No target group at %lu: ":
1442: "Target group at %lu:", Parse_Getlineno());
1443: for (i = 0; i < targets->n; i++)
1444: fprintf(stderr, " %s", targets->a[i]->name);
1445: fprintf(stderr, "\n");
1446: }
1447: if (seen_target)
1448: return;
1449:
1.114 espie 1450: GNode *gn, *gn2;
1451: /* targets may already participate in groupling lists,
1452: * so rebuild the circular list "from scratch"
1.113 espie 1453: */
1454:
1.107 espie 1455: for (i = 0; i < targets->n; i++) {
1.113 espie 1456: gn = targets->a[i];
1457: for (gn2 = gn->groupling; gn2 != gn; gn2 = gn2->groupling) {
1458: if (!gn2)
1459: break;
1.114 espie 1460: register_target(gn2, t);
1.113 espie 1461: }
1.107 espie 1462: }
1.113 espie 1463:
1.114 espie 1464: for (gn = ohash_first(t, &i); gn != NULL; gn = ohash_next(t, &i)) {
1.113 espie 1465: gn->groupling = gn2;
1466: gn2 = gn;
1467: }
1.114 espie 1468: gn = ohash_first(t, &i);
1.113 espie 1469: gn->groupling = gn2;
1.114 espie 1470: }
1471:
1472: static void
1473: reset_target_hash()
1474: {
1475: if (htargets_setup)
1476: ohash_delete(&htargets);
1477: ohash_init(&htargets, 5, &gnode_info);
1478: htargets_setup = true;
1479: }
1480:
1481: void
1482: Parse_End()
1483: {
1484: if (htargets_setup)
1485: ohash_delete(&htargets);
1486: }
1487:
1488: static void
1489: dedup_targets(struct growableArray *targets)
1490: {
1491: unsigned int i, j;
1.113 espie 1492:
1.114 espie 1493: if (targets->n <= 1)
1494: return;
1495:
1496: reset_target_hash();
1497: /* first let's de-dup the list */
1498: for (i = 0, j = 0; i < targets->n; i++) {
1499: GNode *gn = targets->a[i];
1500: if (register_target(gn, &htargets))
1501: targets->a[j++] = targets->a[i];
1502: }
1503: targets->n = j;
1.107 espie 1504: }
1505:
1.114 espie 1506:
1507: /***
1508: *** handle a group of commands
1509: ***/
1510:
1.107 espie 1511: static void
1.91 espie 1512: finish_commands(struct growableArray *targets)
1.1 deraadt 1513: {
1.114 espie 1514: build_target_group(targets, &htargets);
1.91 espie 1515: Array_Every(targets, ParseHasCommands);
1.1 deraadt 1516: }
1.11 millert 1517:
1.59 espie 1518: static void
1.91 espie 1519: parse_commands(struct growableArray *targets, const char *line)
1.59 espie 1520: {
1.86 espie 1521: /* add the command to the list of
1522: * commands of all targets in the dependency spec */
1.105 espie 1523:
1524: struct command *cmd;
1525: size_t len = strlen(line);
1526:
1527: cmd = emalloc(sizeof(struct command) + len);
1528: memcpy(&cmd->string, line, len+1);
1529: Parse_FillLocation(&cmd->location);
1530:
1.91 espie 1531: Array_ForEach(targets, ParseAddCmd, cmd);
1.59 espie 1532: }
1.1 deraadt 1533:
1.91 espie 1534: static bool
1535: parse_as_special_line(Buffer buf, Buffer copy, const char *line)
1536: {
1537: if (*line == '.' && handle_bsd_command(buf, copy, line+1))
1538: return true;
1539: if (FEATURES(FEATURE_SYSVINCLUDE) &&
1540: strncmp(line, "include", 7) == 0 &&
1.110 espie 1541: ISSPACE(line[7]) &&
1.91 espie 1542: strchr(line, ':') == NULL) {
1543: /* It's an S3/S5-style "include". */
1544: lookup_sysv_include(line + 7, "include");
1545: return true;
1546: }
1547: if (FEATURES(FEATURE_CONDINCLUDE) &&
1548: strncmp(line, "sinclude", 8) == 0 &&
1.110 espie 1549: ISSPACE(line[8]) &&
1.91 espie 1550: strchr(line, ':') == NULL) {
1551: lookup_conditional_include(line+8, "sinclude");
1552: return true;
1553: }
1554: if (FEATURES(FEATURE_CONDINCLUDE) &&
1555: strncmp(line, "-include", 8) == 0 &&
1.110 espie 1556: ISSPACE(line[8]) &&
1.91 espie 1557: strchr(line, ':') == NULL) {
1558: lookup_conditional_include(line+8, "-include");
1559: return true;
1560: }
1561: return false;
1562: }
1.1 deraadt 1563:
1.91 espie 1564: static void
1565: parse_target_line(struct growableArray *targets, const char *line,
1.107 espie 1566: const char *stripped, bool *pcommands_seen)
1.91 espie 1567: {
1568: size_t pos;
1569: char *end;
1570: char *cp;
1.105 espie 1571: char *cmd;
1.91 espie 1572:
1573: /* let's start a new set of commands */
1574: Array_Reset(targets);
1575:
1576: /* XXX this is a dirty heuristic to handle target: dep ; commands */
1.105 espie 1577: cmd = NULL;
1.91 espie 1578: /* First we need to find eventual dependencies */
1579: pos = strcspn(stripped, ":!");
1580: /* go over :!, and find ; */
1581: if (stripped[pos] != '\0' &&
1582: (end = strchr(stripped+pos+1, ';')) != NULL) {
1583: if (line != stripped)
1584: /* find matching ; in original... The
1585: * original might be slightly longer. */
1.105 espie 1586: cmd = strchr(line+(end-stripped), ';');
1.59 espie 1587: else
1.105 espie 1588: cmd = end;
1.91 espie 1589: /* kill end of line. */
1590: *end = '\0';
1591: }
1592: /* We now know it's a dependency line so it needs to
1593: * have all variables expanded before being parsed.
1594: */
1595: cp = Var_Subst(stripped, NULL, false);
1596: ParseDoDependency(cp);
1597: free(cp);
1598:
1.105 espie 1599: /* Parse command if it's not empty. */
1600: if (cmd != NULL) {
1.91 espie 1601: do {
1.105 espie 1602: cmd++;
1.110 espie 1603: } while (ISSPACE(*cmd));
1.107 espie 1604: if (*cmd != '\0') {
1.105 espie 1605: parse_commands(targets, cmd);
1.107 espie 1606: *pcommands_seen = true;
1607: }
1.91 espie 1608: }
1609: }
1610:
1611: void
1612: Parse_File(const char *filename, FILE *stream)
1613: {
1614: char *line;
1615: bool expectingCommands = false;
1.107 espie 1616: bool commands_seen = false;
1.11 millert 1617:
1.126 espie 1618: /* permanent spaces to shave time */
1619: static BUFFER buf;
1620: static BUFFER copy;
1.91 espie 1621:
1.126 espie 1622: Buf_Reinit(&buf, MAKE_BSIZE);
1623: Buf_Reinit(©, MAKE_BSIZE);
1.91 espie 1624:
1625: Parse_FromFile(filename, stream);
1626: do {
1627: while ((line = Parse_ReadNormalLine(&buf)) != NULL) {
1628: if (*line == '\t') {
1.107 espie 1629: if (expectingCommands) {
1630: commands_seen = true;
1.91 espie 1631: parse_commands(>argets, line+1);
1.107 espie 1632: } else
1.91 espie 1633: Parse_Error(PARSE_FATAL,
1634: "Unassociated shell command \"%s\"",
1635: line);
1636: } else {
1637: const char *stripped = strip_comments(©,
1638: line);
1639: if (!parse_as_special_line(&buf, ©,
1640: stripped)) {
1.107 espie 1641: if (commands_seen)
1.91 espie 1642: finish_commands(>argets);
1.107 espie 1643: commands_seen = false;
1.91 espie 1644: if (Parse_As_Var_Assignment(stripped))
1645: expectingCommands = false;
1646: else {
1647: parse_target_line(>argets,
1.107 espie 1648: line, stripped,
1649: &commands_seen);
1.91 espie 1650: expectingCommands = true;
1651: }
1652: }
1.59 espie 1653: }
1.1 deraadt 1654: }
1.91 espie 1655: } while (Parse_NextFile());
1.1 deraadt 1656:
1.107 espie 1657: if (commands_seen)
1.91 espie 1658: finish_commands(>argets);
1659: /* Make sure conditionals are clean. */
1660: Cond_End();
1661:
1662: Parse_ReportErrors();
1.1 deraadt 1663: }
1664:
1665: void
1.69 espie 1666: Parse_Init(void)
1.1 deraadt 1667: {
1.79 espie 1668: mainNode = NULL;
1.89 espie 1669: Static_Lst_Init(userIncludePath);
1670: Static_Lst_Init(systemIncludePath);
1.79 espie 1671: Array_Init(>argets, TARGETS_SIZE);
1.92 espie 1672: Array_Init(&gsources, SOURCES_SIZE);
1673: create_special_nodes();
1.1 deraadt 1674: }
1675:
1.44 espie 1676: void
1.69 espie 1677: Parse_MainName(Lst listmain) /* result list */
1.1 deraadt 1678: {
1.94 espie 1679: if (mainNode == NULL) {
1680: Punt("no target to make.");
1681: /*NOTREACHED*/
1682: } else if (mainNode->type & OP_DOUBLEDEP) {
1683: Lst_AtEnd(listmain, mainNode);
1684: Lst_Concat(listmain, &mainNode->cohorts);
1685: }
1686: else
1687: Lst_AtEnd(listmain, mainNode);
1.1 deraadt 1688: }
![[BACK]](/icons/back.gif){kind=icon}
Return to parse.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / make