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