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 /*- 140 *----------------------------------------------------------------------- 141 * CompatRunCommand -- 142 * Execute the next command for a target. If the command returns an 143 * error, the node's made field is set to ERROR and creation stops. 144 * 145 * Results: 146 * 0 if the command succeeded, 1 if an error occurred. 147 * 148 * Side Effects: 149 * The node's 'made' field may be set to ERROR. 150 * 151 *----------------------------------------------------------------------- 152 */ 153 static int 154 CompatRunCommand (cmdp, gnp) 155 ClientData cmdp; /* Command to execute */ 156 ClientData gnp; /* Node from which the command came */ 157 { 158 char *cmdStart; /* Start of expanded command */ 159 char *cp, *bp; 160 Boolean silent, /* Don't print command */ 161 errCheck; /* Check errors */ 162 int reason; /* Reason for child's death */ 163 int status; /* Description of child's death */ 164 int cpid; /* Child actually found */ 165 ReturnStatus stat; /* Status of fork */ 166 LstNode cmdNode; /* Node where current command is located */ 167 char **av; /* Argument vector for thing to exec */ 168 int argc; /* Number of arguments in av or 0 if not 169 * dynamically allocated */ 170 Boolean local; /* TRUE if command should be executed 171 * locally */ 172 char *cmd = (char *) cmdp; 173 GNode *gn = (GNode *) gnp; 174 175 /* 176 * Avoid clobbered variable warnings by forcing the compiler 177 * to ``unregister'' variables 178 */ 179 #if __GNUC__ 180 (void) &av; 181 (void) &errCheck; 182 #endif 183 silent = gn->type & OP_SILENT; 184 errCheck = !(gn->type & OP_IGNORE); 185 186 cmdNode = Lst_Member (gn->commands, (ClientData)cmd); 187 cmdStart = Var_Subst (NULL, cmd, gn, FALSE); 188 189 /* 190 * brk_string will return an argv with a NULL in av[0], thus causing 191 * execvp to choke and die horribly. Besides, how can we execute a null 192 * command? In any case, we warn the user that the command expanded to 193 * nothing (is this the right thing to do?). 194 */ 195 196 if (*cmdStart == '\0') { 197 free(cmdStart); 198 Error("%s expands to empty string", cmd); 199 return(0); 200 } else { 201 cmd = cmdStart; 202 } 203 Lst_Replace (cmdNode, (ClientData)cmdStart); 204 205 if ((gn->type & OP_SAVE_CMDS) && (gn != ENDNode)) { 206 (void)Lst_AtEnd(ENDNode->commands, (ClientData)cmdStart); 207 return(0); 208 } else if (strcmp(cmdStart, "...") == 0) { 209 gn->type |= OP_SAVE_CMDS; 210 return(0); 211 } 212 213 while ((*cmd == '@') || (*cmd == '-')) { 214 if (*cmd == '@') { 215 silent = TRUE; 216 } else { 217 errCheck = FALSE; 218 } 219 cmd++; 220 } 221 222 while (isspace((unsigned char)*cmd)) 223 cmd++; 224 225 /* 226 * Search for meta characters in the command. If there are no meta 227 * characters, there's no need to execute a shell to execute the 228 * command. 229 */ 230 for (cp = cmd; !meta[(unsigned char)*cp]; cp++) { 231 continue; 232 } 233 234 /* 235 * Print the command before echoing if we're not supposed to be quiet for 236 * this one. We also print the command if -n given. 237 */ 238 if (!silent || (noExecute && !(gn->type & OP_MAKE))) { 239 printf ("%s\n", cmd); 240 fflush(stdout); 241 } 242 243 /* 244 * If we're not supposed to execute any commands, this is as far as 245 * we go... 246 */ 247 if (noExecute && !(gn->type & OP_MAKE)) { 248 return (0); 249 } 250 251 if (*cp != '\0') { 252 /* 253 * If *cp isn't the null character, we hit a "meta" character and 254 * need to pass the command off to the shell. We give the shell the 255 * -e flag as well as -c if it's supposed to exit when it hits an 256 * error. 257 */ 258 static char *shargv[4] = { "/bin/sh" }; 259 260 shargv[1] = (errCheck ? "-ec" : "-c"); 261 shargv[2] = cmd; 262 shargv[3] = (char *)NULL; 263 av = shargv; 264 argc = 0; 265 bp = NULL; 266 } else { 267 /* 268 * No meta-characters, so no need to exec a shell. Break the command 269 * into words to form an argument vector we can execute. 270 */ 271 av = brk_string(cmd, &argc, TRUE, &bp); 272 } 273 274 local = TRUE; 275 276 /* 277 * Fork and execute the single command. If the fork fails, we abort. 278 */ 279 cpid = vfork(); 280 if (cpid < 0) { 281 Fatal("Could not fork"); 282 } 283 if (cpid == 0) { 284 Check_Cwd(av); 285 if (local) { 286 execvp(av[0], av); 287 (void) write (2, av[0], strlen (av[0])); 288 (void) write (2, ": not found\n", sizeof(": not found")); 289 } else { 290 (void)execv(av[0], av); 291 } 292 _exit(1); 293 } 294 if (bp) { 295 free(av); 296 free(bp); 297 } 298 free(cmdStart); 299 Lst_Replace (cmdNode, (ClientData) NULL); 300 301 /* 302 * The child is off and running. Now all we can do is wait... 303 */ 304 while (1) { 305 306 while ((stat = wait(&reason)) != cpid) { 307 if (stat == -1 && errno != EINTR) { 308 break; 309 } 310 } 311 312 if (stat > -1) { 313 if (WIFSTOPPED(reason)) { 314 status = WSTOPSIG(reason); /* stopped */ 315 } else if (WIFEXITED(reason)) { 316 status = WEXITSTATUS(reason); /* exited */ 317 if (status != 0) { 318 printf ("*** Error code %d", status); 319 } 320 } else { 321 status = WTERMSIG(reason); /* signaled */ 322 printf ("*** Signal %d", status); 323 } 324 325 326 if (!WIFEXITED(reason) || (status != 0)) { 327 if (errCheck) { 328 gn->made = ERROR; 329 if (keepgoing) { 330 /* 331 * Abort the current target, but let others 332 * continue. 333 */ 334 printf (" (continuing)\n"); 335 } 336 } else { 337 /* 338 * Continue executing commands for this target. 339 * If we return 0, this will happen... 340 */ 341 printf (" (ignored)\n"); 342 status = 0; 343 } 344 } 345 break; 346 } else { 347 Fatal ("error in wait: %d: %s", stat, strerror(errno)); 348 /*NOTREACHED*/ 349 } 350 } 351 352 return (status); 353 } 354 355 /*- 356 *----------------------------------------------------------------------- 357 * CompatMake -- 358 * Make a target. 359 * 360 * Results: 361 * 0 362 * 363 * Side Effects: 364 * If an error is detected and not being ignored, the process exits. 365 * 366 *----------------------------------------------------------------------- 367 */ 368 static int 369 CompatMake (gnp, pgnp) 370 ClientData gnp; /* The node to make */ 371 ClientData pgnp; /* Parent to abort if necessary */ 372 { 373 GNode *gn = (GNode *) gnp; 374 GNode *pgn = (GNode *) pgnp; 375 376 if (pgn->type & OP_MADE) { 377 (void) Dir_MTime(gn); 378 gn->made = UPTODATE; 379 } 380 381 if (gn->made == UNMADE) { 382 /* 383 * First mark ourselves to be made, then apply whatever transformations 384 * the suffix module thinks are necessary. Once that's done, we can 385 * descend and make all our children. If any of them has an error 386 * but the -k flag was given, our 'make' field will be set FALSE again. 387 * This is our signal to not attempt to do anything but abort our 388 * parent as well. 389 */ 390 gn->flags |= REMAKE; 391 gn->made = BEINGMADE; 392 Suff_FindDeps (gn); 393 Lst_ForEach (gn->children, CompatMake, (ClientData)gn); 394 if ((gn->flags & REMAKE) == 0) { 395 gn->made = ABORTED; 396 pgn->flags &= ~REMAKE; 397 goto cohorts; 398 } 399 400 if (Lst_Member (gn->iParents, pgn) != NILLNODE) { 401 char *p1; 402 Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn); 403 if (p1) 404 free(p1); 405 } 406 407 /* 408 * All the children were made ok. Now cmtime contains the modification 409 * time of the newest child, we need to find out if we exist and when 410 * we were modified last. The criteria for datedness are defined by the 411 * Make_OODate function. 412 */ 413 if (DEBUG(MAKE)) { 414 printf("Examining %s...", gn->name); 415 } 416 if (! Make_OODate(gn)) { 417 gn->made = UPTODATE; 418 if (DEBUG(MAKE)) { 419 printf("up-to-date.\n"); 420 } 421 goto cohorts; 422 } else if (DEBUG(MAKE)) { 423 printf("out-of-date.\n"); 424 } 425 426 /* 427 * If the user is just seeing if something is out-of-date, exit now 428 * to tell him/her "yes". 429 */ 430 if (queryFlag) { 431 exit (-1); 432 } 433 434 /* 435 * We need to be re-made. We also have to make sure we've got a $? 436 * variable. To be nice, we also define the $> variable using 437 * Make_DoAllVar(). 438 */ 439 Make_DoAllVar(gn); 440 441 /* 442 * Alter our type to tell if errors should be ignored or things 443 * should not be printed so CompatRunCommand knows what to do. 444 */ 445 if (Targ_Ignore (gn)) { 446 gn->type |= OP_IGNORE; 447 } 448 if (Targ_Silent (gn)) { 449 gn->type |= OP_SILENT; 450 } 451 452 if (Job_CheckCommands (gn, Fatal)) { 453 /* 454 * Our commands are ok, but we still have to worry about the -t 455 * flag... 456 */ 457 if (!touchFlag || (gn->type & OP_MAKE)) { 458 curTarg = gn; 459 Lst_ForEach (gn->commands, CompatRunCommand, (ClientData)gn); 460 curTarg = NILGNODE; 461 } else { 462 Job_Touch (gn, gn->type & OP_SILENT); 463 } 464 } else { 465 gn->made = ERROR; 466 } 467 468 if (gn->made != ERROR) { 469 /* 470 * If the node was made successfully, mark it so, update 471 * its modification time and timestamp all its parents. Note 472 * that for .ZEROTIME targets, the timestamping isn't done. 473 * This is to keep its state from affecting that of its parent. 474 */ 475 gn->made = MADE; 476 pgn->flags |= Make_Recheck(gn) == 0 ? FORCE : 0; 477 if (!(gn->type & OP_EXEC)) { 478 pgn->flags |= CHILDMADE; 479 Make_TimeStamp(pgn, gn); 480 } 481 } else if (keepgoing) { 482 pgn->flags &= ~REMAKE; 483 } else { 484 printf ("\n\nStop.\n"); 485 exit (1); 486 } 487 } else if (gn->made == ERROR) { 488 /* 489 * Already had an error when making this beastie. Tell the parent 490 * to abort. 491 */ 492 pgn->flags &= ~REMAKE; 493 } else { 494 if (Lst_Member (gn->iParents, pgn) != NILLNODE) { 495 char *p1; 496 Var_Set (IMPSRC, Var_Value(TARGET, gn, &p1), pgn); 497 if (p1) 498 free(p1); 499 } 500 switch(gn->made) { 501 case BEINGMADE: 502 Error("Graph cycles through %s\n", gn->name); 503 gn->made = ERROR; 504 pgn->flags &= ~REMAKE; 505 break; 506 case MADE: 507 if ((gn->type & OP_EXEC) == 0) { 508 pgn->flags |= CHILDMADE; 509 Make_TimeStamp(pgn, gn); 510 } 511 break; 512 case UPTODATE: 513 if ((gn->type & OP_EXEC) == 0) { 514 Make_TimeStamp(pgn, gn); 515 } 516 break; 517 default: 518 break; 519 } 520 } 521 522 cohorts: 523 Lst_ForEach (gn->cohorts, CompatMake, pgnp); 524 return (0); 525 } 526 527 /*- 528 *----------------------------------------------------------------------- 529 * Compat_Run -- 530 * Initialize this mode and start making. 531 * 532 * Results: 533 * None. 534 * 535 * Side Effects: 536 * Guess what? 537 * 538 *----------------------------------------------------------------------- 539 */ 540 void 541 Compat_Run(targs) 542 Lst targs; /* List of target nodes to re-create */ 543 { 544 char *cp; /* Pointer to string of shell meta-characters */ 545 GNode *gn = NULL;/* Current root target */ 546 int errors; /* Number of targets not remade due to errors */ 547 548 if (signal(SIGINT, SIG_IGN) != SIG_IGN) { 549 signal(SIGINT, CompatInterrupt); 550 } 551 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) { 552 signal(SIGTERM, CompatInterrupt); 553 } 554 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) { 555 signal(SIGHUP, CompatInterrupt); 556 } 557 if (signal(SIGQUIT, SIG_IGN) != SIG_IGN) { 558 signal(SIGQUIT, CompatInterrupt); 559 } 560 561 for (cp = "#=|^(){};&<>*?[]:$`\\\n"; *cp != '\0'; cp++) { 562 meta[(unsigned char) *cp] = 1; 563 } 564 /* 565 * The null character serves as a sentinel in the string. 566 */ 567 meta[0] = 1; 568 569 ENDNode = Targ_FindNode(".END", TARG_CREATE); 570 /* 571 * If the user has defined a .BEGIN target, execute the commands attached 572 * to it. 573 */ 574 if (!queryFlag) { 575 gn = Targ_FindNode(".BEGIN", TARG_NOCREATE); 576 if (gn != NILGNODE) { 577 Lst_ForEach(gn->commands, CompatRunCommand, (ClientData)gn); 578 if (gn->made == ERROR) { 579 printf("\n\nStop.\n"); 580 exit(1); 581 } 582 } 583 } 584 585 /* 586 * Expand .USE nodes right now, because they can modify the structure 587 * of the tree. 588 */ 589 Lst_Destroy(Make_ExpandUse(targs), NOFREE); 590 591 /* 592 * For each entry in the list of targets to create, call CompatMake on 593 * it to create the thing. CompatMake will leave the 'made' field of gn 594 * in one of several states: 595 * UPTODATE gn was already up-to-date 596 * MADE gn was recreated successfully 597 * ERROR An error occurred while gn was being created 598 * ABORTED gn was not remade because one of its inferiors 599 * could not be made due to errors. 600 */ 601 errors = 0; 602 while (!Lst_IsEmpty (targs)) { 603 gn = (GNode *) Lst_DeQueue (targs); 604 CompatMake (gn, gn); 605 606 if (gn->made == UPTODATE) { 607 printf ("`%s' is up to date.\n", gn->name); 608 } else if (gn->made == ABORTED) { 609 printf ("`%s' not remade because of errors.\n", gn->name); 610 errors += 1; 611 } 612 } 613 614 /* 615 * If the user has defined a .END target, run its commands. 616 */ 617 if (errors == 0) { 618 Lst_ForEach(ENDNode->commands, CompatRunCommand, (ClientData)gn); 619 } 620 } 621