compat.c revision 1.238 1 1.238 rillig /* $NetBSD: compat.c,v 1.238 2022/01/22 18:59:23 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.220 rillig /*
73 1.1 cgd * compat.c --
74 1.1 cgd * The routines in this file implement the full-compatibility
75 1.1 cgd * mode of PMake. Most of the special functionality of PMake
76 1.1 cgd * is available in this mode. Things not supported:
77 1.1 cgd * - different shells.
78 1.1 cgd * - friendly variable substitution.
79 1.1 cgd *
80 1.1 cgd * Interface:
81 1.156 rillig * Compat_Run Initialize things for this module and recreate
82 1.156 rillig * thems as need creatin'
83 1.1 cgd */
84 1.1 cgd
85 1.165 rillig #include <sys/types.h>
86 1.165 rillig #include <sys/stat.h>
87 1.165 rillig #include <sys/wait.h>
88 1.165 rillig
89 1.165 rillig #include <errno.h>
90 1.165 rillig #include <signal.h>
91 1.165 rillig
92 1.165 rillig #include "make.h"
93 1.165 rillig #include "dir.h"
94 1.165 rillig #include "job.h"
95 1.165 rillig #include "metachar.h"
96 1.165 rillig #include "pathnames.h"
97 1.1 cgd
98 1.145 rillig /* "@(#)compat.c 8.2 (Berkeley) 3/19/94" */
99 1.238 rillig MAKE_RCSID("$NetBSD: compat.c,v 1.238 2022/01/22 18:59:23 rillig Exp $");
100 1.1 cgd
101 1.165 rillig static GNode *curTarg = NULL;
102 1.107 sjg static pid_t compatChild;
103 1.107 sjg static int compatSigno;
104 1.1 cgd
105 1.106 dholland /*
106 1.174 rillig * CompatDeleteTarget -- delete the file of a failed, interrupted, or
107 1.174 rillig * otherwise duffed target if not inhibited by .PRECIOUS.
108 1.106 dholland */
109 1.106 dholland static void
110 1.106 dholland CompatDeleteTarget(GNode *gn)
111 1.106 dholland {
112 1.236 rillig if (gn != NULL && !GNode_IsPrecious(gn)) {
113 1.186 rillig const char *file = GNode_VarTarget(gn);
114 1.106 dholland
115 1.234 rillig if (!opts.noExecute && unlink_file(file)) {
116 1.186 rillig Error("*** %s removed", file);
117 1.186 rillig }
118 1.106 dholland }
119 1.106 dholland }
120 1.106 dholland
121 1.218 rillig /*
122 1.218 rillig * Interrupt the creation of the current target and remove it if it ain't
123 1.134 rillig * precious. Then exit.
124 1.1 cgd *
125 1.134 rillig * If .INTERRUPT exists, its commands are run first WITH INTERRUPTS IGNORED.
126 1.1 cgd *
127 1.106 dholland * XXX: is .PRECIOUS supposed to inhibit .INTERRUPT? I doubt it, but I've
128 1.106 dholland * left the logic alone for now. - dholland 20160826
129 1.1 cgd */
130 1.1 cgd static void
131 1.44 wiz CompatInterrupt(int signo)
132 1.1 cgd {
133 1.186 rillig CompatDeleteTarget(curTarg);
134 1.186 rillig
135 1.236 rillig if (curTarg != NULL && !GNode_IsPrecious(curTarg)) {
136 1.186 rillig /*
137 1.186 rillig * Run .INTERRUPT only if hit with interrupt signal
138 1.186 rillig */
139 1.186 rillig if (signo == SIGINT) {
140 1.186 rillig GNode *gn = Targ_FindNode(".INTERRUPT");
141 1.186 rillig if (gn != NULL) {
142 1.186 rillig Compat_Make(gn, gn);
143 1.186 rillig }
144 1.186 rillig }
145 1.186 rillig }
146 1.186 rillig
147 1.186 rillig if (signo == SIGQUIT)
148 1.186 rillig _exit(signo);
149 1.106 dholland
150 1.1 cgd /*
151 1.186 rillig * If there is a child running, pass the signal on.
152 1.186 rillig * We will exist after it has exited.
153 1.1 cgd */
154 1.186 rillig compatSigno = signo;
155 1.186 rillig if (compatChild > 0) {
156 1.186 rillig KILLPG(compatChild, signo);
157 1.186 rillig } else {
158 1.186 rillig bmake_signal(signo, SIG_DFL);
159 1.186 rillig kill(myPid, signo);
160 1.1 cgd }
161 1.1 cgd }
162 1.120 rillig
163 1.184 rillig static void
164 1.227 christos DebugFailedTarget(const char *cmd, const GNode *gn)
165 1.184 rillig {
166 1.184 rillig const char *p = cmd;
167 1.184 rillig debug_printf("\n*** Failed target: %s\n*** Failed command: ",
168 1.233 rillig gn->name);
169 1.184 rillig
170 1.232 rillig /*
171 1.232 rillig * Replace runs of whitespace with a single space, to reduce the
172 1.232 rillig * amount of whitespace for multi-line command lines.
173 1.232 rillig */
174 1.184 rillig while (*p != '\0') {
175 1.184 rillig if (ch_isspace(*p)) {
176 1.184 rillig debug_printf(" ");
177 1.184 rillig cpp_skip_whitespace(&p);
178 1.184 rillig } else {
179 1.184 rillig debug_printf("%c", *p);
180 1.184 rillig p++;
181 1.184 rillig }
182 1.184 rillig }
183 1.184 rillig debug_printf("\n");
184 1.184 rillig }
185 1.184 rillig
186 1.225 rillig static bool
187 1.209 rillig UseShell(const char *cmd MAKE_ATTR_UNUSED)
188 1.209 rillig {
189 1.209 rillig #if !defined(MAKE_NATIVE)
190 1.209 rillig /*
191 1.209 rillig * In a non-native build, the host environment might be weird enough
192 1.209 rillig * that it's necessary to go through a shell to get the correct
193 1.209 rillig * behaviour. Or perhaps the shell has been replaced with something
194 1.209 rillig * that does extra logging, and that should not be bypassed.
195 1.209 rillig */
196 1.225 rillig return true;
197 1.209 rillig #else
198 1.209 rillig /*
199 1.209 rillig * Search for meta characters in the command. If there are no meta
200 1.209 rillig * characters, there's no need to execute a shell to execute the
201 1.209 rillig * command.
202 1.209 rillig *
203 1.209 rillig * Additionally variable assignments and empty commands
204 1.209 rillig * go to the shell. Therefore treat '=' and ':' like shell
205 1.209 rillig * meta characters as documented in make(1).
206 1.209 rillig */
207 1.209 rillig
208 1.209 rillig return needshell(cmd);
209 1.209 rillig #endif
210 1.209 rillig }
211 1.209 rillig
212 1.218 rillig /*
213 1.218 rillig * Execute the next command for a target. If the command returns an error,
214 1.165 rillig * the node's made field is set to ERROR and creation stops.
215 1.1 cgd *
216 1.44 wiz * Input:
217 1.44 wiz * cmdp Command to execute
218 1.216 rillig * gn Node from which the command came
219 1.216 rillig * ln List node that contains the command
220 1.44 wiz *
221 1.1 cgd * Results:
222 1.230 rillig * true if the command succeeded.
223 1.1 cgd */
224 1.230 rillig bool
225 1.216 rillig Compat_RunCommand(const char *cmdp, GNode *gn, StringListNode *ln)
226 1.1 cgd {
227 1.186 rillig char *cmdStart; /* Start of expanded command */
228 1.186 rillig char *bp;
229 1.225 rillig bool silent; /* Don't print command */
230 1.225 rillig bool doIt; /* Execute even if -n */
231 1.233 rillig volatile bool errCheck; /* Check errors */
232 1.186 rillig int reason; /* Reason for child's death */
233 1.186 rillig int status; /* Description of child's death */
234 1.186 rillig pid_t cpid; /* Child actually found */
235 1.186 rillig pid_t retstat; /* Result of wait */
236 1.186 rillig const char **volatile av; /* Argument vector for thing to exec */
237 1.186 rillig char **volatile mav; /* Copy of the argument vector for freeing */
238 1.233 rillig bool useShell; /* True if command should be executed using a
239 1.233 rillig * shell */
240 1.186 rillig const char *volatile cmd = cmdp;
241 1.186 rillig
242 1.229 rillig silent = (gn->type & OP_SILENT) != OP_NONE;
243 1.186 rillig errCheck = !(gn->type & OP_IGNORE);
244 1.225 rillig doIt = false;
245 1.186 rillig
246 1.186 rillig (void)Var_Subst(cmd, gn, VARE_WANTRES, &cmdStart);
247 1.186 rillig /* TODO: handle errors */
248 1.186 rillig
249 1.186 rillig if (cmdStart[0] == '\0') {
250 1.186 rillig free(cmdStart);
251 1.230 rillig return true;
252 1.186 rillig }
253 1.186 rillig cmd = cmdStart;
254 1.216 rillig LstNode_Set(ln, cmdStart);
255 1.186 rillig
256 1.186 rillig if (gn->type & OP_SAVE_CMDS) {
257 1.186 rillig GNode *endNode = Targ_GetEndNode();
258 1.186 rillig if (gn != endNode) {
259 1.214 rillig /*
260 1.214 rillig * Append the expanded command, to prevent the
261 1.214 rillig * local variables from being interpreted in the
262 1.223 rillig * scope of the .END node.
263 1.214 rillig *
264 1.214 rillig * A probably unintended side effect of this is that
265 1.214 rillig * the expanded command will be expanded again in the
266 1.214 rillig * .END node. Therefore, a literal '$' in these
267 1.214 rillig * commands must be written as '$$$$' instead of the
268 1.214 rillig * usual '$$'.
269 1.214 rillig */
270 1.193 rillig Lst_Append(&endNode->commands, cmdStart);
271 1.230 rillig return true;
272 1.186 rillig }
273 1.186 rillig }
274 1.186 rillig if (strcmp(cmdStart, "...") == 0) {
275 1.186 rillig gn->type |= OP_SAVE_CMDS;
276 1.230 rillig return true;
277 1.186 rillig }
278 1.186 rillig
279 1.186 rillig for (;;) {
280 1.186 rillig if (*cmd == '@')
281 1.186 rillig silent = !DEBUG(LOUD);
282 1.186 rillig else if (*cmd == '-')
283 1.225 rillig errCheck = false;
284 1.186 rillig else if (*cmd == '+') {
285 1.225 rillig doIt = true;
286 1.219 rillig if (shellName == NULL) /* we came here from jobs */
287 1.186 rillig Shell_Init();
288 1.186 rillig } else
289 1.186 rillig break;
290 1.186 rillig cmd++;
291 1.186 rillig }
292 1.1 cgd
293 1.186 rillig while (ch_isspace(*cmd))
294 1.186 rillig cmd++;
295 1.1 cgd
296 1.186 rillig /*
297 1.186 rillig * If we did not end up with a command, just skip it.
298 1.186 rillig */
299 1.186 rillig if (cmd[0] == '\0')
300 1.230 rillig return true;
301 1.86 sjg
302 1.209 rillig useShell = UseShell(cmd);
303 1.186 rillig /*
304 1.186 rillig * Print the command before echoing if we're not supposed to be quiet
305 1.186 rillig * for this one. We also print the command if -n given.
306 1.186 rillig */
307 1.186 rillig if (!silent || !GNode_ShouldExecute(gn)) {
308 1.186 rillig printf("%s\n", cmd);
309 1.186 rillig fflush(stdout);
310 1.186 rillig }
311 1.186 rillig
312 1.186 rillig /*
313 1.186 rillig * If we're not supposed to execute any commands, this is as far as
314 1.186 rillig * we go...
315 1.186 rillig */
316 1.186 rillig if (!doIt && !GNode_ShouldExecute(gn))
317 1.230 rillig return true;
318 1.186 rillig
319 1.186 rillig DEBUG1(JOB, "Execute: '%s'\n", cmd);
320 1.14 christos
321 1.186 rillig if (useShell) {
322 1.186 rillig /*
323 1.186 rillig * We need to pass the command off to the shell, typically
324 1.186 rillig * because the command contains a "meta" character.
325 1.186 rillig */
326 1.186 rillig static const char *shargv[5];
327 1.186 rillig
328 1.186 rillig /* The following work for any of the builtin shell specs. */
329 1.186 rillig int shargc = 0;
330 1.186 rillig shargv[shargc++] = shellPath;
331 1.219 rillig if (errCheck && shellErrFlag != NULL)
332 1.186 rillig shargv[shargc++] = shellErrFlag;
333 1.186 rillig shargv[shargc++] = DEBUG(SHELL) ? "-xc" : "-c";
334 1.186 rillig shargv[shargc++] = cmd;
335 1.186 rillig shargv[shargc] = NULL;
336 1.186 rillig av = shargv;
337 1.186 rillig bp = NULL;
338 1.186 rillig mav = NULL;
339 1.186 rillig } else {
340 1.186 rillig /*
341 1.186 rillig * No meta-characters, so no need to exec a shell. Break the
342 1.186 rillig * command into words to form an argument vector we can
343 1.186 rillig * execute.
344 1.186 rillig */
345 1.225 rillig Words words = Str_Words(cmd, false);
346 1.186 rillig mav = words.words;
347 1.186 rillig bp = words.freeIt;
348 1.186 rillig av = (void *)mav;
349 1.186 rillig }
350 1.113 rillig
351 1.81 sjg #ifdef USE_META
352 1.237 rillig if (useMeta)
353 1.186 rillig meta_compat_start();
354 1.81 sjg #endif
355 1.14 christos
356 1.217 rillig Var_ReexportVars();
357 1.217 rillig
358 1.221 rillig compatChild = cpid = vfork();
359 1.237 rillig if (cpid < 0)
360 1.186 rillig Fatal("Could not fork");
361 1.237 rillig
362 1.186 rillig if (cpid == 0) {
363 1.81 sjg #ifdef USE_META
364 1.237 rillig if (useMeta)
365 1.186 rillig meta_compat_child();
366 1.81 sjg #endif
367 1.186 rillig (void)execvp(av[0], (char *const *)UNCONST(av));
368 1.186 rillig execDie("exec", av[0]);
369 1.186 rillig }
370 1.81 sjg
371 1.186 rillig free(mav);
372 1.186 rillig free(bp);
373 1.186 rillig
374 1.186 rillig /* XXX: Memory management looks suspicious here. */
375 1.186 rillig /* XXX: Setting a list item to NULL is unexpected. */
376 1.216 rillig LstNode_SetNull(ln);
377 1.186 rillig
378 1.186 rillig #ifdef USE_META
379 1.237 rillig if (useMeta)
380 1.186 rillig meta_compat_parent(cpid);
381 1.186 rillig #endif
382 1.186 rillig
383 1.186 rillig /*
384 1.186 rillig * The child is off and running. Now all we can do is wait...
385 1.186 rillig */
386 1.186 rillig while ((retstat = wait(&reason)) != cpid) {
387 1.186 rillig if (retstat > 0)
388 1.225 rillig JobReapChild(retstat, reason, false); /* not ours? */
389 1.186 rillig if (retstat == -1 && errno != EINTR) {
390 1.186 rillig break;
391 1.186 rillig }
392 1.144 rillig }
393 1.186 rillig
394 1.186 rillig if (retstat < 0)
395 1.186 rillig Fatal("error in wait: %d: %s", retstat, strerror(errno));
396 1.186 rillig
397 1.186 rillig if (WIFSTOPPED(reason)) {
398 1.186 rillig status = WSTOPSIG(reason); /* stopped */
399 1.186 rillig } else if (WIFEXITED(reason)) {
400 1.186 rillig status = WEXITSTATUS(reason); /* exited */
401 1.186 rillig #if defined(USE_META) && defined(USE_FILEMON_ONCE)
402 1.237 rillig if (useMeta)
403 1.231 rillig meta_cmd_finish(NULL);
404 1.109 maxv #endif
405 1.186 rillig if (status != 0) {
406 1.186 rillig if (DEBUG(ERROR))
407 1.186 rillig DebugFailedTarget(cmd, gn);
408 1.186 rillig printf("*** Error code %d", status);
409 1.186 rillig }
410 1.186 rillig } else {
411 1.186 rillig status = WTERMSIG(reason); /* signaled */
412 1.186 rillig printf("*** Signal %d", status);
413 1.186 rillig }
414 1.14 christos
415 1.1 cgd
416 1.186 rillig if (!WIFEXITED(reason) || status != 0) {
417 1.186 rillig if (errCheck) {
418 1.81 sjg #ifdef USE_META
419 1.237 rillig if (useMeta)
420 1.225 rillig meta_job_error(NULL, gn, false, status);
421 1.81 sjg #endif
422 1.186 rillig gn->made = ERROR;
423 1.186 rillig if (opts.keepgoing) {
424 1.186 rillig /*
425 1.186 rillig * Abort the current target,
426 1.186 rillig * but let others continue.
427 1.186 rillig */
428 1.186 rillig printf(" (continuing)\n");
429 1.186 rillig } else {
430 1.186 rillig printf("\n");
431 1.186 rillig }
432 1.186 rillig if (deleteOnError)
433 1.186 rillig CompatDeleteTarget(gn);
434 1.186 rillig } else {
435 1.186 rillig /*
436 1.186 rillig * Continue executing commands for this target.
437 1.186 rillig * If we return 0, this will happen...
438 1.186 rillig */
439 1.186 rillig printf(" (ignored)\n");
440 1.186 rillig status = 0;
441 1.186 rillig }
442 1.186 rillig }
443 1.186 rillig
444 1.186 rillig free(cmdStart);
445 1.186 rillig compatChild = 0;
446 1.187 rillig if (compatSigno != 0) {
447 1.186 rillig bmake_signal(compatSigno, SIG_DFL);
448 1.186 rillig kill(myPid, compatSigno);
449 1.186 rillig }
450 1.113 rillig
451 1.230 rillig return status == 0;
452 1.1 cgd }
453 1.120 rillig
454 1.155 rillig static void
455 1.155 rillig RunCommands(GNode *gn)
456 1.142 rillig {
457 1.186 rillig StringListNode *ln;
458 1.186 rillig
459 1.193 rillig for (ln = gn->commands.first; ln != NULL; ln = ln->next) {
460 1.186 rillig const char *cmd = ln->datum;
461 1.230 rillig if (!Compat_RunCommand(cmd, gn, ln))
462 1.186 rillig break;
463 1.186 rillig }
464 1.142 rillig }
465 1.142 rillig
466 1.152 rillig static void
467 1.152 rillig MakeNodes(GNodeList *gnodes, GNode *pgn)
468 1.143 rillig {
469 1.186 rillig GNodeListNode *ln;
470 1.186 rillig
471 1.186 rillig for (ln = gnodes->first; ln != NULL; ln = ln->next) {
472 1.186 rillig GNode *cohort = ln->datum;
473 1.186 rillig Compat_Make(cohort, pgn);
474 1.186 rillig }
475 1.143 rillig }
476 1.143 rillig
477 1.225 rillig static bool
478 1.207 rillig MakeUnmade(GNode *gn, GNode *pgn)
479 1.1 cgd {
480 1.190 rillig
481 1.190 rillig assert(gn->made == UNMADE);
482 1.190 rillig
483 1.1 cgd /*
484 1.1 cgd * First mark ourselves to be made, then apply whatever transformations
485 1.1 cgd * the suffix module thinks are necessary. Once that's done, we can
486 1.1 cgd * descend and make all our children. If any of them has an error
487 1.225 rillig * but the -k flag was given, our 'make' field will be set to false
488 1.179 rillig * again. This is our signal to not attempt to do anything but abort
489 1.179 rillig * our parent as well.
490 1.1 cgd */
491 1.228 rillig gn->flags.remake = true;
492 1.1 cgd gn->made = BEINGMADE;
493 1.190 rillig
494 1.165 rillig if (!(gn->type & OP_MADE))
495 1.185 rillig Suff_FindDeps(gn);
496 1.190 rillig
497 1.194 rillig MakeNodes(&gn->children, gn);
498 1.190 rillig
499 1.228 rillig if (!gn->flags.remake) {
500 1.185 rillig gn->made = ABORTED;
501 1.228 rillig pgn->flags.remake = false;
502 1.225 rillig return false;
503 1.1 cgd }
504 1.1 cgd
505 1.196 rillig if (Lst_FindDatum(&gn->implicitParents, pgn) != NULL)
506 1.224 rillig Var_Set(pgn, IMPSRC, GNode_VarTarget(gn));
507 1.14 christos
508 1.1 cgd /*
509 1.167 rillig * All the children were made ok. Now youngestChild->mtime contains the
510 1.82 christos * modification time of the newest child, we need to find out if we
511 1.82 christos * exist and when we were modified last. The criteria for datedness
512 1.181 rillig * are defined by GNode_IsOODate.
513 1.1 cgd */
514 1.157 rillig DEBUG1(MAKE, "Examining %s...", gn->name);
515 1.181 rillig if (!GNode_IsOODate(gn)) {
516 1.185 rillig gn->made = UPTODATE;
517 1.185 rillig DEBUG0(MAKE, "up-to-date.\n");
518 1.225 rillig return false;
519 1.190 rillig }
520 1.1 cgd
521 1.1 cgd /*
522 1.1 cgd * If the user is just seeing if something is out-of-date, exit now
523 1.1 cgd * to tell him/her "yes".
524 1.1 cgd */
525 1.190 rillig DEBUG0(MAKE, "out-of-date.\n");
526 1.235 rillig if (opts.query)
527 1.185 rillig exit(1);
528 1.1 cgd
529 1.1 cgd /*
530 1.190 rillig * We need to be re-made.
531 1.190 rillig * Ensure that $? (.OODATE) and $> (.ALLSRC) are both set.
532 1.1 cgd */
533 1.226 rillig GNode_SetLocalVars(gn);
534 1.14 christos
535 1.1 cgd /*
536 1.1 cgd * Alter our type to tell if errors should be ignored or things
537 1.213 christos * should not be printed so Compat_RunCommand knows what to do.
538 1.1 cgd */
539 1.206 rillig if (opts.ignoreErrors)
540 1.185 rillig gn->type |= OP_IGNORE;
541 1.235 rillig if (opts.silent)
542 1.185 rillig gn->type |= OP_SILENT;
543 1.1 cgd
544 1.56 christos if (Job_CheckCommands(gn, Fatal)) {
545 1.185 rillig /*
546 1.185 rillig * Our commands are ok, but we still have to worry about
547 1.185 rillig * the -t flag.
548 1.185 rillig */
549 1.235 rillig if (!opts.touch || (gn->type & OP_MAKE)) {
550 1.185 rillig curTarg = gn;
551 1.81 sjg #ifdef USE_META
552 1.237 rillig if (useMeta && GNode_ShouldExecute(gn))
553 1.185 rillig meta_job_start(NULL, gn);
554 1.185 rillig #endif
555 1.185 rillig RunCommands(gn);
556 1.185 rillig curTarg = NULL;
557 1.185 rillig } else {
558 1.229 rillig Job_Touch(gn, (gn->type & OP_SILENT) != OP_NONE);
559 1.81 sjg }
560 1.1 cgd } else {
561 1.185 rillig gn->made = ERROR;
562 1.1 cgd }
563 1.81 sjg #ifdef USE_META
564 1.173 rillig if (useMeta && GNode_ShouldExecute(gn)) {
565 1.185 rillig if (meta_job_finish(NULL) != 0)
566 1.185 rillig gn->made = ERROR;
567 1.81 sjg }
568 1.81 sjg #endif
569 1.1 cgd
570 1.1 cgd if (gn->made != ERROR) {
571 1.185 rillig /*
572 1.185 rillig * If the node was made successfully, mark it so, update
573 1.185 rillig * its modification time and timestamp all its parents.
574 1.185 rillig * This is to keep its state from affecting that of its parent.
575 1.185 rillig */
576 1.185 rillig gn->made = MADE;
577 1.185 rillig if (Make_Recheck(gn) == 0)
578 1.228 rillig pgn->flags.force = true;
579 1.185 rillig if (!(gn->type & OP_EXEC)) {
580 1.228 rillig pgn->flags.childMade = true;
581 1.185 rillig GNode_UpdateYoungestChild(pgn, gn);
582 1.185 rillig }
583 1.169 rillig } else if (opts.keepgoing) {
584 1.228 rillig pgn->flags.remake = false;
585 1.1 cgd } else {
586 1.238 rillig PrintOnError(gn, "\nStop.\n");
587 1.185 rillig exit(1);
588 1.1 cgd }
589 1.225 rillig return true;
590 1.185 rillig }
591 1.185 rillig
592 1.185 rillig static void
593 1.185 rillig MakeOther(GNode *gn, GNode *pgn)
594 1.185 rillig {
595 1.185 rillig
596 1.196 rillig if (Lst_FindDatum(&gn->implicitParents, pgn) != NULL) {
597 1.185 rillig const char *target = GNode_VarTarget(gn);
598 1.224 rillig Var_Set(pgn, IMPSRC, target != NULL ? target : "");
599 1.96 joerg }
600 1.185 rillig
601 1.186 rillig switch (gn->made) {
602 1.185 rillig case BEINGMADE:
603 1.42 christos Error("Graph cycles through %s", gn->name);
604 1.1 cgd gn->made = ERROR;
605 1.228 rillig pgn->flags.remake = false;
606 1.1 cgd break;
607 1.185 rillig case MADE:
608 1.175 rillig if (!(gn->type & OP_EXEC)) {
609 1.228 rillig pgn->flags.childMade = true;
610 1.185 rillig GNode_UpdateYoungestChild(pgn, gn);
611 1.1 cgd }
612 1.1 cgd break;
613 1.185 rillig case UPTODATE:
614 1.175 rillig if (!(gn->type & OP_EXEC))
615 1.185 rillig GNode_UpdateYoungestChild(pgn, gn);
616 1.1 cgd break;
617 1.185 rillig default:
618 1.5 cgd break;
619 1.1 cgd }
620 1.185 rillig }
621 1.185 rillig
622 1.218 rillig /*
623 1.218 rillig * Make a target.
624 1.185 rillig *
625 1.185 rillig * If an error is detected and not being ignored, the process exits.
626 1.185 rillig *
627 1.185 rillig * Input:
628 1.185 rillig * gn The node to make
629 1.185 rillig * pgn Parent to abort if necessary
630 1.189 rillig *
631 1.189 rillig * Output:
632 1.189 rillig * gn->made
633 1.189 rillig * UPTODATE gn was already up-to-date.
634 1.189 rillig * MADE gn was recreated successfully.
635 1.189 rillig * ERROR An error occurred while gn was being created,
636 1.189 rillig * either due to missing commands or in -k mode.
637 1.189 rillig * ABORTED gn was not remade because one of its
638 1.189 rillig * dependencies could not be made due to errors.
639 1.185 rillig */
640 1.185 rillig void
641 1.185 rillig Compat_Make(GNode *gn, GNode *pgn)
642 1.185 rillig {
643 1.186 rillig if (shellName == NULL) /* we came here from jobs */
644 1.186 rillig Shell_Init();
645 1.185 rillig
646 1.186 rillig if (gn->made == UNMADE && (gn == pgn || !(pgn->type & OP_MADE))) {
647 1.186 rillig if (!MakeUnmade(gn, pgn))
648 1.186 rillig goto cohorts;
649 1.191 rillig
650 1.191 rillig /* XXX: Replace with GNode_IsError(gn) */
651 1.186 rillig } else if (gn->made == ERROR) {
652 1.186 rillig /*
653 1.186 rillig * Already had an error when making this.
654 1.186 rillig * Tell the parent to abort.
655 1.186 rillig */
656 1.228 rillig pgn->flags.remake = false;
657 1.186 rillig } else {
658 1.186 rillig MakeOther(gn, pgn);
659 1.186 rillig }
660 1.1 cgd
661 1.28 mycroft cohorts:
662 1.195 rillig MakeNodes(&gn->cohorts, pgn);
663 1.1 cgd }
664 1.120 rillig
665 1.210 rillig static void
666 1.210 rillig MakeBeginNode(void)
667 1.210 rillig {
668 1.210 rillig GNode *gn = Targ_FindNode(".BEGIN");
669 1.210 rillig if (gn == NULL)
670 1.210 rillig return;
671 1.210 rillig
672 1.210 rillig Compat_Make(gn, gn);
673 1.210 rillig if (GNode_IsError(gn)) {
674 1.238 rillig PrintOnError(gn, "\nStop.\n");
675 1.210 rillig exit(1);
676 1.210 rillig }
677 1.210 rillig }
678 1.210 rillig
679 1.211 rillig static void
680 1.211 rillig InitSignals(void)
681 1.211 rillig {
682 1.211 rillig if (bmake_signal(SIGINT, SIG_IGN) != SIG_IGN)
683 1.211 rillig bmake_signal(SIGINT, CompatInterrupt);
684 1.211 rillig if (bmake_signal(SIGTERM, SIG_IGN) != SIG_IGN)
685 1.211 rillig bmake_signal(SIGTERM, CompatInterrupt);
686 1.211 rillig if (bmake_signal(SIGHUP, SIG_IGN) != SIG_IGN)
687 1.211 rillig bmake_signal(SIGHUP, CompatInterrupt);
688 1.211 rillig if (bmake_signal(SIGQUIT, SIG_IGN) != SIG_IGN)
689 1.211 rillig bmake_signal(SIGQUIT, CompatInterrupt);
690 1.211 rillig }
691 1.211 rillig
692 1.218 rillig /*
693 1.218 rillig * Initialize this module and start making.
694 1.1 cgd *
695 1.44 wiz * Input:
696 1.134 rillig * targs The target nodes to re-create
697 1.1 cgd */
698 1.1 cgd void
699 1.147 rillig Compat_Run(GNodeList *targs)
700 1.1 cgd {
701 1.215 rillig GNode *errorNode = NULL;
702 1.186 rillig
703 1.219 rillig if (shellName == NULL)
704 1.186 rillig Shell_Init();
705 1.186 rillig
706 1.211 rillig InitSignals();
707 1.186 rillig
708 1.232 rillig /*
709 1.232 rillig * Create the .END node now, to keep the (debug) output of the
710 1.232 rillig * counter.mk test the same as before 2020-09-23. This
711 1.232 rillig * implementation detail probably doesn't matter though.
712 1.232 rillig */
713 1.186 rillig (void)Targ_GetEndNode();
714 1.186 rillig
715 1.235 rillig if (!opts.query)
716 1.210 rillig MakeBeginNode();
717 1.186 rillig
718 1.186 rillig /*
719 1.186 rillig * Expand .USE nodes right now, because they can modify the structure
720 1.186 rillig * of the tree.
721 1.186 rillig */
722 1.186 rillig Make_ExpandUse(targs);
723 1.46 sjg
724 1.186 rillig while (!Lst_IsEmpty(targs)) {
725 1.215 rillig GNode *gn = Lst_Dequeue(targs);
726 1.186 rillig Compat_Make(gn, gn);
727 1.1 cgd
728 1.186 rillig if (gn->made == UPTODATE) {
729 1.186 rillig printf("`%s' is up to date.\n", gn->name);
730 1.186 rillig } else if (gn->made == ABORTED) {
731 1.186 rillig printf("`%s' not remade because of errors.\n",
732 1.231 rillig gn->name);
733 1.204 rillig }
734 1.215 rillig if (GNode_IsError(gn) && errorNode == NULL)
735 1.215 rillig errorNode = gn;
736 1.1 cgd }
737 1.15 christos
738 1.204 rillig /* If the user has defined a .END target, run its commands. */
739 1.215 rillig if (errorNode == NULL) {
740 1.186 rillig GNode *endNode = Targ_GetEndNode();
741 1.186 rillig Compat_Make(endNode, endNode);
742 1.215 rillig if (GNode_IsError(endNode))
743 1.215 rillig errorNode = endNode;
744 1.202 rillig }
745 1.198 rillig
746 1.215 rillig if (errorNode != NULL) {
747 1.222 rillig if (DEBUG(GRAPH2))
748 1.222 rillig Targ_PrintGraph(2);
749 1.222 rillig else if (DEBUG(GRAPH3))
750 1.222 rillig Targ_PrintGraph(3);
751 1.238 rillig PrintOnError(errorNode, "\nStop.\n");
752 1.198 rillig exit(1);
753 1.36 sjg }
754 1.1 cgd }
755