Annotation of src/usr.bin/make/parse.c, Revision 1.129
1.129 ! espie 1: /* $OpenBSD: parse.c,v 1.128 2020/01/13 14:03:12 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:
742: {
743: extern int maxJobs;
744:
745: maxJobs = 1;
1.107 espie 746: compatMake = 1;
1.92 espie 747: break;
748: }
749: case SPECIAL_ORDER:
750: predecessor = NULL;
751: break;
752: default:
753: break;
754: }
755: return gtargets.a[0]->special_op;
756: } else {
757: /* we're allowed to have 0 target */
758: specType = SPECIAL_NONE;
759: return 0;
1.77 espie 760: }
761: }
762:
1.97 espie 763: static unsigned int
1.95 espie 764: parse_operator(const char **pos)
765: {
766: const char *cp = *pos;
1.97 espie 767: unsigned int op = OP_ERROR;
1.95 espie 768:
769: if (*cp == '!') {
770: op = OP_FORCE;
771: } else if (*cp == ':') {
772: if (cp[1] == ':') {
773: op = OP_DOUBLEDEP;
774: cp++;
775: } else {
776: op = OP_DEPENDS;
777: }
778: } else {
779: Parse_Error(PARSE_FATAL, "Missing dependency operator");
780: return OP_ERROR;
781: }
782:
783: cp++; /* Advance beyond operator */
784:
785: /* Get to the first source */
1.110 espie 786: while (ISSPACE(*cp))
1.95 espie 787: cp++;
788: *pos = cp;
789: return op;
790: }
791:
1.1 deraadt 792: /*-
793: *---------------------------------------------------------------------
794: * ParseDoDependency --
795: * Parse the dependency line in line.
796: *
797: * Side Effects:
798: * The nodes of the sources are linked as children to the nodes of the
799: * targets. Some nodes may be created.
800: *
801: * We parse a dependency line by first extracting words from the line and
802: * finding nodes in the list of all targets with that name. This is done
803: * until a character is encountered which is an operator character. Currently
804: * these are only ! and :. At this point the operator is parsed and the
805: * pointer into the line advanced until the first source is encountered.
1.59 espie 806: * The parsed operator is applied to each node in the 'targets' list,
1.1 deraadt 807: * which is where the nodes found for the targets are kept, by means of
808: * the ParseDoOp function.
809: * The sources are read in much the same way as the targets were except
810: * that now they are expanded using the wildcarding scheme of the C-Shell
811: * and all instances of the resulting words in the list of all targets
812: * are found. Each of the resulting nodes is then linked to each of the
813: * targets as one of its children.
814: * Certain targets are handled specially. These are the ones detailed
815: * by the specType variable.
816: * The storing of transformation rules is also taken care of here.
817: * A target is recognized as a transformation rule by calling
818: * Suff_IsTransform. If it is a transformation rule, its node is gotten
819: * from the suffix module via Suff_AddTransform rather than the standard
820: * Targ_FindNode in the target module.
821: *---------------------------------------------------------------------
822: */
823: static void
1.92 espie 824: ParseDoDependency(const char *line) /* the line to parse */
1.1 deraadt 825: {
1.92 espie 826: const char *cp; /* our current position */
1.97 espie 827: unsigned int op; /* the operator on the line */
1.92 espie 828: LIST paths; /* List of search paths to alter when parsing
829: * a list of .PATH targets */
1.97 espie 830: unsigned int tOp; /* operator from special target */
1.59 espie 831:
1.92 espie 832: waiting = 0;
833: Lst_Init(&paths);
1.59 espie 834:
1.92 espie 835: Array_Reset(&gsources);
1.1 deraadt 836:
1.92 espie 837: cp = parse_do_targets(&paths, &tOp, line);
1.127 espie 838: assert(specType == SPECIAL_PATH || Lst_IsEmpty(&paths));
1.115 espie 839: if (cp == NULL || specType == SPECIAL_ERROR) {
840: /* invalidate targets for further processing */
841: Array_Reset(>argets);
1.92 espie 842: return;
1.115 espie 843: }
1.1 deraadt 844:
1.95 espie 845: op = parse_operator(&cp);
1.115 espie 846: if (op == OP_ERROR) {
847: /* invalidate targets for further processing */
848: Array_Reset(>argets);
1.1 deraadt 849: return;
1.115 espie 850: }
1.11 millert 851:
1.92 espie 852: Array_FindP(>argets, ParseDoOp, op);
1.114 espie 853: dedup_targets(>argets);
1.1 deraadt 854:
1.92 espie 855: line = cp;
856:
1.127 espie 857: /* Several special targets have specific semantics with no source:
858: * .SUFFIXES clears out all old suffixes
859: * .PRECIOUS/.IGNORE/.SILENT
860: * apply to all target
861: * .PATH clears out all search paths. */
1.92 espie 862: if (!*line) {
1.1 deraadt 863: switch (specType) {
1.92 espie 864: case SPECIAL_SUFFIXES:
1.128 espie 865: Suff_DisableAllSuffixes();
1.1 deraadt 866: break;
1.92 espie 867: case SPECIAL_PRECIOUS:
868: allPrecious = true;
1.1 deraadt 869: break;
1.92 espie 870: case SPECIAL_IGNORE:
871: ignoreErrors = true;
1.1 deraadt 872: break;
1.92 espie 873: case SPECIAL_SILENT:
874: beSilent = true;
1.1 deraadt 875: break;
1.92 espie 876: case SPECIAL_PATH:
877: Lst_Every(&paths, ParseClearPath);
1.1 deraadt 878: break;
1.92 espie 879: default:
1.1 deraadt 880: break;
881: }
1.92 espie 882: } else if (specType == SPECIAL_MFLAGS) {
883: Main_ParseArgLine(line);
884: return;
1.107 espie 885: } else if (specType == SPECIAL_NOTPARALLEL) {
1.92 espie 886: return;
1.1 deraadt 887: }
1.11 millert 888:
1.127 espie 889: /* NOW GO FOR THE SOURCES */
1.92 espie 890: if (specType == SPECIAL_SUFFIXES || specType == SPECIAL_PATH ||
1.107 espie 891: specType == SPECIAL_NOTHING) {
1.92 espie 892: while (*line) {
1.127 espie 893: /* Some special targets take a list of space-separated
894: * words. For each word,
1.92 espie 895: *
1.127 espie 896: * if .SUFFIXES, add it to the list of suffixes maintained
897: * by suff.c.
1.92 espie 898: *
1.127 espie 899: * if .PATHS, add it as a directory on the main search path.
1.92 espie 900: *
1.127 espie 901: * if .LIBS/.INCLUDE/.NULL... this has been deprecated,
902: * ignore
1.92 espie 903: */
1.110 espie 904: while (*cp && !ISSPACE(*cp))
1.92 espie 905: cp++;
906: switch (specType) {
907: case SPECIAL_SUFFIXES:
908: Suff_AddSuffixi(line, cp);
909: break;
910: case SPECIAL_PATH:
911: {
912: LstNode ln;
913:
914: for (ln = Lst_First(&paths); ln != NULL;
915: ln = Lst_Adv(ln))
1.117 espie 916: Dir_AddDiri(Lst_Datum(ln), line, cp);
1.92 espie 917: break;
1.127 espie 918: Lst_Destroy(&paths, NOFREE);
1.92 espie 919: }
920: default:
921: break;
922: }
923: if (*cp != '\0')
924: cp++;
1.110 espie 925: while (ISSPACE(*cp))
1.92 espie 926: cp++;
927: line = cp;
1.1 deraadt 928: }
929: } else {
1.92 espie 930: while (*line) {
931: /*
932: * The targets take real sources, so we must beware of
933: * archive specifications (i.e. things with left
934: * parentheses in them) and handle them accordingly.
935: */
1.110 espie 936: while (*cp && !ISSPACE(*cp)) {
1.92 espie 937: if (*cp == '(' && cp > line && cp[-1] != '$') {
938: /*
939: * Only stop for a left parenthesis if
940: * it isn't at the start of a word
941: * (that'll be for variable changes
942: * later) and isn't preceded by a
943: * dollar sign (a dynamic source).
944: */
945: break;
946: } else {
947: cp++;
948: }
949: }
1.1 deraadt 950:
1.92 espie 951: if (*cp == '(') {
952: GNode *gn;
953: LIST sources; /* list of archive source
954: * names after expansion */
1.1 deraadt 955:
1.92 espie 956: Lst_Init(&sources);
957: if (!Arch_ParseArchive(&line, &sources, NULL)) {
958: Parse_Error(PARSE_FATAL,
959: "Error in source archive spec \"%s\"",
960: line);
961: return;
962: }
1.1 deraadt 963:
1.117 espie 964: while ((gn = Lst_DeQueue(&sources)) != NULL)
1.92 espie 965: ParseDoSrc(>argets, &gsources, tOp,
966: gn->name, NULL);
967: cp = line;
968: } else {
969: const char *endSrc = cp;
1.1 deraadt 970:
1.92 espie 971: ParseDoSrc(>argets, &gsources, tOp, line,
972: endSrc);
973: if (*cp)
974: cp++;
975: }
1.110 espie 976: while (ISSPACE(*cp))
1.92 espie 977: cp++;
978: line = cp;
979: }
1.1 deraadt 980: }
1.11 millert 981:
1.92 espie 982: if (mainNode == NULL) {
983: /* If we have yet to decide on a main target to make, in the
984: * absence of any user input, we want the first target on
985: * the first dependency line that is actually a real target
986: * (i.e. isn't a .USE or .EXEC rule) to be made. */
987: Array_Find(>argets, ParseFindMain, NULL);
1.1 deraadt 988: }
989: }
990:
991: /*-
1.59 espie 992: * ParseAddCmd --
1.1 deraadt 993: * Lst_ForEach function to add a command line to all targets
994: *
1.107 espie 995: * The new command may be added to the commands list of the node.
996: *
997: * If the target already had commands, we ignore the new ones, but
998: * we note that we got double commands (in case we actually get to run
999: * that ambiguous target).
1000: *
1001: * Note this does not apply to :: dependency lines, since those
1002: * will generate fresh cloned nodes and add them to the cohorts
1003: * field of the main node.
1.1 deraadt 1004: */
1.41 espie 1005: static void
1.94 espie 1006: ParseAddCmd(void *gnp, void *cmd)
1.1 deraadt 1007: {
1.111 espie 1008: GNode *gn = gnp;
1.107 espie 1009:
1.105 espie 1010: if (!(gn->type & OP_HAS_COMMANDS))
1.86 espie 1011: Lst_AtEnd(&gn->commands, cmd);
1.107 espie 1012: else
1013: gn->type |= OP_DOUBLE;
1.1 deraadt 1014: }
1015:
1016: /*-
1017: *-----------------------------------------------------------------------
1018: * ParseHasCommands --
1.107 espie 1019: * Record that the target gained commands through OP_HAS_COMMANDS,
1020: * so that double command lists may be ignored.
1.1 deraadt 1021: *-----------------------------------------------------------------------
1022: */
1023: static void
1.107 espie 1024: ParseHasCommands(void *gnp)
1.1 deraadt 1025: {
1.111 espie 1026: GNode *gn = gnp;
1.107 espie 1027: gn->type |= OP_HAS_COMMANDS;
1028:
1.1 deraadt 1029: }
1030:
1.79 espie 1031:
1.91 espie 1032: /* Strip comments from line. Build a copy in buffer if necessary, */
1033: static char *
1034: strip_comments(Buffer copy, const char *line)
1035: {
1036: const char *comment;
1037: const char *p;
1038:
1039: comment = strchr(line, '#');
1040: if (comment == NULL)
1041: return (char *)line;
1042: else {
1043: Buf_Reset(copy);
1044:
1045: for (p = line; *p != '\0'; p++) {
1046: if (*p == '\\') {
1047: if (p[1] == '#') {
1048: Buf_Addi(copy, line, p);
1049: Buf_AddChar(copy, '#');
1050: line = p+2;
1051: }
1052: if (p[1] != '\0')
1053: p++;
1054: } else if (*p == '#')
1055: break;
1056: }
1057: Buf_Addi(copy, line, p);
1058: return Buf_Retrieve(copy);
1059: }
1060: }
1061:
1062:
1063:
1.79 espie 1064: /***
1065: *** Support for various include constructs
1066: ***/
1067:
1068:
1.1 deraadt 1069: void
1.79 espie 1070: Parse_AddIncludeDir(const char *dir)
1.1 deraadt 1071: {
1.89 espie 1072: Dir_AddDir(userIncludePath, dir);
1.1 deraadt 1073: }
1074:
1.79 espie 1075: static char *
1.116 espie 1076: resolve_include_filename(const char *file, const char *efile, bool isSystem)
1.1 deraadt 1077: {
1.79 espie 1078: char *fullname;
1.87 espie 1079:
1.79 espie 1080: /* Look up system files on the system path first */
1081: if (isSystem) {
1.116 espie 1082: fullname = Dir_FindFileNoDoti(file, efile, systemIncludePath);
1.79 espie 1083: if (fullname)
1084: return fullname;
1085: }
1086:
1087: /* Handle non-system non-absolute files... */
1088: if (!isSystem && file[0] != '/') {
1.85 espie 1089: /* ... by looking first under the same directory as the
1.79 espie 1090: * current file */
1.100 espie 1091: char *slash = NULL;
1.79 espie 1092: const char *fname;
1093:
1094: fname = Parse_Getfilename();
1095:
1.100 espie 1096: if (fname != NULL)
1097: slash = strrchr(fname, '/');
1098:
1.79 espie 1099: if (slash != NULL) {
1100: char *newName;
1101:
1.116 espie 1102: newName = Str_concati(fname, slash, file, efile, '/');
1.89 espie 1103: fullname = Dir_FindFile(newName, userIncludePath);
1.79 espie 1104: if (fullname == NULL)
1.83 espie 1105: fullname = Dir_FindFile(newName, defaultPath);
1.79 espie 1106: free(newName);
1107: if (fullname)
1108: return fullname;
1109: }
1110: }
1.1 deraadt 1111:
1.79 espie 1112: /* Now look first on the -I search path, then on the .PATH
1113: * search path, if not found in a -I directory.
1114: * XXX: Suffix specific? */
1.116 espie 1115: fullname = Dir_FindFilei(file, efile, userIncludePath);
1.79 espie 1116: if (fullname)
1117: return fullname;
1.116 espie 1118: fullname = Dir_FindFilei(file, efile, defaultPath);
1.79 espie 1119: if (fullname)
1120: return fullname;
1.1 deraadt 1121:
1.79 espie 1122: /* Still haven't found the makefile. Look for it on the system
1123: * path as a last resort (if we haven't already). */
1124: if (isSystem)
1125: return NULL;
1126: else
1.116 espie 1127: return Dir_FindFilei(file, efile, systemIncludePath);
1.1 deraadt 1128: }
1129:
1130: static void
1.116 espie 1131: handle_include_file(const char *file, const char *efile, bool isSystem,
1.79 espie 1132: bool errIfNotFound)
1.1 deraadt 1133: {
1.79 espie 1134: char *fullname;
1135:
1.116 espie 1136: fullname = resolve_include_filename(file, efile, isSystem);
1.79 espie 1137: if (fullname == NULL && errIfNotFound)
1.116 espie 1138: Parse_Error(PARSE_FATAL, "Could not find %.*s",
1139: (int)(efile - file), file);
1.1 deraadt 1140:
1.79 espie 1141: if (fullname != NULL) {
1142: FILE *f;
1.59 espie 1143:
1.79 espie 1144: f = fopen(fullname, "r");
1145: if (f == NULL && errIfNotFound)
1146: Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
1147: else
1148: Parse_FromFile(fullname, f);
1149: }
1.59 espie 1150: }
1151:
1.79 espie 1152: /* .include <file> (system) or .include "file" (normal) */
1153: static bool
1154: lookup_bsd_include(const char *file)
1.59 espie 1155: {
1.85 espie 1156: char endc;
1.79 espie 1157: const char *efile;
1.116 espie 1158: char *file2;
1.79 espie 1159: bool isSystem;
1160:
1161: /* find starting delimiter */
1.110 espie 1162: while (ISSPACE(*file))
1.79 espie 1163: file++;
1164:
1165: /* determine type of file */
1166: if (*file == '<') {
1167: isSystem = true;
1168: endc = '>';
1169: } else if (*file == '"') {
1170: isSystem = false;
1171: endc = '"';
1172: } else {
1173: Parse_Error(PARSE_WARNING,
1174: ".include filename must be delimited by '\"' or '<'");
1175: return false;
1176: }
1.1 deraadt 1177:
1.79 espie 1178: /* delimit file name between file and efile */
1179: for (efile = ++file; *efile != endc; efile++) {
1180: if (*efile == '\0') {
1181: Parse_Error(PARSE_WARNING,
1182: "Unclosed .include filename. '%c' expected", endc);
1183: return false;
1184: }
1185: }
1.116 espie 1186: /* Substitute for any variables in the file name before trying to
1187: * find the thing. */
1188: file2 = Var_Substi(file, efile, NULL, false);
1189: handle_include_file(file2, strchr(file2, '\0'), isSystem, true);
1190: free(file2);
1.79 espie 1191: return true;
1192: }
1.1 deraadt 1193:
1194:
1.79 espie 1195: static void
1.116 espie 1196: lookup_sysv_style_include(const char *line, const char *directive,
1.79 espie 1197: bool errIfMissing)
1.50 espie 1198: {
1.116 espie 1199: char *file;
1200: char *name;
1201: char *ename;
1202: bool okay = false;
1203:
1204: /* Substitute for any variables in the file name before trying to
1205: * find the thing. */
1206: file = Var_Subst(line, NULL, false);
1207:
1208: /* sys5 allows for list of files separated by spaces */
1209: name = file;
1210: while (1) {
1211: /* find beginning of name */
1212: while (ISSPACE(*name))
1213: name++;
1214: if (*name == '\0')
1215: break;
1216: for (ename = name; *ename != '\0' && !ISSPACE(*ename);)
1217: ename++;
1218: handle_include_file(name, ename, true, errIfMissing);
1219: okay = true;
1220: name = ename;
1221: }
1.50 espie 1222:
1.116 espie 1223: free(file);
1224: if (!okay) {
1.79 espie 1225: Parse_Error(PARSE_FATAL, "Filename missing from \"%s\"",
1.116 espie 1226: directive);
1.50 espie 1227: }
1.70 espie 1228: }
1229:
1.79 espie 1230:
1231: /* system V construct: include file */
1.70 espie 1232: static void
1.79 espie 1233: lookup_sysv_include(const char *file, const char *directive)
1.70 espie 1234: {
1.79 espie 1235: lookup_sysv_style_include(file, directive, true);
1236: }
1.1 deraadt 1237:
1238:
1.79 espie 1239: /* sinclude file and -include file */
1240: static void
1241: lookup_conditional_include(const char *file, const char *directive)
1242: {
1243: lookup_sysv_style_include(file, directive, false);
1.1 deraadt 1244: }
1245:
1.59 espie 1246:
1.91 espie 1247: /***
1248: *** BSD-specific . constructs
1249: *** They all follow the same pattern:
1250: *** if the syntax matches BSD stuff, then we're committed to handle
1251: *** them and report fatal errors (like, include file not existing)
1252: *** otherwise, we return false, and hope somebody else will handle it.
1253: ***/
1254:
1.79 espie 1255: static bool
1256: handle_poison(const char *line)
1.72 espie 1257: {
1.79 espie 1258: const char *p = line;
1.72 espie 1259: int type = POISON_NORMAL;
1260: bool not = false;
1261: bool paren_to_match = false;
1.79 espie 1262: const char *name, *ename;
1.72 espie 1263:
1.110 espie 1264: while (ISSPACE(*p))
1.72 espie 1265: p++;
1266: if (*p == '!') {
1267: not = true;
1268: p++;
1269: }
1.110 espie 1270: while (ISSPACE(*p))
1.72 espie 1271: p++;
1272: if (strncmp(p, "defined", 7) == 0) {
1273: type = POISON_DEFINED;
1274: p += 7;
1275: } else if (strncmp(p, "empty", 5) == 0) {
1276: type = POISON_EMPTY;
1277: p += 5;
1278: }
1.110 espie 1279: while (ISSPACE(*p))
1.72 espie 1280: p++;
1281: if (*p == '(') {
1282: paren_to_match = true;
1283: p++;
1284: }
1.110 espie 1285: while (ISSPACE(*p))
1.72 espie 1286: p++;
1287: name = ename = p;
1.110 espie 1288: while (*p != '\0' && !ISSPACE(*p)) {
1.72 espie 1289: if (*p == ')' && paren_to_match) {
1290: paren_to_match = false;
1291: p++;
1292: break;
1293: }
1294: p++;
1295: ename = p;
1296: }
1.110 espie 1297: while (ISSPACE(*p))
1.72 espie 1298: p++;
1299: switch(type) {
1300: case POISON_NORMAL:
1301: case POISON_EMPTY:
1302: if (not)
1303: type = POISON_INVALID;
1304: break;
1305: case POISON_DEFINED:
1306: if (not)
1307: type = POISON_NOT_DEFINED;
1308: else
1309: type = POISON_INVALID;
1310: break;
1311: }
1.79 espie 1312: if ((*p != '\0' && *p != '#') || type == POISON_INVALID) {
1.85 espie 1313: Parse_Error(PARSE_WARNING, "Invalid syntax for .poison: %s",
1.72 espie 1314: line);
1.79 espie 1315: return false;
1316: } else {
1.118 espie 1317: Var_Mark(name, ename, type);
1.79 espie 1318: return true;
1319: }
1.72 espie 1320: }
1.59 espie 1321:
1.92 espie 1322:
1.61 espie 1323: static bool
1.79 espie 1324: handle_for_loop(Buffer linebuf, const char *line)
1.59 espie 1325: {
1.79 espie 1326: For *loop;
1.59 espie 1327:
1.91 espie 1328: loop = For_Eval(line);
1.79 espie 1329: if (loop != NULL) {
1330: bool ok;
1331: do {
1332: /* Find the matching endfor. */
1333: line = ParseReadLoopLine(linebuf);
1334: if (line == NULL) {
1335: Parse_Error(PARSE_FATAL,
1336: "Unexpected end of file in for loop.\n");
1337: return false;
1338: }
1339: ok = For_Accumulate(loop, line);
1340: } while (ok);
1341: For_Run(loop);
1342: return true;
1343: } else
1344: return false;
1345: }
1.59 espie 1346:
1.79 espie 1347: static bool
1348: handle_undef(const char *line)
1349: {
1350: const char *eline;
1.59 espie 1351:
1.110 espie 1352: while (ISSPACE(*line))
1.79 espie 1353: line++;
1.110 espie 1354: for (eline = line; !ISSPACE(*eline) && *eline != '\0';)
1.79 espie 1355: eline++;
1356: Var_Deletei(line, eline);
1.61 espie 1357: return true;
1.79 espie 1358: }
1.67 espie 1359:
1.92 espie 1360: /* global hub for the construct */
1.79 espie 1361: static bool
1362: handle_bsd_command(Buffer linebuf, Buffer copy, const char *line)
1363: {
1364: char *stripped;
1.59 espie 1365:
1.110 espie 1366: while (ISSPACE(*line))
1.79 espie 1367: line++;
1368:
1.91 espie 1369: /* delegate basic classification to the conditional module */
1.79 espie 1370: switch (Cond_Eval(line)) {
1371: case COND_SKIP:
1372: /* Skip to next conditional that evaluates to COND_PARSE. */
1373: do {
1374: line = Parse_ReadNextConditionalLine(linebuf);
1375: if (line != NULL) {
1.110 espie 1376: while (ISSPACE(*line))
1.79 espie 1377: line++;
1.121 jsg 1378: stripped = strip_comments(copy, line);
1.79 espie 1379: }
1380: } while (line != NULL && Cond_Eval(stripped) != COND_PARSE);
1381: /* FALLTHROUGH */
1382: case COND_PARSE:
1383: return true;
1.85 espie 1384: case COND_ISFOR:
1.91 espie 1385: return handle_for_loop(linebuf, line + 3);
1.79 espie 1386: case COND_ISINCLUDE:
1387: return lookup_bsd_include(line + 7);
1388: case COND_ISPOISON:
1.91 espie 1389: return handle_poison(line + 6);
1.85 espie 1390: case COND_ISUNDEF:
1.79 espie 1391: return handle_undef(line + 5);
1392: default:
1393: break;
1394: }
1.67 espie 1395:
1.79 espie 1396: return false;
1.59 espie 1397: }
1398:
1.114 espie 1399: /* postprocess group of targets prior to linking stuff with them */
1.117 espie 1400: static bool
1.114 espie 1401: register_target(GNode *gn, struct ohash *t)
1.113 espie 1402: {
1403: unsigned int slot;
1404: uint32_t hv;
1405: const char *ename = NULL;
1406: GNode *gn2;
1407:
1408: hv = ohash_interval(gn->name, &ename);
1409:
1.114 espie 1410: slot = ohash_lookup_interval(t, gn->name, ename, hv);
1411: gn2 = ohash_find(t, slot);
1.113 espie 1412:
1.114 espie 1413: if (gn2 == NULL) {
1414: ohash_insert(t, slot, gn);
1415: return true;
1416: } else
1417: return false;
1.113 espie 1418: }
1419:
1420: static void
1.114 espie 1421: build_target_group(struct growableArray *targets, struct ohash *t)
1.107 espie 1422: {
1423: LstNode ln;
1424: bool seen_target = false;
1.113 espie 1425: unsigned int i;
1.107 espie 1426:
1.113 espie 1427: /* may be 0 if wildcard expansion resulted in zero match */
1428: if (targets->n <= 1)
1.107 espie 1429: return;
1.114 espie 1430:
1431: /* Perform checks to see if we must tie targets together */
1.107 espie 1432: /* XXX */
1433: if (targets->a[0]->type & OP_TRANSFORM)
1434: return;
1.114 espie 1435:
1.107 espie 1436: for (ln = Lst_First(&targets->a[0]->commands); ln != NULL;
1437: ln = Lst_Adv(ln)) {
1438: struct command *cmd = Lst_Datum(ln);
1439: if (Var_Check_for_target(cmd->string)) {
1440: seen_target = true;
1441: break;
1442: }
1443: }
1444: if (DEBUG(TARGGROUP)) {
1445: fprintf(stderr,
1446: seen_target ? "No target group at %lu: ":
1447: "Target group at %lu:", Parse_Getlineno());
1448: for (i = 0; i < targets->n; i++)
1449: fprintf(stderr, " %s", targets->a[i]->name);
1450: fprintf(stderr, "\n");
1451: }
1452: if (seen_target)
1453: return;
1454:
1.114 espie 1455: GNode *gn, *gn2;
1456: /* targets may already participate in groupling lists,
1457: * so rebuild the circular list "from scratch"
1.113 espie 1458: */
1459:
1.107 espie 1460: for (i = 0; i < targets->n; i++) {
1.113 espie 1461: gn = targets->a[i];
1462: for (gn2 = gn->groupling; gn2 != gn; gn2 = gn2->groupling) {
1463: if (!gn2)
1464: break;
1.114 espie 1465: register_target(gn2, t);
1.113 espie 1466: }
1.107 espie 1467: }
1.113 espie 1468:
1.114 espie 1469: for (gn = ohash_first(t, &i); gn != NULL; gn = ohash_next(t, &i)) {
1.113 espie 1470: gn->groupling = gn2;
1471: gn2 = gn;
1472: }
1.114 espie 1473: gn = ohash_first(t, &i);
1.113 espie 1474: gn->groupling = gn2;
1.114 espie 1475: }
1476:
1477: static void
1478: reset_target_hash()
1479: {
1480: if (htargets_setup)
1481: ohash_delete(&htargets);
1482: ohash_init(&htargets, 5, &gnode_info);
1483: htargets_setup = true;
1484: }
1485:
1486: void
1487: Parse_End()
1488: {
1489: if (htargets_setup)
1490: ohash_delete(&htargets);
1491: }
1492:
1493: static void
1494: dedup_targets(struct growableArray *targets)
1495: {
1496: unsigned int i, j;
1.113 espie 1497:
1.114 espie 1498: if (targets->n <= 1)
1499: return;
1500:
1501: reset_target_hash();
1502: /* first let's de-dup the list */
1503: for (i = 0, j = 0; i < targets->n; i++) {
1504: GNode *gn = targets->a[i];
1505: if (register_target(gn, &htargets))
1506: targets->a[j++] = targets->a[i];
1507: }
1508: targets->n = j;
1.107 espie 1509: }
1510:
1.114 espie 1511:
1512: /***
1513: *** handle a group of commands
1514: ***/
1515:
1.107 espie 1516: static void
1.91 espie 1517: finish_commands(struct growableArray *targets)
1.1 deraadt 1518: {
1.114 espie 1519: build_target_group(targets, &htargets);
1.91 espie 1520: Array_Every(targets, ParseHasCommands);
1.1 deraadt 1521: }
1.11 millert 1522:
1.59 espie 1523: static void
1.91 espie 1524: parse_commands(struct growableArray *targets, const char *line)
1.59 espie 1525: {
1.86 espie 1526: /* add the command to the list of
1527: * commands of all targets in the dependency spec */
1.105 espie 1528:
1529: struct command *cmd;
1530: size_t len = strlen(line);
1531:
1532: cmd = emalloc(sizeof(struct command) + len);
1533: memcpy(&cmd->string, line, len+1);
1534: Parse_FillLocation(&cmd->location);
1535:
1.91 espie 1536: Array_ForEach(targets, ParseAddCmd, cmd);
1.59 espie 1537: }
1.1 deraadt 1538:
1.91 espie 1539: static bool
1540: parse_as_special_line(Buffer buf, Buffer copy, const char *line)
1541: {
1542: if (*line == '.' && handle_bsd_command(buf, copy, line+1))
1543: return true;
1544: if (FEATURES(FEATURE_SYSVINCLUDE) &&
1545: strncmp(line, "include", 7) == 0 &&
1.110 espie 1546: ISSPACE(line[7]) &&
1.91 espie 1547: strchr(line, ':') == NULL) {
1548: /* It's an S3/S5-style "include". */
1549: lookup_sysv_include(line + 7, "include");
1550: return true;
1551: }
1552: if (FEATURES(FEATURE_CONDINCLUDE) &&
1553: strncmp(line, "sinclude", 8) == 0 &&
1.110 espie 1554: ISSPACE(line[8]) &&
1.91 espie 1555: strchr(line, ':') == NULL) {
1556: lookup_conditional_include(line+8, "sinclude");
1557: return true;
1558: }
1559: if (FEATURES(FEATURE_CONDINCLUDE) &&
1560: strncmp(line, "-include", 8) == 0 &&
1.110 espie 1561: ISSPACE(line[8]) &&
1.91 espie 1562: strchr(line, ':') == NULL) {
1563: lookup_conditional_include(line+8, "-include");
1564: return true;
1565: }
1566: return false;
1567: }
1.1 deraadt 1568:
1.91 espie 1569: static void
1570: parse_target_line(struct growableArray *targets, const char *line,
1.107 espie 1571: const char *stripped, bool *pcommands_seen)
1.91 espie 1572: {
1573: size_t pos;
1574: char *end;
1575: char *cp;
1.105 espie 1576: char *cmd;
1.91 espie 1577:
1578: /* let's start a new set of commands */
1579: Array_Reset(targets);
1580:
1581: /* XXX this is a dirty heuristic to handle target: dep ; commands */
1.105 espie 1582: cmd = NULL;
1.91 espie 1583: /* First we need to find eventual dependencies */
1584: pos = strcspn(stripped, ":!");
1585: /* go over :!, and find ; */
1586: if (stripped[pos] != '\0' &&
1587: (end = strchr(stripped+pos+1, ';')) != NULL) {
1588: if (line != stripped)
1589: /* find matching ; in original... The
1590: * original might be slightly longer. */
1.105 espie 1591: cmd = strchr(line+(end-stripped), ';');
1.59 espie 1592: else
1.105 espie 1593: cmd = end;
1.91 espie 1594: /* kill end of line. */
1595: *end = '\0';
1596: }
1597: /* We now know it's a dependency line so it needs to
1598: * have all variables expanded before being parsed.
1599: */
1600: cp = Var_Subst(stripped, NULL, false);
1601: ParseDoDependency(cp);
1602: free(cp);
1603:
1.105 espie 1604: /* Parse command if it's not empty. */
1605: if (cmd != NULL) {
1.91 espie 1606: do {
1.105 espie 1607: cmd++;
1.110 espie 1608: } while (ISSPACE(*cmd));
1.107 espie 1609: if (*cmd != '\0') {
1.105 espie 1610: parse_commands(targets, cmd);
1.107 espie 1611: *pcommands_seen = true;
1612: }
1.91 espie 1613: }
1614: }
1615:
1616: void
1617: Parse_File(const char *filename, FILE *stream)
1618: {
1619: char *line;
1620: bool expectingCommands = false;
1.107 espie 1621: bool commands_seen = false;
1.11 millert 1622:
1.126 espie 1623: /* permanent spaces to shave time */
1624: static BUFFER buf;
1625: static BUFFER copy;
1.91 espie 1626:
1.126 espie 1627: Buf_Reinit(&buf, MAKE_BSIZE);
1628: Buf_Reinit(©, MAKE_BSIZE);
1.91 espie 1629:
1630: Parse_FromFile(filename, stream);
1631: do {
1632: while ((line = Parse_ReadNormalLine(&buf)) != NULL) {
1633: if (*line == '\t') {
1.107 espie 1634: if (expectingCommands) {
1635: commands_seen = true;
1.91 espie 1636: parse_commands(>argets, line+1);
1.107 espie 1637: } else
1.91 espie 1638: Parse_Error(PARSE_FATAL,
1639: "Unassociated shell command \"%s\"",
1640: line);
1641: } else {
1642: const char *stripped = strip_comments(©,
1643: line);
1644: if (!parse_as_special_line(&buf, ©,
1645: stripped)) {
1.107 espie 1646: if (commands_seen)
1.91 espie 1647: finish_commands(>argets);
1.107 espie 1648: commands_seen = false;
1.91 espie 1649: if (Parse_As_Var_Assignment(stripped))
1650: expectingCommands = false;
1651: else {
1652: parse_target_line(>argets,
1.107 espie 1653: line, stripped,
1654: &commands_seen);
1.91 espie 1655: expectingCommands = true;
1656: }
1657: }
1.59 espie 1658: }
1.1 deraadt 1659: }
1.91 espie 1660: } while (Parse_NextFile());
1.1 deraadt 1661:
1.107 espie 1662: if (commands_seen)
1.91 espie 1663: finish_commands(>argets);
1664: /* Make sure conditionals are clean. */
1665: Cond_End();
1666:
1667: Parse_ReportErrors();
1.1 deraadt 1668: }
1669:
1670: void
1.69 espie 1671: Parse_Init(void)
1.1 deraadt 1672: {
1.79 espie 1673: mainNode = NULL;
1.89 espie 1674: Static_Lst_Init(userIncludePath);
1675: Static_Lst_Init(systemIncludePath);
1.79 espie 1676: Array_Init(>argets, TARGETS_SIZE);
1.92 espie 1677: Array_Init(&gsources, SOURCES_SIZE);
1678: create_special_nodes();
1.1 deraadt 1679: }
1680:
1.44 espie 1681: void
1.69 espie 1682: Parse_MainName(Lst listmain) /* result list */
1.1 deraadt 1683: {
1.94 espie 1684: if (mainNode == NULL) {
1685: Punt("no target to make.");
1686: /*NOTREACHED*/
1687: } else if (mainNode->type & OP_DOUBLEDEP) {
1688: Lst_AtEnd(listmain, mainNode);
1689: Lst_Concat(listmain, &mainNode->cohorts);
1690: }
1691: else
1692: Lst_AtEnd(listmain, mainNode);
1.1 deraadt 1693: }
![[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