1 | /* |
---|
2 | * Copyright (c) 1983 Regents of the University of California. |
---|
3 | * All rights reserved. |
---|
4 | * |
---|
5 | * Redistribution and use in source and binary forms, with or without |
---|
6 | * modification, are permitted provided that the following conditions |
---|
7 | * are met: |
---|
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. |
---|
20 | * |
---|
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 |
---|
31 | * SUCH DAMAGE. |
---|
32 | */ |
---|
33 | |
---|
34 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
35 | static char sccsid[] = "@(#)scandir.c 5.10 (Berkeley) 2/23/91"; |
---|
36 | #endif /* LIBC_SCCS and not lint */ |
---|
37 | |
---|
38 | /* |
---|
39 | * Scan the directory dirname calling select to make a list of selected |
---|
40 | * directory entries then sort using qsort and compare routine dcomp. |
---|
41 | * Returns the number of entries and a pointer to a list of pointers to |
---|
42 | * struct dirent64 (through namelist). Returns -1 if there were any errors. |
---|
43 | */ |
---|
44 | |
---|
45 | #include <sys/types.h> |
---|
46 | #include <sys/stat.h> |
---|
47 | #include <dirent.h> |
---|
48 | #include <stdlib.h> |
---|
49 | #include <string.h> |
---|
50 | #include <sys/lock.h> |
---|
51 | |
---|
52 | extern struct dirent64 *__readdir64 (DIR *); |
---|
53 | |
---|
54 | /* |
---|
55 | * The DIRSIZ macro gives the minimum record length which will hold |
---|
56 | * the directory entry. This requires the amount of space in struct dirent64 |
---|
57 | * without the d_name field, plus enough space for the name with a terminating |
---|
58 | * null byte (dp->d_namlen+1), rounded up to a 4 byte boundary. |
---|
59 | */ |
---|
60 | #undef DIRSIZ |
---|
61 | #ifdef _DIRENT_HAVE_D_NAMLEN |
---|
62 | #define DIRSIZ(dp) \ |
---|
63 | ((sizeof (struct dirent64) - (MAXNAMLEN+1)) + (((dp)->d_namlen+1 + 3) &~ 3)) |
---|
64 | #else |
---|
65 | #define DIRSIZ(dp) \ |
---|
66 | ((sizeof (struct dirent64) - (MAXNAMLEN+1)) + ((strlen((dp)->d_name)+1 + 3) &~ 3)) |
---|
67 | #endif |
---|
68 | |
---|
69 | #ifndef __P |
---|
70 | #define __P(args) () |
---|
71 | #endif |
---|
72 | |
---|
73 | int |
---|
74 | scandir64(dirname, namelist, select, dcomp) |
---|
75 | const char *dirname; |
---|
76 | struct dirent64 ***namelist; |
---|
77 | int (*select) __P((struct dirent64 *)); |
---|
78 | int (*dcomp) __P((const void *, const void *)); |
---|
79 | { |
---|
80 | register struct dirent64 *d, *p, **names; |
---|
81 | register size_t nitems; |
---|
82 | struct stat64 stb; |
---|
83 | long arraysz; |
---|
84 | DIR *dirp; |
---|
85 | |
---|
86 | if ((dirp = opendir(dirname)) == NULL) |
---|
87 | return(-1); |
---|
88 | #ifdef HAVE_DD_LOCK |
---|
89 | __lock_acquire_recursive(dirp->dd_lock); |
---|
90 | #endif |
---|
91 | if (fstat64(dirp->dd_fd, &stb) < 0) { |
---|
92 | #ifdef HAVE_DD_LOCK |
---|
93 | __lock_release_recursive(dirp->dd_lock); |
---|
94 | #endif |
---|
95 | return(-1); |
---|
96 | } |
---|
97 | |
---|
98 | /* |
---|
99 | * estimate the array size by taking the size of the directory file |
---|
100 | * and dividing it by a multiple of the minimum size entry. |
---|
101 | */ |
---|
102 | arraysz = (stb.st_size / 24); |
---|
103 | names = (struct dirent64 **)malloc(arraysz * sizeof(struct dirent64 *)); |
---|
104 | if (names == NULL) { |
---|
105 | #ifdef HAVE_DD_LOCK |
---|
106 | __lock_release_recursive(dirp->dd_lock); |
---|
107 | #endif |
---|
108 | return(-1); |
---|
109 | } |
---|
110 | |
---|
111 | nitems = 0; |
---|
112 | while ((d = __readdir64(dirp)) != NULL) { |
---|
113 | if (select != NULL && !(*select)(d)) |
---|
114 | continue; /* just selected names */ |
---|
115 | /* |
---|
116 | * Make a minimum size copy of the data |
---|
117 | */ |
---|
118 | p = (struct dirent64 *)malloc(DIRSIZ(d)); |
---|
119 | if (p == NULL) { |
---|
120 | #ifdef HAVE_DD_LOCK |
---|
121 | __lock_release_recursive(dirp->dd_lock); |
---|
122 | #endif |
---|
123 | return(-1); |
---|
124 | } |
---|
125 | p->d_ino = d->d_ino; |
---|
126 | p->d_reclen = d->d_reclen; |
---|
127 | #ifdef _DIRENT_HAVE_D_NAMLEN |
---|
128 | p->d_namlen = d->d_namlen; |
---|
129 | bcopy(d->d_name, p->d_name, p->d_namlen + 1); |
---|
130 | #else |
---|
131 | strcpy(p->d_name, d->d_name); |
---|
132 | #endif |
---|
133 | /* |
---|
134 | * Check to make sure the array has space left and |
---|
135 | * realloc the maximum size. |
---|
136 | */ |
---|
137 | if (++nitems >= arraysz) { |
---|
138 | if (fstat64(dirp->dd_fd, &stb) < 0) { |
---|
139 | #ifdef HAVE_DD_LOCK |
---|
140 | __lock_release_recursive(dirp->dd_lock); |
---|
141 | #endif |
---|
142 | return(-1); /* just might have grown */ |
---|
143 | } |
---|
144 | arraysz = stb.st_size / 12; |
---|
145 | names = (struct dirent64 **)realloc((char *)names, |
---|
146 | arraysz * sizeof(struct dirent64 *)); |
---|
147 | if (names == NULL) { |
---|
148 | #ifdef HAVE_DD_LOCK |
---|
149 | __lock_release_recursive(dirp->dd_lock); |
---|
150 | #endif |
---|
151 | return(-1); |
---|
152 | } |
---|
153 | } |
---|
154 | names[nitems-1] = p; |
---|
155 | } |
---|
156 | closedir(dirp); |
---|
157 | if (nitems && dcomp != NULL) |
---|
158 | qsort(names, nitems, sizeof(struct dirent64 *), dcomp); |
---|
159 | *namelist = names; |
---|
160 | #ifdef HAVE_DD_LOCK |
---|
161 | __lock_release_recursive(dirp->dd_lock); |
---|
162 | #endif |
---|
163 | return(nitems); |
---|
164 | } |
---|
165 | |
---|
166 | /* |
---|
167 | * Alphabetic order comparison routine for those who want it. |
---|
168 | */ |
---|
169 | int |
---|
170 | alphasort64(d1, d2) |
---|
171 | const struct dirent64 **d1; |
---|
172 | const struct dirent64 **d2; |
---|
173 | { |
---|
174 | return(strcmp((*d1)->d_name, (*d2)->d_name)); |
---|
175 | } |
---|
176 | |
---|