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