make.h revision 1.103
1 /* $NetBSD: make.h,v 1.103 2017/07/20 19:29:54 sjg 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 <fcntl.h> 88 #include <stdio.h> 89 #include <stdlib.h> 90 #include <string.h> 91 #include <unistd.h> 92 93 #ifdef BSD4_4 94 # include <sys/cdefs.h> 95 #endif 96 97 #ifndef FD_CLOEXEC 98 #define FD_CLOEXEC 1 99 #endif 100 101 #if defined(__GNUC__) 102 #define MAKE_GNUC_PREREQ(x, y) \ 103 ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \ 104 (__GNUC__ > (x))) 105 #else /* defined(__GNUC__) */ 106 #define MAKE_GNUC_PREREQ(x, y) 0 107 #endif /* defined(__GNUC__) */ 108 109 #if MAKE_GNUC_PREREQ(2, 7) 110 #define MAKE_ATTR_UNUSED __attribute__((__unused__)) 111 #else 112 #define MAKE_ATTR_UNUSED /* delete */ 113 #endif 114 115 #if MAKE_GNUC_PREREQ(2, 5) 116 #define MAKE_ATTR_DEAD __attribute__((__noreturn__)) 117 #elif defined(__GNUC__) 118 #define MAKE_ATTR_DEAD __volatile 119 #else 120 #define MAKE_ATTR_DEAD /* delete */ 121 #endif 122 123 #if MAKE_GNUC_PREREQ(2, 7) 124 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) \ 125 __attribute__((__format__ (__printf__, fmtarg, firstvararg))) 126 #else 127 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) /* delete */ 128 #endif 129 130 #include "sprite.h" 131 #include "lst.h" 132 #include "hash.h" 133 #include "config.h" 134 #include "buf.h" 135 #include "make_malloc.h" 136 137 /*- 138 * The structure for an individual graph node. Each node has several 139 * pieces of data associated with it. 140 * 1) the name of the target it describes 141 * 2) the location of the target file in the file system. 142 * 3) the type of operator used to define its sources (qv. parse.c) 143 * 4) whether it is involved in this invocation of make 144 * 5) whether the target has been remade 145 * 6) whether any of its children has been remade 146 * 7) the number of its children that are, as yet, unmade 147 * 8) its modification time 148 * 9) the modification time of its youngest child (qv. make.c) 149 * 10) a list of nodes for which this is a source (parents) 150 * 11) a list of nodes on which this depends (children) 151 * 12) a list of nodes that depend on this, as gleaned from the 152 * transformation rules (iParents) 153 * 13) a list of ancestor nodes, which includes parents, iParents, 154 * and recursive parents of parents 155 * 14) a list of nodes of the same name created by the :: operator 156 * 15) a list of nodes that must be made (if they're made) before 157 * this node can be, but that do not enter into the datedness of 158 * this node. 159 * 16) a list of nodes that must be made (if they're made) before 160 * this node or any child of this node can be, but that do not 161 * enter into the datedness of this node. 162 * 17) a list of nodes that must be made (if they're made) after 163 * this node is, but that do not depend on this node, in the 164 * normal sense. 165 * 18) a Lst of ``local'' variables that are specific to this target 166 * and this target only (qv. var.c [$@ $< $?, etc.]) 167 * 19) a Lst of strings that are commands to be given to a shell 168 * to create this target. 169 */ 170 typedef struct GNode { 171 char *name; /* The target's name */ 172 char *uname; /* The unexpanded name of a .USE node */ 173 char *path; /* The full pathname of the file */ 174 int type; /* Its type (see the OP flags, below) */ 175 176 int flags; 177 #define REMAKE 0x1 /* this target needs to be (re)made */ 178 #define CHILDMADE 0x2 /* children of this target were made */ 179 #define FORCE 0x4 /* children don't exist, and we pretend made */ 180 #define DONE_WAIT 0x8 /* Set by Make_ProcessWait() */ 181 #define DONE_ORDER 0x10 /* Build requested by .ORDER processing */ 182 #define FROM_DEPEND 0x20 /* Node created from .depend */ 183 #define DONE_ALLSRC 0x40 /* We do it once only */ 184 #define CYCLE 0x1000 /* Used by MakePrintStatus */ 185 #define DONECYCLE 0x2000 /* Used by MakePrintStatus */ 186 #define INTERNAL 0x4000 /* Internal use only */ 187 enum enum_made { 188 UNMADE, DEFERRED, REQUESTED, BEINGMADE, 189 MADE, UPTODATE, ERROR, ABORTED 190 } made; /* Set to reflect the state of processing 191 * on this node: 192 * UNMADE - Not examined yet 193 * DEFERRED - Examined once (building child) 194 * REQUESTED - on toBeMade list 195 * BEINGMADE - Target is already being made. 196 * Indicates a cycle in the graph. 197 * MADE - Was out-of-date and has been made 198 * UPTODATE - Was already up-to-date 199 * ERROR - An error occurred while it was being 200 * made (used only in compat mode) 201 * ABORTED - The target was aborted due to 202 * an error making an inferior (compat). 203 */ 204 int unmade; /* The number of unmade children */ 205 206 time_t mtime; /* Its modification time */ 207 struct GNode *cmgn; /* The youngest child */ 208 209 Lst iParents; /* Links to parents for which this is an 210 * implied source, if any */ 211 Lst cohorts; /* Other nodes for the :: operator */ 212 Lst parents; /* Nodes that depend on this one */ 213 Lst children; /* Nodes on which this one depends */ 214 Lst order_pred; /* .ORDER nodes we need made */ 215 Lst order_succ; /* .ORDER nodes who need us */ 216 217 char cohort_num[8]; /* #n for this cohort */ 218 int unmade_cohorts;/* # of unmade instances on the 219 cohorts list */ 220 struct GNode *centurion; /* Pointer to the first instance of a :: 221 node; only set when on a cohorts list */ 222 unsigned int checked; /* Last time we tried to makle this node */ 223 224 Hash_Table context; /* The local variables */ 225 Lst commands; /* Creation commands */ 226 227 struct _Suff *suffix; /* Suffix for the node (determined by 228 * Suff_FindDeps and opaque to everyone 229 * but the Suff module) */ 230 const char *fname; /* filename where the GNode got defined */ 231 int lineno; /* line number where the GNode got defined */ 232 } GNode; 233 234 /* 235 * The OP_ constants are used when parsing a dependency line as a way of 236 * communicating to other parts of the program the way in which a target 237 * should be made. These constants are bitwise-OR'ed together and 238 * placed in the 'type' field of each node. Any node that has 239 * a 'type' field which satisfies the OP_NOP function was never never on 240 * the lefthand side of an operator, though it may have been on the 241 * righthand side... 242 */ 243 #define OP_DEPENDS 0x00000001 /* Execution of commands depends on 244 * kids (:) */ 245 #define OP_FORCE 0x00000002 /* Always execute commands (!) */ 246 #define OP_DOUBLEDEP 0x00000004 /* Execution of commands depends on kids 247 * per line (::) */ 248 #define OP_OPMASK (OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP) 249 250 #define OP_OPTIONAL 0x00000008 /* Don't care if the target doesn't 251 * exist and can't be created */ 252 #define OP_USE 0x00000010 /* Use associated commands for parents */ 253 #define OP_EXEC 0x00000020 /* Target is never out of date, but always 254 * execute commands anyway. Its time 255 * doesn't matter, so it has none...sort 256 * of */ 257 #define OP_IGNORE 0x00000040 /* Ignore errors when creating the node */ 258 #define OP_PRECIOUS 0x00000080 /* Don't remove the target when 259 * interrupted */ 260 #define OP_SILENT 0x00000100 /* Don't echo commands when executed */ 261 #define OP_MAKE 0x00000200 /* Target is a recursive make so its 262 * commands should always be executed when 263 * it is out of date, regardless of the 264 * state of the -n or -t flags */ 265 #define OP_JOIN 0x00000400 /* Target is out-of-date only if any of its 266 * children was out-of-date */ 267 #define OP_MADE 0x00000800 /* Assume the children of the node have 268 * been already made */ 269 #define OP_SPECIAL 0x00001000 /* Special .BEGIN, .END, .INTERRUPT */ 270 #define OP_USEBEFORE 0x00002000 /* Like .USE, only prepend commands */ 271 #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents. 272 * I.e. it doesn't show up in the parents's 273 * local variables. */ 274 #define OP_NOTMAIN 0x00008000 /* The node is exempt from normal 'main 275 * target' processing in parse.c */ 276 #define OP_PHONY 0x00010000 /* Not a file target; run always */ 277 #define OP_NOPATH 0x00020000 /* Don't search for file in the path */ 278 #define OP_WAIT 0x00040000 /* .WAIT phony node */ 279 #define OP_NOMETA 0x00080000 /* .NOMETA do not create a .meta file */ 280 #define OP_META 0x00100000 /* .META we _do_ want a .meta file */ 281 #define OP_NOMETA_CMP 0x00200000 /* Do not compare commands in .meta file */ 282 #define OP_SUBMAKE 0x00400000 /* Possibly a submake node */ 283 /* Attributes applied by PMake */ 284 #define OP_TRANSFORM 0x80000000 /* The node is a transformation rule */ 285 #define OP_MEMBER 0x40000000 /* Target is a member of an archive */ 286 #define OP_LIB 0x20000000 /* Target is a library */ 287 #define OP_ARCHV 0x10000000 /* Target is an archive construct */ 288 #define OP_HAS_COMMANDS 0x08000000 /* Target has all the commands it should. 289 * Used when parsing to catch multiple 290 * commands for a target */ 291 #define OP_SAVE_CMDS 0x04000000 /* Saving commands on .END (Compat) */ 292 #define OP_DEPS_FOUND 0x02000000 /* Already processed by Suff_FindDeps */ 293 #define OP_MARK 0x01000000 /* Node found while expanding .ALLSRC */ 294 295 #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute) 296 /* 297 * OP_NOP will return TRUE if the node with the given type was not the 298 * object of a dependency operator 299 */ 300 #define OP_NOP(t) (((t) & OP_OPMASK) == 0x00000000) 301 302 #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM) 303 304 /* 305 * The TARG_ constants are used when calling the Targ_FindNode and 306 * Targ_FindList functions in targ.c. They simply tell the functions what to 307 * do if the desired node(s) is (are) not found. If the TARG_CREATE constant 308 * is given, a new, empty node will be created for the target, placed in the 309 * table of all targets and its address returned. If TARG_NOCREATE is given, 310 * a NULL pointer will be returned. 311 */ 312 #define TARG_NOCREATE 0x00 /* don't create it */ 313 #define TARG_CREATE 0x01 /* create node if not found */ 314 #define TARG_NOHASH 0x02 /* don't look in/add to hash table */ 315 316 /* 317 * These constants are all used by the Str_Concat function to decide how the 318 * final string should look. If STR_ADDSPACE is given, a space will be 319 * placed between the two strings. If STR_ADDSLASH is given, a '/' will 320 * be used instead of a space. If neither is given, no intervening characters 321 * will be placed between the two strings in the final output. If the 322 * STR_DOFREE bit is set, the two input strings will be freed before 323 * Str_Concat returns. 324 */ 325 #define STR_ADDSPACE 0x01 /* add a space when Str_Concat'ing */ 326 #define STR_ADDSLASH 0x02 /* add a slash when Str_Concat'ing */ 327 328 /* 329 * Error levels for parsing. PARSE_FATAL means the process cannot continue 330 * once the makefile has been parsed. PARSE_WARNING means it can. Passed 331 * as the first argument to Parse_Error. 332 */ 333 #define PARSE_WARNING 2 334 #define PARSE_FATAL 1 335 336 /* 337 * Values returned by Cond_Eval. 338 */ 339 #define COND_PARSE 0 /* Parse the next lines */ 340 #define COND_SKIP 1 /* Skip the next lines */ 341 #define COND_INVALID 2 /* Not a conditional statement */ 342 343 /* 344 * Definitions for the "local" variables. Used only for clarity. 345 */ 346 #define TARGET "@" /* Target of dependency */ 347 #define OODATE "?" /* All out-of-date sources */ 348 #define ALLSRC ">" /* All sources */ 349 #define IMPSRC "<" /* Source implied by transformation */ 350 #define PREFIX "*" /* Common prefix */ 351 #define ARCHIVE "!" /* Archive in "archive(member)" syntax */ 352 #define MEMBER "%" /* Member in "archive(member)" syntax */ 353 354 #define FTARGET "@F" /* file part of TARGET */ 355 #define DTARGET "@D" /* directory part of TARGET */ 356 #define FIMPSRC "<F" /* file part of IMPSRC */ 357 #define DIMPSRC "<D" /* directory part of IMPSRC */ 358 #define FPREFIX "*F" /* file part of PREFIX */ 359 #define DPREFIX "*D" /* directory part of PREFIX */ 360 361 /* 362 * Global Variables 363 */ 364 extern Lst create; /* The list of target names specified on the 365 * command line. used to resolve #if 366 * make(...) statements */ 367 extern Lst dirSearchPath; /* The list of directories to search when 368 * looking for targets */ 369 370 extern Boolean compatMake; /* True if we are make compatible */ 371 extern Boolean ignoreErrors; /* True if should ignore all errors */ 372 extern Boolean beSilent; /* True if should print no commands */ 373 extern Boolean noExecute; /* True if should execute nothing */ 374 extern Boolean noRecursiveExecute; /* True if should execute nothing */ 375 extern Boolean allPrecious; /* True if every target is precious */ 376 extern Boolean deleteOnError; /* True if failed targets should be deleted */ 377 extern Boolean keepgoing; /* True if should continue on unaffected 378 * portions of the graph when have an error 379 * in one portion */ 380 extern Boolean touchFlag; /* TRUE if targets should just be 'touched' 381 * if out of date. Set by the -t flag */ 382 extern Boolean queryFlag; /* TRUE if we aren't supposed to really make 383 * anything, just see if the targets are out- 384 * of-date */ 385 extern Boolean doing_depend; /* TRUE if processing .depend */ 386 387 extern Boolean checkEnvFirst; /* TRUE if environment should be searched for 388 * variables before the global context */ 389 extern Boolean jobServer; /* a jobServer already exists */ 390 391 extern Boolean parseWarnFatal; /* TRUE if makefile parsing warnings are 392 * treated as errors */ 393 394 extern Boolean varNoExportEnv; /* TRUE if we should not export variables 395 * set on the command line to the env. */ 396 397 extern GNode *DEFAULT; /* .DEFAULT rule */ 398 399 extern GNode *VAR_INTERNAL; /* Variables defined internally by make 400 * which should not override those set by 401 * makefiles. 402 */ 403 extern GNode *VAR_GLOBAL; /* Variables defined in a global context, e.g 404 * in the Makefile itself */ 405 extern GNode *VAR_CMD; /* Variables defined on the command line */ 406 extern GNode *VAR_FOR; /* Iteration variables */ 407 extern char var_Error[]; /* Value returned by Var_Parse when an error 408 * is encountered. It actually points to 409 * an empty string, so naive callers needn't 410 * worry about it. */ 411 412 extern time_t now; /* The time at the start of this whole 413 * process */ 414 415 extern Boolean oldVars; /* Do old-style variable substitution */ 416 417 extern Lst sysIncPath; /* The system include path. */ 418 extern Lst defIncPath; /* The default include path. */ 419 420 extern char curdir[]; /* Startup directory */ 421 extern char *progname; /* The program name */ 422 extern char *makeDependfile; /* .depend */ 423 extern char **savedEnv; /* if we replaced environ this will be non-NULL */ 424 425 /* 426 * We cannot vfork() in a child of vfork(). 427 * Most systems do not enforce this but some do. 428 */ 429 #define vFork() ((getpid() == myPid) ? vfork() : fork()) 430 extern pid_t myPid; 431 432 #define MAKEFLAGS ".MAKEFLAGS" 433 #define MAKEOVERRIDES ".MAKEOVERRIDES" 434 #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX" /* prefix for job target output */ 435 #define MAKE_EXPORTED ".MAKE.EXPORTED" /* variables we export */ 436 #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all the makefiles we read */ 437 #define MAKE_LEVEL ".MAKE.LEVEL" /* recursion level */ 438 #define MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE" 439 #define MAKE_DEPENDFILE ".MAKE.DEPENDFILE" /* .depend */ 440 #define MAKE_MODE ".MAKE.MODE" 441 #ifndef MAKE_LEVEL_ENV 442 # define MAKE_LEVEL_ENV "MAKELEVEL" 443 #endif 444 445 /* 446 * debug control: 447 * There is one bit per module. It is up to the module what debug 448 * information to print. 449 */ 450 FILE *debug_file; /* Output written here - default stdout */ 451 extern int debug; 452 #define DEBUG_ARCH 0x00001 453 #define DEBUG_COND 0x00002 454 #define DEBUG_DIR 0x00004 455 #define DEBUG_GRAPH1 0x00008 456 #define DEBUG_GRAPH2 0x00010 457 #define DEBUG_JOB 0x00020 458 #define DEBUG_MAKE 0x00040 459 #define DEBUG_SUFF 0x00080 460 #define DEBUG_TARG 0x00100 461 #define DEBUG_VAR 0x00200 462 #define DEBUG_FOR 0x00400 463 #define DEBUG_SHELL 0x00800 464 #define DEBUG_ERROR 0x01000 465 #define DEBUG_LOUD 0x02000 466 #define DEBUG_META 0x04000 467 468 #define DEBUG_GRAPH3 0x10000 469 #define DEBUG_SCRIPT 0x20000 470 #define DEBUG_PARSE 0x40000 471 #define DEBUG_CWD 0x80000 472 473 #define CONCAT(a,b) a##b 474 475 #define DEBUG(module) (debug & CONCAT(DEBUG_,module)) 476 477 #include "nonints.h" 478 479 int Make_TimeStamp(GNode *, GNode *); 480 Boolean Make_OODate(GNode *); 481 void Make_ExpandUse(Lst); 482 time_t Make_Recheck(GNode *); 483 void Make_HandleUse(GNode *, GNode *); 484 void Make_Update(GNode *); 485 void Make_DoAllVar(GNode *); 486 Boolean Make_Run(Lst); 487 char * Check_Cwd_Cmd(const char *); 488 void Check_Cwd(const char **); 489 void PrintOnError(GNode *, const char *); 490 void Main_ExportMAKEFLAGS(Boolean); 491 Boolean Main_SetObjdir(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2); 492 int mkTempFile(const char *, char **); 493 int str2Lst_Append(Lst, char *, const char *); 494 int cached_lstat(const char *, void *); 495 int cached_stat(const char *, void *); 496 497 #define VARF_UNDEFERR 1 498 #define VARF_WANTRES 2 499 #define VARF_ASSIGN 4 500 501 #ifdef __GNUC__ 502 #define UNCONST(ptr) ({ \ 503 union __unconst { \ 504 const void *__cp; \ 505 void *__p; \ 506 } __d; \ 507 __d.__cp = ptr, __d.__p; }) 508 #else 509 #define UNCONST(ptr) (void *)(ptr) 510 #endif 511 512 #ifndef MIN 513 #define MIN(a, b) ((a < b) ? a : b) 514 #endif 515 #ifndef MAX 516 #define MAX(a, b) ((a > b) ? a : b) 517 #endif 518 519 /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */ 520 #include <limits.h> 521 #ifndef MAXPATHLEN 522 #define MAXPATHLEN 4096 523 #endif 524 #ifndef PATH_MAX 525 #define PATH_MAX MAXPATHLEN 526 #endif 527 528 #if defined(SYSV) 529 #define KILLPG(pid, sig) kill(-(pid), (sig)) 530 #else 531 #define KILLPG(pid, sig) killpg((pid), (sig)) 532 #endif 533 534 #endif /* _MAKE_H_ */ 535
Indexes created Tue Sep 23 07:09:52 GMT 2025