make.h revision 1.4 1 /*
2 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
3 * Copyright (c) 1988, 1989 by Adam de Boor
4 * Copyright (c) 1989 by Berkeley Softworks
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * from: @(#)make.h 5.13 (Berkeley) 3/1/91
39 * $Id: make.h,v 1.4 1994/04/17 03:09:51 glass Exp $
40 */
41
42 /*-
43 * make.h --
44 * The global definitions for pmake
45 */
46
47 #ifndef _MAKE_H_
48 #define _MAKE_H_
49
50 #include <sys/types.h>
51 #include <stdio.h>
52 #include <string.h>
53 #include <ctype.h>
54 #ifndef MAKE_BOOTSTRAP
55 #include <sys/cdefs.h>
56 #endif
57 #if __STDC__
58 #include <stdlib.h>
59 #include <unistd.h>
60 #endif
61 #include "sprite.h"
62 #include "lst.h"
63 #include "config.h"
64 #include "buf.h"
65
66 /*-
67 * The structure for an individual graph node. Each node has several
68 * pieces of data associated with it.
69 * 1) the name of the target it describes
70 * 2) the location of the target file in the file system.
71 * 3) the type of operator used to define its sources (qv. parse.c)
72 * 4) whether it is involved in this invocation of make
73 * 5) whether the target has been remade
74 * 6) whether any of its children has been remade
75 * 7) the number of its children that are, as yet, unmade
76 * 8) its modification time
77 * 9) the modification time of its youngest child (qv. make.c)
78 * 10) a list of nodes for which this is a source
79 * 11) a list of nodes on which this depends
80 * 12) a list of nodes that depend on this, as gleaned from the
81 * transformation rules.
82 * 13) a list of nodes of the same name created by the :: operator
83 * 14) a list of nodes that must be made (if they're made) before
84 * this node can be, but that do no enter into the datedness of
85 * this node.
86 * 15) a list of nodes that must be made (if they're made) after
87 * this node is, but that do not depend on this node, in the
88 * normal sense.
89 * 16) a Lst of ``local'' variables that are specific to this target
90 * and this target only (qv. var.c [$@ $< $?, etc.])
91 * 17) a Lst of strings that are commands to be given to a shell
92 * to create this target.
93 */
94 typedef struct GNode {
95 char *name; /* The target's name */
96 char *path; /* The full pathname of the file */
97 int type; /* Its type (see the OP flags, below) */
98
99 Boolean make; /* TRUE if this target needs to be remade */
100 enum {
101 UNMADE, BEINGMADE, MADE, UPTODATE, ERROR, ABORTED,
102 CYCLE, ENDCYCLE,
103 } made; /* Set to reflect the state of processing
104 * on this node:
105 * UNMADE - Not examined yet
106 * BEINGMADE - Target is already being made.
107 * Indicates a cycle in the graph. (compat
108 * mode only)
109 * MADE - Was out-of-date and has been made
110 * UPTODATE - Was already up-to-date
111 * ERROR - An error occured while it was being
112 * made (used only in compat mode)
113 * ABORTED - The target was aborted due to
114 * an error making an inferior (compat).
115 * CYCLE - Marked as potentially being part of
116 * a graph cycle. If we come back to a
117 * node marked this way, it is printed
118 * and 'made' is changed to ENDCYCLE.
119 * ENDCYCLE - the cycle has been completely
120 * printed. Go back and unmark all its
121 * members.
122 */
123 Boolean childMade; /* TRUE if one of this target's children was
124 * made */
125 int unmade; /* The number of unmade children */
126
127 int mtime; /* Its modification time */
128 int cmtime; /* The modification time of its youngest
129 * child */
130
131 Lst iParents; /* Links to parents for which this is an
132 * implied source, if any */
133 Lst cohorts; /* Other nodes for the :: operator */
134 Lst parents; /* Nodes that depend on this one */
135 Lst children; /* Nodes on which this one depends */
136 Lst successors; /* Nodes that must be made after this one */
137 Lst preds; /* Nodes that must be made before this one */
138
139 Lst context; /* The local variables */
140 Lst commands; /* Creation commands */
141
142 struct _Suff *suffix; /* Suffix for the node (determined by
143 * Suff_FindDeps and opaque to everyone
144 * but the Suff module) */
145 } GNode;
146
147 /*
148 * Manifest constants
149 */
150 #define NILGNODE ((GNode *) NIL)
151
152 /*
153 * The OP_ constants are used when parsing a dependency line as a way of
154 * communicating to other parts of the program the way in which a target
155 * should be made. These constants are bitwise-OR'ed together and
156 * placed in the 'type' field of each node. Any node that has
157 * a 'type' field which satisfies the OP_NOP function was never never on
158 * the lefthand side of an operator, though it may have been on the
159 * righthand side...
160 */
161 #define OP_DEPENDS 0x00000001 /* Execution of commands depends on
162 * kids (:) */
163 #define OP_FORCE 0x00000002 /* Always execute commands (!) */
164 #define OP_DOUBLEDEP 0x00000004 /* Execution of commands depends on kids
165 * per line (::) */
166 #define OP_OPMASK (OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP)
167
168 #define OP_OPTIONAL 0x00000008 /* Don't care if the target doesn't
169 * exist and can't be created */
170 #define OP_USE 0x00000010 /* Use associated commands for parents */
171 #define OP_EXEC 0x00000020 /* Target is never out of date, but always
172 * execute commands anyway. Its time
173 * doesn't matter, so it has none...sort
174 * of */
175 #define OP_IGNORE 0x00000040 /* Ignore errors when creating the node */
176 #define OP_PRECIOUS 0x00000080 /* Don't remove the target when
177 * interrupted */
178 #define OP_SILENT 0x00000100 /* Don't echo commands when executed */
179 #define OP_MAKE 0x00000200 /* Target is a recurrsive make so its
180 * commands should always be executed when
181 * it is out of date, regardless of the
182 * state of the -n or -t flags */
183 #define OP_JOIN 0x00000400 /* Target is out-of-date only if any of its
184 * children was out-of-date */
185 #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents.
186 * I.e. it doesn't show up in the parents's
187 * local variables. */
188 #define OP_NOTMAIN 0x00008000 /* The node is exempt from normal 'main
189 * target' processing in parse.c */
190 /* Attributes applied by PMake */
191 #define OP_TRANSFORM 0x80000000 /* The node is a transformation rule */
192 #define OP_MEMBER 0x40000000 /* Target is a member of an archive */
193 #define OP_LIB 0x20000000 /* Target is a library */
194 #define OP_ARCHV 0x10000000 /* Target is an archive construct */
195 #define OP_HAS_COMMANDS 0x08000000 /* Target has all the commands it should.
196 * Used when parsing to catch multiple
197 * commands for a target */
198 #define OP_SAVE_CMDS 0x04000000 /* Saving commands on .END (Compat) */
199 #define OP_DEPS_FOUND 0x02000000 /* Already processed by Suff_FindDeps */
200
201 /*
202 * OP_NOP will return TRUE if the node with the given type was not the
203 * object of a dependency operator
204 */
205 #define OP_NOP(t) (((t) & OP_OPMASK) == 0x00000000)
206
207 /*
208 * The TARG_ constants are used when calling the Targ_FindNode and
209 * Targ_FindList functions in targ.c. They simply tell the functions what to
210 * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
211 * is given, a new, empty node will be created for the target, placed in the
212 * table of all targets and its address returned. If TARG_NOCREATE is given,
213 * a NIL pointer will be returned.
214 */
215 #define TARG_CREATE 0x01 /* create node if not found */
216 #define TARG_NOCREATE 0x00 /* don't create it */
217
218 /*
219 * There are several places where expandable buffers are used (parse.c and
220 * var.c). This constant is merely the starting point for those buffers. If
221 * lines tend to be much shorter than this, it would be best to reduce BSIZE.
222 * If longer, it should be increased. Reducing it will cause more copying to
223 * be done for longer lines, but will save space for shorter ones. In any
224 * case, it ought to be a power of two simply because most storage allocation
225 * schemes allocate in powers of two.
226 */
227 #define MAKE_BSIZE 256 /* starting size for expandable buffers */
228
229 /*
230 * These constants are all used by the Str_Concat function to decide how the
231 * final string should look. If STR_ADDSPACE is given, a space will be
232 * placed between the two strings. If STR_ADDSLASH is given, a '/' will
233 * be used instead of a space. If neither is given, no intervening characters
234 * will be placed between the two strings in the final output. If the
235 * STR_DOFREE bit is set, the two input strings will be freed before
236 * Str_Concat returns.
237 */
238 #define STR_ADDSPACE 0x01 /* add a space when Str_Concat'ing */
239 #define STR_DOFREE 0x02 /* free source strings after concatenation */
240 #define STR_ADDSLASH 0x04 /* add a slash when Str_Concat'ing */
241
242 /*
243 * Error levels for parsing. PARSE_FATAL means the process cannot continue
244 * once the makefile has been parsed. PARSE_WARNING means it can. Passed
245 * as the first argument to Parse_Error.
246 */
247 #define PARSE_WARNING 2
248 #define PARSE_FATAL 1
249
250 /*
251 * Values returned by Cond_Eval.
252 */
253 #define COND_PARSE 0 /* Parse the next lines */
254 #define COND_SKIP 1 /* Skip the next lines */
255 #define COND_INVALID 2 /* Not a conditional statement */
256
257 /*
258 * Definitions for the "local" variables. Used only for clarity.
259 */
260 #define TARGET "@" /* Target of dependency */
261 #define OODATE "?" /* All out-of-date sources */
262 #define ALLSRC ">" /* All sources */
263 #define IMPSRC "<" /* Source implied by transformation */
264 #define PREFIX "*" /* Common prefix */
265 #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
266 #define MEMBER "%" /* Member in "archive(member)" syntax */
267
268 #define FTARGET "@F" /* file part of TARGET */
269 #define DTARGET "@D" /* directory part of TARGET */
270 #define FIMPSRC "<F" /* file part of IMPSRC */
271 #define DIMPSRC "<D" /* directory part of IMPSRC */
272 #define FPREFIX "*F" /* file part of PREFIX */
273 #define DPREFIX "*D" /* directory part of PREFIX */
274
275 /*
276 * Global Variables
277 */
278 extern Lst create; /* The list of target names specified on the
279 * command line. used to resolve #if
280 * make(...) statements */
281 extern Lst dirSearchPath; /* The list of directories to search when
282 * looking for targets */
283
284 extern Boolean compatMake; /* True if we are make compatible */
285 extern Boolean ignoreErrors; /* True if should ignore all errors */
286 extern Boolean beSilent; /* True if should print no commands */
287 extern Boolean noExecute; /* True if should execute nothing */
288 extern Boolean allPrecious; /* True if every target is precious */
289 extern Boolean keepgoing; /* True if should continue on unaffected
290 * portions of the graph when have an error
291 * in one portion */
292 extern Boolean touchFlag; /* TRUE if targets should just be 'touched'
293 * if out of date. Set by the -t flag */
294 extern Boolean usePipes; /* TRUE if should capture the output of
295 * subshells by means of pipes. Otherwise it
296 * is routed to temporary files from which it
297 * is retrieved when the shell exits */
298 extern Boolean queryFlag; /* TRUE if we aren't supposed to really make
299 * anything, just see if the targets are out-
300 * of-date */
301
302 extern Boolean checkEnvFirst; /* TRUE if environment should be searched for
303 * variables before the global context */
304
305 extern GNode *DEFAULT; /* .DEFAULT rule */
306
307 extern GNode *VAR_GLOBAL; /* Variables defined in a global context, e.g
308 * in the Makefile itself */
309 extern GNode *VAR_CMD; /* Variables defined on the command line */
310 extern char var_Error[]; /* Value returned by Var_Parse when an error
311 * is encountered. It actually points to
312 * an empty string, so naive callers needn't
313 * worry about it. */
314
315 extern time_t now; /* The time at the start of this whole
316 * process */
317
318 extern Boolean oldVars; /* Do old-style variable substitution */
319
320 /*
321 * debug control:
322 * There is one bit per module. It is up to the module what debug
323 * information to print.
324 */
325 extern int debug;
326 #define DEBUG_ARCH 0x0001
327 #define DEBUG_COND 0x0002
328 #define DEBUG_DIR 0x0004
329 #define DEBUG_GRAPH1 0x0008
330 #define DEBUG_GRAPH2 0x0010
331 #define DEBUG_JOB 0x0020
332 #define DEBUG_MAKE 0x0040
333 #define DEBUG_SUFF 0x0080
334 #define DEBUG_TARG 0x0100
335 #define DEBUG_VAR 0x0200
336 #define DEBUG_FOR 0x0400
337
338 #ifdef __STDC__
339 #define CONCAT(a,b) a##b
340 #else
341 #define I(a) a
342 #define CONCAT(a,b) I(a)b
343 #endif /* __STDC__ */
344
345 #define DEBUG(module) (debug & CONCAT(DEBUG_,module))
346
347 /*
348 * Since there are so many, all functions that return non-integer values are
349 * extracted by means of a sed script or two and stuck in the file "nonints.h"
350 */
351 #include "nonints.h"
352
353 int Make_TimeStamp __P((GNode *, GNode *));
354 Boolean Make_OODate __P((GNode *));
355 int Make_HandleUse __P((GNode *, GNode *));
356 void Make_Update __P((GNode *));
357 void Make_DoAllVar __P((GNode *));
358 Boolean Make_Run __P((Lst));
359
360 #endif /* _MAKE_H_ */
361