This repository was archived by the owner on Nov 2, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy pathpersist.c
253 lines (228 loc) · 6.39 KB
/
persist.c
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
#include "persist.h"
#include <stdint.h>
#include <stdio.h>
#include <string.h>
unsigned char path_buf[PATH_MAX] = "\0";
/* --------------
* The dump part
* --------------
*/
/**
* Format:
* <> :=
* (struct file_record)
*/
static void dump_frs(struct vfile_record *vfr, uint8_t start_rev,
uint8_t rev_nr, FILE *outfile)
{
while (start_rev < rev_nr) {
fwrite(vfr->history[start_rev],
sizeof(struct file_record), 1, outfile);
free(vfr->history[start_rev]);
PHOENIXFS_DBG("dump_frs:: %s [%u]", vfr->name, start_rev);
start_rev = (start_rev + 1) % REV_TRUNCATE;
}
}
/**
* Format:
* <> :=
* num_keys | [key | name_len | name | rev_nr | [<dump_frs>][...]][...]
*/
static void dump_vfr_tree(struct node *root, FILE *outfile)
{
struct vfile_record *vfr;
uint8_t start_rev, rev_nr;
uint16_t name_len;
int num_keys = 0;
int i = 0;
node *iter;
if (!(iter = root)) {
/* Write num_keys = 0 */
fwrite(&i, sizeof(uint16_t), 1, outfile);
return;
}
/* First compute and write the number of keys */
while (!iter->is_leaf)
iter = iter->pointers[0];
while (1) {
for (i = 0; i < iter->num_keys; i++)
num_keys++;
if (iter->pointers && iter->pointers[BTREE_ORDER - 1] != NULL)
iter = iter->pointers[BTREE_ORDER - 1];
else
break;
}
fwrite(&num_keys, sizeof(uint16_t), 1, outfile);
/* Now write the entries */
iter = root;
while (!iter->is_leaf)
iter = iter->pointers[0];
while (1) {
for (i = 0; i < iter->num_keys; i++) {
/* Write the key */
fwrite(&(iter->keys[i]), sizeof(uint16_t), 1, outfile);
vfr = find(root, iter->keys[i], 0);
/* Compute name_len; write name_len and name */
name_len = strlen((const char *) vfr->name);
fwrite(&name_len, sizeof(uint16_t), 1, outfile);
fwrite(vfr->name, name_len * sizeof(unsigned char), 1, outfile);
PHOENIXFS_DBG("dump_vfr_tree:: vfr %s", (const char *) vfr->name);
/* Compute and write rev_nr and HEAD */
if (vfr->HEAD < 0) {
start_rev = 0;
rev_nr = 0;
} else if (vfr->history[(vfr->HEAD + 1) % REV_TRUNCATE]) {
/* History is full, and is probably wrapping around */
start_rev = (vfr->HEAD + 1) % REV_TRUNCATE;
rev_nr = 20;
} else {
/* History is not completely filled */
start_rev = 0;
rev_nr = vfr->HEAD + 1;
}
fwrite(&rev_nr, sizeof(uint8_t), 1, outfile);
/* Write the actual file records in chronological order */
dump_frs(vfr, start_rev, rev_nr, outfile);
}
if (iter->pointers && iter->pointers[BTREE_ORDER - 1] != NULL)
iter = iter->pointers[BTREE_ORDER - 1];
else
break;
}
destroy_tree(root);
}
/**
* Format:
* <> :=
* num_keys | [key | name_len | name | [<dump_vfr>][...]][...]
*/
void dump_dr_tree(struct node *root, FILE *outfile)
{
struct dir_record *dr;
uint16_t name_len;
int num_keys = 0;
int i = 0;
node *iter;
if (!(iter = root)) {
/* Write num_keys = 0 */
fwrite(&i, sizeof(uint16_t), 1, outfile);
return;
}
/* First compute and write the number of keys */
while (!iter->is_leaf)
iter = iter->pointers[0];
while (1) {
for (i = 0; i < iter->num_keys; i++)
num_keys++;
if (iter->pointers && iter->pointers[BTREE_ORDER - 1] != NULL)
iter = iter->pointers[BTREE_ORDER - 1];
else
break;
}
fwrite(&num_keys, sizeof(uint16_t), 1, outfile);
/* Now write the entries */
iter = root;
while (!iter->is_leaf)
iter = iter->pointers[0];
while (1) {
for (i = 0; i < iter->num_keys; i++) {
/* Write the key */
fwrite(&(iter->keys[i]), sizeof(uint16_t), 1, outfile);
dr = find(root, iter->keys[i], 0);
/* Compute name_len; write name_len and name */
name_len = strlen((const char *) dr->name);
fwrite(&name_len, sizeof(uint16_t), 1, outfile);
fwrite(dr->name, name_len * sizeof(unsigned char), 1, outfile);
PHOENIXFS_DBG("dump_dr_tree:: %s", (const char *) dr->name);
dump_vfr_tree(dr->vroot, outfile);
}
if (iter->pointers && iter->pointers[BTREE_ORDER - 1] != NULL)
iter = iter->pointers[BTREE_ORDER - 1];
else
break;
}
destroy_tree(root);
}
/* --------------
* The load part
* --------------
*/
/**
* Format:
* <> :=
* num_keys | [key | name_len | name | rev_nr | [<load_frs>][...]][...]
*/
struct node *load_vfr_tree(FILE *infile)
{
struct node *root;
struct vfile_record *vfr;
uint16_t key;
uint16_t num_keys;
uint16_t name_len;
uint8_t rev_nr;
register int i, j;
root = NULL;
memset(&num_keys, 0, sizeof(uint16_t));
if (fread(&num_keys, sizeof(uint16_t), 1, infile) < 1)
die("Read error: num_keys");
for (i = 0; i < num_keys; i++) {
memset(&key, 0, sizeof(uint16_t));
if (fread(&key, sizeof(uint16_t), 1, infile) < 1)
die("Read error: key");
memset(&name_len, 0, sizeof(uint16_t));
if (fread(&name_len, sizeof(uint16_t), 1, infile) < 1)
die("Read error: name_len");
memset(&path_buf, 0, PATH_MAX);
if (fread(&path_buf, name_len * sizeof(unsigned char), 1, infile) < 1)
die("Read error: path_buf");
memset(&rev_nr, 0, sizeof(uint8_t));
if (fread(&rev_nr, sizeof(uint8_t), 1, infile) < 1)
die("Read error: rev_nr");
vfr = make_vfr((const char *) path_buf);
root = insert(root, key, (void *) vfr);
for (j = 0; j < rev_nr; j++) {
vfr->history[j] = malloc(sizeof(struct file_record));
memset(vfr->history[j], 0, sizeof(struct file_record));
if (fread(vfr->history[j], sizeof(struct file_record),
1, infile) < 1)
die("Read error: vfr->history[%d]", j);
PHOENIXFS_DBG("load_vfr_tree:: %s [%d]", vfr->name, j);
}
vfr->HEAD = rev_nr - 1;
}
return root;
}
/**
* Format:
* <> :=
* num_keys | [key | name_len | name | [<load_vfr>][...]][...]
*/
struct node *load_dr_tree(FILE *infile)
{
struct node *root;
struct dir_record *dr;
uint16_t key;
uint16_t num_keys;
uint16_t name_len;
register int i;
root = NULL;
memset(&num_keys, 0, sizeof(uint16_t));
if (fread(&num_keys, sizeof(uint16_t), 1, infile) < 1)
die("Read error: num_keys");
for (i = 0; i < num_keys; i++) {
memset(&key, 0, sizeof(uint16_t));
if (fread(&key, sizeof(uint16_t), 1, infile) < 1)
die("Read error: key");
memset(&name_len, 0, sizeof(uint16_t));
if (fread(&name_len, sizeof(uint16_t), 1, infile) < 1)
die("Read error: name_len");
memset(&path_buf, 0, PATH_MAX);
if (fread(&path_buf, name_len * sizeof(unsigned char), 1, infile) < 1)
die("Read error: path_buf");
PHOENIXFS_DBG("load_dr_tree:: %s", (const char *) path_buf);
dr = make_dr((const char *) path_buf);
root = insert(root, key, (void *) dr);
dr->vroot = load_vfr_tree(infile);
}
return root;
}