2004-07-01 08:39:30 +04:00
|
|
|
|
/* $NetBSD: compat.c,v 1.55 2004/07/01 04:39:30 jmc Exp $ */
|
1995-06-14 19:18:37 +04:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
|
2003-08-07 15:13:06 +04:00
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
|
* Adam de Boor.
|
|
|
|
|
*
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*
|
1993-03-21 12:45:37 +03:00
|
|
|
|
* Copyright (c) 1988, 1989 by Adam de Boor
|
|
|
|
|
* Copyright (c) 1989 by Berkeley Softworks
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
|
* Adam de Boor.
|
|
|
|
|
*
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*/
|
|
|
|
|
|
2004-05-07 04:04:38 +04:00
|
|
|
|
#ifndef MAKE_NATIVE
|
2004-07-01 08:39:30 +04:00
|
|
|
|
static char rcsid[] = "$NetBSD: compat.c,v 1.55 2004/07/01 04:39:30 jmc Exp $";
|
1997-09-28 07:30:58 +04:00
|
|
|
|
#else
|
1997-07-02 01:17:00 +04:00
|
|
|
|
#include <sys/cdefs.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
#ifndef lint
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#if 0
|
1996-11-06 20:58:58 +03:00
|
|
|
|
static char sccsid[] = "@(#)compat.c 8.2 (Berkeley) 3/19/94";
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#else
|
2004-07-01 08:39:30 +04:00
|
|
|
|
__RCSID("$NetBSD: compat.c,v 1.55 2004/07/01 04:39:30 jmc Exp $");
|
1995-06-14 19:18:37 +04:00
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
|
#endif /* not lint */
|
1997-09-28 07:30:58 +04:00
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
* compat.c --
|
|
|
|
|
* The routines in this file implement the full-compatibility
|
|
|
|
|
* mode of PMake. Most of the special functionality of PMake
|
|
|
|
|
* is available in this mode. Things not supported:
|
|
|
|
|
* - different shells.
|
|
|
|
|
* - friendly variable substitution.
|
|
|
|
|
*
|
|
|
|
|
* Interface:
|
|
|
|
|
* Compat_Run Initialize things for this module and recreate
|
|
|
|
|
* thems as need creatin'
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
1994-03-05 03:34:29 +03:00
|
|
|
|
#include <sys/stat.h>
|
1995-09-27 21:44:38 +03:00
|
|
|
|
#include <sys/wait.h>
|
2002-06-15 22:24:55 +04:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
#include <ctype.h>
|
1995-09-27 21:44:38 +03:00
|
|
|
|
#include <errno.h>
|
|
|
|
|
#include <signal.h>
|
2002-06-15 22:24:55 +04:00
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
#include "make.h"
|
1994-03-05 03:34:29 +03:00
|
|
|
|
#include "hash.h"
|
|
|
|
|
#include "dir.h"
|
|
|
|
|
#include "job.h"
|
2002-04-27 19:14:30 +04:00
|
|
|
|
#include "pathnames.h"
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The following array is used to make a fast determination of which
|
|
|
|
|
* characters are interpreted specially by the shell. If a command
|
|
|
|
|
* contains any of these characters, it is executed by the shell, not
|
|
|
|
|
* directly by us.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static char meta[256];
|
|
|
|
|
|
|
|
|
|
static GNode *curTarg = NILGNODE;
|
|
|
|
|
static GNode *ENDNode;
|
2002-06-15 22:24:55 +04:00
|
|
|
|
static void CompatInterrupt(int);
|
|
|
|
|
static int CompatMake(ClientData, ClientData);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
2004-05-07 12:12:15 +04:00
|
|
|
|
static void
|
|
|
|
|
Compat_Init(void)
|
|
|
|
|
{
|
|
|
|
|
const char *cp;
|
|
|
|
|
|
|
|
|
|
Shell_Init(); /* setup default shell */
|
|
|
|
|
|
|
|
|
|
for (cp = "#=|^(){};&<>*?[]:$`\\\n"; *cp != '\0'; cp++) {
|
|
|
|
|
meta[(unsigned char) *cp] = 1;
|
|
|
|
|
}
|
|
|
|
|
/*
|
|
|
|
|
* The null character serves as a sentinel in the string.
|
|
|
|
|
*/
|
|
|
|
|
meta[0] = 1;
|
|
|
|
|
}
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* CompatInterrupt --
|
|
|
|
|
* Interrupt the creation of the current target and remove it if
|
|
|
|
|
* it ain't precious.
|
|
|
|
|
*
|
|
|
|
|
* Results:
|
|
|
|
|
* None.
|
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* The target is removed and the process exits. If .INTERRUPT exists,
|
|
|
|
|
* its commands are run first WITH INTERRUPTS IGNORED..
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
static void
|
2002-06-15 22:24:55 +04:00
|
|
|
|
CompatInterrupt(int signo)
|
1993-03-21 12:45:37 +03:00
|
|
|
|
{
|
|
|
|
|
GNode *gn;
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if ((curTarg != NILGNODE) && !Targ_Precious (curTarg)) {
|
1994-06-07 02:45:17 +04:00
|
|
|
|
char *p1;
|
|
|
|
|
char *file = Var_Value (TARGET, curTarg, &p1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
1995-11-03 02:54:35 +03:00
|
|
|
|
if (!noExecute && eunlink(file) != -1) {
|
2002-03-21 04:24:43 +03:00
|
|
|
|
Error("*** %s removed", file);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
1994-06-07 02:45:17 +04:00
|
|
|
|
if (p1)
|
|
|
|
|
free(p1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Run .INTERRUPT only if hit with interrupt signal
|
|
|
|
|
*/
|
|
|
|
|
if (signo == SIGINT) {
|
|
|
|
|
gn = Targ_FindNode(".INTERRUPT", TARG_NOCREATE);
|
|
|
|
|
if (gn != NILGNODE) {
|
|
|
|
|
Lst_ForEach(gn->commands, CompatRunCommand, (ClientData)gn);
|
|
|
|
|
}
|
|
|
|
|
}
|
1994-06-07 02:45:17 +04:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
1994-06-07 02:45:17 +04:00
|
|
|
|
exit (signo);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* CompatRunCommand --
|
|
|
|
|
* Execute the next command for a target. If the command returns an
|
|
|
|
|
* error, the node's made field is set to ERROR and creation stops.
|
|
|
|
|
*
|
2002-06-15 22:24:55 +04:00
|
|
|
|
* Input:
|
|
|
|
|
* cmdp Command to execute
|
|
|
|
|
* gnp Node from which the command came
|
|
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
|
* Results:
|
|
|
|
|
* 0 if the command succeeded, 1 if an error occurred.
|
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* The node's 'made' field may be set to ERROR.
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
2004-05-07 12:12:15 +04:00
|
|
|
|
int
|
2002-06-15 22:24:55 +04:00
|
|
|
|
CompatRunCommand(ClientData cmdp, ClientData gnp)
|
1993-03-21 12:45:37 +03:00
|
|
|
|
{
|
|
|
|
|
char *cmdStart; /* Start of expanded command */
|
1998-03-26 22:20:36 +03:00
|
|
|
|
char *cp, *bp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Boolean silent, /* Don't print command */
|
2004-05-07 12:12:15 +04:00
|
|
|
|
doIt, /* Execute even if -n */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
errCheck; /* Check errors */
|
1995-11-22 20:39:53 +03:00
|
|
|
|
int reason; /* Reason for child's death */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
int status; /* Description of child's death */
|
|
|
|
|
int cpid; /* Child actually found */
|
2002-01-27 04:50:54 +03:00
|
|
|
|
ReturnStatus retstat; /* Status of fork */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
LstNode cmdNode; /* Node where current command is located */
|
2003-07-14 22:19:11 +04:00
|
|
|
|
const char **av; /* Argument vector for thing to exec */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
int argc; /* Number of arguments in av or 0 if not
|
|
|
|
|
* dynamically allocated */
|
|
|
|
|
Boolean local; /* TRUE if command should be executed
|
|
|
|
|
* locally */
|
1994-06-07 02:45:17 +04:00
|
|
|
|
char *cmd = (char *) cmdp;
|
|
|
|
|
GNode *gn = (GNode *) gnp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
1996-11-06 20:58:58 +03:00
|
|
|
|
/*
|
1994-03-08 01:22:01 +03:00
|
|
|
|
* Avoid clobbered variable warnings by forcing the compiler
|
|
|
|
|
* to ``unregister'' variables
|
|
|
|
|
*/
|
|
|
|
|
#if __GNUC__
|
|
|
|
|
(void) &av;
|
|
|
|
|
(void) &errCheck;
|
2004-07-01 08:39:30 +04:00
|
|
|
|
(void) &cmd;
|
1994-03-08 01:22:01 +03:00
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
|
silent = gn->type & OP_SILENT;
|
|
|
|
|
errCheck = !(gn->type & OP_IGNORE);
|
2004-05-07 12:12:15 +04:00
|
|
|
|
doIt = FALSE;
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
cmdNode = Lst_Member (gn->commands, (ClientData)cmd);
|
1994-03-05 03:34:29 +03:00
|
|
|
|
cmdStart = Var_Subst (NULL, cmd, gn, FALSE);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
/*
|
1998-03-26 22:20:36 +03:00
|
|
|
|
* brk_string will return an argv with a NULL in av[0], thus causing
|
1993-03-21 12:45:37 +03:00
|
|
|
|
* execvp to choke and die horribly. Besides, how can we execute a null
|
|
|
|
|
* command? In any case, we warn the user that the command expanded to
|
|
|
|
|
* nothing (is this the right thing to do?).
|
|
|
|
|
*/
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (*cmdStart == '\0') {
|
1994-06-07 02:45:17 +04:00
|
|
|
|
free(cmdStart);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Error("%s expands to empty string", cmd);
|
|
|
|
|
return(0);
|
|
|
|
|
} else {
|
|
|
|
|
cmd = cmdStart;
|
|
|
|
|
}
|
|
|
|
|
Lst_Replace (cmdNode, (ClientData)cmdStart);
|
|
|
|
|
|
|
|
|
|
if ((gn->type & OP_SAVE_CMDS) && (gn != ENDNode)) {
|
|
|
|
|
(void)Lst_AtEnd(ENDNode->commands, (ClientData)cmdStart);
|
|
|
|
|
return(0);
|
|
|
|
|
} else if (strcmp(cmdStart, "...") == 0) {
|
|
|
|
|
gn->type |= OP_SAVE_CMDS;
|
|
|
|
|
return(0);
|
|
|
|
|
}
|
|
|
|
|
|
2004-05-07 12:12:15 +04:00
|
|
|
|
while ((*cmd == '@') || (*cmd == '-') || (*cmd == '+')) {
|
|
|
|
|
switch (*cmd) {
|
|
|
|
|
case '@':
|
1993-03-21 12:45:37 +03:00
|
|
|
|
silent = TRUE;
|
2004-05-07 12:12:15 +04:00
|
|
|
|
break;
|
|
|
|
|
case '-':
|
1993-03-21 12:45:37 +03:00
|
|
|
|
errCheck = FALSE;
|
2004-05-07 12:12:15 +04:00
|
|
|
|
break;
|
|
|
|
|
case '+':
|
|
|
|
|
doIt = TRUE;
|
|
|
|
|
if (!meta[0]) /* we came here from jobs */
|
|
|
|
|
Compat_Init();
|
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
cmd++;
|
|
|
|
|
}
|
|
|
|
|
|
1994-03-05 03:34:29 +03:00
|
|
|
|
while (isspace((unsigned char)*cmd))
|
|
|
|
|
cmd++;
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* Search for meta characters in the command. If there are no meta
|
|
|
|
|
* characters, there's no need to execute a shell to execute the
|
|
|
|
|
* command.
|
|
|
|
|
*/
|
1994-03-05 03:34:29 +03:00
|
|
|
|
for (cp = cmd; !meta[(unsigned char)*cp]; cp++) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Print the command before echoing if we're not supposed to be quiet for
|
|
|
|
|
* this one. We also print the command if -n given.
|
|
|
|
|
*/
|
2001-01-01 18:47:37 +03:00
|
|
|
|
if (!silent || NoExecute(gn)) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
printf ("%s\n", cmd);
|
|
|
|
|
fflush(stdout);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If we're not supposed to execute any commands, this is as far as
|
|
|
|
|
* we go...
|
|
|
|
|
*/
|
2004-05-07 12:12:15 +04:00
|
|
|
|
if (!doIt && NoExecute(gn)) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
return (0);
|
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (*cp != '\0') {
|
|
|
|
|
/*
|
|
|
|
|
* If *cp isn't the null character, we hit a "meta" character and
|
2004-05-07 12:12:15 +04:00
|
|
|
|
* need to pass the command off to the shell.
|
1993-03-21 12:45:37 +03:00
|
|
|
|
*/
|
2003-08-01 04:39:52 +04:00
|
|
|
|
static const char *shargv[4];
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
2003-08-01 04:39:52 +04:00
|
|
|
|
shargv[0] = shellPath;
|
|
|
|
|
/*
|
|
|
|
|
* The following work for any of the builtin shell specs.
|
|
|
|
|
*/
|
2001-06-02 00:33:37 +04:00
|
|
|
|
if (DEBUG(SHELL))
|
2004-05-07 12:12:15 +04:00
|
|
|
|
shargv[1] = "-xc";
|
2001-06-02 00:33:37 +04:00
|
|
|
|
else
|
2004-05-07 12:12:15 +04:00
|
|
|
|
shargv[1] = "-c";
|
1993-03-21 12:45:37 +03:00
|
|
|
|
shargv[2] = cmd;
|
|
|
|
|
shargv[3] = (char *)NULL;
|
|
|
|
|
av = shargv;
|
|
|
|
|
argc = 0;
|
1998-03-26 22:20:36 +03:00
|
|
|
|
bp = NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
} else {
|
|
|
|
|
/*
|
|
|
|
|
* No meta-characters, so no need to exec a shell. Break the command
|
|
|
|
|
* into words to form an argument vector we can execute.
|
|
|
|
|
*/
|
2003-07-14 22:19:11 +04:00
|
|
|
|
av = (const char **)brk_string(cmd, &argc, TRUE, &bp);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
local = TRUE;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Fork and execute the single command. If the fork fails, we abort.
|
|
|
|
|
*/
|
|
|
|
|
cpid = vfork();
|
|
|
|
|
if (cpid < 0) {
|
|
|
|
|
Fatal("Could not fork");
|
|
|
|
|
}
|
|
|
|
|
if (cpid == 0) {
|
2000-04-20 15:23:25 +04:00
|
|
|
|
Check_Cwd(av);
|
2001-05-29 21:37:51 +04:00
|
|
|
|
if (local)
|
2003-07-14 22:19:11 +04:00
|
|
|
|
(void)execvp(av[0], (char *const *)UNCONST(av));
|
2001-05-29 21:37:51 +04:00
|
|
|
|
else
|
2003-07-14 22:19:11 +04:00
|
|
|
|
(void)execv(av[0], (char *const *)UNCONST(av));
|
2002-03-14 19:08:37 +03:00
|
|
|
|
execError("exec", av[0]);
|
1997-12-31 09:06:12 +03:00
|
|
|
|
_exit(1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
1998-11-01 06:07:33 +03:00
|
|
|
|
if (bp) {
|
|
|
|
|
free(av);
|
|
|
|
|
free(bp);
|
|
|
|
|
}
|
1994-06-07 02:45:17 +04:00
|
|
|
|
Lst_Replace (cmdNode, (ClientData) NULL);
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* The child is off and running. Now all we can do is wait...
|
|
|
|
|
*/
|
|
|
|
|
while (1) {
|
|
|
|
|
|
2002-01-27 04:50:54 +03:00
|
|
|
|
while ((retstat = wait(&reason)) != cpid) {
|
|
|
|
|
if (retstat == -1 && errno != EINTR) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
2002-01-27 04:50:54 +03:00
|
|
|
|
if (retstat > -1) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (WIFSTOPPED(reason)) {
|
1995-11-22 20:39:53 +03:00
|
|
|
|
status = WSTOPSIG(reason); /* stopped */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
} else if (WIFEXITED(reason)) {
|
1995-11-22 20:39:53 +03:00
|
|
|
|
status = WEXITSTATUS(reason); /* exited */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (status != 0) {
|
2003-09-10 22:04:22 +04:00
|
|
|
|
if (DEBUG(ERROR)) {
|
|
|
|
|
printf("\n*** Failed target: %s\n*** Failed command: ",
|
|
|
|
|
gn->name);
|
|
|
|
|
for (cp = cmd; *cp; ) {
|
|
|
|
|
if (isspace((unsigned char)*cp)) {
|
|
|
|
|
putchar(' ');
|
|
|
|
|
while (isspace((unsigned char)*cp))
|
|
|
|
|
cp++;
|
|
|
|
|
} else {
|
|
|
|
|
putchar(*cp);
|
|
|
|
|
cp++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
printf ("\n");
|
2003-09-09 20:16:02 +04:00
|
|
|
|
}
|
2003-09-10 22:04:22 +04:00
|
|
|
|
printf ("*** Error code %d", status);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
} else {
|
1995-11-22 20:39:53 +03:00
|
|
|
|
status = WTERMSIG(reason); /* signaled */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
printf ("*** Signal %d", status);
|
1996-11-06 20:58:58 +03:00
|
|
|
|
}
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
if (!WIFEXITED(reason) || (status != 0)) {
|
|
|
|
|
if (errCheck) {
|
|
|
|
|
gn->made = ERROR;
|
|
|
|
|
if (keepgoing) {
|
|
|
|
|
/*
|
|
|
|
|
* Abort the current target, but let others
|
|
|
|
|
* continue.
|
|
|
|
|
*/
|
|
|
|
|
printf (" (continuing)\n");
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
/*
|
|
|
|
|
* Continue executing commands for this target.
|
|
|
|
|
* If we return 0, this will happen...
|
|
|
|
|
*/
|
|
|
|
|
printf (" (ignored)\n");
|
|
|
|
|
status = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
} else {
|
2002-01-27 04:50:54 +03:00
|
|
|
|
Fatal ("error in wait: %d: %s", retstat, strerror(errno));
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*NOTREACHED*/
|
|
|
|
|
}
|
|
|
|
|
}
|
2003-09-09 03:54:54 +04:00
|
|
|
|
free(cmdStart);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
|
|
return (status);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* CompatMake --
|
|
|
|
|
* Make a target.
|
|
|
|
|
*
|
2002-06-15 22:24:55 +04:00
|
|
|
|
* Input:
|
|
|
|
|
* gnp The node to make
|
|
|
|
|
* pgnp Parent to abort if necessary
|
|
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
|
* Results:
|
|
|
|
|
* 0
|
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* If an error is detected and not being ignored, the process exits.
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
static int
|
2002-06-15 22:24:55 +04:00
|
|
|
|
CompatMake(ClientData gnp, ClientData pgnp)
|
1993-03-21 12:45:37 +03:00
|
|
|
|
{
|
1994-06-07 02:45:17 +04:00
|
|
|
|
GNode *gn = (GNode *) gnp;
|
|
|
|
|
GNode *pgn = (GNode *) pgnp;
|
1997-02-20 19:51:47 +03:00
|
|
|
|
|
2002-02-07 19:48:22 +03:00
|
|
|
|
if (gn->made == UNMADE && (gn == pgn || (pgn->type & OP_MADE) == 0)) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* First mark ourselves to be made, then apply whatever transformations
|
|
|
|
|
* the suffix module thinks are necessary. Once that's done, we can
|
|
|
|
|
* descend and make all our children. If any of them has an error
|
|
|
|
|
* but the -k flag was given, our 'make' field will be set FALSE again.
|
|
|
|
|
* This is our signal to not attempt to do anything but abort our
|
|
|
|
|
* parent as well.
|
|
|
|
|
*/
|
1998-11-11 22:37:06 +03:00
|
|
|
|
gn->flags |= REMAKE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
gn->made = BEINGMADE;
|
2002-02-03 22:58:15 +03:00
|
|
|
|
if ((gn->type & OP_MADE) == 0)
|
|
|
|
|
Suff_FindDeps (gn);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Lst_ForEach (gn->children, CompatMake, (ClientData)gn);
|
1998-11-11 22:37:06 +03:00
|
|
|
|
if ((gn->flags & REMAKE) == 0) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
gn->made = ABORTED;
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags &= ~REMAKE;
|
1999-09-16 04:49:48 +04:00
|
|
|
|
goto cohorts;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
|
1994-06-07 02:45:17 +04:00
|
|
|
|
char *p1;
|
2001-06-13 03:36:17 +04:00
|
|
|
|
Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0);
|
1994-06-07 02:45:17 +04:00
|
|
|
|
if (p1)
|
|
|
|
|
free(p1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* All the children were made ok. Now cmtime contains the modification
|
|
|
|
|
* time of the newest child, we need to find out if we exist and when
|
|
|
|
|
* we were modified last. The criteria for datedness are defined by the
|
|
|
|
|
* Make_OODate function.
|
|
|
|
|
*/
|
|
|
|
|
if (DEBUG(MAKE)) {
|
|
|
|
|
printf("Examining %s...", gn->name);
|
|
|
|
|
}
|
|
|
|
|
if (! Make_OODate(gn)) {
|
|
|
|
|
gn->made = UPTODATE;
|
|
|
|
|
if (DEBUG(MAKE)) {
|
|
|
|
|
printf("up-to-date.\n");
|
|
|
|
|
}
|
1999-09-16 04:49:48 +04:00
|
|
|
|
goto cohorts;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
} else if (DEBUG(MAKE)) {
|
|
|
|
|
printf("out-of-date.\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If the user is just seeing if something is out-of-date, exit now
|
|
|
|
|
* to tell him/her "yes".
|
|
|
|
|
*/
|
|
|
|
|
if (queryFlag) {
|
2001-04-06 15:13:45 +04:00
|
|
|
|
exit (1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We need to be re-made. We also have to make sure we've got a $?
|
|
|
|
|
* variable. To be nice, we also define the $> variable using
|
|
|
|
|
* Make_DoAllVar().
|
|
|
|
|
*/
|
|
|
|
|
Make_DoAllVar(gn);
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* Alter our type to tell if errors should be ignored or things
|
|
|
|
|
* should not be printed so CompatRunCommand knows what to do.
|
|
|
|
|
*/
|
|
|
|
|
if (Targ_Ignore (gn)) {
|
|
|
|
|
gn->type |= OP_IGNORE;
|
|
|
|
|
}
|
|
|
|
|
if (Targ_Silent (gn)) {
|
|
|
|
|
gn->type |= OP_SILENT;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (Job_CheckCommands (gn, Fatal)) {
|
|
|
|
|
/*
|
|
|
|
|
* Our commands are ok, but we still have to worry about the -t
|
|
|
|
|
* flag...
|
|
|
|
|
*/
|
1997-05-07 11:31:37 +04:00
|
|
|
|
if (!touchFlag || (gn->type & OP_MAKE)) {
|
1993-03-21 12:45:37 +03:00
|
|
|
|
curTarg = gn;
|
|
|
|
|
Lst_ForEach (gn->commands, CompatRunCommand, (ClientData)gn);
|
|
|
|
|
curTarg = NILGNODE;
|
|
|
|
|
} else {
|
|
|
|
|
Job_Touch (gn, gn->type & OP_SILENT);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
gn->made = ERROR;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (gn->made != ERROR) {
|
|
|
|
|
/*
|
|
|
|
|
* If the node was made successfully, mark it so, update
|
|
|
|
|
* its modification time and timestamp all its parents. Note
|
|
|
|
|
* that for .ZEROTIME targets, the timestamping isn't done.
|
|
|
|
|
* This is to keep its state from affecting that of its parent.
|
|
|
|
|
*/
|
|
|
|
|
gn->made = MADE;
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags |= Make_Recheck(gn) == 0 ? FORCE : 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (!(gn->type & OP_EXEC)) {
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags |= CHILDMADE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Make_TimeStamp(pgn, gn);
|
|
|
|
|
}
|
|
|
|
|
} else if (keepgoing) {
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags &= ~REMAKE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
} else {
|
2001-06-02 00:33:37 +04:00
|
|
|
|
PrintOnError("\n\nStop.");
|
1993-03-21 12:45:37 +03:00
|
|
|
|
exit (1);
|
|
|
|
|
}
|
|
|
|
|
} else if (gn->made == ERROR) {
|
|
|
|
|
/*
|
|
|
|
|
* Already had an error when making this beastie. Tell the parent
|
|
|
|
|
* to abort.
|
|
|
|
|
*/
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags &= ~REMAKE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
} else {
|
|
|
|
|
if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
|
1994-06-07 02:45:17 +04:00
|
|
|
|
char *p1;
|
2001-06-13 03:36:17 +04:00
|
|
|
|
Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0);
|
1994-06-07 02:45:17 +04:00
|
|
|
|
if (p1)
|
|
|
|
|
free(p1);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
switch(gn->made) {
|
|
|
|
|
case BEINGMADE:
|
2002-03-21 04:24:43 +03:00
|
|
|
|
Error("Graph cycles through %s", gn->name);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
gn->made = ERROR;
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags &= ~REMAKE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
break;
|
|
|
|
|
case MADE:
|
|
|
|
|
if ((gn->type & OP_EXEC) == 0) {
|
1998-11-11 22:37:06 +03:00
|
|
|
|
pgn->flags |= CHILDMADE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Make_TimeStamp(pgn, gn);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case UPTODATE:
|
|
|
|
|
if ((gn->type & OP_EXEC) == 0) {
|
|
|
|
|
Make_TimeStamp(pgn, gn);
|
|
|
|
|
}
|
|
|
|
|
break;
|
1994-03-05 03:34:29 +03:00
|
|
|
|
default:
|
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-09-16 04:49:48 +04:00
|
|
|
|
cohorts:
|
|
|
|
|
Lst_ForEach (gn->cohorts, CompatMake, pgnp);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
return (0);
|
|
|
|
|
}
|
1996-11-06 20:58:58 +03:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*-
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
* Compat_Run --
|
|
|
|
|
* Initialize this mode and start making.
|
|
|
|
|
*
|
2002-06-15 22:24:55 +04:00
|
|
|
|
* Input:
|
|
|
|
|
* targs List of target nodes to re-create
|
|
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
|
* Results:
|
|
|
|
|
* None.
|
|
|
|
|
*
|
|
|
|
|
* Side Effects:
|
|
|
|
|
* Guess what?
|
|
|
|
|
*
|
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
void
|
2002-06-15 22:24:55 +04:00
|
|
|
|
Compat_Run(Lst targs)
|
1993-03-21 12:45:37 +03:00
|
|
|
|
{
|
1994-03-05 03:34:29 +03:00
|
|
|
|
GNode *gn = NULL;/* Current root target */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
int errors; /* Number of targets not remade due to errors */
|
|
|
|
|
|
2004-05-07 12:12:15 +04:00
|
|
|
|
Compat_Init();
|
2003-08-01 04:39:52 +04:00
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
if (signal(SIGINT, SIG_IGN) != SIG_IGN) {
|
|
|
|
|
signal(SIGINT, CompatInterrupt);
|
|
|
|
|
}
|
|
|
|
|
if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
|
|
|
|
|
signal(SIGTERM, CompatInterrupt);
|
|
|
|
|
}
|
|
|
|
|
if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
|
|
|
|
|
signal(SIGHUP, CompatInterrupt);
|
|
|
|
|
}
|
|
|
|
|
if (signal(SIGQUIT, SIG_IGN) != SIG_IGN) {
|
|
|
|
|
signal(SIGQUIT, CompatInterrupt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ENDNode = Targ_FindNode(".END", TARG_CREATE);
|
|
|
|
|
/*
|
|
|
|
|
* If the user has defined a .BEGIN target, execute the commands attached
|
|
|
|
|
* to it.
|
|
|
|
|
*/
|
|
|
|
|
if (!queryFlag) {
|
|
|
|
|
gn = Targ_FindNode(".BEGIN", TARG_NOCREATE);
|
|
|
|
|
if (gn != NILGNODE) {
|
|
|
|
|
Lst_ForEach(gn->commands, CompatRunCommand, (ClientData)gn);
|
1996-11-06 20:58:58 +03:00
|
|
|
|
if (gn->made == ERROR) {
|
2001-06-02 00:33:37 +04:00
|
|
|
|
PrintOnError("\n\nStop.");
|
1996-11-06 20:58:58 +03:00
|
|
|
|
exit(1);
|
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1997-02-20 19:51:47 +03:00
|
|
|
|
/*
|
|
|
|
|
* Expand .USE nodes right now, because they can modify the structure
|
|
|
|
|
* of the tree.
|
|
|
|
|
*/
|
|
|
|
|
Lst_Destroy(Make_ExpandUse(targs), NOFREE);
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
|
/*
|
|
|
|
|
* For each entry in the list of targets to create, call CompatMake on
|
|
|
|
|
* it to create the thing. CompatMake will leave the 'made' field of gn
|
|
|
|
|
* in one of several states:
|
|
|
|
|
* UPTODATE gn was already up-to-date
|
|
|
|
|
* MADE gn was recreated successfully
|
|
|
|
|
* ERROR An error occurred while gn was being created
|
|
|
|
|
* ABORTED gn was not remade because one of its inferiors
|
|
|
|
|
* could not be made due to errors.
|
|
|
|
|
*/
|
|
|
|
|
errors = 0;
|
|
|
|
|
while (!Lst_IsEmpty (targs)) {
|
|
|
|
|
gn = (GNode *) Lst_DeQueue (targs);
|
|
|
|
|
CompatMake (gn, gn);
|
|
|
|
|
|
|
|
|
|
if (gn->made == UPTODATE) {
|
|
|
|
|
printf ("`%s' is up to date.\n", gn->name);
|
|
|
|
|
} else if (gn->made == ABORTED) {
|
|
|
|
|
printf ("`%s' not remade because of errors.\n", gn->name);
|
|
|
|
|
errors += 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If the user has defined a .END target, run its commands.
|
|
|
|
|
*/
|
|
|
|
|
if (errors == 0) {
|
|
|
|
|
Lst_ForEach(ENDNode->commands, CompatRunCommand, (ClientData)gn);
|
2001-10-16 22:50:12 +04:00
|
|
|
|
if (gn->made == ERROR) {
|
|
|
|
|
PrintOnError("\n\nStop.");
|
|
|
|
|
exit(1);
|
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
|
}
|
|
|
|
|
}
|