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
|
/*
* Copyright (C) 2003-2010 Neverball authors
*
* NEVERBALL is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published
* by the Free Software Foundation; either version 2 of the License,
* or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*/
#include <dirent.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include "dir.h"
#include "common.h"
/*
* HACK: MinGW provides numerous POSIX extensions to MSVCRT, including
* dirent.h, so parasti ever so lazily has not bothered to port the
* code below to FindFirstFile et al.
*/
List dir_list_files(const char *path)
{
DIR *dir;
List files = NULL;
if ((dir = opendir(path)))
{
struct dirent *ent;
while ((ent = readdir(dir)))
{
if (strcmp(ent->d_name, ".") == 0 || strcmp(ent->d_name, "..") == 0)
continue;
files = list_cons(strdup(ent->d_name), files);
}
closedir(dir);
}
return files;
}
void dir_list_free(List files)
{
while (files)
{
free(files->data);
files = list_rest(files);
}
}
static struct dir_item *add_item(Array items, const char *dir, const char *name)
{
struct dir_item *item = array_add(items);
item->path = path_join(dir, name);
item->data = NULL;
return item;
}
static void del_item(Array items)
{
struct dir_item *item = array_get(items, array_len(items) - 1);
free((void *) item->path);
assert(!item->data);
array_del(items);
}
Array dir_scan(const char *path,
int (*filter) (struct dir_item *),
List (*list_files)(const char *),
void (*free_files)(List))
{
List files, file;
Array items = NULL;
assert((list_files && free_files) || (!list_files && !free_files));
if (!list_files) list_files = dir_list_files;
if (!free_files) free_files = dir_list_free;
items = array_new(sizeof (struct dir_item));
if ((files = list_files(path)))
{
for (file = files; file; file = file->next)
{
struct dir_item *item;
item = add_item(items, path, file->data);
if (filter && !filter(item))
del_item(items);
}
free_files(files);
}
return items;
}
void dir_free(Array items)
{
while (array_len(items))
del_item(items);
array_free(items);
}
int dir_exists(const char *path)
{
DIR *dir;
if ((dir = opendir(path)))
{
closedir(dir);
return 1;
}
return 0;
}
|
