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