make.h revision 1.215 1 1.215 rillig /* $NetBSD: make.h,v 1.215 2020/11/23 20:41:20 rillig Exp $ */
2 1.6 christos
3 1.1 cgd /*
4 1.6 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.6 christos * The Regents of the University of California. All rights reserved.
6 1.47 agc *
7 1.47 agc * This code is derived from software contributed to Berkeley by
8 1.47 agc * Adam de Boor.
9 1.47 agc *
10 1.47 agc * Redistribution and use in source and binary forms, with or without
11 1.47 agc * modification, are permitted provided that the following conditions
12 1.47 agc * are met:
13 1.47 agc * 1. Redistributions of source code must retain the above copyright
14 1.47 agc * notice, this list of conditions and the following disclaimer.
15 1.47 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.47 agc * notice, this list of conditions and the following disclaimer in the
17 1.47 agc * documentation and/or other materials provided with the distribution.
18 1.47 agc * 3. Neither the name of the University nor the names of its contributors
19 1.47 agc * may be used to endorse or promote products derived from this software
20 1.47 agc * without specific prior written permission.
21 1.47 agc *
22 1.47 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.47 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.47 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.47 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.47 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.47 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.47 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.47 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.47 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.47 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.47 agc * SUCH DAMAGE.
33 1.47 agc *
34 1.47 agc * from: @(#)make.h 8.3 (Berkeley) 6/13/95
35 1.47 agc */
36 1.47 agc
37 1.47 agc /*
38 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
39 1.1 cgd * All rights reserved.
40 1.1 cgd *
41 1.1 cgd * This code is derived from software contributed to Berkeley by
42 1.1 cgd * Adam de Boor.
43 1.1 cgd *
44 1.1 cgd * Redistribution and use in source and binary forms, with or without
45 1.1 cgd * modification, are permitted provided that the following conditions
46 1.1 cgd * are met:
47 1.1 cgd * 1. Redistributions of source code must retain the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer.
49 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
50 1.1 cgd * notice, this list of conditions and the following disclaimer in the
51 1.1 cgd * documentation and/or other materials provided with the distribution.
52 1.1 cgd * 3. All advertising materials mentioning features or use of this software
53 1.1 cgd * must display the following acknowledgement:
54 1.1 cgd * This product includes software developed by the University of
55 1.1 cgd * California, Berkeley and its contributors.
56 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
57 1.1 cgd * may be used to endorse or promote products derived from this software
58 1.1 cgd * without specific prior written permission.
59 1.1 cgd *
60 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 1.1 cgd * SUCH DAMAGE.
71 1.1 cgd *
72 1.11 christos * from: @(#)make.h 8.3 (Berkeley) 6/13/95
73 1.1 cgd */
74 1.1 cgd
75 1.1 cgd /*-
76 1.1 cgd * make.h --
77 1.1 cgd * The global definitions for pmake
78 1.1 cgd */
79 1.1 cgd
80 1.116 rillig #ifndef MAKE_MAKE_H
81 1.116 rillig #define MAKE_MAKE_H
82 1.1 cgd
83 1.1 cgd #include <sys/types.h>
84 1.13 christos #include <sys/param.h>
85 1.135 rillig #include <sys/stat.h>
86 1.44 wiz
87 1.123 rillig #include <assert.h>
88 1.44 wiz #include <ctype.h>
89 1.97 christos #include <fcntl.h>
90 1.150 rillig #include <stdarg.h>
91 1.3 cgd #include <stdio.h>
92 1.44 wiz #include <stdlib.h>
93 1.1 cgd #include <string.h>
94 1.44 wiz #include <unistd.h>
95 1.12 christos
96 1.19 tv #ifdef BSD4_4
97 1.12 christos # include <sys/cdefs.h>
98 1.4 glass #endif
99 1.12 christos
100 1.97 christos #ifndef FD_CLOEXEC
101 1.97 christos #define FD_CLOEXEC 1
102 1.97 christos #endif
103 1.97 christos
104 1.52 yamt #if defined(__GNUC__)
105 1.89 joerg #define MAKE_GNUC_PREREQ(x, y) \
106 1.52 yamt ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \
107 1.52 yamt (__GNUC__ > (x)))
108 1.52 yamt #else /* defined(__GNUC__) */
109 1.90 dholland #define MAKE_GNUC_PREREQ(x, y) 0
110 1.52 yamt #endif /* defined(__GNUC__) */
111 1.52 yamt
112 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
113 1.89 joerg #define MAKE_ATTR_UNUSED __attribute__((__unused__))
114 1.51 jmc #else
115 1.89 joerg #define MAKE_ATTR_UNUSED /* delete */
116 1.51 jmc #endif
117 1.89 joerg
118 1.89 joerg #if MAKE_GNUC_PREREQ(2, 5)
119 1.89 joerg #define MAKE_ATTR_DEAD __attribute__((__noreturn__))
120 1.89 joerg #elif defined(__GNUC__)
121 1.89 joerg #define MAKE_ATTR_DEAD __volatile
122 1.89 joerg #else
123 1.89 joerg #define MAKE_ATTR_DEAD /* delete */
124 1.51 jmc #endif
125 1.44 wiz
126 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
127 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) \
128 1.89 joerg __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
129 1.89 joerg #else
130 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) /* delete */
131 1.87 joerg #endif
132 1.87 joerg
133 1.205 rillig #define MAKE_INLINE static inline MAKE_ATTR_UNUSED
134 1.205 rillig
135 1.127 rillig /*
136 1.137 rillig * A boolean type is defined as an integer, not an enum, for historic reasons.
137 1.137 rillig * The only allowed values are the constants TRUE and FALSE (1 and 0).
138 1.127 rillig */
139 1.127 rillig
140 1.131 rillig #ifdef USE_DOUBLE_BOOLEAN
141 1.131 rillig /* During development, to find type mismatches in function declarations. */
142 1.130 rillig typedef double Boolean;
143 1.162 rillig #define TRUE 1.0
144 1.162 rillig #define FALSE 0.0
145 1.131 rillig #elif defined(USE_UCHAR_BOOLEAN)
146 1.131 rillig /* During development, to find code that depends on the exact value of TRUE or
147 1.131 rillig * that stores other values in Boolean variables. */
148 1.131 rillig typedef unsigned char Boolean;
149 1.131 rillig #define TRUE ((unsigned char)0xFF)
150 1.131 rillig #define FALSE ((unsigned char)0x00)
151 1.161 rillig #elif defined(USE_CHAR_BOOLEAN)
152 1.161 rillig /* During development, to find code that uses a boolean as array index, via
153 1.161 rillig * -Wchar-subscripts. */
154 1.161 rillig typedef char Boolean;
155 1.161 rillig #define TRUE ((char)-1)
156 1.161 rillig #define FALSE ((char)0x00)
157 1.137 rillig #elif defined(USE_ENUM_BOOLEAN)
158 1.159 rillig typedef enum Boolean { FALSE, TRUE } Boolean;
159 1.130 rillig #else
160 1.127 rillig typedef int Boolean;
161 1.127 rillig #ifndef TRUE
162 1.127 rillig #define TRUE 1
163 1.140 rillig #endif
164 1.127 rillig #ifndef FALSE
165 1.127 rillig #define FALSE 0
166 1.140 rillig #endif
167 1.162 rillig #endif
168 1.127 rillig
169 1.1 cgd #include "lst.h"
170 1.128 rillig #include "enum.h"
171 1.22 mycroft #include "hash.h"
172 1.1 cgd #include "config.h"
173 1.3 cgd #include "buf.h"
174 1.78 dsl #include "make_malloc.h"
175 1.1 cgd
176 1.181 rillig typedef enum GNodeMade {
177 1.119 rillig UNMADE, /* Not examined yet */
178 1.119 rillig DEFERRED, /* Examined once (building child) */
179 1.119 rillig REQUESTED, /* on toBeMade list */
180 1.119 rillig BEINGMADE, /* Target is already being made.
181 1.119 rillig * Indicates a cycle in the graph. */
182 1.119 rillig MADE, /* Was out-of-date and has been made */
183 1.119 rillig UPTODATE, /* Was already up-to-date */
184 1.119 rillig ERROR, /* An error occurred while it was being
185 1.119 rillig * made (used only in compat mode) */
186 1.119 rillig ABORTED /* The target was aborted due to an error
187 1.119 rillig * making an inferior (compat). */
188 1.119 rillig } GNodeMade;
189 1.1 cgd
190 1.120 rillig /* The OP_ constants are used when parsing a dependency line as a way of
191 1.120 rillig * communicating to other parts of the program the way in which a target
192 1.120 rillig * should be made.
193 1.120 rillig *
194 1.163 rillig * Some of the OP_ constants can be combined, others cannot. */
195 1.159 rillig typedef enum GNodeType {
196 1.209 rillig OP_NONE = 0,
197 1.209 rillig
198 1.165 rillig /* The dependency operator ':' is the most common one. The commands of
199 1.165 rillig * this node are executed if any child is out-of-date. */
200 1.120 rillig OP_DEPENDS = 1 << 0,
201 1.165 rillig /* The dependency operator '!' always executes its commands, even if
202 1.165 rillig * its children are up-to-date. */
203 1.120 rillig OP_FORCE = 1 << 1,
204 1.165 rillig /* The dependency operator '::' behaves like ':', except that it allows
205 1.165 rillig * multiple dependency groups to be defined. Each of these groups is
206 1.201 rillig * executed on its own, independently from the others. Each individual
207 1.201 rillig * dependency group is called a cohort. */
208 1.120 rillig OP_DOUBLEDEP = 1 << 2,
209 1.120 rillig
210 1.164 rillig /* Matches the dependency operators ':', '!' and '::'. */
211 1.120 rillig OP_OPMASK = OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP,
212 1.120 rillig
213 1.120 rillig /* Don't care if the target doesn't exist and can't be created */
214 1.120 rillig OP_OPTIONAL = 1 << 3,
215 1.120 rillig /* Use associated commands for parents */
216 1.120 rillig OP_USE = 1 << 4,
217 1.120 rillig /* Target is never out of date, but always execute commands anyway.
218 1.120 rillig * Its time doesn't matter, so it has none...sort of */
219 1.148 rillig OP_EXEC = 1 << 5,
220 1.160 rillig /* Ignore non-zero exit status from shell commands when creating the node */
221 1.120 rillig OP_IGNORE = 1 << 6,
222 1.120 rillig /* Don't remove the target when interrupted */
223 1.120 rillig OP_PRECIOUS = 1 << 7,
224 1.120 rillig /* Don't echo commands when executed */
225 1.120 rillig OP_SILENT = 1 << 8,
226 1.120 rillig /* Target is a recursive make so its commands should always be executed
227 1.120 rillig * when it is out of date, regardless of the state of the -n or -t flags */
228 1.120 rillig OP_MAKE = 1 << 9,
229 1.120 rillig /* Target is out-of-date only if any of its children was out-of-date */
230 1.120 rillig OP_JOIN = 1 << 10,
231 1.120 rillig /* Assume the children of the node have been already made */
232 1.120 rillig OP_MADE = 1 << 11,
233 1.120 rillig /* Special .BEGIN, .END, .INTERRUPT */
234 1.120 rillig OP_SPECIAL = 1 << 12,
235 1.120 rillig /* Like .USE, only prepend commands */
236 1.120 rillig OP_USEBEFORE = 1 << 13,
237 1.120 rillig /* The node is invisible to its parents. I.e. it doesn't show up in the
238 1.189 rillig * parents' local variables (.IMPSRC, .ALLSRC). */
239 1.120 rillig OP_INVISIBLE = 1 << 14,
240 1.120 rillig /* The node is exempt from normal 'main target' processing in parse.c */
241 1.120 rillig OP_NOTMAIN = 1 << 15,
242 1.120 rillig /* Not a file target; run always */
243 1.120 rillig OP_PHONY = 1 << 16,
244 1.120 rillig /* Don't search for file in the path */
245 1.120 rillig OP_NOPATH = 1 << 17,
246 1.189 rillig /* In a dependency line "target: source1 .WAIT source2", source1 is made
247 1.189 rillig * first, including its children. Once that is finished, source2 is made,
248 1.189 rillig * including its children. The .WAIT keyword may appear more than once in
249 1.189 rillig * a single dependency declaration. */
250 1.120 rillig OP_WAIT = 1 << 18,
251 1.120 rillig /* .NOMETA do not create a .meta file */
252 1.120 rillig OP_NOMETA = 1 << 19,
253 1.120 rillig /* .META we _do_ want a .meta file */
254 1.120 rillig OP_META = 1 << 20,
255 1.120 rillig /* Do not compare commands in .meta file */
256 1.120 rillig OP_NOMETA_CMP = 1 << 21,
257 1.120 rillig /* Possibly a submake node */
258 1.120 rillig OP_SUBMAKE = 1 << 22,
259 1.120 rillig
260 1.120 rillig /* Attributes applied by PMake */
261 1.120 rillig
262 1.189 rillig /* The node is a transformation rule, such as ".c.o". */
263 1.213 rillig OP_TRANSFORM = 1 << 30,
264 1.120 rillig /* Target is a member of an archive */
265 1.169 rillig /* XXX: How does this differ from OP_ARCHV? */
266 1.213 rillig OP_MEMBER = 1 << 29,
267 1.169 rillig /* The node is a library,
268 1.169 rillig * its name has the form "-l<libname>" */
269 1.213 rillig OP_LIB = 1 << 28,
270 1.169 rillig /* The node is an archive member,
271 1.169 rillig * its name has the form "archive(member)" */
272 1.169 rillig /* XXX: How does this differ from OP_MEMBER? */
273 1.213 rillig OP_ARCHV = 1 << 27,
274 1.120 rillig /* Target has all the commands it should. Used when parsing to catch
275 1.160 rillig * multiple command groups for a target. Only applies to the dependency
276 1.160 rillig * operators ':' and '!', but not to '::'. */
277 1.213 rillig OP_HAS_COMMANDS = 1 << 26,
278 1.145 rillig /* The special command "..." has been seen. All further commands from
279 1.145 rillig * this node will be saved on the .END node instead, to be executed at
280 1.145 rillig * the very end. */
281 1.213 rillig OP_SAVE_CMDS = 1 << 25,
282 1.214 rillig /* Already processed by Suff_FindDeps, to find dependencies from suffix
283 1.214 rillig * transformation rules. */
284 1.213 rillig OP_DEPS_FOUND = 1 << 24,
285 1.120 rillig /* Node found while expanding .ALLSRC */
286 1.213 rillig OP_MARK = 1 << 23,
287 1.155 rillig
288 1.155 rillig OP_NOTARGET = OP_NOTMAIN | OP_USE | OP_EXEC | OP_TRANSFORM
289 1.120 rillig } GNodeType;
290 1.120 rillig
291 1.159 rillig typedef enum GNodeFlags {
292 1.119 rillig REMAKE = 0x0001, /* this target needs to be (re)made */
293 1.119 rillig CHILDMADE = 0x0002, /* children of this target were made */
294 1.119 rillig FORCE = 0x0004, /* children don't exist, and we pretend made */
295 1.119 rillig DONE_WAIT = 0x0008, /* Set by Make_ProcessWait() */
296 1.119 rillig DONE_ORDER = 0x0010, /* Build requested by .ORDER processing */
297 1.119 rillig FROM_DEPEND = 0x0020, /* Node created from .depend */
298 1.119 rillig DONE_ALLSRC = 0x0040, /* We do it once only */
299 1.119 rillig CYCLE = 0x1000, /* Used by MakePrintStatus */
300 1.119 rillig DONECYCLE = 0x2000, /* Used by MakePrintStatus */
301 1.119 rillig INTERNAL = 0x4000 /* Internal use only */
302 1.119 rillig } GNodeFlags;
303 1.1 cgd
304 1.143 rillig typedef struct List StringList;
305 1.143 rillig typedef struct ListNode StringListNode;
306 1.144 rillig
307 1.143 rillig typedef struct List GNodeList;
308 1.143 rillig typedef struct ListNode GNodeListNode;
309 1.143 rillig
310 1.144 rillig typedef struct List /* of CachedDir */ SearchPath;
311 1.144 rillig
312 1.119 rillig /* A graph node represents a target that can possibly be made, including its
313 1.119 rillig * relation to other targets and a lot of other details. */
314 1.119 rillig typedef struct GNode {
315 1.119 rillig /* The target's name, such as "clean" or "make.c" */
316 1.119 rillig char *name;
317 1.119 rillig /* The unexpanded name of a .USE node */
318 1.119 rillig char *uname;
319 1.119 rillig /* The full pathname of the file belonging to the target.
320 1.119 rillig * XXX: What about .PHONY targets? These don't have an associated path. */
321 1.119 rillig char *path;
322 1.119 rillig
323 1.119 rillig /* The type of operator used to define the sources (see the OP flags below).
324 1.119 rillig * XXX: This looks like a wild mixture of type and flags. */
325 1.124 rillig GNodeType type;
326 1.119 rillig GNodeFlags flags;
327 1.119 rillig
328 1.119 rillig /* The state of processing on this node */
329 1.119 rillig GNodeMade made;
330 1.119 rillig int unmade; /* The number of unmade children */
331 1.119 rillig
332 1.160 rillig /* The modification time; 0 means the node does not have a corresponding
333 1.200 rillig * file; see GNode_IsOODate. */
334 1.160 rillig time_t mtime;
335 1.166 rillig struct GNode *youngestChild;
336 1.119 rillig
337 1.133 rillig /* The GNodes for which this node is an implied source. May be empty.
338 1.133 rillig * For example, when there is an inference rule for .c.o, the node for
339 1.133 rillig * file.c has the node for file.o in this list. */
340 1.143 rillig GNodeList *implicitParents;
341 1.119 rillig
342 1.119 rillig /* The nodes that depend on this one, or in other words, the nodes for
343 1.119 rillig * which this is a source. */
344 1.143 rillig GNodeList *parents;
345 1.119 rillig /* The nodes on which this one depends. */
346 1.143 rillig GNodeList *children;
347 1.119 rillig
348 1.119 rillig /* .ORDER nodes we need made. The nodes that must be made (if they're
349 1.119 rillig * made) before this node can be made, but that do not enter into the
350 1.119 rillig * datedness of this node. */
351 1.143 rillig GNodeList *order_pred;
352 1.119 rillig /* .ORDER nodes who need us. The nodes that must be made (if they're made
353 1.119 rillig * at all) after this node is made, but that do not depend on this node,
354 1.119 rillig * in the normal sense. */
355 1.143 rillig GNodeList *order_succ;
356 1.119 rillig
357 1.188 rillig /* Other nodes of the same name, for the '::' dependency operator. */
358 1.188 rillig GNodeList *cohorts;
359 1.156 rillig /* The "#n" suffix for this cohort, or "" for other nodes */
360 1.119 rillig char cohort_num[8];
361 1.119 rillig /* The number of unmade instances on the cohorts list */
362 1.119 rillig int unmade_cohorts;
363 1.129 rillig /* Pointer to the first instance of a '::' node; only set when on a
364 1.129 rillig * cohorts list */
365 1.119 rillig struct GNode *centurion;
366 1.119 rillig
367 1.122 rillig /* Last time (sequence number) we tried to make this node */
368 1.160 rillig unsigned int checked_seqno;
369 1.119 rillig
370 1.119 rillig /* The "local" variables that are specific to this target and this target
371 1.160 rillig * only, such as $@, $<, $?.
372 1.160 rillig *
373 1.176 rillig * Also used for the global variable scopes VAR_GLOBAL, VAR_CMDLINE,
374 1.160 rillig * VAR_INTERNAL, which contain variables with arbitrary names. */
375 1.211 rillig HashTable /* of Var pointer */ vars;
376 1.119 rillig
377 1.119 rillig /* The commands to be given to a shell to create this target. */
378 1.143 rillig StringList *commands;
379 1.119 rillig
380 1.119 rillig /* Suffix for the node (determined by Suff_FindDeps and opaque to everyone
381 1.119 rillig * but the Suff module) */
382 1.212 rillig struct Suffix *suffix;
383 1.119 rillig
384 1.188 rillig /* Filename where the GNode got defined */
385 1.210 rillig /* XXX: What is the lifetime of this string? */
386 1.119 rillig const char *fname;
387 1.188 rillig /* Line number where the GNode got defined */
388 1.119 rillig int lineno;
389 1.1 cgd } GNode;
390 1.1 cgd
391 1.188 rillig /* Error levels for diagnostics during parsing. */
392 1.167 rillig typedef enum ParseErrorLevel {
393 1.188 rillig /* Exit when the current top-level makefile has been parsed completely. */
394 1.167 rillig PARSE_FATAL = 1,
395 1.188 rillig /* Print "warning"; may be upgraded to fatal by the -w option. */
396 1.167 rillig PARSE_WARNING,
397 1.188 rillig /* Informational, mainly used during development of makefiles. */
398 1.167 rillig PARSE_INFO
399 1.167 rillig } ParseErrorLevel;
400 1.1 cgd
401 1.1 cgd /*
402 1.141 rillig * Values returned by Cond_EvalLine and Cond_EvalCondition.
403 1.1 cgd */
404 1.159 rillig typedef enum CondEvalResult {
405 1.113 rillig COND_PARSE, /* Parse the next lines */
406 1.113 rillig COND_SKIP, /* Skip the next lines */
407 1.113 rillig COND_INVALID /* Not a conditional statement */
408 1.113 rillig } CondEvalResult;
409 1.1 cgd
410 1.190 rillig /* Names of the variables that are "local" to a specific target. */
411 1.148 rillig #define TARGET "@" /* Target of dependency */
412 1.148 rillig #define OODATE "?" /* All out-of-date sources */
413 1.148 rillig #define ALLSRC ">" /* All sources */
414 1.148 rillig #define IMPSRC "<" /* Source implied by transformation */
415 1.148 rillig #define PREFIX "*" /* Common prefix */
416 1.148 rillig #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
417 1.148 rillig #define MEMBER "%" /* Member in "archive(member)" syntax */
418 1.148 rillig
419 1.1 cgd /*
420 1.11 christos * Global Variables
421 1.1 cgd */
422 1.1 cgd
423 1.190 rillig /* True if every target is precious */
424 1.190 rillig extern Boolean allPrecious;
425 1.190 rillig /* True if failed targets should be deleted */
426 1.190 rillig extern Boolean deleteOnError;
427 1.190 rillig /* TRUE while processing .depend */
428 1.190 rillig extern Boolean doing_depend;
429 1.190 rillig /* .DEFAULT rule */
430 1.207 rillig extern GNode *defaultNode;
431 1.190 rillig
432 1.190 rillig /* Variables defined internally by make which should not override those set
433 1.190 rillig * by makefiles. */
434 1.190 rillig extern GNode *VAR_INTERNAL;
435 1.190 rillig /* Variables defined in a global context, e.g in the Makefile itself. */
436 1.190 rillig extern GNode *VAR_GLOBAL;
437 1.190 rillig /* Variables defined on the command line. */
438 1.190 rillig extern GNode *VAR_CMDLINE;
439 1.190 rillig
440 1.190 rillig /* Value returned by Var_Parse when an error is encountered. It actually
441 1.190 rillig * points to an empty string, so naive callers needn't worry about it. */
442 1.190 rillig extern char var_Error[];
443 1.190 rillig
444 1.190 rillig /* The time at the start of this whole process */
445 1.190 rillig extern time_t now;
446 1.1 cgd
447 1.182 rillig /*
448 1.183 rillig * If FALSE (the default behavior), undefined subexpressions in a variable
449 1.183 rillig * expression are discarded. If TRUE (only during variable assignments using
450 1.202 rillig * the ':=' assignment operator, no matter how deeply nested), they are
451 1.183 rillig * preserved and possibly expanded later when the variable from the
452 1.183 rillig * subexpression has been defined.
453 1.180 rillig *
454 1.182 rillig * Example for a ':=' assignment:
455 1.182 rillig * CFLAGS = $(.INCLUDES)
456 1.182 rillig * CFLAGS := -I.. $(CFLAGS)
457 1.182 rillig * # If .INCLUDES (an undocumented special variable, by the way) is
458 1.182 rillig * # still undefined, the updated CFLAGS becomes "-I.. $(.INCLUDES)".
459 1.182 rillig */
460 1.183 rillig extern Boolean preserveUndefined;
461 1.9 christos
462 1.190 rillig /* The list of directories to search when looking for targets (set by the
463 1.190 rillig * special target .PATH). */
464 1.190 rillig extern SearchPath *dirSearchPath;
465 1.186 rillig /* Used for .include "...". */
466 1.186 rillig extern SearchPath *parseIncPath;
467 1.186 rillig /* Used for .include <...>, for the built-in sys.mk and makefiles from the
468 1.186 rillig * command line arguments. */
469 1.186 rillig extern SearchPath *sysIncPath;
470 1.186 rillig /* The default for sysIncPath. */
471 1.186 rillig extern SearchPath *defSysIncPath;
472 1.32 christos
473 1.191 rillig /* Startup directory */
474 1.191 rillig extern char curdir[];
475 1.191 rillig /* The basename of the program name, suffixed with [n] for sub-makes. */
476 1.191 rillig extern char *progname;
477 1.191 rillig /* Name of the .depend makefile */
478 1.191 rillig extern char *makeDependfile;
479 1.187 rillig /* If we replaced environ, this will be non-NULL. */
480 1.187 rillig extern char **savedEnv;
481 1.30 sommerfe
482 1.190 rillig extern int makelevel;
483 1.111 rillig
484 1.82 sjg /*
485 1.82 sjg * We cannot vfork() in a child of vfork().
486 1.82 sjg * Most systems do not enforce this but some do.
487 1.82 sjg */
488 1.82 sjg #define vFork() ((getpid() == myPid) ? vfork() : fork())
489 1.190 rillig extern pid_t myPid;
490 1.82 sjg
491 1.30 sommerfe #define MAKEFLAGS ".MAKEFLAGS"
492 1.35 sjg #define MAKEOVERRIDES ".MAKEOVERRIDES"
493 1.215 rillig #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX" /* prefix when printing the
494 1.215 rillig * target of a job */
495 1.215 rillig #define MAKE_EXPORTED ".MAKE.EXPORTED" /* exported variables */
496 1.215 rillig #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all loaded makefiles */
497 1.215 rillig #define MAKE_LEVEL ".MAKE.LEVEL" /* recursion level */
498 1.185 rillig #define MAKE_MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
499 1.215 rillig #define MAKE_DEPENDFILE ".MAKE.DEPENDFILE" /* .depend */
500 1.80 sjg #define MAKE_MODE ".MAKE.MODE"
501 1.91 sjg #ifndef MAKE_LEVEL_ENV
502 1.91 sjg # define MAKE_LEVEL_ENV "MAKELEVEL"
503 1.91 sjg #endif
504 1.1 cgd
505 1.170 rillig typedef enum DebugFlags {
506 1.204 rillig DEBUG_NONE = 0,
507 1.170 rillig DEBUG_ARCH = 1 << 0,
508 1.170 rillig DEBUG_COND = 1 << 1,
509 1.192 rillig DEBUG_CWD = 1 << 2,
510 1.192 rillig DEBUG_DIR = 1 << 3,
511 1.192 rillig DEBUG_ERROR = 1 << 4,
512 1.203 rillig DEBUG_FOR = 1 << 5,
513 1.203 rillig DEBUG_GRAPH1 = 1 << 6,
514 1.203 rillig DEBUG_GRAPH2 = 1 << 7,
515 1.203 rillig DEBUG_GRAPH3 = 1 << 8,
516 1.203 rillig DEBUG_HASH = 1 << 9,
517 1.203 rillig DEBUG_JOB = 1 << 10,
518 1.203 rillig DEBUG_LOUD = 1 << 11,
519 1.203 rillig DEBUG_MAKE = 1 << 12,
520 1.203 rillig DEBUG_META = 1 << 13,
521 1.203 rillig DEBUG_PARSE = 1 << 14,
522 1.203 rillig DEBUG_SCRIPT = 1 << 15,
523 1.203 rillig DEBUG_SHELL = 1 << 16,
524 1.203 rillig DEBUG_SUFF = 1 << 17,
525 1.203 rillig DEBUG_TARG = 1 << 18,
526 1.203 rillig DEBUG_VAR = 1 << 19,
527 1.204 rillig DEBUG_ALL = (1 << 20) - 1
528 1.170 rillig } DebugFlags;
529 1.170 rillig
530 1.1 cgd #define CONCAT(a,b) a##b
531 1.1 cgd
532 1.173 rillig #define DEBUG(module) (opts.debug & CONCAT(DEBUG_,module))
533 1.1 cgd
534 1.151 rillig void debug_printf(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
535 1.150 rillig
536 1.149 rillig #define DEBUG0(module, text) \
537 1.149 rillig if (!DEBUG(module)) (void)0; \
538 1.150 rillig else debug_printf("%s", text)
539 1.149 rillig
540 1.149 rillig #define DEBUG1(module, fmt, arg1) \
541 1.149 rillig if (!DEBUG(module)) (void)0; \
542 1.150 rillig else debug_printf(fmt, arg1)
543 1.149 rillig
544 1.149 rillig #define DEBUG2(module, fmt, arg1, arg2) \
545 1.149 rillig if (!DEBUG(module)) (void)0; \
546 1.150 rillig else debug_printf(fmt, arg1, arg2)
547 1.149 rillig
548 1.149 rillig #define DEBUG3(module, fmt, arg1, arg2, arg3) \
549 1.149 rillig if (!DEBUG(module)) (void)0; \
550 1.150 rillig else debug_printf(fmt, arg1, arg2, arg3)
551 1.149 rillig
552 1.149 rillig #define DEBUG4(module, fmt, arg1, arg2, arg3, arg4) \
553 1.149 rillig if (!DEBUG(module)) (void)0; \
554 1.150 rillig else debug_printf(fmt, arg1, arg2, arg3, arg4)
555 1.149 rillig
556 1.149 rillig #define DEBUG5(module, fmt, arg1, arg2, arg3, arg4, arg5) \
557 1.149 rillig if (!DEBUG(module)) (void)0; \
558 1.150 rillig else debug_printf(fmt, arg1, arg2, arg3, arg4, arg5)
559 1.149 rillig
560 1.173 rillig typedef enum PrintVarsMode {
561 1.198 rillig PVM_NONE,
562 1.198 rillig PVM_UNEXPANDED,
563 1.198 rillig PVM_EXPANDED
564 1.173 rillig } PrintVarsMode;
565 1.173 rillig
566 1.173 rillig /* Command line options */
567 1.173 rillig typedef struct CmdOpts {
568 1.173 rillig /* -B: whether we are make compatible */
569 1.173 rillig Boolean compatMake;
570 1.173 rillig
571 1.173 rillig /* -d: debug control: There is one bit per module. It is up to the
572 1.173 rillig * module what debug information to print. */
573 1.173 rillig DebugFlags debug;
574 1.173 rillig
575 1.173 rillig /* -df: debug output is written here - default stderr */
576 1.173 rillig FILE *debug_file;
577 1.173 rillig
578 1.204 rillig /* -dL: lint mode
579 1.204 rillig *
580 1.204 rillig * Runs make in strict mode, with additional checks and better error
581 1.204 rillig * handling. */
582 1.204 rillig Boolean lint;
583 1.204 rillig
584 1.174 rillig /* -dV: for the -V option, print unexpanded variable values */
585 1.174 rillig Boolean debugVflag;
586 1.174 rillig
587 1.173 rillig /* -e: check environment variables before global variables */
588 1.173 rillig Boolean checkEnvFirst;
589 1.173 rillig
590 1.173 rillig /* -f: the makefiles to read */
591 1.173 rillig StringList *makefiles;
592 1.173 rillig
593 1.173 rillig /* -i: if true, ignore all errors from shell commands */
594 1.173 rillig Boolean ignoreErrors;
595 1.173 rillig
596 1.173 rillig /* -j: the maximum number of jobs that can run in parallel;
597 1.173 rillig * this is coordinated with the submakes */
598 1.173 rillig int maxJobs;
599 1.173 rillig
600 1.173 rillig /* -k: if true, continue on unaffected portions of the graph when an
601 1.173 rillig * error occurs in one portion */
602 1.173 rillig Boolean keepgoing;
603 1.173 rillig
604 1.173 rillig /* -N: execute no commands from the targets */
605 1.173 rillig Boolean noRecursiveExecute;
606 1.173 rillig
607 1.173 rillig /* -n: execute almost no commands from the targets */
608 1.173 rillig Boolean noExecute;
609 1.173 rillig
610 1.173 rillig /* -q: if true, we aren't supposed to really make anything, just see if
611 1.173 rillig * the targets are out-of-date */
612 1.173 rillig Boolean queryFlag;
613 1.173 rillig
614 1.173 rillig /* -r: raw mode, without loading the builtin rules. */
615 1.173 rillig Boolean noBuiltins;
616 1.173 rillig
617 1.173 rillig /* -s: don't echo the shell commands before executing them */
618 1.173 rillig Boolean beSilent;
619 1.173 rillig
620 1.173 rillig /* -t: touch the targets if they are out-of-date, but don't actually
621 1.173 rillig * make them */
622 1.173 rillig Boolean touchFlag;
623 1.173 rillig
624 1.173 rillig /* -[Vv]: print expanded or unexpanded selected variables */
625 1.173 rillig PrintVarsMode printVars;
626 1.173 rillig /* -[Vv]: the variables to print */
627 1.173 rillig StringList *variables;
628 1.173 rillig
629 1.173 rillig /* -W: if true, makefile parsing warnings are treated as errors */
630 1.173 rillig Boolean parseWarnFatal;
631 1.173 rillig
632 1.173 rillig /* -w: print Entering and Leaving for submakes */
633 1.173 rillig Boolean enterFlag;
634 1.173 rillig
635 1.173 rillig /* -X: if true, do not export variables set on the command line to the
636 1.173 rillig * environment. */
637 1.173 rillig Boolean varNoExportEnv;
638 1.173 rillig
639 1.173 rillig /* The target names specified on the command line.
640 1.173 rillig * Used to resolve .if make(...) statements. */
641 1.173 rillig StringList *create;
642 1.173 rillig
643 1.173 rillig } CmdOpts;
644 1.173 rillig
645 1.173 rillig extern CmdOpts opts;
646 1.173 rillig
647 1.1 cgd #include "nonints.h"
648 1.1 cgd
649 1.199 rillig void GNode_UpdateYoungestChild(GNode *, GNode *);
650 1.200 rillig Boolean GNode_IsOODate(GNode *);
651 1.144 rillig void Make_ExpandUse(GNodeList *);
652 1.44 wiz time_t Make_Recheck(GNode *);
653 1.44 wiz void Make_HandleUse(GNode *, GNode *);
654 1.44 wiz void Make_Update(GNode *);
655 1.44 wiz void Make_DoAllVar(GNode *);
656 1.144 rillig Boolean Make_Run(GNodeList *);
657 1.194 rillig Boolean shouldDieQuietly(GNode *, int);
658 1.80 sjg void PrintOnError(GNode *, const char *);
659 1.44 wiz void Main_ExportMAKEFLAGS(Boolean);
660 1.206 sjg Boolean Main_SetObjdir(Boolean, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
661 1.81 sjg int mkTempFile(const char *, char **);
662 1.208 rillig int str2Lst_Append(StringList *, char *);
663 1.126 rillig void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
664 1.179 rillig Boolean GNode_ShouldExecute(GNode *gn);
665 1.155 rillig
666 1.164 rillig /* See if the node was seen on the left-hand side of a dependency operator. */
667 1.205 rillig MAKE_INLINE Boolean
668 1.164 rillig GNode_IsTarget(const GNode *gn)
669 1.155 rillig {
670 1.164 rillig return (gn->type & OP_OPMASK) != 0;
671 1.155 rillig }
672 1.155 rillig
673 1.205 rillig MAKE_INLINE const char *
674 1.172 rillig GNode_Path(const GNode *gn)
675 1.172 rillig {
676 1.172 rillig return gn->path != NULL ? gn->path : gn->name;
677 1.172 rillig }
678 1.172 rillig
679 1.205 rillig MAKE_INLINE const char *
680 1.178 rillig GNode_VarTarget(GNode *gn) { return Var_ValueDirect(TARGET, gn); }
681 1.205 rillig MAKE_INLINE const char *
682 1.178 rillig GNode_VarOodate(GNode *gn) { return Var_ValueDirect(OODATE, gn); }
683 1.205 rillig MAKE_INLINE const char *
684 1.178 rillig GNode_VarAllsrc(GNode *gn) { return Var_ValueDirect(ALLSRC, gn); }
685 1.205 rillig MAKE_INLINE const char *
686 1.178 rillig GNode_VarImpsrc(GNode *gn) { return Var_ValueDirect(IMPSRC, gn); }
687 1.205 rillig MAKE_INLINE const char *
688 1.178 rillig GNode_VarPrefix(GNode *gn) { return Var_ValueDirect(PREFIX, gn); }
689 1.205 rillig MAKE_INLINE const char *
690 1.178 rillig GNode_VarArchive(GNode *gn) { return Var_ValueDirect(ARCHIVE, gn); }
691 1.205 rillig MAKE_INLINE const char *
692 1.178 rillig GNode_VarMember(GNode *gn) { return Var_ValueDirect(MEMBER, gn); }
693 1.178 rillig
694 1.46 christos #ifdef __GNUC__
695 1.148 rillig #define UNCONST(ptr) ({ \
696 1.46 christos union __unconst { \
697 1.46 christos const void *__cp; \
698 1.46 christos void *__p; \
699 1.46 christos } __d; \
700 1.46 christos __d.__cp = ptr, __d.__p; })
701 1.46 christos #else
702 1.74 christos #define UNCONST(ptr) (void *)(ptr)
703 1.49 sjg #endif
704 1.49 sjg
705 1.96 pooka /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
706 1.96 pooka #include <limits.h>
707 1.96 pooka #ifndef MAXPATHLEN
708 1.96 pooka #define MAXPATHLEN 4096
709 1.96 pooka #endif
710 1.96 pooka #ifndef PATH_MAX
711 1.96 pooka #define PATH_MAX MAXPATHLEN
712 1.96 pooka #endif
713 1.96 pooka
714 1.103 sjg #if defined(SYSV)
715 1.103 sjg #define KILLPG(pid, sig) kill(-(pid), (sig))
716 1.103 sjg #else
717 1.103 sjg #define KILLPG(pid, sig) killpg((pid), (sig))
718 1.103 sjg #endif
719 1.103 sjg
720 1.205 rillig MAKE_INLINE Boolean
721 1.195 rillig ch_isalnum(char ch) { return isalnum((unsigned char)ch) != 0; }
722 1.205 rillig MAKE_INLINE Boolean
723 1.195 rillig ch_isalpha(char ch) { return isalpha((unsigned char)ch) != 0; }
724 1.205 rillig MAKE_INLINE Boolean
725 1.195 rillig ch_isdigit(char ch) { return isdigit((unsigned char)ch) != 0; }
726 1.205 rillig MAKE_INLINE Boolean
727 1.195 rillig ch_isspace(char ch) { return isspace((unsigned char)ch) != 0; }
728 1.205 rillig MAKE_INLINE Boolean
729 1.195 rillig ch_isupper(char ch) { return isupper((unsigned char)ch) != 0; }
730 1.205 rillig MAKE_INLINE char
731 1.195 rillig ch_tolower(char ch) { return (char)tolower((unsigned char)ch); }
732 1.205 rillig MAKE_INLINE char
733 1.195 rillig ch_toupper(char ch) { return (char)toupper((unsigned char)ch); }
734 1.139 rillig
735 1.205 rillig MAKE_INLINE void
736 1.155 rillig cpp_skip_whitespace(const char **pp)
737 1.155 rillig {
738 1.155 rillig while (ch_isspace(**pp))
739 1.155 rillig (*pp)++;
740 1.155 rillig }
741 1.155 rillig
742 1.205 rillig MAKE_INLINE void
743 1.196 rillig cpp_skip_hspace(const char **pp)
744 1.196 rillig {
745 1.196 rillig while (**pp == ' ' || **pp == '\t')
746 1.196 rillig (*pp)++;
747 1.196 rillig }
748 1.196 rillig
749 1.205 rillig MAKE_INLINE void
750 1.155 rillig pp_skip_whitespace(char **pp)
751 1.155 rillig {
752 1.155 rillig while (ch_isspace(**pp))
753 1.155 rillig (*pp)++;
754 1.155 rillig }
755 1.155 rillig
756 1.205 rillig MAKE_INLINE void
757 1.197 rillig pp_skip_hspace(char **pp)
758 1.197 rillig {
759 1.197 rillig while (**pp == ' ' || **pp == '\t')
760 1.197 rillig (*pp)++;
761 1.197 rillig }
762 1.197 rillig
763 1.160 rillig #ifdef MAKE_NATIVE
764 1.160 rillig # include <sys/cdefs.h>
765 1.160 rillig # ifndef lint
766 1.160 rillig # define MAKE_RCSID(id) __RCSID(id)
767 1.160 rillig # endif
768 1.142 rillig #else
769 1.160 rillig # define MAKE_RCSID(id) static volatile char rcsid[] = id
770 1.142 rillig #endif
771 1.142 rillig
772 1.116 rillig #endif /* MAKE_MAKE_H */
773