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
|
/* SPDX-License-Identifier: GPL-3.0-or-later */
#include "mkfs.h"
#include "util.h"
struct data_writer_t {
void *block;
void *fragment;
void *scratch;
sqfs_fragment_t *fragments;
size_t num_fragments;
size_t max_fragments;
size_t frag_offset;
sqfs_super_t *super;
compressor_t *cmp;
int outfd;
};
static int write_compressed(data_writer_t *data, const void *in, size_t size,
uint32_t *outsize)
{
ssize_t ret;
ret = data->cmp->do_block(data->cmp, in, size, data->scratch,
data->super->block_size);
if (ret < 0)
return -1;
if (ret > 0 && (size_t)ret < size) {
size = ret;
ret = write_retry(data->outfd, data->scratch, size);
*outsize = size;
} else {
ret = write_retry(data->outfd, in, size);
*outsize = size | (1 << 24);
}
if (ret < 0) {
perror("writing to output file");
return -1;
}
if ((size_t)ret < size) {
fputs("write to output file truncated\n", stderr);
return -1;
}
data->super->bytes_used += ret;
return 0;
}
static int grow_fragment_table(data_writer_t *data)
{
size_t newsz;
void *new;
if (data->num_fragments == data->max_fragments) {
newsz = data->max_fragments ? data->max_fragments * 2 : 16;
new = realloc(data->fragments,
sizeof(data->fragments[0]) * newsz);
if (new == NULL) {
perror("appending to fragment table");
return -1;
}
data->max_fragments = newsz;
data->fragments = new;
}
return 0;
}
int data_writer_flush_fragments(data_writer_t *data)
{
uint64_t offset;
uint32_t out;
if (grow_fragment_table(data))
return -1;
offset = data->super->bytes_used;
if (write_compressed(data, data->fragment, data->frag_offset, &out))
return -1;
data->fragments[data->num_fragments].start_offset = htole64(offset);
data->fragments[data->num_fragments].pad0 = 0;
data->fragments[data->num_fragments].size = htole32(out);
data->num_fragments += 1;
data->frag_offset = 0;
data->super->flags &= ~SQFS_FLAG_NO_FRAGMENTS;
data->super->flags |= SQFS_FLAG_ALWAYS_FRAGMENTS;
return 0;
}
int write_data_from_fd(data_writer_t *data, file_info_t *fi, int infd)
{
uint64_t count = fi->size;
int blk_idx = 0;
uint32_t out;
ssize_t ret;
size_t diff;
fi->startblock = data->super->bytes_used;
while (count != 0) {
diff = count > (uint64_t)data->super->block_size ?
data->super->block_size : count;
ret = read_retry(infd, data->block, diff);
if (ret < 0)
goto fail_read;
if ((size_t)ret < diff)
goto fail_trunc;
if (diff < data->super->block_size) {
if (data->frag_offset + diff > data->super->block_size) {
if (data_writer_flush_fragments(data))
return -1;
}
fi->fragment_offset = data->frag_offset;
fi->fragment = data->num_fragments;
memcpy((char *)data->fragment + data->frag_offset,
data->block, diff);
data->frag_offset += diff;
} else {
if (write_compressed(data, data->block,
data->super->block_size, &out)) {
return -1;
}
fi->blocksizes[blk_idx++] = out;
}
count -= diff;
}
return 0;
fail_read:
fprintf(stderr, "read from %s: %s\n", fi->input_file, strerror(errno));
return -1;
fail_trunc:
fprintf(stderr, "%s: truncated read\n", fi->input_file);
return -1;
}
data_writer_t *data_writer_create(sqfs_super_t *super, compressor_t *cmp,
int outfd)
{
data_writer_t *data;
data = calloc(1, sizeof(*data) + super->block_size * 3);
if (data == NULL) {
perror("creating data writer");
return NULL;
}
data->block = (char *)data + sizeof(*data);
data->fragment = (char *)data->block + super->block_size;
data->scratch = (char *)data->fragment + super->block_size;
data->super = super;
data->cmp = cmp;
data->outfd = outfd;
return data;
}
void data_writer_destroy(data_writer_t *data)
{
free(data->fragments);
free(data);
}
int data_writer_write_fragment_table(data_writer_t *data)
{
uint64_t start;
data->super->fragment_entry_count = data->num_fragments;
if (sqfs_write_table(data->outfd, data->super, data->fragments,
sizeof(data->fragments[0]), data->num_fragments,
&start, data->cmp)) {
return -1;
}
data->super->fragment_table_start = start;
return 0;
}
static int process_file(data_writer_t *data, file_info_t *fi)
{
int ret, infd;
infd = open(fi->input_file, O_RDONLY);
if (infd < 0) {
perror(fi->input_file);
return -1;
}
ret = write_data_from_fd(data, fi, infd);
close(infd);
return ret;
}
static void print_name(tree_node_t *n)
{
if (n->parent != NULL) {
print_name(n->parent);
fputc('/', stdout);
}
fputs(n->name, stdout);
}
static int find_and_process_files(data_writer_t *data, tree_node_t *n,
bool quiet)
{
if (S_ISDIR(n->mode)) {
for (n = n->data.dir->children; n != NULL; n = n->next) {
if (find_and_process_files(data, n, quiet))
return -1;
}
return 0;
}
if (S_ISREG(n->mode)) {
if (!quiet) {
fputs("packing ", stdout);
print_name(n);
fputc('\n', stdout);
}
return process_file(data, n->data.file);
}
return 0;
}
int write_data_to_image(data_writer_t *data, sqfs_info_t *info)
{
bool need_restore = false;
const char *ptr;
int ret;
if (info->opt.packdir != NULL) {
if (pushd(info->opt.packdir))
return -1;
need_restore = true;
} else {
ptr = strrchr(info->opt.infile, '/');
if (ptr != NULL) {
if (pushdn(info->opt.infile, ptr - info->opt.infile))
return -1;
need_restore = true;
}
}
ret = find_and_process_files(data, info->fs.root, info->opt.quiet);
ret = ret == 0 ? data_writer_flush_fragments(data) : ret;
if (need_restore)
ret = popd();
return ret;
}
|