2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1988, 1989 by Adam de Boor
5 * Copyright (c) 1989 by Berkeley Softworks
8 * This code is derived from software contributed to Berkeley by
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)dir.c 8.2 (Berkeley) 1/2/94
40 * $$FreeBSD: src/usr.bin/make/dir.c,v 1.10.2.2 2003/10/08 08:14:22 ru Exp $
41 * $DragonFly: src/usr.bin/make/dir.c,v 1.13 2004/11/24 07:19:14 dillon Exp $
46 * Directory searching using wildcards and/or normal names...
47 * Used both for source wildcarding in the Makefile and for finding
50 * The interface for this module is:
51 * Dir_Init Initialize the module.
53 * Dir_End Cleanup the module.
55 * Dir_HasWildcards Returns TRUE if the name given it needs to
56 * be wildcard-expanded.
58 * Dir_Expand Given a pattern and a path, return a Lst of names
59 * which match the pattern on the search path.
61 * Dir_FindFile Searches for a file on a given search path.
62 * If it exists, the entire path is returned.
63 * Otherwise NULL is returned.
65 * Dir_MTime Return the modification time of a node. The file
66 * is searched for along the default search path.
67 * The path and mtime fields of the node are filled
70 * Dir_AddDir Add a directory to a search path.
72 * Dir_MakeFlags Given a search path and a command flag, create
73 * a string with each of the directories in the path
74 * preceded by the command flag and all of them
75 * separated by a space.
77 * Dir_Destroy Destroy an element of a search path. Frees up all
78 * things that can be freed for the element as long
79 * as the element is no longer referenced by any other
81 * Dir_ClearPath Resets a search path to the empty list.
84 * Dir_PrintDirectories Print stats about the directory cache.
88 #include <sys/types.h>
97 * A search path consists of a Lst of Path structures. A Path structure
98 * has in it the name of the directory and a hash table of all the files
99 * in the directory. This is used to cut down on the number of system
100 * calls necessary to find implicit dependents and their like. Since
101 * these searches are made before any actions are taken, we need not
102 * worry about the directory changing due to creation commands. If this
103 * hampers the style of some makefiles, they must be changed.
105 * A list of all previously-read directories is kept in the
106 * openDirectories Lst. This list is checked first before a directory
109 * The need for the caching of whole directories is brought about by
110 * the multi-level transformation code in suff.c, which tends to search
111 * for far more files than regular make does. In the initial
112 * implementation, the amount of time spent performing "stat" calls was
113 * truly astronomical. The problem with hashing at the start is,
114 * of course, that pmake doesn't then detect changes to these directories
115 * during the course of the make. Three possibilities suggest themselves:
117 * 1) just use stat to test for a file's existence. As mentioned
118 * above, this is very inefficient due to the number of checks
119 * engendered by the multi-level transformation code.
120 * 2) use readdir() and company to search the directories, keeping
121 * them open between checks. I have tried this and while it
122 * didn't slow down the process too much, it could severely
123 * affect the amount of parallelism available as each directory
124 * open would take another file descriptor out of play for
125 * handling I/O for another job. Given that it is only recently
126 * that UNIX OS's have taken to allowing more than 20 or 32
127 * file descriptors for a process, this doesn't seem acceptable
129 * 3) record the mtime of the directory in the Path structure and
130 * verify the directory hasn't changed since the contents were
131 * hashed. This will catch the creation or deletion of files,
132 * but not the updating of files. However, since it is the
133 * creation and deletion that is the problem, this could be
134 * a good thing to do. Unfortunately, if the directory (say ".")
135 * were fairly large and changed fairly frequently, the constant
136 * rehashing could seriously degrade performance. It might be
137 * good in such cases to keep track of the number of rehashes
138 * and if the number goes over a (small) limit, resort to using
141 * An additional thing to consider is that pmake is used primarily
142 * to create C programs and until recently pcc-based compilers refused
143 * to allow you to specify where the resulting object file should be
144 * placed. This forced all objects to be created in the current
145 * directory. This isn't meant as a full excuse, just an explanation of
146 * some of the reasons for the caching used here.
148 * One more note: the location of a target's file is only performed
149 * on the downward traversal of the graph and then only for terminal
150 * nodes in the graph. This could be construed as wrong in some cases,
151 * but prevents inadvertent modification of files when the "installed"
152 * directory for a file is provided in the search path.
154 * Another data structure maintained by this module is an mtime
155 * cache used when the searching of cached directories fails to find
156 * a file. In the past, Dir_FindFile would simply perform an access()
157 * call in such a case to determine if the file could be found using
158 * just the name given. When this hit, however, all that was gained
159 * was the knowledge that the file existed. Given that an access() is
160 * essentially a stat() without the copyout() call, and that the same
161 * filesystem overhead would have to be incurred in Dir_MTime, it made
162 * sense to replace the access() with a stat() and record the mtime
163 * in a cache for when Dir_MTime was actually called.
166 Lst dirSearchPath; /* main search path */
168 static Lst openDirectories; /* the list of all open directories */
171 * Variables for gathering statistics on the efficiency of the hashing
174 static int hits, /* Found in directory cache */
175 misses, /* Sad, but not evil misses */
176 nearmisses, /* Found under search path */
177 bigmisses; /* Sought by itself */
179 static Path *dot; /* contents of current directory */
180 static Hash_Table mtimes; /* Results of doing a last-resort stat in
181 * Dir_FindFile -- if we have to go to the
182 * system to find the file, we might as well
183 * have its mtime on record. XXX: If this is done
184 * way early, there's a chance other rules will
185 * have already updated the file, in which case
186 * we'll update it again. Generally, there won't
187 * be two rules to update a single file, so this
188 * should be ok, but... */
191 static int DirFindName(void *, void *);
192 static int DirMatchFiles(char *, Path *, Lst);
193 static void DirExpandCurly(char *, char *, Lst, Lst);
194 static void DirExpandInt(char *, Lst, Lst);
195 static int DirPrintWord(void *, void *);
196 static int DirPrintDir(void *, void *);
199 *-----------------------------------------------------------------------
201 * initialize things for this module
207 * some directories may be opened.
208 *-----------------------------------------------------------------------
213 dirSearchPath = Lst_Init (FALSE);
214 openDirectories = Lst_Init (FALSE);
215 Hash_InitTable(&mtimes, 0);
218 * Since the Path structure is placed on both openDirectories and
219 * the path we give Dir_AddDir (which in this case is openDirectories),
220 * we need to remove "." from openDirectories and what better time to
221 * do it than when we have to fetch the thing anyway?
223 Dir_AddDir (openDirectories, ".");
224 dot = (Path *) Lst_DeQueue (openDirectories);
225 if (dot == (Path *) NULL)
226 err(1, "cannot open current directory");
229 * We always need to have dot around, so we increment its reference count
230 * to make sure it's not destroyed.
236 *-----------------------------------------------------------------------
238 * cleanup things for this module
245 *-----------------------------------------------------------------------
251 Dir_Destroy((void *) dot);
252 Dir_ClearPath(dirSearchPath);
253 Lst_Destroy(dirSearchPath, NOFREE);
254 Dir_ClearPath(openDirectories);
255 Lst_Destroy(openDirectories, NOFREE);
256 Hash_DeleteTable(&mtimes);
260 *-----------------------------------------------------------------------
262 * See if the Path structure describes the same directory as the
263 * given one by comparing their names. Called from Dir_AddDir via
264 * Lst_Find when searching the list of open directories.
267 * 0 if it is the same. Non-zero otherwise
271 *-----------------------------------------------------------------------
274 DirFindName (void *p, void *dname)
276 return (strcmp (((Path *)p)->name, (char *) dname));
280 *-----------------------------------------------------------------------
281 * Dir_HasWildcards --
282 * See if the given name has any wildcard characters in it.
285 * returns TRUE if the word should be expanded, FALSE otherwise
289 *-----------------------------------------------------------------------
292 Dir_HasWildcards (char *name)
295 int wild = 0, brace = 0, bracket = 0;
297 for (cp = name; *cp; cp++) {
321 return wild && bracket == 0 && brace == 0;
325 *-----------------------------------------------------------------------
327 * Given a pattern and a Path structure, see if any files
328 * match the pattern and add their names to the 'expansions' list if
329 * any do. This is incomplete -- it doesn't take care of patterns like
330 * src / *src / *.c properly (just *.c on any of the directories), but it
337 * File names are added to the expansions lst. The directory will be
338 * fully hashed when this is done.
339 *-----------------------------------------------------------------------
342 DirMatchFiles (char *pattern, Path *p, Lst expansions)
344 Hash_Search search; /* Index into the directory's table */
345 Hash_Entry *entry; /* Current entry in the table */
346 Boolean isDot; /* TRUE if the directory being searched is . */
348 isDot = (*p->name == '.' && p->name[1] == '\0');
350 for (entry = Hash_EnumFirst(&p->files, &search);
351 entry != (Hash_Entry *)NULL;
352 entry = Hash_EnumNext(&search))
355 * See if the file matches the given pattern. Note we follow the UNIX
356 * convention that dot files will only be found if the pattern
357 * begins with a dot (note also that as a side effect of the hashing
358 * scheme, .* won't match . or .. since they aren't hashed).
360 if (Str_Match(entry->name, pattern) &&
361 ((entry->name[0] != '.') ||
362 (pattern[0] == '.')))
364 (void)Lst_AtEnd(expansions,
365 (isDot ? estrdup(entry->name) :
366 str_concat(p->name, entry->name,
374 *-----------------------------------------------------------------------
376 * Expand curly braces like the C shell. Does this recursively.
377 * Note the special case: if after the piece of the curly brace is
378 * done there are no wildcard characters in the result, the result is
379 * placed on the list WITHOUT CHECKING FOR ITS EXISTENCE. The
380 * given arguments are the entire word to expand, the first curly
381 * brace in the word, the search path, and the list to store the
388 * The given list is filled with the expansions...
390 *-----------------------------------------------------------------------
393 DirExpandCurly(char *word, char *brace, Lst path, Lst expansions)
395 char *end; /* Character after the closing brace */
396 char *cp; /* Current position in brace clause */
397 char *start; /* Start of current piece of brace clause */
398 int bracelevel; /* Number of braces we've seen. If we see a
399 * right brace when this is 0, we've hit the
400 * end of the clause. */
401 char *file; /* Current expansion */
402 int otherLen; /* The length of the other pieces of the
403 * expansion (chars before and after the
404 * clause in 'word') */
405 char *cp2; /* Pointer for checking for wildcards in
406 * expansion before calling Dir_Expand */
411 * Find the end of the brace clause first, being wary of nested brace
414 for (end = start, bracelevel = 0; *end != '\0'; end++) {
417 } else if ((*end == '}') && (bracelevel-- == 0)) {
422 Error("Unterminated {} clause \"%s\"", start);
427 otherLen = brace - word + strlen(end);
429 for (cp = start; cp < end; cp++) {
431 * Find the end of this piece of the clause.
437 } else if ((*cp == '}') && (bracelevel-- <= 0)) {
443 * Allocate room for the combination and install the three pieces.
445 file = emalloc(otherLen + cp - start + 1);
447 strncpy(file, word, brace-word);
450 strncpy(&file[brace-word], start, cp-start);
452 strcpy(&file[(brace-word)+(cp-start)], end);
455 * See if the result has any wildcards in it. If we find one, call
456 * Dir_Expand right away, telling it to place the result on our list
459 for (cp2 = file; *cp2 != '\0'; cp2++) {
465 Dir_Expand(file, path, expansions);
473 * Hit the end w/o finding any wildcards, so stick the expansion
474 * on the end of the list.
476 (void)Lst_AtEnd(expansions, file);
487 *-----------------------------------------------------------------------
489 * Internal expand routine. Passes through the directories in the
490 * path one by one, calling DirMatchFiles for each. NOTE: This still
491 * doesn't handle patterns in directories... Works given a word to
492 * expand, a path to look in, and a list to store expansions in.
498 * Things are added to the expansions list.
500 *-----------------------------------------------------------------------
503 DirExpandInt(char *word, Lst path, Lst expansions)
505 LstNode ln; /* Current node */
506 Path *p; /* Directory in the node */
508 if (Lst_Open(path) == SUCCESS) {
509 while ((ln = Lst_Next(path)) != NULL) {
510 p = (Path *)Lst_Datum(ln);
511 DirMatchFiles(word, p, expansions);
518 *-----------------------------------------------------------------------
520 * Print a word in the list of expansions. Callback for Dir_Expand
521 * when DEBUG(DIR), via Lst_ForEach.
527 * The passed word is printed, followed by a space.
529 *-----------------------------------------------------------------------
532 DirPrintWord(void *word, void *dummy __unused)
534 DEBUGF(DIR, ("%s ", (char *) word));
540 *-----------------------------------------------------------------------
542 * Expand the given word into a list of words by globbing it looking
543 * in the directories on the given search path.
546 * A list of words consisting of the files which exist along the search
547 * path matching the given pattern is placed in expansions.
550 * Directories may be opened. Who knows?
551 *-----------------------------------------------------------------------
554 Dir_Expand (char *word, Lst path, Lst expansions)
558 DEBUGF(DIR, ("expanding \"%s\"...", word));
560 cp = strchr(word, '{');
562 DirExpandCurly(word, cp, path, expansions);
564 cp = strchr(word, '/');
567 * The thing has a directory component -- find the first wildcard
570 for (cp = word; *cp; cp++) {
571 if (*cp == '?' || *cp == '[' || *cp == '*' || *cp == '{') {
577 * This one will be fun.
579 DirExpandCurly(word, cp, path, expansions);
581 } else if (*cp != '\0') {
583 * Back up to the start of the component
587 while (cp > word && *cp != '/') {
593 * If the glob isn't in the first component, try and find
594 * all the components up to the one with a wildcard.
598 dirpath = Dir_FindFile(word, path);
601 * dirpath is null if can't find the leading component
602 * XXX: Dir_FindFile won't find internal components.
603 * i.e. if the path contains ../Etc/Object and we're
604 * looking for Etc, it won't be found. Ah well.
605 * Probably not important.
607 if (dirpath != (char *)NULL) {
608 char *dp = &dirpath[strlen(dirpath) - 1];
611 path = Lst_Init(FALSE);
612 Dir_AddDir(path, dirpath);
613 DirExpandInt(cp+1, path, expansions);
614 Lst_Destroy(path, NOFREE);
618 * Start the search from the local directory
620 DirExpandInt(word, path, expansions);
624 * Return the file -- this should never happen.
626 DirExpandInt(word, path, expansions);
630 * First the files in dot
632 DirMatchFiles(word, dot, expansions);
635 * Then the files in every other directory on the path.
637 DirExpandInt(word, path, expansions);
641 Lst_ForEach(expansions, DirPrintWord, (void *) 0);
647 *-----------------------------------------------------------------------
649 * Find the file with the given name along the given search path.
652 * The path to the file or NULL. This path is guaranteed to be in a
653 * different part of memory than name and so may be safely free'd.
656 * If the file is found in a directory which is not on the path
657 * already (either 'name' is absolute or it is a relative path
658 * [ dir1/.../dirn/file ] which exists below one of the directories
659 * already on the search path), its directory is added to the end
660 * of the path on the assumption that there will be more files in
661 * that directory later on. Sometimes this is true. Sometimes not.
662 *-----------------------------------------------------------------------
665 Dir_FindFile (char *name, Lst path)
667 char *p1; /* pointer into p->name */
668 char *p2; /* pointer into name */
669 LstNode ln; /* a list element */
670 char *file; /* the current filename to check */
671 Path *p; /* current path member */
672 char *cp; /* index of first slash, if any */
673 Boolean hasSlash; /* true if 'name' contains a / */
674 struct stat stb; /* Buffer for stat, if necessary */
675 Hash_Entry *entry; /* Entry for mtimes table */
678 * Find the final component of the name and note whether it has a
679 * slash in it (the name, I mean)
681 cp = strrchr (name, '/');
690 DEBUGF(DIR, ("Searching for %s...", name));
692 * No matter what, we always look for the file in the current directory
693 * before anywhere else and we *do not* add the ./ to it if it exists.
694 * This is so there are no conflicts between what the user specifies
695 * (fish.c) and what pmake finds (./fish.c).
697 if ((!hasSlash || (cp - name == 2 && *name == '.')) &&
698 (Hash_FindEntry (&dot->files, cp) != (Hash_Entry *)NULL)) {
699 DEBUGF(DIR, ("in '.'\n"));
702 return (estrdup (name));
705 if (Lst_Open (path) == FAILURE) {
706 DEBUGF(DIR, ("couldn't open path, file not found\n"));
708 return ((char *) NULL);
712 * We look through all the directories on the path seeking one which
713 * contains the final component of the given name and whose final
714 * component(s) match the name's initial component(s). If such a beast
715 * is found, we concatenate the directory name and the final component
716 * and return the resulting string. If we don't find any such thing,
717 * we go on to phase two...
719 while ((ln = Lst_Next (path)) != NULL) {
720 p = (Path *) Lst_Datum (ln);
721 DEBUGF(DIR, ("%s...", p->name));
722 if (Hash_FindEntry (&p->files, cp) != (Hash_Entry *)NULL) {
723 DEBUGF(DIR, ("here..."));
726 * If the name had a slash, its initial components and p's
727 * final components must match. This is false if a mismatch
728 * is encountered before all of the initial components
729 * have been checked (p2 > name at the end of the loop), or
730 * we matched only part of one of the components of p
731 * along with all the rest of them (*p1 != '/').
733 p1 = p->name + strlen (p->name) - 1;
735 while (p2 >= name && p1 >= p->name && *p1 == *p2) {
738 if (p2 >= name || (p1 >= p->name && *p1 != '/')) {
739 DEBUGF(DIR, ("component mismatch -- continuing..."));
743 file = str_concat (p->name, cp, STR_ADDSLASH);
744 DEBUGF(DIR, ("returning %s\n", file));
749 } else if (hasSlash) {
751 * If the file has a leading path component and that component
752 * exactly matches the entire name of the current search
753 * directory, we assume the file doesn't exist and return NULL.
755 for (p1 = p->name, p2 = name; *p1 && *p1 == *p2; p1++, p2++) {
758 if (*p1 == '\0' && p2 == cp - 1) {
759 DEBUGF(DIR, ("must be here but isn't -- returing NULL\n"));
761 return ((char *) NULL);
767 * We didn't find the file on any existing members of the directory.
768 * If the name doesn't contain a slash, that means it doesn't exist.
769 * If it *does* contain a slash, however, there is still hope: it
770 * could be in a subdirectory of one of the members of the search
771 * path. (eg. /usr/include and sys/types.h. The above search would
772 * fail to turn up types.h in /usr/include, but it *is* in
773 * /usr/include/sys/types.h) If we find such a beast, we assume there
774 * will be more (what else can we assume?) and add all but the last
775 * component of the resulting name onto the search path (at the
776 * end). This phase is only performed if the file is *not* absolute.
779 DEBUGF(DIR, ("failed.\n"));
781 return ((char *) NULL);
785 Boolean checkedDot = FALSE;
787 DEBUGF(DIR, ("failed. Trying subdirectories..."));
788 (void) Lst_Open (path);
789 while ((ln = Lst_Next (path)) != NULL) {
790 p = (Path *) Lst_Datum (ln);
792 file = str_concat (p->name, name, STR_ADDSLASH);
795 * Checking in dot -- DON'T put a leading ./ on the thing.
797 file = estrdup(name);
800 DEBUGF(DIR, ("checking %s...", file));
802 if (stat (file, &stb) == 0) {
803 DEBUGF(DIR, ("got it.\n"));
808 * We've found another directory to search. We know there's
809 * a slash in 'file' because we put one there. We nuke it after
810 * finding it and call Dir_AddDir to add this new directory
811 * onto the existing search path. Once that's done, we restore
812 * the slash and triumphantly return the file name, knowing
813 * that should a file in this directory every be referenced
814 * again in such a manner, we will find it without having to do
815 * numerous numbers of access calls. Hurrah!
817 cp = strrchr (file, '/');
819 Dir_AddDir (path, file);
823 * Save the modification time so if it's needed, we don't have
826 DEBUGF(DIR, ("Caching %s for %s\n", Targ_FmtTime(stb.st_mtime), file));
827 entry = Hash_CreateEntry(&mtimes, (char *) file,
829 Hash_SetValue(entry, (long)stb.st_mtime);
837 DEBUGF(DIR, ("failed. "));
842 * Already checked by the given name, since . was in the path,
843 * so no point in proceeding...
845 DEBUGF(DIR, ("Checked . already, returning NULL\n"));
851 * Didn't find it that way, either. Sigh. Phase 3. Add its directory
852 * onto the search path in any case, just in case, then look for the
853 * thing in the hash table. If we find it, grand. We return a new
854 * copy of the name. Otherwise we sadly return a NULL pointer. Sigh.
855 * Note that if the directory holding the file doesn't exist, this will
856 * do an extra search of the final directory on the path. Unless something
857 * weird happens, this search won't succeed and life will be groovy.
859 * Sigh. We cannot add the directory onto the search path because
860 * of this amusing case:
861 * $(INSTALLDIR)/$(FILE): $(FILE)
863 * $(FILE) exists in $(INSTALLDIR) but not in the current one.
864 * When searching for $(FILE), we will find it in $(INSTALLDIR)
865 * b/c we added it here. This is not good...
869 Dir_AddDir (path, name);
873 ln = Lst_Last (path);
875 return ((char *) NULL);
877 p = (Path *) Lst_Datum (ln);
880 if (Hash_FindEntry (&p->files, cp) != (Hash_Entry *)NULL) {
881 return (estrdup (name));
883 return ((char *) NULL);
886 DEBUGF(DIR, ("Looking for \"%s\"...", name));
889 entry = Hash_FindEntry(&mtimes, name);
890 if (entry != (Hash_Entry *)NULL) {
891 DEBUGF(DIR, ("got it (in mtime cache)\n"));
892 return (estrdup(name));
893 } else if (stat (name, &stb) == 0) {
894 entry = Hash_CreateEntry(&mtimes, name, (Boolean *)NULL);
895 DEBUGF(DIR, ("Caching %s for %s\n", Targ_FmtTime(stb.st_mtime), name));
896 Hash_SetValue(entry, (long)stb.st_mtime);
897 return (estrdup (name));
899 DEBUGF(DIR, ("failed. Returning NULL\n"));
900 return ((char *)NULL);
906 *-----------------------------------------------------------------------
908 * Find the modification time of the file described by gn along the
909 * search path dirSearchPath.
912 * The modification time or 0 if it doesn't exist
915 * The modification time is placed in the node's mtime slot.
916 * If the node didn't have a path entry before, and Dir_FindFile
917 * found one for it, the full name is placed in the path slot.
918 *-----------------------------------------------------------------------
921 Dir_MTime (GNode *gn)
923 char *fullName; /* the full pathname of name */
924 struct stat stb; /* buffer for finding the mod time */
927 if (gn->type & OP_ARCHV) {
928 return Arch_MTime (gn);
929 } else if (gn->path == (char *)NULL) {
930 fullName = Dir_FindFile (gn->name, dirSearchPath);
935 if (fullName == (char *)NULL) {
936 fullName = estrdup(gn->name);
939 entry = Hash_FindEntry(&mtimes, fullName);
940 if (entry != (Hash_Entry *)NULL) {
942 * Only do this once -- the second time folks are checking to
943 * see if the file was actually updated, so we need to actually go
946 DEBUGF(DIR, ("Using cached time %s for %s\n",
947 Targ_FmtTime((time_t)(long)Hash_GetValue(entry)), fullName));
948 stb.st_mtime = (time_t)(long)Hash_GetValue(entry);
949 Hash_DeleteEntry(&mtimes, entry);
950 } else if (stat (fullName, &stb) < 0) {
951 if (gn->type & OP_MEMBER) {
952 if (fullName != gn->path)
954 return Arch_MemMTime (gn);
959 if (fullName && gn->path == (char *)NULL) {
963 gn->mtime = stb.st_mtime;
968 *-----------------------------------------------------------------------
970 * Add the given name to the end of the given path. The order of
971 * the arguments is backwards so ParseDoDependency can do a
972 * Lst_ForEach of its list of paths...
978 * A structure is added to the list and the directory is
980 *-----------------------------------------------------------------------
983 Dir_AddDir (Lst path, char *name)
985 LstNode ln; /* node in case Path structure is found */
986 Path *p; /* pointer to new Path structure */
987 DIR *d; /* for reading directory */
988 struct dirent *dp; /* entry in directory */
990 ln = Lst_Find (openDirectories, (void *)name, DirFindName);
992 p = (Path *)Lst_Datum (ln);
993 if (Lst_Member(path, (void *)p) == NULL) {
995 (void)Lst_AtEnd (path, (void *)p);
998 DEBUGF(DIR, ("Caching %s...", name));
1000 if ((d = opendir (name)) != (DIR *) NULL) {
1001 p = (Path *) emalloc (sizeof (Path));
1002 p->name = estrdup (name);
1005 Hash_InitTable (&p->files, -1);
1007 while ((dp = readdir (d)) != (struct dirent *) NULL) {
1008 #if defined(sun) && defined(d_ino) /* d_ino is a sunos4 #define for d_fileno */
1010 * The sun directory library doesn't check for a 0 inode
1011 * (0-inode slots just take up space), so we have to do
1014 if (dp->d_fileno == 0) {
1017 #endif /* sun && d_ino */
1019 /* Skip the '.' and '..' entries by checking for them
1020 * specifically instead of assuming readdir() reuturns them in
1021 * that order when first going through a directory. This is
1022 * needed for XFS over NFS filesystems since SGI does not
1023 * guarantee that these are the first two entries returned
1026 if (ISDOT(dp->d_name) || ISDOTDOT(dp->d_name))
1029 (void)Hash_CreateEntry(&p->files, dp->d_name, (Boolean *)NULL);
1031 (void) closedir (d);
1032 (void)Lst_AtEnd (openDirectories, (void *)p);
1033 (void)Lst_AtEnd (path, (void *)p);
1035 DEBUGF(DIR, ("done\n"));
1040 *-----------------------------------------------------------------------
1042 * Callback function for duplicating a search path via Lst_Duplicate.
1043 * Ups the reference count for the directory.
1046 * Returns the Path it was given.
1049 * The refCount of the path is incremented.
1051 *-----------------------------------------------------------------------
1054 Dir_CopyDir(void *p)
1056 ((Path *) p)->refCount += 1;
1062 *-----------------------------------------------------------------------
1064 * Make a string by taking all the directories in the given search
1065 * path and preceding them by the given flag. Used by the suffix
1066 * module to create variables for compilers based on suffix search
1070 * The string mentioned above. Note that there is no space between
1071 * the given flag and each directory. The empty string is returned if
1072 * Things don't go well.
1076 *-----------------------------------------------------------------------
1079 Dir_MakeFlags (char *flag, Lst path)
1081 char *str; /* the string which will be returned */
1082 char *tstr; /* the current directory preceded by 'flag' */
1084 LstNode ln; /* the node of the current directory */
1085 Path *p; /* the structure describing the current directory */
1089 if (Lst_Open (path) == SUCCESS) {
1090 while ((ln = Lst_Next (path)) != NULL) {
1091 p = (Path *) Lst_Datum (ln);
1092 tstr = str_concat (flag, p->name, 0);
1093 nstr = str_concat (str, tstr, STR_ADDSPACE);
1105 *-----------------------------------------------------------------------
1107 * Nuke a directory descriptor, if possible. Callback procedure
1108 * for the suffixes module when destroying a search path.
1114 * If no other path references this directory (refCount == 0),
1115 * the Path and all its data are freed.
1117 *-----------------------------------------------------------------------
1120 Dir_Destroy (void *pp)
1122 Path *p = (Path *) pp;
1125 if (p->refCount == 0) {
1128 ln = Lst_Member (openDirectories, (void *)p);
1129 (void) Lst_Remove (openDirectories, ln);
1131 Hash_DeleteTable (&p->files);
1138 *-----------------------------------------------------------------------
1140 * Clear out all elements of the given search path. This is different
1141 * from destroying the list, notice.
1147 * The path is set to the empty list.
1149 *-----------------------------------------------------------------------
1152 Dir_ClearPath(Lst path)
1155 while (!Lst_IsEmpty(path)) {
1156 p = (Path *)Lst_DeQueue(path);
1157 Dir_Destroy((void *) p);
1163 *-----------------------------------------------------------------------
1165 * Concatenate two paths, adding the second to the end of the first.
1166 * Makes sure to avoid duplicates.
1172 * Reference counts for added dirs are upped.
1174 *-----------------------------------------------------------------------
1177 Dir_Concat(Lst path1, Lst path2)
1182 for (ln = Lst_First(path2); ln != NULL; ln = Lst_Succ(ln)) {
1183 p = (Path *)Lst_Datum(ln);
1184 if (Lst_Member(path1, (void *)p) == NULL) {
1186 (void)Lst_AtEnd(path1, (void *)p);
1191 /********** DEBUG INFO **********/
1193 Dir_PrintDirectories(void)
1198 printf ("#*** Directory Cache:\n");
1199 printf ("# Stats: %d hits %d misses %d near misses %d losers (%d%%)\n",
1200 hits, misses, nearmisses, bigmisses,
1201 (hits+bigmisses+nearmisses ?
1202 hits * 100 / (hits + bigmisses + nearmisses) : 0));
1203 printf ("# %-20s referenced\thits\n", "directory");
1204 if (Lst_Open (openDirectories) == SUCCESS) {
1205 while ((ln = Lst_Next (openDirectories)) != NULL) {
1206 p = (Path *) Lst_Datum (ln);
1207 printf ("# %-20s %10d\t%4d\n", p->name, p->refCount, p->hits);
1209 Lst_Close (openDirectories);
1214 DirPrintDir (void *p, void *dummy __unused)
1216 printf ("%s ", ((Path *) p)->name);
1222 Dir_PrintPath (Lst path)
1224 Lst_ForEach (path, DirPrintDir, (void *)0);