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