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