opendir.c revision 1.26 1 1.26 mycroft /* $NetBSD: opendir.c,v 1.26 2005/01/19 00:53:33 mycroft Exp $ */
2 1.8 cgd
3 1.1 cgd /*
4 1.2 jtc * Copyright (c) 1983, 1993
5 1.2 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.24 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.13 christos #include <sys/cdefs.h>
33 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
34 1.8 cgd #if 0
35 1.8 cgd static char sccsid[] = "@(#)opendir.c 8.7 (Berkeley) 12/10/94";
36 1.8 cgd #else
37 1.26 mycroft __RCSID("$NetBSD: opendir.c,v 1.26 2005/01/19 00:53:33 mycroft Exp $");
38 1.8 cgd #endif
39 1.1 cgd #endif /* LIBC_SCCS and not lint */
40 1.1 cgd
41 1.14 jtc #include "namespace.h"
42 1.22 christos #include "reentrant.h"
43 1.1 cgd #include <sys/param.h>
44 1.5 mycroft #include <sys/mount.h>
45 1.6 mycroft #include <sys/stat.h>
46 1.5 mycroft
47 1.18 lukem #include <assert.h>
48 1.1 cgd #include <dirent.h>
49 1.5 mycroft #include <errno.h>
50 1.1 cgd #include <fcntl.h>
51 1.1 cgd #include <stdlib.h>
52 1.11 cgd #include <string.h>
53 1.1 cgd #include <unistd.h>
54 1.14 jtc
55 1.14 jtc #ifdef __weak_alias
56 1.20 mycroft __weak_alias(opendir,_opendir)
57 1.14 jtc #endif
58 1.1 cgd
59 1.1 cgd /*
60 1.5 mycroft * Open a directory.
61 1.1 cgd */
62 1.1 cgd DIR *
63 1.1 cgd opendir(name)
64 1.1 cgd const char *name;
65 1.1 cgd {
66 1.1 cgd
67 1.18 lukem _DIAGASSERT(name != NULL);
68 1.18 lukem
69 1.5 mycroft return (__opendir2(name, DTF_HIDEW|DTF_NODUP));
70 1.5 mycroft }
71 1.5 mycroft
72 1.5 mycroft DIR *
73 1.5 mycroft __opendir2(name, flags)
74 1.5 mycroft const char *name;
75 1.5 mycroft int flags;
76 1.5 mycroft {
77 1.22 christos DIR *dirp = NULL;
78 1.5 mycroft int fd;
79 1.22 christos int serrno;
80 1.6 mycroft struct stat sb;
81 1.5 mycroft int pagesz;
82 1.5 mycroft int incr;
83 1.15 fvdl int unionstack, nfsdir;
84 1.25 christos struct statvfs sfb;
85 1.18 lukem
86 1.18 lukem _DIAGASSERT(name != NULL);
87 1.5 mycroft
88 1.26 mycroft if ((fd = open(name, O_RDONLY | O_NONBLOCK)) == -1 ||
89 1.26 mycroft fcntl(fd, F_SETFD, FD_CLOEXEC) == -1)
90 1.26 mycroft goto error;
91 1.6 mycroft if (fstat(fd, &sb) || !S_ISDIR(sb.st_mode)) {
92 1.2 jtc errno = ENOTDIR;
93 1.26 mycroft goto error;
94 1.2 jtc }
95 1.26 mycroft if ((dirp = (DIR *)malloc(sizeof(DIR))) == NULL)
96 1.22 christos goto error;
97 1.22 christos dirp->dd_buf = NULL;
98 1.5 mycroft
99 1.1 cgd /*
100 1.4 pk * If the machine's page size is an exact multiple of DIRBLKSIZ,
101 1.4 pk * use a buffer that is cluster boundary aligned.
102 1.1 cgd * Hopefully this can be a big win someday by allowing page trades
103 1.1 cgd * to user space to be done by getdirentries()
104 1.1 cgd */
105 1.4 pk if (((pagesz = getpagesize()) % DIRBLKSIZ) == 0)
106 1.5 mycroft incr = pagesz;
107 1.4 pk else
108 1.5 mycroft incr = DIRBLKSIZ;
109 1.5 mycroft
110 1.5 mycroft /*
111 1.5 mycroft * Determine whether this directory is the top of a union stack.
112 1.5 mycroft */
113 1.5 mycroft
114 1.25 christos if (fstatvfs1(fd, &sfb, ST_NOWAIT) < 0)
115 1.22 christos goto error;
116 1.15 fvdl
117 1.15 fvdl if (flags & DTF_NODUP)
118 1.12 fvdl unionstack = !(strncmp(sfb.f_fstypename, MOUNT_UNION,
119 1.25 christos MFSNAMELEN)) || (sfb.f_flag & MNT_UNION);
120 1.15 fvdl else
121 1.5 mycroft unionstack = 0;
122 1.5 mycroft
123 1.15 fvdl nfsdir = !(strncmp(sfb.f_fstypename, MOUNT_NFS, MFSNAMELEN));
124 1.15 fvdl
125 1.15 fvdl if (unionstack || nfsdir) {
126 1.16 perry size_t len;
127 1.16 perry size_t space;
128 1.21 enami char *buf, *nbuf;
129 1.15 fvdl char *ddptr;
130 1.5 mycroft char *ddeptr;
131 1.5 mycroft int n;
132 1.5 mycroft struct dirent **dpv;
133 1.5 mycroft
134 1.5 mycroft /*
135 1.15 fvdl * The strategy here for directories on top of a union stack
136 1.15 fvdl * is to read all the directory entries into a buffer, sort
137 1.15 fvdl * the buffer, and remove duplicate entries by setting the
138 1.15 fvdl * inode number to zero.
139 1.15 fvdl *
140 1.15 fvdl * For directories on an NFS mounted filesystem, we try
141 1.15 fvdl * to get a consistent snapshot by trying until we have
142 1.15 fvdl * successfully read all of the directory without errors
143 1.15 fvdl * (i.e. 'bad cookie' errors from the server because
144 1.15 fvdl * the directory was modified). These errors should not
145 1.15 fvdl * happen often, but need to be dealt with.
146 1.5 mycroft */
147 1.15 fvdl retry:
148 1.15 fvdl len = 0;
149 1.15 fvdl space = 0;
150 1.15 fvdl buf = 0;
151 1.15 fvdl ddptr = 0;
152 1.5 mycroft
153 1.5 mycroft do {
154 1.5 mycroft /*
155 1.5 mycroft * Always make at least DIRBLKSIZ bytes
156 1.5 mycroft * available to getdirentries
157 1.5 mycroft */
158 1.5 mycroft if (space < DIRBLKSIZ) {
159 1.5 mycroft space += incr;
160 1.5 mycroft len += incr;
161 1.21 enami nbuf = realloc(buf, len);
162 1.21 enami if (nbuf == NULL) {
163 1.22 christos dirp->dd_buf = buf;
164 1.22 christos goto error;
165 1.5 mycroft }
166 1.21 enami buf = nbuf;
167 1.5 mycroft ddptr = buf + (len - space);
168 1.5 mycroft }
169 1.4 pk
170 1.16 perry dirp->dd_seek = lseek(fd, (off_t)0, SEEK_CUR);
171 1.15 fvdl n = getdents(fd, ddptr, space);
172 1.15 fvdl /*
173 1.15 fvdl * For NFS: EINVAL means a bad cookie error
174 1.15 fvdl * from the server. Keep trying to get a
175 1.15 fvdl * consistent view, in this case this means
176 1.15 fvdl * starting all over again.
177 1.15 fvdl */
178 1.15 fvdl if (n == -1 && errno == EINVAL && nfsdir) {
179 1.15 fvdl free(buf);
180 1.16 perry lseek(fd, (off_t)0, SEEK_SET);
181 1.15 fvdl goto retry;
182 1.15 fvdl }
183 1.5 mycroft if (n > 0) {
184 1.5 mycroft ddptr += n;
185 1.5 mycroft space -= n;
186 1.5 mycroft }
187 1.5 mycroft } while (n > 0);
188 1.5 mycroft
189 1.5 mycroft ddeptr = ddptr;
190 1.5 mycroft flags |= __DTF_READALL;
191 1.5 mycroft
192 1.5 mycroft /*
193 1.5 mycroft * Re-open the directory.
194 1.5 mycroft * This has the effect of rewinding back to the
195 1.5 mycroft * top of the union stack and is needed by
196 1.5 mycroft * programs which plan to fchdir to a descriptor
197 1.5 mycroft * which has also been read -- see fts.c.
198 1.5 mycroft */
199 1.5 mycroft if (flags & DTF_REWIND) {
200 1.5 mycroft (void) close(fd);
201 1.26 mycroft if ((fd = open(name, O_RDONLY)) == -1 ||
202 1.26 mycroft fcntl(fd, F_SETFD, FD_CLOEXEC) == -1) {
203 1.22 christos dirp->dd_buf = buf;
204 1.22 christos goto error;
205 1.5 mycroft }
206 1.5 mycroft }
207 1.5 mycroft
208 1.5 mycroft /*
209 1.5 mycroft * There is now a buffer full of (possibly) duplicate
210 1.5 mycroft * names.
211 1.5 mycroft */
212 1.5 mycroft dirp->dd_buf = buf;
213 1.5 mycroft
214 1.5 mycroft /*
215 1.5 mycroft * Go round this loop twice...
216 1.5 mycroft *
217 1.5 mycroft * Scan through the buffer, counting entries.
218 1.5 mycroft * On the second pass, save pointers to each one.
219 1.5 mycroft * Then sort the pointers and remove duplicate names.
220 1.5 mycroft */
221 1.15 fvdl if (!nfsdir) {
222 1.15 fvdl for (dpv = 0;;) {
223 1.15 fvdl for (n = 0, ddptr = buf; ddptr < ddeptr;) {
224 1.15 fvdl struct dirent *dp;
225 1.15 fvdl
226 1.17 christos dp = (struct dirent *)(void *)ddptr;
227 1.15 fvdl if ((long)dp & 03)
228 1.15 fvdl break;
229 1.17 christos /*
230 1.17 christos * d_reclen is unsigned,
231 1.17 christos * so no need to compare <= 0
232 1.17 christos */
233 1.17 christos if (dp->d_reclen > (ddeptr + 1 - ddptr))
234 1.15 fvdl break;
235 1.15 fvdl ddptr += dp->d_reclen;
236 1.15 fvdl if (dp->d_fileno) {
237 1.15 fvdl if (dpv)
238 1.15 fvdl dpv[n] = dp;
239 1.15 fvdl n++;
240 1.15 fvdl }
241 1.5 mycroft }
242 1.5 mycroft
243 1.15 fvdl if (dpv) {
244 1.15 fvdl struct dirent *xp;
245 1.5 mycroft
246 1.15 fvdl /*
247 1.15 fvdl * This sort must be stable.
248 1.15 fvdl */
249 1.16 perry mergesort(dpv, (size_t)n, sizeof(*dpv),
250 1.15 fvdl alphasort);
251 1.15 fvdl
252 1.15 fvdl dpv[n] = NULL;
253 1.15 fvdl xp = NULL;
254 1.15 fvdl
255 1.15 fvdl /*
256 1.15 fvdl * Scan through the buffer in sort
257 1.15 fvdl * order, zapping the inode number
258 1.15 fvdl * of any duplicate names.
259 1.15 fvdl */
260 1.15 fvdl for (n = 0; dpv[n]; n++) {
261 1.15 fvdl struct dirent *dp = dpv[n];
262 1.15 fvdl
263 1.15 fvdl if ((xp == NULL) ||
264 1.15 fvdl strcmp(dp->d_name,
265 1.15 fvdl xp->d_name))
266 1.15 fvdl xp = dp;
267 1.15 fvdl else
268 1.15 fvdl dp->d_fileno = 0;
269 1.15 fvdl if (dp->d_type == DT_WHT &&
270 1.15 fvdl (flags & DTF_HIDEW))
271 1.15 fvdl dp->d_fileno = 0;
272 1.15 fvdl }
273 1.5 mycroft
274 1.15 fvdl free(dpv);
275 1.5 mycroft break;
276 1.15 fvdl } else {
277 1.21 enami dpv = malloc((n + 1) *
278 1.21 enami sizeof(struct dirent *));
279 1.15 fvdl if (dpv == NULL)
280 1.15 fvdl break;
281 1.15 fvdl }
282 1.5 mycroft }
283 1.5 mycroft }
284 1.5 mycroft
285 1.5 mycroft dirp->dd_len = len;
286 1.5 mycroft dirp->dd_size = ddptr - dirp->dd_buf;
287 1.5 mycroft } else {
288 1.5 mycroft dirp->dd_len = incr;
289 1.16 perry dirp->dd_buf = malloc((size_t)dirp->dd_len);
290 1.22 christos if (dirp->dd_buf == NULL)
291 1.22 christos goto error;
292 1.5 mycroft dirp->dd_seek = 0;
293 1.5 mycroft flags &= ~DTF_REWIND;
294 1.1 cgd }
295 1.5 mycroft
296 1.5 mycroft dirp->dd_loc = 0;
297 1.1 cgd dirp->dd_fd = fd;
298 1.5 mycroft dirp->dd_flags = flags;
299 1.5 mycroft
300 1.1 cgd /*
301 1.1 cgd * Set up seek point for rewinddir.
302 1.1 cgd */
303 1.22 christos #ifdef _REENTRANT
304 1.22 christos if (__isthreaded) {
305 1.22 christos if ((dirp->dd_lock = malloc(sizeof(mutex_t))) == NULL)
306 1.22 christos goto error;
307 1.22 christos mutex_init((mutex_t *)dirp->dd_lock, NULL);
308 1.22 christos }
309 1.22 christos #endif
310 1.23 nathanw dirp->dd_rewind = telldir(dirp);
311 1.5 mycroft return (dirp);
312 1.22 christos error:
313 1.22 christos serrno = errno;
314 1.22 christos if (dirp && dirp->dd_buf)
315 1.22 christos free(dirp->dd_buf);
316 1.22 christos if (dirp)
317 1.22 christos free(dirp);
318 1.22 christos if (fd != -1)
319 1.22 christos (void)close(fd);
320 1.22 christos errno = serrno;
321 1.22 christos return NULL;
322 1.1 cgd }
323