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