1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/*
Implementation of POSIX directory browsing functions and types for Win32.
Author: Kevlin Henney (kevlin@acm.org, kevlin@curbralan.com)
History: Created March 1997. Updated June 2003.
Rights: See end of file.
*/
#include "dirent.h"
#include <errno.h>
#include <io.h> /* _findfirst and _findnext set errno iff they return -1 */
#include <stdlib.h>
#include <string.h>
#ifdef __cplusplus
extern "C"
{
#endif
struct DIR
{
long handle; /* -1 for failed rewind */
struct _finddata_t info;
struct dirent result; /* d_name null iff first time */
char *name; /* null-terminated char string */
};
DIR *opendir(const char *name)
{
DIR *dir = 0;
if(name && name[0])
{
size_t base_length = strlen(name);
const char *all = /* search pattern must end with suitable wildcard */
strchr("/\\", name[base_length - 1]) ? "*" : "/*";
if((dir = (DIR *) malloc(sizeof *dir)) != 0 &&
(dir->name = (char *) malloc(base_length + strlen(all) + 1)) != 0)
{
strcat(strcpy(dir->name, name), all);
if((dir->handle = (long) _findfirst(dir->name, &dir->info)) != -1)
{
dir->result.d_name = 0;
}
else /* rollback */
{
free(dir->name);
free(dir);
dir = 0;
}
}
else /* rollback */
{
free(dir);
dir = 0;
errno = ENOMEM;
}
}
else
{
errno = EINVAL;
}
return dir;
}
int closedir(DIR *dir)
{
int result = -1;
if(dir)
{
if(dir->handle != -1)
{
result = _findclose(dir->handle);
}
free(dir->name);
free(dir);
}
if(result == -1) /* map all errors to EBADF */
{
errno = EBADF;
}
return result;
}
struct dirent *readdir(DIR *dir)
{
struct dirent *result = 0;
if(dir && dir->handle != -1)
{
if(!dir->result.d_name || _findnext(dir->handle, &dir->info) != -1)
{
result = &dir->result;
result->d_name = dir->info.name;
}
}
else
{
errno = EBADF;
}
return result;
}
void rewinddir(DIR *dir)
{
if(dir && dir->handle != -1)
{
_findclose(dir->handle);
dir->handle = (long) _findfirst(dir->name, &dir->info);
dir->result.d_name = 0;
}
else
{
errno = EBADF;
}
}
// helper for scandir below
static void scandir_free_dir_entries(struct dirent*** namelist, int entries) {
int i;
if (!*namelist) return;
for (i = 0; i < entries; ++i) {
free((*namelist)[i]);
}
free(*namelist);
*namelist = 0;
}
// returns the number of directory entries select or -1 if an error occurs
int scandir(
const char* dir,
struct dirent*** namelist,
int(*filter)(const struct dirent*),
int(*compar)(const void*, const void*)
) {
int entries = 0;
int max_entries = 1024; // assume 2*512 = 1024 entries (used for allocation)
DIR* d;
*namelist = 0;
// open directory
d = opendir(dir);
if (!d) return -1;
// iterate
while (1) {
struct dirent* ent = readdir(d);
if (!ent) break;
// add if no filter or filter returns non-zero
if (filter && (0 == filter(ent))) continue;
// resize our buffer if there is not enough room
if (!*namelist || entries >= max_entries) {
struct dirent** new_entries;
max_entries *= 2;
new_entries = (struct dirent **)realloc(*namelist, max_entries);
if (!new_entries) {
scandir_free_dir_entries(namelist, entries);
closedir(d);
errno = ENOMEM;
return -1;
}
*namelist = new_entries;
}
// allocate new entry
(*namelist)[entries] = (struct dirent *)malloc(sizeof(struct dirent) + strlen(ent->d_name) + 1);
if (!(*namelist)[entries]) {
scandir_free_dir_entries(namelist, entries);
closedir(d);
errno = ENOMEM;
return -1;
}
// copy entry info
*(*namelist)[entries] = *ent;
// and then we tack the string onto the end
{
char* dest = (char*)((*namelist)[entries]) + sizeof(struct dirent);
strcpy(dest, ent->d_name);
(*namelist)[entries]->d_name = dest;
}
++entries;
}
closedir(d);
// sort
if (*namelist && compar) qsort(*namelist, entries, sizeof((*namelist)[0]), compar);
return entries;
}
int alphasort(const void* lhs, const void* rhs) {
const struct dirent* lhs_ent = *(struct dirent**)lhs;
const struct dirent* rhs_ent = *(struct dirent**)rhs;
return _strcmpi(lhs_ent->d_name, rhs_ent->d_name);
}
#ifdef __cplusplus
}
#endif
/*
Copyright Kevlin Henney, 1997, 2003. All rights reserved.
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose is hereby granted without fee, provided
that this copyright and permissions notice appear in all copies and
derivatives.
This software is supplied "as is" without express or implied warranty.
But that said, if there are any problems please get in touch.
*/
|
