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