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
|
/* SPDX-License-Identifier: GPL-3.0-or-later */
/*
* fill_files.c
*
* Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
*/
#include "config.h"
#include "rdsquashfs.h"
static struct file_ent {
char *path;
const sqfs_inode_generic_t *inode;
} *files = NULL;
static size_t num_files = 0, max_files = 0;
static size_t block_size = 0;
static int compare_files(const void *l, const void *r)
{
sqfs_u32 lhs_frag_idx, lhs_frag_off, rhs_frag_idx, rhs_frag_off;
sqfs_u64 lhs_size, rhs_size, lhs_start, rhs_start;
const struct file_ent *lhs = l, *rhs = r;
sqfs_inode_get_frag_location(lhs->inode, &lhs_frag_idx, &lhs_frag_off);
sqfs_inode_get_file_block_start(lhs->inode, &lhs_start);
sqfs_inode_get_file_size(lhs->inode, &lhs_size);
sqfs_inode_get_frag_location(rhs->inode, &rhs_frag_idx, &rhs_frag_off);
sqfs_inode_get_file_block_start(rhs->inode, &rhs_start);
sqfs_inode_get_file_size(rhs->inode, &rhs_size);
/* Files with fragments come first, ordered by ID.
In case of tie, files without data blocks come first,
and the others are ordered by start block. */
if ((lhs_size % block_size) && (lhs_frag_off < block_size) &&
(lhs_frag_idx != 0xFFFFFFFF)) {
if ((rhs_size % block_size) && (rhs_frag_off < block_size) &&
(rhs_frag_idx != 0xFFFFFFFF))
return -1;
if (lhs_frag_idx < rhs_frag_idx)
return -1;
if (lhs_frag_idx > rhs_frag_idx)
return 1;
if (lhs_size < block_size)
return (rhs_size < block_size) ? 0 : -1;
if (rhs_size < block_size)
return 1;
goto order_by_start;
}
if ((rhs_size % block_size) && (rhs_frag_off < block_size) &&
(rhs_frag_idx != 0xFFFFFFFF))
return 1;
/* order the rest by start block */
order_by_start:
return lhs_start < rhs_start ? -1 : lhs_start > rhs_start ? 1 : 0;
}
static int add_file(const sqfs_tree_node_t *node)
{
size_t new_sz;
char *path;
void *new;
if (num_files == max_files) {
new_sz = max_files ? max_files * 2 : 256;
new = realloc(files, sizeof(files[0]) * new_sz);
if (new == NULL) {
perror("expanding file list");
return -1;
}
files = new;
max_files = new_sz;
}
path = sqfs_tree_node_get_path(node);
if (path == NULL) {
perror("assembling file path");
return -1;
}
if (canonicalize_name(path)) {
fprintf(stderr, "Invalid file path '%s'\n", path);
free(path);
return -1;
}
files[num_files].path = path;
files[num_files].inode = node->inode;
num_files++;
return 0;
}
static void clear_file_list(void)
{
size_t i;
for (i = 0; i < num_files; ++i)
free(files[i].path);
free(files);
files = NULL;
num_files = 0;
max_files = 0;
}
static int gen_file_list_dfs(const sqfs_tree_node_t *n)
{
if (!is_filename_sane((const char *)n->name)) {
fprintf(stderr, "Found an entry named '%s', skipping.\n",
n->name);
return 0;
}
if (S_ISREG(n->inode->base.mode))
return add_file(n);
if (S_ISDIR(n->inode->base.mode)) {
for (n = n->children; n != NULL; n = n->next) {
if (gen_file_list_dfs(n))
return -1;
}
}
return 0;
}
static int fill_files(sqfs_data_reader_t *data, int flags)
{
size_t i;
int fd;
for (i = 0; i < num_files; ++i) {
fd = open(files[i].path, O_WRONLY);
if (fd < 0) {
fprintf(stderr, "unpacking %s: %s\n",
files[i].path, strerror(errno));
return -1;
}
if (!(flags & UNPACK_QUIET))
printf("unpacking %s\n", files[i].path);
if (sqfs_data_reader_dump(files[i].path, data, files[i].inode,
fd, block_size,
(flags & UNPACK_NO_SPARSE) == 0)) {
close(fd);
return -1;
}
close(fd);
}
return 0;
}
int fill_unpacked_files(size_t blk_sz, const sqfs_tree_node_t *root,
sqfs_data_reader_t *data, int flags)
{
int status;
block_size = blk_sz;
if (gen_file_list_dfs(root)) {
clear_file_list();
return -1;
}
qsort(files, num_files, sizeof(files[0]), compare_files);
status = fill_files(data, flags);
clear_file_list();
return status;
}
|
