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