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