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