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