make.h revision 1.78 1 1.78 dsl /* $NetBSD: make.h,v 1.78 2009/01/24 14:43:28 dsl 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.1 cgd #ifndef _MAKE_H_
81 1.1 cgd #define _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.44 wiz #include <ctype.h>
87 1.3 cgd #include <stdio.h>
88 1.44 wiz #include <stdlib.h>
89 1.1 cgd #include <string.h>
90 1.44 wiz #include <unistd.h>
91 1.12 christos
92 1.19 tv #ifdef BSD4_4
93 1.12 christos # include <sys/cdefs.h>
94 1.4 glass #endif
95 1.12 christos
96 1.52 yamt #if !defined(__GNUC_PREREQ__)
97 1.52 yamt #if defined(__GNUC__)
98 1.52 yamt #define __GNUC_PREREQ__(x, y) \
99 1.52 yamt ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \
100 1.52 yamt (__GNUC__ > (x)))
101 1.52 yamt #else /* defined(__GNUC__) */
102 1.52 yamt #define __GNUC_PREREQ__(x, y) 0
103 1.52 yamt #endif /* defined(__GNUC__) */
104 1.52 yamt #endif /* !defined(__GNUC_PREREQ__) */
105 1.52 yamt
106 1.51 jmc #if !defined(__unused)
107 1.51 jmc #if __GNUC_PREREQ__(2, 7)
108 1.51 jmc #define __unused __attribute__((__unused__))
109 1.51 jmc #else
110 1.51 jmc #define __unused /* delete */
111 1.51 jmc #endif
112 1.51 jmc #endif
113 1.44 wiz
114 1.1 cgd #include "sprite.h"
115 1.1 cgd #include "lst.h"
116 1.22 mycroft #include "hash.h"
117 1.1 cgd #include "config.h"
118 1.3 cgd #include "buf.h"
119 1.78 dsl #include "make_malloc.h"
120 1.1 cgd
121 1.1 cgd /*-
122 1.1 cgd * The structure for an individual graph node. Each node has several
123 1.1 cgd * pieces of data associated with it.
124 1.1 cgd * 1) the name of the target it describes
125 1.1 cgd * 2) the location of the target file in the file system.
126 1.1 cgd * 3) the type of operator used to define its sources (qv. parse.c)
127 1.1 cgd * 4) whether it is involved in this invocation of make
128 1.1 cgd * 5) whether the target has been remade
129 1.1 cgd * 6) whether any of its children has been remade
130 1.1 cgd * 7) the number of its children that are, as yet, unmade
131 1.1 cgd * 8) its modification time
132 1.1 cgd * 9) the modification time of its youngest child (qv. make.c)
133 1.58 apb * 10) a list of nodes for which this is a source (parents)
134 1.58 apb * 11) a list of nodes on which this depends (children)
135 1.1 cgd * 12) a list of nodes that depend on this, as gleaned from the
136 1.58 apb * transformation rules (iParents)
137 1.58 apb * 13) a list of ancestor nodes, which includes parents, iParents,
138 1.58 apb * and recursive parents of parents
139 1.58 apb * 14) a list of nodes of the same name created by the :: operator
140 1.58 apb * 15) a list of nodes that must be made (if they're made) before
141 1.58 apb * this node can be, but that do not enter into the datedness of
142 1.1 cgd * this node.
143 1.58 apb * 16) a list of nodes that must be made (if they're made) before
144 1.58 apb * this node or any child of this node can be, but that do not
145 1.58 apb * enter into the datedness of this node.
146 1.58 apb * 17) a list of nodes that must be made (if they're made) after
147 1.1 cgd * this node is, but that do not depend on this node, in the
148 1.1 cgd * normal sense.
149 1.58 apb * 18) a Lst of ``local'' variables that are specific to this target
150 1.1 cgd * and this target only (qv. var.c [$@ $< $?, etc.])
151 1.58 apb * 19) a Lst of strings that are commands to be given to a shell
152 1.11 christos * to create this target.
153 1.1 cgd */
154 1.1 cgd typedef struct GNode {
155 1.1 cgd char *name; /* The target's name */
156 1.14 christos char *uname; /* The unexpanded name of a .USE node */
157 1.1 cgd char *path; /* The full pathname of the file */
158 1.74 christos int type; /* Its type (see the OP flags, below) */
159 1.1 cgd
160 1.21 christos int flags;
161 1.64 dsl #define REMAKE 0x1 /* this target needs to be (re)made */
162 1.21 christos #define CHILDMADE 0x2 /* children of this target were made */
163 1.21 christos #define FORCE 0x4 /* children don't exist, and we pretend made */
164 1.64 dsl #define DONE_WAIT 0x8 /* Set by Make_ProcessWait() */
165 1.64 dsl #define DONE_ORDER 0x10 /* Build requested by .ORDER processing */
166 1.71 dsl #define FROM_DEPEND 0x20 /* Node created from .depend */
167 1.64 dsl #define CYCLE 0x1000 /* Used by MakePrintStatus */
168 1.66 dsl #define DONECYCLE 0x2000 /* Used by MakePrintStatus */
169 1.64 dsl enum enum_made {
170 1.64 dsl UNMADE, DEFERRED, REQUESTED, BEINGMADE,
171 1.64 dsl MADE, UPTODATE, ERROR, ABORTED
172 1.1 cgd } made; /* Set to reflect the state of processing
173 1.1 cgd * on this node:
174 1.1 cgd * UNMADE - Not examined yet
175 1.64 dsl * DEFERRED - Examined once (building child)
176 1.64 dsl * REQUESTED - on toBeMade list
177 1.1 cgd * BEINGMADE - Target is already being made.
178 1.64 dsl * Indicates a cycle in the graph.
179 1.1 cgd * MADE - Was out-of-date and has been made
180 1.1 cgd * UPTODATE - Was already up-to-date
181 1.37 wiz * ERROR - An error occurred while it was being
182 1.1 cgd * made (used only in compat mode)
183 1.1 cgd * ABORTED - The target was aborted due to
184 1.1 cgd * an error making an inferior (compat).
185 1.1 cgd */
186 1.1 cgd int unmade; /* The number of unmade children */
187 1.1 cgd
188 1.18 fair time_t mtime; /* Its modification time */
189 1.18 fair time_t cmtime; /* The modification time of its youngest
190 1.1 cgd * child */
191 1.1 cgd
192 1.1 cgd Lst iParents; /* Links to parents for which this is an
193 1.1 cgd * implied source, if any */
194 1.1 cgd Lst cohorts; /* Other nodes for the :: operator */
195 1.1 cgd Lst parents; /* Nodes that depend on this one */
196 1.1 cgd Lst children; /* Nodes on which this one depends */
197 1.64 dsl Lst order_pred; /* .ORDER nodes we need made */
198 1.64 dsl Lst order_succ; /* .ORDER nodes who need us */
199 1.64 dsl
200 1.64 dsl char cohort_num[8]; /* #n for this cohort */
201 1.43 pk int unmade_cohorts;/* # of unmade instances on the
202 1.43 pk cohorts list */
203 1.43 pk struct GNode *centurion; /* Pointer to the first instance of a ::
204 1.43 pk node; only set when on a cohorts list */
205 1.66 dsl unsigned int checked; /* Last time we tried to makle this node */
206 1.1 cgd
207 1.22 mycroft Hash_Table context; /* The local variables */
208 1.1 cgd Lst commands; /* Creation commands */
209 1.1 cgd
210 1.1 cgd struct _Suff *suffix; /* Suffix for the node (determined by
211 1.1 cgd * Suff_FindDeps and opaque to everyone
212 1.1 cgd * but the Suff module) */
213 1.65 dsl const char *fname; /* filename where the GNode got defined */
214 1.74 christos int lineno; /* line number where the GNode got defined */
215 1.1 cgd } GNode;
216 1.1 cgd
217 1.1 cgd /*
218 1.1 cgd * The OP_ constants are used when parsing a dependency line as a way of
219 1.1 cgd * communicating to other parts of the program the way in which a target
220 1.1 cgd * should be made. These constants are bitwise-OR'ed together and
221 1.1 cgd * placed in the 'type' field of each node. Any node that has
222 1.1 cgd * a 'type' field which satisfies the OP_NOP function was never never on
223 1.1 cgd * the lefthand side of an operator, though it may have been on the
224 1.11 christos * righthand side...
225 1.1 cgd */
226 1.1 cgd #define OP_DEPENDS 0x00000001 /* Execution of commands depends on
227 1.1 cgd * kids (:) */
228 1.1 cgd #define OP_FORCE 0x00000002 /* Always execute commands (!) */
229 1.1 cgd #define OP_DOUBLEDEP 0x00000004 /* Execution of commands depends on kids
230 1.1 cgd * per line (::) */
231 1.1 cgd #define OP_OPMASK (OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP)
232 1.1 cgd
233 1.1 cgd #define OP_OPTIONAL 0x00000008 /* Don't care if the target doesn't
234 1.1 cgd * exist and can't be created */
235 1.1 cgd #define OP_USE 0x00000010 /* Use associated commands for parents */
236 1.1 cgd #define OP_EXEC 0x00000020 /* Target is never out of date, but always
237 1.1 cgd * execute commands anyway. Its time
238 1.1 cgd * doesn't matter, so it has none...sort
239 1.1 cgd * of */
240 1.1 cgd #define OP_IGNORE 0x00000040 /* Ignore errors when creating the node */
241 1.1 cgd #define OP_PRECIOUS 0x00000080 /* Don't remove the target when
242 1.1 cgd * interrupted */
243 1.1 cgd #define OP_SILENT 0x00000100 /* Don't echo commands when executed */
244 1.40 christos #define OP_MAKE 0x00000200 /* Target is a recursive make so its
245 1.1 cgd * commands should always be executed when
246 1.1 cgd * it is out of date, regardless of the
247 1.1 cgd * state of the -n or -t flags */
248 1.1 cgd #define OP_JOIN 0x00000400 /* Target is out-of-date only if any of its
249 1.1 cgd * children was out-of-date */
250 1.41 christos #define OP_MADE 0x00000800 /* Assume the children of the node have
251 1.41 christos * been already made */
252 1.54 christos #define OP_SPECIAL 0x00001000 /* Special .BEGIN, .END, .INTERRUPT */
253 1.36 christos #define OP_USEBEFORE 0x00002000 /* Like .USE, only prepend commands */
254 1.1 cgd #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents.
255 1.1 cgd * I.e. it doesn't show up in the parents's
256 1.1 cgd * local variables. */
257 1.1 cgd #define OP_NOTMAIN 0x00008000 /* The node is exempt from normal 'main
258 1.1 cgd * target' processing in parse.c */
259 1.6 christos #define OP_PHONY 0x00010000 /* Not a file target; run always */
260 1.17 gwr #define OP_NOPATH 0x00020000 /* Don't search for file in the path */
261 1.64 dsl #define OP_WAIT 0x00040000 /* .WAIT phony node */
262 1.1 cgd /* Attributes applied by PMake */
263 1.1 cgd #define OP_TRANSFORM 0x80000000 /* The node is a transformation rule */
264 1.1 cgd #define OP_MEMBER 0x40000000 /* Target is a member of an archive */
265 1.1 cgd #define OP_LIB 0x20000000 /* Target is a library */
266 1.1 cgd #define OP_ARCHV 0x10000000 /* Target is an archive construct */
267 1.1 cgd #define OP_HAS_COMMANDS 0x08000000 /* Target has all the commands it should.
268 1.1 cgd * Used when parsing to catch multiple
269 1.1 cgd * commands for a target */
270 1.1 cgd #define OP_SAVE_CMDS 0x04000000 /* Saving commands on .END (Compat) */
271 1.1 cgd #define OP_DEPS_FOUND 0x02000000 /* Already processed by Suff_FindDeps */
272 1.29 mycroft #define OP_MARK 0x01000000 /* Node found while expanding .ALLSRC */
273 1.1 cgd
274 1.31 sommerfe #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute)
275 1.1 cgd /*
276 1.1 cgd * OP_NOP will return TRUE if the node with the given type was not the
277 1.1 cgd * object of a dependency operator
278 1.1 cgd */
279 1.1 cgd #define OP_NOP(t) (((t) & OP_OPMASK) == 0x00000000)
280 1.16 christos
281 1.16 christos #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM)
282 1.1 cgd
283 1.1 cgd /*
284 1.1 cgd * The TARG_ constants are used when calling the Targ_FindNode and
285 1.1 cgd * Targ_FindList functions in targ.c. They simply tell the functions what to
286 1.1 cgd * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
287 1.1 cgd * is given, a new, empty node will be created for the target, placed in the
288 1.1 cgd * table of all targets and its address returned. If TARG_NOCREATE is given,
289 1.76 dsl * a NULL pointer will be returned.
290 1.1 cgd */
291 1.64 dsl #define TARG_NOCREATE 0x00 /* don't create it */
292 1.1 cgd #define TARG_CREATE 0x01 /* create node if not found */
293 1.64 dsl #define TARG_NOHASH 0x02 /* don't look in/add to hash table */
294 1.1 cgd
295 1.1 cgd /*
296 1.1 cgd * These constants are all used by the Str_Concat function to decide how the
297 1.1 cgd * final string should look. If STR_ADDSPACE is given, a space will be
298 1.1 cgd * placed between the two strings. If STR_ADDSLASH is given, a '/' will
299 1.1 cgd * be used instead of a space. If neither is given, no intervening characters
300 1.1 cgd * will be placed between the two strings in the final output. If the
301 1.1 cgd * STR_DOFREE bit is set, the two input strings will be freed before
302 1.11 christos * Str_Concat returns.
303 1.1 cgd */
304 1.1 cgd #define STR_ADDSPACE 0x01 /* add a space when Str_Concat'ing */
305 1.46 christos #define STR_ADDSLASH 0x02 /* add a slash when Str_Concat'ing */
306 1.1 cgd
307 1.1 cgd /*
308 1.1 cgd * Error levels for parsing. PARSE_FATAL means the process cannot continue
309 1.1 cgd * once the makefile has been parsed. PARSE_WARNING means it can. Passed
310 1.1 cgd * as the first argument to Parse_Error.
311 1.1 cgd */
312 1.1 cgd #define PARSE_WARNING 2
313 1.1 cgd #define PARSE_FATAL 1
314 1.1 cgd
315 1.1 cgd /*
316 1.1 cgd * Values returned by Cond_Eval.
317 1.1 cgd */
318 1.1 cgd #define COND_PARSE 0 /* Parse the next lines */
319 1.1 cgd #define COND_SKIP 1 /* Skip the next lines */
320 1.1 cgd #define COND_INVALID 2 /* Not a conditional statement */
321 1.1 cgd
322 1.1 cgd /*
323 1.1 cgd * Definitions for the "local" variables. Used only for clarity.
324 1.1 cgd */
325 1.1 cgd #define TARGET "@" /* Target of dependency */
326 1.1 cgd #define OODATE "?" /* All out-of-date sources */
327 1.1 cgd #define ALLSRC ">" /* All sources */
328 1.1 cgd #define IMPSRC "<" /* Source implied by transformation */
329 1.1 cgd #define PREFIX "*" /* Common prefix */
330 1.1 cgd #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
331 1.1 cgd #define MEMBER "%" /* Member in "archive(member)" syntax */
332 1.1 cgd
333 1.1 cgd #define FTARGET "@F" /* file part of TARGET */
334 1.1 cgd #define DTARGET "@D" /* directory part of TARGET */
335 1.1 cgd #define FIMPSRC "<F" /* file part of IMPSRC */
336 1.1 cgd #define DIMPSRC "<D" /* directory part of IMPSRC */
337 1.1 cgd #define FPREFIX "*F" /* file part of PREFIX */
338 1.1 cgd #define DPREFIX "*D" /* directory part of PREFIX */
339 1.1 cgd
340 1.1 cgd /*
341 1.11 christos * Global Variables
342 1.1 cgd */
343 1.1 cgd extern Lst create; /* The list of target names specified on the
344 1.1 cgd * command line. used to resolve #if
345 1.1 cgd * make(...) statements */
346 1.1 cgd extern Lst dirSearchPath; /* The list of directories to search when
347 1.1 cgd * looking for targets */
348 1.1 cgd
349 1.3 cgd extern Boolean compatMake; /* True if we are make compatible */
350 1.1 cgd extern Boolean ignoreErrors; /* True if should ignore all errors */
351 1.1 cgd extern Boolean beSilent; /* True if should print no commands */
352 1.1 cgd extern Boolean noExecute; /* True if should execute nothing */
353 1.31 sommerfe extern Boolean noRecursiveExecute; /* True if should execute nothing */
354 1.1 cgd extern Boolean allPrecious; /* True if every target is precious */
355 1.1 cgd extern Boolean keepgoing; /* True if should continue on unaffected
356 1.1 cgd * portions of the graph when have an error
357 1.1 cgd * in one portion */
358 1.1 cgd extern Boolean touchFlag; /* TRUE if targets should just be 'touched'
359 1.1 cgd * if out of date. Set by the -t flag */
360 1.1 cgd extern Boolean queryFlag; /* TRUE if we aren't supposed to really make
361 1.1 cgd * anything, just see if the targets are out-
362 1.1 cgd * of-date */
363 1.71 dsl extern Boolean doing_depend; /* TRUE if processing .depend */
364 1.1 cgd
365 1.1 cgd extern Boolean checkEnvFirst; /* TRUE if environment should be searched for
366 1.1 cgd * variables before the global context */
367 1.30 sommerfe extern Boolean jobServer; /* a jobServer already exists */
368 1.1 cgd
369 1.32 christos extern Boolean parseWarnFatal; /* TRUE if makefile parsing warnings are
370 1.32 christos * treated as errors */
371 1.45 thorpej
372 1.45 thorpej extern Boolean varNoExportEnv; /* TRUE if we should not export variables
373 1.45 thorpej * set on the command line to the env. */
374 1.32 christos
375 1.1 cgd extern GNode *DEFAULT; /* .DEFAULT rule */
376 1.1 cgd
377 1.1 cgd extern GNode *VAR_GLOBAL; /* Variables defined in a global context, e.g
378 1.1 cgd * in the Makefile itself */
379 1.1 cgd extern GNode *VAR_CMD; /* Variables defined on the command line */
380 1.26 mycroft extern GNode *VAR_FOR; /* Iteration variables */
381 1.1 cgd extern char var_Error[]; /* Value returned by Var_Parse when an error
382 1.1 cgd * is encountered. It actually points to
383 1.1 cgd * an empty string, so naive callers needn't
384 1.1 cgd * worry about it. */
385 1.1 cgd
386 1.1 cgd extern time_t now; /* The time at the start of this whole
387 1.1 cgd * process */
388 1.1 cgd
389 1.1 cgd extern Boolean oldVars; /* Do old-style variable substitution */
390 1.9 christos
391 1.9 christos extern Lst sysIncPath; /* The system include path. */
392 1.38 tv extern Lst defIncPath; /* The default include path. */
393 1.32 christos
394 1.32 christos extern char *progname; /* The program name */
395 1.30 sommerfe
396 1.30 sommerfe #define MAKEFLAGS ".MAKEFLAGS"
397 1.35 sjg #define MAKEOVERRIDES ".MAKEOVERRIDES"
398 1.70 sjg #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX" /* prefix for job target output */
399 1.70 sjg #define MAKE_EXPORTED ".MAKE.EXPORTED" /* variables we export */
400 1.70 sjg #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all the makefiles we read */
401 1.1 cgd
402 1.1 cgd /*
403 1.1 cgd * debug control:
404 1.1 cgd * There is one bit per module. It is up to the module what debug
405 1.1 cgd * information to print.
406 1.1 cgd */
407 1.63 dsl FILE *debug_file; /* Output written here - default stdout */
408 1.1 cgd extern int debug;
409 1.75 christos #define DEBUG_ARCH 0x00001
410 1.75 christos #define DEBUG_COND 0x00002
411 1.75 christos #define DEBUG_DIR 0x00004
412 1.75 christos #define DEBUG_GRAPH1 0x00008
413 1.75 christos #define DEBUG_GRAPH2 0x00010
414 1.75 christos #define DEBUG_JOB 0x00020
415 1.75 christos #define DEBUG_MAKE 0x00040
416 1.75 christos #define DEBUG_SUFF 0x00080
417 1.75 christos #define DEBUG_TARG 0x00100
418 1.75 christos #define DEBUG_VAR 0x00200
419 1.75 christos #define DEBUG_FOR 0x00400
420 1.75 christos #define DEBUG_SHELL 0x00800
421 1.75 christos #define DEBUG_ERROR 0x01000
422 1.75 christos #define DEBUG_LOUD 0x02000
423 1.72 sjg #define DEBUG_GRAPH3 0x10000
424 1.55 jmc #define DEBUG_SCRIPT 0x20000
425 1.57 dsl #define DEBUG_PARSE 0x40000
426 1.75 christos #define DEBUG_CWD 0x80000
427 1.1 cgd
428 1.1 cgd #define CONCAT(a,b) a##b
429 1.1 cgd
430 1.1 cgd #define DEBUG(module) (debug & CONCAT(DEBUG_,module))
431 1.1 cgd
432 1.1 cgd #include "nonints.h"
433 1.1 cgd
434 1.44 wiz int Make_TimeStamp(GNode *, GNode *);
435 1.44 wiz Boolean Make_OODate(GNode *);
436 1.64 dsl void Make_ExpandUse(Lst);
437 1.44 wiz time_t Make_Recheck(GNode *);
438 1.44 wiz void Make_HandleUse(GNode *, GNode *);
439 1.44 wiz void Make_Update(GNode *);
440 1.44 wiz void Make_DoAllVar(GNode *);
441 1.44 wiz Boolean Make_Run(Lst);
442 1.46 christos char * Check_Cwd_Cmd(const char *);
443 1.46 christos void Check_Cwd(const char **);
444 1.46 christos void PrintOnError(const char *);
445 1.44 wiz void Main_ExportMAKEFLAGS(Boolean);
446 1.44 wiz Boolean Main_SetObjdir(const char *);
447 1.46 christos
448 1.46 christos #ifdef __GNUC__
449 1.46 christos #define UNCONST(ptr) ({ \
450 1.46 christos union __unconst { \
451 1.46 christos const void *__cp; \
452 1.46 christos void *__p; \
453 1.46 christos } __d; \
454 1.46 christos __d.__cp = ptr, __d.__p; })
455 1.46 christos #else
456 1.74 christos #define UNCONST(ptr) (void *)(ptr)
457 1.49 sjg #endif
458 1.49 sjg
459 1.49 sjg #ifndef MIN
460 1.49 sjg #define MIN(a, b) ((a < b) ? a : b)
461 1.49 sjg #endif
462 1.49 sjg #ifndef MAX
463 1.49 sjg #define MAX(a, b) ((a > b) ? a : b)
464 1.46 christos #endif
465 1.3 cgd
466 1.3 cgd #endif /* _MAKE_H_ */
467