1 /* $NetBSD: dir.c,v 1.278 2022/02/04 23:22:19 rillig Exp $ */
4 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1988, 1989 by Adam de Boor
37 * Copyright (c) 1989 by Berkeley Softworks
38 * All rights reserved.
40 * This code is derived from software contributed to Berkeley by
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
73 * Directory searching using wildcards and/or normal names.
74 * Used both for source wildcarding in the makefile and for finding
77 * The interface for this module is:
78 * Dir_Init Initialize the module.
80 * Dir_InitCur Set the cur CachedDir.
82 * Dir_InitDot Set the dot CachedDir.
84 * Dir_End Clean up the module.
86 * Dir_SetPATH Set ${.PATH} to reflect state of dirSearchPath.
89 * Returns true if the name given it needs to
90 * be wildcard-expanded.
93 * Expand a filename pattern to find all matching files
94 * from the search path.
96 * Dir_FindFile Searches for a file on a given search path.
97 * If it exists, the entire path is returned.
98 * Otherwise NULL is returned.
100 * Dir_FindHereOrAbove
101 * Search for a path in the current directory and
102 * then all the directories above it in turn until
103 * the path is found or we reach the root ("/").
106 * Update the modification time and path of a node with
107 * data from the file corresponding to the node.
109 * SearchPath_Add Add a directory to a search path.
112 * Given a search path and a command flag, create
113 * a string with each of the directories in the path
114 * preceded by the command flag and all of them
115 * separated by a space.
117 * Dir_Destroy Destroy an element of a search path. Frees up all
118 * things that can be freed for the element as long
119 * as the element is no longer referenced by any other
123 * Resets a search path to the empty list.
126 * Dir_PrintDirectories
127 * Print stats about the directory cache.
130 #include <sys/types.h>
131 #include <sys/stat.h>
140 /* "@(#)dir.c 8.2 (Berkeley) 1/2/94" */
141 MAKE_RCSID("$NetBSD: dir.c,v 1.278 2022/02/04 23:22:19 rillig Exp $");
144 * A search path is a list of CachedDir structures. A CachedDir has in it the
145 * name of the directory and the names of all the files in the directory.
146 * This is used to cut down on the number of system calls necessary to find
147 * implicit dependents and their like. Since these searches are made before
148 * any actions are taken, we need not worry about the directory changing due
149 * to creation commands. If this hampers the style of some makefiles, they
152 * All previously-read directories are kept in openDirs, which is checked
153 * first before a directory is opened.
155 * The need for the caching of whole directories is brought about by the
156 * multi-level transformation code in suff.c, which tends to search for far
157 * more files than regular make does. In the initial implementation, the
158 * amount of time spent performing "stat" calls was truly astronomical.
159 * The problem with caching at the start is, of course, that pmake doesn't
160 * then detect changes to these directories during the course of the make.
161 * Three possibilities suggest themselves:
163 * 1) just use stat to test for a file's existence. As mentioned above,
164 * this is very inefficient due to the number of checks engendered by
165 * the multi-level transformation code.
167 * 2) use readdir() and company to search the directories, keeping them
168 * open between checks. I have tried this and while it didn't slow down
169 * the process too much, it could severely affect the amount of
170 * parallelism available as each directory open would take another file
171 * descriptor out of play for handling I/O for another job. Given that
172 * it is only recently (as of 1993 or earlier) that UNIX OS's have taken
173 * to allowing more than 20 or 32 file descriptors for a process, this
174 * doesn't seem acceptable to me.
176 * 3) record the mtime of the directory in the CachedDir structure and
177 * verify the directory hasn't changed since the contents were cached.
178 * This will catch the creation or deletion of files, but not the
179 * updating of files. However, since it is the creation and deletion
180 * that is the problem, this could be a good thing to do. Unfortunately,
181 * if the directory (say ".") were fairly large and changed fairly
182 * frequently, the constant reloading could seriously degrade
183 * performance. It might be good in such cases to keep track of the
184 * number of reloadings and if the number goes over a (small) limit,
185 * resort to using stat in its place.
187 * An additional thing to consider is that pmake is used primarily to create
188 * C programs and until recently (as of 1993 or earlier) pcc-based compilers
189 * refused to allow you to specify where the resulting object file should be
190 * placed. This forced all objects to be created in the current directory.
191 * This isn't meant as a full excuse, just an explanation of some of the
192 * reasons for the caching used here.
194 * One more note: the location of a target's file is only performed on the
195 * downward traversal of the graph and then only for terminal nodes in the
196 * graph. This could be construed as wrong in some cases, but prevents
197 * inadvertent modification of files when the "installed" directory for a
198 * file is provided in the search path.
200 * Another data structure maintained by this module is an mtime cache used
201 * when the searching of cached directories fails to find a file. In the past,
202 * Dir_FindFile would simply perform an access() call in such a case to
203 * determine if the file could be found using just the name given. When this
204 * hit, however, all that was gained was the knowledge that the file existed.
205 * Given that an access() is essentially a stat() without the copyout() call,
206 * and that the same filesystem overhead would have to be incurred in
207 * Dir_MTime, it made sense to replace the access() with a stat() and record
208 * the mtime in a cache for when Dir_UpdateMTime was actually called.
212 /* A cache for the filenames in a directory. */
215 * Name of directory, either absolute or relative to the current
216 * directory. The name is not normalized in any way, that is, "."
217 * and "./." are different.
219 * Not sure what happens when .CURDIR is assigned a new value; see
225 * The number of SearchPaths that refer to this directory.
226 * Plus the number of global variables that refer to this directory.
227 * References from openDirs do not count though.
231 /* The number of times a file in this directory has been found. */
234 /* The names of the directory entries. */
238 typedef List CachedDirList;
239 typedef ListNode CachedDirListNode;
241 typedef ListNode SearchPathNode;
243 /* A list of cached directories, with fast lookup by directory name. */
244 typedef struct OpenDirs {
246 HashTable /* of CachedDirListNode */ table;
250 SearchPath dirSearchPath = { LST_INIT }; /* main search path */
252 static OpenDirs openDirs; /* all cached directories */
255 * Variables for gathering statistics on the efficiency of the caching
258 static int hits; /* Found in directory cache */
259 static int misses; /* Sad, but not evil misses */
260 static int nearmisses; /* Found under search path */
261 static int bigmisses; /* Sought by itself */
263 /* The cached contents of ".", the relative current directory. */
264 static CachedDir *dot = NULL;
265 /* The cached contents of the absolute current directory. */
266 static CachedDir *cur = NULL;
267 /* A fake path entry indicating we need to look for '.' last. */
268 static CachedDir *dotLast = NULL;
271 * Results of doing a last-resort stat in Dir_FindFile -- if we have to go to
272 * the system to find the file, we might as well have its mtime on record.
274 * XXX: If this is done way early, there's a chance other rules will have
275 * already updated the file, in which case we'll update it again. Generally,
276 * there won't be two rules to update a single file, so this should be ok,
279 static HashTable mtimes;
281 static HashTable lmtimes; /* same as mtimes but for lstat */
284 static void OpenDirs_Remove(OpenDirs *, const char *);
288 CachedDir_New(const char *name)
290 CachedDir *dir = bmake_malloc(sizeof *dir);
292 dir->name = bmake_strdup(name);
295 HashSet_Init(&dir->files);
298 DEBUG2(DIR, "CachedDir %p new for \"%s\"\n", dir, dir->name);
305 CachedDir_Ref(CachedDir *dir)
310 DEBUG3(DIR, "CachedDir %p ++ %d for \"%s\"\n",
311 dir, dir->refCount, dir->name);
318 CachedDir_Unref(CachedDir *dir)
323 DEBUG3(DIR, "CachedDir %p -- %d for \"%s\"\n",
324 dir, dir->refCount, dir->name);
327 if (dir->refCount > 0)
331 DEBUG2(DIR, "CachedDir %p free for \"%s\"\n", dir, dir->name);
334 OpenDirs_Remove(&openDirs, dir->name);
337 HashSet_Done(&dir->files);
341 /* Update the value of the CachedDir variable, updating the reference counts. */
343 CachedDir_Assign(CachedDir **var, CachedDir *dir)
352 CachedDir_Unref(prev);
356 OpenDirs_Init(OpenDirs *odirs)
358 Lst_Init(&odirs->list);
359 HashTable_Init(&odirs->table);
364 OpenDirs_Done(OpenDirs *odirs)
366 CachedDirListNode *ln = odirs->list.first;
367 DEBUG1(DIR, "OpenDirs_Done: %u entries to remove\n",
368 odirs->table.numEntries);
370 CachedDirListNode *next = ln->next;
371 CachedDir *dir = ln->datum;
372 DEBUG2(DIR, "OpenDirs_Done: refCount %d for \"%s\"\n",
373 dir->refCount, dir->name);
374 CachedDir_Unref(dir); /* removes the dir from odirs->list */
377 Lst_Done(&odirs->list);
378 HashTable_Done(&odirs->table);
383 OpenDirs_Find(OpenDirs *odirs, const char *name)
385 CachedDirListNode *ln = HashTable_FindValue(&odirs->table, name);
386 return ln != NULL ? ln->datum : NULL;
390 OpenDirs_Add(OpenDirs *odirs, CachedDir *cdir)
392 if (HashTable_FindEntry(&odirs->table, cdir->name) != NULL)
394 Lst_Append(&odirs->list, cdir);
395 HashTable_Set(&odirs->table, cdir->name, odirs->list.last);
399 OpenDirs_Remove(OpenDirs *odirs, const char *name)
401 HashEntry *he = HashTable_FindEntry(&odirs->table, name);
402 CachedDirListNode *ln;
405 ln = HashEntry_Get(he);
406 HashTable_DeleteEntry(&odirs->table, he);
407 Lst_Remove(&odirs->list, ln);
411 * Returns 0 and the result of stat(2) or lstat(2) in *out_cst,
415 cached_stats(const char *pathname, struct cached_stat *out_cst,
416 bool useLstat, bool forceRefresh)
418 HashTable *tbl = useLstat ? &lmtimes : &mtimes;
420 struct cached_stat *cst;
423 if (pathname == NULL || pathname[0] == '\0')
424 return -1; /* This can happen in meta mode. */
426 cst = HashTable_FindValue(tbl, pathname);
427 if (cst != NULL && !forceRefresh) {
429 DEBUG2(DIR, "Using cached time %s for %s\n",
430 Targ_FmtTime(cst->cst_mtime), pathname);
434 rc = (useLstat ? lstat : stat)(pathname, &sys_st);
436 return -1; /* don't cache negative lookups */
438 if (sys_st.st_mtime == 0)
439 sys_st.st_mtime = 1; /* avoid confusion with missing file */
442 cst = bmake_malloc(sizeof *cst);
443 HashTable_Set(tbl, pathname, cst);
446 cst->cst_mtime = sys_st.st_mtime;
447 cst->cst_mode = sys_st.st_mode;
450 DEBUG2(DIR, " Caching %s for %s\n",
451 Targ_FmtTime(sys_st.st_mtime), pathname);
457 cached_stat(const char *pathname, struct cached_stat *cst)
459 return cached_stats(pathname, cst, false, false);
463 cached_lstat(const char *pathname, struct cached_stat *cst)
465 return cached_stats(pathname, cst, true, false);
468 /* Initialize the directories module. */
472 OpenDirs_Init(&openDirs);
473 HashTable_Init(&mtimes);
474 HashTable_Init(&lmtimes);
475 CachedDir_Assign(&dotLast, CachedDir_New(".DOTLAST"));
479 * Called by Dir_InitDir and whenever .CURDIR is assigned to.
482 Dir_InitCur(const char *newCurdir)
486 if (newCurdir == NULL)
490 * Our build directory is not the same as our source directory.
491 * Keep this one around too.
493 dir = SearchPath_Add(NULL, newCurdir);
497 CachedDir_Assign(&cur, dir);
501 * (Re)initialize "dot" (current/object directory) path hash.
502 * Some directories may be cached.
509 dir = SearchPath_Add(NULL, ".");
511 Error("Cannot open `.' (%s)", strerror(errno));
512 exit(2); /* Not 1 so -q can distinguish error */
515 CachedDir_Assign(&dot, dir);
517 Dir_SetPATH(); /* initialize */
520 /* Clean up the directories module. */
525 CachedDir_Assign(&cur, NULL);
526 CachedDir_Assign(&dot, NULL);
527 CachedDir_Assign(&dotLast, NULL);
528 SearchPath_Clear(&dirSearchPath);
529 OpenDirs_Done(&openDirs);
530 HashTable_Done(&mtimes);
531 HashTable_Done(&lmtimes);
536 * We want ${.PATH} to indicate the order in which we will actually
537 * search, so we rebuild it after any .PATH: target.
538 * This is the simplest way to deal with the effect of .DOTLAST.
543 CachedDirListNode *ln;
544 bool seenDotLast = false; /* true if we should search '.' last */
546 Global_Delete(".PATH");
548 if ((ln = dirSearchPath.dirs.first) != NULL) {
549 CachedDir *dir = ln->datum;
550 if (dir == dotLast) {
552 Global_Append(".PATH", dotLast->name);
558 Global_Append(".PATH", dot->name);
560 Global_Append(".PATH", cur->name);
563 for (ln = dirSearchPath.dirs.first; ln != NULL; ln = ln->next) {
564 CachedDir *dir = ln->datum;
567 if (dir == dot && seenDotLast)
569 Global_Append(".PATH", dir->name);
574 Global_Append(".PATH", dot->name);
576 Global_Append(".PATH", cur->name);
581 * See if the given name has any wildcard characters in it and all braces and
582 * brackets are properly balanced.
584 * XXX: This code is not 100% correct ([^]] fails etc.). I really don't think
585 * that make(1) should be expanding patterns, because then you have to set a
586 * mechanism for escaping the expansion!
588 * Return true if the word should be expanded, false otherwise.
591 Dir_HasWildcards(const char *name)
595 int braces = 0, brackets = 0;
597 for (p = name; *p != '\0'; p++) {
621 return wild && brackets == 0 && braces == 0;
625 * See if any files match the pattern and add their names to the 'expansions'
628 * This is incomplete -- wildcards are only expanded in the final path
629 * component, but not in directories like src/lib*c/file*.c, but it
630 * will do for now (now being 1993 until at least 2020). To expand these,
631 * delegate the work to the shell, using the '!=' variable assignment
632 * operator, the ':sh' variable modifier or the ':!...!' variable modifier,
633 * such as in ${:!echo src/lib*c/file*.c!}.
636 * pattern Pattern to look for
637 * dir Directory to search
638 * expansion Place to store the results
641 DirMatchFiles(const char *pattern, CachedDir *dir, StringList *expansions)
643 const char *dirName = dir->name;
644 bool isDot = dirName[0] == '.' && dirName[1] == '\0';
648 * XXX: Iterating over all hash entries is inefficient. If the
649 * pattern is a plain string without any wildcards, a direct lookup
653 HashIter_InitSet(&hi, &dir->files);
654 while (HashIter_Next(&hi) != NULL) {
655 const char *base = hi.entry->key;
657 if (!Str_Match(base, pattern))
661 * Follow the UNIX convention that dot files are only found
662 * if the pattern begins with a dot. The pattern '.*' does
663 * not match '.' or '..' since these are not included in the
666 * This means that the pattern '[a-z.]*' does not find
667 * '.file', which is consistent with NetBSD sh, NetBSD ksh,
668 * bash, dash, csh and probably many other shells as well.
670 if (base[0] == '.' && pattern[0] != '.')
674 char *fullName = isDot
676 : str_concat3(dirName, "/", base);
677 Lst_Append(expansions, fullName);
683 * Find the next closing brace in the string, taking nested braces into
687 closing_brace(const char *p)
691 if (*p == '}' && nest == 0)
703 * Find the next closing brace or comma in the string, taking nested braces
707 separator_comma(const char *p)
711 if ((*p == '}' || *p == ',') && nest == 0)
723 contains_wildcard(const char *p)
725 for (; *p != '\0'; p++) {
738 concat3(const char *a, size_t a_len, const char *b, size_t b_len,
739 const char *c, size_t c_len)
741 size_t s_len = a_len + b_len + c_len;
742 char *s = bmake_malloc(s_len + 1);
744 memcpy(s + a_len, b, b_len);
745 memcpy(s + a_len + b_len, c, c_len);
751 * Expand curly braces like the C shell. Brace expansion by itself is purely
752 * textual, the expansions are not looked up in the file system. But if an
753 * expanded word contains wildcard characters, it is expanded further,
754 * matching only the actually existing files.
756 * Example: "{a{b,c}}" expands to "ab" and "ac".
757 * Example: "{a}" expands to "a".
758 * Example: "{a,*.c}" expands to "a" and all "*.c" files that exist.
761 * word Entire word to expand
762 * brace First curly brace in it
763 * path Search path to use
764 * expansions Place to store the expansions
767 DirExpandCurly(const char *word, const char *brace, SearchPath *path,
768 StringList *expansions)
770 const char *prefix, *middle, *piece, *middle_end, *suffix;
771 size_t prefix_len, suffix_len;
773 /* Split the word into prefix '{' middle '}' suffix. */
776 middle_end = closing_brace(middle);
777 if (*middle_end == '\0') {
778 Error("Unterminated {} clause \"%s\"", middle);
783 prefix_len = (size_t)(brace - prefix);
784 suffix = middle_end + 1;
785 suffix_len = strlen(suffix);
787 /* Split the middle into pieces, separated by commas. */
790 while (piece < middle_end + 1) {
791 const char *piece_end = separator_comma(piece);
792 size_t piece_len = (size_t)(piece_end - piece);
794 char *file = concat3(prefix, prefix_len, piece, piece_len,
797 if (contains_wildcard(file)) {
798 SearchPath_Expand(path, file, expansions);
801 Lst_Append(expansions, file);
804 /* skip over the comma or closing brace */
805 piece = piece_end + 1;
810 /* Expand the word in each of the directories from the path. */
812 DirExpandPath(const char *word, SearchPath *path, StringList *expansions)
815 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
816 CachedDir *dir = ln->datum;
817 DirMatchFiles(word, dir, expansions);
822 PrintExpansions(StringList *expansions)
824 const char *sep = "";
826 for (ln = expansions->first; ln != NULL; ln = ln->next) {
827 const char *word = ln->datum;
828 debug_printf("%s%s", sep, word);
835 * The wildcard isn't in the first component.
836 * Find all the components up to the one with the wildcard.
839 SearchPath_ExpandMiddle(SearchPath *path, const char *pattern,
840 const char *wildcardComponent, StringList *expansions)
842 char *prefix, *dirpath, *end;
843 SearchPath *partPath;
845 prefix = bmake_strsedup(pattern, wildcardComponent + 1);
847 * XXX: Check the "the directory is added to the path" part.
848 * It is probably surprising that the directory before a
849 * wildcard gets added to the path.
852 * XXX: Only the first match of the prefix in the path is
853 * taken, any others are ignored. The expectation may be
854 * that the pattern is expanded in the whole path.
856 dirpath = Dir_FindFile(prefix, path);
860 * dirpath is null if can't find the leading component
862 * XXX: Dir_FindFile won't find internal components. i.e. if the
863 * path contains ../Etc/Object and we're looking for Etc, it won't
864 * be found. Ah well. Probably not important.
866 * XXX: Check whether the above comment is still true.
871 end = &dirpath[strlen(dirpath) - 1];
872 /* XXX: What about multiple trailing slashes? */
876 partPath = SearchPath_New();
877 (void)SearchPath_Add(partPath, dirpath);
878 DirExpandPath(wildcardComponent + 1, partPath, expansions);
879 SearchPath_Free(partPath);
883 * Expand the given pattern into a list of existing filenames by globbing it,
884 * looking in each directory from the search path.
887 * path the directories in which to find the files
888 * pattern the pattern to expand
889 * expansions the list on which to place the results
892 SearchPath_Expand(SearchPath *path, const char *pattern, StringList *expansions)
894 const char *brace, *slash, *wildcard, *wildcardComponent;
896 assert(path != NULL);
897 assert(expansions != NULL);
899 DEBUG1(DIR, "Expanding \"%s\"... ", pattern);
901 brace = strchr(pattern, '{');
903 DirExpandCurly(pattern, brace, path, expansions);
907 /* At this point, the pattern does not contain '{'. */
909 slash = strchr(pattern, '/');
911 /* The pattern has no directory component. */
913 /* First the files in dot. */
914 DirMatchFiles(pattern, dot, expansions);
915 /* Then the files in every other directory on the path. */
916 DirExpandPath(pattern, path, expansions);
920 /* At this point, the pattern has a directory component. */
922 /* Find the first wildcard in the pattern. */
923 for (wildcard = pattern; *wildcard != '\0'; wildcard++)
924 if (*wildcard == '?' || *wildcard == '[' || *wildcard == '*')
927 if (*wildcard == '\0') {
929 * No directory component and no wildcard at all -- this
930 * should never happen as in such a simple case there is no
931 * need to expand anything.
933 DirExpandPath(pattern, path, expansions);
937 /* Back up to the start of the component containing the wildcard. */
938 /* XXX: This handles '///' and '/' differently. */
939 wildcardComponent = wildcard;
940 while (wildcardComponent > pattern && *wildcardComponent != '/')
943 if (wildcardComponent == pattern) {
944 /* The first component contains the wildcard. */
945 /* Start the search from the local directory */
946 DirExpandPath(pattern, path, expansions);
948 SearchPath_ExpandMiddle(path, pattern, wildcardComponent,
954 PrintExpansions(expansions);
958 * Find if the file with the given name exists in the given path.
959 * Return the freshly allocated path to the file, or NULL.
962 DirLookup(CachedDir *dir, const char *base)
964 char *file; /* the current filename to check */
966 DEBUG1(DIR, " %s ...\n", dir->name);
968 if (!HashSet_Contains(&dir->files, base))
971 file = str_concat3(dir->name, "/", base);
972 DEBUG1(DIR, " returning %s\n", file);
980 * Find if the file with the given name exists in the given directory.
981 * Return the freshly allocated path to the file, or NULL.
984 DirLookupSubdir(CachedDir *dir, const char *name)
986 struct cached_stat cst;
987 char *file = dir == dot
989 : str_concat3(dir->name, "/", name);
991 DEBUG1(DIR, "checking %s ...\n", file);
993 if (cached_stat(file, &cst) == 0) {
1002 * Find if the file with the given name exists in the given path.
1003 * Return the freshly allocated path to the file, the empty string, or NULL.
1004 * Returning the empty string means that the search should be terminated.
1007 DirLookupAbs(CachedDir *dir, const char *name, const char *cp)
1009 const char *dnp; /* pointer into dir->name */
1010 const char *np; /* pointer into name */
1012 DEBUG1(DIR, " %s ...\n", dir->name);
1015 * If the file has a leading path component and that component
1016 * exactly matches the entire name of the current search
1017 * directory, we can attempt another cache lookup. And if we don't
1018 * have a hit, we can safely assume the file does not exist at all.
1020 for (dnp = dir->name, np = name;
1021 *dnp != '\0' && *dnp == *np; dnp++, np++)
1023 if (*dnp != '\0' || np != cp - 1)
1026 if (!HashSet_Contains(&dir->files, cp)) {
1027 DEBUG0(DIR, " must be here but isn't -- returning\n");
1028 return bmake_strdup(""); /* to terminate the search */
1033 DEBUG1(DIR, " returning %s\n", name);
1034 return bmake_strdup(name);
1038 * Find the file given on "." or curdir.
1039 * Return the freshly allocated path to the file, or NULL.
1042 DirFindDot(const char *name, const char *base)
1045 if (HashSet_Contains(&dot->files, base)) {
1046 DEBUG0(DIR, " in '.'\n");
1049 return bmake_strdup(name);
1052 if (cur != NULL && HashSet_Contains(&cur->files, base)) {
1053 DEBUG1(DIR, " in ${.CURDIR} = %s\n", cur->name);
1056 return str_concat3(cur->name, "/", base);
1063 FindFileRelative(SearchPath *path, bool seenDotLast,
1064 const char *name, char **out_file)
1067 bool checkedDot = false;
1070 DEBUG0(DIR, " Trying subdirectories...\n");
1075 if ((file = DirLookupSubdir(dot, name)) != NULL)
1079 (file = DirLookupSubdir(cur, name)) != NULL)
1083 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1084 CachedDir *dir = ln->datum;
1092 if ((file = DirLookupSubdir(dir, name)) != NULL)
1097 if (dot != NULL && !checkedDot) {
1099 if ((file = DirLookupSubdir(dot, name)) != NULL)
1103 (file = DirLookupSubdir(cur, name)) != NULL)
1109 * Already checked by the given name, since . was in
1110 * the path, so no point in proceeding.
1112 DEBUG0(DIR, " Checked . already, returning NULL\n");
1125 FindFileAbsolute(SearchPath *path, bool seenDotLast,
1126 const char *name, const char *base, char **out_file)
1132 * For absolute names, compare directory path prefix against
1133 * the the directory path of each member on the search path
1134 * for an exact match. If we have an exact match on any member
1135 * of the search path, use the cached contents of that member
1136 * to lookup the final file component. If that lookup fails we
1137 * can safely assume that the file does not exist at all.
1138 * This is signified by DirLookupAbs() returning an empty
1141 DEBUG0(DIR, " Trying exact path matches...\n");
1143 if (!seenDotLast && cur != NULL &&
1144 ((file = DirLookupAbs(cur, name, base)) != NULL))
1147 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1148 CachedDir *dir = ln->datum;
1151 if ((file = DirLookupAbs(dir, name, base)) != NULL)
1155 if (seenDotLast && cur != NULL &&
1156 ((file = DirLookupAbs(cur, name, base)) != NULL))
1162 if (file[0] == '\0') {
1171 * Find the file with the given name along the given search path.
1173 * If the file is found in a directory that is not on the path
1174 * already (either 'name' is absolute or it is a relative path
1175 * [ dir1/.../dirn/file ] which exists below one of the directories
1176 * already on the search path), its directory is added to the end
1177 * of the path, on the assumption that there will be more files in
1178 * that directory later on. Sometimes this is true. Sometimes not.
1181 * name the file to find
1182 * path the directories to search, or NULL
1185 * The freshly allocated path to the file, or NULL.
1188 Dir_FindFile(const char *name, SearchPath *path)
1190 char *file; /* the current filename to check */
1191 bool seenDotLast = false; /* true if we should search dot last */
1192 struct cached_stat cst; /* Buffer for stat, if necessary */
1193 const char *trailing_dot = ".";
1194 const char *base = str_basename(name);
1196 DEBUG1(DIR, "Searching for %s ...", name);
1199 DEBUG0(DIR, "couldn't open path, file not found\n");
1204 if (path->dirs.first != NULL) {
1205 CachedDir *dir = path->dirs.first->datum;
1206 if (dir == dotLast) {
1208 DEBUG0(DIR, "[dot last]...");
1214 * If there's no leading directory components or if the leading
1215 * directory component is exactly `./', consult the cached contents
1216 * of each of the directories on the search path.
1218 if (base == name || (base - name == 2 && *name == '.')) {
1222 * We look through all the directories on the path seeking one
1223 * which contains the final component of the given name. If
1224 * such a file is found, we concatenate the directory name
1225 * and the final component and return the resulting string.
1226 * If we don't find any such thing, we go on to phase two.
1228 * No matter what, we always look for the file in the current
1229 * directory before anywhere else (unless we found the magic
1230 * DOTLAST path, in which case we search it last) and we *do
1231 * not* add the ./ to it if it exists.
1232 * This is so there are no conflicts between what the user
1233 * specifies (fish.c) and what pmake finds (./fish.c).
1235 if (!seenDotLast && (file = DirFindDot(name, base)) != NULL)
1238 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1239 CachedDir *dir = ln->datum;
1242 if ((file = DirLookup(dir, base)) != NULL)
1246 if (seenDotLast && (file = DirFindDot(name, base)) != NULL)
1251 * We didn't find the file on any directory in the search path.
1252 * If the name doesn't contain a slash, that means it doesn't exist.
1253 * If it *does* contain a slash, however, there is still hope: it
1254 * could be in a subdirectory of one of the members of the search
1255 * path. (eg. /usr/include and sys/types.h. The above search would
1256 * fail to turn up types.h in /usr/include, but it *is* in
1257 * /usr/include/sys/types.h).
1258 * [ This no longer applies: If we find such a file, we assume there
1259 * will be more (what else can we assume?) and add all but the last
1260 * component of the resulting name onto the search path (at the
1262 * This phase is only performed if the file is *not* absolute.
1265 DEBUG0(DIR, " failed.\n");
1270 if (*base == '\0') {
1271 /* we were given a trailing "/" */
1272 base = trailing_dot;
1275 if (name[0] != '/') {
1276 if (FindFileRelative(path, seenDotLast, name, &file))
1279 if (FindFileAbsolute(path, seenDotLast, name, base, &file))
1284 * Didn't find it that way, either. Sigh. Phase 3. Add its directory
1285 * onto the search path in any case, just in case, then look for the
1286 * thing in the hash table. If we find it, grand. We return a new
1287 * copy of the name. Otherwise we sadly return a NULL pointer. Sigh.
1288 * Note that if the directory holding the file doesn't exist, this
1289 * will do an extra search of the final directory on the path. Unless
1290 * something weird happens, this search won't succeed and life will
1293 * Sigh. We cannot add the directory onto the search path because
1294 * of this amusing case:
1295 * $(INSTALLDIR)/$(FILE): $(FILE)
1297 * $(FILE) exists in $(INSTALLDIR) but not in the current one.
1298 * When searching for $(FILE), we will find it in $(INSTALLDIR)
1299 * b/c we added it here. This is not good...
1306 if (base == trailing_dot) {
1307 base = strrchr(name, '/');
1310 prefix = bmake_strsedup(name, base - 1);
1311 (void)SearchPath_Add(path, prefix);
1315 if (path->last == NULL)
1318 dir = path->last->datum;
1319 if (HashSet_Contains(&dir->files, base))
1320 return bmake_strdup(name);
1324 DEBUG1(DIR, " Looking for \"%s\" ...\n", name);
1327 if (cached_stat(name, &cst) == 0) {
1328 return bmake_strdup(name);
1331 DEBUG0(DIR, " failed. Returning NULL\n");
1338 * Search for a path starting at a given directory and then working our way
1339 * up towards the root.
1342 * here starting directory
1343 * search_path the relative path we are looking for
1346 * The found path, or NULL.
1349 Dir_FindHereOrAbove(const char *here, const char *search_path)
1351 struct cached_stat cst;
1352 char *dirbase, *dirbase_end;
1353 char *try, *try_end;
1355 /* copy out our starting point */
1356 dirbase = bmake_strdup(here);
1357 dirbase_end = dirbase + strlen(dirbase);
1359 /* loop until we determine a result */
1362 /* try and stat(2) it ... */
1363 try = str_concat3(dirbase, "/", search_path);
1364 if (cached_stat(try, &cst) != -1) {
1366 * success! if we found a file, chop off
1367 * the filename so we return a directory.
1369 if ((cst.cst_mode & S_IFMT) != S_IFDIR) {
1370 try_end = try + strlen(try);
1371 while (try_end > try && *try_end != '/')
1374 *try_end = '\0'; /* chop! */
1383 * nope, we didn't find it. if we used up dirbase we've
1384 * reached the root and failed.
1386 if (dirbase_end == dirbase)
1387 break; /* failed! */
1390 * truncate dirbase from the end to move up a dir
1392 while (dirbase_end > dirbase && *dirbase_end != '/')
1394 *dirbase_end = '\0'; /* chop! */
1402 * This is an implied source, and it may have moved,
1403 * see if we can find it via the current .PATH
1406 ResolveMovedDepends(GNode *gn)
1410 const char *base = str_basename(gn->name);
1411 if (base == gn->name)
1414 fullName = Dir_FindFile(base, Suff_FindPath(gn));
1415 if (fullName == NULL)
1419 * Put the found file in gn->path so that we give that to the compiler.
1422 * XXX: Better just reset gn->path to NULL; updating it is already done
1423 * by Dir_UpdateMTime.
1425 gn->path = bmake_strdup(fullName);
1426 if (!Job_RunTarget(".STALE", gn->fname))
1427 fprintf(stdout, /* XXX: Why stdout? */
1428 "%s: %s, %u: ignoring stale %s for %s, found %s\n",
1429 progname, gn->fname, gn->lineno,
1430 makeDependfile, gn->name, fullName);
1436 ResolveFullName(GNode *gn)
1440 fullName = gn->path;
1441 if (fullName == NULL && !(gn->type & OP_NOPATH)) {
1443 fullName = Dir_FindFile(gn->name, Suff_FindPath(gn));
1445 if (fullName == NULL && gn->flags.fromDepend &&
1446 !Lst_IsEmpty(&gn->implicitParents))
1447 fullName = ResolveMovedDepends(gn);
1449 DEBUG2(DIR, "Found '%s' as '%s'\n",
1450 gn->name, fullName != NULL ? fullName : "(not found)");
1453 if (fullName == NULL)
1454 fullName = bmake_strdup(gn->name);
1456 /* XXX: Is every piece of memory freed as it should? */
1462 * Search gn along dirSearchPath and store its modification time in gn->mtime.
1463 * If no file is found, store 0 instead.
1465 * The found file is stored in gn->path, unless the node already had a path.
1468 Dir_UpdateMTime(GNode *gn, bool forceRefresh)
1471 struct cached_stat cst;
1473 if (gn->type & OP_ARCHV) {
1474 Arch_UpdateMTime(gn);
1478 if (gn->type & OP_PHONY) {
1483 fullName = ResolveFullName(gn);
1485 if (cached_stats(fullName, &cst, false, forceRefresh) < 0) {
1486 if (gn->type & OP_MEMBER) {
1487 if (fullName != gn->path)
1489 Arch_UpdateMemberMTime(gn);
1496 if (fullName != NULL && gn->path == NULL)
1497 gn->path = fullName;
1498 /* XXX: else free(fullName)? */
1500 gn->mtime = cst.cst_mtime;
1504 * Read the directory and add it to the cache in openDirs.
1505 * If a path is given, add the directory to that path as well.
1508 CacheNewDir(const char *name, SearchPath *path)
1510 CachedDir *dir = NULL;
1514 if ((d = opendir(name)) == NULL) {
1515 DEBUG1(DIR, "Caching %s ... not found\n", name);
1519 DEBUG1(DIR, "Caching %s ...\n", name);
1521 dir = CachedDir_New(name);
1523 while ((dp = readdir(d)) != NULL) {
1525 #if defined(sun) && defined(d_ino) /* d_ino is a sunos4 #define for d_fileno */
1527 * The sun directory library doesn't check for a 0 inode
1528 * (0-inode slots just take up space), so we have to do
1531 if (dp->d_fileno == 0)
1533 #endif /* sun && d_ino */
1535 (void)HashSet_Add(&dir->files, dp->d_name);
1539 OpenDirs_Add(&openDirs, dir);
1541 Lst_Append(&path->dirs, CachedDir_Ref(dir));
1543 DEBUG1(DIR, "Caching %s done\n", name);
1548 * Read the list of filenames in the directory and store the result
1551 * If a path is given, append the directory to that path.
1554 * path The path to which the directory should be
1555 * added, or NULL to only add the directory to openDirs
1556 * name The name of the directory to add.
1557 * The name is not normalized in any way.
1559 * result If no path is given and the directory exists, the
1560 * returned CachedDir has a reference count of 0. It
1561 * must either be assigned to a variable using
1562 * CachedDir_Assign or be appended to a SearchPath using
1563 * Lst_Append and CachedDir_Ref.
1566 SearchPath_Add(SearchPath *path, const char *name)
1569 if (path != NULL && strcmp(name, ".DOTLAST") == 0) {
1572 /* XXX: Linear search gets slow with thousands of entries. */
1573 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1574 CachedDir *pathDir = ln->datum;
1575 if (strcmp(pathDir->name, name) == 0)
1579 Lst_Prepend(&path->dirs, CachedDir_Ref(dotLast));
1583 /* XXX: Why is OpenDirs only checked if path != NULL? */
1584 CachedDir *dir = OpenDirs_Find(&openDirs, name);
1586 if (Lst_FindDatum(&path->dirs, dir) == NULL)
1587 Lst_Append(&path->dirs, CachedDir_Ref(dir));
1592 return CacheNewDir(name, path);
1596 * Return a copy of dirSearchPath, incrementing the reference counts for
1597 * the contained directories.
1600 Dir_CopyDirSearchPath(void)
1602 SearchPath *path = SearchPath_New();
1604 for (ln = dirSearchPath.dirs.first; ln != NULL; ln = ln->next) {
1605 CachedDir *dir = ln->datum;
1606 Lst_Append(&path->dirs, CachedDir_Ref(dir));
1612 * Make a string by taking all the directories in the given search path and
1613 * preceding them by the given flag. Used by the suffix module to create
1614 * variables for compilers based on suffix search paths.
1617 * flag flag which should precede each directory
1618 * path list of directories
1621 * The string mentioned above. Note that there is no space between the
1622 * given flag and each directory. The empty string is returned if things
1626 SearchPath_ToFlags(SearchPath *path, const char *flag)
1634 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1635 CachedDir *dir = ln->datum;
1636 Buf_AddStr(&buf, " ");
1637 Buf_AddStr(&buf, flag);
1638 Buf_AddStr(&buf, dir->name);
1642 return Buf_DoneData(&buf);
1645 /* Free the search path and all directories mentioned in it. */
1647 SearchPath_Free(SearchPath *path)
1651 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1652 CachedDir *dir = ln->datum;
1653 CachedDir_Unref(dir);
1655 Lst_Done(&path->dirs);
1660 * Clear out all elements from the given search path.
1661 * The path is set to the empty list but is not destroyed.
1664 SearchPath_Clear(SearchPath *path)
1666 while (!Lst_IsEmpty(&path->dirs)) {
1667 CachedDir *dir = Lst_Dequeue(&path->dirs);
1668 CachedDir_Unref(dir);
1674 * Concatenate two paths, adding the second to the end of the first,
1675 * skipping duplicates.
1678 SearchPath_AddAll(SearchPath *dst, SearchPath *src)
1682 for (ln = src->dirs.first; ln != NULL; ln = ln->next) {
1683 CachedDir *dir = ln->datum;
1684 if (Lst_FindDatum(&dst->dirs, dir) == NULL)
1685 Lst_Append(&dst->dirs, CachedDir_Ref(dir));
1690 percentage(int num, int den)
1692 return den != 0 ? num * 100 / den : 0;
1695 /********** DEBUG INFO **********/
1697 Dir_PrintDirectories(void)
1699 CachedDirListNode *ln;
1701 debug_printf("#*** Directory Cache:\n");
1703 "# Stats: %d hits %d misses %d near misses %d losers (%d%%)\n",
1704 hits, misses, nearmisses, bigmisses,
1705 percentage(hits, hits + bigmisses + nearmisses));
1706 debug_printf("# refs hits directory\n");
1708 for (ln = openDirs.list.first; ln != NULL; ln = ln->next) {
1709 CachedDir *dir = ln->datum;
1710 debug_printf("# %4d %4d %s\n",
1711 dir->refCount, dir->hits, dir->name);
1716 SearchPath_Print(const SearchPath *path)
1720 for (ln = path->dirs.first; ln != NULL; ln = ln->next) {
1721 const CachedDir *dir = ln->datum;
1722 debug_printf("%s ", dir->name);