compat.c revision 1.141 1 1.141 rillig /* $NetBSD: compat.c,v 1.141 2020/09/12 14:41:00 rillig 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.141 rillig static char rcsid[] = "$NetBSD: compat.c,v 1.141 2020/09/12 14:41:00 rillig 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.141 rillig __RCSID("$NetBSD: compat.c,v 1.141 2020/09/12 14:41:00 rillig 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.97 christos #include "metachar.h"
112 1.43 bjh21 #include "pathnames.h"
113 1.1 cgd
114 1.1 cgd
115 1.72 dsl static GNode *curTarg = NULL;
116 1.1 cgd static GNode *ENDNode;
117 1.89 wiz static void CompatInterrupt(int);
118 1.107 sjg static pid_t compatChild;
119 1.107 sjg static int compatSigno;
120 1.1 cgd
121 1.106 dholland /*
122 1.106 dholland * CompatDeleteTarget -- delete a failed, interrupted, or otherwise
123 1.106 dholland * duffed target if not inhibited by .PRECIOUS.
124 1.106 dholland */
125 1.106 dholland static void
126 1.106 dholland CompatDeleteTarget(GNode *gn)
127 1.106 dholland {
128 1.106 dholland if ((gn != NULL) && !Targ_Precious (gn)) {
129 1.116 rillig char *p1;
130 1.116 rillig const char *file = Var_Value(TARGET, gn, &p1);
131 1.106 dholland
132 1.106 dholland if (!noExecute && eunlink(file) != -1) {
133 1.106 dholland Error("*** %s removed", file);
134 1.106 dholland }
135 1.106 dholland
136 1.117 rillig bmake_free(p1);
137 1.106 dholland }
138 1.106 dholland }
139 1.106 dholland
140 1.134 rillig /* Interrupt the creation of the current target and remove it if it ain't
141 1.134 rillig * precious. Then exit.
142 1.1 cgd *
143 1.134 rillig * If .INTERRUPT exists, its commands are run first WITH INTERRUPTS IGNORED.
144 1.1 cgd *
145 1.106 dholland * XXX: is .PRECIOUS supposed to inhibit .INTERRUPT? I doubt it, but I've
146 1.106 dholland * left the logic alone for now. - dholland 20160826
147 1.1 cgd */
148 1.1 cgd static void
149 1.44 wiz CompatInterrupt(int signo)
150 1.1 cgd {
151 1.1 cgd GNode *gn;
152 1.14 christos
153 1.106 dholland CompatDeleteTarget(curTarg);
154 1.106 dholland
155 1.72 dsl if ((curTarg != NULL) && !Targ_Precious (curTarg)) {
156 1.1 cgd /*
157 1.1 cgd * Run .INTERRUPT only if hit with interrupt signal
158 1.1 cgd */
159 1.1 cgd if (signo == SIGINT) {
160 1.1 cgd gn = Targ_FindNode(".INTERRUPT", TARG_NOCREATE);
161 1.72 dsl if (gn != NULL) {
162 1.57 christos Compat_Make(gn, gn);
163 1.1 cgd }
164 1.1 cgd }
165 1.1 cgd }
166 1.87 sjg if (signo == SIGQUIT)
167 1.87 sjg _exit(signo);
168 1.107 sjg /*
169 1.107 sjg * If there is a child running, pass the signal on
170 1.107 sjg * we will exist after it has exited.
171 1.107 sjg */
172 1.107 sjg compatSigno = signo;
173 1.107 sjg if (compatChild > 0) {
174 1.107 sjg KILLPG(compatChild, signo);
175 1.107 sjg } else {
176 1.107 sjg bmake_signal(signo, SIG_DFL);
177 1.107 sjg kill(myPid, signo);
178 1.107 sjg }
179 1.1 cgd }
180 1.120 rillig
181 1.1 cgd /*-
182 1.1 cgd *-----------------------------------------------------------------------
183 1.1 cgd * CompatRunCommand --
184 1.1 cgd * Execute the next command for a target. If the command returns an
185 1.1 cgd * error, the node's made field is set to ERROR and creation stops.
186 1.1 cgd *
187 1.44 wiz * Input:
188 1.44 wiz * cmdp Command to execute
189 1.44 wiz * gnp Node from which the command came
190 1.44 wiz *
191 1.1 cgd * Results:
192 1.1 cgd * 0 if the command succeeded, 1 if an error occurred.
193 1.1 cgd *
194 1.1 cgd * Side Effects:
195 1.1 cgd * The node's 'made' field may be set to ERROR.
196 1.1 cgd *
197 1.1 cgd *-----------------------------------------------------------------------
198 1.1 cgd */
199 1.54 sjg int
200 1.75 dsl CompatRunCommand(void *cmdp, void *gnp)
201 1.1 cgd {
202 1.1 cgd char *cmdStart; /* Start of expanded command */
203 1.24 christos char *cp, *bp;
204 1.1 cgd Boolean silent, /* Don't print command */
205 1.118 rillig doIt; /* Execute even if -n */
206 1.64 christos volatile Boolean errCheck; /* Check errors */
207 1.13 christos int reason; /* Reason for child's death */
208 1.1 cgd int status; /* Description of child's death */
209 1.76 dholland pid_t cpid; /* Child actually found */
210 1.76 dholland pid_t retstat; /* Result of wait */
211 1.1 cgd LstNode cmdNode; /* Node where current command is located */
212 1.64 christos const char ** volatile av; /* Argument vector for thing to exec */
213 1.64 christos char ** volatile mav;/* Copy of the argument vector for freeing */
214 1.62 apb Boolean useShell; /* TRUE if command should be executed
215 1.62 apb * using a shell */
216 1.64 christos char * volatile cmd = (char *)cmdp;
217 1.60 christos GNode *gn = (GNode *)gnp;
218 1.1 cgd
219 1.133 rillig silent = (gn->type & OP_SILENT) != 0;
220 1.1 cgd errCheck = !(gn->type & OP_IGNORE);
221 1.54 sjg doIt = FALSE;
222 1.113 rillig
223 1.136 rillig cmdNode = Lst_FindDatum(gn->commands, cmd);
224 1.115 rillig cmdStart = Var_Subst(cmd, gn, VARE_WANTRES);
225 1.1 cgd
226 1.1 cgd /*
227 1.24 christos * brk_string will return an argv with a NULL in av[0], thus causing
228 1.1 cgd * execvp to choke and die horribly. Besides, how can we execute a null
229 1.1 cgd * command? In any case, we warn the user that the command expanded to
230 1.1 cgd * nothing (is this the right thing to do?).
231 1.1 cgd */
232 1.14 christos
233 1.1 cgd if (*cmdStart == '\0') {
234 1.7 jtc free(cmdStart);
235 1.112 rillig return 0;
236 1.1 cgd }
237 1.74 dsl cmd = cmdStart;
238 1.132 rillig LstNode_Set(cmdNode, cmdStart);
239 1.1 cgd
240 1.1 cgd if ((gn->type & OP_SAVE_CMDS) && (gn != ENDNode)) {
241 1.141 rillig assert(ENDNode != NULL);
242 1.132 rillig Lst_Append(ENDNode->commands, cmdStart);
243 1.112 rillig return 0;
244 1.74 dsl }
245 1.74 dsl if (strcmp(cmdStart, "...") == 0) {
246 1.1 cgd gn->type |= OP_SAVE_CMDS;
247 1.112 rillig return 0;
248 1.1 cgd }
249 1.1 cgd
250 1.54 sjg while ((*cmd == '@') || (*cmd == '-') || (*cmd == '+')) {
251 1.54 sjg switch (*cmd) {
252 1.54 sjg case '@':
253 1.133 rillig silent = !DEBUG(LOUD);
254 1.54 sjg break;
255 1.54 sjg case '-':
256 1.1 cgd errCheck = FALSE;
257 1.54 sjg break;
258 1.54 sjg case '+':
259 1.54 sjg doIt = TRUE;
260 1.97 christos if (!shellName) /* we came here from jobs */
261 1.97 christos Shell_Init();
262 1.54 sjg break;
263 1.1 cgd }
264 1.1 cgd cmd++;
265 1.1 cgd }
266 1.1 cgd
267 1.140 rillig while (ch_isspace(*cmd))
268 1.5 cgd cmd++;
269 1.14 christos
270 1.86 sjg /*
271 1.86 sjg * If we did not end up with a command, just skip it.
272 1.86 sjg */
273 1.86 sjg if (!*cmd)
274 1.112 rillig return 0;
275 1.86 sjg
276 1.62 apb #if !defined(MAKE_NATIVE)
277 1.62 apb /*
278 1.62 apb * In a non-native build, the host environment might be weird enough
279 1.62 apb * that it's necessary to go through a shell to get the correct
280 1.62 apb * behaviour. Or perhaps the shell has been replaced with something
281 1.62 apb * that does extra logging, and that should not be bypassed.
282 1.62 apb */
283 1.62 apb useShell = TRUE;
284 1.62 apb #else
285 1.1 cgd /*
286 1.1 cgd * Search for meta characters in the command. If there are no meta
287 1.1 cgd * characters, there's no need to execute a shell to execute the
288 1.1 cgd * command.
289 1.98 mlelstv *
290 1.98 mlelstv * Additionally variable assignments and empty commands
291 1.98 mlelstv * go to the shell. Therefore treat '=' and ':' like shell
292 1.98 mlelstv * meta characters as documented in make(1).
293 1.1 cgd */
294 1.113 rillig
295 1.100 christos useShell = needshell(cmd, FALSE);
296 1.62 apb #endif
297 1.1 cgd
298 1.1 cgd /*
299 1.1 cgd * Print the command before echoing if we're not supposed to be quiet for
300 1.1 cgd * this one. We also print the command if -n given.
301 1.1 cgd */
302 1.31 sommerfe if (!silent || NoExecute(gn)) {
303 1.59 christos printf("%s\n", cmd);
304 1.1 cgd fflush(stdout);
305 1.1 cgd }
306 1.1 cgd
307 1.1 cgd /*
308 1.1 cgd * If we're not supposed to execute any commands, this is as far as
309 1.1 cgd * we go...
310 1.1 cgd */
311 1.54 sjg if (!doIt && NoExecute(gn)) {
312 1.112 rillig return 0;
313 1.1 cgd }
314 1.74 dsl if (DEBUG(JOB))
315 1.74 dsl fprintf(debug_file, "Execute: '%s'\n", cmd);
316 1.14 christos
317 1.62 apb if (useShell) {
318 1.1 cgd /*
319 1.62 apb * We need to pass the command off to the shell, typically
320 1.62 apb * because the command contains a "meta" character.
321 1.1 cgd */
322 1.92 sjg static const char *shargv[5];
323 1.92 sjg int shargc;
324 1.1 cgd
325 1.92 sjg shargc = 0;
326 1.92 sjg shargv[shargc++] = shellPath;
327 1.46 sjg /*
328 1.46 sjg * The following work for any of the builtin shell specs.
329 1.46 sjg */
330 1.93 sjg if (errCheck && shellErrFlag) {
331 1.92 sjg shargv[shargc++] = shellErrFlag;
332 1.92 sjg }
333 1.34 sjg if (DEBUG(SHELL))
334 1.92 sjg shargv[shargc++] = "-xc";
335 1.34 sjg else
336 1.92 sjg shargv[shargc++] = "-c";
337 1.92 sjg shargv[shargc++] = cmd;
338 1.138 rillig shargv[shargc] = NULL;
339 1.1 cgd av = shargv;
340 1.24 christos bp = NULL;
341 1.61 christos mav = NULL;
342 1.1 cgd } else {
343 1.1 cgd /*
344 1.1 cgd * No meta-characters, so no need to exec a shell. Break the command
345 1.1 cgd * into words to form an argument vector we can execute.
346 1.1 cgd */
347 1.139 rillig Words words = Str_Words(cmd, FALSE);
348 1.138 rillig mav = words.words;
349 1.138 rillig bp = words.freeIt;
350 1.83 christos av = (void *)mav;
351 1.1 cgd }
352 1.14 christos
353 1.81 sjg #ifdef USE_META
354 1.81 sjg if (useMeta) {
355 1.81 sjg meta_compat_start();
356 1.81 sjg }
357 1.81 sjg #endif
358 1.113 rillig
359 1.1 cgd /*
360 1.1 cgd * Fork and execute the single command. If the fork fails, we abort.
361 1.1 cgd */
362 1.107 sjg compatChild = cpid = vFork();
363 1.1 cgd if (cpid < 0) {
364 1.1 cgd Fatal("Could not fork");
365 1.1 cgd }
366 1.1 cgd if (cpid == 0) {
367 1.68 sjg Var_ExportVars();
368 1.81 sjg #ifdef USE_META
369 1.81 sjg if (useMeta) {
370 1.81 sjg meta_compat_child();
371 1.81 sjg }
372 1.81 sjg #endif
373 1.121 rillig (void)execvp(av[0], (char *const *)UNCONST(av));
374 1.41 pk execError("exec", av[0]);
375 1.23 thorpej _exit(1);
376 1.1 cgd }
377 1.103 christos
378 1.103 christos free(mav);
379 1.103 christos free(bp);
380 1.103 christos
381 1.127 rillig /* XXX: Memory management looks suspicious here. */
382 1.127 rillig /* XXX: Setting a list item to NULL is unexpected. */
383 1.132 rillig LstNode_SetNull(cmdNode);
384 1.14 christos
385 1.81 sjg #ifdef USE_META
386 1.81 sjg if (useMeta) {
387 1.110 riastrad meta_compat_parent(cpid);
388 1.81 sjg }
389 1.81 sjg #endif
390 1.81 sjg
391 1.1 cgd /*
392 1.1 cgd * The child is off and running. Now all we can do is wait...
393 1.1 cgd */
394 1.71 christos while (1) {
395 1.1 cgd
396 1.37 reinoud while ((retstat = wait(&reason)) != cpid) {
397 1.80 sjg if (retstat > 0)
398 1.80 sjg JobReapChild(retstat, reason, FALSE); /* not ours? */
399 1.37 reinoud if (retstat == -1 && errno != EINTR) {
400 1.1 cgd break;
401 1.1 cgd }
402 1.1 cgd }
403 1.14 christos
404 1.37 reinoud if (retstat > -1) {
405 1.1 cgd if (WIFSTOPPED(reason)) {
406 1.13 christos status = WSTOPSIG(reason); /* stopped */
407 1.1 cgd } else if (WIFEXITED(reason)) {
408 1.13 christos status = WEXITSTATUS(reason); /* exited */
409 1.109 maxv #if defined(USE_META) && defined(USE_FILEMON_ONCE)
410 1.109 maxv if (useMeta) {
411 1.109 maxv meta_cmd_finish(NULL);
412 1.109 maxv }
413 1.109 maxv #endif
414 1.1 cgd if (status != 0) {
415 1.52 jmmv if (DEBUG(ERROR)) {
416 1.118 rillig fprintf(debug_file, "\n*** Failed target: %s\n*** Failed command: ",
417 1.52 jmmv gn->name);
418 1.118 rillig for (cp = cmd; *cp; ) {
419 1.140 rillig if (ch_isspace(*cp)) {
420 1.63 dsl fprintf(debug_file, " ");
421 1.140 rillig while (ch_isspace(*cp))
422 1.52 jmmv cp++;
423 1.52 jmmv } else {
424 1.63 dsl fprintf(debug_file, "%c", *cp);
425 1.118 rillig cp++;
426 1.52 jmmv }
427 1.118 rillig }
428 1.63 dsl fprintf(debug_file, "\n");
429 1.51 lukem }
430 1.77 sjg printf("*** Error code %d", status);
431 1.1 cgd }
432 1.1 cgd } else {
433 1.13 christos status = WTERMSIG(reason); /* signaled */
434 1.59 christos printf("*** Signal %d", status);
435 1.14 christos }
436 1.14 christos
437 1.1 cgd
438 1.1 cgd if (!WIFEXITED(reason) || (status != 0)) {
439 1.1 cgd if (errCheck) {
440 1.81 sjg #ifdef USE_META
441 1.81 sjg if (useMeta) {
442 1.81 sjg meta_job_error(NULL, gn, 0, status);
443 1.81 sjg }
444 1.81 sjg #endif
445 1.1 cgd gn->made = ERROR;
446 1.1 cgd if (keepgoing) {
447 1.1 cgd /*
448 1.1 cgd * Abort the current target, but let others
449 1.1 cgd * continue.
450 1.1 cgd */
451 1.59 christos printf(" (continuing)\n");
452 1.106 dholland } else {
453 1.106 dholland printf("\n");
454 1.106 dholland }
455 1.106 dholland if (deleteOnError) {
456 1.106 dholland CompatDeleteTarget(gn);
457 1.1 cgd }
458 1.1 cgd } else {
459 1.1 cgd /*
460 1.1 cgd * Continue executing commands for this target.
461 1.1 cgd * If we return 0, this will happen...
462 1.1 cgd */
463 1.59 christos printf(" (ignored)\n");
464 1.1 cgd status = 0;
465 1.1 cgd }
466 1.1 cgd }
467 1.1 cgd break;
468 1.1 cgd } else {
469 1.56 christos Fatal("error in wait: %d: %s", retstat, strerror(errno));
470 1.1 cgd /*NOTREACHED*/
471 1.1 cgd }
472 1.1 cgd }
473 1.50 lukem free(cmdStart);
474 1.107 sjg compatChild = 0;
475 1.107 sjg if (compatSigno) {
476 1.107 sjg bmake_signal(compatSigno, SIG_DFL);
477 1.107 sjg kill(myPid, compatSigno);
478 1.107 sjg }
479 1.113 rillig
480 1.112 rillig return status;
481 1.1 cgd }
482 1.120 rillig
483 1.1 cgd /*-
484 1.1 cgd *-----------------------------------------------------------------------
485 1.57 christos * Compat_Make --
486 1.1 cgd * Make a target.
487 1.1 cgd *
488 1.44 wiz * Input:
489 1.44 wiz * gnp The node to make
490 1.44 wiz * pgnp Parent to abort if necessary
491 1.44 wiz *
492 1.1 cgd * Results:
493 1.1 cgd * 0
494 1.1 cgd *
495 1.1 cgd * Side Effects:
496 1.1 cgd * If an error is detected and not being ignored, the process exits.
497 1.1 cgd *
498 1.1 cgd *-----------------------------------------------------------------------
499 1.1 cgd */
500 1.57 christos int
501 1.75 dsl Compat_Make(void *gnp, void *pgnp)
502 1.1 cgd {
503 1.60 christos GNode *gn = (GNode *)gnp;
504 1.60 christos GNode *pgn = (GNode *)pgnp;
505 1.16 christos
506 1.97 christos if (!shellName) /* we came here from jobs */
507 1.97 christos Shell_Init();
508 1.40 pk if (gn->made == UNMADE && (gn == pgn || (pgn->type & OP_MADE) == 0)) {
509 1.1 cgd /*
510 1.1 cgd * First mark ourselves to be made, then apply whatever transformations
511 1.1 cgd * the suffix module thinks are necessary. Once that's done, we can
512 1.1 cgd * descend and make all our children. If any of them has an error
513 1.1 cgd * but the -k flag was given, our 'make' field will be set FALSE again.
514 1.1 cgd * This is our signal to not attempt to do anything but abort our
515 1.1 cgd * parent as well.
516 1.1 cgd */
517 1.26 christos gn->flags |= REMAKE;
518 1.1 cgd gn->made = BEINGMADE;
519 1.38 pk if ((gn->type & OP_MADE) == 0)
520 1.56 christos Suff_FindDeps(gn);
521 1.132 rillig Lst_ForEach(gn->children, Compat_Make, gn);
522 1.26 christos if ((gn->flags & REMAKE) == 0) {
523 1.1 cgd gn->made = ABORTED;
524 1.129 rillig pgn->flags &= ~(unsigned)REMAKE;
525 1.28 mycroft goto cohorts;
526 1.1 cgd }
527 1.1 cgd
528 1.137 rillig if (Lst_FindDatum(gn->implicitParents, pgn) != NULL) {
529 1.96 joerg char *p1;
530 1.111 rillig Var_Set(IMPSRC, Var_Value(TARGET, gn, &p1), pgn);
531 1.117 rillig bmake_free(p1);
532 1.96 joerg }
533 1.14 christos
534 1.1 cgd /*
535 1.82 christos * All the children were made ok. Now cmgn->mtime contains the
536 1.82 christos * modification time of the newest child, we need to find out if we
537 1.82 christos * exist and when we were modified last. The criteria for datedness
538 1.82 christos * are defined by the Make_OODate function.
539 1.1 cgd */
540 1.1 cgd if (DEBUG(MAKE)) {
541 1.63 dsl fprintf(debug_file, "Examining %s...", gn->name);
542 1.1 cgd }
543 1.1 cgd if (! Make_OODate(gn)) {
544 1.1 cgd gn->made = UPTODATE;
545 1.1 cgd if (DEBUG(MAKE)) {
546 1.63 dsl fprintf(debug_file, "up-to-date.\n");
547 1.1 cgd }
548 1.28 mycroft goto cohorts;
549 1.1 cgd } else if (DEBUG(MAKE)) {
550 1.63 dsl fprintf(debug_file, "out-of-date.\n");
551 1.1 cgd }
552 1.1 cgd
553 1.1 cgd /*
554 1.1 cgd * If the user is just seeing if something is out-of-date, exit now
555 1.1 cgd * to tell him/her "yes".
556 1.1 cgd */
557 1.1 cgd if (queryFlag) {
558 1.59 christos exit(1);
559 1.1 cgd }
560 1.1 cgd
561 1.1 cgd /*
562 1.1 cgd * We need to be re-made. We also have to make sure we've got a $?
563 1.1 cgd * variable. To be nice, we also define the $> variable using
564 1.1 cgd * Make_DoAllVar().
565 1.1 cgd */
566 1.1 cgd Make_DoAllVar(gn);
567 1.14 christos
568 1.1 cgd /*
569 1.1 cgd * Alter our type to tell if errors should be ignored or things
570 1.1 cgd * should not be printed so CompatRunCommand knows what to do.
571 1.1 cgd */
572 1.56 christos if (Targ_Ignore(gn)) {
573 1.1 cgd gn->type |= OP_IGNORE;
574 1.1 cgd }
575 1.56 christos if (Targ_Silent(gn)) {
576 1.1 cgd gn->type |= OP_SILENT;
577 1.1 cgd }
578 1.1 cgd
579 1.56 christos if (Job_CheckCommands(gn, Fatal)) {
580 1.1 cgd /*
581 1.1 cgd * Our commands are ok, but we still have to worry about the -t
582 1.1 cgd * flag...
583 1.1 cgd */
584 1.20 mycroft if (!touchFlag || (gn->type & OP_MAKE)) {
585 1.1 cgd curTarg = gn;
586 1.81 sjg #ifdef USE_META
587 1.81 sjg if (useMeta && !NoExecute(gn)) {
588 1.81 sjg meta_job_start(NULL, gn);
589 1.81 sjg }
590 1.81 sjg #endif
591 1.132 rillig Lst_ForEach(gn->commands, CompatRunCommand, gn);
592 1.72 dsl curTarg = NULL;
593 1.1 cgd } else {
594 1.133 rillig Job_Touch(gn, (gn->type & OP_SILENT) != 0);
595 1.1 cgd }
596 1.1 cgd } else {
597 1.1 cgd gn->made = ERROR;
598 1.1 cgd }
599 1.81 sjg #ifdef USE_META
600 1.81 sjg if (useMeta && !NoExecute(gn)) {
601 1.105 sjg if (meta_job_finish(NULL) != 0)
602 1.105 sjg gn->made = ERROR;
603 1.81 sjg }
604 1.81 sjg #endif
605 1.1 cgd
606 1.1 cgd if (gn->made != ERROR) {
607 1.1 cgd /*
608 1.1 cgd * If the node was made successfully, mark it so, update
609 1.1 cgd * its modification time and timestamp all its parents. Note
610 1.1 cgd * that for .ZEROTIME targets, the timestamping isn't done.
611 1.1 cgd * This is to keep its state from affecting that of its parent.
612 1.1 cgd */
613 1.1 cgd gn->made = MADE;
614 1.26 christos pgn->flags |= Make_Recheck(gn) == 0 ? FORCE : 0;
615 1.1 cgd if (!(gn->type & OP_EXEC)) {
616 1.26 christos pgn->flags |= CHILDMADE;
617 1.1 cgd Make_TimeStamp(pgn, gn);
618 1.1 cgd }
619 1.1 cgd } else if (keepgoing) {
620 1.129 rillig pgn->flags &= ~(unsigned)REMAKE;
621 1.1 cgd } else {
622 1.106 dholland PrintOnError(gn, "\nStop.");
623 1.59 christos exit(1);
624 1.1 cgd }
625 1.1 cgd } else if (gn->made == ERROR) {
626 1.1 cgd /*
627 1.1 cgd * Already had an error when making this beastie. Tell the parent
628 1.1 cgd * to abort.
629 1.1 cgd */
630 1.129 rillig pgn->flags &= ~(unsigned)REMAKE;
631 1.1 cgd } else {
632 1.137 rillig if (Lst_FindDatum(gn->implicitParents, pgn) != NULL) {
633 1.96 joerg char *p1;
634 1.135 rillig const char *target = Var_Value(TARGET, gn, &p1);
635 1.135 rillig Var_Set(IMPSRC, target != NULL ? target : "", pgn);
636 1.117 rillig bmake_free(p1);
637 1.96 joerg }
638 1.1 cgd switch(gn->made) {
639 1.1 cgd case BEINGMADE:
640 1.42 christos Error("Graph cycles through %s", gn->name);
641 1.1 cgd gn->made = ERROR;
642 1.129 rillig pgn->flags &= ~(unsigned)REMAKE;
643 1.1 cgd break;
644 1.1 cgd case MADE:
645 1.1 cgd if ((gn->type & OP_EXEC) == 0) {
646 1.26 christos pgn->flags |= CHILDMADE;
647 1.1 cgd Make_TimeStamp(pgn, gn);
648 1.1 cgd }
649 1.1 cgd break;
650 1.1 cgd case UPTODATE:
651 1.1 cgd if ((gn->type & OP_EXEC) == 0) {
652 1.1 cgd Make_TimeStamp(pgn, gn);
653 1.1 cgd }
654 1.1 cgd break;
655 1.5 cgd default:
656 1.5 cgd break;
657 1.1 cgd }
658 1.1 cgd }
659 1.1 cgd
660 1.28 mycroft cohorts:
661 1.132 rillig Lst_ForEach(gn->cohorts, Compat_Make, pgnp);
662 1.112 rillig return 0;
663 1.1 cgd }
664 1.120 rillig
665 1.134 rillig /* Initialize this module and start making.
666 1.1 cgd *
667 1.44 wiz * Input:
668 1.134 rillig * targs The target nodes to re-create
669 1.1 cgd */
670 1.1 cgd void
671 1.44 wiz Compat_Run(Lst targs)
672 1.1 cgd {
673 1.5 cgd GNode *gn = NULL;/* Current root target */
674 1.1 cgd int errors; /* Number of targets not remade due to errors */
675 1.46 sjg
676 1.97 christos if (!shellName)
677 1.97 christos Shell_Init();
678 1.1 cgd
679 1.79 sjg if (bmake_signal(SIGINT, SIG_IGN) != SIG_IGN) {
680 1.79 sjg bmake_signal(SIGINT, CompatInterrupt);
681 1.1 cgd }
682 1.79 sjg if (bmake_signal(SIGTERM, SIG_IGN) != SIG_IGN) {
683 1.79 sjg bmake_signal(SIGTERM, CompatInterrupt);
684 1.1 cgd }
685 1.79 sjg if (bmake_signal(SIGHUP, SIG_IGN) != SIG_IGN) {
686 1.79 sjg bmake_signal(SIGHUP, CompatInterrupt);
687 1.1 cgd }
688 1.79 sjg if (bmake_signal(SIGQUIT, SIG_IGN) != SIG_IGN) {
689 1.79 sjg bmake_signal(SIGQUIT, CompatInterrupt);
690 1.1 cgd }
691 1.1 cgd
692 1.1 cgd ENDNode = Targ_FindNode(".END", TARG_CREATE);
693 1.58 christos ENDNode->type = OP_SPECIAL;
694 1.1 cgd /*
695 1.1 cgd * If the user has defined a .BEGIN target, execute the commands attached
696 1.1 cgd * to it.
697 1.1 cgd */
698 1.1 cgd if (!queryFlag) {
699 1.1 cgd gn = Targ_FindNode(".BEGIN", TARG_NOCREATE);
700 1.72 dsl if (gn != NULL) {
701 1.57 christos Compat_Make(gn, gn);
702 1.118 rillig if (gn->made == ERROR) {
703 1.118 rillig PrintOnError(gn, "\nStop.");
704 1.118 rillig exit(1);
705 1.118 rillig }
706 1.1 cgd }
707 1.1 cgd }
708 1.15 christos
709 1.15 christos /*
710 1.15 christos * Expand .USE nodes right now, because they can modify the structure
711 1.15 christos * of the tree.
712 1.15 christos */
713 1.66 dsl Make_ExpandUse(targs);
714 1.1 cgd
715 1.1 cgd /*
716 1.57 christos * For each entry in the list of targets to create, call Compat_Make on
717 1.57 christos * it to create the thing. Compat_Make will leave the 'made' field of gn
718 1.1 cgd * in one of several states:
719 1.1 cgd * UPTODATE gn was already up-to-date
720 1.1 cgd * MADE gn was recreated successfully
721 1.1 cgd * ERROR An error occurred while gn was being created
722 1.1 cgd * ABORTED gn was not remade because one of its inferiors
723 1.1 cgd * could not be made due to errors.
724 1.1 cgd */
725 1.1 cgd errors = 0;
726 1.132 rillig while (!Lst_IsEmpty(targs)) {
727 1.132 rillig gn = Lst_Dequeue(targs);
728 1.57 christos Compat_Make(gn, gn);
729 1.1 cgd
730 1.1 cgd if (gn->made == UPTODATE) {
731 1.59 christos printf("`%s' is up to date.\n", gn->name);
732 1.1 cgd } else if (gn->made == ABORTED) {
733 1.59 christos printf("`%s' not remade because of errors.\n", gn->name);
734 1.1 cgd errors += 1;
735 1.1 cgd }
736 1.1 cgd }
737 1.1 cgd
738 1.1 cgd /*
739 1.1 cgd * If the user has defined a .END target, run its commands.
740 1.1 cgd */
741 1.1 cgd if (errors == 0) {
742 1.57 christos Compat_Make(ENDNode, ENDNode);
743 1.36 sjg if (gn->made == ERROR) {
744 1.106 dholland PrintOnError(gn, "\nStop.");
745 1.36 sjg exit(1);
746 1.36 sjg }
747 1.1 cgd }
748 1.1 cgd }
749