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
|
#include "loadfiles.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void magi_loadfiles_add(struct magi_loadfiles *table,
const char *name,
const char *path,
int max)
{
static const int size = sizeof(*table->files);
if (!table) {
return;
}
if (table->count) {
table->files = realloc(table->files, size * table->count + size);
} else {
table->files = malloc(size);
}
table->files[table->count].name = name;
table->files[table->count].path = path;
table->files[table->count].max = max;
table->count++;
}
void magi_loadfiles_free(struct magi_loadfiles *table)
{
if (!table) {
return;
}
free(table->files);
table->count = 0;
}
static void loadfiles_callback(void *userdata,
int newfile,
const struct magi_file *file,
const char *addon,
int addon_len)
{
int pos;
struct magi_loadfiles *table = userdata;
if (!file->filename || !*file->filename) {
return;
}
for (pos = 0; pos != table->count; ++pos) {
if (!strcmp(table->files[pos].name, file->field)) {
static FILE *f = 0;
static int unlimited;
static int left;
if (newfile) {
const char *path = table->files[pos].path;
f = fopen(path, "wb");
left = table->files[pos].max;
unlimited = !left;
}
if (unlimited) {
fwrite(addon, 1, addon_len, f);
} else {
int min = left < addon_len ? left : addon_len;
fwrite(addon, 1, min, f);
left -= min;
}
if (!addon) {
fclose(f);
}
return;
}
}
}
void magi_loadfiles_set(struct magi_request *request,
struct magi_loadfiles *table)
{
request->callback.act = loadfiles_callback;
request->callback.userdata = table;
}
|
