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