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