compat.c revision 1.47 1 1.47 agc /* $NetBSD: compat.c,v 1.47 2003/08/07 11:14:48 agc Exp $ */
2 1.10 christos
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
5 1.47 agc * All rights reserved.
6 1.47 agc *
7 1.47 agc * This code is derived from software contributed to Berkeley by
8 1.47 agc * Adam de Boor.
9 1.47 agc *
10 1.47 agc * Redistribution and use in source and binary forms, with or without
11 1.47 agc * modification, are permitted provided that the following conditions
12 1.47 agc * are met:
13 1.47 agc * 1. Redistributions of source code must retain the above copyright
14 1.47 agc * notice, this list of conditions and the following disclaimer.
15 1.47 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.47 agc * notice, this list of conditions and the following disclaimer in the
17 1.47 agc * documentation and/or other materials provided with the distribution.
18 1.47 agc * 3. Neither the name of the University nor the names of its contributors
19 1.47 agc * may be used to endorse or promote products derived from this software
20 1.47 agc * without specific prior written permission.
21 1.47 agc *
22 1.47 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.47 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.47 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.47 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.47 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.47 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.47 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.47 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.47 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.47 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.47 agc * SUCH DAMAGE.
33 1.47 agc */
34 1.47 agc
35 1.47 agc /*
36 1.1 cgd * Copyright (c) 1988, 1989 by Adam de Boor
37 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
38 1.1 cgd * All rights reserved.
39 1.1 cgd *
40 1.1 cgd * This code is derived from software contributed to Berkeley by
41 1.1 cgd * Adam de Boor.
42 1.1 cgd *
43 1.1 cgd * Redistribution and use in source and binary forms, with or without
44 1.1 cgd * modification, are permitted provided that the following conditions
45 1.1 cgd * are met:
46 1.1 cgd * 1. Redistributions of source code must retain the above copyright
47 1.1 cgd * notice, this list of conditions and the following disclaimer.
48 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
49 1.1 cgd * notice, this list of conditions and the following disclaimer in the
50 1.1 cgd * documentation and/or other materials provided with the distribution.
51 1.1 cgd * 3. All advertising materials mentioning features or use of this software
52 1.1 cgd * must display the following acknowledgement:
53 1.1 cgd * This product includes software developed by the University of
54 1.1 cgd * California, Berkeley and its contributors.
55 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
56 1.1 cgd * may be used to endorse or promote products derived from this software
57 1.1 cgd * without specific prior written permission.
58 1.1 cgd *
59 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 1.1 cgd * SUCH DAMAGE.
70 1.1 cgd */
71 1.1 cgd
72 1.22 lukem #ifdef MAKE_BOOTSTRAP
73 1.47 agc static char rcsid[] = "$NetBSD: compat.c,v 1.47 2003/08/07 11:14:48 agc Exp $";
74 1.22 lukem #else
75 1.21 christos #include <sys/cdefs.h>
76 1.1 cgd #ifndef lint
77 1.10 christos #if 0
78 1.14 christos static char sccsid[] = "@(#)compat.c 8.2 (Berkeley) 3/19/94";
79 1.10 christos #else
80 1.47 agc __RCSID("$NetBSD: compat.c,v 1.47 2003/08/07 11:14:48 agc Exp $");
81 1.10 christos #endif
82 1.1 cgd #endif /* not lint */
83 1.22 lukem #endif
84 1.1 cgd
85 1.1 cgd /*-
86 1.1 cgd * compat.c --
87 1.1 cgd * The routines in this file implement the full-compatibility
88 1.1 cgd * mode of PMake. Most of the special functionality of PMake
89 1.1 cgd * is available in this mode. Things not supported:
90 1.1 cgd * - different shells.
91 1.1 cgd * - friendly variable substitution.
92 1.1 cgd *
93 1.1 cgd * Interface:
94 1.1 cgd * Compat_Run Initialize things for this module and recreate
95 1.1 cgd * thems as need creatin'
96 1.1 cgd */
97 1.1 cgd
98 1.1 cgd #include <sys/types.h>
99 1.11 jtc #include <sys/stat.h>
100 1.1 cgd #include <sys/wait.h>
101 1.44 wiz
102 1.1 cgd #include <ctype.h>
103 1.11 jtc #include <errno.h>
104 1.11 jtc #include <signal.h>
105 1.44 wiz #include <stdio.h>
106 1.44 wiz
107 1.1 cgd #include "make.h"
108 1.5 cgd #include "hash.h"
109 1.5 cgd #include "dir.h"
110 1.5 cgd #include "job.h"
111 1.43 bjh21 #include "pathnames.h"
112 1.1 cgd
113 1.1 cgd /*
114 1.1 cgd * The following array is used to make a fast determination of which
115 1.1 cgd * characters are interpreted specially by the shell. If a command
116 1.1 cgd * contains any of these characters, it is executed by the shell, not
117 1.1 cgd * directly by us.
118 1.1 cgd */
119 1.1 cgd
120 1.1 cgd static char meta[256];
121 1.1 cgd
122 1.1 cgd static GNode *curTarg = NILGNODE;
123 1.1 cgd static GNode *ENDNode;
124 1.44 wiz static void CompatInterrupt(int);
125 1.44 wiz static int CompatRunCommand(ClientData, ClientData);
126 1.44 wiz static int CompatMake(ClientData, ClientData);
127 1.1 cgd
128 1.1 cgd /*-
129 1.1 cgd *-----------------------------------------------------------------------
130 1.1 cgd * CompatInterrupt --
131 1.1 cgd * Interrupt the creation of the current target and remove it if
132 1.1 cgd * it ain't precious.
133 1.1 cgd *
134 1.1 cgd * Results:
135 1.1 cgd * None.
136 1.1 cgd *
137 1.1 cgd * Side Effects:
138 1.1 cgd * The target is removed and the process exits. If .INTERRUPT exists,
139 1.1 cgd * its commands are run first WITH INTERRUPTS IGNORED..
140 1.1 cgd *
141 1.1 cgd *-----------------------------------------------------------------------
142 1.1 cgd */
143 1.1 cgd static void
144 1.44 wiz CompatInterrupt(int signo)
145 1.1 cgd {
146 1.1 cgd GNode *gn;
147 1.14 christos
148 1.1 cgd if ((curTarg != NILGNODE) && !Targ_Precious (curTarg)) {
149 1.7 jtc char *p1;
150 1.7 jtc char *file = Var_Value (TARGET, curTarg, &p1);
151 1.1 cgd
152 1.12 christos if (!noExecute && eunlink(file) != -1) {
153 1.42 christos Error("*** %s removed", file);
154 1.1 cgd }
155 1.7 jtc if (p1)
156 1.7 jtc free(p1);
157 1.1 cgd
158 1.1 cgd /*
159 1.1 cgd * Run .INTERRUPT only if hit with interrupt signal
160 1.1 cgd */
161 1.1 cgd if (signo == SIGINT) {
162 1.1 cgd gn = Targ_FindNode(".INTERRUPT", TARG_NOCREATE);
163 1.1 cgd if (gn != NILGNODE) {
164 1.1 cgd Lst_ForEach(gn->commands, CompatRunCommand, (ClientData)gn);
165 1.1 cgd }
166 1.1 cgd }
167 1.7 jtc
168 1.1 cgd }
169 1.7 jtc exit (signo);
170 1.1 cgd }
171 1.1 cgd
172 1.1 cgd /*-
174 1.1 cgd *-----------------------------------------------------------------------
175 1.1 cgd * CompatRunCommand --
176 1.1 cgd * Execute the next command for a target. If the command returns an
177 1.1 cgd * error, the node's made field is set to ERROR and creation stops.
178 1.44 wiz *
179 1.44 wiz * Input:
180 1.44 wiz * cmdp Command to execute
181 1.44 wiz * gnp Node from which the command came
182 1.1 cgd *
183 1.1 cgd * Results:
184 1.1 cgd * 0 if the command succeeded, 1 if an error occurred.
185 1.1 cgd *
186 1.1 cgd * Side Effects:
187 1.1 cgd * The node's 'made' field may be set to ERROR.
188 1.1 cgd *
189 1.1 cgd *-----------------------------------------------------------------------
190 1.1 cgd */
191 1.44 wiz static int
192 1.1 cgd CompatRunCommand(ClientData cmdp, ClientData gnp)
193 1.1 cgd {
194 1.24 christos char *cmdStart; /* Start of expanded command */
195 1.1 cgd char *cp, *bp;
196 1.1 cgd Boolean silent, /* Don't print command */
197 1.13 christos errCheck; /* Check errors */
198 1.1 cgd int reason; /* Reason for child's death */
199 1.1 cgd int status; /* Description of child's death */
200 1.37 reinoud int cpid; /* Child actually found */
201 1.1 cgd ReturnStatus retstat; /* Status of fork */
202 1.45 christos LstNode cmdNode; /* Node where current command is located */
203 1.1 cgd const char **av; /* Argument vector for thing to exec */
204 1.1 cgd int argc; /* Number of arguments in av or 0 if not
205 1.1 cgd * dynamically allocated */
206 1.1 cgd Boolean local; /* TRUE if command should be executed
207 1.7 jtc * locally */
208 1.7 jtc char *cmd = (char *) cmdp;
209 1.1 cgd GNode *gn = (GNode *) gnp;
210 1.14 christos
211 1.6 cgd /*
212 1.6 cgd * Avoid clobbered variable warnings by forcing the compiler
213 1.6 cgd * to ``unregister'' variables
214 1.6 cgd */
215 1.6 cgd #if __GNUC__
216 1.6 cgd (void) &av;
217 1.6 cgd (void) &errCheck;
218 1.1 cgd #endif
219 1.1 cgd silent = gn->type & OP_SILENT;
220 1.1 cgd errCheck = !(gn->type & OP_IGNORE);
221 1.1 cgd
222 1.5 cgd cmdNode = Lst_Member (gn->commands, (ClientData)cmd);
223 1.1 cgd cmdStart = Var_Subst (NULL, cmd, gn, FALSE);
224 1.1 cgd
225 1.24 christos /*
226 1.1 cgd * brk_string will return an argv with a NULL in av[0], thus causing
227 1.1 cgd * execvp to choke and die horribly. Besides, how can we execute a null
228 1.1 cgd * command? In any case, we warn the user that the command expanded to
229 1.1 cgd * nothing (is this the right thing to do?).
230 1.14 christos */
231 1.1 cgd
232 1.7 jtc if (*cmdStart == '\0') {
233 1.1 cgd free(cmdStart);
234 1.1 cgd Error("%s expands to empty string", cmd);
235 1.1 cgd return(0);
236 1.1 cgd } else {
237 1.1 cgd cmd = cmdStart;
238 1.1 cgd }
239 1.1 cgd Lst_Replace (cmdNode, (ClientData)cmdStart);
240 1.1 cgd
241 1.1 cgd if ((gn->type & OP_SAVE_CMDS) && (gn != ENDNode)) {
242 1.1 cgd (void)Lst_AtEnd(ENDNode->commands, (ClientData)cmdStart);
243 1.1 cgd return(0);
244 1.1 cgd } else if (strcmp(cmdStart, "...") == 0) {
245 1.1 cgd gn->type |= OP_SAVE_CMDS;
246 1.1 cgd return(0);
247 1.1 cgd }
248 1.1 cgd
249 1.1 cgd while ((*cmd == '@') || (*cmd == '-')) {
250 1.1 cgd if (*cmd == '@') {
251 1.1 cgd silent = TRUE;
252 1.1 cgd } else {
253 1.1 cgd errCheck = FALSE;
254 1.1 cgd }
255 1.1 cgd cmd++;
256 1.1 cgd }
257 1.5 cgd
258 1.5 cgd while (isspace((unsigned char)*cmd))
259 1.14 christos cmd++;
260 1.1 cgd
261 1.1 cgd /*
262 1.1 cgd * Search for meta characters in the command. If there are no meta
263 1.1 cgd * characters, there's no need to execute a shell to execute the
264 1.1 cgd * command.
265 1.5 cgd */
266 1.1 cgd for (cp = cmd; !meta[(unsigned char)*cp]; cp++) {
267 1.1 cgd continue;
268 1.1 cgd }
269 1.1 cgd
270 1.1 cgd /*
271 1.1 cgd * Print the command before echoing if we're not supposed to be quiet for
272 1.1 cgd * this one. We also print the command if -n given.
273 1.31 sommerfe */
274 1.1 cgd if (!silent || NoExecute(gn)) {
275 1.1 cgd printf ("%s\n", cmd);
276 1.1 cgd fflush(stdout);
277 1.1 cgd }
278 1.1 cgd
279 1.1 cgd /*
280 1.1 cgd * If we're not supposed to execute any commands, this is as far as
281 1.1 cgd * we go...
282 1.31 sommerfe */
283 1.1 cgd if (NoExecute(gn)) {
284 1.1 cgd return (0);
285 1.14 christos }
286 1.1 cgd
287 1.1 cgd if (*cp != '\0') {
288 1.1 cgd /*
289 1.1 cgd * If *cp isn't the null character, we hit a "meta" character and
290 1.1 cgd * need to pass the command off to the shell. We give the shell the
291 1.1 cgd * -e flag as well as -c if it's supposed to exit when it hits an
292 1.1 cgd * error.
293 1.46 sjg */
294 1.1 cgd static const char *shargv[4];
295 1.46 sjg
296 1.46 sjg shargv[0] = shellPath;
297 1.46 sjg /*
298 1.46 sjg * The following work for any of the builtin shell specs.
299 1.34 sjg */
300 1.34 sjg if (DEBUG(SHELL))
301 1.34 sjg shargv[1] = (errCheck ? "-exc" : "-xc");
302 1.34 sjg else
303 1.1 cgd shargv[1] = (errCheck ? "-ec" : "-c");
304 1.1 cgd shargv[2] = cmd;
305 1.1 cgd shargv[3] = (char *)NULL;
306 1.1 cgd av = shargv;
307 1.24 christos argc = 0;
308 1.1 cgd bp = NULL;
309 1.1 cgd } else {
310 1.1 cgd /*
311 1.1 cgd * No meta-characters, so no need to exec a shell. Break the command
312 1.1 cgd * into words to form an argument vector we can execute.
313 1.45 christos */
314 1.1 cgd av = (const char **)brk_string(cmd, &argc, TRUE, &bp);
315 1.14 christos }
316 1.1 cgd
317 1.1 cgd local = TRUE;
318 1.1 cgd
319 1.1 cgd /*
320 1.1 cgd * Fork and execute the single command. If the fork fails, we abort.
321 1.1 cgd */
322 1.1 cgd cpid = vfork();
323 1.1 cgd if (cpid < 0) {
324 1.1 cgd Fatal("Could not fork");
325 1.1 cgd }
326 1.30 sjg if (cpid == 0) {
327 1.33 christos Check_Cwd(av);
328 1.45 christos if (local)
329 1.33 christos (void)execvp(av[0], (char *const *)UNCONST(av));
330 1.45 christos else
331 1.41 pk (void)execv(av[0], (char *const *)UNCONST(av));
332 1.23 thorpej execError("exec", av[0]);
333 1.1 cgd _exit(1);
334 1.25 itohy }
335 1.25 itohy if (bp) {
336 1.25 itohy free(av);
337 1.25 itohy free(bp);
338 1.7 jtc }
339 1.7 jtc free(cmdStart);
340 1.14 christos Lst_Replace (cmdNode, (ClientData) NULL);
341 1.1 cgd
342 1.1 cgd /*
343 1.1 cgd * The child is off and running. Now all we can do is wait...
344 1.1 cgd */
345 1.1 cgd while (1) {
346 1.37 reinoud
347 1.37 reinoud while ((retstat = wait(&reason)) != cpid) {
348 1.1 cgd if (retstat == -1 && errno != EINTR) {
349 1.1 cgd break;
350 1.1 cgd }
351 1.14 christos }
352 1.37 reinoud
353 1.1 cgd if (retstat > -1) {
354 1.13 christos if (WIFSTOPPED(reason)) {
355 1.1 cgd status = WSTOPSIG(reason); /* stopped */
356 1.13 christos } else if (WIFEXITED(reason)) {
357 1.1 cgd status = WEXITSTATUS(reason); /* exited */
358 1.1 cgd if (status != 0) {
359 1.1 cgd printf ("*** Error code %d", status);
360 1.1 cgd }
361 1.13 christos } else {
362 1.1 cgd status = WTERMSIG(reason); /* signaled */
363 1.14 christos printf ("*** Signal %d", status);
364 1.14 christos }
365 1.1 cgd
366 1.1 cgd
367 1.1 cgd if (!WIFEXITED(reason) || (status != 0)) {
368 1.1 cgd if (errCheck) {
369 1.1 cgd gn->made = ERROR;
370 1.1 cgd if (keepgoing) {
371 1.1 cgd /*
372 1.1 cgd * Abort the current target, but let others
373 1.1 cgd * continue.
374 1.1 cgd */
375 1.1 cgd printf (" (continuing)\n");
376 1.1 cgd }
377 1.1 cgd } else {
378 1.1 cgd /*
379 1.1 cgd * Continue executing commands for this target.
380 1.1 cgd * If we return 0, this will happen...
381 1.1 cgd */
382 1.1 cgd printf (" (ignored)\n");
383 1.1 cgd status = 0;
384 1.1 cgd }
385 1.1 cgd }
386 1.1 cgd break;
387 1.37 reinoud } else {
388 1.1 cgd Fatal ("error in wait: %d: %s", retstat, strerror(errno));
389 1.1 cgd /*NOTREACHED*/
390 1.1 cgd }
391 1.1 cgd }
392 1.1 cgd
393 1.1 cgd return (status);
394 1.1 cgd }
395 1.1 cgd
396 1.1 cgd /*-
398 1.1 cgd *-----------------------------------------------------------------------
399 1.1 cgd * CompatMake --
400 1.44 wiz * Make a target.
401 1.44 wiz *
402 1.44 wiz * Input:
403 1.44 wiz * gnp The node to make
404 1.1 cgd * pgnp Parent to abort if necessary
405 1.1 cgd *
406 1.1 cgd * Results:
407 1.1 cgd * 0
408 1.1 cgd *
409 1.1 cgd * Side Effects:
410 1.1 cgd * If an error is detected and not being ignored, the process exits.
411 1.1 cgd *
412 1.1 cgd *-----------------------------------------------------------------------
413 1.44 wiz */
414 1.1 cgd static int
415 1.7 jtc CompatMake(ClientData gnp, ClientData pgnp)
416 1.7 jtc {
417 1.16 christos GNode *gn = (GNode *) gnp;
418 1.40 pk GNode *pgn = (GNode *) pgnp;
419 1.1 cgd
420 1.1 cgd if (gn->made == UNMADE && (gn == pgn || (pgn->type & OP_MADE) == 0)) {
421 1.1 cgd /*
422 1.1 cgd * First mark ourselves to be made, then apply whatever transformations
423 1.1 cgd * the suffix module thinks are necessary. Once that's done, we can
424 1.1 cgd * descend and make all our children. If any of them has an error
425 1.1 cgd * but the -k flag was given, our 'make' field will be set FALSE again.
426 1.1 cgd * This is our signal to not attempt to do anything but abort our
427 1.26 christos * parent as well.
428 1.1 cgd */
429 1.38 pk gn->flags |= REMAKE;
430 1.38 pk gn->made = BEINGMADE;
431 1.1 cgd if ((gn->type & OP_MADE) == 0)
432 1.26 christos Suff_FindDeps (gn);
433 1.1 cgd Lst_ForEach (gn->children, CompatMake, (ClientData)gn);
434 1.26 christos if ((gn->flags & REMAKE) == 0) {
435 1.28 mycroft gn->made = ABORTED;
436 1.1 cgd pgn->flags &= ~REMAKE;
437 1.1 cgd goto cohorts;
438 1.1 cgd }
439 1.7 jtc
440 1.35 sjg if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
441 1.7 jtc char *p1;
442 1.7 jtc Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0);
443 1.1 cgd if (p1)
444 1.14 christos free(p1);
445 1.1 cgd }
446 1.1 cgd
447 1.1 cgd /*
448 1.1 cgd * All the children were made ok. Now cmtime contains the modification
449 1.1 cgd * time of the newest child, we need to find out if we exist and when
450 1.1 cgd * we were modified last. The criteria for datedness are defined by the
451 1.1 cgd * Make_OODate function.
452 1.1 cgd */
453 1.1 cgd if (DEBUG(MAKE)) {
454 1.1 cgd printf("Examining %s...", gn->name);
455 1.1 cgd }
456 1.1 cgd if (! Make_OODate(gn)) {
457 1.1 cgd gn->made = UPTODATE;
458 1.1 cgd if (DEBUG(MAKE)) {
459 1.28 mycroft printf("up-to-date.\n");
460 1.1 cgd }
461 1.1 cgd goto cohorts;
462 1.1 cgd } else if (DEBUG(MAKE)) {
463 1.1 cgd printf("out-of-date.\n");
464 1.1 cgd }
465 1.1 cgd
466 1.1 cgd /*
467 1.1 cgd * If the user is just seeing if something is out-of-date, exit now
468 1.1 cgd * to tell him/her "yes".
469 1.32 wiz */
470 1.1 cgd if (queryFlag) {
471 1.1 cgd exit (1);
472 1.1 cgd }
473 1.1 cgd
474 1.1 cgd /*
475 1.1 cgd * We need to be re-made. We also have to make sure we've got a $?
476 1.1 cgd * variable. To be nice, we also define the $> variable using
477 1.1 cgd * Make_DoAllVar().
478 1.14 christos */
479 1.1 cgd Make_DoAllVar(gn);
480 1.1 cgd
481 1.1 cgd /*
482 1.1 cgd * Alter our type to tell if errors should be ignored or things
483 1.1 cgd * should not be printed so CompatRunCommand knows what to do.
484 1.1 cgd */
485 1.1 cgd if (Targ_Ignore (gn)) {
486 1.1 cgd gn->type |= OP_IGNORE;
487 1.1 cgd }
488 1.1 cgd if (Targ_Silent (gn)) {
489 1.1 cgd gn->type |= OP_SILENT;
490 1.1 cgd }
491 1.1 cgd
492 1.1 cgd if (Job_CheckCommands (gn, Fatal)) {
493 1.1 cgd /*
494 1.1 cgd * Our commands are ok, but we still have to worry about the -t
495 1.20 mycroft * flag...
496 1.1 cgd */
497 1.1 cgd if (!touchFlag || (gn->type & OP_MAKE)) {
498 1.1 cgd curTarg = gn;
499 1.1 cgd Lst_ForEach (gn->commands, CompatRunCommand, (ClientData)gn);
500 1.1 cgd curTarg = NILGNODE;
501 1.1 cgd } else {
502 1.1 cgd Job_Touch (gn, gn->type & OP_SILENT);
503 1.1 cgd }
504 1.1 cgd } else {
505 1.1 cgd gn->made = ERROR;
506 1.1 cgd }
507 1.1 cgd
508 1.1 cgd if (gn->made != ERROR) {
509 1.1 cgd /*
510 1.1 cgd * If the node was made successfully, mark it so, update
511 1.1 cgd * its modification time and timestamp all its parents. Note
512 1.1 cgd * that for .ZEROTIME targets, the timestamping isn't done.
513 1.1 cgd * This is to keep its state from affecting that of its parent.
514 1.26 christos */
515 1.1 cgd gn->made = MADE;
516 1.26 christos pgn->flags |= Make_Recheck(gn) == 0 ? FORCE : 0;
517 1.1 cgd if (!(gn->type & OP_EXEC)) {
518 1.1 cgd pgn->flags |= CHILDMADE;
519 1.1 cgd Make_TimeStamp(pgn, gn);
520 1.26 christos }
521 1.1 cgd } else if (keepgoing) {
522 1.34 sjg pgn->flags &= ~REMAKE;
523 1.1 cgd } else {
524 1.1 cgd PrintOnError("\n\nStop.");
525 1.1 cgd exit (1);
526 1.1 cgd }
527 1.1 cgd } else if (gn->made == ERROR) {
528 1.1 cgd /*
529 1.1 cgd * Already had an error when making this beastie. Tell the parent
530 1.26 christos * to abort.
531 1.1 cgd */
532 1.1 cgd pgn->flags &= ~REMAKE;
533 1.7 jtc } else {
534 1.35 sjg if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
535 1.7 jtc char *p1;
536 1.7 jtc Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0);
537 1.1 cgd if (p1)
538 1.1 cgd free(p1);
539 1.1 cgd }
540 1.42 christos switch(gn->made) {
541 1.1 cgd case BEINGMADE:
542 1.26 christos Error("Graph cycles through %s", gn->name);
543 1.1 cgd gn->made = ERROR;
544 1.1 cgd pgn->flags &= ~REMAKE;
545 1.1 cgd break;
546 1.26 christos case MADE:
547 1.1 cgd if ((gn->type & OP_EXEC) == 0) {
548 1.1 cgd pgn->flags |= CHILDMADE;
549 1.1 cgd Make_TimeStamp(pgn, gn);
550 1.1 cgd }
551 1.1 cgd break;
552 1.1 cgd case UPTODATE:
553 1.1 cgd if ((gn->type & OP_EXEC) == 0) {
554 1.1 cgd Make_TimeStamp(pgn, gn);
555 1.5 cgd }
556 1.5 cgd break;
557 1.1 cgd default:
558 1.1 cgd break;
559 1.1 cgd }
560 1.28 mycroft }
561 1.28 mycroft
562 1.1 cgd cohorts:
563 1.1 cgd Lst_ForEach (gn->cohorts, CompatMake, pgnp);
564 1.14 christos return (0);
565 1.1 cgd }
566 1.1 cgd
567 1.1 cgd /*-
569 1.1 cgd *-----------------------------------------------------------------------
570 1.44 wiz * Compat_Run --
571 1.44 wiz * Initialize this mode and start making.
572 1.44 wiz *
573 1.1 cgd * Input:
574 1.1 cgd * targs List of target nodes to re-create
575 1.1 cgd *
576 1.1 cgd * Results:
577 1.1 cgd * None.
578 1.1 cgd *
579 1.1 cgd * Side Effects:
580 1.1 cgd * Guess what?
581 1.1 cgd *
582 1.44 wiz *-----------------------------------------------------------------------
583 1.1 cgd */
584 1.45 christos void
585 1.5 cgd Compat_Run(Lst targs)
586 1.1 cgd {
587 1.46 sjg const char *cp; /* Pointer to string of shell meta-characters */
588 1.46 sjg GNode *gn = NULL;/* Current root target */
589 1.1 cgd int errors; /* Number of targets not remade due to errors */
590 1.1 cgd
591 1.1 cgd Shell_Init(); /* setup default shell */
592 1.1 cgd
593 1.1 cgd if (signal(SIGINT, SIG_IGN) != SIG_IGN) {
594 1.1 cgd signal(SIGINT, CompatInterrupt);
595 1.1 cgd }
596 1.1 cgd if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
597 1.1 cgd signal(SIGTERM, CompatInterrupt);
598 1.1 cgd }
599 1.1 cgd if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
600 1.1 cgd signal(SIGHUP, CompatInterrupt);
601 1.1 cgd }
602 1.1 cgd if (signal(SIGQUIT, SIG_IGN) != SIG_IGN) {
603 1.1 cgd signal(SIGQUIT, CompatInterrupt);
604 1.5 cgd }
605 1.1 cgd
606 1.1 cgd for (cp = "#=|^(){};&<>*?[]:$`\\\n"; *cp != '\0'; cp++) {
607 1.1 cgd meta[(unsigned char) *cp] = 1;
608 1.1 cgd }
609 1.1 cgd /*
610 1.1 cgd * The null character serves as a sentinel in the string.
611 1.1 cgd */
612 1.1 cgd meta[0] = 1;
613 1.1 cgd
614 1.1 cgd ENDNode = Targ_FindNode(".END", TARG_CREATE);
615 1.1 cgd /*
616 1.1 cgd * If the user has defined a .BEGIN target, execute the commands attached
617 1.1 cgd * to it.
618 1.1 cgd */
619 1.1 cgd if (!queryFlag) {
620 1.14 christos gn = Targ_FindNode(".BEGIN", TARG_NOCREATE);
621 1.34 sjg if (gn != NILGNODE) {
622 1.14 christos Lst_ForEach(gn->commands, CompatRunCommand, (ClientData)gn);
623 1.14 christos if (gn->made == ERROR) {
624 1.1 cgd PrintOnError("\n\nStop.");
625 1.1 cgd exit(1);
626 1.15 christos }
627 1.15 christos }
628 1.15 christos }
629 1.15 christos
630 1.15 christos /*
631 1.15 christos * Expand .USE nodes right now, because they can modify the structure
632 1.1 cgd * of the tree.
633 1.1 cgd */
634 1.1 cgd Lst_Destroy(Make_ExpandUse(targs), NOFREE);
635 1.1 cgd
636 1.1 cgd /*
637 1.1 cgd * For each entry in the list of targets to create, call CompatMake on
638 1.1 cgd * it to create the thing. CompatMake will leave the 'made' field of gn
639 1.1 cgd * in one of several states:
640 1.1 cgd * UPTODATE gn was already up-to-date
641 1.1 cgd * MADE gn was recreated successfully
642 1.1 cgd * ERROR An error occurred while gn was being created
643 1.1 cgd * ABORTED gn was not remade because one of its inferiors
644 1.1 cgd * could not be made due to errors.
645 1.1 cgd */
646 1.1 cgd errors = 0;
647 1.1 cgd while (!Lst_IsEmpty (targs)) {
648 1.1 cgd gn = (GNode *) Lst_DeQueue (targs);
649 1.1 cgd CompatMake (gn, gn);
650 1.1 cgd
651 1.1 cgd if (gn->made == UPTODATE) {
652 1.1 cgd printf ("`%s' is up to date.\n", gn->name);
653 1.1 cgd } else if (gn->made == ABORTED) {
654 1.1 cgd printf ("`%s' not remade because of errors.\n", gn->name);
655 1.1 cgd errors += 1;
656 1.1 cgd }
657 1.1 cgd }
658 1.1 cgd
659 1.1 cgd /*
660 1.1 cgd * If the user has defined a .END target, run its commands.
661 1.36 sjg */
662 1.36 sjg if (errors == 0) {
663 1.36 sjg Lst_ForEach(ENDNode->commands, CompatRunCommand, (ClientData)gn);
664 1.36 sjg if (gn->made == ERROR) {
665 1.1 cgd PrintOnError("\n\nStop.");
666 1.1 cgd exit(1);
667 }
668 }
669 }
670