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.25 2004/12/17 08:06:12 okumoto 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 static int misses; /* Sad, but not evil misses */
176 static int nearmisses; /* Found under search path */
177 static int bigmisses; /* Sought by itself */
179 static Path *dot; /* contents of current directory */
181 /* Results of doing a last-resort stat in Dir_FindFile --
182 * if we have to go to the system to find the file, we might as well
183 * have its mtime on record.
184 * XXX: If this is done way early, there's a chance other rules will
185 * have already updated the file, in which case we'll update it again.
186 * Generally, there won't be two rules to update a single file, so this
187 * should be ok, but...
189 static Hash_Table mtimes;
191 static int DirPrintWord(void *, void *);
192 static int DirPrintDir(void *, void *);
195 *-----------------------------------------------------------------------
197 * initialize things for this module
204 *-----------------------------------------------------------------------
210 dirSearchPath = Lst_Init();
211 openDirectories = Lst_Init();
212 Hash_InitTable(&mtimes, 0);
216 *-----------------------------------------------------------------------
218 * initialize the "." directory
224 * some directories may be opened.
225 *-----------------------------------------------------------------------
232 Dir_AddDir(openDirectories, ".");
233 if ((ln = Lst_Last(openDirectories)) == NULL)
234 err(1, "cannot open current directory");
238 * We always need to have dot around, so we increment its
239 * reference count to make sure it's not destroyed.
245 *-----------------------------------------------------------------------
247 * cleanup things for this module
254 *-----------------------------------------------------------------------
262 Dir_ClearPath(dirSearchPath);
263 Lst_Destroy(dirSearchPath, NOFREE);
264 Dir_ClearPath(openDirectories);
265 Lst_Destroy(openDirectories, NOFREE);
266 Hash_DeleteTable(&mtimes);
270 *-----------------------------------------------------------------------
272 * See if the Path structure describes the same directory as the
273 * given one by comparing their names. Called from Dir_AddDir via
274 * Lst_Find when searching the list of open directories.
277 * 0 if it is the same. Non-zero otherwise
281 *-----------------------------------------------------------------------
284 DirFindName(const void *p, const void *dname)
287 return (strcmp(((const Path *)p)->name, dname));
291 *-----------------------------------------------------------------------
292 * Dir_HasWildcards --
293 * See if the given name has any wildcard characters in it.
296 * returns TRUE if the word should be expanded, FALSE otherwise
300 *-----------------------------------------------------------------------
303 Dir_HasWildcards(const char *name)
306 int wild = 0, brace = 0, bracket = 0;
308 for (cp = name; *cp; cp++) {
332 return (wild && bracket == 0 && brace == 0);
336 *-----------------------------------------------------------------------
338 * Given a pattern and a Path structure, see if any files
339 * match the pattern and add their names to the 'expansions' list if
340 * any do. This is incomplete -- it doesn't take care of patterns like
341 * src / *src / *.c properly (just *.c on any of the directories), but it
348 * File names are added to the expansions lst. The directory will be
349 * fully hashed when this is done.
350 *-----------------------------------------------------------------------
353 DirMatchFiles(const char *pattern, const Path *p, Lst *expansions)
355 Hash_Search search; /* Index into the directory's table */
356 Hash_Entry *entry; /* Current entry in the table */
357 Boolean isDot; /* TRUE if the directory being searched is . */
359 isDot = (*p->name == '.' && p->name[1] == '\0');
361 for (entry = Hash_EnumFirst(&p->files, &search);
363 entry = Hash_EnumNext(&search)) {
365 * See if the file matches the given pattern. Note we follow
366 * the UNIX convention that dot files will only be found if
367 * the pattern begins with a dot (note also that as a side
368 * effect of the hashing scheme, .* won't match . or ..
369 * since they aren't hashed).
371 if (Str_Match(entry->name, pattern) &&
372 ((entry->name[0] != '.') ||
373 (pattern[0] == '.'))) {
374 Lst_AtEnd(expansions, (isDot ? estrdup(entry->name) :
375 str_concat(p->name, entry->name, STR_ADDSLASH)));
382 *-----------------------------------------------------------------------
384 * Expand curly braces like the C shell. Does this recursively.
385 * Note the special case: if after the piece of the curly brace is
386 * done there are no wildcard characters in the result, the result is
387 * placed on the list WITHOUT CHECKING FOR ITS EXISTENCE. The
388 * given arguments are the entire word to expand, the first curly
389 * brace in the word, the search path, and the list to store the
396 * The given list is filled with the expansions...
398 *-----------------------------------------------------------------------
401 DirExpandCurly(const char *word, const char *brace, Lst *path, Lst *expansions)
403 const char *end; /* Character after the closing brace */
404 const char *cp; /* Current position in brace clause */
405 const char *start; /* Start of current piece of brace clause */
406 int bracelevel; /* Number of braces we've seen. If we see a right brace
407 * when this is 0, we've hit the end of the clause. */
408 char *file; /* Current expansion */
409 int otherLen; /* The length of the other pieces of the expansion
410 * (chars before and after the clause in 'word') */
411 char *cp2; /* Pointer for checking for wildcards in
412 * expansion before calling Dir_Expand */
417 * Find the end of the brace clause first, being wary of nested brace
420 for (end = start, bracelevel = 0; *end != '\0'; end++) {
423 else if ((*end == '}') && (bracelevel-- == 0))
427 Error("Unterminated {} clause \"%s\"", start);
432 otherLen = brace - word + strlen(end);
434 for (cp = start; cp < end; cp++) {
436 * Find the end of this piece of the clause.
442 else if ((*cp == '}') && (bracelevel-- <= 0))
447 * Allocate room for the combination and install the
450 file = emalloc(otherLen + cp - start + 1);
452 strncpy(file, word, brace - word);
454 strncpy(&file[brace - word], start, cp - start);
455 strcpy(&file[(brace - word) + (cp - start)], end);
458 * See if the result has any wildcards in it. If we find one,
459 * call Dir_Expand right away, telling it to place the result
460 * on our list of expansions.
462 for (cp2 = file; *cp2 != '\0'; cp2++) {
468 Dir_Expand(file, path, expansions);
476 * Hit the end w/o finding any wildcards, so stick
477 * the expansion on the end of the list.
479 Lst_AtEnd(expansions, file);
489 *-----------------------------------------------------------------------
491 * Internal expand routine. Passes through the directories in the
492 * path one by one, calling DirMatchFiles for each. NOTE: This still
493 * doesn't handle patterns in directories... Works given a word to
494 * expand, a path to look in, and a list to store expansions in.
500 * Things are added to the expansions list.
502 *-----------------------------------------------------------------------
505 DirExpandInt(const char *word, Lst *path, Lst *expansions)
507 LstNode *ln; /* Current node */
509 for (ln = Lst_First(path); ln != NULL; ln = Lst_Succ(ln))
510 DirMatchFiles(word, (Path *)Lst_Datum(ln), expansions);
514 *-----------------------------------------------------------------------
516 * Print a word in the list of expansions. Callback for Dir_Expand
517 * when DEBUG(DIR), via Lst_ForEach.
523 * The passed word is printed, followed by a space.
525 *-----------------------------------------------------------------------
528 DirPrintWord(void *word, void *dummy __unused)
531 DEBUGF(DIR, ("%s ", (char *)word));
537 *-----------------------------------------------------------------------
539 * Expand the given word into a list of words by globbing it looking
540 * in the directories on the given search path.
543 * A list of words consisting of the files which exist along the search
544 * path matching the given pattern is placed in expansions.
547 * Directories may be opened. Who knows?
548 *-----------------------------------------------------------------------
551 Dir_Expand(char *word, Lst *path, Lst *expansions)
555 DEBUGF(DIR, ("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
565 * first wildcard in the string.
567 for (cp = word; *cp != '\0'; cp++) {
568 if (*cp == '?' || *cp == '[' ||
569 *cp == '*' || *cp == '{') {
575 * This one will be fun.
577 DirExpandCurly(word, cp, path, expansions);
579 } else if (*cp != '\0') {
581 * Back up to the start of the component
585 while (cp > word && *cp != '/')
591 * If the glob isn't in the first
592 * component, try and find all the
593 * components up to the one with a
598 dirpath = Dir_FindFile(word, path);
601 * dirpath is null if can't find the
603 * XXX: Dir_FindFile won't find internal
604 * components. i.e. if the path contains
605 * ../Etc/Object and we're looking for
606 * Etc, * it won't be found. Ah well.
607 * Probably not important.
609 if (dirpath != NULL) {
611 &dirpath[strlen(dirpath)
617 Dir_AddDir(path, dirpath);
618 DirExpandInt(cp + 1, path,
620 Lst_Destroy(path, NOFREE);
624 * Start the search from the local
627 DirExpandInt(word, path, expansions);
631 * Return the file -- this should never happen.
633 DirExpandInt(word, path, expansions);
637 * First the files in dot
639 DirMatchFiles(word, dot, expansions);
642 * Then the files in every other directory on the path.
644 DirExpandInt(word, path, expansions);
648 Lst_ForEach(expansions, DirPrintWord, (void *)NULL);
654 *-----------------------------------------------------------------------
656 * Find the file with the given name along the given search path.
659 * The path to the file or NULL. This path is guaranteed to be in a
660 * different part of memory than name and so may be safely free'd.
663 * If the file is found in a directory which is not on the path
664 * already (either 'name' is absolute or it is a relative path
665 * [ dir1/.../dirn/file ] which exists below one of the directories
666 * already on the search path), its directory is added to the end
667 * of the path on the assumption that there will be more files in
668 * that directory later on. Sometimes this is true. Sometimes not.
669 *-----------------------------------------------------------------------
672 Dir_FindFile(char *name, Lst *path)
674 char *p1; /* pointer into p->name */
675 char *p2; /* pointer into name */
676 LstNode *ln; /* a list element */
677 char *file; /* the current filename to check */
678 Path *p; /* current path member */
679 char *cp; /* final component of the name */
680 Boolean hasSlash; /* true if 'name' contains a / */
681 struct stat stb; /* Buffer for stat, if necessary */
682 Hash_Entry *entry; /* Entry for mtimes table */
685 * Find the final component of the name and note whether it has a
686 * slash in it (the name, I mean)
688 cp = strrchr(name, '/');
697 DEBUGF(DIR, ("Searching for %s...", name));
699 * No matter what, we always look for the file in the current directory
700 * before anywhere else and we *do not* add the ./ to it if it exists.
701 * This is so there are no conflicts between what the user specifies
702 * (fish.c) and what pmake finds (./fish.c).
704 if ((!hasSlash || (cp - name == 2 && *name == '.')) &&
705 (Hash_FindEntry(&dot->files, cp) != NULL)) {
706 DEBUGF(DIR, ("in '.'\n"));
709 return (estrdup(name));
713 * We look through all the directories on the path seeking one which
714 * contains the final component of the given name and whose final
715 * component(s) match the name's initial component(s). If such a beast
716 * is found, we concatenate the directory name and the final component
717 * and return the resulting string. If we don't find any such thing,
718 * we go on to phase two...
720 for (ln = Lst_First(path); ln != NULL; ln = Lst_Succ(ln)) {
722 DEBUGF(DIR, ("%s...", p->name));
723 if (Hash_FindEntry(&p->files, cp) != NULL) {
724 DEBUGF(DIR, ("here..."));
727 * If the name had a slash, its initial
728 * components and p's final components must
729 * match. This is false if a mismatch is
730 * encountered before all of the initial
731 * components have been checked (p2 > name at
732 * the end of the loop), or we matched only
733 * part of one of the components of p
734 * along with all the rest of them (*p1 != '/').
736 p1 = p->name + strlen(p->name) - 1;
738 while (p2 >= name && p1 >= p->name &&
742 if (p2 >= name || (p1 >= p->name &&
744 DEBUGF(DIR, ("component mismatch -- "
749 file = str_concat(p->name, cp, STR_ADDSLASH);
750 DEBUGF(DIR, ("returning %s\n", file));
754 } else if (hasSlash) {
756 * If the file has a leading path component and that
757 * component exactly matches the entire name of the
758 * current search directory, we assume the file
759 * doesn't exist and return NULL.
761 for (p1 = p->name, p2 = name; *p1 && *p1 == *p2;
764 if (*p1 == '\0' && p2 == cp - 1) {
765 if (*cp == '\0' || ISDOT(cp) || ISDOTDOT(cp)) {
766 DEBUGF(DIR, ("returning %s\n", name));
767 return (estrdup(name));
769 DEBUGF(DIR, ("must be here but isn't --"
770 " returning NULL\n"));
778 * We didn't find the file on any existing members of the directory.
779 * If the name doesn't contain a slash, that means it doesn't exist.
780 * If it *does* contain a slash, however, there is still hope: it
781 * could be in a subdirectory of one of the members of the search
782 * path. (eg. /usr/include and sys/types.h. The above search would
783 * fail to turn up types.h in /usr/include, but it *is* in
784 * /usr/include/sys/types.h) If we find such a beast, we assume there
785 * will be more (what else can we assume?) and add all but the last
786 * component of the resulting name onto the search path (at the
787 * end). This phase is only performed if the file is *not* absolute.
790 DEBUGF(DIR, ("failed.\n"));
796 Boolean checkedDot = FALSE;
798 DEBUGF(DIR, ("failed. Trying subdirectories..."));
799 for (ln = Lst_First(path); ln != NULL; ln = Lst_Succ(ln)) {
802 file = str_concat(p->name, name, STR_ADDSLASH);
805 * Checking in dot -- DON'T put a leading ./
808 file = estrdup(name);
811 DEBUGF(DIR, ("checking %s...", file));
813 if (stat(file, &stb) == 0) {
814 DEBUGF(DIR, ("got it.\n"));
817 * We've found another directory to search. We
818 * know there's a slash in 'file' because we put
819 * one there. We nuke it after finding it and
820 * call Dir_AddDir to add this new directory
821 * onto the existing search path. Once that's
822 * done, we restore the slash and triumphantly
823 * return the file name, knowing that should a
824 * file in this directory every be referenced
825 * again in such a manner, we will find it
826 * without having to do numerous numbers of
827 * access calls. Hurrah!
829 cp = strrchr(file, '/');
831 Dir_AddDir(path, file);
835 * Save the modification time so if
836 * it's needed, we don't have to fetch it again.
838 DEBUGF(DIR, ("Caching %s for %s\n",
839 Targ_FmtTime(stb.st_mtime), file));
840 entry = Hash_CreateEntry(&mtimes, file,
843 (void *)(long)stb.st_mtime);
851 DEBUGF(DIR, ("failed. "));
855 * Already checked by the given name, since . was in
856 * the path, so no point in proceeding...
858 DEBUGF(DIR, ("Checked . already, returning NULL\n"));
864 * Didn't find it that way, either. Sigh. Phase 3. Add its directory
865 * onto the search path in any case, just in case, then look for the
866 * thing in the hash table. If we find it, grand. We return a new
867 * copy of the name. Otherwise we sadly return a NULL pointer. Sigh.
868 * Note that if the directory holding the file doesn't exist, this will
869 * do an extra search of the final directory on the path. Unless
870 * something weird happens, this search won't succeed and life will
873 * Sigh. We cannot add the directory onto the search path because
874 * of this amusing case:
875 * $(INSTALLDIR)/$(FILE): $(FILE)
877 * $(FILE) exists in $(INSTALLDIR) but not in the current one.
878 * When searching for $(FILE), we will find it in $(INSTALLDIR)
879 * b/c we added it here. This is not good...
883 Dir_AddDir(path, name);
893 if (Hash_FindEntry(&p->files, cp) != NULL) {
894 return (estrdup(name));
898 DEBUGF(DIR, ("Looking for \"%s\"...", name));
901 entry = Hash_FindEntry(&mtimes, name);
903 DEBUGF(DIR, ("got it (in mtime cache)\n"));
904 return (estrdup(name));
905 } else if (stat (name, &stb) == 0) {
906 entry = Hash_CreateEntry(&mtimes, name, (Boolean *)NULL);
907 DEBUGF(DIR, ("Caching %s for %s\n",
908 Targ_FmtTime(stb.st_mtime), name));
909 Hash_SetValue(entry, (void *)(long)stb.st_mtime);
910 return (estrdup(name));
912 DEBUGF(DIR, ("failed. Returning NULL\n"));
919 *-----------------------------------------------------------------------
921 * Find the modification time of the file described by gn along the
922 * search path dirSearchPath.
925 * The modification time or 0 if it doesn't exist
928 * The modification time is placed in the node's mtime slot.
929 * If the node didn't have a path entry before, and Dir_FindFile
930 * found one for it, the full name is placed in the path slot.
931 *-----------------------------------------------------------------------
936 char *fullName; /* the full pathname of name */
937 struct stat stb; /* buffer for finding the mod time */
940 if (gn->type & OP_ARCHV)
941 return (Arch_MTime(gn));
943 else if (gn->path == NULL)
944 fullName = Dir_FindFile(gn->name, dirSearchPath);
948 if (fullName == NULL)
949 fullName = estrdup(gn->name);
951 entry = Hash_FindEntry(&mtimes, fullName);
954 * Only do this once -- the second time folks are checking to
955 * see if the file was actually updated, so we need to
956 * actually go to the filesystem.
958 DEBUGF(DIR, ("Using cached time %s for %s\n",
959 Targ_FmtTime((time_t)(long)Hash_GetValue(entry)),
961 stb.st_mtime = (time_t)(long)Hash_GetValue(entry);
962 Hash_DeleteEntry(&mtimes, entry);
963 } else if (stat(fullName, &stb) < 0) {
964 if (gn->type & OP_MEMBER) {
965 if (fullName != gn->path)
967 return (Arch_MemMTime(gn));
972 if (fullName && gn->path == (char *)NULL)
975 gn->mtime = stb.st_mtime;
980 *-----------------------------------------------------------------------
982 * Add the given name to the end of the given path. The order of
983 * the arguments is backwards so ParseDoDependency can do a
984 * Lst_ForEach of its list of paths...
990 * A structure is added to the list and the directory is
992 *-----------------------------------------------------------------------
995 Dir_AddDir(Lst *path, char *name)
997 LstNode *ln; /* node in case Path structure is found */
998 Path *p; /* pointer to new Path structure */
999 DIR *d; /* for reading directory */
1000 struct dirent *dp; /* entry in directory */
1002 ln = Lst_Find(openDirectories, name, DirFindName);
1005 if (Lst_Member(path, p) == NULL) {
1010 DEBUGF(DIR, ("Caching %s...", name));
1012 if ((d = opendir(name)) != NULL) {
1013 p = emalloc(sizeof(Path));
1014 p->name = estrdup(name);
1017 Hash_InitTable(&p->files, -1);
1019 while ((dp = readdir(d)) != NULL) {
1020 #if defined(sun) && defined(d_ino) /* d_ino is a sunos4 #define for d_fileno */
1022 * The sun directory library doesn't check for
1023 * a 0 inode (0-inode slots just take up space),
1024 * so we have to do it ourselves.
1026 if (dp->d_fileno == 0)
1028 #endif /* sun && d_ino */
1030 /* Skip the '.' and '..' entries by checking
1031 * for them specifically instead of assuming
1032 * readdir() reuturns them in that order when
1033 * first going through a directory. This is
1034 * needed for XFS over NFS filesystems since
1035 * SGI does not guarantee that these are the
1036 * first two entries returned from readdir().
1038 if (ISDOT(dp->d_name) || ISDOTDOT(dp->d_name))
1041 Hash_CreateEntry(&p->files, dp->d_name,
1045 Lst_AtEnd(openDirectories, p);
1046 if (path != openDirectories)
1049 DEBUGF(DIR, ("done\n"));
1054 *-----------------------------------------------------------------------
1056 * Callback function for duplicating a search path via Lst_Duplicate.
1057 * Ups the reference count for the directory.
1060 * Returns the Path it was given.
1063 * The refCount of the path is incremented.
1065 *-----------------------------------------------------------------------
1068 Dir_CopyDir(void *p)
1071 ((Path *)p)->refCount += 1;
1077 *-----------------------------------------------------------------------
1079 * Make a string by taking all the directories in the given search
1080 * path and preceding them by the given flag. Used by the suffix
1081 * module to create variables for compilers based on suffix search
1085 * The string mentioned above. Note that there is no space between
1086 * the given flag and each directory. The empty string is returned if
1087 * Things don't go well.
1091 *-----------------------------------------------------------------------
1094 Dir_MakeFlags(char *flag, Lst *path)
1096 char *str; /* the string which will be returned */
1097 char *tstr; /* the current directory preceded by 'flag' */
1099 LstNode *ln; /* the node of the current directory */
1100 Path *p; /* the structure describing the current directory */
1104 for (ln = Lst_First(path); ln != NULL; ln = Lst_Succ(ln)) {
1106 tstr = str_concat(flag, p->name, 0);
1107 nstr = str_concat(str, tstr, STR_ADDSPACE);
1117 *-----------------------------------------------------------------------
1119 * Nuke a directory descriptor, if possible. Callback procedure
1120 * for the suffixes module when destroying a search path.
1126 * If no other path references this directory (refCount == 0),
1127 * the Path and all its data are freed.
1129 *-----------------------------------------------------------------------
1132 Dir_Destroy(void *pp)
1138 if (p->refCount == 0) {
1141 if ((ln = Lst_Member(openDirectories, p)) != NULL)
1142 Lst_Remove(openDirectories, ln);
1144 Hash_DeleteTable(&p->files);
1151 *-----------------------------------------------------------------------
1153 * Clear out all elements of the given search path. This is different
1154 * from destroying the list, notice.
1160 * The path is set to the empty list.
1162 *-----------------------------------------------------------------------
1165 Dir_ClearPath(Lst *path)
1169 while (!Lst_IsEmpty(path)) {
1170 p = Lst_DeQueue(path);
1177 *-----------------------------------------------------------------------
1179 * Concatenate two paths, adding the second to the end of the first.
1180 * Makes sure to avoid duplicates.
1186 * Reference counts for added dirs are upped.
1188 *-----------------------------------------------------------------------
1191 Dir_Concat(Lst *path1, Lst *path2)
1196 for (ln = Lst_First(path2); ln != NULL; ln = Lst_Succ(ln)) {
1198 if (Lst_Member(path1, p) == NULL) {
1200 Lst_AtEnd(path1, p);
1205 /********** DEBUG INFO **********/
1207 Dir_PrintDirectories(void)
1212 printf("#*** Directory Cache:\n");
1213 printf("# Stats: %d hits %d misses %d near misses %d losers (%d%%)\n",
1214 hits, misses, nearmisses, bigmisses,
1215 (hits + bigmisses + nearmisses ?
1216 hits * 100 / (hits + bigmisses + nearmisses) : 0));
1217 printf("# %-20s referenced\thits\n", "directory");
1218 for (ln = Lst_First(openDirectories); ln != NULL; ln = Lst_Succ(ln)) {
1220 printf("# %-20s %10d\t%4d\n", p->name, p->refCount, p->hits);
1225 DirPrintDir(void *p, void *dummy __unused)
1228 printf("%s ", ((Path *)p)->name);
1234 Dir_PrintPath(Lst *path)
1237 Lst_ForEach(path, DirPrintDir, (void *)NULL);