]>
git.saurik.com Git - apple/libc.git/blob - gen/FreeBSD/opendir.c
2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #if defined(LIBC_SCCS) && !defined(lint)
31 static char sccsid
[] = "@(#)opendir.c 8.8 (Berkeley) 5/1/95";
32 #endif /* LIBC_SCCS and not lint */
33 #include <sys/cdefs.h>
34 __FBSDID("$FreeBSD: src/lib/libc/gen/opendir.c,v 1.24 2008/04/16 18:40:52 delphij Exp $");
36 #include "namespace.h"
37 #include <sys/param.h>
38 #include <sys/mount.h>
47 #include "un-namespace.h"
54 opendir(const char *name
)
57 return (__opendir2(name
, DTF_HIDEW
|DTF_NODUP
));
61 __opendir2(const char *name
, int flags
)
71 * stat() before _open() because opening of special files may be
72 * harmful. _fstat() after open because the file may have changed.
74 if (stat(name
, &statb
) != 0)
76 if (!S_ISDIR(statb
.st_mode
)) {
80 if ((fd
= _open(name
, O_RDONLY
| O_NONBLOCK
)) == -1)
83 if (_fstat(fd
, &statb
) != 0)
85 if (!S_ISDIR(statb
.st_mode
)) {
89 if (_fcntl(fd
, F_SETFD
, FD_CLOEXEC
) == -1 ||
90 (dirp
= malloc(sizeof(DIR) + sizeof(struct _telldir
))) == NULL
)
93 dirp
->dd_td
= (struct _telldir
*)((char *)dirp
+ sizeof(DIR));
94 LIST_INIT(&dirp
->dd_td
->td_locq
);
95 dirp
->dd_td
->td_loccnt
= 0;
98 * Use the system page size if that is a multiple of DIRBLKSIZ.
99 * Hopefully this can be a big win someday by allowing page
100 * trades to user space to be done by _getdirentries().
102 incr
= getpagesize();
103 if ((incr
% DIRBLKSIZ
) != 0)
107 * Determine whether this directory is the top of a union stack.
109 if (flags
& DTF_NODUP
) {
112 if (_fstatfs(fd
, &sfb
) < 0)
114 unionstack
= !strcmp(sfb
.f_fstypename
, "unionfs")
115 || (sfb
.f_flags
& MNT_UNION
);
130 * The strategy here is to read all the directory
131 * entries into a buffer, sort the buffer, and
132 * remove duplicate entries by setting the inode
138 * Always make at least DIRBLKSIZ bytes
139 * available to _getdirentries
141 if (space
< DIRBLKSIZ
) {
144 buf
= reallocf(buf
, len
);
147 ddptr
= buf
+ (len
- space
);
150 n
= _getdirentries(fd
, ddptr
, space
, &dirp
->dd_seek
);
158 flags
|= __DTF_READALL
;
161 * Re-open the directory.
162 * This has the effect of rewinding back to the
163 * top of the union stack and is needed by
164 * programs which plan to fchdir to a descriptor
165 * which has also been read -- see fts.c.
167 if (flags
& DTF_REWIND
) {
169 if ((fd
= _open(name
, O_RDONLY
)) == -1) {
179 * There is now a buffer full of (possibly) duplicate
185 * Go round this loop twice...
187 * Scan through the buffer, counting entries.
188 * On the second pass, save pointers to each one.
189 * Then sort the pointers and remove duplicate names.
194 while (ddptr
< ddeptr
) {
197 dp
= (struct dirent
*) ddptr
;
200 if ((dp
->d_reclen
<= 0) ||
201 (dp
->d_reclen
> (ddeptr
+ 1 - ddptr
)))
203 ddptr
+= dp
->d_reclen
;
215 * This sort must be stable.
217 mergesort(dpv
, n
, sizeof(*dpv
), alphasort
);
223 * Scan through the buffer in sort order,
224 * zapping the inode number of any
227 for (n
= 0; dpv
[n
]; n
++) {
228 struct dirent
*dp
= dpv
[n
];
231 strcmp(dp
->d_name
, xp
->d_name
)) {
236 if (dp
->d_type
== DT_WHT
&&
244 dpv
= malloc((n
+1) * sizeof(struct dirent
*));
251 dirp
->dd_size
= ddptr
- dirp
->dd_buf
;
255 dirp
->dd_buf
= malloc(dirp
->dd_len
);
256 if (dirp
->dd_buf
== NULL
)
259 flags
&= ~DTF_REWIND
;
264 dirp
->dd_flags
= flags
;
265 dirp
->dd_lock
= NULL
;
268 * Set up seek point for rewinddir.
270 dirp
->dd_rewind
= telldir(dirp
);