make.h revision 1.129 1 1.129 rillig /* $NetBSD: make.h,v 1.129 2020/08/28 19:14:07 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.44 wiz
86 1.123 rillig #include <assert.h>
87 1.44 wiz #include <ctype.h>
88 1.97 christos #include <fcntl.h>
89 1.3 cgd #include <stdio.h>
90 1.44 wiz #include <stdlib.h>
91 1.1 cgd #include <string.h>
92 1.44 wiz #include <unistd.h>
93 1.12 christos
94 1.19 tv #ifdef BSD4_4
95 1.12 christos # include <sys/cdefs.h>
96 1.4 glass #endif
97 1.12 christos
98 1.97 christos #ifndef FD_CLOEXEC
99 1.97 christos #define FD_CLOEXEC 1
100 1.97 christos #endif
101 1.97 christos
102 1.52 yamt #if defined(__GNUC__)
103 1.89 joerg #define MAKE_GNUC_PREREQ(x, y) \
104 1.52 yamt ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \
105 1.52 yamt (__GNUC__ > (x)))
106 1.52 yamt #else /* defined(__GNUC__) */
107 1.90 dholland #define MAKE_GNUC_PREREQ(x, y) 0
108 1.52 yamt #endif /* defined(__GNUC__) */
109 1.52 yamt
110 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
111 1.89 joerg #define MAKE_ATTR_UNUSED __attribute__((__unused__))
112 1.51 jmc #else
113 1.89 joerg #define MAKE_ATTR_UNUSED /* delete */
114 1.51 jmc #endif
115 1.89 joerg
116 1.89 joerg #if MAKE_GNUC_PREREQ(2, 5)
117 1.89 joerg #define MAKE_ATTR_DEAD __attribute__((__noreturn__))
118 1.89 joerg #elif defined(__GNUC__)
119 1.89 joerg #define MAKE_ATTR_DEAD __volatile
120 1.89 joerg #else
121 1.89 joerg #define MAKE_ATTR_DEAD /* delete */
122 1.51 jmc #endif
123 1.44 wiz
124 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
125 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) \
126 1.89 joerg __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
127 1.89 joerg #else
128 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) /* delete */
129 1.87 joerg #endif
130 1.87 joerg
131 1.127 rillig /*
132 1.127 rillig * A boolean type is defined as an integer, not an enum. This allows a
133 1.127 rillig * boolean argument to be an expression that isn't strictly 0 or 1 valued.
134 1.127 rillig */
135 1.127 rillig
136 1.127 rillig typedef int Boolean;
137 1.127 rillig #ifndef TRUE
138 1.127 rillig #define TRUE 1
139 1.127 rillig #endif /* TRUE */
140 1.127 rillig #ifndef FALSE
141 1.127 rillig #define FALSE 0
142 1.127 rillig #endif /* FALSE */
143 1.127 rillig
144 1.127 rillig /*
145 1.127 rillig * Functions that must return a status can return a ReturnStatus to
146 1.127 rillig * indicate success or type of failure.
147 1.127 rillig */
148 1.127 rillig
149 1.127 rillig typedef int ReturnStatus;
150 1.127 rillig
151 1.127 rillig /*
152 1.127 rillig * The following statuses overlap with the first 2 generic statuses
153 1.127 rillig * defined in status.h:
154 1.127 rillig *
155 1.127 rillig * SUCCESS There was no error.
156 1.127 rillig * FAILURE There was a general error.
157 1.127 rillig */
158 1.127 rillig
159 1.127 rillig #define SUCCESS 0x00000000
160 1.127 rillig #define FAILURE 0x00000001
161 1.127 rillig
162 1.1 cgd #include "lst.h"
163 1.128 rillig #include "enum.h"
164 1.22 mycroft #include "hash.h"
165 1.1 cgd #include "config.h"
166 1.3 cgd #include "buf.h"
167 1.78 dsl #include "make_malloc.h"
168 1.1 cgd
169 1.119 rillig typedef enum {
170 1.119 rillig UNMADE, /* Not examined yet */
171 1.119 rillig DEFERRED, /* Examined once (building child) */
172 1.119 rillig REQUESTED, /* on toBeMade list */
173 1.119 rillig BEINGMADE, /* Target is already being made.
174 1.119 rillig * Indicates a cycle in the graph. */
175 1.119 rillig MADE, /* Was out-of-date and has been made */
176 1.119 rillig UPTODATE, /* Was already up-to-date */
177 1.119 rillig ERROR, /* An error occurred while it was being
178 1.119 rillig * made (used only in compat mode) */
179 1.119 rillig ABORTED /* The target was aborted due to an error
180 1.119 rillig * making an inferior (compat). */
181 1.119 rillig } GNodeMade;
182 1.1 cgd
183 1.120 rillig /* The OP_ constants are used when parsing a dependency line as a way of
184 1.120 rillig * communicating to other parts of the program the way in which a target
185 1.120 rillig * should be made.
186 1.120 rillig *
187 1.120 rillig * These constants are bitwise-OR'ed together and placed in the 'type' field
188 1.120 rillig * of each node. Any node that has a 'type' field which satisfies the OP_NOP
189 1.120 rillig * function was never never on the left-hand side of an operator, though it
190 1.120 rillig * may have been on the right-hand side... */
191 1.120 rillig typedef enum {
192 1.120 rillig /* Execution of commands depends on children (:) */
193 1.120 rillig OP_DEPENDS = 1 << 0,
194 1.120 rillig /* Always execute commands (!) */
195 1.120 rillig OP_FORCE = 1 << 1,
196 1.120 rillig /* Execution of commands depends on children per line (::) */
197 1.120 rillig OP_DOUBLEDEP = 1 << 2,
198 1.120 rillig
199 1.120 rillig OP_OPMASK = OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP,
200 1.120 rillig
201 1.120 rillig /* Don't care if the target doesn't exist and can't be created */
202 1.120 rillig OP_OPTIONAL = 1 << 3,
203 1.120 rillig /* Use associated commands for parents */
204 1.120 rillig OP_USE = 1 << 4,
205 1.120 rillig /* Target is never out of date, but always execute commands anyway.
206 1.120 rillig * Its time doesn't matter, so it has none...sort of */
207 1.120 rillig OP_EXEC = 1 << 5,
208 1.120 rillig /* Ignore errors when creating the node */
209 1.120 rillig OP_IGNORE = 1 << 6,
210 1.120 rillig /* Don't remove the target when interrupted */
211 1.120 rillig OP_PRECIOUS = 1 << 7,
212 1.120 rillig /* Don't echo commands when executed */
213 1.120 rillig OP_SILENT = 1 << 8,
214 1.120 rillig /* Target is a recursive make so its commands should always be executed
215 1.120 rillig * when it is out of date, regardless of the state of the -n or -t flags */
216 1.120 rillig OP_MAKE = 1 << 9,
217 1.120 rillig /* Target is out-of-date only if any of its children was out-of-date */
218 1.120 rillig OP_JOIN = 1 << 10,
219 1.120 rillig /* Assume the children of the node have been already made */
220 1.120 rillig OP_MADE = 1 << 11,
221 1.120 rillig /* Special .BEGIN, .END, .INTERRUPT */
222 1.120 rillig OP_SPECIAL = 1 << 12,
223 1.120 rillig /* Like .USE, only prepend commands */
224 1.120 rillig OP_USEBEFORE = 1 << 13,
225 1.120 rillig /* The node is invisible to its parents. I.e. it doesn't show up in the
226 1.120 rillig * parents' local variables. */
227 1.120 rillig OP_INVISIBLE = 1 << 14,
228 1.120 rillig /* The node is exempt from normal 'main target' processing in parse.c */
229 1.120 rillig OP_NOTMAIN = 1 << 15,
230 1.120 rillig /* Not a file target; run always */
231 1.120 rillig OP_PHONY = 1 << 16,
232 1.120 rillig /* Don't search for file in the path */
233 1.120 rillig OP_NOPATH = 1 << 17,
234 1.120 rillig /* .WAIT phony node */
235 1.120 rillig OP_WAIT = 1 << 18,
236 1.120 rillig /* .NOMETA do not create a .meta file */
237 1.120 rillig OP_NOMETA = 1 << 19,
238 1.120 rillig /* .META we _do_ want a .meta file */
239 1.120 rillig OP_META = 1 << 20,
240 1.120 rillig /* Do not compare commands in .meta file */
241 1.120 rillig OP_NOMETA_CMP = 1 << 21,
242 1.120 rillig /* Possibly a submake node */
243 1.120 rillig OP_SUBMAKE = 1 << 22,
244 1.120 rillig
245 1.120 rillig /* Attributes applied by PMake */
246 1.120 rillig
247 1.120 rillig /* The node is a transformation rule */
248 1.120 rillig OP_TRANSFORM = 1 << 31,
249 1.120 rillig /* Target is a member of an archive */
250 1.120 rillig OP_MEMBER = 1 << 30,
251 1.120 rillig /* Target is a library */
252 1.120 rillig OP_LIB = 1 << 29,
253 1.120 rillig /* Target is an archive construct */
254 1.120 rillig OP_ARCHV = 1 << 28,
255 1.120 rillig /* Target has all the commands it should. Used when parsing to catch
256 1.120 rillig * multiple commands for a target. */
257 1.120 rillig OP_HAS_COMMANDS = 1 << 27,
258 1.120 rillig /* Saving commands on .END (Compat) */
259 1.120 rillig OP_SAVE_CMDS = 1 << 26,
260 1.120 rillig /* Already processed by Suff_FindDeps */
261 1.120 rillig OP_DEPS_FOUND = 1 << 25,
262 1.120 rillig /* Node found while expanding .ALLSRC */
263 1.120 rillig OP_MARK = 1 << 24
264 1.120 rillig } GNodeType;
265 1.120 rillig
266 1.119 rillig typedef enum {
267 1.119 rillig REMAKE = 0x0001, /* this target needs to be (re)made */
268 1.119 rillig CHILDMADE = 0x0002, /* children of this target were made */
269 1.119 rillig FORCE = 0x0004, /* children don't exist, and we pretend made */
270 1.119 rillig DONE_WAIT = 0x0008, /* Set by Make_ProcessWait() */
271 1.119 rillig DONE_ORDER = 0x0010, /* Build requested by .ORDER processing */
272 1.119 rillig FROM_DEPEND = 0x0020, /* Node created from .depend */
273 1.119 rillig DONE_ALLSRC = 0x0040, /* We do it once only */
274 1.119 rillig CYCLE = 0x1000, /* Used by MakePrintStatus */
275 1.119 rillig DONECYCLE = 0x2000, /* Used by MakePrintStatus */
276 1.119 rillig INTERNAL = 0x4000 /* Internal use only */
277 1.119 rillig } GNodeFlags;
278 1.1 cgd
279 1.119 rillig /* A graph node represents a target that can possibly be made, including its
280 1.119 rillig * relation to other targets and a lot of other details. */
281 1.119 rillig typedef struct GNode {
282 1.119 rillig /* The target's name, such as "clean" or "make.c" */
283 1.119 rillig char *name;
284 1.119 rillig /* The unexpanded name of a .USE node */
285 1.119 rillig char *uname;
286 1.119 rillig /* The full pathname of the file belonging to the target.
287 1.119 rillig * XXX: What about .PHONY targets? These don't have an associated path. */
288 1.119 rillig char *path;
289 1.119 rillig
290 1.119 rillig /* The type of operator used to define the sources (see the OP flags below).
291 1.119 rillig * XXX: This looks like a wild mixture of type and flags. */
292 1.124 rillig GNodeType type;
293 1.119 rillig /* whether it is involved in this invocation of make */
294 1.119 rillig GNodeFlags flags;
295 1.119 rillig
296 1.119 rillig /* The state of processing on this node */
297 1.119 rillig GNodeMade made;
298 1.119 rillig int unmade; /* The number of unmade children */
299 1.119 rillig
300 1.119 rillig time_t mtime; /* Its modification time */
301 1.119 rillig struct GNode *cmgn; /* The youngest child */
302 1.119 rillig
303 1.119 rillig /* Links to parents for which this is an implied source. May be empty.
304 1.119 rillig * Nodes that depend on this, as gleaned from the transformation rules. */
305 1.119 rillig Lst iParents;
306 1.119 rillig
307 1.119 rillig /* Other nodes of the same name for the :: operator. */
308 1.119 rillig Lst cohorts;
309 1.119 rillig
310 1.119 rillig /* The nodes that depend on this one, or in other words, the nodes for
311 1.119 rillig * which this is a source. */
312 1.119 rillig Lst parents;
313 1.119 rillig /* The nodes on which this one depends. */
314 1.119 rillig Lst children;
315 1.119 rillig
316 1.119 rillig /* .ORDER nodes we need made. The nodes that must be made (if they're
317 1.119 rillig * made) before this node can be made, but that do not enter into the
318 1.119 rillig * datedness of this node. */
319 1.119 rillig Lst order_pred;
320 1.119 rillig /* .ORDER nodes who need us. The nodes that must be made (if they're made
321 1.119 rillig * at all) after this node is made, but that do not depend on this node,
322 1.119 rillig * in the normal sense. */
323 1.119 rillig Lst order_succ;
324 1.119 rillig
325 1.119 rillig /* #n for this cohort */
326 1.119 rillig char cohort_num[8];
327 1.119 rillig /* The number of unmade instances on the cohorts list */
328 1.119 rillig int unmade_cohorts;
329 1.129 rillig /* Pointer to the first instance of a '::' node; only set when on a
330 1.129 rillig * cohorts list */
331 1.119 rillig struct GNode *centurion;
332 1.119 rillig
333 1.122 rillig /* Last time (sequence number) we tried to make this node */
334 1.122 rillig unsigned int checked;
335 1.119 rillig
336 1.119 rillig /* The "local" variables that are specific to this target and this target
337 1.119 rillig * only, such as $@, $<, $?. */
338 1.119 rillig Hash_Table context;
339 1.119 rillig
340 1.119 rillig /* The commands to be given to a shell to create this target. */
341 1.119 rillig Lst commands;
342 1.119 rillig
343 1.119 rillig /* Suffix for the node (determined by Suff_FindDeps and opaque to everyone
344 1.119 rillig * but the Suff module) */
345 1.119 rillig struct Suff *suffix;
346 1.119 rillig
347 1.119 rillig /* filename where the GNode got defined */
348 1.119 rillig const char *fname;
349 1.119 rillig /* line number where the GNode got defined */
350 1.119 rillig int lineno;
351 1.1 cgd } GNode;
352 1.1 cgd
353 1.31 sommerfe #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute)
354 1.1 cgd /*
355 1.1 cgd * OP_NOP will return TRUE if the node with the given type was not the
356 1.1 cgd * object of a dependency operator
357 1.1 cgd */
358 1.1 cgd #define OP_NOP(t) (((t) & OP_OPMASK) == 0x00000000)
359 1.16 christos
360 1.95 joerg #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM)
361 1.1 cgd
362 1.1 cgd /*
363 1.1 cgd * The TARG_ constants are used when calling the Targ_FindNode and
364 1.1 cgd * Targ_FindList functions in targ.c. They simply tell the functions what to
365 1.1 cgd * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
366 1.1 cgd * is given, a new, empty node will be created for the target, placed in the
367 1.1 cgd * table of all targets and its address returned. If TARG_NOCREATE is given,
368 1.76 dsl * a NULL pointer will be returned.
369 1.1 cgd */
370 1.64 dsl #define TARG_NOCREATE 0x00 /* don't create it */
371 1.1 cgd #define TARG_CREATE 0x01 /* create node if not found */
372 1.64 dsl #define TARG_NOHASH 0x02 /* don't look in/add to hash table */
373 1.1 cgd
374 1.1 cgd /*
375 1.1 cgd * Error levels for parsing. PARSE_FATAL means the process cannot continue
376 1.1 cgd * once the makefile has been parsed. PARSE_WARNING means it can. Passed
377 1.1 cgd * as the first argument to Parse_Error.
378 1.1 cgd */
379 1.104 sjg #define PARSE_INFO 3
380 1.1 cgd #define PARSE_WARNING 2
381 1.1 cgd #define PARSE_FATAL 1
382 1.1 cgd
383 1.1 cgd /*
384 1.1 cgd * Values returned by Cond_Eval.
385 1.1 cgd */
386 1.113 rillig typedef enum {
387 1.113 rillig COND_PARSE, /* Parse the next lines */
388 1.113 rillig COND_SKIP, /* Skip the next lines */
389 1.113 rillig COND_INVALID /* Not a conditional statement */
390 1.113 rillig } CondEvalResult;
391 1.1 cgd
392 1.1 cgd /*
393 1.1 cgd * Definitions for the "local" variables. Used only for clarity.
394 1.1 cgd */
395 1.1 cgd #define TARGET "@" /* Target of dependency */
396 1.1 cgd #define OODATE "?" /* All out-of-date sources */
397 1.1 cgd #define ALLSRC ">" /* All sources */
398 1.1 cgd #define IMPSRC "<" /* Source implied by transformation */
399 1.1 cgd #define PREFIX "*" /* Common prefix */
400 1.1 cgd #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
401 1.1 cgd #define MEMBER "%" /* Member in "archive(member)" syntax */
402 1.1 cgd
403 1.1 cgd #define FTARGET "@F" /* file part of TARGET */
404 1.1 cgd #define DTARGET "@D" /* directory part of TARGET */
405 1.1 cgd #define FIMPSRC "<F" /* file part of IMPSRC */
406 1.1 cgd #define DIMPSRC "<D" /* directory part of IMPSRC */
407 1.1 cgd #define FPREFIX "*F" /* file part of PREFIX */
408 1.1 cgd #define DPREFIX "*D" /* directory part of PREFIX */
409 1.1 cgd
410 1.1 cgd /*
411 1.11 christos * Global Variables
412 1.1 cgd */
413 1.1 cgd extern Lst create; /* The list of target names specified on the
414 1.1 cgd * command line. used to resolve #if
415 1.1 cgd * make(...) statements */
416 1.1 cgd extern Lst dirSearchPath; /* The list of directories to search when
417 1.1 cgd * looking for targets */
418 1.1 cgd
419 1.3 cgd extern Boolean compatMake; /* True if we are make compatible */
420 1.1 cgd extern Boolean ignoreErrors; /* True if should ignore all errors */
421 1.1 cgd extern Boolean beSilent; /* True if should print no commands */
422 1.1 cgd extern Boolean noExecute; /* True if should execute nothing */
423 1.31 sommerfe extern Boolean noRecursiveExecute; /* True if should execute nothing */
424 1.1 cgd extern Boolean allPrecious; /* True if every target is precious */
425 1.101 dholland extern Boolean deleteOnError; /* True if failed targets should be deleted */
426 1.1 cgd extern Boolean keepgoing; /* True if should continue on unaffected
427 1.1 cgd * portions of the graph when have an error
428 1.1 cgd * in one portion */
429 1.1 cgd extern Boolean touchFlag; /* TRUE if targets should just be 'touched'
430 1.1 cgd * if out of date. Set by the -t flag */
431 1.1 cgd extern Boolean queryFlag; /* TRUE if we aren't supposed to really make
432 1.1 cgd * anything, just see if the targets are out-
433 1.1 cgd * of-date */
434 1.71 dsl extern Boolean doing_depend; /* TRUE if processing .depend */
435 1.1 cgd
436 1.1 cgd extern Boolean checkEnvFirst; /* TRUE if environment should be searched for
437 1.1 cgd * variables before the global context */
438 1.1 cgd
439 1.32 christos extern Boolean parseWarnFatal; /* TRUE if makefile parsing warnings are
440 1.32 christos * treated as errors */
441 1.45 thorpej
442 1.45 thorpej extern Boolean varNoExportEnv; /* TRUE if we should not export variables
443 1.45 thorpej * set on the command line to the env. */
444 1.32 christos
445 1.1 cgd extern GNode *DEFAULT; /* .DEFAULT rule */
446 1.1 cgd
447 1.92 sjg extern GNode *VAR_INTERNAL; /* Variables defined internally by make
448 1.92 sjg * which should not override those set by
449 1.92 sjg * makefiles.
450 1.92 sjg */
451 1.1 cgd extern GNode *VAR_GLOBAL; /* Variables defined in a global context, e.g
452 1.1 cgd * in the Makefile itself */
453 1.1 cgd extern GNode *VAR_CMD; /* Variables defined on the command line */
454 1.1 cgd extern char var_Error[]; /* Value returned by Var_Parse when an error
455 1.1 cgd * is encountered. It actually points to
456 1.1 cgd * an empty string, so naive callers needn't
457 1.1 cgd * worry about it. */
458 1.1 cgd
459 1.1 cgd extern time_t now; /* The time at the start of this whole
460 1.1 cgd * process */
461 1.1 cgd
462 1.1 cgd extern Boolean oldVars; /* Do old-style variable substitution */
463 1.9 christos
464 1.9 christos extern Lst sysIncPath; /* The system include path. */
465 1.38 tv extern Lst defIncPath; /* The default include path. */
466 1.32 christos
467 1.85 joerg extern char curdir[]; /* Startup directory */
468 1.32 christos extern char *progname; /* The program name */
469 1.80 sjg extern char *makeDependfile; /* .depend */
470 1.88 sjg extern char **savedEnv; /* if we replaced environ this will be non-NULL */
471 1.30 sommerfe
472 1.111 rillig extern int makelevel;
473 1.111 rillig
474 1.82 sjg /*
475 1.82 sjg * We cannot vfork() in a child of vfork().
476 1.82 sjg * Most systems do not enforce this but some do.
477 1.82 sjg */
478 1.82 sjg #define vFork() ((getpid() == myPid) ? vfork() : fork())
479 1.82 sjg extern pid_t myPid;
480 1.82 sjg
481 1.30 sommerfe #define MAKEFLAGS ".MAKEFLAGS"
482 1.35 sjg #define MAKEOVERRIDES ".MAKEOVERRIDES"
483 1.70 sjg #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX" /* prefix for job target output */
484 1.70 sjg #define MAKE_EXPORTED ".MAKE.EXPORTED" /* variables we export */
485 1.70 sjg #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all the makefiles we read */
486 1.79 sjg #define MAKE_LEVEL ".MAKE.LEVEL" /* recursion level */
487 1.80 sjg #define MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
488 1.80 sjg #define MAKE_DEPENDFILE ".MAKE.DEPENDFILE" /* .depend */
489 1.80 sjg #define MAKE_MODE ".MAKE.MODE"
490 1.91 sjg #ifndef MAKE_LEVEL_ENV
491 1.91 sjg # define MAKE_LEVEL_ENV "MAKELEVEL"
492 1.91 sjg #endif
493 1.1 cgd
494 1.1 cgd /*
495 1.1 cgd * debug control:
496 1.1 cgd * There is one bit per module. It is up to the module what debug
497 1.1 cgd * information to print.
498 1.1 cgd */
499 1.117 rillig extern FILE *debug_file; /* Output is written here - default stderr */
500 1.1 cgd extern int debug;
501 1.75 christos #define DEBUG_ARCH 0x00001
502 1.75 christos #define DEBUG_COND 0x00002
503 1.75 christos #define DEBUG_DIR 0x00004
504 1.75 christos #define DEBUG_GRAPH1 0x00008
505 1.75 christos #define DEBUG_GRAPH2 0x00010
506 1.75 christos #define DEBUG_JOB 0x00020
507 1.75 christos #define DEBUG_MAKE 0x00040
508 1.75 christos #define DEBUG_SUFF 0x00080
509 1.75 christos #define DEBUG_TARG 0x00100
510 1.75 christos #define DEBUG_VAR 0x00200
511 1.75 christos #define DEBUG_FOR 0x00400
512 1.75 christos #define DEBUG_SHELL 0x00800
513 1.75 christos #define DEBUG_ERROR 0x01000
514 1.75 christos #define DEBUG_LOUD 0x02000
515 1.83 sjg #define DEBUG_META 0x04000
516 1.110 sjg #define DEBUG_HASH 0x08000
517 1.83 sjg
518 1.72 sjg #define DEBUG_GRAPH3 0x10000
519 1.55 jmc #define DEBUG_SCRIPT 0x20000
520 1.57 dsl #define DEBUG_PARSE 0x40000
521 1.75 christos #define DEBUG_CWD 0x80000
522 1.1 cgd
523 1.112 sjg #define DEBUG_LINT 0x100000
524 1.112 sjg
525 1.1 cgd #define CONCAT(a,b) a##b
526 1.1 cgd
527 1.1 cgd #define DEBUG(module) (debug & CONCAT(DEBUG_,module))
528 1.1 cgd
529 1.1 cgd #include "nonints.h"
530 1.1 cgd
531 1.44 wiz int Make_TimeStamp(GNode *, GNode *);
532 1.44 wiz Boolean Make_OODate(GNode *);
533 1.64 dsl void Make_ExpandUse(Lst);
534 1.44 wiz time_t Make_Recheck(GNode *);
535 1.44 wiz void Make_HandleUse(GNode *, GNode *);
536 1.44 wiz void Make_Update(GNode *);
537 1.44 wiz void Make_DoAllVar(GNode *);
538 1.44 wiz Boolean Make_Run(Lst);
539 1.108 sjg int dieQuietly(GNode *, int);
540 1.80 sjg void PrintOnError(GNode *, const char *);
541 1.44 wiz void Main_ExportMAKEFLAGS(Boolean);
542 1.102 christos Boolean Main_SetObjdir(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
543 1.81 sjg int mkTempFile(const char *, char **);
544 1.86 sjg int str2Lst_Append(Lst, char *, const char *);
545 1.100 sjg int cached_lstat(const char *, void *);
546 1.100 sjg int cached_stat(const char *, void *);
547 1.126 rillig void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
548 1.46 christos
549 1.46 christos #ifdef __GNUC__
550 1.46 christos #define UNCONST(ptr) ({ \
551 1.46 christos union __unconst { \
552 1.46 christos const void *__cp; \
553 1.46 christos void *__p; \
554 1.46 christos } __d; \
555 1.46 christos __d.__cp = ptr, __d.__p; })
556 1.46 christos #else
557 1.74 christos #define UNCONST(ptr) (void *)(ptr)
558 1.49 sjg #endif
559 1.49 sjg
560 1.49 sjg #ifndef MIN
561 1.49 sjg #define MIN(a, b) ((a < b) ? a : b)
562 1.49 sjg #endif
563 1.49 sjg #ifndef MAX
564 1.49 sjg #define MAX(a, b) ((a > b) ? a : b)
565 1.46 christos #endif
566 1.3 cgd
567 1.96 pooka /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
568 1.96 pooka #include <limits.h>
569 1.96 pooka #ifndef MAXPATHLEN
570 1.96 pooka #define MAXPATHLEN 4096
571 1.96 pooka #endif
572 1.96 pooka #ifndef PATH_MAX
573 1.96 pooka #define PATH_MAX MAXPATHLEN
574 1.96 pooka #endif
575 1.96 pooka
576 1.103 sjg #if defined(SYSV)
577 1.103 sjg #define KILLPG(pid, sig) kill(-(pid), (sig))
578 1.103 sjg #else
579 1.103 sjg #define KILLPG(pid, sig) killpg((pid), (sig))
580 1.103 sjg #endif
581 1.103 sjg
582 1.116 rillig #endif /* MAKE_MAKE_H */
583