1 /* Command processing for GNU Make.
2 Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
4 2012 Free Software Foundation, Inc.
5 This file is part of GNU Make.
7 GNU Make is free software; you can redistribute it and/or modify it under the
8 terms of the GNU General Public License as published by the Free Software
9 Foundation; either version 3 of the License, or (at your option) any later
12 GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
14 A PARTICULAR PURPOSE. See the GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License along with
17 this program. If not, see <http://www.gnu.org/licenses/>. */
31 # define FILE_LIST_SEPARATOR ','
33 # define FILE_LIST_SEPARATOR ' '
36 int remote_kill (int id
, int sig
);
44 dep_hash_1 (const void *key
)
46 const struct dep
*d
= key
;
47 return_STRING_HASH_1 (dep_name (d
));
51 dep_hash_2 (const void *key
)
53 const struct dep
*d
= key
;
54 return_STRING_HASH_2 (dep_name (d
));
58 dep_hash_cmp (const void *x
, const void *y
)
60 const struct dep
*dx
= x
;
61 const struct dep
*dy
= y
;
62 return strcmp (dep_name (dx
), dep_name (dy
));
65 /* Set FILE's automatic variables up. */
68 set_file_variables (struct file
*file
)
71 const char *at
, *percent
, *star
, *less
;
74 /* If the target is an archive member `lib(member)',
75 then $@ is `lib' and $% is `member'. */
77 if (ar_name (file
->name
))
83 cp
= strchr (file
->name
, '(');
84 p
= alloca (cp
- file
->name
+ 1);
85 memcpy (p
, file
->name
, cp
- file
->name
);
86 p
[cp
- file
->name
] = '\0';
88 len
= strlen (cp
+ 1);
90 memcpy (p
, cp
+ 1, len
- 1);
95 #endif /* NO_ARCHIVES. */
101 /* $* is the stem from an implicit or static pattern rule. */
104 /* In Unix make, $* is set to the target name with
105 any suffix in the .SUFFIXES list stripped off for
106 explicit rules. We store this in the `stem' member. */
111 if (ar_name (file
->name
))
113 name
= strchr (file
->name
, '(') + 1;
114 len
= strlen (name
) - 1;
123 for (d
= enter_file (strcache_add (".SUFFIXES"))->deps
; d
; d
= d
->next
)
125 unsigned int slen
= strlen (dep_name (d
));
126 if (len
> slen
&& strneq (dep_name (d
), name
+ (len
- slen
), slen
))
128 file
->stem
= strcache_add_len (name
, len
- slen
);
137 /* $< is the first not order-only dependency. */
139 for (d
= file
->deps
; d
!= 0; d
= d
->next
)
140 if (!d
->ignore_mtime
)
142 if (!d
->need_2nd_expansion
)
147 if (file
->cmds
== default_file
->cmds
)
148 /* This file got its commands from .DEFAULT.
149 In this case $< is the same as $@. */
152 #define DEFINE_VARIABLE(name, len, value) \
153 (void) define_variable_for_file (name,len,value,o_automatic,0,file)
155 /* Define the variables. */
157 DEFINE_VARIABLE ("<", 1, less
);
158 DEFINE_VARIABLE ("*", 1, star
);
159 DEFINE_VARIABLE ("@", 1, at
);
160 DEFINE_VARIABLE ("%", 1, percent
);
162 /* Compute the values for $^, $+, $?, and $|. */
165 static char *plus_value
=0, *bar_value
=0, *qmark_value
=0;
166 static unsigned int plus_max
=0, bar_max
=0, qmark_max
=0;
168 unsigned int qmark_len
, plus_len
, bar_len
;
175 struct hash_table dep_hash
;
178 /* Compute first the value for $+, which is supposed to contain
179 duplicate dependencies as they were listed in the makefile. */
183 for (d
= file
->deps
; d
!= 0; d
= d
->next
)
185 if (!d
->need_2nd_expansion
)
188 bar_len
+= strlen (dep_name (d
)) + 1;
190 plus_len
+= strlen (dep_name (d
)) + 1;
200 if (plus_len
> plus_max
)
201 plus_value
= xrealloc (plus_value
, plus_max
= plus_len
);
205 qmark_len
= plus_len
+ 1; /* Will be this or less. */
206 for (d
= file
->deps
; d
!= 0; d
= d
->next
)
207 if (! d
->ignore_mtime
&& ! d
->need_2nd_expansion
)
209 const char *c
= dep_name (d
);
214 c
= strchr (c
, '(') + 1;
215 len
= strlen (c
) - 1;
223 *cp
++ = FILE_LIST_SEPARATOR
;
224 if (! (d
->changed
|| always_make_flag
))
225 qmark_len
-= len
+ 1; /* Don't space in $? for this one. */
228 /* Kill the last space and define the variable. */
230 cp
[cp
> plus_value
? -1 : 0] = '\0';
231 DEFINE_VARIABLE ("+", 1, plus_value
);
233 /* Compute the values for $^, $?, and $|. */
235 cp
= caret_value
= plus_value
; /* Reuse the buffer; it's big enough. */
237 if (qmark_len
> qmark_max
)
238 qmark_value
= xrealloc (qmark_value
, qmark_max
= qmark_len
);
241 if (bar_len
> bar_max
)
242 bar_value
= xrealloc (bar_value
, bar_max
= bar_len
);
245 /* Make sure that no dependencies are repeated in $^, $?, and $|. It
246 would be natural to combine the next two loops but we can't do it
247 because of a situation where we have two dep entries, the first
248 is order-only and the second is normal (see below). */
250 hash_init (&dep_hash
, 500, dep_hash_1
, dep_hash_2
, dep_hash_cmp
);
252 for (d
= file
->deps
; d
!= 0; d
= d
->next
)
254 if (d
->need_2nd_expansion
)
257 slot
= hash_find_slot (&dep_hash
, d
);
258 if (HASH_VACANT (*slot
))
259 hash_insert_at (&dep_hash
, d
, slot
);
262 /* Check if the two prerequisites have different ignore_mtime.
263 If so then we need to "upgrade" one that is order-only. */
265 struct dep
* hd
= (struct dep
*) *slot
;
267 if (d
->ignore_mtime
!= hd
->ignore_mtime
)
268 d
->ignore_mtime
= hd
->ignore_mtime
= 0;
272 for (d
= file
->deps
; d
!= 0; d
= d
->next
)
276 if (d
->need_2nd_expansion
|| hash_find_item (&dep_hash
, d
) != d
)
283 c
= strchr (c
, '(') + 1;
284 len
= strlen (c
) - 1;
294 *bp
++ = FILE_LIST_SEPARATOR
;
300 *cp
++ = FILE_LIST_SEPARATOR
;
301 if (d
->changed
|| always_make_flag
)
305 *qp
++ = FILE_LIST_SEPARATOR
;
310 hash_free (&dep_hash
, 0);
312 /* Kill the last spaces and define the variables. */
314 cp
[cp
> caret_value
? -1 : 0] = '\0';
315 DEFINE_VARIABLE ("^", 1, caret_value
);
317 qp
[qp
> qmark_value
? -1 : 0] = '\0';
318 DEFINE_VARIABLE ("?", 1, qmark_value
);
320 bp
[bp
> bar_value
? -1 : 0] = '\0';
321 DEFINE_VARIABLE ("|", 1, bar_value
);
324 #undef DEFINE_VARIABLE
327 /* Chop CMDS up into individual command lines if necessary.
328 Also set the `lines_flags' and `any_recurse' members. */
331 chop_commands (struct commands
*cmds
)
333 unsigned int nlines
, idx
;
336 /* If we don't have any commands,
337 or we already parsed them, never mind. */
339 if (!cmds
|| cmds
->command_lines
!= 0)
342 /* Chop CMDS->commands up into lines in CMDS->command_lines. */
346 int l
= strlen (cmds
->commands
);
349 lines
= xmalloc (nlines
* sizeof (char *));
350 lines
[0] = xstrdup (cmds
->commands
);
352 /* Strip the trailing newline. */
353 if (l
> 0 && lines
[0][l
-1] == '\n')
354 lines
[0][l
-1] = '\0';
361 lines
= xmalloc (nlines
* sizeof (char *));
368 end
= strchr (end
, '\n');
370 end
= p
+ strlen (p
);
371 else if (end
> p
&& end
[-1] == '\\')
375 for (b
= end
- 2; b
>= p
&& *b
== '\\'; --b
)
376 backslash
= !backslash
;
387 lines
= xrealloc (lines
, nlines
* sizeof (char *));
389 lines
[idx
++] = xstrndup (p
, end
- p
);
398 lines
= xrealloc (lines
, nlines
* sizeof (char *));
402 /* Finally, set the corresponding CMDS->lines_flags elements and the
403 CMDS->any_recurse flag. */
405 if (nlines
> USHRT_MAX
)
406 fatal (&cmds
->fileinfo
, _("Recipe has too many lines (%ud)"), nlines
);
408 cmds
->ncommand_lines
= nlines
;
409 cmds
->command_lines
= lines
;
411 cmds
->any_recurse
= 0;
412 cmds
->lines_flags
= xmalloc (nlines
);
414 for (idx
= 0; idx
< nlines
; ++idx
)
417 const char *p
= lines
[idx
];
419 while (isblank (*p
) || *p
== '-' || *p
== '@' || *p
== '+')
423 flags
|= COMMANDS_RECURSE
;
426 flags
|= COMMANDS_SILENT
;
429 flags
|= COMMANDS_NOERROR
;
433 /* If no explicit '+' was given, look for MAKE variable references. */
434 if (!(flags
& COMMANDS_RECURSE
)
435 && (strstr (p
, "$(MAKE)") != 0 || strstr (p
, "${MAKE}") != 0))
436 flags
|= COMMANDS_RECURSE
;
438 cmds
->lines_flags
[idx
] = flags
;
439 cmds
->any_recurse
|= flags
& COMMANDS_RECURSE
? 1 : 0;
443 /* Execute the commands to remake FILE. If they are currently executing,
444 return or have already finished executing, just return. Otherwise,
445 fork off a child process to run the first command line in the sequence. */
448 execute_file_commands (struct file
*file
)
452 /* Don't go through all the preparations if
453 the commands are nothing but whitespace. */
455 for (p
= file
->cmds
->commands
; *p
!= '\0'; ++p
)
456 if (!isspace ((unsigned char)*p
) && *p
!= '-' && *p
!= '@')
460 /* If there are no commands, assume everything worked. */
461 set_command_state (file
, cs_running
);
462 file
->update_status
= 0;
463 notice_finished_file (file
);
467 /* First set the automatic variables according to this file. */
469 initialize_file_variables (file
, 0);
471 set_file_variables (file
);
473 /* Start the commands running. */
477 /* This is set while we are inside fatal_error_signal,
478 so things can avoid nonreentrant operations. */
480 int handling_fatal_signal
= 0;
482 /* Handle fatal signals. */
485 fatal_error_signal (int sig
)
488 extern int dos_status
, dos_command_running
;
490 if (dos_command_running
)
492 /* That was the child who got the signal, not us. */
493 dos_status
|= (sig
<< 8);
496 remove_intermediates (1);
498 #else /* not __MSDOS__ */
500 remove_intermediates (1);
502 fputs (_("*** Break.\n"), stderr
);
505 #else /* not Amiga */
507 extern HANDLE main_thread
;
509 /* Windows creates a sperate thread for handling Ctrl+C, so we need
510 to suspend the main thread, or else we will have race conditions
511 when both threads call reap_children. */
514 DWORD susp_count
= SuspendThread (main_thread
);
517 fprintf (stderr
, "SuspendThread: suspend count = %ld\n", susp_count
);
518 else if (susp_count
== (DWORD
)-1)
520 DWORD ierr
= GetLastError ();
522 fprintf (stderr
, "SuspendThread: error %ld: %s\n",
523 ierr
, map_windows32_error_to_string (ierr
));
527 handling_fatal_signal
= 1;
529 /* Set the handling for this signal to the default.
530 It is blocked now while we run this handler. */
531 signal (sig
, SIG_DFL
);
533 /* A termination signal won't be sent to the entire
534 process group, but it means we want to kill the children. */
539 for (c
= children
; c
!= 0; c
= c
->next
)
541 (void) kill (c
->pid
, SIGTERM
);
544 /* If we got a signal that means the user
545 wanted to kill make, remove pending targets. */
547 if (sig
== SIGTERM
|| sig
== SIGINT
558 /* Remote children won't automatically get signals sent
559 to the process group, so we must send them. */
560 for (c
= children
; c
!= 0; c
= c
->next
)
562 (void) remote_kill (c
->pid
, sig
);
564 for (c
= children
; c
!= 0; c
= c
->next
)
565 delete_child_targets (c
);
567 /* Clean up the children. We don't just use the call below because
568 we don't want to print the "Waiting for children" message. */
569 while (job_slots_used
> 0)
570 reap_children (1, 0);
573 /* Wait for our children to die. */
574 while (job_slots_used
> 0)
575 reap_children (1, 1);
577 /* Delete any non-precious intermediate files that were made. */
579 remove_intermediates (1);
583 /* We don't want to send ourselves SIGQUIT, because it will
584 cause a core dump. Just exit instead. */
590 CloseHandle (main_thread
);
591 /* Cannot call W32_kill with a pid (it needs a handle). The exit
592 status of 130 emulates what happens in Bash. */
595 /* Signal the same code; this time it will really be fatal. The signal
596 will be unblocked when we return and arrive then to kill us. */
597 if (kill (getpid (), sig
) < 0)
598 pfatal_with_name ("kill");
599 #endif /* not WINDOWS32 */
600 #endif /* not Amiga */
601 #endif /* not __MSDOS__ */
604 /* Delete FILE unless it's precious or not actually a file (phony),
605 and it has changed on disk since we last stat'd it. */
608 delete_target (struct file
*file
, const char *on_behalf_of
)
613 if (file
->precious
|| file
->phony
)
617 if (ar_name (file
->name
))
619 time_t file_date
= (file
->last_mtime
== NONEXISTENT_MTIME
621 : (time_t) FILE_TIMESTAMP_S (file
->last_mtime
));
622 if (ar_member_date (file
->name
) != file_date
)
625 error (NILF
, _("*** [%s] Archive member `%s' may be bogus; not deleted"),
626 on_behalf_of
, file
->name
);
628 error (NILF
, _("*** Archive member `%s' may be bogus; not deleted"),
635 EINTRLOOP (e
, stat (file
->name
, &st
));
637 && S_ISREG (st
.st_mode
)
638 && FILE_TIMESTAMP_STAT_MODTIME (file
->name
, st
) != file
->last_mtime
)
641 error (NILF
, _("*** [%s] Deleting file `%s'"), on_behalf_of
, file
->name
);
643 error (NILF
, _("*** Deleting file `%s'"), file
->name
);
644 if (unlink (file
->name
) < 0
645 && errno
!= ENOENT
) /* It disappeared; so what. */
646 perror_with_name ("unlink: ", file
->name
);
651 /* Delete all non-precious targets of CHILD unless they were already deleted.
652 Set the flag in CHILD to say they've been deleted. */
655 delete_child_targets (struct child
*child
)
662 /* Delete the target file if it changed. */
663 delete_target (child
->file
, NULL
);
665 /* Also remove any non-precious targets listed in the `also_make' member. */
666 for (d
= child
->file
->also_make
; d
!= 0; d
= d
->next
)
667 delete_target (d
->file
, child
->file
->name
);
672 /* Print out the commands in CMDS. */
675 print_commands (const struct commands
*cmds
)
679 fputs (_("# recipe to execute"), stdout
);
681 if (cmds
->fileinfo
.filenm
== 0)
682 puts (_(" (built-in):"));
684 printf (_(" (from `%s', line %lu):\n"),
685 cmds
->fileinfo
.filenm
, cmds
->fileinfo
.lineno
);
693 /* Print one full logical recipe line: find a non-escaped newline. */
694 for (end
= s
, bs
= 0; *end
!= '\0'; ++end
)
696 if (*end
== '\n' && !bs
)
699 bs
= *end
== '\\' ? !bs
: 0;
702 printf ("%c%.*s\n", cmd_prefix
, (int) (end
- s
), s
);
704 s
= end
+ (end
[0] == '\n');