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
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
|
/**
* Navit, a modular navigation system.
* Copyright (C) 2005-2008 Navit Team
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* version 2 as published by the Free Software Foundation.
*
* 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 this program; if not, write to the
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#define _FILE_OFFSET_BITS 64
#define _LARGEFILE_SOURCE
#define _LARGEFILE64_SOURCE
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <dirent.h>
#include <stdio.h>
#include <wordexp.h>
#include <glib.h>
#include <zlib.h>
#include "debug.h"
#include "cache.h"
#include "file.h"
#include "config.h"
#ifndef O_LARGEFILE
#define O_LARGEFILE 0
#endif
#ifndef O_BINARY
#define O_BINARY 0
#endif
#ifdef CACHE_SIZE
static GHashTable *file_name_hash;
#endif
static struct cache *file_cache;
struct file_cache_id {
long long offset;
int size;
int file_name_id;
int method;
} __attribute__ ((packed));
struct file *
file_create(char *name)
{
struct stat stat;
struct file *file= g_new0(struct file,1);
file->fd=open(name, O_RDONLY|O_LARGEFILE | O_BINARY);
if (file->fd == -1) {
g_free(file);
return NULL;
}
dbg(1,"fd=%d\n", file->fd);
fstat(file->fd, &stat);
file->size=stat.st_size;
dbg(1,"size=%Ld\n", file->size);
file->name = g_strdup(name);
dbg_assert(file != NULL);
return file;
}
int file_is_dir(char *name)
{
struct stat buf;
if (! stat(name, &buf)) {
return S_ISDIR(buf.st_mode);
}
return 0;
}
int
file_size(struct file *file)
{
return file->size;
}
int file_mkdir(char *name, int pflag)
{
char buffer[strlen(name)+1];
int ret;
char *next;
dbg(1,"enter %s %d\n",name,pflag);
if (!pflag) {
if (file_is_dir(name))
return 0;
#ifdef HAVE_API_WIN32_BASE
return mkdir(name);
#else
return mkdir(name, 0777);
#endif
}
strcpy(buffer, name);
next=buffer;
while ((next=strchr(next, '/'))) {
*next='\0';
if (*buffer) {
ret=file_mkdir(buffer, 0);
if (ret)
return ret;
}
*next++='/';
}
if (pflag == 2)
return 0;
return file_mkdir(buffer, 0);
}
int
file_mmap(struct file *file)
{
#if defined(_WIN32) || defined(__CEGCC__)
file->begin = (char*)mmap_readonly_win32( file->name, &file->map_handle, &file->map_file );
#else
file->begin=mmap(NULL, file->size, PROT_READ|PROT_WRITE, MAP_PRIVATE, file->fd, 0);
dbg_assert(file->begin != NULL);
if (file->begin == (void *)0xffffffff) {
perror("mmap");
return 0;
}
#endif
dbg_assert(file->begin != (void *)0xffffffff);
file->end=file->begin+file->size;
return 1;
}
unsigned char *
file_data_read(struct file *file, long long offset, int size)
{
void *ret;
if (file->begin)
return file->begin+offset;
if (file_cache) {
struct file_cache_id id={offset,size,file->name_id,0};
ret=cache_lookup(file_cache,&id);
if (ret)
return ret;
ret=cache_insert_new(file_cache,&id,size);
} else
ret=g_malloc(size);
lseek(file->fd, offset, SEEK_SET);
if (read(file->fd, ret, size) != size) {
file_data_free(file, ret);
ret=NULL;
}
return ret;
}
unsigned char *
file_data_read_all(struct file *file)
{
return file_data_read(file, 0, file->size);
}
int
file_get_contents(char *name, unsigned char **buffer, int *size)
{
struct file *file;
file=file_create(name);
if (!file)
return 0;
*size=file_size(file);
*buffer=file_data_read_all(file);
file_destroy(file);
return 1;
}
static int
uncompress_int(Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen)
{
z_stream stream;
int err;
stream.next_in = (Bytef*)source;
stream.avail_in = (uInt)sourceLen;
stream.next_out = dest;
stream.avail_out = (uInt)*destLen;
stream.zalloc = (alloc_func)0;
stream.zfree = (free_func)0;
err = inflateInit2(&stream, -MAX_WBITS);
if (err != Z_OK) return err;
err = inflate(&stream, Z_FINISH);
if (err != Z_STREAM_END) {
inflateEnd(&stream);
if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0))
return Z_DATA_ERROR;
return err;
}
*destLen = stream.total_out;
err = inflateEnd(&stream);
return err;
}
unsigned char *
file_data_read_compressed(struct file *file, long long offset, int size, int size_uncomp)
{
void *ret;
char *buffer = 0;
uLongf destLen=size_uncomp;
if (file_cache) {
struct file_cache_id id={offset,size,file->name_id,1};
ret=cache_lookup(file_cache,&id);
if (ret)
return ret;
ret=cache_insert_new(file_cache,&id,size_uncomp);
} else
ret=g_malloc(size_uncomp);
lseek(file->fd, offset, SEEK_SET);
buffer = (char *)g_malloc(size);
if (read(file->fd, buffer, size) != size) {
g_free(ret);
ret=NULL;
} else {
if (uncompress_int(ret, &destLen, (Bytef *)buffer, size) != Z_OK) {
dbg(0,"uncompress failed\n");
g_free(ret);
ret=NULL;
}
}
g_free(buffer);
return ret;
}
void
file_data_free(struct file *file, unsigned char *data)
{
if (file->begin && data >= file->begin && data < file->end)
return;
if (file_cache) {
cache_entry_destroy(file_cache, data);
} else
g_free(data);
}
int
file_exists(char *name)
{
struct stat buf;
if (! stat(name, &buf))
return 1;
return 0;
}
void
file_remap_readonly(struct file *f)
{
#if defined(_WIN32) || defined(__CEGCC__)
#else
void *begin;
munmap(f->begin, f->size);
begin=mmap(f->begin, f->size, PROT_READ, MAP_PRIVATE, f->fd, 0);
if (f->begin != begin)
printf("remap failed\n");
#endif
}
void
file_unmap(struct file *f)
{
#if defined(_WIN32) || defined(__CEGCC__)
mmap_unmap_win32( f->begin, f->map_handle , f->map_file );
#else
munmap(f->begin, f->size);
#endif
}
void *
file_opendir(char *dir)
{
return opendir(dir);
}
char *
file_readdir(void *hnd)
{
struct dirent *ent;
ent=readdir(hnd);
if (! ent)
return NULL;
return ent->d_name;
}
void
file_closedir(void *hnd)
{
closedir(hnd);
}
struct file *
file_create_caseinsensitive(char *name)
{
char dirname[strlen(name)+1];
char *filename;
char *p;
void *d;
struct file *ret;
ret=file_create(name);
if (ret)
return ret;
strcpy(dirname, name);
p=dirname+strlen(name);
while (p > dirname) {
if (*p == '/')
break;
p--;
}
*p=0;
d=file_opendir(dirname);
if (d) {
*p++='/';
while ((filename=file_readdir(d))) {
if (!strcasecmp(filename, p)) {
strcpy(p, filename);
ret=file_create(dirname);
if (ret)
break;
}
}
file_closedir(d);
}
return ret;
}
void
file_destroy(struct file *f)
{
close(f->fd);
if ( f->begin != NULL )
{
file_unmap( f );
}
g_free(f->name);
g_free(f);
}
struct file_wordexp {
int err;
wordexp_t we;
};
struct file_wordexp *
file_wordexp_new(const char *pattern)
{
struct file_wordexp *ret=g_new0(struct file_wordexp, 1);
ret->err=wordexp(pattern, &ret->we, 0);
if (ret->err)
dbg(0,"wordexp('%s') returned %d\n", pattern, ret->err);
return ret;
}
int
file_wordexp_get_count(struct file_wordexp *wexp)
{
return wexp->we.we_wordc;
}
char **
file_wordexp_get_array(struct file_wordexp *wexp)
{
return wexp->we.we_wordv;
}
void
file_wordexp_destroy(struct file_wordexp *wexp)
{
if (! wexp->err)
wordfree(&wexp->we);
g_free(wexp);
}
int
file_get_param(struct file *file, struct param_list *param, int count)
{
int i=count;
param_add_string("Filename", file->name, ¶m, &count);
param_add_hex("Size", file->size, ¶m, &count);
return i-count;
}
int
file_version(struct file *file, int byname)
{
#ifndef __CEGCC__
struct stat st;
int error;
if (byname)
error=stat(file->name, &st);
else
error=fstat(file->fd, &st);
if (error || !file->version || file->mtime != st.st_mtime || file->ctime != st.st_ctime) {
file->mtime=st.st_mtime;
file->ctime=st.st_ctime;
file->version++;
dbg(0,"%s now version %d\n", file->name, file->version);
}
return file->version;
#else
return 0;
#endif
}
void *
file_get_os_handle(struct file *file)
{
return (void *)(file->fd);
}
void
file_init(void)
{
#ifdef CACHE_SIZE
file_name_hash=g_hash_table_new(g_str_hash, g_str_equal);
file_cache=cache_new(sizeof(struct file_cache_id), CACHE_SIZE);
#endif
}
|