1 /* $NetBSD: compat.c,v 1.73 2008/12/19 22:01:19 christos 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.73 2008/12/19 22:01:19 christos 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.73 2008/12/19 22:01:19 christos 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(ClientData cmdp, ClientData 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 int cpid; /* Child actually found */ 215 ReturnStatus retstat; /* Status of fork */ 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 } else { 247 cmd = cmdStart; 248 } 249 Lst_Replace(cmdNode, cmdStart); 250 251 if ((gn->type & OP_SAVE_CMDS) && (gn != ENDNode)) { 252 (void)Lst_AtEnd(ENDNode->commands, cmdStart); 253 return(0); 254 } else 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 316 again: 317 if (useShell) { 318 /* 319 * We need to pass the command off to the shell, typically 320 * because the command contains a "meta" character. 321 */ 322 static const char *shargv[4]; 323 324 shargv[0] = shellPath; 325 /* 326 * The following work for any of the builtin shell specs. 327 */ 328 if (DEBUG(SHELL)) 329 shargv[1] = "-xc"; 330 else 331 shargv[1] = "-c"; 332 shargv[2] = cmd; 333 shargv[3] = NULL; 334 av = shargv; 335 argc = 0; 336 bp = NULL; 337 mav = NULL; 338 } else { 339 /* 340 * No meta-characters, so no need to exec a shell. Break the command 341 * into words to form an argument vector we can execute. 342 */ 343 mav = brk_string(cmd, &argc, TRUE, &bp); 344 if (mav == NULL) { 345 useShell = 1; 346 goto again; 347 } 348 av = (const char **)mav; 349 } 350 351 local = TRUE; 352 353 /* 354 * Fork and execute the single command. If the fork fails, we abort. 355 */ 356 cpid = vfork(); 357 if (cpid < 0) { 358 Fatal("Could not fork"); 359 } 360 if (cpid == 0) { 361 Check_Cwd(av); 362 Var_ExportVars(); 363 if (local) 364 (void)execvp(av[0], (char *const *)UNCONST(av)); 365 else 366 (void)execv(av[0], (char *const *)UNCONST(av)); 367 execError("exec", av[0]); 368 _exit(1); 369 } 370 if (mav) 371 free(mav); 372 if (bp) 373 free(bp); 374 Lst_Replace(cmdNode, NULL); 375 376 /* 377 * The child is off and running. Now all we can do is wait... 378 */ 379 while (1) { 380 381 while ((retstat = wait(&reason)) != cpid) { 382 if (retstat == -1 && errno != EINTR) { 383 break; 384 } 385 } 386 387 if (retstat > -1) { 388 if (WIFSTOPPED(reason)) { 389 status = WSTOPSIG(reason); /* stopped */ 390 } else if (WIFEXITED(reason)) { 391 status = WEXITSTATUS(reason); /* exited */ 392 if (status != 0) { 393 if (DEBUG(ERROR)) { 394 fprintf(debug_file, "\n*** Failed target: %s\n*** Failed command: ", 395 gn->name); 396 for (cp = cmd; *cp; ) { 397 if (isspace((unsigned char)*cp)) { 398 fprintf(debug_file, " "); 399 while (isspace((unsigned char)*cp)) 400 cp++; 401 } else { 402 fprintf(debug_file, "%c", *cp); 403 cp++; 404 } 405 } 406 fprintf(debug_file, "\n"); 407 } 408 fprintf(debug_file, "*** Error code %d", status); 409 } 410 } else { 411 status = WTERMSIG(reason); /* signaled */ 412 printf("*** Signal %d", status); 413 } 414 415 416 if (!WIFEXITED(reason) || (status != 0)) { 417 if (errCheck) { 418 gn->made = ERROR; 419 if (keepgoing) { 420 /* 421 * Abort the current target, but let others 422 * continue. 423 */ 424 printf(" (continuing)\n"); 425 } 426 } else { 427 /* 428 * Continue executing commands for this target. 429 * If we return 0, this will happen... 430 */ 431 printf(" (ignored)\n"); 432 status = 0; 433 } 434 } 435 break; 436 } else { 437 Fatal("error in wait: %d: %s", retstat, strerror(errno)); 438 /*NOTREACHED*/ 439 } 440 } 441 free(cmdStart); 442 443 return (status); 444 } 445 446 /*- 447 *----------------------------------------------------------------------- 448 * Compat_Make -- 449 * Make a target. 450 * 451 * Input: 452 * gnp The node to make 453 * pgnp Parent to abort if necessary 454 * 455 * Results: 456 * 0 457 * 458 * Side Effects: 459 * If an error is detected and not being ignored, the process exits. 460 * 461 *----------------------------------------------------------------------- 462 */ 463 int 464 Compat_Make(ClientData gnp, ClientData pgnp) 465 { 466 GNode *gn = (GNode *)gnp; 467 GNode *pgn = (GNode *)pgnp; 468 469 if (!meta[0]) /* we came here from jobs */ 470 Compat_Init(); 471 if (gn->made == UNMADE && (gn == pgn || (pgn->type & OP_MADE) == 0)) { 472 /* 473 * First mark ourselves to be made, then apply whatever transformations 474 * the suffix module thinks are necessary. Once that's done, we can 475 * descend and make all our children. If any of them has an error 476 * but the -k flag was given, our 'make' field will be set FALSE again. 477 * This is our signal to not attempt to do anything but abort our 478 * parent as well. 479 */ 480 gn->flags |= REMAKE; 481 gn->made = BEINGMADE; 482 if ((gn->type & OP_MADE) == 0) 483 Suff_FindDeps(gn); 484 Lst_ForEach(gn->children, Compat_Make, gn); 485 if ((gn->flags & REMAKE) == 0) { 486 gn->made = ABORTED; 487 pgn->flags &= ~REMAKE; 488 goto cohorts; 489 } 490 491 if (Lst_Member(gn->iParents, pgn) != NULL) { 492 char *p1; 493 Var_Set(IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0); 494 if (p1) 495 free(p1); 496 } 497 498 /* 499 * All the children were made ok. Now cmtime contains the modification 500 * time of the newest child, we need to find out if we exist and when 501 * we were modified last. The criteria for datedness are defined by the 502 * Make_OODate function. 503 */ 504 if (DEBUG(MAKE)) { 505 fprintf(debug_file, "Examining %s...", gn->name); 506 } 507 if (! Make_OODate(gn)) { 508 gn->made = UPTODATE; 509 if (DEBUG(MAKE)) { 510 fprintf(debug_file, "up-to-date.\n"); 511 } 512 goto cohorts; 513 } else if (DEBUG(MAKE)) { 514 fprintf(debug_file, "out-of-date.\n"); 515 } 516 517 /* 518 * If the user is just seeing if something is out-of-date, exit now 519 * to tell him/her "yes". 520 */ 521 if (queryFlag) { 522 exit(1); 523 } 524 525 /* 526 * We need to be re-made. We also have to make sure we've got a $? 527 * variable. To be nice, we also define the $> variable using 528 * Make_DoAllVar(). 529 */ 530 Make_DoAllVar(gn); 531 532 /* 533 * Alter our type to tell if errors should be ignored or things 534 * should not be printed so CompatRunCommand knows what to do. 535 */ 536 if (Targ_Ignore(gn)) { 537 gn->type |= OP_IGNORE; 538 } 539 if (Targ_Silent(gn)) { 540 gn->type |= OP_SILENT; 541 } 542 543 if (Job_CheckCommands(gn, Fatal)) { 544 /* 545 * Our commands are ok, but we still have to worry about the -t 546 * flag... 547 */ 548 if (!touchFlag || (gn->type & OP_MAKE)) { 549 curTarg = gn; 550 Lst_ForEach(gn->commands, CompatRunCommand, gn); 551 curTarg = NULL; 552 } else { 553 Job_Touch(gn, gn->type & OP_SILENT); 554 } 555 } else { 556 gn->made = ERROR; 557 } 558 559 if (gn->made != ERROR) { 560 /* 561 * If the node was made successfully, mark it so, update 562 * its modification time and timestamp all its parents. Note 563 * that for .ZEROTIME targets, the timestamping isn't done. 564 * This is to keep its state from affecting that of its parent. 565 */ 566 gn->made = MADE; 567 pgn->flags |= Make_Recheck(gn) == 0 ? FORCE : 0; 568 if (!(gn->type & OP_EXEC)) { 569 pgn->flags |= CHILDMADE; 570 Make_TimeStamp(pgn, gn); 571 } 572 } else if (keepgoing) { 573 pgn->flags &= ~REMAKE; 574 } else { 575 PrintOnError("\n\nStop."); 576 exit(1); 577 } 578 } else if (gn->made == ERROR) { 579 /* 580 * Already had an error when making this beastie. Tell the parent 581 * to abort. 582 */ 583 pgn->flags &= ~REMAKE; 584 } else { 585 if (Lst_Member(gn->iParents, pgn) != NULL) { 586 char *p1; 587 Var_Set(IMPSRC, Var_Value(TARGET, gn, &p1), pgn, 0); 588 if (p1) 589 free(p1); 590 } 591 switch(gn->made) { 592 case BEINGMADE: 593 Error("Graph cycles through %s", gn->name); 594 gn->made = ERROR; 595 pgn->flags &= ~REMAKE; 596 break; 597 case MADE: 598 if ((gn->type & OP_EXEC) == 0) { 599 pgn->flags |= CHILDMADE; 600 Make_TimeStamp(pgn, gn); 601 } 602 break; 603 case UPTODATE: 604 if ((gn->type & OP_EXEC) == 0) { 605 Make_TimeStamp(pgn, gn); 606 } 607 break; 608 default: 609 break; 610 } 611 } 612 613 cohorts: 614 Lst_ForEach(gn->cohorts, Compat_Make, pgnp); 615 return (0); 616 } 617 618 /*- 619 *----------------------------------------------------------------------- 620 * Compat_Run -- 621 * Initialize this mode and start making. 622 * 623 * Input: 624 * targs List of target nodes to re-create 625 * 626 * Results: 627 * None. 628 * 629 * Side Effects: 630 * Guess what? 631 * 632 *----------------------------------------------------------------------- 633 */ 634 void 635 Compat_Run(Lst targs) 636 { 637 GNode *gn = NULL;/* Current root target */ 638 int errors; /* Number of targets not remade due to errors */ 639 640 Compat_Init(); 641 642 if (signal(SIGINT, SIG_IGN) != SIG_IGN) { 643 signal(SIGINT, CompatInterrupt); 644 } 645 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) { 646 signal(SIGTERM, CompatInterrupt); 647 } 648 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) { 649 signal(SIGHUP, CompatInterrupt); 650 } 651 if (signal(SIGQUIT, SIG_IGN) != SIG_IGN) { 652 signal(SIGQUIT, CompatInterrupt); 653 } 654 655 ENDNode = Targ_FindNode(".END", TARG_CREATE); 656 ENDNode->type = OP_SPECIAL; 657 /* 658 * If the user has defined a .BEGIN target, execute the commands attached 659 * to it. 660 */ 661 if (!queryFlag) { 662 gn = Targ_FindNode(".BEGIN", TARG_NOCREATE); 663 if (gn != NULL) { 664 Compat_Make(gn, gn); 665 if (gn->made == ERROR) { 666 PrintOnError("\n\nStop."); 667 exit(1); 668 } 669 } 670 } 671 672 /* 673 * Expand .USE nodes right now, because they can modify the structure 674 * of the tree. 675 */ 676 Make_ExpandUse(targs); 677 678 /* 679 * For each entry in the list of targets to create, call Compat_Make on 680 * it to create the thing. Compat_Make will leave the 'made' field of gn 681 * in one of several states: 682 * UPTODATE gn was already up-to-date 683 * MADE gn was recreated successfully 684 * ERROR An error occurred while gn was being created 685 * ABORTED gn was not remade because one of its inferiors 686 * could not be made due to errors. 687 */ 688 errors = 0; 689 while (!Lst_IsEmpty (targs)) { 690 gn = (GNode *)Lst_DeQueue(targs); 691 Compat_Make(gn, gn); 692 693 if (gn->made == UPTODATE) { 694 printf("`%s' is up to date.\n", gn->name); 695 } else if (gn->made == ABORTED) { 696 printf("`%s' not remade because of errors.\n", gn->name); 697 errors += 1; 698 } 699 } 700 701 /* 702 * If the user has defined a .END target, run its commands. 703 */ 704 if (errors == 0) { 705 Compat_Make(ENDNode, ENDNode); 706 if (gn->made == ERROR) { 707 PrintOnError("\n\nStop."); 708 exit(1); 709 } 710 } 711 } 712