1 /* $NetBSD: make.h,v 1.298 2022/02/05 00:26:21 rillig Exp $ */
2
3 /*
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * from: @(#)make.h 8.3 (Berkeley) 6/13/95
35 */
36
37 /*
38 * Copyright (c) 1989 by Berkeley Softworks
39 * All rights reserved.
40 *
41 * This code is derived from software contributed to Berkeley by
42 * Adam de Boor.
43 *
44 * Redistribution and use in source and binary forms, with or without
45 * modification, are permitted provided that the following conditions
46 * are met:
47 * 1. Redistributions of source code must retain the above copyright
48 * notice, this list of conditions and the following disclaimer.
49 * 2. Redistributions in binary form must reproduce the above copyright
50 * notice, this list of conditions and the following disclaimer in the
51 * documentation and/or other materials provided with the distribution.
52 * 3. All advertising materials mentioning features or use of this software
53 * must display the following acknowledgement:
54 * This product includes software developed by the University of
55 * California, Berkeley and its contributors.
56 * 4. Neither the name of the University nor the names of its contributors
57 * may be used to endorse or promote products derived from this software
58 * without specific prior written permission.
59 *
60 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 * SUCH DAMAGE.
71 *
72 * from: @(#)make.h 8.3 (Berkeley) 6/13/95
73 */
74
75 /*
76 * make.h --
77 * The global definitions for make
78 */
79
80 #ifndef MAKE_MAKE_H
81 #define MAKE_MAKE_H
82
83 #ifdef HAVE_CONFIG_H
84 # include "config.h"
85 #endif
86
87 #include <sys/types.h>
88 #include <sys/param.h>
89 #include <sys/stat.h>
90
91 #include <assert.h>
92 #include <ctype.h>
93 #include <fcntl.h>
94 #include <stdarg.h>
95 #include <stdio.h>
96 #include <stdlib.h>
97 #ifdef HAVE_STRING_H
98 #include <string.h>
99 #else
100 #include <strings.h>
101 #endif
102 #include <unistd.h>
103 #include <sys/cdefs.h>
104
105 #ifndef FD_CLOEXEC
106 #define FD_CLOEXEC 1
107 #endif
108
109 #if defined(__GNUC__)
110 #define MAKE_GNUC_PREREQ(x, y) \
111 ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \
112 (__GNUC__ > (x)))
113 #else
114 #define MAKE_GNUC_PREREQ(x, y) 0
115 #endif
116
117 #if MAKE_GNUC_PREREQ(2, 7)
118 #define MAKE_ATTR_UNUSED __attribute__((__unused__))
119 #else
120 #define MAKE_ATTR_UNUSED /* delete */
121 #endif
122
123 #if MAKE_GNUC_PREREQ(2, 5)
124 #define MAKE_ATTR_DEAD __attribute__((__noreturn__))
125 #elif defined(__GNUC__)
126 #define MAKE_ATTR_DEAD __volatile
127 #else
128 #define MAKE_ATTR_DEAD /* delete */
129 #endif
130
131 #if MAKE_GNUC_PREREQ(2, 7)
132 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) \
133 __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
134 #else
135 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) /* delete */
136 #endif
137
138 #if MAKE_GNUC_PREREQ(4, 0)
139 #define MAKE_ATTR_USE __attribute__((__warn_unused_result__))
140 #else
141 #define MAKE_ATTR_USE /* delete */
142 #endif
143
144 #if __STDC__ >= 199901L || defined(lint)
145 #define MAKE_INLINE static inline MAKE_ATTR_UNUSED
146 #else
147 #define MAKE_INLINE static MAKE_ATTR_UNUSED
148 #endif
149
150 /* MAKE_STATIC marks a function that may or may not be inlined. */
151 #if defined(lint)
152 /* As of 2021-07-31, NetBSD lint ignores __attribute__((unused)). */
153 #define MAKE_STATIC MAKE_INLINE
154 #else
155 #define MAKE_STATIC static MAKE_ATTR_UNUSED
156 #endif
157
158 #if __STDC_VERSION__ >= 199901L || defined(lint) || defined(USE_C99_BOOLEAN)
159 #include <stdbool.h>
160 #elif defined(__bool_true_false_are_defined)
161 /*
162 * All files of make must be compiled with the same definition of bool.
163 * Since one of the files includes <stdbool.h>, that means the header is
164 * available on this platform. Recompile everything with -DUSE_C99_BOOLEAN.
165 */
166 #error "<stdbool.h> is included in pre-C99 mode"
167 #elif defined(bool) || defined(true) || defined(false)
168 /*
169 * In pre-C99 mode, make does not expect that bool is already defined.
170 * You need to ensure that all translation units use the same definition for
171 * bool.
172 */
173 #error "bool/true/false is defined in pre-C99 mode"
174 #else
175 typedef unsigned char bool;
176 #define true 1
177 #define false 0
178 #endif
179
180 #include "lst.h"
181 #include "make_malloc.h"
182 #include "str.h"
183 #include "hash.h"
184 #include "make-conf.h"
185 #include "buf.h"
186
187 /*
188 * some vendors don't have this --sjg
189 */
190 #if defined(S_IFDIR) && !defined(S_ISDIR)
191 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
192 #endif
193
194 #if defined(sun) && (defined(__svr4__) || defined(__SVR4))
195 # define POSIX_SIGNALS
196 #endif
197
198 /*
199 * The typical flow of states is:
200 *
201 * The direct successful path:
202 * UNMADE -> BEINGMADE -> MADE.
203 *
204 * The direct error path:
205 * UNMADE -> BEINGMADE -> ERROR.
206 *
207 * The successful path when dependencies need to be made first:
208 * UNMADE -> DEFERRED -> REQUESTED -> BEINGMADE -> MADE.
209 *
210 * A node that has dependencies, and one of the dependencies cannot be made:
211 * UNMADE -> DEFERRED -> ABORTED.
212 *
213 * A node that turns out to be up-to-date:
214 * UNMADE -> BEINGMADE -> UPTODATE.
215 */
216 typedef enum GNodeMade {
217 /* Not examined yet. */
218 UNMADE,
219 /*
220 * The node has been examined but is not yet ready since its
221 * dependencies have to be made first.
222 */
223 DEFERRED,
224
225 /* The node is on the toBeMade list. */
226 REQUESTED,
227
228 /*
229 * The node is already being made. Trying to build a node in this
230 * state indicates a cycle in the graph.
231 */
232 BEINGMADE,
233
234 /* Was out-of-date and has been made. */
235 MADE,
236 /* Was already up-to-date, does not need to be made. */
237 UPTODATE,
238 /*
239 * An error occurred while it was being made. Used only in compat
240 * mode.
241 */
242 ERROR,
243 /*
244 * The target was aborted due to an error making a dependency. Used
245 * only in compat mode.
246 */
247 ABORTED
248 } GNodeMade;
249
250 /*
251 * The OP_ constants are used when parsing a dependency line as a way of
252 * communicating to other parts of the program the way in which a target
253 * should be made.
254 *
255 * Some of the OP_ constants can be combined, others cannot.
256 *
257 * See the tests depsrc-*.mk and deptgt-*.mk.
258 */
259 typedef enum GNodeType {
260 OP_NONE = 0,
261
262 /*
263 * The dependency operator ':' is the most common one. The commands
264 * of this node are executed if any child is out-of-date.
265 */
266 OP_DEPENDS = 1 << 0,
267 /*
268 * The dependency operator '!' always executes its commands, even if
269 * its children are up-to-date.
270 */
271 OP_FORCE = 1 << 1,
272 /*
273 * The dependency operator '::' behaves like ':', except that it
274 * allows multiple dependency groups to be defined. Each of these
275 * groups is executed on its own, independently from the others. Each
276 * individual dependency group is called a cohort.
277 */
278 OP_DOUBLEDEP = 1 << 2,
279
280 /* Matches the dependency operators ':', '!' and '::'. */
281 OP_OPMASK = OP_DEPENDS | OP_FORCE | OP_DOUBLEDEP,
282
283 /* Don't care if the target doesn't exist and can't be created. */
284 OP_OPTIONAL = 1 << 3,
285 /* Use associated commands for parents. */
286 OP_USE = 1 << 4,
287 /*
288 * Target is never out of date, but always execute commands anyway.
289 * Its time doesn't matter, so it has none...sort of.
290 */
291 OP_EXEC = 1 << 5,
292 /*
293 * Ignore non-zero exit status from shell commands when creating the
294 * node.
295 */
296 OP_IGNORE = 1 << 6,
297 /* Don't remove the target when interrupted. */
298 OP_PRECIOUS = 1 << 7,
299 /* Don't echo commands when executed. */
300 OP_SILENT = 1 << 8,
301 /*
302 * Target is a recursive make so its commands should always be
303 * executed when it is out of date, regardless of the state of the -n
304 * or -t flags.
305 */
306 OP_MAKE = 1 << 9,
307 /*
308 * Target is out-of-date only if any of its children was out-of-date.
309 */
310 OP_JOIN = 1 << 10,
311 /* Assume the children of the node have been already made. */
312 OP_MADE = 1 << 11,
313 /* Special .BEGIN, .END or .INTERRUPT. */
314 OP_SPECIAL = 1 << 12,
315 /* Like .USE, only prepend commands. */
316 OP_USEBEFORE = 1 << 13,
317 /*
318 * The node is invisible to its parents. I.e. it doesn't show up in
319 * the parents' local variables (.IMPSRC, .ALLSRC).
320 */
321 OP_INVISIBLE = 1 << 14,
322 /*
323 * The node does not become the main target, even if it is the first
324 * target in the first makefile.
325 */
326 OP_NOTMAIN = 1 << 15,
327 /* Not a file target; run always. */
328 OP_PHONY = 1 << 16,
329 /* Don't search for the file in the path. */
330 OP_NOPATH = 1 << 17,
331 /*
332 * In a dependency line "target: source1 .WAIT source2", source1 is
333 * made first, including its children. Once that is finished,
334 * source2 is made, including its children. The .WAIT keyword may
335 * appear more than once in a single dependency declaration.
336 */
337 OP_WAIT = 1 << 18,
338 /* .NOMETA do not create a .meta file */
339 OP_NOMETA = 1 << 19,
340 /* .META we _do_ want a .meta file */
341 OP_META = 1 << 20,
342 /* Do not compare commands in .meta file */
343 OP_NOMETA_CMP = 1 << 21,
344 /* Possibly a submake node */
345 OP_SUBMAKE = 1 << 22,
346
347 /* Attributes applied by PMake */
348
349 /* The node is a transformation rule, such as ".c.o". */
350 OP_TRANSFORM = 1 << 30,
351 /* Target is a member of an archive */
352 /* XXX: How does this differ from OP_ARCHV? */
353 OP_MEMBER = 1 << 29,
354 /*
355 * The node is a library, its name has the form "-l<libname>".
356 */
357 OP_LIB = 1 << 28,
358 /*
359 * The node is an archive member, its name has the form
360 * "archive(member)".
361 */
362 /* XXX: How does this differ from OP_MEMBER? */
363 OP_ARCHV = 1 << 27,
364 /*
365 * Target has all the commands it should. Used when parsing to catch
366 * multiple command groups for a target. Only applies to the
367 * dependency operators ':' and '!', but not to '::'.
368 */
369 OP_HAS_COMMANDS = 1 << 26,
370 /*
371 * The special command "..." has been seen. All further commands from
372 * this node will be saved on the .END node instead, to be executed
373 * at the very end.
374 */
375 OP_SAVE_CMDS = 1 << 25,
376 /*
377 * Already processed by Suff_FindDeps, to find dependencies from
378 * suffix transformation rules.
379 */
380 OP_DEPS_FOUND = 1 << 24,
381 /* Node found while expanding .ALLSRC */
382 OP_MARK = 1 << 23
383 } GNodeType;
384
385 typedef struct GNodeFlags {
386 /* this target needs to be (re)made */
387 bool remake:1;
388 /* children of this target were made */
389 bool childMade:1;
390 /* children don't exist, and we pretend made */
391 bool force:1;
392 /* Set by Make_ProcessWait() */
393 bool doneWait:1;
394 /* Build requested by .ORDER processing */
395 bool doneOrder:1;
396 /* Node created from .depend */
397 bool fromDepend:1;
398 /* We do it once only */
399 bool doneAllsrc:1;
400 /* Used by MakePrintStatus */
401 bool cycle:1;
402 /* Used by MakePrintStatus */
403 bool doneCycle:1;
404 } GNodeFlags;
405
406 typedef struct List StringList;
407 typedef struct ListNode StringListNode;
408
409 typedef struct List GNodeList;
410 typedef struct ListNode GNodeListNode;
411
412 typedef struct SearchPath {
413 List /* of CachedDir */ dirs;
414 } SearchPath;
415
416 /*
417 * A graph node represents a target that can possibly be made, including its
418 * relation to other targets and a lot of other details.
419 */
420 typedef struct GNode {
421 /* The target's name, such as "clean" or "make.c" */
422 char *name;
423 /* The unexpanded name of a .USE node */
424 char *uname;
425 /*
426 * The full pathname of the file belonging to the target.
427 *
428 * XXX: What about .PHONY targets? These don't have an associated
429 * path.
430 */
431 char *path;
432
433 /*
434 * The type of operator used to define the sources (see the OP flags
435 * below).
436 *
437 * XXX: This looks like a wild mixture of type and flags.
438 */
439 GNodeType type;
440 GNodeFlags flags;
441
442 /* The state of processing on this node */
443 GNodeMade made;
444 /* The number of unmade children */
445 int unmade;
446
447 /*
448 * The modification time; 0 means the node does not have a
449 * corresponding file; see GNode_IsOODate.
450 */
451 time_t mtime;
452 struct GNode *youngestChild;
453
454 /*
455 * The GNodes for which this node is an implied source. May be empty.
456 * For example, when there is an inference rule for .c.o, the node
457 * for file.c has the node for file.o in this list.
458 */
459 GNodeList implicitParents;
460
461 /*
462 * The nodes that depend on this one, or in other words, the nodes
463 * for which this is a source.
464 */
465 GNodeList parents;
466 /* The nodes on which this one depends. */
467 GNodeList children;
468
469 /*
470 * .ORDER nodes we need made. The nodes that must be made (if they're
471 * made) before this node can be made, but that do not enter into the
472 * datedness of this node.
473 */
474 GNodeList order_pred;
475 /*
476 * .ORDER nodes who need us. The nodes that must be made (if they're
477 * made at all) after this node is made, but that do not depend on
478 * this node, in the normal sense.
479 */
480 GNodeList order_succ;
481
482 /*
483 * Other nodes of the same name, for targets that were defined using
484 * the '::' dependency operator (OP_DOUBLEDEP).
485 */
486 GNodeList cohorts;
487 /* The "#n" suffix for this cohort, or "" for other nodes */
488 char cohort_num[8];
489 /* The number of unmade instances on the cohorts list */
490 int unmade_cohorts;
491 /*
492 * Pointer to the first instance of a '::' node; only set when on a
493 * cohorts list
494 */
495 struct GNode *centurion;
496
497 /* Last time (sequence number) we tried to make this node */
498 unsigned int checked_seqno;
499
500 /*
501 * The "local" variables that are specific to this target and this
502 * target only, such as $@, $<, $?.
503 *
504 * Also used for the global variable scopes SCOPE_GLOBAL,
505 * SCOPE_CMDLINE, SCOPE_INTERNAL, which contain variables with
506 * arbitrary names.
507 */
508 HashTable /* of Var pointer */ vars;
509
510 /* The commands to be given to a shell to create this target. */
511 StringList commands;
512
513 /*
514 * Suffix for the node (determined by Suff_FindDeps and opaque to
515 * everyone but the Suff module)
516 */
517 struct Suffix *suffix;
518
519 /* Filename where the GNode got defined, unlimited lifetime */
520 const char *fname;
521 /* Line number where the GNode got defined, 1-based */
522 unsigned lineno;
523 } GNode;
524
525 /* Error levels for diagnostics during parsing. */
526 typedef enum ParseErrorLevel {
527 /*
528 * Exit when the current top-level makefile has been parsed
529 * completely.
530 */
531 PARSE_FATAL = 1,
532 /* Print "warning"; may be upgraded to fatal by the -w option. */
533 PARSE_WARNING,
534 /* Informational, mainly used during development of makefiles. */
535 PARSE_INFO
536 } ParseErrorLevel;
537
538 /*
539 * Values returned by Cond_EvalLine and Cond_EvalCondition.
540 */
541 typedef enum CondResult {
542 CR_TRUE, /* Parse the next lines */
543 CR_FALSE, /* Skip the next lines */
544 CR_ERROR /* Unknown directive or parse error */
545 } CondResult;
546
547 /* Names of the variables that are "local" to a specific target. */
548 #define TARGET "@" /* Target of dependency */
549 #define OODATE "?" /* All out-of-date sources */
550 #define ALLSRC ">" /* All sources */
551 #define IMPSRC "<" /* Source implied by transformation */
552 #define PREFIX "*" /* Common prefix */
553 #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
554 #define MEMBER "%" /* Member in "archive(member)" syntax */
555
556 /*
557 * Global Variables
558 */
559
560 /* True if every target is precious */
561 extern bool allPrecious;
562 /* True if failed targets should be deleted */
563 extern bool deleteOnError;
564 /* true while processing .depend */
565 extern bool doing_depend;
566 /* .DEFAULT rule */
567 extern GNode *defaultNode;
568
569 /*
570 * Variables defined internally by make which should not override those set
571 * by makefiles.
572 */
573 extern GNode *SCOPE_INTERNAL;
574 /* Variables defined in a global scope, e.g in the makefile itself. */
575 extern GNode *SCOPE_GLOBAL;
576 /* Variables defined on the command line. */
577 extern GNode *SCOPE_CMDLINE;
578
579 /*
580 * Value returned by Var_Parse when an error is encountered. It actually
581 * points to an empty string, so naive callers needn't worry about it.
582 */
583 extern char var_Error[];
584
585 /* The time at the start of this whole process */
586 extern time_t now;
587
588 /*
589 * The list of directories to search when looking for targets (set by the
590 * special target .PATH).
591 */
592 extern SearchPath dirSearchPath;
593 /* Used for .include "...". */
594 extern SearchPath *parseIncPath;
595 /*
596 * Used for .include <...>, for the built-in sys.mk and for makefiles from
597 * the command line arguments.
598 */
599 extern SearchPath *sysIncPath;
600 /* The default for sysIncPath. */
601 extern SearchPath *defSysIncPath;
602
603 /* Startup directory */
604 extern char curdir[];
605 /* The basename of the program name, suffixed with [n] for sub-makes. */
606 extern const char *progname;
607 extern int makelevel;
608 /* Name of the .depend makefile */
609 extern char *makeDependfile;
610 /* If we replaced environ, this will be non-NULL. */
611 extern char **savedEnv;
612 extern GNode *mainNode;
613
614 extern pid_t myPid;
615
616 #define MAKEFLAGS ".MAKEFLAGS"
617 #define MAKEOVERRIDES ".MAKEOVERRIDES"
618 /* prefix when printing the target of a job */
619 #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX"
620 #define MAKE_EXPORTED ".MAKE.EXPORTED" /* exported variables */
621 #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all loaded makefiles */
622 #define MAKE_LEVEL ".MAKE.LEVEL" /* recursion level */
623 #define MAKE_MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
624 #define MAKE_DEPENDFILE ".MAKE.DEPENDFILE" /* .depend */
625 #define MAKE_MODE ".MAKE.MODE"
626 #ifndef MAKE_LEVEL_ENV
627 # define MAKE_LEVEL_ENV "MAKELEVEL"
628 #endif
629
630 typedef struct DebugFlags {
631 bool DEBUG_ARCH:1;
632 bool DEBUG_COND:1;
633 bool DEBUG_CWD:1;
634 bool DEBUG_DIR:1;
635 bool DEBUG_ERROR:1;
636 bool DEBUG_FOR:1;
637 bool DEBUG_GRAPH1:1;
638 bool DEBUG_GRAPH2:1;
639 bool DEBUG_GRAPH3:1;
640 bool DEBUG_HASH:1;
641 bool DEBUG_JOB:1;
642 bool DEBUG_LOUD:1;
643 bool DEBUG_MAKE:1;
644 bool DEBUG_META:1;
645 bool DEBUG_PARSE:1;
646 bool DEBUG_SCRIPT:1;
647 bool DEBUG_SHELL:1;
648 bool DEBUG_SUFF:1;
649 bool DEBUG_TARG:1;
650 bool DEBUG_VAR:1;
651 } DebugFlags;
652
653 #define CONCAT(a, b) a##b
654
655 #define DEBUG(module) (opts.debug.CONCAT(DEBUG_, module))
656
657 void debug_printf(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
658
659 #define DEBUG_IMPL(module, args) \
660 do { \
661 if (DEBUG(module)) \
662 debug_printf args; \
663 } while (false)
664
665 #define DEBUG0(module, fmt) \
666 DEBUG_IMPL(module, (fmt))
667 #define DEBUG1(module, fmt, arg1) \
668 DEBUG_IMPL(module, (fmt, arg1))
669 #define DEBUG2(module, fmt, arg1, arg2) \
670 DEBUG_IMPL(module, (fmt, arg1, arg2))
671 #define DEBUG3(module, fmt, arg1, arg2, arg3) \
672 DEBUG_IMPL(module, (fmt, arg1, arg2, arg3))
673 #define DEBUG4(module, fmt, arg1, arg2, arg3, arg4) \
674 DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4))
675 #define DEBUG5(module, fmt, arg1, arg2, arg3, arg4, arg5) \
676 DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4, arg5))
677
678 typedef enum PrintVarsMode {
679 PVM_NONE,
680 PVM_UNEXPANDED,
681 PVM_EXPANDED
682 } PrintVarsMode;
683
684 /* Command line options */
685 typedef struct CmdOpts {
686 /* -B: whether we are make compatible */
687 bool compatMake;
688
689 /*
690 * -d: debug control: There is one bit per module. It is up to the
691 * module what debug information to print.
692 */
693 DebugFlags debug;
694
695 /* -df: debug output is written here - default stderr */
696 FILE *debug_file;
697
698 /*
699 * -dL: lint mode
700 *
701 * Runs make in strict mode, with additional checks and better error
702 * handling.
703 */
704 bool strict;
705
706 /* -dV: for the -V option, print unexpanded variable values */
707 bool debugVflag;
708
709 /* -e: check environment variables before global variables */
710 bool checkEnvFirst;
711
712 /* -f: the makefiles to read */
713 StringList makefiles;
714
715 /* -i: if true, ignore all errors from shell commands */
716 bool ignoreErrors;
717
718 /*
719 * -j: the maximum number of jobs that can run in parallel; this is
720 * coordinated with the submakes
721 */
722 int maxJobs;
723
724 /*
725 * -k: if true and an error occurs while making a node, continue
726 * making nodes that do not depend on the erroneous node
727 */
728 bool keepgoing;
729
730 /* -N: execute no commands from the targets */
731 bool noRecursiveExecute;
732
733 /* -n: execute almost no commands from the targets */
734 bool noExecute;
735
736 /*
737 * -q: if true, do not really make anything, just see if the targets
738 * are out-of-date
739 */
740 bool query;
741
742 /* -r: raw mode, do not load the builtin rules. */
743 bool noBuiltins;
744
745 /* -s: don't echo the shell commands before executing them */
746 bool silent;
747
748 /*
749 * -t: touch the targets if they are out-of-date, but don't actually
750 * make them
751 */
752 bool touch;
753
754 /* -[Vv]: print expanded or unexpanded selected variables */
755 PrintVarsMode printVars;
756 /* -[Vv]: the variables to print */
757 StringList variables;
758
759 /* -W: if true, makefile parsing warnings are treated as errors */
760 bool parseWarnFatal;
761
762 /* -w: print 'Entering' and 'Leaving' for submakes */
763 bool enterFlag;
764
765 /*
766 * -X: if true, do not export variables set on the command line to
767 * the environment.
768 */
769 bool varNoExportEnv;
770
771 /*
772 * The target names specified on the command line. Used to resolve
773 * .if make(...) statements.
774 */
775 StringList create;
776
777 } CmdOpts;
778
779 extern CmdOpts opts;
780
781 /* arch.c */
782 void Arch_Init(void);
783 void Arch_End(void);
784
785 bool Arch_ParseArchive(char **, GNodeList *, GNode *);
786 void Arch_Touch(GNode *);
787 void Arch_TouchLib(GNode *);
788 void Arch_UpdateMTime(GNode *gn);
789 void Arch_UpdateMemberMTime(GNode *gn);
790 void Arch_FindLib(GNode *, SearchPath *);
791 bool Arch_LibOODate(GNode *) MAKE_ATTR_USE;
792 bool Arch_IsLib(GNode *) MAKE_ATTR_USE;
793
794 /* compat.c */
795 bool Compat_RunCommand(const char *, GNode *, StringListNode *);
796 void Compat_Run(GNodeList *);
797 void Compat_Make(GNode *, GNode *);
798
799 /* cond.c */
800 CondResult Cond_EvalCondition(const char *) MAKE_ATTR_USE;
801 CondResult Cond_EvalLine(const char *) MAKE_ATTR_USE;
802 void Cond_restore_depth(unsigned int);
803 unsigned int Cond_save_depth(void) MAKE_ATTR_USE;
804
805 /* dir.c; see also dir.h */
806
807 MAKE_INLINE const char * MAKE_ATTR_USE
str_basename(const char * pathname)808 str_basename(const char *pathname)
809 {
810 const char *lastSlash = strrchr(pathname, '/');
811 return lastSlash != NULL ? lastSlash + 1 : pathname;
812 }
813
814 MAKE_INLINE SearchPath * MAKE_ATTR_USE
SearchPath_New(void)815 SearchPath_New(void)
816 {
817 SearchPath *path = bmake_malloc(sizeof *path);
818 Lst_Init(&path->dirs);
819 return path;
820 }
821
822 void SearchPath_Free(SearchPath *);
823
824 /* for.c */
825 struct ForLoop;
826 int For_Eval(const char *) MAKE_ATTR_USE;
827 bool For_Accum(const char *, int *) MAKE_ATTR_USE;
828 void For_Run(unsigned, unsigned);
829 bool For_NextIteration(struct ForLoop *, Buffer *);
830 char *ForLoop_Details(struct ForLoop *);
831 void ForLoop_Free(struct ForLoop *);
832
833 /* job.c */
834 void JobReapChild(pid_t, int, bool);
835
836 /* main.c */
837 void Main_ParseArgLine(const char *);
838 char *Cmd_Exec(const char *, char **) MAKE_ATTR_USE;
839 void Error(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
840 void Fatal(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
841 void Punt(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
842 void DieHorribly(void) MAKE_ATTR_DEAD;
843 void Finish(int) MAKE_ATTR_DEAD;
844 bool unlink_file(const char *) MAKE_ATTR_USE;
845 void execDie(const char *, const char *);
846 char *getTmpdir(void) MAKE_ATTR_USE;
847 bool ParseBoolean(const char *, bool) MAKE_ATTR_USE;
848 const char *cached_realpath(const char *, char *);
849 bool GetBooleanExpr(const char *, bool);
850
851 /* parse.c */
852 void Parse_Init(void);
853 void Parse_End(void);
854
855 void PrintLocation(FILE *, bool, const char *, unsigned);
856 void PrintStackTrace(bool);
857 void Parse_Error(ParseErrorLevel, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
858 bool Parse_VarAssign(const char *, bool, GNode *) MAKE_ATTR_USE;
859 void Parse_AddIncludeDir(const char *);
860 void Parse_File(const char *, int);
861 void Parse_PushInput(const char *, unsigned, unsigned, Buffer,
862 struct ForLoop *);
863 void Parse_MainName(GNodeList *);
864 int Parse_NumErrors(void) MAKE_ATTR_USE;
865
866
867 /* suff.c */
868 void Suff_Init(void);
869 void Suff_End(void);
870
871 void Suff_ClearSuffixes(void);
872 bool Suff_IsTransform(const char *) MAKE_ATTR_USE;
873 GNode *Suff_AddTransform(const char *);
874 void Suff_EndTransform(GNode *);
875 void Suff_AddSuffix(const char *);
876 SearchPath *Suff_GetPath(const char *) MAKE_ATTR_USE;
877 void Suff_ExtendPaths(void);
878 void Suff_AddInclude(const char *);
879 void Suff_AddLib(const char *);
880 void Suff_FindDeps(GNode *);
881 SearchPath *Suff_FindPath(GNode *) MAKE_ATTR_USE;
882 void Suff_SetNull(const char *);
883 void Suff_PrintAll(void);
884 char *Suff_NamesStr(void) MAKE_ATTR_USE;
885
886 /* targ.c */
887 void Targ_Init(void);
888 void Targ_End(void);
889
890 void Targ_Stats(void);
891 GNodeList *Targ_List(void) MAKE_ATTR_USE;
892 GNode *GNode_New(const char *) MAKE_ATTR_USE;
893 GNode *Targ_FindNode(const char *) MAKE_ATTR_USE;
894 GNode *Targ_GetNode(const char *) MAKE_ATTR_USE;
895 GNode *Targ_NewInternalNode(const char *) MAKE_ATTR_USE;
896 GNode *Targ_GetEndNode(void);
897 void Targ_FindList(GNodeList *, StringList *);
898 void Targ_PrintCmds(GNode *);
899 void Targ_PrintNode(GNode *, int);
900 void Targ_PrintNodes(GNodeList *, int);
901 const char *Targ_FmtTime(time_t) MAKE_ATTR_USE;
902 void Targ_PrintType(GNodeType);
903 void Targ_PrintGraph(int);
904 void Targ_Propagate(void);
905 const char *GNodeMade_Name(GNodeMade) MAKE_ATTR_USE;
906
907 /* var.c */
908 void Var_Init(void);
909 void Var_End(void);
910
911 typedef enum VarEvalMode {
912
913 /*
914 * Only parse the expression but don't evaluate any part of it.
915 *
916 * TODO: Document what Var_Parse and Var_Subst return in this mode.
917 * As of 2021-03-15, they return unspecified, inconsistent results.
918 */
919 VARE_PARSE_ONLY,
920
921 /* Parse and evaluate the expression. */
922 VARE_WANTRES,
923
924 /*
925 * Parse and evaluate the expression. It is an error if a
926 * subexpression evaluates to undefined.
927 */
928 VARE_UNDEFERR,
929
930 /*
931 * Parse and evaluate the expression. Keep '$$' as '$$' instead of
932 * reducing it to a single '$'. Subexpressions that evaluate to
933 * undefined expand to an empty string.
934 *
935 * Used in variable assignments using the ':=' operator. It allows
936 * multiple such assignments to be chained without accidentally
937 * expanding '$$file' to '$file' in the first assignment and
938 * interpreting it as '${f}' followed by 'ile' in the next assignment.
939 */
940 VARE_EVAL_KEEP_DOLLAR,
941
942 /*
943 * Parse and evaluate the expression. Keep undefined variables as-is
944 * instead of expanding them to an empty string.
945 *
946 * Example for a ':=' assignment:
947 * CFLAGS = $(.INCLUDES)
948 * CFLAGS := -I.. $(CFLAGS)
949 * # If .INCLUDES (an undocumented special variable, by the
950 * # way) is still undefined, the updated CFLAGS becomes
951 * # "-I.. $(.INCLUDES)".
952 */
953 VARE_EVAL_KEEP_UNDEF,
954
955 /*
956 * Parse and evaluate the expression. Keep '$$' as '$$' and preserve
957 * undefined subexpressions.
958 */
959 VARE_KEEP_DOLLAR_UNDEF
960 } VarEvalMode;
961
962 typedef enum VarSetFlags {
963 VAR_SET_NONE = 0,
964
965 /* do not export */
966 VAR_SET_NO_EXPORT = 1 << 0,
967
968 /*
969 * Make the variable read-only. No further modification is possible,
970 * except for another call to Var_Set with the same flag.
971 */
972 VAR_SET_READONLY = 1 << 1
973 } VarSetFlags;
974
975 /* The state of error handling returned by Var_Parse. */
976 typedef enum VarParseResult {
977
978 /* Both parsing and evaluation succeeded. */
979 VPR_OK,
980
981 /* Parsing or evaluating failed, with an error message. */
982 VPR_ERR,
983
984 /*
985 * Parsing succeeded, undefined expressions are allowed and the
986 * expression was still undefined after applying all modifiers.
987 * No error message is printed in this case.
988 *
989 * Some callers handle this case differently, so return this
990 * information to them, for now.
991 *
992 * TODO: Instead of having this special return value, rather ensure
993 * that VARE_EVAL_KEEP_UNDEF is processed properly.
994 */
995 VPR_UNDEF
996
997 } VarParseResult;
998
999 typedef enum VarExportMode {
1000 /* .export-env */
1001 VEM_ENV,
1002 /* .export: Initial export or update an already exported variable. */
1003 VEM_PLAIN,
1004 /* .export-literal: Do not expand the variable value. */
1005 VEM_LITERAL
1006 } VarExportMode;
1007
1008 void Var_Delete(GNode *, const char *);
1009 void Var_Undef(const char *);
1010 void Var_Set(GNode *, const char *, const char *);
1011 void Var_SetExpand(GNode *, const char *, const char *);
1012 void Var_SetWithFlags(GNode *, const char *, const char *, VarSetFlags);
1013 void Var_Append(GNode *, const char *, const char *);
1014 void Var_AppendExpand(GNode *, const char *, const char *);
1015 bool Var_Exists(GNode *, const char *) MAKE_ATTR_USE;
1016 bool Var_ExistsExpand(GNode *, const char *) MAKE_ATTR_USE;
1017 FStr Var_Value(GNode *, const char *) MAKE_ATTR_USE;
1018 const char *GNode_ValueDirect(GNode *, const char *) MAKE_ATTR_USE;
1019 VarParseResult Var_Parse(const char **, GNode *, VarEvalMode, FStr *);
1020 VarParseResult Var_Subst(const char *, GNode *, VarEvalMode, char **);
1021 void Var_Expand(FStr *, GNode *, VarEvalMode);
1022 void Var_Stats(void);
1023 void Var_Dump(GNode *);
1024 void Var_ReexportVars(void);
1025 void Var_Export(VarExportMode, const char *);
1026 void Var_ExportVars(const char *);
1027 void Var_UnExport(bool, const char *);
1028
1029 void Global_Set(const char *, const char *);
1030 void Global_Append(const char *, const char *);
1031 void Global_Delete(const char *);
1032
1033 /* util.c */
1034 typedef void (*SignalProc)(int);
1035 SignalProc bmake_signal(int, SignalProc);
1036
1037 /* make.c */
1038 void GNode_UpdateYoungestChild(GNode *, GNode *);
1039 bool GNode_IsOODate(GNode *) MAKE_ATTR_USE;
1040 void Make_ExpandUse(GNodeList *);
1041 time_t Make_Recheck(GNode *) MAKE_ATTR_USE;
1042 void Make_HandleUse(GNode *, GNode *);
1043 void Make_Update(GNode *);
1044 void GNode_SetLocalVars(GNode *);
1045 bool Make_Run(GNodeList *);
1046 bool shouldDieQuietly(GNode *, int) MAKE_ATTR_USE;
1047 void PrintOnError(GNode *, const char *);
1048 void Main_ExportMAKEFLAGS(bool);
1049 bool Main_SetObjdir(bool, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
1050 int mkTempFile(const char *, char *, size_t) MAKE_ATTR_USE;
1051 int str2Lst_Append(StringList *, char *);
1052 void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
1053 bool GNode_ShouldExecute(GNode *gn) MAKE_ATTR_USE;
1054
1055 /* See if the node was seen on the left-hand side of a dependency operator. */
1056 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsTarget(const GNode * gn)1057 GNode_IsTarget(const GNode *gn)
1058 {
1059 return (gn->type & OP_OPMASK) != OP_NONE;
1060 }
1061
1062 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_Path(const GNode * gn)1063 GNode_Path(const GNode *gn)
1064 {
1065 return gn->path != NULL ? gn->path : gn->name;
1066 }
1067
1068 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsWaitingFor(const GNode * gn)1069 GNode_IsWaitingFor(const GNode *gn)
1070 {
1071 return gn->flags.remake && gn->made <= REQUESTED;
1072 }
1073
1074 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsReady(const GNode * gn)1075 GNode_IsReady(const GNode *gn)
1076 {
1077 return gn->made > DEFERRED;
1078 }
1079
1080 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsDone(const GNode * gn)1081 GNode_IsDone(const GNode *gn)
1082 {
1083 return gn->made >= MADE;
1084 }
1085
1086 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsError(const GNode * gn)1087 GNode_IsError(const GNode *gn)
1088 {
1089 return gn->made == ERROR || gn->made == ABORTED;
1090 }
1091
1092 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsMainCandidate(const GNode * gn)1093 GNode_IsMainCandidate(const GNode *gn)
1094 {
1095 return (gn->type & (OP_NOTMAIN | OP_USE | OP_USEBEFORE |
1096 OP_EXEC | OP_TRANSFORM)) == 0;
1097 }
1098
1099 /* Return whether the target file should be preserved on interrupt. */
1100 MAKE_INLINE bool MAKE_ATTR_USE
GNode_IsPrecious(const GNode * gn)1101 GNode_IsPrecious(const GNode *gn)
1102 {
1103 /* XXX: Why are '::' targets precious? */
1104 return allPrecious || gn->type & (OP_PRECIOUS | OP_DOUBLEDEP);
1105 }
1106
1107 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarTarget(GNode * gn)1108 GNode_VarTarget(GNode *gn) { return GNode_ValueDirect(gn, TARGET); }
1109 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarOodate(GNode * gn)1110 GNode_VarOodate(GNode *gn) { return GNode_ValueDirect(gn, OODATE); }
1111 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarAllsrc(GNode * gn)1112 GNode_VarAllsrc(GNode *gn) { return GNode_ValueDirect(gn, ALLSRC); }
1113 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarImpsrc(GNode * gn)1114 GNode_VarImpsrc(GNode *gn) { return GNode_ValueDirect(gn, IMPSRC); }
1115 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarPrefix(GNode * gn)1116 GNode_VarPrefix(GNode *gn) { return GNode_ValueDirect(gn, PREFIX); }
1117 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarArchive(GNode * gn)1118 GNode_VarArchive(GNode *gn) { return GNode_ValueDirect(gn, ARCHIVE); }
1119 MAKE_INLINE const char * MAKE_ATTR_USE
GNode_VarMember(GNode * gn)1120 GNode_VarMember(GNode *gn) { return GNode_ValueDirect(gn, MEMBER); }
1121
1122 MAKE_INLINE void * MAKE_ATTR_USE
UNCONST(const void * ptr)1123 UNCONST(const void *ptr)
1124 {
1125 void *ret;
1126 memcpy(&ret, &ptr, sizeof(ret));
1127 return ret;
1128 }
1129
1130 /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
1131 #ifdef HAVE_LIMITS_H
1132 #include <limits.h>
1133 #endif
1134 #ifndef MAXPATHLEN
1135 #define MAXPATHLEN BMAKE_PATH_MAX
1136 #endif
1137 #ifndef PATH_MAX
1138 #define PATH_MAX MAXPATHLEN
1139 #endif
1140
1141 #if defined(SYSV)
1142 #define KILLPG(pid, sig) kill(-(pid), (sig))
1143 #else
1144 #define KILLPG(pid, sig) killpg((pid), (sig))
1145 #endif
1146
1147 MAKE_INLINE bool MAKE_ATTR_USE
ch_isalnum(char ch)1148 ch_isalnum(char ch) { return isalnum((unsigned char)ch) != 0; }
1149 MAKE_INLINE bool MAKE_ATTR_USE
ch_isalpha(char ch)1150 ch_isalpha(char ch) { return isalpha((unsigned char)ch) != 0; }
1151 MAKE_INLINE bool MAKE_ATTR_USE
ch_isdigit(char ch)1152 ch_isdigit(char ch) { return isdigit((unsigned char)ch) != 0; }
1153 MAKE_INLINE bool MAKE_ATTR_USE
ch_islower(char ch)1154 ch_islower(char ch) { return islower((unsigned char)ch) != 0; }
1155 MAKE_INLINE bool MAKE_ATTR_USE
ch_isspace(char ch)1156 ch_isspace(char ch) { return isspace((unsigned char)ch) != 0; }
1157 MAKE_INLINE bool MAKE_ATTR_USE
ch_isupper(char ch)1158 ch_isupper(char ch) { return isupper((unsigned char)ch) != 0; }
1159 MAKE_INLINE char MAKE_ATTR_USE
ch_tolower(char ch)1160 ch_tolower(char ch) { return (char)tolower((unsigned char)ch); }
1161 MAKE_INLINE char MAKE_ATTR_USE
ch_toupper(char ch)1162 ch_toupper(char ch) { return (char)toupper((unsigned char)ch); }
1163
1164 MAKE_INLINE void
cpp_skip_whitespace(const char ** pp)1165 cpp_skip_whitespace(const char **pp)
1166 {
1167 while (ch_isspace(**pp))
1168 (*pp)++;
1169 }
1170
1171 MAKE_INLINE void
cpp_skip_hspace(const char ** pp)1172 cpp_skip_hspace(const char **pp)
1173 {
1174 while (**pp == ' ' || **pp == '\t')
1175 (*pp)++;
1176 }
1177
1178 MAKE_INLINE bool
cpp_skip_string(const char ** pp,const char * s)1179 cpp_skip_string(const char **pp, const char *s)
1180 {
1181 const char *p = *pp;
1182 while (*p == *s && *s != '\0')
1183 p++, s++;
1184 if (*s == '\0')
1185 *pp = p;
1186 return *s == '\0';
1187 }
1188
1189 MAKE_INLINE void
pp_skip_whitespace(char ** pp)1190 pp_skip_whitespace(char **pp)
1191 {
1192 while (ch_isspace(**pp))
1193 (*pp)++;
1194 }
1195
1196 MAKE_INLINE void
pp_skip_hspace(char ** pp)1197 pp_skip_hspace(char **pp)
1198 {
1199 while (**pp == ' ' || **pp == '\t')
1200 (*pp)++;
1201 }
1202
1203 #if defined(lint)
1204 # define MAKE_RCSID(id) extern void do_not_define_rcsid(void)
1205 #elif defined(MAKE_NATIVE)
1206 # include <sys/cdefs.h>
1207 # ifndef __IDSTRING
1208 # define __IDSTRING(name,string) \
1209 static const char name[] MAKE_ATTR_UNUSED = string
1210 # endif
1211 # ifndef __RCSID
1212 # define __RCSID(s) __IDSTRING(rcsid,s)
1213 # endif
1214 # ifndef __COPYRIGHT
1215 # define __COPYRIGHT(s) __IDSTRING(copyright,s)
1216 # endif
1217 # define MAKE_RCSID(id) __RCSID(id)
1218 #elif defined(MAKE_ALL_IN_ONE) && defined(__COUNTER__)
1219 # define MAKE_RCSID_CONCAT(x, y) CONCAT(x, y)
1220 # define MAKE_RCSID(id) static volatile char \
1221 MAKE_RCSID_CONCAT(rcsid_, __COUNTER__)[] = id
1222 #elif defined(MAKE_ALL_IN_ONE)
1223 # define MAKE_RCSID(id) extern void do_not_define_rcsid(void)
1224 #else
1225 # define MAKE_RCSID(id) static volatile char rcsid[] = id
1226 #endif
1227
1228 #endif
1229