1 /* Target file management for GNU Make.
2 Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software
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/>. */
32 /* Remember whether snap_deps has been invoked: we need this to be sure we
33 don't add new rules (via $(eval ...)) afterwards. In the future it would
34 be nice to support this, but it means we'd need to re-run snap_deps() or
35 at least its functionality... it might mean changing snap_deps() to be run
36 per-file, so we can invoke it after the eval... or remembering which files
37 in the hash have been snapped (a new boolean flag?) and having snap_deps()
38 only work on files which have not yet been snapped. */
41 /* Hash table of files the makefile knows how to make. */
44 file_hash_1 (const void *key
)
46 return_ISTRING_HASH_1 (((struct file
const *) key
)->hname
);
50 file_hash_2 (const void *key
)
52 return_ISTRING_HASH_2 (((struct file
const *) key
)->hname
);
56 file_hash_cmp (const void *x
, const void *y
)
58 return_ISTRING_COMPARE (((struct file
const *) x
)->hname
,
59 ((struct file
const *) y
)->hname
);
63 #define FILE_BUCKETS 1007
65 static struct hash_table files
;
67 /* Whether or not .SECONDARY with no prerequisites was given. */
68 static int all_secondary
= 0;
70 /* Access the hash table of all file records.
71 lookup_file given a name, return the struct file * for that name,
72 or nil if there is none.
76 lookup_file (const char *name
)
80 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
84 assert (*name
!= '\0');
86 /* This is also done in parse_file_seq, so this is redundant
87 for names read from makefiles. It is here for names passed
88 on the command line. */
90 # ifndef WANT_CASE_SENSITIVE_TARGETS
95 lname
= xstrdup (name
);
96 for (n
= name
, ln
= lname
; *n
!= '\0'; ++n
, ++ln
)
97 *ln
= isupper ((unsigned char)*n
) ? tolower ((unsigned char)*n
) : *n
;
103 while (name
[0] == '[' && name
[1] == ']' && name
[2] != '\0')
106 while (name
[0] == '.' && name
[1] == '/' && name
[2] != '\0')
110 /* Skip following slashes: ".//foo" is "foo", not "/foo". */
115 /* It was all slashes after a dot. */
118 #elif defined(_AMIGA)
124 file_key
.hname
= name
;
125 f
= hash_find_item (&files
, &file_key
);
126 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
134 /* Look up a file record for file NAME and return it.
135 Create a new record if one doesn't exist. NAME will be stored in the
136 new record so it should be constant or in the strcache etc.
140 enter_file (const char *name
)
144 struct file
**file_slot
;
145 struct file file_key
;
147 assert (*name
!= '\0');
148 assert (strcache_iscached (name
));
150 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
155 lname
= xstrdup (name
);
156 for (n
= name
, ln
= lname
; *n
!= '\0'; ++n
, ++ln
)
157 if (isupper ((unsigned char)*n
))
158 *ln
= tolower ((unsigned char)*n
);
163 name
= strcache_add (lname
);
168 file_key
.hname
= name
;
169 file_slot
= (struct file
**) hash_find_slot (&files
, &file_key
);
171 if (! HASH_VACANT (f
) && !f
->double_colon
)
174 new = xmalloc (sizeof (struct file
));
175 memset (new, '\0', sizeof (struct file
));
176 new->name
= new->hname
= name
;
177 new->update_status
= -1;
182 hash_insert_at (&files
, new, file_slot
);
186 /* There is already a double-colon entry for this file. */
187 new->double_colon
= f
;
195 /* Rehash FILE to NAME. This is not as simple as resetting
196 the `hname' member, since it must be put in a new hash bucket,
197 and possibly merged with an existing file called NAME. */
200 rehash_file (struct file
*from_file
, const char *to_hname
)
202 struct file file_key
;
203 struct file
**file_slot
;
204 struct file
*to_file
;
205 struct file
*deleted_file
;
208 /* If it's already that name, we're done. */
209 file_key
.hname
= to_hname
;
210 if (! file_hash_cmp (from_file
, &file_key
))
213 /* Find the end of the renamed list for the "from" file. */
214 file_key
.hname
= from_file
->hname
;
215 while (from_file
->renamed
!= 0)
216 from_file
= from_file
->renamed
;
217 if (file_hash_cmp (from_file
, &file_key
))
218 /* hname changed unexpectedly!! */
221 /* Remove the "from" file from the hash. */
222 deleted_file
= hash_delete (&files
, from_file
);
223 if (deleted_file
!= from_file
)
224 /* from_file isn't the one stored in files */
227 /* Find where the newly renamed file will go in the hash. */
228 file_key
.hname
= to_hname
;
229 file_slot
= (struct file
**) hash_find_slot (&files
, &file_key
);
230 to_file
= *file_slot
;
232 /* Change the hash name for this file. */
233 from_file
->hname
= to_hname
;
234 for (f
= from_file
->double_colon
; f
!= 0; f
= f
->prev
)
237 /* If the new name doesn't exist yet just set it to the renamed file. */
238 if (HASH_VACANT (to_file
))
240 hash_insert_at (&files
, from_file
, file_slot
);
244 /* TO_FILE already exists under TO_HNAME.
245 We must retain TO_FILE and merge FROM_FILE into it. */
247 if (from_file
->cmds
!= 0)
249 if (to_file
->cmds
== 0)
250 to_file
->cmds
= from_file
->cmds
;
251 else if (from_file
->cmds
!= to_file
->cmds
)
253 /* We have two sets of commands. We will go with the
254 one given in the rule explicitly mentioning this name,
255 but give a message to let the user know what's going on. */
256 if (to_file
->cmds
->fileinfo
.filenm
!= 0)
257 error (&from_file
->cmds
->fileinfo
,
258 _("Recipe was specified for file `%s' at %s:%lu,"),
259 from_file
->name
, to_file
->cmds
->fileinfo
.filenm
,
260 to_file
->cmds
->fileinfo
.lineno
);
262 error (&from_file
->cmds
->fileinfo
,
263 _("Recipe for file `%s' was found by implicit rule search,"),
265 error (&from_file
->cmds
->fileinfo
,
266 _("but `%s' is now considered the same file as `%s'."),
267 from_file
->name
, to_hname
);
268 error (&from_file
->cmds
->fileinfo
,
269 _("Recipe for `%s' will be ignored in favor of the one for `%s'."),
270 to_hname
, from_file
->name
);
274 /* Merge the dependencies of the two files. */
276 if (to_file
->deps
== 0)
277 to_file
->deps
= from_file
->deps
;
280 struct dep
*deps
= to_file
->deps
;
281 while (deps
->next
!= 0)
283 deps
->next
= from_file
->deps
;
286 merge_variable_set_lists (&to_file
->variables
, from_file
->variables
);
288 if (to_file
->double_colon
&& from_file
->is_target
&& !from_file
->double_colon
)
289 fatal (NILF
, _("can't rename single-colon `%s' to double-colon `%s'"),
290 from_file
->name
, to_hname
);
291 if (!to_file
->double_colon
&& from_file
->double_colon
)
293 if (to_file
->is_target
)
294 fatal (NILF
, _("can't rename double-colon `%s' to single-colon `%s'"),
295 from_file
->name
, to_hname
);
297 to_file
->double_colon
= from_file
->double_colon
;
300 if (from_file
->last_mtime
> to_file
->last_mtime
)
301 /* %%% Kludge so -W wins on a file that gets vpathized. */
302 to_file
->last_mtime
= from_file
->last_mtime
;
304 to_file
->mtime_before_update
= from_file
->mtime_before_update
;
306 #define MERGE(field) to_file->field |= from_file->field
308 MERGE (tried_implicit
);
314 MERGE (ignore_vpath
);
317 from_file
->renamed
= to_file
;
320 /* Rename FILE to NAME. This is not as simple as resetting
321 the `name' member, since it must be put in a new hash bucket,
322 and possibly merged with an existing file called NAME. */
325 rename_file (struct file
*from_file
, const char *to_hname
)
327 rehash_file (from_file
, to_hname
);
330 from_file
->name
= from_file
->hname
;
331 from_file
= from_file
->prev
;
335 /* Remove all nonprecious intermediate files.
336 If SIG is nonzero, this was caused by a fatal signal,
337 meaning that a different message will be printed, and
338 the message will go to stderr rather than stdout. */
341 remove_intermediates (int sig
)
343 struct file
**file_slot
;
344 struct file
**file_end
;
347 /* If there's no way we will ever remove anything anyway, punt early. */
348 if (question_flag
|| touch_flag
|| all_secondary
)
351 if (sig
&& just_print_flag
)
354 file_slot
= (struct file
**) files
.ht_vec
;
355 file_end
= file_slot
+ files
.ht_size
;
356 for ( ; file_slot
< file_end
; file_slot
++)
357 if (! HASH_VACANT (*file_slot
))
359 struct file
*f
= *file_slot
;
360 /* Is this file eligible for automatic deletion?
361 Yes, IFF: it's marked intermediate, it's not secondary, it wasn't
362 given on the command line, and it's either a -include makefile or
363 it's not precious. */
364 if (f
->intermediate
&& (f
->dontcare
|| !f
->precious
)
365 && !f
->secondary
&& !f
->cmd_target
)
368 if (f
->update_status
== -1)
369 /* If nothing would have created this file yet,
370 don't print an "rm" command for it. */
376 status
= unlink (f
->name
);
377 if (status
< 0 && errno
== ENOENT
)
383 error (NILF
, _("*** Deleting intermediate file `%s'"), f
->name
);
387 DB (DB_BASIC
, (_("Removing intermediate files...\n")));
392 fputs ("rm ", stdout
);
397 fputs (f
->name
, stdout
);
402 perror_with_name ("unlink: ", f
->name
);
415 parse_prereqs (char *p
)
417 struct dep
*new = (struct dep
*)
418 parse_file_seq (&p
, sizeof (struct dep
), '|', NULL
, 0);
422 /* Files that follow '|' are "order-only" prerequisites that satisfy the
423 dependency by existing: their modification times are irrelevant. */
428 parse_file_seq (&p
, sizeof (struct dep
), '\0', NULL
, 0);
435 for (dp
= new; dp
->next
!= NULL
; dp
= dp
->next
)
440 for (; ood
!= NULL
; ood
= ood
->next
)
441 ood
->ignore_mtime
= 1;
447 /* Set the intermediate flag. */
450 set_intermediate (const void *item
)
452 struct file
*f
= (struct file
*) item
;
456 /* Expand and parse each dependency line. */
458 expand_deps (struct file
*f
)
461 struct dep
*old
= f
->deps
;
462 const char *file_stem
= f
->stem
;
463 unsigned int last_dep_has_cmds
= f
->updating
;
469 for (d
= old
; d
!= 0; d
= d
->next
)
471 struct dep
*new, *d1
;
477 /* Create the dependency list.
478 If we're not doing 2nd expansion, then it's just the name. We will
479 still need to massage it though. */
480 if (! d
->need_2nd_expansion
)
482 p
= variable_expand ("");
483 variable_buffer_output (p
, d
->name
, strlen (d
->name
) + 1);
488 /* If it's from a static pattern rule, convert the patterns into
489 "$*" so they'll expand properly. */
490 if (d
->staticpattern
)
493 char *buffer
= variable_expand ("");
495 o
= subst_expand (buffer
, d
->name
, "%", "$*", 1, 2, 0);
497 d
->name
= strcache_add_len (variable_buffer
,
498 o
- variable_buffer
);
499 d
->staticpattern
= 0; /* Clear staticpattern so that we don't
500 re-expand %s below. */
503 /* We are going to do second expansion so initialize file variables
504 for the file. Since the stem for static pattern rules comes from
505 individual dep lines, we will temporarily set f->stem to d->stem.
509 initialize_file_variables (f
, 0);
516 set_file_variables (f
);
518 p
= variable_expand_for_file (d
->name
, f
);
524 /* Parse the prerequisites. */
525 new = parse_prereqs (p
);
527 /* If this dep list was from a static pattern rule, expand the %s. We
528 use patsubst_expand to translate the prerequisites' patterns into
529 plain prerequisite names. */
530 if (new && d
->staticpattern
)
532 const char *pattern
= "%";
533 char *buffer
= variable_expand ("");
534 struct dep
*dp
= new, *dl
= 0;
539 int nl
= strlen (dp
->name
) + 1;
540 char *nm
= alloca (nl
);
541 memcpy (nm
, dp
->name
, nl
);
542 percent
= find_percent (nm
);
547 /* We have to handle empty stems specially, because that
548 would be equivalent to $(patsubst %,dp->name,) which
549 will always be empty. */
550 if (d
->stem
[0] == '\0')
552 memmove (percent
, percent
+1, strlen (percent
));
553 o
= variable_buffer_output (buffer
, nm
, strlen (nm
) + 1);
556 o
= patsubst_expand_pat (buffer
, d
->stem
, pattern
, nm
,
557 pattern
+1, percent
+1);
559 /* If the name expanded to the empty string, ignore it. */
560 if (buffer
[0] == '\0')
564 dp
= new = new->next
;
566 dp
= dl
->next
= dp
->next
;
572 dp
->name
= strcache_add_len (buffer
, o
- buffer
);
579 /* Enter them as files. */
580 for (d1
= new; d1
!= 0; d1
= d1
->next
)
582 d1
->file
= lookup_file (d1
->name
);
584 d1
->file
= enter_file (d1
->name
);
586 d1
->staticpattern
= 0;
587 d1
->need_2nd_expansion
= 0;
590 /* Add newly parsed deps to f->deps. If this is the last dependency
591 line and this target has commands then put it in front so the
592 last dependency line (the one with commands) ends up being the
593 first. This is important because people expect $< to hold first
594 prerequisite from the rule with commands. If it is not the last
595 dependency line or the rule does not have commands then link it
596 at the end so it appears in makefile order. */
600 if (d
->next
== 0 && last_dep_has_cmds
)
603 for (d_ptr
= &new; *d_ptr
; d_ptr
= &(*d_ptr
)->next
)
612 for (d_ptr
= &f
->deps
; *d_ptr
; d_ptr
= &(*d_ptr
)->next
)
620 free_dep_chain (old
);
623 /* For each dependency of each file, make the `struct dep' point
624 at the appropriate `struct file' (which may have to be created).
626 Also mark the files depended on by .PRECIOUS, .PHONY, .SILENT,
627 and various other special targets. */
635 struct file
**file_slot_0
;
636 struct file
**file_slot
;
637 struct file
**file_end
;
639 /* Remember that we've done this. Once we start snapping deps we can no
640 longer define new targets. */
643 /* Perform second expansion and enter each dependency name as a file. */
645 /* Expand .SUFFIXES first; it's dependencies are used for $$* calculation. */
646 for (f
= lookup_file (".SUFFIXES"); f
!= 0; f
= f
->prev
)
649 /* For every target that's not .SUFFIXES, expand its dependencies.
650 We must use hash_dump (), because within this loop we might add new files
651 to the table, possibly causing an in-situ table expansion. */
652 file_slot_0
= (struct file
**) hash_dump (&files
, 0, 0);
653 file_end
= file_slot_0
+ files
.ht_fill
;
654 for (file_slot
= file_slot_0
; file_slot
< file_end
; file_slot
++)
655 for (f
= *file_slot
; f
!= 0; f
= f
->prev
)
656 if (strcmp (f
->name
, ".SUFFIXES") != 0)
660 /* Now manage all the special targets. */
662 for (f
= lookup_file (".PRECIOUS"); f
!= 0; f
= f
->prev
)
663 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
664 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
667 for (f
= lookup_file (".LOW_RESOLUTION_TIME"); f
!= 0; f
= f
->prev
)
668 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
669 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
670 f2
->low_resolution_time
= 1;
672 for (f
= lookup_file (".PHONY"); f
!= 0; f
= f
->prev
)
673 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
674 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
676 /* Mark this file as phony nonexistent target. */
679 f2
->last_mtime
= NONEXISTENT_MTIME
;
680 f2
->mtime_before_update
= NONEXISTENT_MTIME
;
683 for (f
= lookup_file (".INTERMEDIATE"); f
!= 0; f
= f
->prev
)
684 /* Mark .INTERMEDIATE deps as intermediate files. */
685 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
686 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
687 f2
->intermediate
= 1;
688 /* .INTERMEDIATE with no deps does nothing.
689 Marking all files as intermediates is useless since the goal targets
690 would be deleted after they are built. */
692 for (f
= lookup_file (".SECONDARY"); f
!= 0; f
= f
->prev
)
693 /* Mark .SECONDARY deps as both intermediate and secondary. */
695 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
696 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
697 f2
->intermediate
= f2
->secondary
= 1;
698 /* .SECONDARY with no deps listed marks *all* files that way. */
702 hash_map (&files
, set_intermediate
);
705 f
= lookup_file (".EXPORT_ALL_VARIABLES");
706 if (f
!= 0 && f
->is_target
)
707 export_all_variables
= 1;
709 f
= lookup_file (".IGNORE");
710 if (f
!= 0 && f
->is_target
)
713 ignore_errors_flag
= 1;
715 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
716 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
717 f2
->command_flags
|= COMMANDS_NOERROR
;
720 f
= lookup_file (".SILENT");
721 if (f
!= 0 && f
->is_target
)
726 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
727 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
728 f2
->command_flags
|= COMMANDS_SILENT
;
731 f
= lookup_file (".NOTPARALLEL");
732 if (f
!= 0 && f
->is_target
)
735 #ifndef NO_MINUS_C_MINUS_O
736 /* If .POSIX was defined, remove OUTPUT_OPTION to comply. */
737 /* This needs more work: what if the user sets this in the makefile?
739 define_variable (STRING_SIZE_TUPLE("OUTPUT_OPTION"), "", o_default, 1);
744 /* Set the `command_state' member of FILE and all its `also_make's. */
747 set_command_state (struct file
*file
, enum cmd_state state
)
751 file
->command_state
= state
;
753 for (d
= file
->also_make
; d
!= 0; d
= d
->next
)
754 d
->file
->command_state
= state
;
757 /* Convert an external file timestamp to internal form. */
760 file_timestamp_cons (const char *fname
, time_t s
, int ns
)
762 int offset
= ORDINARY_MTIME_MIN
+ (FILE_TIMESTAMP_HI_RES
? ns
: 0);
763 FILE_TIMESTAMP product
= (FILE_TIMESTAMP
) s
<< FILE_TIMESTAMP_LO_BITS
;
764 FILE_TIMESTAMP ts
= product
+ offset
;
766 if (! (s
<= FILE_TIMESTAMP_S (ORDINARY_MTIME_MAX
)
767 && product
<= ts
&& ts
<= ORDINARY_MTIME_MAX
))
769 char buf
[FILE_TIMESTAMP_PRINT_LEN_BOUND
+ 1];
770 ts
= s
<= OLD_MTIME
? ORDINARY_MTIME_MIN
: ORDINARY_MTIME_MAX
;
771 file_timestamp_sprintf (buf
, ts
);
772 error (NILF
, _("%s: Timestamp out of range; substituting %s"),
773 fname
? fname
: _("Current time"), buf
);
779 /* Return the current time as a file timestamp, setting *RESOLUTION to
782 file_timestamp_now (int *resolution
)
788 /* Don't bother with high-resolution clocks if file timestamps have
789 only one-second resolution. The code below should work, but it's
790 not worth the hassle of debugging it on hosts where it fails. */
791 #if FILE_TIMESTAMP_HI_RES
792 # if HAVE_CLOCK_GETTIME && defined CLOCK_REALTIME
794 struct timespec timespec
;
795 if (clock_gettime (CLOCK_REALTIME
, ×pec
) == 0)
799 ns
= timespec
.tv_nsec
;
804 # if HAVE_GETTIMEOFDAY
806 struct timeval timeval
;
807 if (gettimeofday (&timeval
, 0) == 0)
811 ns
= timeval
.tv_usec
* 1000;
819 s
= time ((time_t *) 0);
822 #if FILE_TIMESTAMP_HI_RES
826 return file_timestamp_cons (0, s
, ns
);
829 /* Place into the buffer P a printable representation of the file
832 file_timestamp_sprintf (char *p
, FILE_TIMESTAMP ts
)
834 time_t t
= FILE_TIMESTAMP_S (ts
);
835 struct tm
*tm
= localtime (&t
);
838 sprintf (p
, "%04d-%02d-%02d %02d:%02d:%02d",
839 tm
->tm_year
+ 1900, tm
->tm_mon
+ 1, tm
->tm_mday
,
840 tm
->tm_hour
, tm
->tm_min
, tm
->tm_sec
);
842 sprintf (p
, "%ld", (long) t
);
844 sprintf (p
, "%lu", (unsigned long) t
);
847 /* Append nanoseconds as a fraction, but remove trailing zeros. We don't
848 know the actual timestamp resolution, since clock_getres applies only to
849 local times, whereas this timestamp might come from a remote filesystem.
850 So removing trailing zeros is the best guess that we can do. */
851 sprintf (p
, ".%09d", FILE_TIMESTAMP_NS (ts
));
860 /* Print the data base of files. */
863 print_file (const void *item
)
865 const struct file
*f
= item
;
871 puts (_("# Not a target:"));
872 printf ("%s:%s", f
->name
, f
->double_colon
? ":" : "");
874 /* Print all normal dependencies; note any order-only deps. */
875 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
876 if (! d
->ignore_mtime
)
877 printf (" %s", dep_name (d
));
881 /* Print order-only deps, if we have any. */
884 printf (" | %s", dep_name (ood
));
885 for (d
= ood
->next
; d
!= 0; d
= d
->next
)
887 printf (" %s", dep_name (d
));
893 puts (_("# Precious file (prerequisite of .PRECIOUS)."));
895 puts (_("# Phony target (prerequisite of .PHONY)."));
897 puts (_("# Command line target."));
899 puts (_("# A default, MAKEFILES, or -include/sinclude makefile."));
900 puts (f
->tried_implicit
901 ? _("# Implicit rule search has been done.")
902 : _("# Implicit rule search has not been done."));
904 printf (_("# Implicit/static pattern stem: `%s'\n"), f
->stem
);
906 puts (_("# File is an intermediate prerequisite."));
907 if (f
->also_make
!= 0)
909 fputs (_("# Also makes:"), stdout
);
910 for (d
= f
->also_make
; d
!= 0; d
= d
->next
)
911 printf (" %s", dep_name (d
));
914 if (f
->last_mtime
== UNKNOWN_MTIME
)
915 puts (_("# Modification time never checked."));
916 else if (f
->last_mtime
== NONEXISTENT_MTIME
)
917 puts (_("# File does not exist."));
918 else if (f
->last_mtime
== OLD_MTIME
)
919 puts (_("# File is very old."));
922 char buf
[FILE_TIMESTAMP_PRINT_LEN_BOUND
+ 1];
923 file_timestamp_sprintf (buf
, f
->last_mtime
);
924 printf (_("# Last modified %s\n"), buf
);
927 ? _("# File has been updated.") : _("# File has not been updated."));
928 switch (f
->command_state
)
931 puts (_("# Recipe currently running (THIS IS A BUG)."));
933 case cs_deps_running
:
934 puts (_("# Dependencies recipe running (THIS IS A BUG)."));
938 switch (f
->update_status
)
943 puts (_("# Successfully updated."));
946 assert (question_flag
);
947 puts (_("# Needs to be updated (-q is set)."));
950 puts (_("# Failed to be updated."));
953 puts (_("# Invalid value in `update_status' member!"));
960 puts (_("# Invalid value in `command_state' member!"));
966 if (f
->variables
!= 0)
967 print_file_variables (f
);
970 print_commands (f
->cmds
);
973 print_file ((const void *) f
->prev
);
977 print_file_data_base (void)
979 puts (_("\n# Files"));
981 hash_map (&files
, print_file
);
983 fputs (_("\n# files hash-table stats:\n# "), stdout
);
984 hash_print_stats (&files
, stdout
);
987 /* Verify the integrity of the data base of files. */
989 #define VERIFY_CACHED(_p,_n) \
991 if (_p->_n && _p->_n[0] && !strcache_iscached (_p->_n)) \
992 printf ("%s: Field %s not cached: %s\n", _p->name, # _n, _p->_n); \
996 verify_file (const void *item
)
998 const struct file
*f
= item
;
1001 VERIFY_CACHED (f
, name
);
1002 VERIFY_CACHED (f
, hname
);
1003 VERIFY_CACHED (f
, vpath
);
1004 VERIFY_CACHED (f
, stem
);
1006 /* Check the deps. */
1007 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
1009 VERIFY_CACHED (d
, name
);
1010 VERIFY_CACHED (d
, stem
);
1015 verify_file_data_base (void)
1017 hash_map (&files
, verify_file
);
1020 #define EXPANSION_INCREMENT(_l) ((((_l) / 500) + 1) * 500)
1023 build_target_list (char *value
)
1025 static unsigned long last_targ_count
= 0;
1027 if (files
.ht_fill
!= last_targ_count
)
1029 unsigned long max
= EXPANSION_INCREMENT (strlen (value
));
1032 struct file
**fp
= (struct file
**) files
.ht_vec
;
1033 struct file
**end
= &fp
[files
.ht_size
];
1035 /* Make sure we have at least MAX bytes in the allocated buffer. */
1036 value
= xrealloc (value
, max
);
1040 for (; fp
< end
; ++fp
)
1041 if (!HASH_VACANT (*fp
) && (*fp
)->is_target
)
1043 struct file
*f
= *fp
;
1044 int l
= strlen (f
->name
);
1049 unsigned long off
= p
- value
;
1051 max
+= EXPANSION_INCREMENT (l
+ 1);
1052 value
= xrealloc (value
, max
);
1056 memcpy (p
, f
->name
, l
);
1062 last_targ_count
= files
.ht_fill
;
1069 init_hash_files (void)
1071 hash_init (&files
, 1000, file_hash_1
, file_hash_2
, file_hash_cmp
);