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
|
/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2016 RehiveTech. All rights reserved.
*/
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <sys/queue.h>
#include <rte_debug.h>
#include "resource.h"
struct resource_list resource_list = TAILQ_HEAD_INITIALIZER(resource_list);
size_t resource_size(const struct resource *r)
{
return r->end - r->begin;
}
const struct resource *resource_find(const char *name)
{
struct resource *r;
TAILQ_FOREACH(r, &resource_list, next) {
RTE_VERIFY(r->name);
if (!strcmp(r->name, name))
return r;
}
return NULL;
}
int resource_fwrite(const struct resource *r, FILE *f)
{
const size_t goal = resource_size(r);
size_t total = 0;
while (total < goal) {
size_t wlen = fwrite(r->begin + total, 1, goal - total, f);
if (wlen == 0) {
perror(__func__);
return -1;
}
total += wlen;
}
return 0;
}
int resource_fwrite_file(const struct resource *r, const char *fname)
{
FILE *f;
int ret;
f = fopen(fname, "w");
if (f == NULL) {
perror(__func__);
return -1;
}
ret = resource_fwrite(r, f);
fclose(f);
return ret;
}
#ifdef RTE_APP_TEST_RESOURCE_TAR
#include <archive.h>
#include <archive_entry.h>
static int do_copy(struct archive *r, struct archive *w)
{
const void *buf;
size_t len;
#if ARCHIVE_VERSION_NUMBER >= 3000000
int64_t off;
#else
off_t off;
#endif
int ret;
while (1) {
ret = archive_read_data_block(r, &buf, &len, &off);
if (ret == ARCHIVE_RETRY)
continue;
if (ret == ARCHIVE_EOF)
return 0;
if (ret != ARCHIVE_OK)
return ret;
do {
ret = archive_write_data_block(w, buf, len, off);
if (ret != ARCHIVE_OK && ret != ARCHIVE_RETRY)
return ret;
} while (ret != ARCHIVE_OK);
}
}
int resource_untar(const struct resource *res)
{
struct archive *r;
struct archive *w;
struct archive_entry *e;
void *p;
int flags = 0;
int ret;
p = malloc(resource_size(res));
if (p == NULL)
rte_panic("Failed to malloc %zu B\n", resource_size(res));
memcpy(p, res->begin, resource_size(res));
r = archive_read_new();
if (r == NULL) {
free(p);
return -1;
}
archive_read_support_format_all(r);
archive_read_support_filter_all(r);
w = archive_write_disk_new();
if (w == NULL) {
archive_read_free(r);
free(p);
return -1;
}
flags |= ARCHIVE_EXTRACT_PERM;
flags |= ARCHIVE_EXTRACT_FFLAGS;
archive_write_disk_set_options(w, flags);
archive_write_disk_set_standard_lookup(w);
ret = archive_read_open_memory(r, p, resource_size(res));
if (ret != ARCHIVE_OK)
goto fail;
while (1) {
ret = archive_read_next_header(r, &e);
if (ret == ARCHIVE_EOF)
break;
if (ret != ARCHIVE_OK)
goto fail;
ret = archive_write_header(w, e);
if (ret == ARCHIVE_EOF)
break;
if (ret != ARCHIVE_OK)
goto fail;
if (archive_entry_size(e) == 0)
continue;
ret = do_copy(r, w);
if (ret != ARCHIVE_OK)
goto fail;
ret = archive_write_finish_entry(w);
if (ret != ARCHIVE_OK)
goto fail;
}
archive_write_free(w);
archive_read_free(r);
free(p);
return 0;
fail:
archive_write_free(w);
archive_read_free(r);
free(p);
rte_panic("Failed: %s\n", archive_error_string(r));
return -1;
}
int resource_rm_by_tar(const struct resource *res)
{
struct archive *r;
struct archive_entry *e;
void *p;
int try_again = 1;
int attempts = 0;
int ret;
p = malloc(resource_size(res));
if (p == NULL)
rte_panic("Failed to malloc %zu B\n", resource_size(res));
memcpy(p, res->begin, resource_size(res));
/*
* If somebody creates a file somewhere inside the extracted TAR
* hierarchy during a test the resource_rm_by_tar might loop
* infinitely. We prevent this by adding the attempts counter there.
* In normal case, max N iteration is done where N is the depth of
* the file-hierarchy.
*/
while (try_again && attempts < 10000) {
r = archive_read_new();
if (r == NULL) {
free(p);
return -1;
}
archive_read_support_format_all(r);
archive_read_support_filter_all(r);
ret = archive_read_open_memory(r, p, resource_size(res));
if (ret != ARCHIVE_OK) {
fprintf(stderr, "Failed: %s\n",
archive_error_string(r));
goto fail;
}
try_again = 0;
while (1) {
ret = archive_read_next_header(r, &e);
if (ret == ARCHIVE_EOF)
break;
if (ret != ARCHIVE_OK)
goto fail;
ret = remove(archive_entry_pathname(e));
if (ret < 0) {
switch (errno) {
case ENOTEMPTY:
case EEXIST:
try_again = 1;
break;
/* should not usually happen: */
case ENOENT:
case ENOTDIR:
case EROFS:
attempts += 1;
continue;
default:
perror("Failed to remove file");
goto fail;
}
}
}
archive_read_free(r);
attempts += 1;
}
if (attempts >= 10000) {
fprintf(stderr, "Failed to remove archive\n");
free(p);
return -1;
}
free(p);
return 0;
fail:
archive_read_free(r);
free(p);
rte_panic("Failed: %s\n", archive_error_string(r));
return -1;
}
#endif /* RTE_APP_TEST_RESOURCE_TAR */
void resource_register(struct resource *r)
{
TAILQ_INSERT_TAIL(&resource_list, r, next);
}
|
