-
Notifications
You must be signed in to change notification settings - Fork 0
/
mkcache.c
425 lines (350 loc) · 8.68 KB
/
mkcache.c
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
/*
* mkcache - creates the .cache files for the gofish gopher daemon
* Copyright (C) 2002 Sean MacLennan <seanm@seanm.ca>
*
* This program 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, 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.
*
* You should have received a copy of the GNU General Public License
* along with XEmacs; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <ctype.h>
#include <sys/stat.h>
#include "gofish.h"
int verbose = 0;
int recurse = 0;
int sorttype = 0;
int mmap_cache_size; // needed by config
/*
* TODO
* + does not work except from root dir
* + does not look at extensions
* + recursive
* - does not handle symbolic links correctly
* - does not know if they are dirs or files
* - empty dirs are a problem if non-recursive
* - needs a config file
* - read .names
* - read .links
* - read .ignore
* - if a directory .cache can not be created,
* we still get the entry in the upper layer
*/
struct extension {
char *ext;
char type;
int binary;
} exts[] = {
{ "txt", '0', 0 },
{ "html", 'h', 0 },
{ "htm", 'h', 0 },
{ "gif", 'I', 1 },
{ "jpg", 'I', 1 },
{ "png", 'I', 1 },
{ "jpeg", 'I', 1 },
{ "gz", '9', 1 },
{ "tgz", '9', 1 },
{ "tar", '9', 1 },
{ "rpm", '9', 1 },
{ "zip", '9', 1 },
{ "Z", '9', 1 },
{ "pdf", '9', 1 },
{ "ogg", '9', 1 },
{ "mp3", '9', 1 },
};
#define N_EXTS (sizeof(exts) / sizeof(struct extension))
struct entry {
char *name;
char type;
char ftype;
};
int read_dir(struct entry **entries, char *path, int level);
int output_dir(struct entry *entries, int n, char *path, int level);
/* 0 */
int simple_compare(const void *a, const void *b)
{
return strcmp(((struct entry *)a)->name, ((struct entry *)b)->name);
}
/* 1 */
int dirs_compare(const void *a, const void *b)
{
const struct entry *ea = a, *eb = b;
if(ea->ftype == '1') {
if(eb->ftype == '1')
return strcmp(ea->name, eb->name);
else
return -1;
}
if(eb->ftype == '1')
return 1;
return strcmp(ea->name, eb->name);
}
/* 2 */
int dirs_type_compare(const void *a, const void *b)
{
const struct entry *ea = a, *eb = b;
int t;
if(ea->ftype == '1') {
if(eb->ftype == '1')
return strcmp(ea->name, eb->name);
else
return -1;
}
if(eb->ftype == '1')
return 1;
if((t = ea->type - eb->type) == 0)
return strcmp(ea->name, eb->name);
else
return t;
}
static void free_entries(struct entry *entries, int nentries)
{
struct entry *entry;
int i;
for(entry = entries, i = 0; i < nentries; ++i, ++entry)
free(entry->name);
free(entries);
}
// Returns the number of entries in the .cache file
int process_dir(char *path, int level)
{
int nfiles;
struct entry *entries = NULL;
if(verbose) printf("Processing [%d] %s\n", level, path);
if((nfiles = read_dir(&entries, path, level)) == 0)
return 0;
switch(sorttype) {
default:
printf("Unsupported sorttype %d\n", sorttype);
// fall thru
case 0:
qsort(entries, nfiles, sizeof(struct entry), simple_compare);
break;
case 1:
qsort(entries, nfiles, sizeof(struct entry), dirs_compare);
break;
case 2:
qsort(entries, nfiles, sizeof(struct entry), dirs_type_compare);
break;
}
output_dir(entries, nfiles, path, level);
free_entries(entries, nfiles);
return nfiles;
}
int output_dir(struct entry *entries, int n, char *path, int level)
{
FILE *fp;
char fname[PATH_MAX];
struct entry *e;
int i;
sprintf(fname, "%s/.cache", path);
if(!(fp = fopen(fname, "w"))) {
perror(path ? path : "root");
return 0;
}
for(e = entries, i = 0; i < n; ++i, ++e)
if(process_cache) {
if(level == 0)
fprintf(fp, "%c%s\t%c/%s\n",
e->type, e->name, e->ftype, e->name);
else
fprintf(fp, "%c%s\t%c/%s/%s\n",
e->type, e->name, e->ftype, path, e->name);
} else {
if(level == 0)
fprintf(fp, "%c%s\t%c/%s\t%s\t%d\n",
e->type, e->name, e->ftype, e->name, hostname, port);
else
fprintf(fp, "%c%s\t%c/%s/%s\t%s\t%d\n",
e->type, e->name, e->ftype, path, e->name, hostname, port);
}
fclose(fp);
return n;
}
void add_entry(struct entry **entries, int n, char *name, int isdir)
{
struct entry *entry;
char *ext;
*entries = realloc(*entries, (n + 1) * sizeof(struct entry));
if(*entries == NULL) {
printf("Out of memory\n");
exit(1);
}
entry = (*entries) + n;
entry->name = must_strdup(name);
if(isdir) {
entry->type = entry->ftype = '1';
return;
}
else if((ext = strrchr(name, '.'))) {
int i;
char *mime;
++ext;
for(i = 0; i < N_EXTS; ++i)
if(strcasecmp(ext, exts[i].ext) == 0) {
entry->type = exts[i].type;
entry->ftype = exts[i].binary ? '9' : '0';
return;
}
// If there is an extension, default to binary
// Most formats are binary.
entry->type = entry->ftype = '9';
if((mime = mime_find(ext))) {
// try to intuit the type from the mime...
if(strncmp(mime, "text/html", 9) == 0) {
entry->type = 'h';
entry->ftype = '0';
}
else if(strncmp(mime, "text/", 5) == 0)
entry->type = entry->ftype = '0';
else if(strncmp(mime, "image/", 6) == 0) {
entry->type = 'I';
entry->ftype = '9';
}
}
}
else
// Default to text as per gopher spec
entry->ftype = entry->type = '0';
}
static int isdir(struct dirent *ent, char *path, int len)
{
struct stat sbuf;
char *full;
// +2 for / and \0
if(!(full = malloc(len + strlen(ent->d_name) + 2))) {
printf("Out of memory\n");
exit(1);
}
sprintf(full, "%s/%s", path, ent->d_name);
if(stat(full, &sbuf)) {
perror(full);
exit(1);
}
free(full);
return S_ISDIR(sbuf.st_mode);
}
int read_dir(struct entry **entries, char *path, int level)
{
DIR *dir;
struct dirent *ent;
int nfiles = 0;
int len = strlen(path);
if(!(dir = opendir(path))) {
perror("opendir");
return 0;
}
while((ent = readdir(dir))) {
if(*ent->d_name == '.') continue;
if(strcmp(ent->d_name, "gophermap") == 0) continue;
if(level == 0 && strcmp(ent->d_name, "favicon.ico") == 0)
continue;
// Do not add the top level icons directory
if(level == 0 && strcmp(ent->d_name, "icons") == 0)
continue;
if(isdir(ent, path, len)) {
add_entry(entries, nfiles, ent->d_name, 1);
++nfiles;
if(recurse) {
char *full;
// note: +2 for / and \0
if(!(full = malloc(len + strlen(ent->d_name) + 2))) {
printf("Out of memory\n");
exit(1);
}
if(level == 0)
strcpy(full, ent->d_name);
else
sprintf(full, "%s/%s", path, ent->d_name);
process_dir(full, level + 1);
free(full);
}
else if(verbose > 1) printf(" %s/\n", ent->d_name);
} else {
if(verbose > 1) printf(" %s\n", ent->d_name);
add_entry(entries, nfiles, ent->d_name, 0);
++nfiles;
}
}
closedir(dir);
return nfiles;
}
int main(int argc, char *argv[])
{
char *dir = NULL;
char *config = GOPHER_CONFIG;
char full[PATH_MAX];
int c;
int level;
while((c = getopt(argc, argv, "c:prs:v")) != -1)
switch(c) {
case 'c': config = strdup(optarg); break;
case 'p': process_cache = 1; break;
case 'r': recurse = 1; break;
case 's': sorttype = strtol(optarg, 0, 0); break;
case 'v': ++verbose; break;
default:
printf("usage: %s [-rv] [dir]\n", *argv);
exit(1);
}
read_config(config);
mime_init();
if(!realpath(root_dir, full)) {
perror(root_dir);
exit(1);
}
if(strcmp(root_dir, full)) {
free(root_dir);
if((root_dir = strdup(full)) == NULL) {
printf("Out of memory\n");
exit(1);
}
}
if(chdir(root_dir)) {
perror(root_dir);
exit(1);
}
if(optind < argc) {
dir = argv[optind];
if(!realpath(dir, full)) {
perror(dir);
exit(1);
}
if(strncmp(root_dir, full, strlen(root_dir))) {
printf("%s is not a subdir of %s\n", dir, root_dir);
exit(1);
}
dir = full + strlen(root_dir);
if(*dir == '/') ++dir;
}
if(dir == NULL || *dir == '\0')
dir = ".";
if(verbose > 1)
printf("hostname '%s' port '%d'\nbase '%s' dir '%s'\n",
hostname, port, root_dir, dir);
level = strcmp(dir, ".") ? 1 : 0;
process_dir(dir, level);
// This is for valgrind and will not be 100% correct if you
// have anything other than a stock gofish.conf
free(root_dir);
free(hostname);
return 0;
}
/* Dummy functions for config */
void set_listen_address(char *addr) {}
void http_set_header(char *fname, int header) {}