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