1994-05-27 05:00:24 +00:00
|
|
|
/*
|
|
|
|
* 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)
|
1997-03-11 11:29:42 +00:00
|
|
|
static char sccsid[] = "@(#)readdir.c 8.3 (Berkeley) 9/29/94";
|
1994-05-27 05:00:24 +00:00
|
|
|
#endif /* LIBC_SCCS and not lint */
|
2002-02-01 00:57:29 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
1994-05-27 05:00:24 +00:00
|
|
|
|
2001-01-24 13:01:12 +00:00
|
|
|
#include "namespace.h"
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <dirent.h>
|
1999-11-28 05:38:13 +00:00
|
|
|
#include <errno.h>
|
2000-06-03 00:27:54 +00:00
|
|
|
#include <string.h>
|
1999-11-28 05:38:13 +00:00
|
|
|
#include <pthread.h>
|
2001-01-24 13:01:12 +00:00
|
|
|
#include "un-namespace.h"
|
|
|
|
|
|
|
|
#include "libc_private.h"
|
2005-09-12 19:52:42 +00:00
|
|
|
#include "telldir.h"
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* get next entry in a directory.
|
|
|
|
*/
|
|
|
|
struct dirent *
|
2001-01-24 13:01:12 +00:00
|
|
|
_readdir_unlocked(dirp)
|
2000-12-06 03:15:49 +00:00
|
|
|
DIR *dirp;
|
1994-05-27 05:00:24 +00:00
|
|
|
{
|
2000-12-06 03:15:49 +00:00
|
|
|
struct dirent *dp;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
for (;;) {
|
1997-03-11 11:29:42 +00:00
|
|
|
if (dirp->dd_loc >= dirp->dd_size) {
|
|
|
|
if (dirp->dd_flags & __DTF_READALL)
|
|
|
|
return (NULL);
|
|
|
|
dirp->dd_loc = 0;
|
|
|
|
}
|
|
|
|
if (dirp->dd_loc == 0 && !(dirp->dd_flags & __DTF_READALL)) {
|
2001-01-24 13:01:12 +00:00
|
|
|
dirp->dd_size = _getdirentries(dirp->dd_fd,
|
1994-05-27 05:00:24 +00:00
|
|
|
dirp->dd_buf, dirp->dd_len, &dirp->dd_seek);
|
|
|
|
if (dirp->dd_size <= 0)
|
1997-03-11 11:29:42 +00:00
|
|
|
return (NULL);
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
dp = (struct dirent *)(dirp->dd_buf + dirp->dd_loc);
|
1998-02-20 08:00:01 +00:00
|
|
|
if ((long)dp & 03L) /* bogus pointer check */
|
1997-03-11 11:29:42 +00:00
|
|
|
return (NULL);
|
1994-05-27 05:00:24 +00:00
|
|
|
if (dp->d_reclen <= 0 ||
|
|
|
|
dp->d_reclen > dirp->dd_len + 1 - dirp->dd_loc)
|
1997-03-11 11:29:42 +00:00
|
|
|
return (NULL);
|
1994-05-27 05:00:24 +00:00
|
|
|
dirp->dd_loc += dp->d_reclen;
|
|
|
|
if (dp->d_ino == 0)
|
|
|
|
continue;
|
1997-03-11 11:29:42 +00:00
|
|
|
if (dp->d_type == DT_WHT && (dirp->dd_flags & DTF_HIDEW))
|
|
|
|
continue;
|
1994-05-27 05:00:24 +00:00
|
|
|
return (dp);
|
|
|
|
}
|
|
|
|
}
|
1999-11-28 05:38:13 +00:00
|
|
|
|
2001-01-24 13:01:12 +00:00
|
|
|
struct dirent *
|
|
|
|
readdir(dirp)
|
|
|
|
DIR *dirp;
|
|
|
|
{
|
|
|
|
struct dirent *dp;
|
|
|
|
|
|
|
|
if (__isthreaded) {
|
|
|
|
_pthread_mutex_lock((pthread_mutex_t *)&dirp->dd_lock);
|
|
|
|
dp = _readdir_unlocked(dirp);
|
|
|
|
_pthread_mutex_unlock((pthread_mutex_t *)&dirp->dd_lock);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
dp = _readdir_unlocked(dirp);
|
|
|
|
return (dp);
|
|
|
|
}
|
|
|
|
|
1999-11-28 05:38:13 +00:00
|
|
|
int
|
|
|
|
readdir_r(dirp, entry, result)
|
|
|
|
DIR *dirp;
|
|
|
|
struct dirent *entry;
|
|
|
|
struct dirent **result;
|
|
|
|
{
|
|
|
|
struct dirent *dp;
|
2000-12-06 03:15:49 +00:00
|
|
|
int saved_errno;
|
1999-11-29 19:12:50 +00:00
|
|
|
|
|
|
|
saved_errno = errno;
|
1999-11-28 05:38:13 +00:00
|
|
|
errno = 0;
|
2001-01-24 13:01:12 +00:00
|
|
|
if (__isthreaded) {
|
|
|
|
_pthread_mutex_lock((pthread_mutex_t *)&dirp->dd_lock);
|
|
|
|
if ((dp = _readdir_unlocked(dirp)) != NULL)
|
2002-02-26 21:39:32 +00:00
|
|
|
memcpy(entry, dp, _GENERIC_DIRSIZ(dp));
|
2001-01-24 13:01:12 +00:00
|
|
|
_pthread_mutex_unlock((pthread_mutex_t *)&dirp->dd_lock);
|
|
|
|
}
|
|
|
|
else if ((dp = _readdir_unlocked(dirp)) != NULL)
|
2002-02-26 21:39:32 +00:00
|
|
|
memcpy(entry, dp, _GENERIC_DIRSIZ(dp));
|
2001-01-24 13:01:12 +00:00
|
|
|
|
1999-11-29 19:12:50 +00:00
|
|
|
if (errno != 0) {
|
2001-01-24 13:01:12 +00:00
|
|
|
if (dp == NULL)
|
1999-11-29 19:12:50 +00:00
|
|
|
return (errno);
|
|
|
|
} else
|
|
|
|
errno = saved_errno;
|
|
|
|
|
|
|
|
if (dp != NULL)
|
1999-11-29 06:12:22 +00:00
|
|
|
*result = entry;
|
1999-11-29 19:12:50 +00:00
|
|
|
else
|
1999-11-28 05:38:13 +00:00
|
|
|
*result = NULL;
|
1999-11-29 19:12:50 +00:00
|
|
|
|
|
|
|
return (0);
|
1999-11-28 05:38:13 +00:00
|
|
|
}
|