xref: /openbsd-src/lib/libc/gen/readdir.c (revision d13be5d47e4149db2549a9828e244d59dbc43f15)
1 /*	$OpenBSD: readdir.c,v 1.15 2009/11/18 07:43:22 guenther Exp $ */
2 /*
3  * Copyright (c) 1983, 1993
4  *	The Regents of the University of California.  All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  * 3. Neither the name of the University nor the names of its contributors
15  *    may be used to endorse or promote products derived from this software
16  *    without specific prior written permission.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28  * SUCH DAMAGE.
29  */
30 
31 #include <dirent.h>
32 #include "thread_private.h"
33 
34 /*
35  * get next entry in a directory.
36  */
37 int
38 _readdir_unlocked(DIR *dirp, struct dirent **result, int skipdeleted)
39 {
40 	struct dirent *dp;
41 
42 	*result = NULL;
43 	for (;;) {
44 		if (dirp->dd_loc >= dirp->dd_size)
45 			dirp->dd_loc = 0;
46 		if (dirp->dd_loc == 0) {
47 			dirp->dd_size = getdirentries(dirp->dd_fd,
48 			    dirp->dd_buf, dirp->dd_len, &dirp->dd_seek);
49 			if (dirp->dd_size == 0)
50 				return (0);
51 			if (dirp->dd_size < 0)
52 				return (-1);
53 		}
54 		dp = (struct dirent *)(dirp->dd_buf + dirp->dd_loc);
55 		if ((long)dp & 03)	/* bogus pointer check */
56 			return (-1);
57 		if (dp->d_reclen <= 0 ||
58 		    dp->d_reclen > dirp->dd_len + 1 - dirp->dd_loc)
59 			return (-1);
60 		dirp->dd_loc += dp->d_reclen;
61 		/*
62 		 * When called from seekdir(), we let it decide on
63 		 * the end condition to avoid overshooting: the next
64 		 * readdir call should produce the next non-deleted entry,
65 		 * and we already advanced dd_loc.
66 		 */
67 		if (dp->d_ino == 0 && skipdeleted)
68 			continue;
69 		*result = dp;
70 		return (0);
71 	}
72 }
73 
74 struct dirent *
75 readdir(DIR *dirp)
76 {
77 	struct dirent *dp;
78 
79 	_MUTEX_LOCK(&dirp->dd_lock);
80 	_readdir_unlocked(dirp, &dp, 1);
81 	_MUTEX_UNLOCK(&dirp->dd_lock);
82 
83 	return (dp);
84 }
85