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
|
/*
* Copyright 2023, Vincent Douillet <vincent@vdouillet.fr>
*
* 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. Neither the name of the copyright holder 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 COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
*/
#include <sys/stat.h>
#include <limits.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#include "config.h"
#include "file.h"
#include "mime.h"
#include "str.h"
#include "url.h"
void
file_free(struct file * file)
{
if (file == NULL)
return;
if (file->path != NULL) {
free(file->path);
file->path = NULL;
}
if (file->action_url != NULL) {
free(file->action_url);
file->action_url = NULL;
}
free(file);
}
static bool
fill_metadata(struct file * f)
{
char *ext, *data_dir;
char path[PATH_MAX];
struct stat sb;
size_t path_len;
data_dir = config_data_dir();
if (data_dir == NULL)
return false;
/* default mime */
f->mime = MIME_BIN;
/* check if it is a directory */
path_len = path_build(path, PATH_MAX, data_dir, f->path, NULL);
if (path_len == 0 || path_len >= PATH_MAX)
return false;
if (stat(path, &sb) != 0)
return false;
f->size = sb.st_size;
f->is_dir = S_ISDIR(sb.st_mode);
/* find mime from file extension */
ext = strrchr(f->path, '.');
if (!ext || ext == f->path) {
return true;
}
ext++;
f->mime = mime_from_ext(ext);
return true;
}
struct file *
file_new(const char *path)
{
struct file *file;
if (path == NULL)
return NULL;
file = (struct file *) calloc(1, sizeof(struct file));
if (file == NULL)
return NULL;
/* empty path is considered as root */
if (strlen(path) == 0) {
file->path = malloc(sizeof(char) * 2);
if (file->path == NULL) {
file_free(file);
return NULL;
}
strlcpy(file->path, "/", 2);
} else {
file->path = strdup(path);
if (file->path == NULL) {
file_free(file);
return NULL;
}
}
if (!fill_metadata(file)) {
file_free(file);
return NULL;
}
return file;
}
char *
file_get_basename(const struct file * f)
{
if (f == NULL || f->path == NULL)
return NULL;
/* is the path a basename itself? */
if (strrchr(f->path, '/') == NULL)
return f->path;
/* split for the basename */
return str_split(f->path, '/');
}
size_t
file_get_data_path(const struct file * f, char *data_path, size_t data_path_len,
char *append)
{
char *data_dir;
size_t path_len;
data_dir = config_data_dir();
if (data_dir == NULL)
return 0;
/* check if it is a directory */
path_len = path_build(data_path, data_path_len, data_dir, f->path,
append, NULL);
if (path_len == 0 || path_len >= PATH_MAX)
return 0;
return path_len;
}
size_t
path_build(char *dst, size_t dst_size,...)
{
va_list path_list;
const char *path;
size_t w_size;
dst[0] = '\0';
w_size = 0;
va_start(path_list, dst_size);
while ((path = va_arg(path_list, char *)) != NULL) {
/* no more space in dst buffer */
if (w_size >= dst_size)
break;
if (path[0] == '\0')
continue;
if (path[0] == '.' && path[1] == '\0')
continue;
if (path[0] != '/' && w_size > 0 && dst[w_size - 1] != '/')
strlcat(dst, "/", dst_size);
w_size = strlcat(dst, path, dst_size);
}
va_end(path_list);
return w_size;
}
|
