]>
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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #if defined(LIBC_SCCS) && !defined(lint)
35 static char sccsid
[] = "@(#)opendir.c 8.8 (Berkeley) 5/1/95";
36 #endif /* LIBC_SCCS and not lint */
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD: src/lib/libc/gen/opendir.c,v 1.22 2004/08/14 17:46:10 stefanf Exp $");
40 #include "namespace.h"
41 #include <sys/param.h>
42 #include <sys/mount.h>
51 #include "un-namespace.h"
62 return (__opendir2(name
, DTF_HIDEW
|DTF_NODUP
));
66 __opendir2(name
, flags
)
78 * stat() before _open() because opening of special files may be
79 * harmful. _fstat() after open because the file may have changed.
81 if (stat(name
, &statb
) != 0)
83 if (!S_ISDIR(statb
.st_mode
)) {
87 if ((fd
= _open(name
, O_RDONLY
| O_NONBLOCK
)) == -1)
90 if (_fstat(fd
, &statb
) != 0)
92 if (!S_ISDIR(statb
.st_mode
)) {
96 if (_fcntl(fd
, F_SETFD
, FD_CLOEXEC
) == -1 ||
97 (dirp
= malloc(sizeof(DIR) + sizeof(struct _telldir
))) == NULL
)
100 dirp
->dd_td
= (struct _telldir
*)((char *)dirp
+ sizeof(DIR));
101 LIST_INIT(&dirp
->dd_td
->td_locq
);
102 dirp
->dd_td
->td_loccnt
= 0;
105 * Use the system page size if that is a multiple of DIRBLKSIZ.
106 * Hopefully this can be a big win someday by allowing page
107 * trades to user space to be done by _getdirentries().
109 incr
= getpagesize();
110 if ((incr
% DIRBLKSIZ
) != 0)
114 * Determine whether this directory is the top of a union stack.
116 if (flags
& DTF_NODUP
) {
119 if (_fstatfs(fd
, &sfb
) < 0)
121 unionstack
= !strcmp(sfb
.f_fstypename
, "unionfs")
122 || (sfb
.f_flags
& MNT_UNION
);
137 * The strategy here is to read all the directory
138 * entries into a buffer, sort the buffer, and
139 * remove duplicate entries by setting the inode
145 * Always make at least DIRBLKSIZ bytes
146 * available to _getdirentries
148 if (space
< DIRBLKSIZ
) {
151 buf
= reallocf(buf
, len
);
154 ddptr
= buf
+ (len
- space
);
157 n
= _getdirentries(fd
, ddptr
, space
, &dirp
->dd_seek
);
165 flags
|= __DTF_READALL
;
168 * Re-open the directory.
169 * This has the effect of rewinding back to the
170 * top of the union stack and is needed by
171 * programs which plan to fchdir to a descriptor
172 * which has also been read -- see fts.c.
174 if (flags
& DTF_REWIND
) {
176 if ((fd
= _open(name
, O_RDONLY
)) == -1) {
186 * There is now a buffer full of (possibly) duplicate
192 * Go round this loop twice...
194 * Scan through the buffer, counting entries.
195 * On the second pass, save pointers to each one.
196 * Then sort the pointers and remove duplicate names.
201 while (ddptr
< ddeptr
) {
204 dp
= (struct dirent
*) ddptr
;
207 if ((dp
->d_reclen
<= 0) ||
208 (dp
->d_reclen
> (ddeptr
+ 1 - ddptr
)))
210 ddptr
+= dp
->d_reclen
;
222 * This sort must be stable.
224 mergesort(dpv
, n
, sizeof(*dpv
), alphasort
);
230 * Scan through the buffer in sort order,
231 * zapping the inode number of any
234 for (n
= 0; dpv
[n
]; n
++) {
235 struct dirent
*dp
= dpv
[n
];
238 strcmp(dp
->d_name
, xp
->d_name
)) {
243 if (dp
->d_type
== DT_WHT
&&
251 dpv
= malloc((n
+1) * sizeof(struct dirent
*));
258 dirp
->dd_size
= ddptr
- dirp
->dd_buf
;
262 dirp
->dd_buf
= malloc(dirp
->dd_len
);
263 if (dirp
->dd_buf
== NULL
)
266 flags
&= ~DTF_REWIND
;
271 dirp
->dd_flags
= flags
;
272 dirp
->dd_lock
= NULL
;
275 * Set up seek point for rewinddir.
277 dirp
->dd_rewind
= telldir(dirp
);