1 /* Target file hash table management for GNU Make.
2 Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 2002 Free Software Foundation, Inc.
4 This file is part of GNU Make.
6 GNU Make is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU Make is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU Make; see the file COPYING. If not, write to
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
34 /* Hash table of files the makefile knows how to make. */
37 file_hash_1 (const void *key
)
39 return_ISTRING_HASH_1 (((struct file
const *) key
)->hname
);
43 file_hash_2 (const void *key
)
45 return_ISTRING_HASH_2 (((struct file
const *) key
)->hname
);
49 file_hash_cmp (const void *x
, const void *y
)
51 return_ISTRING_COMPARE (((struct file
const *) x
)->hname
,
52 ((struct file
const *) y
)->hname
);
56 #define FILE_BUCKETS 1007
58 static struct hash_table files
;
60 /* Whether or not .SECONDARY with no prerequisites was given. */
61 static int all_secondary
= 0;
63 /* Access the hash table of all file records.
64 lookup_file given a name, return the struct file * for that name,
65 or nil if there is none.
66 enter_file similar, but create one if there is none. */
69 lookup_file (char *name
)
71 register struct file
*f
;
73 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
74 register char *lname
, *ln
;
77 assert (*name
!= '\0');
79 /* This is also done in parse_file_seq, so this is redundant
80 for names read from makefiles. It is here for names passed
81 on the command line. */
83 # ifndef WANT_CASE_SENSITIVE_TARGETS
86 lname
= (char *) malloc (strlen (name
) + 1);
87 for (n
= name
, ln
= lname
; *n
!= '\0'; ++n
, ++ln
)
88 *ln
= isupper ((unsigned char)*n
) ? tolower ((unsigned char)*n
) : *n
;
94 while (name
[0] == '[' && name
[1] == ']' && name
[2] != '\0')
97 while (name
[0] == '.' && name
[1] == '/' && name
[2] != '\0')
101 /* Skip following slashes: ".//foo" is "foo", not "/foo". */
106 /* It was all slashes after a dot. */
117 file_key
.hname
= name
;
118 f
= (struct file
*) hash_find_item (&files
, &file_key
);
119 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
126 enter_file (char *name
)
128 register struct file
*f
;
129 register struct file
*new;
130 register struct file
**file_slot
;
131 struct file file_key
;
132 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
136 assert (*name
!= '\0');
138 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
141 lname
= (char *) malloc (strlen (name
) + 1);
142 for (n
= name
, ln
= lname
; *n
!= '\0'; ++n
, ++ln
)
144 if (isupper ((unsigned char)*n
))
145 *ln
= tolower ((unsigned char)*n
);
151 /* Creates a possible leak, old value of name is unreachable, but I
152 currently don't know how to fix it. */
157 file_key
.hname
= name
;
158 file_slot
= (struct file
**) hash_find_slot (&files
, &file_key
);
160 if (! HASH_VACANT (f
) && !f
->double_colon
)
162 #if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
168 new = (struct file
*) xmalloc (sizeof (struct file
));
169 bzero ((char *) new, sizeof (struct file
));
170 new->name
= new->hname
= name
;
171 new->update_status
= -1;
174 hash_insert_at (&files
, new, file_slot
);
177 /* There is already a double-colon entry for this file. */
178 new->double_colon
= f
;
187 /* Rename FILE to NAME. This is not as simple as resetting
188 the `name' member, since it must be put in a new hash bucket,
189 and possibly merged with an existing file called NAME. */
192 rename_file (struct file
*from_file
, char *to_hname
)
194 rehash_file (from_file
, to_hname
);
197 from_file
->name
= from_file
->hname
;
198 from_file
= from_file
->prev
;
202 /* Rehash FILE to NAME. This is not as simple as resetting
203 the `hname' member, since it must be put in a new hash bucket,
204 and possibly merged with an existing file called NAME. */
207 rehash_file (struct file
*from_file
, char *to_hname
)
209 struct file file_key
;
210 struct file
**file_slot
;
211 struct file
*to_file
;
212 struct file
*deleted_file
;
215 file_key
.hname
= to_hname
;
216 if (0 == file_hash_cmp (from_file
, &file_key
))
219 file_key
.hname
= from_file
->hname
;
220 while (from_file
->renamed
!= 0)
221 from_file
= from_file
->renamed
;
222 if (file_hash_cmp (from_file
, &file_key
))
223 /* hname changed unexpectedly */
226 deleted_file
= hash_delete (&files
, from_file
);
227 if (deleted_file
!= from_file
)
228 /* from_file isn't the one stored in files */
231 file_key
.hname
= to_hname
;
232 file_slot
= (struct file
**) hash_find_slot (&files
, &file_key
);
233 to_file
= *file_slot
;
235 from_file
->hname
= to_hname
;
236 for (f
= from_file
->double_colon
; f
!= 0; f
= f
->prev
)
239 if (HASH_VACANT (to_file
))
240 hash_insert_at (&files
, from_file
, file_slot
);
243 /* TO_FILE already exists under TO_HNAME.
244 We must retain TO_FILE and merge FROM_FILE into it. */
246 if (from_file
->cmds
!= 0)
248 if (to_file
->cmds
== 0)
249 to_file
->cmds
= from_file
->cmds
;
250 else if (from_file
->cmds
!= to_file
->cmds
)
252 /* We have two sets of commands. We will go with the
253 one given in the rule explicitly mentioning this name,
254 but give a message to let the user know what's going on. */
255 if (to_file
->cmds
->fileinfo
.filenm
!= 0)
256 error (&from_file
->cmds
->fileinfo
,
257 _("Commands were specified for file `%s' at %s:%lu,"),
258 from_file
->name
, to_file
->cmds
->fileinfo
.filenm
,
259 to_file
->cmds
->fileinfo
.lineno
);
261 error (&from_file
->cmds
->fileinfo
,
262 _("Commands for file `%s' were found by implicit rule search,"),
264 error (&from_file
->cmds
->fileinfo
,
265 _("but `%s' is now considered the same file as `%s'."),
266 from_file
->name
, to_hname
);
267 error (&from_file
->cmds
->fileinfo
,
268 _("Commands for `%s' will be ignored in favor of those for `%s'."),
269 to_hname
, from_file
->name
);
273 /* Merge the dependencies of the two files. */
275 if (to_file
->deps
== 0)
276 to_file
->deps
= from_file
->deps
;
279 register struct dep
*deps
= to_file
->deps
;
280 while (deps
->next
!= 0)
282 deps
->next
= from_file
->deps
;
285 merge_variable_set_lists (&to_file
->variables
, from_file
->variables
);
287 if (to_file
->double_colon
&& from_file
->is_target
&& !from_file
->double_colon
)
288 fatal (NILF
, _("can't rename single-colon `%s' to double-colon `%s'"),
289 from_file
->name
, to_hname
);
290 if (!to_file
->double_colon
&& from_file
->double_colon
)
292 if (to_file
->is_target
)
293 fatal (NILF
, _("can't rename double-colon `%s' to single-colon `%s'"),
294 from_file
->name
, to_hname
);
296 to_file
->double_colon
= from_file
->double_colon
;
299 if (from_file
->last_mtime
> to_file
->last_mtime
)
300 /* %%% Kludge so -W wins on a file that gets vpathized. */
301 to_file
->last_mtime
= from_file
->last_mtime
;
303 to_file
->mtime_before_update
= from_file
->mtime_before_update
;
305 #define MERGE(field) to_file->field |= from_file->field
307 MERGE (tried_implicit
);
313 MERGE (ignore_vpath
);
316 from_file
->renamed
= to_file
;
320 /* Remove all nonprecious intermediate files.
321 If SIG is nonzero, this was caused by a fatal signal,
322 meaning that a different message will be printed, and
323 the message will go to stderr rather than stdout. */
326 remove_intermediates (int sig
)
328 register struct file
**file_slot
;
329 register struct file
**file_end
;
332 /* If there's no way we will ever remove anything anyway, punt early. */
333 if (question_flag
|| touch_flag
|| all_secondary
)
336 if (sig
&& just_print_flag
)
339 file_slot
= (struct file
**) files
.ht_vec
;
340 file_end
= file_slot
+ files
.ht_size
;
341 for ( ; file_slot
< file_end
; file_slot
++)
342 if (! HASH_VACANT (*file_slot
))
344 register struct file
*f
= *file_slot
;
345 if (f
->intermediate
&& (f
->dontcare
|| !f
->precious
)
346 && !f
->secondary
&& !f
->cmd_target
)
349 if (f
->update_status
== -1)
350 /* If nothing would have created this file yet,
351 don't print an "rm" command for it. */
357 status
= unlink (f
->name
);
358 if (status
< 0 && errno
== ENOENT
)
364 error (NILF
, _("*** Deleting intermediate file `%s'"), f
->name
);
368 DB (DB_BASIC
, (_("Removing intermediate files...\n")));
373 fputs ("rm ", stdout
);
378 fputs (f
->name
, stdout
);
383 perror_with_name ("unlink: ", f
->name
);
395 /* Set the intermediate flag. */
398 set_intermediate (const void *item
)
400 struct file
*f
= (struct file
*) item
;
404 /* For each dependency of each file, make the `struct dep' point
405 at the appropriate `struct file' (which may have to be created).
407 Also mark the files depended on by .PRECIOUS, .PHONY, .SILENT,
408 and various other special targets. */
413 register struct file
*f
;
414 register struct file
*f2
;
415 register struct dep
*d
;
416 register struct file
**file_slot_0
;
417 register struct file
**file_slot
;
418 register struct file
**file_end
;
420 /* Enter each dependency name as a file. */
421 /* We must use hash_dump (), because within this loop
422 we might add new files to the table, possibly causing
423 an in-situ table expansion. */
424 file_slot_0
= (struct file
**) hash_dump (&files
, 0, 0);
425 file_end
= file_slot_0
+ files
.ht_fill
;
426 for (file_slot
= file_slot_0
; file_slot
< file_end
; file_slot
++)
427 for (f2
= *file_slot
; f2
!= 0; f2
= f2
->prev
)
428 for (d
= f2
->deps
; d
!= 0; d
= d
->next
)
431 d
->file
= lookup_file (d
->name
);
433 d
->file
= enter_file (d
->name
);
440 for (f
= lookup_file (".PRECIOUS"); f
!= 0; f
= f
->prev
)
441 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
442 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
445 for (f
= lookup_file (".LOW_RESOLUTION_TIME"); f
!= 0; f
= f
->prev
)
446 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
447 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
448 f2
->low_resolution_time
= 1;
450 for (f
= lookup_file (".PHONY"); f
!= 0; f
= f
->prev
)
451 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
452 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
454 /* Mark this file as phony and nonexistent. */
456 f2
->last_mtime
= NONEXISTENT_MTIME
;
457 f2
->mtime_before_update
= NONEXISTENT_MTIME
;
460 for (f
= lookup_file (".INTERMEDIATE"); f
!= 0; f
= f
->prev
)
462 /* .INTERMEDIATE with deps listed
463 marks those deps as intermediate files. */
464 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
465 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
466 f2
->intermediate
= 1;
467 /* .INTERMEDIATE with no deps does nothing.
468 Marking all files as intermediates is useless
469 since the goal targets would be deleted after they are built. */
472 for (f
= lookup_file (".SECONDARY"); f
!= 0; f
= f
->prev
)
474 /* .SECONDARY with deps listed
475 marks those deps as intermediate files
476 in that they don't get rebuilt if not actually needed;
477 but unlike real intermediate files,
478 these are not deleted after make finishes. */
480 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
481 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
482 f2
->intermediate
= f2
->secondary
= 1;
483 /* .SECONDARY with no deps listed marks *all* files that way. */
487 hash_map (&files
, set_intermediate
);
491 f
= lookup_file (".EXPORT_ALL_VARIABLES");
492 if (f
!= 0 && f
->is_target
)
493 export_all_variables
= 1;
495 f
= lookup_file (".IGNORE");
496 if (f
!= 0 && f
->is_target
)
499 ignore_errors_flag
= 1;
501 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
502 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
503 f2
->command_flags
|= COMMANDS_NOERROR
;
506 f
= lookup_file (".SILENT");
507 if (f
!= 0 && f
->is_target
)
512 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
513 for (f2
= d
->file
; f2
!= 0; f2
= f2
->prev
)
514 f2
->command_flags
|= COMMANDS_SILENT
;
517 f
= lookup_file (".POSIX");
518 if (f
!= 0 && f
->is_target
)
521 f
= lookup_file (".NOTPARALLEL");
522 if (f
!= 0 && f
->is_target
)
526 /* Set the `command_state' member of FILE and all its `also_make's. */
529 set_command_state (struct file
*file
, int state
)
533 file
->command_state
= state
;
535 for (d
= file
->also_make
; d
!= 0; d
= d
->next
)
536 d
->file
->command_state
= state
;
539 /* Convert an external file timestamp to internal form. */
542 file_timestamp_cons (const char *fname
, time_t s
, int ns
)
544 int offset
= ORDINARY_MTIME_MIN
+ (FILE_TIMESTAMP_HI_RES
? ns
: 0);
545 FILE_TIMESTAMP product
= (FILE_TIMESTAMP
) s
<< FILE_TIMESTAMP_LO_BITS
;
546 FILE_TIMESTAMP ts
= product
+ offset
;
548 if (! (s
<= FILE_TIMESTAMP_S (ORDINARY_MTIME_MAX
)
549 && product
<= ts
&& ts
<= ORDINARY_MTIME_MAX
))
551 char buf
[FILE_TIMESTAMP_PRINT_LEN_BOUND
+ 1];
552 ts
= s
<= OLD_MTIME
? ORDINARY_MTIME_MIN
: ORDINARY_MTIME_MAX
;
553 file_timestamp_sprintf (buf
, ts
);
554 error (NILF
, _("%s: Timestamp out of range; substituting %s"),
555 fname
? fname
: _("Current time"), buf
);
561 /* Return the current time as a file timestamp, setting *RESOLUTION to
564 file_timestamp_now (int *resolution
)
570 /* Don't bother with high-resolution clocks if file timestamps have
571 only one-second resolution. The code below should work, but it's
572 not worth the hassle of debugging it on hosts where it fails. */
573 #if FILE_TIMESTAMP_HI_RES
574 # if HAVE_CLOCK_GETTIME && defined CLOCK_REALTIME
576 struct timespec timespec
;
577 if (clock_gettime (CLOCK_REALTIME
, ×pec
) == 0)
581 ns
= timespec
.tv_nsec
;
586 # if HAVE_GETTIMEOFDAY
588 struct timeval timeval
;
589 if (gettimeofday (&timeval
, 0) == 0)
593 ns
= timeval
.tv_usec
* 1000;
601 s
= time ((time_t *) 0);
604 #if FILE_TIMESTAMP_HI_RES
608 return file_timestamp_cons (0, s
, ns
);
611 /* Place into the buffer P a printable representation of the file
614 file_timestamp_sprintf (char *p
, FILE_TIMESTAMP ts
)
616 time_t t
= FILE_TIMESTAMP_S (ts
);
617 struct tm
*tm
= localtime (&t
);
620 sprintf (p
, "%04d-%02d-%02d %02d:%02d:%02d",
621 tm
->tm_year
+ 1900, tm
->tm_mon
+ 1, tm
->tm_mday
,
622 tm
->tm_hour
, tm
->tm_min
, tm
->tm_sec
);
624 sprintf (p
, "%ld", (long) t
);
626 sprintf (p
, "%lu", (unsigned long) t
);
629 /* Append nanoseconds as a fraction, but remove trailing zeros.
630 We don't know the actual timestamp resolution, since clock_getres
631 applies only to local times, whereas this timestamp might come
632 from a remote filesystem. So removing trailing zeros is the
633 best guess that we can do. */
634 sprintf (p
, ".%09d", FILE_TIMESTAMP_NS (ts
));
643 /* Print the data base of files. */
646 print_file (const void *item
)
648 struct file
*f
= (struct file
*) item
;
654 puts (_("# Not a target:"));
655 printf ("%s:%s", f
->name
, f
->double_colon
? ":" : "");
657 /* Print all normal dependencies; note any order-only deps. */
658 for (d
= f
->deps
; d
!= 0; d
= d
->next
)
659 if (! d
->ignore_mtime
)
660 printf (" %s", dep_name (d
));
664 /* Print order-only deps, if we have any. */
667 printf (" | %s", dep_name (ood
));
668 for (d
= ood
->next
; d
!= 0; d
= d
->next
)
670 printf (" %s", dep_name (d
));
676 puts (_("# Precious file (prerequisite of .PRECIOUS)."));
678 puts (_("# Phony target (prerequisite of .PHONY)."));
680 puts (_("# Command-line target."));
682 puts (_("# A default or MAKEFILES makefile."));
683 puts (f
->tried_implicit
684 ? _("# Implicit rule search has been done.")
685 : _("# Implicit rule search has not been done."));
687 printf (_("# Implicit/static pattern stem: `%s'\n"), f
->stem
);
689 puts (_("# File is an intermediate prerequisite."));
690 if (f
->also_make
!= 0)
692 fputs (_("# Also makes:"), stdout
);
693 for (d
= f
->also_make
; d
!= 0; d
= d
->next
)
694 printf (" %s", dep_name (d
));
697 if (f
->last_mtime
== UNKNOWN_MTIME
)
698 puts (_("# Modification time never checked."));
699 else if (f
->last_mtime
== NONEXISTENT_MTIME
)
700 puts (_("# File does not exist."));
701 else if (f
->last_mtime
== OLD_MTIME
)
702 puts (_("# File is very old."));
705 char buf
[FILE_TIMESTAMP_PRINT_LEN_BOUND
+ 1];
706 file_timestamp_sprintf (buf
, f
->last_mtime
);
707 printf (_("# Last modified %s\n"), buf
);
710 ? _("# File has been updated.") : _("# File has not been updated."));
711 switch (f
->command_state
)
714 puts (_("# Commands currently running (THIS IS A BUG)."));
716 case cs_deps_running
:
717 puts (_("# Dependencies commands running (THIS IS A BUG)."));
721 switch (f
->update_status
)
726 puts (_("# Successfully updated."));
729 assert (question_flag
);
730 puts (_("# Needs to be updated (-q is set)."));
733 puts (_("# Failed to be updated."));
736 puts (_("# Invalid value in `update_status' member!"));
743 puts (_("# Invalid value in `command_state' member!"));
749 if (f
->variables
!= 0)
750 print_file_variables (f
);
753 print_commands (f
->cmds
);
756 print_file ((const void *) f
->prev
);
760 print_file_data_base (void)
762 puts (_("\n# Files"));
764 hash_map (&files
, print_file
);
766 fputs (_("\n# files hash-table stats:\n# "), stdout
);
767 hash_print_stats (&files
, stdout
);
770 #define EXPANSION_INCREMENT(_l) ((((_l) / 500) + 1) * 500)
773 build_target_list (char *value
)
775 static unsigned long last_targ_count
= 0;
777 if (files
.ht_fill
!= last_targ_count
)
779 unsigned long max
= EXPANSION_INCREMENT (strlen (value
));
782 struct file
**fp
= (struct file
**) files
.ht_vec
;
783 struct file
**end
= &fp
[files
.ht_size
];
785 /* Make sure we have at least MAX bytes in the allocated buffer. */
786 value
= xrealloc (value
, max
);
790 for (; fp
< end
; ++fp
)
791 if (!HASH_VACANT (*fp
) && (*fp
)->is_target
)
793 struct file
*f
= *fp
;
794 int l
= strlen (f
->name
);
799 unsigned long off
= p
- value
;
801 max
+= EXPANSION_INCREMENT (l
+ 1);
802 value
= xrealloc (value
, max
);
806 bcopy (f
->name
, p
, l
);
812 last_targ_count
= files
.ht_fill
;
819 init_hash_files (void)
821 hash_init (&files
, 1000, file_hash_1
, file_hash_2
, file_hash_cmp
);