2 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
3 * Copyright (c) 1988, 1989 by Adam de Boor
4 * Copyright (c) 1989 by Berkeley Softworks
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)dir.c 8.2 (Berkeley) 1/2/94
39 * $FreeBSD: src/usr.bin/make/dir.c,v 1.10.2.1 2001/02/13 03:13:57 will Exp $
40 * $DragonFly: src/usr.bin/make/dir.c,v 1.3 2003/11/03 19:31:30 eirikn Exp $
45 * Directory searching using wildcards and/or normal names...
46 * Used both for source wildcarding in the Makefile and for finding
49 * The interface for this module is:
50 * Dir_Init Initialize the module.
52 * Dir_End Cleanup the module.
54 * Dir_HasWildcards Returns TRUE if the name given it needs to
55 * be wildcard-expanded.
57 * Dir_Expand Given a pattern and a path, return a Lst of names
58 * which match the pattern on the search path.
60 * Dir_FindFile Searches for a file on a given search path.
61 * If it exists, the entire path is returned.
62 * Otherwise NULL is returned.
64 * Dir_MTime Return the modification time of a node. The file
65 * is searched for along the default search path.
66 * The path and mtime fields of the node are filled
69 * Dir_AddDir Add a directory to a search path.
71 * Dir_MakeFlags Given a search path and a command flag, create
72 * a string with each of the directories in the path
73 * preceded by the command flag and all of them
74 * separated by a space.
76 * Dir_Destroy Destroy an element of a search path. Frees up all
77 * things that can be freed for the element as long
78 * as the element is no longer referenced by any other
80 * Dir_ClearPath Resets a search path to the empty list.
83 * Dir_PrintDirectories Print stats about the directory cache.
87 #include <sys/types.h>
95 * A search path consists of a Lst of Path structures. A Path structure
96 * has in it the name of the directory and a hash table of all the files
97 * in the directory. This is used to cut down on the number of system
98 * calls necessary to find implicit dependents and their like. Since
99 * these searches are made before any actions are taken, we need not
100 * worry about the directory changing due to creation commands. If this
101 * hampers the style of some makefiles, they must be changed.
103 * A list of all previously-read directories is kept in the
104 * openDirectories Lst. This list is checked first before a directory
107 * The need for the caching of whole directories is brought about by
108 * the multi-level transformation code in suff.c, which tends to search
109 * for far more files than regular make does. In the initial
110 * implementation, the amount of time spent performing "stat" calls was
111 * truly astronomical. The problem with hashing at the start is,
112 * of course, that pmake doesn't then detect changes to these directories
113 * during the course of the make. Three possibilities suggest themselves:
115 * 1) just use stat to test for a file's existence. As mentioned
116 * above, this is very inefficient due to the number of checks
117 * engendered by the multi-level transformation code.
118 * 2) use readdir() and company to search the directories, keeping
119 * them open between checks. I have tried this and while it
120 * didn't slow down the process too much, it could severely
121 * affect the amount of parallelism available as each directory
122 * open would take another file descriptor out of play for
123 * handling I/O for another job. Given that it is only recently
124 * that UNIX OS's have taken to allowing more than 20 or 32
125 * file descriptors for a process, this doesn't seem acceptable
127 * 3) record the mtime of the directory in the Path structure and
128 * verify the directory hasn't changed since the contents were
129 * hashed. This will catch the creation or deletion of files,
130 * but not the updating of files. However, since it is the
131 * creation and deletion that is the problem, this could be
132 * a good thing to do. Unfortunately, if the directory (say ".")
133 * were fairly large and changed fairly frequently, the constant
134 * rehashing could seriously degrade performance. It might be
135 * good in such cases to keep track of the number of rehashes
136 * and if the number goes over a (small) limit, resort to using
139 * An additional thing to consider is that pmake is used primarily
140 * to create C programs and until recently pcc-based compilers refused
141 * to allow you to specify where the resulting object file should be
142 * placed. This forced all objects to be created in the current
143 * directory. This isn't meant as a full excuse, just an explanation of
144 * some of the reasons for the caching used here.
146 * One more note: the location of a target's file is only performed
147 * on the downward traversal of the graph and then only for terminal
148 * nodes in the graph. This could be construed as wrong in some cases,
149 * but prevents inadvertent modification of files when the "installed"
150 * directory for a file is provided in the search path.
152 * Another data structure maintained by this module is an mtime
153 * cache used when the searching of cached directories fails to find
154 * a file. In the past, Dir_FindFile would simply perform an access()
155 * call in such a case to determine if the file could be found using
156 * just the name given. When this hit, however, all that was gained
157 * was the knowledge that the file existed. Given that an access() is
158 * essentially a stat() without the copyout() call, and that the same
159 * filesystem overhead would have to be incurred in Dir_MTime, it made
160 * sense to replace the access() with a stat() and record the mtime
161 * in a cache for when Dir_MTime was actually called.
164 Lst dirSearchPath; /* main search path */
166 static Lst openDirectories; /* the list of all open directories */
169 * Variables for gathering statistics on the efficiency of the hashing
172 static int hits, /* Found in directory cache */
173 misses, /* Sad, but not evil misses */
174 nearmisses, /* Found under search path */
175 bigmisses; /* Sought by itself */
177 static Path *dot; /* contents of current directory */
178 static Hash_Table mtimes; /* Results of doing a last-resort stat in
179 * Dir_FindFile -- if we have to go to the
180 * system to find the file, we might as well
181 * have its mtime on record. XXX: If this is done
182 * way early, there's a chance other rules will
183 * have already updated the file, in which case
184 * we'll update it again. Generally, there won't
185 * be two rules to update a single file, so this
186 * should be ok, but... */
189 static int DirFindName(ClientData, ClientData);
190 static int DirMatchFiles(char *, Path *, Lst);
191 static void DirExpandCurly(char *, char *, Lst, Lst);
192 static void DirExpandInt(char *, Lst, Lst);
193 static int DirPrintWord(ClientData, ClientData);
194 static int DirPrintDir(ClientData, ClientData);
197 *-----------------------------------------------------------------------
199 * initialize things for this module
205 * some directories may be opened.
206 *-----------------------------------------------------------------------
211 dirSearchPath = Lst_Init (FALSE);
212 openDirectories = Lst_Init (FALSE);
213 Hash_InitTable(&mtimes, 0);
216 * Since the Path structure is placed on both openDirectories and
217 * the path we give Dir_AddDir (which in this case is openDirectories),
218 * we need to remove "." from openDirectories and what better time to
219 * do it than when we have to fetch the thing anyway?
221 Dir_AddDir (openDirectories, ".");
222 dot = (Path *) Lst_DeQueue (openDirectories);
223 if (dot == (Path *) NULL)
224 err(1, "cannot open current directory");
227 * We always need to have dot around, so we increment its reference count
228 * to make sure it's not destroyed.
234 *-----------------------------------------------------------------------
236 * cleanup things for this module
243 *-----------------------------------------------------------------------
249 Dir_Destroy((ClientData) dot);
250 Dir_ClearPath(dirSearchPath);
251 Lst_Destroy(dirSearchPath, NOFREE);
252 Dir_ClearPath(openDirectories);
253 Lst_Destroy(openDirectories, NOFREE);
254 Hash_DeleteTable(&mtimes);
258 *-----------------------------------------------------------------------
260 * See if the Path structure describes the same directory as the
261 * given one by comparing their names. Called from Dir_AddDir via
262 * Lst_Find when searching the list of open directories.
265 * 0 if it is the same. Non-zero otherwise
269 *-----------------------------------------------------------------------
272 DirFindName (p, dname)
273 ClientData p; /* Current name */
274 ClientData dname; /* Desired name */
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 (name)
293 char *name; /* name to check */
297 for (cp = name; *cp; cp++) {
310 *-----------------------------------------------------------------------
312 * Given a pattern and a Path structure, see if any files
313 * match the pattern and add their names to the 'expansions' list if
314 * any do. This is incomplete -- it doesn't take care of patterns like
315 * src / *src / *.c properly (just *.c on any of the directories), but it
322 * File names are added to the expansions lst. The directory will be
323 * fully hashed when this is done.
324 *-----------------------------------------------------------------------
327 DirMatchFiles (pattern, p, expansions)
328 char *pattern; /* Pattern to look for */
329 Path *p; /* Directory to search */
330 Lst expansions; /* Place to store the results */
332 Hash_Search search; /* Index into the directory's table */
333 Hash_Entry *entry; /* Current entry in the table */
334 Boolean isDot; /* TRUE if the directory being searched is . */
336 isDot = (*p->name == '.' && p->name[1] == '\0');
338 for (entry = Hash_EnumFirst(&p->files, &search);
339 entry != (Hash_Entry *)NULL;
340 entry = Hash_EnumNext(&search))
343 * See if the file matches the given pattern. Note we follow the UNIX
344 * convention that dot files will only be found if the pattern
345 * begins with a dot (note also that as a side effect of the hashing
346 * scheme, .* won't match . or .. since they aren't hashed).
348 if (Str_Match(entry->name, pattern) &&
349 ((entry->name[0] != '.') ||
350 (pattern[0] == '.')))
352 (void)Lst_AtEnd(expansions,
353 (isDot ? estrdup(entry->name) :
354 str_concat(p->name, entry->name,
362 *-----------------------------------------------------------------------
364 * Expand curly braces like the C shell. Does this recursively.
365 * Note the special case: if after the piece of the curly brace is
366 * done there are no wildcard characters in the result, the result is
367 * placed on the list WITHOUT CHECKING FOR ITS EXISTENCE.
373 * The given list is filled with the expansions...
375 *-----------------------------------------------------------------------
378 DirExpandCurly(word, brace, path, expansions)
379 char *word; /* Entire word to expand */
380 char *brace; /* First curly brace in it */
381 Lst path; /* Search path to use */
382 Lst expansions; /* Place to store the expansions */
384 char *end; /* Character after the closing brace */
385 char *cp; /* Current position in brace clause */
386 char *start; /* Start of current piece of brace clause */
387 int bracelevel; /* Number of braces we've seen. If we see a
388 * right brace when this is 0, we've hit the
389 * end of the clause. */
390 char *file; /* Current expansion */
391 int otherLen; /* The length of the other pieces of the
392 * expansion (chars before and after the
393 * clause in 'word') */
394 char *cp2; /* Pointer for checking for wildcards in
395 * expansion before calling Dir_Expand */
400 * Find the end of the brace clause first, being wary of nested brace
403 for (end = start, bracelevel = 0; *end != '\0'; end++) {
406 } else if ((*end == '}') && (bracelevel-- == 0)) {
411 Error("Unterminated {} clause \"%s\"", start);
416 otherLen = brace - word + strlen(end);
418 for (cp = start; cp < end; cp++) {
420 * Find the end of this piece of the clause.
426 } else if ((*cp == '}') && (bracelevel-- <= 0)) {
432 * Allocate room for the combination and install the three pieces.
434 file = emalloc(otherLen + cp - start + 1);
436 strncpy(file, word, brace-word);
439 strncpy(&file[brace-word], start, cp-start);
441 strcpy(&file[(brace-word)+(cp-start)], end);
444 * See if the result has any wildcards in it. If we find one, call
445 * Dir_Expand right away, telling it to place the result on our list
448 for (cp2 = file; *cp2 != '\0'; cp2++) {
454 Dir_Expand(file, path, expansions);
460 * Hit the end w/o finding any wildcards, so stick the expansion
461 * on the end of the list.
463 (void)Lst_AtEnd(expansions, file);
474 *-----------------------------------------------------------------------
476 * Internal expand routine. Passes through the directories in the
477 * path one by one, calling DirMatchFiles for each. NOTE: This still
478 * doesn't handle patterns in directories...
484 * Things are added to the expansions list.
486 *-----------------------------------------------------------------------
489 DirExpandInt(word, path, expansions)
490 char *word; /* Word to expand */
491 Lst path; /* Path on which to look */
492 Lst expansions; /* Place to store the result */
494 LstNode ln; /* Current node */
495 Path *p; /* Directory in the node */
497 if (Lst_Open(path) == SUCCESS) {
498 while ((ln = Lst_Next(path)) != NILLNODE) {
499 p = (Path *)Lst_Datum(ln);
500 DirMatchFiles(word, p, expansions);
507 *-----------------------------------------------------------------------
509 * Print a word in the list of expansions. Callback for Dir_Expand
510 * when DEBUG(DIR), via Lst_ForEach.
516 * The passed word is printed, followed by a space.
518 *-----------------------------------------------------------------------
521 DirPrintWord(word, dummy)
525 printf("%s ", (char *) word);
527 return(dummy ? 0 : 0);
531 *-----------------------------------------------------------------------
533 * Expand the given word into a list of words by globbing it looking
534 * in the directories on the given search path.
537 * A list of words consisting of the files which exist along the search
538 * path matching the given pattern.
541 * Directories may be opened. Who knows?
542 *-----------------------------------------------------------------------
545 Dir_Expand (word, path, expansions)
546 char *word; /* the word to expand */
547 Lst path; /* the list of directories in which to find
548 * the resulting files */
549 Lst expansions; /* the list on which to place the results */
554 printf("expanding \"%s\"...", word);
557 cp = strchr(word, '{');
559 DirExpandCurly(word, cp, path, expansions);
561 cp = strchr(word, '/');
564 * The thing has a directory component -- find the first wildcard
567 for (cp = word; *cp; cp++) {
568 if (*cp == '?' || *cp == '[' || *cp == '*' || *cp == '{') {
574 * This one will be fun.
576 DirExpandCurly(word, cp, path, expansions);
578 } else if (*cp != '\0') {
580 * Back up to the start of the component
584 while (cp > word && *cp != '/') {
590 * If the glob isn't in the first component, try and find
591 * all the components up to the one with a wildcard.
595 dirpath = Dir_FindFile(word, path);
598 * dirpath is null if can't find the leading component
599 * XXX: Dir_FindFile won't find internal components.
600 * i.e. if the path contains ../Etc/Object and we're
601 * looking for Etc, it won't be found. Ah well.
602 * Probably not important.
604 if (dirpath != (char *)NULL) {
605 char *dp = &dirpath[strlen(dirpath) - 1];
608 path = Lst_Init(FALSE);
609 Dir_AddDir(path, dirpath);
610 DirExpandInt(cp+1, path, expansions);
611 Lst_Destroy(path, NOFREE);
615 * Start the search from the local directory
617 DirExpandInt(word, path, expansions);
621 * Return the file -- this should never happen.
623 DirExpandInt(word, path, expansions);
627 * First the files in dot
629 DirMatchFiles(word, dot, expansions);
632 * Then the files in every other directory on the path.
634 DirExpandInt(word, path, expansions);
638 Lst_ForEach(expansions, DirPrintWord, (ClientData) 0);
644 *-----------------------------------------------------------------------
646 * Find the file with the given name along the given search path.
649 * The path to the file or NULL. This path is guaranteed to be in a
650 * different part of memory than name and so may be safely free'd.
653 * If the file is found in a directory which is not on the path
654 * already (either 'name' is absolute or it is a relative path
655 * [ dir1/.../dirn/file ] which exists below one of the directories
656 * already on the search path), its directory is added to the end
657 * of the path on the assumption that there will be more files in
658 * that directory later on. Sometimes this is true. Sometimes not.
659 *-----------------------------------------------------------------------
662 Dir_FindFile (name, path)
663 char *name; /* the file to find */
664 Lst path; /* the Lst of directories to search */
666 register char *p1; /* pointer into p->name */
667 register char *p2; /* pointer into name */
668 LstNode ln; /* a list element */
669 register char *file; /* the current filename to check */
670 register Path *p; /* current path member */
671 register char *cp; /* index of first slash, if any */
672 Boolean hasSlash; /* true if 'name' contains a / */
673 struct stat stb; /* Buffer for stat, if necessary */
674 Hash_Entry *entry; /* Entry for mtimes table */
677 * Find the final component of the name and note whether it has a
678 * slash in it (the name, I mean)
680 cp = strrchr (name, '/');
690 printf("Searching for %s...", name);
693 * No matter what, we always look for the file in the current directory
694 * before anywhere else and we *do not* add the ./ to it if it exists.
695 * This is so there are no conflicts between what the user specifies
696 * (fish.c) and what pmake finds (./fish.c).
698 if ((!hasSlash || (cp - name == 2 && *name == '.')) &&
699 (Hash_FindEntry (&dot->files, cp) != (Hash_Entry *)NULL)) {
705 return (estrdup (name));
708 if (Lst_Open (path) == FAILURE) {
710 printf("couldn't open path, file not found\n");
713 return ((char *) NULL);
717 * We look through all the directories on the path seeking one which
718 * contains the final component of the given name and whose final
719 * component(s) match the name's initial component(s). If such a beast
720 * is found, we concatenate the directory name and the final component
721 * and return the resulting string. If we don't find any such thing,
722 * we go on to phase two...
724 while ((ln = Lst_Next (path)) != NILLNODE) {
725 p = (Path *) Lst_Datum (ln);
727 printf("%s...", p->name);
729 if (Hash_FindEntry (&p->files, cp) != (Hash_Entry *)NULL) {
735 * If the name had a slash, its initial components and p's
736 * final components must match. This is false if a mismatch
737 * is encountered before all of the initial components
738 * have been checked (p2 > name at the end of the loop), or
739 * we matched only part of one of the components of p
740 * along with all the rest of them (*p1 != '/').
742 p1 = p->name + strlen (p->name) - 1;
744 while (p2 >= name && p1 >= p->name && *p1 == *p2) {
747 if (p2 >= name || (p1 >= p->name && *p1 != '/')) {
749 printf("component mismatch -- continuing...");
754 file = str_concat (p->name, cp, STR_ADDSLASH);
756 printf("returning %s\n", file);
762 } else if (hasSlash) {
764 * If the file has a leading path component and that component
765 * exactly matches the entire name of the current search
766 * directory, we assume the file doesn't exist and return NULL.
768 for (p1 = p->name, p2 = name; *p1 && *p1 == *p2; p1++, p2++) {
771 if (*p1 == '\0' && p2 == cp - 1) {
773 printf("must be here but isn't -- returing NULL\n");
776 return ((char *) NULL);
782 * We didn't find the file on any existing members of the directory.
783 * If the name doesn't contain a slash, that means it doesn't exist.
784 * If it *does* contain a slash, however, there is still hope: it
785 * could be in a subdirectory of one of the members of the search
786 * path. (eg. /usr/include and sys/types.h. The above search would
787 * fail to turn up types.h in /usr/include, but it *is* in
788 * /usr/include/sys/types.h) If we find such a beast, we assume there
789 * will be more (what else can we assume?) and add all but the last
790 * component of the resulting name onto the search path (at the
791 * end). This phase is only performed if the file is *not* absolute.
798 return ((char *) NULL);
802 Boolean checkedDot = FALSE;
805 printf("failed. Trying subdirectories...");
807 (void) Lst_Open (path);
808 while ((ln = Lst_Next (path)) != NILLNODE) {
809 p = (Path *) Lst_Datum (ln);
811 file = str_concat (p->name, name, STR_ADDSLASH);
814 * Checking in dot -- DON'T put a leading ./ on the thing.
816 file = estrdup(name);
820 printf("checking %s...", file);
824 if (stat (file, &stb) == 0) {
832 * We've found another directory to search. We know there's
833 * a slash in 'file' because we put one there. We nuke it after
834 * finding it and call Dir_AddDir to add this new directory
835 * onto the existing search path. Once that's done, we restore
836 * the slash and triumphantly return the file name, knowing
837 * that should a file in this directory every be referenced
838 * again in such a manner, we will find it without having to do
839 * numerous numbers of access calls. Hurrah!
841 cp = strrchr (file, '/');
843 Dir_AddDir (path, file);
847 * Save the modification time so if it's needed, we don't have
851 printf("Caching %s for %s\n", Targ_FmtTime(stb.st_mtime),
854 entry = Hash_CreateEntry(&mtimes, (char *) file,
856 Hash_SetValue(entry, (long)stb.st_mtime);
871 * Already checked by the given name, since . was in the path,
872 * so no point in proceeding...
875 printf("Checked . already, returning NULL\n");
882 * Didn't find it that way, either. Sigh. Phase 3. Add its directory
883 * onto the search path in any case, just in case, then look for the
884 * thing in the hash table. If we find it, grand. We return a new
885 * copy of the name. Otherwise we sadly return a NULL pointer. Sigh.
886 * Note that if the directory holding the file doesn't exist, this will
887 * do an extra search of the final directory on the path. Unless something
888 * weird happens, this search won't succeed and life will be groovy.
890 * Sigh. We cannot add the directory onto the search path because
891 * of this amusing case:
892 * $(INSTALLDIR)/$(FILE): $(FILE)
894 * $(FILE) exists in $(INSTALLDIR) but not in the current one.
895 * When searching for $(FILE), we will find it in $(INSTALLDIR)
896 * b/c we added it here. This is not good...
900 Dir_AddDir (path, name);
904 ln = Lst_Last (path);
905 if (ln == NILLNODE) {
906 return ((char *) NULL);
908 p = (Path *) Lst_Datum (ln);
911 if (Hash_FindEntry (&p->files, cp) != (Hash_Entry *)NULL) {
912 return (estrdup (name));
914 return ((char *) NULL);
918 printf("Looking for \"%s\"...", name);
922 entry = Hash_FindEntry(&mtimes, name);
923 if (entry != (Hash_Entry *)NULL) {
925 printf("got it (in mtime cache)\n");
927 return(estrdup(name));
928 } else if (stat (name, &stb) == 0) {
929 entry = Hash_CreateEntry(&mtimes, name, (Boolean *)NULL);
931 printf("Caching %s for %s\n", Targ_FmtTime(stb.st_mtime),
934 Hash_SetValue(entry, (long)stb.st_mtime);
935 return (estrdup (name));
938 printf("failed. Returning NULL\n");
940 return ((char *)NULL);
946 *-----------------------------------------------------------------------
948 * Find the modification time of the file described by gn along the
949 * search path dirSearchPath.
952 * The modification time or 0 if it doesn't exist
955 * The modification time is placed in the node's mtime slot.
956 * If the node didn't have a path entry before, and Dir_FindFile
957 * found one for it, the full name is placed in the path slot.
958 *-----------------------------------------------------------------------
962 GNode *gn; /* the file whose modification time is
965 char *fullName; /* the full pathname of name */
966 struct stat stb; /* buffer for finding the mod time */
969 if (gn->type & OP_ARCHV) {
970 return Arch_MTime (gn);
971 } else if (gn->path == (char *)NULL) {
972 fullName = Dir_FindFile (gn->name, dirSearchPath);
977 if (fullName == (char *)NULL) {
978 fullName = estrdup(gn->name);
981 entry = Hash_FindEntry(&mtimes, fullName);
982 if (entry != (Hash_Entry *)NULL) {
984 * Only do this once -- the second time folks are checking to
985 * see if the file was actually updated, so we need to actually go
986 * to the file system.
989 printf("Using cached time %s for %s\n",
990 Targ_FmtTime((time_t)(long)Hash_GetValue(entry)), fullName);
992 stb.st_mtime = (time_t)(long)Hash_GetValue(entry);
993 Hash_DeleteEntry(&mtimes, entry);
994 } else if (stat (fullName, &stb) < 0) {
995 if (gn->type & OP_MEMBER) {
996 if (fullName != gn->path)
998 return Arch_MemMTime (gn);
1003 if (fullName && gn->path == (char *)NULL) {
1004 gn->path = fullName;
1007 gn->mtime = stb.st_mtime;
1012 *-----------------------------------------------------------------------
1014 * Add the given name to the end of the given path. The order of
1015 * the arguments is backwards so ParseDoDependency can do a
1016 * Lst_ForEach of its list of paths...
1022 * A structure is added to the list and the directory is
1024 *-----------------------------------------------------------------------
1027 Dir_AddDir (path, name)
1028 Lst path; /* the path to which the directory should be
1030 char *name; /* the name of the directory to add */
1032 LstNode ln; /* node in case Path structure is found */
1033 register Path *p; /* pointer to new Path structure */
1034 DIR *d; /* for reading directory */
1035 register struct dirent *dp; /* entry in directory */
1037 ln = Lst_Find (openDirectories, (ClientData)name, DirFindName);
1038 if (ln != NILLNODE) {
1039 p = (Path *)Lst_Datum (ln);
1040 if (Lst_Member(path, (ClientData)p) == NILLNODE) {
1042 (void)Lst_AtEnd (path, (ClientData)p);
1046 printf("Caching %s...", name);
1050 if ((d = opendir (name)) != (DIR *) NULL) {
1051 p = (Path *) emalloc (sizeof (Path));
1052 p->name = estrdup (name);
1055 Hash_InitTable (&p->files, -1);
1057 while ((dp = readdir (d)) != (struct dirent *) NULL) {
1058 #if defined(sun) && defined(d_ino) /* d_ino is a sunos4 #define for d_fileno */
1060 * The sun directory library doesn't check for a 0 inode
1061 * (0-inode slots just take up space), so we have to do
1064 if (dp->d_fileno == 0) {
1067 #endif /* sun && d_ino */
1069 /* Skip the '.' and '..' entries by checking for them
1070 * specifically instead of assuming readdir() reuturns them in
1071 * that order when first going through a directory. This is
1072 * needed for XFS over NFS filesystems since SGI does not
1073 * guarantee that these are * the first two entries returned
1076 if (ISDOT(dp->d_name) || ISDOTDOT(dp->d_name))
1079 (void)Hash_CreateEntry(&p->files, dp->d_name, (Boolean *)NULL);
1081 (void) closedir (d);
1082 (void)Lst_AtEnd (openDirectories, (ClientData)p);
1083 (void)Lst_AtEnd (path, (ClientData)p);
1092 *-----------------------------------------------------------------------
1094 * Callback function for duplicating a search path via Lst_Duplicate.
1095 * Ups the reference count for the directory.
1098 * Returns the Path it was given.
1101 * The refCount of the path is incremented.
1103 *-----------------------------------------------------------------------
1109 ((Path *) p)->refCount += 1;
1111 return ((ClientData)p);
1115 *-----------------------------------------------------------------------
1117 * Make a string by taking all the directories in the given search
1118 * path and preceding them by the given flag. Used by the suffix
1119 * module to create variables for compilers based on suffix search
1123 * The string mentioned above. Note that there is no space between
1124 * the given flag and each directory. The empty string is returned if
1125 * Things don't go well.
1129 *-----------------------------------------------------------------------
1132 Dir_MakeFlags (flag, path)
1133 char *flag; /* flag which should precede each directory */
1134 Lst path; /* list of directories */
1136 char *str; /* the string which will be returned */
1137 char *tstr; /* the current directory preceded by 'flag' */
1138 LstNode ln; /* the node of the current directory */
1139 Path *p; /* the structure describing the current directory */
1143 if (Lst_Open (path) == SUCCESS) {
1144 while ((ln = Lst_Next (path)) != NILLNODE) {
1145 p = (Path *) Lst_Datum (ln);
1146 tstr = str_concat (flag, p->name, 0);
1147 str = str_concat (str, tstr, STR_ADDSPACE | STR_DOFREE);
1156 *-----------------------------------------------------------------------
1158 * Nuke a directory descriptor, if possible. Callback procedure
1159 * for the suffixes module when destroying a search path.
1165 * If no other path references this directory (refCount == 0),
1166 * the Path and all its data are freed.
1168 *-----------------------------------------------------------------------
1172 ClientData pp; /* The directory descriptor to nuke */
1174 Path *p = (Path *) pp;
1177 if (p->refCount == 0) {
1180 ln = Lst_Member (openDirectories, (ClientData)p);
1181 (void) Lst_Remove (openDirectories, ln);
1183 Hash_DeleteTable (&p->files);
1184 free((Address)p->name);
1190 *-----------------------------------------------------------------------
1192 * Clear out all elements of the given search path. This is different
1193 * from destroying the list, notice.
1199 * The path is set to the empty list.
1201 *-----------------------------------------------------------------------
1205 Lst path; /* Path to clear */
1208 while (!Lst_IsEmpty(path)) {
1209 p = (Path *)Lst_DeQueue(path);
1210 Dir_Destroy((ClientData) p);
1216 *-----------------------------------------------------------------------
1218 * Concatenate two paths, adding the second to the end of the first.
1219 * Makes sure to avoid duplicates.
1225 * Reference counts for added dirs are upped.
1227 *-----------------------------------------------------------------------
1230 Dir_Concat(path1, path2)
1231 Lst path1; /* Dest */
1232 Lst path2; /* Source */
1237 for (ln = Lst_First(path2); ln != NILLNODE; ln = Lst_Succ(ln)) {
1238 p = (Path *)Lst_Datum(ln);
1239 if (Lst_Member(path1, (ClientData)p) == NILLNODE) {
1241 (void)Lst_AtEnd(path1, (ClientData)p);
1246 /********** DEBUG INFO **********/
1248 Dir_PrintDirectories()
1253 printf ("#*** Directory Cache:\n");
1254 printf ("# Stats: %d hits %d misses %d near misses %d losers (%d%%)\n",
1255 hits, misses, nearmisses, bigmisses,
1256 (hits+bigmisses+nearmisses ?
1257 hits * 100 / (hits + bigmisses + nearmisses) : 0));
1258 printf ("# %-20s referenced\thits\n", "directory");
1259 if (Lst_Open (openDirectories) == SUCCESS) {
1260 while ((ln = Lst_Next (openDirectories)) != NILLNODE) {
1261 p = (Path *) Lst_Datum (ln);
1262 printf ("# %-20s %10d\t%4d\n", p->name, p->refCount, p->hits);
1264 Lst_Close (openDirectories);
1268 static int DirPrintDir (p, dummy)
1272 printf ("%s ", ((Path *) p)->name);
1273 return (dummy ? 0 : 0);
1277 Dir_PrintPath (path)
1280 Lst_ForEach (path, DirPrintDir, (ClientData)0);