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
|
/* SPDX-License-Identifier: GPL-3.0-or-later */
/*
* post_process.c
*
* Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
*/
#include "internal.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <errno.h>
static void swap_link_with_target(tree_node_t *node)
{
tree_node_t *tgt, *it;
tgt = node->data.target_node;
node->xattr_idx = tgt->xattr_idx;
node->uid = tgt->uid;
node->gid = tgt->gid;
node->inode_num = tgt->inode_num;
node->mod_time = tgt->mod_time;
node->mode = tgt->mode;
node->link_count = tgt->link_count;
node->inode_ref = tgt->inode_ref;
/* FIXME: data pointers now point to foreign node! */
node->data = tgt->data;
tgt->mode = FSTREE_MODE_HARD_LINK_RESOLVED;
tgt->data.target_node = node;
if (S_ISDIR(node->mode)) {
for (it = node->data.dir.children; it != NULL; it = it->next)
it->parent = node;
}
}
static void hard_link_snap(tree_node_t *n)
{
/* XXX: the hard-link-vs-target swap may create hard links
pointing to hard links, making this necessary */
while (n->data.target_node->mode == FSTREE_MODE_HARD_LINK_RESOLVED)
n->data.target_node = n->data.target_node->data.target_node;
}
static int map_child_nodes(fstree_t *fs, tree_node_t *root, size_t *counter)
{
bool has_subdirs = false;
tree_node_t *it, *tgt;
for (it = root->data.dir.children; it != NULL; it = it->next) {
if (it->mode == FSTREE_MODE_HARD_LINK_RESOLVED) {
hard_link_snap(it);
tgt = it->data.target_node;
if (tgt->inode_num == 0 && tgt->parent != root)
swap_link_with_target(it);
}
if (S_ISDIR(it->mode))
has_subdirs = true;
}
if (has_subdirs) {
for (it = root->data.dir.children; it != NULL; it = it->next) {
if (S_ISDIR(it->mode)) {
if (map_child_nodes(fs, it, counter))
return -1;
}
}
}
for (it = root->data.dir.children; it != NULL; it = it->next) {
if (it->mode == FSTREE_MODE_HARD_LINK_RESOLVED) {
hard_link_snap(it);
} else {
fs->unique_inode_count += 1;
it->inode_num = *counter;
*counter += 1;
}
}
return 0;
}
static int resolve_hard_links_dfs(fstree_t *fs, tree_node_t *n)
{
tree_node_t *it;
if (n->mode == FSTREE_MODE_HARD_LINK) {
if (fstree_resolve_hard_link(fs, n))
goto fail_link;
assert(n->mode == FSTREE_MODE_HARD_LINK_RESOLVED);
it = n->data.target_node;
if (S_ISDIR(it->mode) && it->data.dir.visited)
goto fail_link_loop;
} else if (S_ISDIR(n->mode)) {
n->data.dir.visited = true;
for (it = n->data.dir.children; it != NULL; it = it->next) {
if (resolve_hard_links_dfs(fs, it))
return -1;
}
n->data.dir.visited = false;
}
return 0;
fail_link: {
char *path = fstree_get_path(n);
fprintf(stderr, "Resolving hard link '%s' -> '%s': %s\n",
path == NULL ? n->name : path, n->data.target,
strerror(errno));
free(path);
}
return -1;
fail_link_loop: {
char *npath = fstree_get_path(n);
char *tpath = fstree_get_path(it);
fprintf(stderr, "Hard link loop detected in '%s' -> '%s'\n",
npath == NULL ? n->name : npath,
tpath == NULL ? it->name : tpath);
free(npath);
free(tpath);
}
return -1;
}
static void sort_recursive(tree_node_t *n)
{
n->data.dir.children = tree_node_list_sort(n->data.dir.children);
for (n = n->data.dir.children; n != NULL; n = n->next) {
if (S_ISDIR(n->mode))
sort_recursive(n);
}
}
static file_info_t *file_list_dfs(tree_node_t *n)
{
if (S_ISREG(n->mode)) {
n->data.file.next = NULL;
return &n->data.file;
}
if (S_ISDIR(n->mode)) {
file_info_t *list = NULL, *last = NULL;
for (n = n->data.dir.children; n != NULL; n = n->next) {
if (list == NULL) {
list = file_list_dfs(n);
if (list == NULL)
continue;
last = list;
} else {
last->next = file_list_dfs(n);
}
while (last->next != NULL)
last = last->next;
}
return list;
}
return NULL;
}
int fstree_post_process(fstree_t *fs)
{
size_t inum = 1;
sort_recursive(fs->root);
if (resolve_hard_links_dfs(fs, fs->root))
return -1;
fs->unique_inode_count = 0;
if (map_child_nodes(fs, fs->root, &inum))
return -1;
fs->root->inode_num = inum;
fs->unique_inode_count += 1;
fs->files = file_list_dfs(fs->root);
return 0;
}
|
