286 lines
6.7 KiB
C
286 lines
6.7 KiB
C
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
static char sccsid[] = "@(#)opendir.c 8.8 (Berkeley) 5/1/95";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include "namespace.h"
|
|
#include <sys/param.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include <dirent.h>
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include "un-namespace.h"
|
|
|
|
#include "telldir.h"
|
|
/*
|
|
* Open a directory.
|
|
*/
|
|
DIR *
|
|
opendir(name)
|
|
const char *name;
|
|
{
|
|
|
|
return (__opendir2(name, DTF_HIDEW|DTF_NODUP));
|
|
}
|
|
|
|
DIR *
|
|
__opendir2(name, flags)
|
|
const char *name;
|
|
int flags;
|
|
{
|
|
DIR *dirp;
|
|
int fd;
|
|
int incr;
|
|
int saved_errno;
|
|
int unionstack;
|
|
struct stat statb;
|
|
|
|
/*
|
|
* stat() before _open() because opening of special files may be
|
|
* harmful. _fstat() after open because the file may have changed.
|
|
*/
|
|
if (stat(name, &statb) != 0)
|
|
return (NULL);
|
|
if (!S_ISDIR(statb.st_mode)) {
|
|
errno = ENOTDIR;
|
|
return (NULL);
|
|
}
|
|
if ((fd = _open(name, O_RDONLY | O_NONBLOCK)) == -1)
|
|
return (NULL);
|
|
dirp = NULL;
|
|
if (_fstat(fd, &statb) != 0)
|
|
goto fail;
|
|
if (!S_ISDIR(statb.st_mode)) {
|
|
errno = ENOTDIR;
|
|
goto fail;
|
|
}
|
|
if (_fcntl(fd, F_SETFD, FD_CLOEXEC) == -1 ||
|
|
(dirp = malloc(sizeof(DIR) + sizeof(struct _telldir))) == NULL)
|
|
goto fail;
|
|
|
|
dirp->dd_td = (void *)dirp + sizeof(DIR);
|
|
LIST_INIT(&dirp->dd_td->td_locq);
|
|
dirp->dd_td->td_loccnt = 0;
|
|
|
|
/*
|
|
* Use the system page size if that is a multiple of DIRBLKSIZ.
|
|
* Hopefully this can be a big win someday by allowing page
|
|
* trades to user space to be done by _getdirentries().
|
|
*/
|
|
incr = getpagesize();
|
|
if ((incr % DIRBLKSIZ) != 0)
|
|
incr = DIRBLKSIZ;
|
|
|
|
/*
|
|
* Determine whether this directory is the top of a union stack.
|
|
*/
|
|
if (flags & DTF_NODUP) {
|
|
struct statfs sfb;
|
|
|
|
if (_fstatfs(fd, &sfb) < 0)
|
|
goto fail;
|
|
unionstack = !strcmp(sfb.f_fstypename, "union")
|
|
|| (sfb.f_flags & MNT_UNION);
|
|
} else {
|
|
unionstack = 0;
|
|
}
|
|
|
|
if (unionstack) {
|
|
int len = 0;
|
|
int space = 0;
|
|
char *buf = 0;
|
|
char *ddptr = 0;
|
|
char *ddeptr;
|
|
int n;
|
|
struct dirent **dpv;
|
|
|
|
/*
|
|
* The strategy here is to read all the directory
|
|
* entries into a buffer, sort the buffer, and
|
|
* remove duplicate entries by setting the inode
|
|
* number to zero.
|
|
*/
|
|
|
|
do {
|
|
/*
|
|
* Always make at least DIRBLKSIZ bytes
|
|
* available to _getdirentries
|
|
*/
|
|
if (space < DIRBLKSIZ) {
|
|
space += incr;
|
|
len += incr;
|
|
buf = reallocf(buf, len);
|
|
if (buf == NULL)
|
|
goto fail;
|
|
ddptr = buf + (len - space);
|
|
}
|
|
|
|
n = _getdirentries(fd, ddptr, space, &dirp->dd_seek);
|
|
if (n > 0) {
|
|
ddptr += n;
|
|
space -= n;
|
|
}
|
|
} while (n > 0);
|
|
|
|
ddeptr = ddptr;
|
|
flags |= __DTF_READALL;
|
|
|
|
/*
|
|
* Re-open the directory.
|
|
* This has the effect of rewinding back to the
|
|
* top of the union stack and is needed by
|
|
* programs which plan to fchdir to a descriptor
|
|
* which has also been read -- see fts.c.
|
|
*/
|
|
if (flags & DTF_REWIND) {
|
|
(void)_close(fd);
|
|
if ((fd = _open(name, O_RDONLY)) == -1) {
|
|
saved_errno = errno;
|
|
free(buf);
|
|
free(dirp);
|
|
errno = saved_errno;
|
|
return (NULL);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* There is now a buffer full of (possibly) duplicate
|
|
* names.
|
|
*/
|
|
dirp->dd_buf = buf;
|
|
|
|
/*
|
|
* Go round this loop twice...
|
|
*
|
|
* Scan through the buffer, counting entries.
|
|
* On the second pass, save pointers to each one.
|
|
* Then sort the pointers and remove duplicate names.
|
|
*/
|
|
for (dpv = 0;;) {
|
|
n = 0;
|
|
ddptr = buf;
|
|
while (ddptr < ddeptr) {
|
|
struct dirent *dp;
|
|
|
|
dp = (struct dirent *) ddptr;
|
|
if ((long)dp & 03L)
|
|
break;
|
|
if ((dp->d_reclen <= 0) ||
|
|
(dp->d_reclen > (ddeptr + 1 - ddptr)))
|
|
break;
|
|
ddptr += dp->d_reclen;
|
|
if (dp->d_fileno) {
|
|
if (dpv)
|
|
dpv[n] = dp;
|
|
n++;
|
|
}
|
|
}
|
|
|
|
if (dpv) {
|
|
struct dirent *xp;
|
|
|
|
/*
|
|
* This sort must be stable.
|
|
*/
|
|
mergesort(dpv, n, sizeof(*dpv), alphasort);
|
|
|
|
dpv[n] = NULL;
|
|
xp = NULL;
|
|
|
|
/*
|
|
* Scan through the buffer in sort order,
|
|
* zapping the inode number of any
|
|
* duplicate names.
|
|
*/
|
|
for (n = 0; dpv[n]; n++) {
|
|
struct dirent *dp = dpv[n];
|
|
|
|
if ((xp == NULL) ||
|
|
strcmp(dp->d_name, xp->d_name)) {
|
|
xp = dp;
|
|
} else {
|
|
dp->d_fileno = 0;
|
|
}
|
|
if (dp->d_type == DT_WHT &&
|
|
(flags & DTF_HIDEW))
|
|
dp->d_fileno = 0;
|
|
}
|
|
|
|
free(dpv);
|
|
break;
|
|
} else {
|
|
dpv = malloc((n+1) * sizeof(struct dirent *));
|
|
if (dpv == NULL)
|
|
break;
|
|
}
|
|
}
|
|
|
|
dirp->dd_len = len;
|
|
dirp->dd_size = ddptr - dirp->dd_buf;
|
|
} else {
|
|
dirp->dd_len = incr;
|
|
dirp->dd_buf = malloc(dirp->dd_len);
|
|
if (dirp->dd_buf == NULL)
|
|
goto fail;
|
|
dirp->dd_seek = 0;
|
|
flags &= ~DTF_REWIND;
|
|
}
|
|
|
|
dirp->dd_loc = 0;
|
|
dirp->dd_fd = fd;
|
|
dirp->dd_flags = flags;
|
|
dirp->dd_lock = NULL;
|
|
|
|
/*
|
|
* Set up seek point for rewinddir.
|
|
*/
|
|
dirp->dd_rewind = telldir(dirp);
|
|
|
|
return (dirp);
|
|
|
|
fail:
|
|
saved_errno = errno;
|
|
free(dirp);
|
|
(void)_close(fd);
|
|
errno = saved_errno;
|
|
return (NULL);
|
|
}
|