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