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