file.c@ 2016

Last change on this file since 2016 was 1993, checked in by bird, 16 years ago
Merged in current GNU Make code (CVS from 2008-10-28). Ref #55.
Property svn:eol-style set to `native`
File size: 38.9 KB

Line
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
4	Foundation, Inc.
5	This file is part of GNU Make.
6
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
10	version.
11
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.
15
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/>. */
18
19	#include "make.h"
20
21	#include <assert.h>
22
23	#include "dep.h"
24	#include "filedef.h"
25	#include "job.h"
26	#include "commands.h"
27	#include "variable.h"
28	#include "debug.h"
29	#include "hash.h"
30	#ifdef CONFIG_WITH_STRCACHE2
31	# include <stddef.h>
32	#endif
33
34
35	/* Remember whether snap_deps has been invoked: we need this to be sure we
36	don't add new rules (via $(eval ...)) afterwards. In the future it would
37	be nice to support this, but it means we'd need to re-run snap_deps() or
38	at least its functionality... it might mean changing snap_deps() to be run
39	per-file, so we can invoke it after the eval... or remembering which files
40	in the hash have been snapped (a new boolean flag?) and having snap_deps()
41	only work on files which have not yet been snapped. */
42	int snapped_deps = 0;
43
44	/* Hash table of files the makefile knows how to make. */
45
46	#ifndef CONFIG_WITH_STRCACHE2
47	static unsigned long
48	file_hash_1 (const void *key)
49	{
50	return_ISTRING_HASH_1 (((struct file const *) key)->hname);
51	}
52
53	static unsigned long
54	file_hash_2 (const void *key)
55	{
56	return_ISTRING_HASH_2 (((struct file const *) key)->hname);
57	}
58	#endif /* !CONFIG_WITH_STRCACHE2 */
59
60	static int
61	file_hash_cmp (const void x, const void y)
62	{
63	#ifndef CONFIG_WITH_STRCACHE2
64	return_ISTRING_COMPARE (((struct file const *) x)->hname,
65	((struct file const *) y)->hname);
66	#else /* CONFIG_WITH_STRCACHE2 */
67	return ((struct file const *) x)->hname
68	== ((struct file const *) y)->hname ? 0 : -1;
69	#endif /* CONFIG_WITH_STRCACHE2 */
70	}
71
72	#ifndef FILE_BUCKETS
73	#define FILE_BUCKETS 1007
74	#endif
75	static struct hash_table files;
76
77	/* Whether or not .SECONDARY with no prerequisites was given. */
78	static int all_secondary = 0;
79
80	/* Access the hash table of all file records.
81	lookup_file given a name, return the struct file * for that name,
82	or nil if there is none.
83	*/
84
85	#ifndef CONFIG_WITH_STRCACHE2
86	struct file *
87	lookup_file (const char *name)
88	#else /* CONFIG_WITH_STRCACHE2 */
89	MY_INLINE struct file *
90	lookup_file_common (const char *name, int cached)
91	#endif /* CONFIG_WITH_STRCACHE2 */
92	{
93	struct file *f;
94	struct file file_key;
95	#if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
96	char *lname;
97	#endif
98
99	assert (*name != '\0');
100
101	/* This is also done in parse_file_seq, so this is redundant
102	for names read from makefiles. It is here for names passed
103	on the command line. */
104	#ifdef VMS
105	# ifndef WANT_CASE_SENSITIVE_TARGETS
106	if (*name != '.')
107	{
108	const char *n;
109	char *ln;
110	lname = xstrdup (name);
111	for (n = name, ln = lname; *n != '\0'; ++n, ++ln)
112	ln = isupper ((unsigned char)n) ? tolower ((unsigned char)n) : n;
113	*ln = '\0';
114	name = lname;
115	}
116	# endif
117
118	while (name[0] == '[' && name[1] == ']' && name[2] != '\0')
119	name += 2;
120	#endif
121	while (name[0] == '.' && name[1] == '/' && name[2] != '\0')
122	{
123	name += 2;
124	while (*name == '/')
125	/* Skip following slashes: ".//foo" is "foo", not "/foo". */
126	++name;
127	}
128
129	if (*name == '\0')
130	/* It was all slashes after a dot. */
131	#if defined(VMS)
132	name = "[]";
133	#elif defined(_AMIGA)
134	name = "";
135	#else
136	name = "./";
137	#endif
138
139	#ifndef CONFIG_WITH_STRCACHE2
140	file_key.hname = name;
141	f = hash_find_item (&files, &file_key);
142	#else /* CONFIG_WITH_STRCACHE2 */
143	if (!cached)
144	{
145	file_key.hname = strcache2_lookup_file (&file_strcache, name, strlen (name));
146	if (file_key.hname)
147	f = hash_find_item_strcached (&files, &file_key);
148	else
149	f = NULL;
150	}
151	else
152	{
153	file_key.hname = name;
154	f = hash_find_item_strcached (&files, &file_key);
155	}
156
157	#endif /* CONFIG_WITH_STRCACHE2 */
158	#if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
159	if (*name != '.')
160	free (lname);
161	#endif
162
163	return f;
164	}
165
166	#ifdef CONFIG_WITH_STRCACHE2
167	/* Given a name, return the struct file * for that name,
168	or nil if there is none. */
169
170	struct file *
171	lookup_file (const char *name)
172	{
173	return lookup_file_common (name, 0 /* cached */);
174	}
175
176	/* Given a name in the strcache, return the struct file * for that name,
177	or nil if there is none. */
178	struct file *
179	lookup_file_cached (const char *name)
180	{
181	assert (strcache_iscached (name));
182	return lookup_file_common (name, 1 /* cached */);
183	}
184	#endif /* CONFIG_WITH_STRCACHE2 */
185
186
187	/* Look up a file record for file NAME and return it.
188	Create a new record if one doesn't exist. NAME will be stored in the
189	new record so it should be constant or in the strcache etc.
190	*/
191
192	struct file *
193	enter_file (const char *name)
194	{
195	struct file *f;
196	struct file *new;
197	struct file **file_slot;
198	struct file file_key;
199
200	assert (*name != '\0');
201	assert (strcache_iscached (name));
202
203	#if defined(VMS) && !defined(WANT_CASE_SENSITIVE_TARGETS)
204	if (*name != '.')
205	{
206	const char *n;
207	char lname, ln;
208	lname = xstrdup (name);
209	for (n = name, ln = lname; *n != '\0'; ++n, ++ln)
210	if (isupper ((unsigned char)*n))
211	ln = tolower ((unsigned char)n);
212	else
213	ln = n;
214
215	*ln = '\0';
216	name = strcache_add (lname);
217	free (lname);
218	}
219	#endif
220
221	file_key.hname = name;
222	#ifndef CONFIG_WITH_STRCACHE2
223	file_slot = (struct file **) hash_find_slot (&files, &file_key);
224	#else /* CONFIG_WITH_STRCACHE2 */
225	file_slot = (struct file **) hash_find_slot_strcached (&files, &file_key);
226	#endif /* CONFIG_WITH_STRCACHE2 */
227	f = *file_slot;
228	if (! HASH_VACANT (f) && !f->double_colon)
229	return f;
230
231	#ifndef CONFIG_WITH_ALLOC_CACHES
232	new = xmalloc (sizeof (struct file));
233	memset (new, '\0', sizeof (struct file));
234	#else
235	new = alloccache_calloc (&file_cache);
236	#endif
237	new->name = new->hname = name;
238	new->update_status = -1;
239
240	if (HASH_VACANT (f))
241	{
242	new->last = new;
243	hash_insert_at (&files, new, file_slot);
244	}
245	else
246	{
247	/* There is already a double-colon entry for this file. */
248	new->double_colon = f;
249	f->last->prev = new;
250	f->last = new;
251	}
252
253	#ifdef CONFIG_WITH_2ND_TARGET_EXPANSION
254	/* Check if the name needs 2nd expansion or not. */
255	if (second_target_expansion && strchr (name, '$') != NULL)
256	new->need_2nd_target_expansion = 1;
257	#endif
258
259	return new;
260	}
261
262
263	/* Rehash FILE to NAME. This is not as simple as resetting
264	the `hname' member, since it must be put in a new hash bucket,
265	and possibly merged with an existing file called NAME. */
266
267	void
268	rehash_file (struct file from_file, const char to_hname)
269	{
270	struct file file_key;
271	struct file **file_slot;
272	struct file *to_file;
273	struct file *deleted_file;
274	struct file *f;
275
276	#ifdef CONFIG_WITH_STRCACHE2
277	assert (strcache_iscached (to_hname));
278	assert (strcache_iscached (from_file->hname));
279	#endif
280
281	/* If it's already that name, we're done. */
282	file_key.hname = to_hname;
283	if (! file_hash_cmp (from_file, &file_key))
284	return;
285
286	/* Find the end of the renamed list for the "from" file. */
287	file_key.hname = from_file->hname;
288	while (from_file->renamed != 0)
289	from_file = from_file->renamed;
290	if (file_hash_cmp (from_file, &file_key))
291	/* hname changed unexpectedly!! */
292	abort ();
293
294	/* Remove the "from" file from the hash. */
295	#ifndef CONFIG_WITH_STRCACHE2
296	deleted_file = hash_delete (&files, from_file);
297	#else
298	deleted_file = hash_delete_strcached (&files, from_file);
299	#endif
300	if (deleted_file != from_file)
301	/* from_file isn't the one stored in files */
302	abort ();
303
304	/* Find where the newly renamed file will go in the hash. */
305	file_key.hname = to_hname;
306	#ifndef CONFIG_WITH_STRCACHE2
307	file_slot = (struct file **) hash_find_slot (&files, &file_key);
308	#else /* CONFIG_WITH_STRCACHE2 */
309	file_slot = (struct file **) hash_find_slot_strcached (&files, &file_key);
310	#endif /* CONFIG_WITH_STRCACHE2 */
311	to_file = *file_slot;
312
313	/* Change the hash name for this file. */
314	from_file->hname = to_hname;
315	for (f = from_file->double_colon; f != 0; f = f->prev)
316	f->hname = to_hname;
317
318	/* If the new name doesn't exist yet just set it to the renamed file. */
319	if (HASH_VACANT (to_file))
320	{
321	hash_insert_at (&files, from_file, file_slot);
322	return;
323	}
324
325	/* TO_FILE already exists under TO_HNAME.
326	We must retain TO_FILE and merge FROM_FILE into it. */
327
328	if (from_file->cmds != 0)
329	{
330	if (to_file->cmds == 0)
331	to_file->cmds = from_file->cmds;
332	else if (from_file->cmds != to_file->cmds)
333	{
334	/* We have two sets of commands. We will go with the
335	one given in the rule explicitly mentioning this name,
336	but give a message to let the user know what's going on. */
337	if (to_file->cmds->fileinfo.filenm != 0)
338	error (&from_file->cmds->fileinfo,
339	_("Recipe was specified for file `%s' at %s:%lu,"),
340	from_file->name, to_file->cmds->fileinfo.filenm,
341	to_file->cmds->fileinfo.lineno);
342	else
343	error (&from_file->cmds->fileinfo,
344	_("Recipe for file `%s' was found by implicit rule search,"),
345	from_file->name);
346	error (&from_file->cmds->fileinfo,
347	_("but `%s' is now considered the same file as `%s'."),
348	from_file->name, to_hname);
349	error (&from_file->cmds->fileinfo,
350	_("Recipe for `%s' will be ignored in favor of the one for `%s'."),
351	to_hname, from_file->name);
352	}
353	}
354
355	/* Merge the dependencies of the two files. */
356
357	if (to_file->deps == 0)
358	to_file->deps = from_file->deps;
359	else
360	{
361	struct dep *deps = to_file->deps;
362	while (deps->next != 0)
363	deps = deps->next;
364	deps->next = from_file->deps;
365	}
366
367	merge_variable_set_lists (&to_file->variables, from_file->variables);
368
369	if (to_file->double_colon && from_file->is_target && !from_file->double_colon)
370	fatal (NILF, _("can't rename single-colon `%s' to double-colon `%s'"),
371	from_file->name, to_hname);
372	if (!to_file->double_colon && from_file->double_colon)
373	{
374	if (to_file->is_target)
375	fatal (NILF, _("can't rename double-colon `%s' to single-colon `%s'"),
376	from_file->name, to_hname);
377	else
378	to_file->double_colon = from_file->double_colon;
379	}
380
381	if (from_file->last_mtime > to_file->last_mtime)
382	/* %%% Kludge so -W wins on a file that gets vpathized. */
383	to_file->last_mtime = from_file->last_mtime;
384
385	to_file->mtime_before_update = from_file->mtime_before_update;
386
387	#define MERGE(field) to_file->field \|= from_file->field
388	MERGE (precious);
389	MERGE (tried_implicit);
390	MERGE (updating);
391	MERGE (updated);
392	MERGE (is_target);
393	MERGE (cmd_target);
394	MERGE (phony);
395	MERGE (ignore_vpath);
396	#undef MERGE
397
398	from_file->renamed = to_file;
399	}
400
401	/* Rename FILE to NAME. This is not as simple as resetting
402	the `name' member, since it must be put in a new hash bucket,
403	and possibly merged with an existing file called NAME. */
404
405	void
406	rename_file (struct file from_file, const char to_hname)
407	{
408	rehash_file (from_file, to_hname);
409	while (from_file)
410	{
411	from_file->name = from_file->hname;
412	from_file = from_file->prev;
413	}
414	}
415
416
417	#ifdef CONFIG_WITH_2ND_TARGET_EXPANSION
418	/* Performs secondary target name expansion and then renames
419	the file using rename_file. */
420	static void
421	do_2nd_target_expansion (struct file *f)
422	{
423	unsigned int len;
424	char *tmp_name = allocated_variable_expand_2 (
425	f->name, strcache2_get_len (&file_strcache, f->name), &len);
426	const char *name = strcache_add_len (tmp_name, len);
427	free (tmp_name);
428	rename_file (f, name);
429	}
430	#endif /* CONFIG_WITH_2ND_TARGET_EXPANSION */
431
432
433	/* Remove all nonprecious intermediate files.
434	If SIG is nonzero, this was caused by a fatal signal,
435	meaning that a different message will be printed, and
436	the message will go to stderr rather than stdout. */
437
438	void
439	remove_intermediates (int sig)
440	{
441	struct file **file_slot;
442	struct file **file_end;
443	int doneany = 0;
444
445	/* If there's no way we will ever remove anything anyway, punt early. */
446	if (question_flag \|\| touch_flag \|\| all_secondary)
447	return;
448
449	if (sig && just_print_flag)
450	return;
451
452	file_slot = (struct file **) files.ht_vec;
453	file_end = file_slot + files.ht_size;
454	for ( ; file_slot < file_end; file_slot++)
455	if (! HASH_VACANT (*file_slot))
456	{
457	struct file f = file_slot;
458	/* Is this file eligible for automatic deletion?
459	Yes, IFF: it's marked intermediate, it's not secondary, it wasn't
460	given on the command line, and it's either a -include makefile or
461	it's not precious. */
462	if (f->intermediate && (f->dontcare \|\| !f->precious)
463	&& !f->secondary && !f->cmd_target)
464	{
465	int status;
466	if (f->update_status == -1)
467	/* If nothing would have created this file yet,
468	don't print an "rm" command for it. */
469	continue;
470	if (just_print_flag)
471	status = 0;
472	else
473	{
474	status = unlink (f->name);
475	if (status < 0 && errno == ENOENT)
476	continue;
477	}
478	if (!f->dontcare)
479	{
480	if (sig)
481	error (NILF, _("*** Deleting intermediate file `%s'"), f->name);
482	else
483	{
484	if (! doneany)
485	DB (DB_BASIC, (_("Removing intermediate files...\n")));
486	if (!silent_flag)
487	{
488	if (! doneany)
489	{
490	fputs ("rm ", stdout);
491	doneany = 1;
492	}
493	else
494	putchar (' ');
495	fputs (f->name, stdout);
496	fflush (stdout);
497	}
498	}
499	if (status < 0)
500	perror_with_name ("unlink: ", f->name);
501	}
502	}
503	}
504
505	if (doneany && !sig)
506	{
507	putchar ('\n');
508	fflush (stdout);
509	}
510	}
511
512
513	struct dep *
514	parse_prereqs (char *p)
515	{
516	#ifndef CONFIG_WITH_ALLOC_CACHES
517	struct dep new = (struct dep )
518	multi_glob (parse_file_seq (&p, '\|', sizeof (struct dep), 1),
519	sizeof (struct dep));
520	#else
521	struct dep new = (struct dep )
522	multi_glob (parse_file_seq (&p, '\|', &dep_cache, 1), &dep_cache);
523	#endif
524
525	if (*p)
526	{
527	/* Files that follow '\|' are "order-only" prerequisites that satisfy the
528	dependency by existing: their modification times are irrelevant. */
529	struct dep *ood;
530
531	++p;
532	#ifndef CONFIG_WITH_ALLOC_CACHES
533	ood = (struct dep *)
534	multi_glob (parse_file_seq (&p, '\0', sizeof (struct dep), 1),
535	sizeof (struct dep));
536	#else
537	ood = (struct dep *)
538	multi_glob (parse_file_seq (&p, '\0', &dep_cache, 1), &dep_cache);
539	#endif
540
541	if (! new)
542	new = ood;
543	else
544	{
545	struct dep *dp;
546	for (dp = new; dp->next != NULL; dp = dp->next)
547	;
548	dp->next = ood;
549	}
550
551	for (; ood != NULL; ood = ood->next)
552	ood->ignore_mtime = 1;
553	}
554
555	return new;
556	}
557
558	/* Set the intermediate flag. */
559
560	static void
561	set_intermediate (const void *item)
562	{
563	struct file f = (struct file ) item;
564	f->intermediate = 1;
565	}
566
567	/* Expand and parse each dependency line. */
568	static void
569	expand_deps (struct file *f)
570	{
571	struct dep *d;
572	struct dep *old = f->deps;
573	const char *file_stem = f->stem;
574	unsigned int last_dep_has_cmds = f->updating;
575	int initialized = 0;
576
577	f->updating = 0;
578	f->deps = 0;
579
580	for (d = old; d != 0; d = d->next)
581	{
582	struct dep new, d1;
583	char *p;
584	#ifdef CONFIG_WITH_STRCACHE2
585	unsigned int len;
586	#endif
587
588	if (! d->name)
589	continue;
590
591	#ifdef CONFIG_WITH_INCLUDEDEP
592	/* Dependencies loaded by includedep are ready for use and we skip
593	the expensive parsing and globbing for them. To avoid wasting
594	lots of time walking the f->deps chain, we will advance D and
595	process all subsequent includedep records. */
596
597	if (d->includedep)
598	{
599	new = d1 = alloc_dep();
600	d1->staticpattern = 0;
601	d1->need_2nd_expansion = 0;
602	d1->includedep = 1;
603	d1->file = lookup_file (d->name);
604	if (d1->file == 0)
605	d1->file = enter_file (d->name);
606
607	while (d->next && d->next->includedep)
608	{
609	d = d->next;
610	d1 = d1->next = alloc_dep();
611	d1->staticpattern = 0;
612	d1->need_2nd_expansion = 0;
613	d1->includedep = 1;
614	d1->file = lookup_file (d->name);
615	if (d1->file == 0)
616	d1->file = enter_file (d->name);
617	}
618	}
619	else
620	{
621	#endif
622
623	/* Create the dependency list.
624	If we're not doing 2nd expansion, then it's just the name. We will
625	still need to massage it though. */
626	if (! d->need_2nd_expansion)
627	{
628	p = variable_expand ("");
629	#ifndef CONFIG_WITH_STRCACHE2
630	variable_buffer_output (p, d->name, strlen (d->name) + 1);
631	#else
632	len = strcache2_get_len (&file_strcache, d->name);
633	variable_buffer_output (p, d->name, len + 1);
634	#endif
635	p = variable_buffer;
636	}
637	else
638	{
639	/* If it's from a static pattern rule, convert the patterns into
640	"$" so they'll expand properly. /
641	if (d->staticpattern)
642	{
643	char *o;
644	char *buffer = variable_expand ("");
645
646	o = subst_expand (buffer, d->name, "%", "$*", 1, 2, 0);
647	buffer = variable_buffer; /* bird - variable_buffer may have been reallocated. */
648
649	d->name = strcache_add_len (variable_buffer,
650	o - variable_buffer);
651	d->staticpattern = 0; /* Clear staticpattern so that we don't
652	re-expand %s below. */
653	}
654
655	/* We are going to do second expansion so initialize file variables
656	for the file. Since the stem for static pattern rules comes from
657	individual dep lines, we will temporarily set f->stem to d->stem.
658	*/
659	if (!initialized)
660	{
661	initialize_file_variables (f, 0);
662	initialized = 1;
663	}
664
665	if (d->stem != 0)
666	f->stem = d->stem;
667
668	set_file_variables (f);
669
670	#if !defined (CONFIG_WITH_VALUE_LENGTH) \|\| !defined (CONFIG_WITH_STRCACHE2)
671	p = variable_expand_for_file (d->name, f);
672	#else
673	len = strcache2_get_len (&file_strcache, d->name);
674	p = variable_expand_for_file_2 (NULL, d->name, len, f, &len);
675	#endif
676
677	if (d->stem != 0)
678	f->stem = file_stem;
679	}
680
681	/* Parse the prerequisites. */
682	new = parse_prereqs (p);
683
684	/* If this dep list was from a static pattern rule, expand the %s. We
685	use patsubst_expand to translate the prerequisites' patterns into
686	plain prerequisite names. */
687	if (new && d->staticpattern)
688	{
689	const char *pattern = "%";
690	char *buffer = variable_expand ("");
691	struct dep dp = new, dl = 0;
692
693	while (dp != 0)
694	{
695	char *percent;
696	#ifndef KMK
697	int nl = strlen (dp->name) + 1;
698	char *nm = alloca (nl);
699	memcpy (nm, dp->name, nl);
700	percent = find_percent (nm);
701	#else /* KMK - don't make a stack copy unless it's actually required! */
702	unsigned int nl = strcache2_get_len (&file_strcache, dp->name);
703	char *nm;
704	percent = memchr (dp->name, '%', nl);
705	if (percent)
706	{
707	nm = alloca (nl + 1);
708	memcpy (nm, dp->name, nl + 1);
709	percent = find_percent (nm);
710	}
711	#endif /* KMK */
712	if (percent)
713	{
714	char *o;
715
716	/* We have to handle empty stems specially, because that
717	would be equivalent to $(patsubst %,dp->name,) which
718	will always be empty. */
719	if (d->stem[0] == '\0')
720	{
721	memmove (percent, percent+1, strlen (percent));
722	o = variable_buffer_output (buffer, nm, strlen (nm) + 1);
723	}
724	else
725	{
726	o = patsubst_expand_pat (buffer, d->stem, pattern, nm,
727	pattern+1, percent+1);
728	o = variable_buffer_output (o, "", 1); /* bird fix - patsubst_expand_pat doesn't terminate,
729	the if case does and strcache would appreciate it. */
730	}
731	buffer = variable_buffer; /* bird fix - variable_buffer may have been reallocated. */
732
733
734	/* If the name expanded to the empty string, ignore it. */
735	if (buffer[0] == '\0')
736	{
737	struct dep *df = dp;
738	if (dp == new)
739	dp = new = new->next;
740	else
741	dp = dl->next = dp->next;
742	free_dep (df);
743	continue;
744	}
745
746	/* Save the name. */
747	dp->name = strcache_add_len (buffer, o - buffer - 1); /* bird fix - don't include the terminator. */
748	}
749	dl = dp;
750	dp = dp->next;
751	}
752	}
753
754	/* Enter them as files. */
755	for (d1 = new; d1 != 0; d1 = d1->next)
756	{
757	d1->file = lookup_file (d1->name);
758	if (d1->file == 0)
759	d1->file = enter_file (d1->name);
760	d1->name = 0;
761	d1->staticpattern = 0;
762	d1->need_2nd_expansion = 0;
763	}
764
765	#ifdef CONFIG_WITH_INCLUDEDEP
766	}
767	#endif
768
769	/* Add newly parsed deps to f->deps. If this is the last dependency
770	line and this target has commands then put it in front so the
771	last dependency line (the one with commands) ends up being the
772	first. This is important because people expect $< to hold first
773	prerequisite from the rule with commands. If it is not the last
774	dependency line or the rule does not have commands then link it
775	at the end so it appears in makefile order. */
776
777	if (new != 0)
778	{
779	if (d->next == 0 && last_dep_has_cmds)
780	{
781	struct dep **d_ptr;
782	for (d_ptr = &new; d_ptr; d_ptr = &(d_ptr)->next)
783	;
784
785	*d_ptr = f->deps;
786	f->deps = new;
787	}
788	else
789	{
790	struct dep **d_ptr;
791	for (d_ptr = &f->deps; d_ptr; d_ptr = &(d_ptr)->next)
792	;
793
794	*d_ptr = new;
795	}
796	}
797	}
798
799	free_dep_chain (old);
800	}
801
802	/* For each dependency of each file, make the `struct dep' point
803	at the appropriate `struct file' (which may have to be created).
804
805	Also mark the files depended on by .PRECIOUS, .PHONY, .SILENT,
806	and various other special targets. */
807
808	void
809	snap_deps (void)
810	{
811	struct file *f;
812	struct file *f2;
813	struct dep *d;
814	struct file **file_slot_0;
815	struct file **file_slot;
816	struct file **file_end;
817
818	/* Perform second expansion and enter each dependency name as a file. */
819
820	/* Expand .SUFFIXES first; it's dependencies are used for $$* calculation. */
821	for (f = lookup_file (".SUFFIXES"); f != 0; f = f->prev)
822	expand_deps (f);
823
824	#ifdef CONFIG_WITH_2ND_TARGET_EXPANSION
825	/* Perform 2nd target expansion on files which requires this. This will
826	be re-inserting (delete+insert) hash table entries so we have to use
827	hash_dump(). */
828	if (second_target_expansion)
829	{
830	# ifdef KMK /* turn on warnings here. */
831	int save = warn_undefined_variables_flag;
832	warn_undefined_variables_flag = 1;
833	# endif
834
835	file_slot_0 = (struct file **) hash_dump (&files, 0, 0);
836	file_end = file_slot_0 + files.ht_fill;
837	for (file_slot = file_slot_0; file_slot < file_end; file_slot++)
838	for (f = *file_slot; f != 0; f = f->prev)
839	if (f->need_2nd_target_expansion)
840	do_2nd_target_expansion (f);
841	free (file_slot_0);
842
843	# ifdef KMK
844	warn_undefined_variables_flag = save;
845	# endif
846
847	/* Disable second target expansion now since we won't expand files
848	entered after this point. (Saves CPU cycles in enter_file()). */
849	second_target_expansion = 0;
850	}
851	#endif /* CONFIG_WITH_2ND_TARGET_EXPANSION */
852
853	#ifdef CONFIG_WITH_INCLUDEDEP
854	/* Process any queued includedep files. Since includedep is supposed
855	to be simple stuff, we can do this after the second target expansion
856	and thereby save a little time. */
857	incdep_flush_and_term ();
858	#endif /* CONFIG_WITH_INCLUDEDEP */
859
860	/* For every target that's not .SUFFIXES, expand its dependencies.
861	We must use hash_dump (), because within this loop we might add new files
862	to the table, possibly causing an in-situ table expansion. */
863	file_slot_0 = (struct file **) hash_dump (&files, 0, 0);
864	file_end = file_slot_0 + files.ht_fill;
865	for (file_slot = file_slot_0; file_slot < file_end; file_slot++)
866	for (f = *file_slot; f != 0; f = f->prev)
867	#ifndef CONFIG_WITH_STRCACHE2
868	if (strcmp (f->name, ".SUFFIXES") != 0)
869	#else
870	if (f->name != suffixes_strcached)
871	#endif
872	expand_deps (f);
873	#ifdef KMK
874	/* This is a HACK to work around the still broken test #9 in
875	features/double_colon. It produces the wrong result if the build is
876	parallel because of changed evaluation order. Just make these
877	problematic rules execute in single field till a proper fix is
878	forthcomming... */
879
880	for (file_slot = file_slot_0; file_slot < file_end; file_slot++)
881	if ( (f = *file_slot) != 0
882	&& f->double_colon
883	&& ( f->double_colon != f
884	\|\| f->last != f))
885	for (f2 = f->double_colon; f2 != 0; f2 = f2->prev)
886	f2->command_flags \|= COMMANDS_NOTPARALLEL;
887	#endif /* KMK */
888	free (file_slot_0);
889
890	/* Now manage all the special targets. */
891
892	for (f = lookup_file (".PRECIOUS"); f != 0; f = f->prev)
893	for (d = f->deps; d != 0; d = d->next)
894	for (f2 = d->file; f2 != 0; f2 = f2->prev)
895	f2->precious = 1;
896
897	for (f = lookup_file (".LOW_RESOLUTION_TIME"); f != 0; f = f->prev)
898	for (d = f->deps; d != 0; d = d->next)
899	for (f2 = d->file; f2 != 0; f2 = f2->prev)
900	f2->low_resolution_time = 1;
901
902	for (f = lookup_file (".PHONY"); f != 0; f = f->prev)
903	for (d = f->deps; d != 0; d = d->next)
904	for (f2 = d->file; f2 != 0; f2 = f2->prev)
905	{
906	/* Mark this file as phony nonexistent target. */
907	f2->phony = 1;
908	f2->is_target = 1;
909	f2->last_mtime = NONEXISTENT_MTIME;
910	f2->mtime_before_update = NONEXISTENT_MTIME;
911	}
912
913	for (f = lookup_file (".INTERMEDIATE"); f != 0; f = f->prev)
914	/* Mark .INTERMEDIATE deps as intermediate files. */
915	for (d = f->deps; d != 0; d = d->next)
916	for (f2 = d->file; f2 != 0; f2 = f2->prev)
917	f2->intermediate = 1;
918	/* .INTERMEDIATE with no deps does nothing.
919	Marking all files as intermediates is useless since the goal targets
920	would be deleted after they are built. */
921
922	for (f = lookup_file (".SECONDARY"); f != 0; f = f->prev)
923	/* Mark .SECONDARY deps as both intermediate and secondary. */
924	if (f->deps)
925	for (d = f->deps; d != 0; d = d->next)
926	for (f2 = d->file; f2 != 0; f2 = f2->prev)
927	f2->intermediate = f2->secondary = 1;
928	/* .SECONDARY with no deps listed marks all files that way. */
929	else
930	{
931	all_secondary = 1;
932	hash_map (&files, set_intermediate);
933	}
934
935	f = lookup_file (".EXPORT_ALL_VARIABLES");
936	if (f != 0 && f->is_target)
937	export_all_variables = 1;
938
939	f = lookup_file (".IGNORE");
940	if (f != 0 && f->is_target)
941	{
942	if (f->deps == 0)
943	ignore_errors_flag = 1;
944	else
945	for (d = f->deps; d != 0; d = d->next)
946	for (f2 = d->file; f2 != 0; f2 = f2->prev)
947	f2->command_flags \|= COMMANDS_NOERROR;
948	}
949
950	f = lookup_file (".SILENT");
951	if (f != 0 && f->is_target)
952	{
953	if (f->deps == 0)
954	silent_flag = 1;
955	else
956	for (d = f->deps; d != 0; d = d->next)
957	for (f2 = d->file; f2 != 0; f2 = f2->prev)
958	f2->command_flags \|= COMMANDS_SILENT;
959	}
960
961	f = lookup_file (".NOTPARALLEL");
962	if (f != 0 && f->is_target)
963	#ifndef CONFIG_WITH_EXTENDED_NOTPARALLEL
964	not_parallel = 1;
965	#else /* CONFIG_WITH_EXTENDED_NOTPARALLEL */
966	{
967	if (f->deps == 0)
968	{
969	DB (DB_KMK, (_("not_parallel -1\n")));
970	not_parallel = -1;
971	}
972	else
973	for (d = f->deps; d != 0; d = d->next)
974	for (f2 = d->file; f2 != 0; f2 = f2->prev)
975	f2->command_flags \|= COMMANDS_NOTPARALLEL;
976	}
977	#endif /* CONFIG_WITH_EXTENDED_NOTPARALLEL */
978
979	#ifndef NO_MINUS_C_MINUS_O
980	/* If .POSIX was defined, remove OUTPUT_OPTION to comply. */
981	/* This needs more work: what if the user sets this in the makefile?
982	if (posix_pedantic)
983	define_variable (STRING_SIZE_TUPLE("OUTPUT_OPTION"), "", o_default, 1);
984	*/
985	#endif
986
987	/* Remember that we've done this. */
988	snapped_deps = 1;
989	}
990
991
992	/* Set the `command_state' member of FILE and all its `also_make's. */
993
994	void
995	set_command_state (struct file *file, enum cmd_state state)
996	{
997	struct dep *d;
998
999	file->command_state = state;
1000
1001	for (d = file->also_make; d != 0; d = d->next)
1002	d->file->command_state = state;
1003
1004	#ifdef CONFIG_WITH_EXPLICIT_MULTITARGET
1005	if (file->multi_head)
1006	for (file = file->multi_head; file != 0; file = file->multi_next)
1007	file->command_state = state;
1008	#endif
1009	}
1010
1011
1012	/* Convert an external file timestamp to internal form. */
1013
1014	FILE_TIMESTAMP
1015	file_timestamp_cons (const char *fname, time_t s, int ns)
1016	{
1017	int offset = ORDINARY_MTIME_MIN + (FILE_TIMESTAMP_HI_RES ? ns : 0);
1018	FILE_TIMESTAMP product = (FILE_TIMESTAMP) s << FILE_TIMESTAMP_LO_BITS;
1019	FILE_TIMESTAMP ts = product + offset;
1020
1021	if (! (s <= FILE_TIMESTAMP_S (ORDINARY_MTIME_MAX)
1022	&& product <= ts && ts <= ORDINARY_MTIME_MAX))
1023	{
1024	char buf[FILE_TIMESTAMP_PRINT_LEN_BOUND + 1];
1025	ts = s <= OLD_MTIME ? ORDINARY_MTIME_MIN : ORDINARY_MTIME_MAX;
1026	file_timestamp_sprintf (buf, ts);
1027	error (NILF, _("%s: Timestamp out of range; substituting %s"),
1028	fname ? fname : _("Current time"), buf);
1029	}
1030
1031	return ts;
1032	}
1033
1034
1035	/* Return the current time as a file timestamp, setting *RESOLUTION to
1036	its resolution. */
1037	FILE_TIMESTAMP
1038	file_timestamp_now (int *resolution)
1039	{
1040	int r;
1041	time_t s;
1042	int ns;
1043
1044	/* Don't bother with high-resolution clocks if file timestamps have
1045	only one-second resolution. The code below should work, but it's
1046	not worth the hassle of debugging it on hosts where it fails. */
1047	#if FILE_TIMESTAMP_HI_RES
1048	# if HAVE_CLOCK_GETTIME && defined CLOCK_REALTIME
1049	{
1050	struct timespec timespec;
1051	if (clock_gettime (CLOCK_REALTIME, &timespec) == 0)
1052	{
1053	r = 1;
1054	s = timespec.tv_sec;
1055	ns = timespec.tv_nsec;
1056	goto got_time;
1057	}
1058	}
1059	# endif
1060	# if HAVE_GETTIMEOFDAY
1061	{
1062	struct timeval timeval;
1063	if (gettimeofday (&timeval, 0) == 0)
1064	{
1065	r = 1000;
1066	s = timeval.tv_sec;
1067	ns = timeval.tv_usec * 1000;
1068	goto got_time;
1069	}
1070	}
1071	# endif
1072	#endif
1073
1074	r = 1000000000;
1075	s = time ((time_t *) 0);
1076	ns = 0;
1077
1078	#if FILE_TIMESTAMP_HI_RES
1079	got_time:
1080	#endif
1081	*resolution = r;
1082	return file_timestamp_cons (0, s, ns);
1083	}
1084
1085	/* Place into the buffer P a printable representation of the file
1086	timestamp TS. */
1087	void
1088	file_timestamp_sprintf (char *p, FILE_TIMESTAMP ts)
1089	{
1090	time_t t = FILE_TIMESTAMP_S (ts);
1091	struct tm *tm = localtime (&t);
1092
1093	if (tm)
1094	sprintf (p, "%04d-%02d-%02d %02d:%02d:%02d",
1095	tm->tm_year + 1900, tm->tm_mon + 1, tm->tm_mday,
1096	tm->tm_hour, tm->tm_min, tm->tm_sec);
1097	else if (t < 0)
1098	sprintf (p, "%ld", (long) t);
1099	else
1100	sprintf (p, "%lu", (unsigned long) t);
1101	p += strlen (p);
1102
1103	/* Append nanoseconds as a fraction, but remove trailing zeros. We don't
1104	know the actual timestamp resolution, since clock_getres applies only to
1105	local times, whereas this timestamp might come from a remote filesystem.
1106	So removing trailing zeros is the best guess that we can do. */
1107	sprintf (p, ".%09d", FILE_TIMESTAMP_NS (ts));
1108	p += strlen (p) - 1;
1109	while (*p == '0')
1110	p--;
1111	p += *p != '.';
1112
1113	*p = '\0';
1114	}
1115
1116
1117	/* Print the data base of files. */
1118
1119	static void
1120	print_file (const void *item)
1121	{
1122	const struct file *f = item;
1123	struct dep *d;
1124	struct dep *ood = 0;
1125
1126	putchar ('\n');
1127	if (!f->is_target)
1128	puts (_("# Not a target:"));
1129	#ifdef CONFIG_WITH_EXPLICIT_MULTITARGET
1130	if (f->multi_head)
1131	{
1132	const struct file *f2;
1133	if (f->multi_head == f)
1134	{
1135	int multi_maybe = -1;
1136	assert (!f->multi_maybe);
1137	assert (!f->double_colon);
1138
1139	printf ("%s", f->name);
1140	for (f2 = f->multi_next; f2 != 0; f2 = f2->multi_next)
1141	{
1142	printf (" %s%s", f2->multi_maybe != multi_maybe
1143	? f2->multi_maybe ? "+\| " : "+ " : "",
1144	f2->name);
1145	multi_maybe = f2->multi_maybe;
1146	}
1147	putchar (':');
1148	}
1149	else
1150	printf ("%s:%s", f->name, f->double_colon ? ":" : "");
1151	}
1152	else
1153	#endif
1154	printf ("%s:%s", f->name, f->double_colon ? ":" : "");
1155
1156	/* Print all normal dependencies; note any order-only deps. */
1157	for (d = f->deps; d != 0; d = d->next)
1158	if (! d->ignore_mtime)
1159	printf (" %s", dep_name (d));
1160	else if (! ood)
1161	ood = d;
1162
1163	/* Print order-only deps, if we have any. */
1164	if (ood)
1165	{
1166	printf (" \| %s", dep_name (ood));
1167	for (d = ood->next; d != 0; d = d->next)
1168	if (d->ignore_mtime)
1169	printf (" %s", dep_name (d));
1170	}
1171
1172	putchar ('\n');
1173
1174	#ifdef CONFIG_WITH_EXPLICIT_MULTITARGET
1175	if (f->multi_head && f->multi_head != f)
1176	{
1177	const struct file *f2;
1178	fputs (_("# In multi target list:"), stdout);
1179	for (f2 = f->multi_head; f2 != 0; f2 = f2->multi_next)
1180	printf (" %s%s", f2->name, f == f2 ? "(*)" : "");
1181	putchar ('\n');
1182	if (f->multi_maybe)
1183	puts (_("# File is an optional multi target member."));
1184	}
1185	#endif
1186
1187	if (f->precious)
1188	puts (_("# Precious file (prerequisite of .PRECIOUS)."));
1189	if (f->phony)
1190	puts (_("# Phony target (prerequisite of .PHONY)."));
1191	if (f->cmd_target)
1192	puts (_("# Command line target."));
1193	if (f->dontcare)
1194	puts (_("# A default, MAKEFILES, or -include/sinclude makefile."));
1195	puts (f->tried_implicit
1196	? _("# Implicit rule search has been done.")
1197	: _("# Implicit rule search has not been done."));
1198	if (f->stem != 0)
1199	printf (_("# Implicit/static pattern stem: `%s'\n"), f->stem);
1200	if (f->intermediate)
1201	puts (_("# File is an intermediate prerequisite."));
1202	if (f->also_make != 0)
1203	{
1204	fputs (_("# Also makes:"), stdout);
1205	for (d = f->also_make; d != 0; d = d->next)
1206	printf (" %s", dep_name (d));
1207	putchar ('\n');
1208	}
1209	if (f->last_mtime == UNKNOWN_MTIME)
1210	puts (_("# Modification time never checked."));
1211	else if (f->last_mtime == NONEXISTENT_MTIME)
1212	puts (_("# File does not exist."));
1213	else if (f->last_mtime == OLD_MTIME)
1214	puts (_("# File is very old."));
1215	else
1216	{
1217	char buf[FILE_TIMESTAMP_PRINT_LEN_BOUND + 1];
1218	file_timestamp_sprintf (buf, f->last_mtime);
1219	printf (_("# Last modified %s\n"), buf);
1220	}
1221	puts (f->updated
1222	? _("# File has been updated.") : _("# File has not been updated."));
1223	switch (f->command_state)
1224	{
1225	case cs_running:
1226	puts (_("# Recipe currently running (THIS IS A BUG)."));
1227	break;
1228	case cs_deps_running:
1229	puts (_("# Dependencies recipe running (THIS IS A BUG)."));
1230	break;
1231	case cs_not_started:
1232	case cs_finished:
1233	switch (f->update_status)
1234	{
1235	case -1:
1236	break;
1237	case 0:
1238	puts (_("# Successfully updated."));
1239	break;
1240	case 1:
1241	assert (question_flag);
1242	puts (_("# Needs to be updated (-q is set)."));
1243	break;
1244	case 2:
1245	puts (_("# Failed to be updated."));
1246	break;
1247	default:
1248	puts (_("# Invalid value in `update_status' member!"));
1249	fflush (stdout);
1250	fflush (stderr);
1251	abort ();
1252	}
1253	break;
1254	default:
1255	puts (_("# Invalid value in `command_state' member!"));
1256	fflush (stdout);
1257	fflush (stderr);
1258	abort ();
1259	}
1260
1261	if (f->variables != 0)
1262	print_file_variables (f);
1263
1264	if (f->cmds != 0)
1265	print_commands (f->cmds);
1266
1267	if (f->prev)
1268	print_file ((const void *) f->prev);
1269	}
1270
1271	void
1272	print_file_data_base (void)
1273	{
1274	puts (_("\n# Files"));
1275
1276	hash_map (&files, print_file);
1277
1278	fputs (_("\n# files hash-table stats:\n# "), stdout);
1279	hash_print_stats (&files, stdout);
1280	}
1281
1282	#ifdef CONFIG_WITH_PRINT_STATS_SWITCH
1283	void
1284	print_file_stats (void)
1285	{
1286	fputs (_("\n# files hash-table stats:\n# "), stdout);
1287	hash_print_stats (&files, stdout);
1288	fputs ("\n", stdout);
1289	}
1290	#endif
1291
1292
1293	/* Verify the integrity of the data base of files. */
1294
1295	#define VERIFY_CACHED(_p,_n) \
1296	do{\
1297	if (_p->_n && _p->_n[0] && !strcache_iscached (_p->_n)) \
1298	printf ("%s: Field %s not cached: %s\n", _p->name, # _n, _p->_n); \
1299	}while(0)
1300
1301	static void
1302	verify_file (const void *item)
1303	{
1304	const struct file *f = item;
1305	const struct dep *d;
1306
1307	VERIFY_CACHED (f, name);
1308	VERIFY_CACHED (f, hname);
1309	VERIFY_CACHED (f, vpath);
1310	VERIFY_CACHED (f, stem);
1311
1312	/* Check the deps. */
1313	for (d = f->deps; d != 0; d = d->next)
1314	{
1315	VERIFY_CACHED (d, name);
1316	VERIFY_CACHED (d, stem);
1317	}
1318	}
1319
1320	void
1321	verify_file_data_base (void)
1322	{
1323	hash_map (&files, verify_file);
1324	}
1325
1326	#define EXPANSION_INCREMENT(_l) ((((_l) / 500) + 1) * 500)
1327
1328	char *
1329	build_target_list (char *value)
1330	{
1331	static unsigned long last_targ_count = 0;
1332
1333	if (files.ht_fill != last_targ_count)
1334	{
1335	unsigned long max = EXPANSION_INCREMENT (strlen (value));
1336	unsigned long len;
1337	char *p;
1338	struct file fp = (struct file ) files.ht_vec;
1339	struct file **end = &fp[files.ht_size];
1340
1341	/* Make sure we have at least MAX bytes in the allocated buffer. */
1342	value = xrealloc (value, max);
1343
1344	p = value;
1345	len = 0;
1346	for (; fp < end; ++fp)
1347	if (!HASH_VACANT (fp) && (fp)->is_target)
1348	{
1349	struct file f = fp;
1350	int l = strlen (f->name);
1351
1352	len += l + 1;
1353	if (len > max)
1354	{
1355	unsigned long off = p - value;
1356
1357	max += EXPANSION_INCREMENT (l + 1);
1358	value = xrealloc (value, max);
1359	p = &value[off];
1360	}
1361
1362	memcpy (p, f->name, l);
1363	p += l;
1364	*(p++) = ' ';
1365	}
1366	*(p-1) = '\0';
1367
1368	last_targ_count = files.ht_fill;
1369	}
1370
1371	return value;
1372	}
1373
1374	void
1375	init_hash_files (void)
1376	{
1377	#ifndef CONFIG_WITH_STRCACHE2
1378	# ifdef KMK
1379	hash_init (&files, /65535/ 32755, file_hash_1, file_hash_2, file_hash_cmp);
1380	# else
1381	hash_init (&files, 1000, file_hash_1, file_hash_2, file_hash_cmp);
1382	# endif
1383	#else /* CONFIG_WITH_STRCACHE2 */
1384	# ifdef KMK
1385	hash_init_strcached (&files, 32755, &file_strcache,
1386	offsetof (struct file, hname));
1387	# else
1388	hash_init_strcached (&files, 1000, &file_strcache,
1389	offsetof (struct file, hname));
1390	# endif
1391	#endif /* CONFIG_WITH_STRCACHE2 */
1392	}
1393
1394	/* EOF */

Note: See TracBrowser for help on using the repository browser.

source: kBuild/trunk/src/kmk/file.c@ 2016

Download in other formats: