Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/fs/hfsplus/brec.c | |
3 | * | |
4 | * Copyright (C) 2001 | |
5 | * Brad Boyer (flar@allandria.com) | |
6 | * (C) 2003 Ardis Technologies <roman@ardistech.com> | |
7 | * | |
8 | * Handle individual btree records | |
9 | */ | |
10 | ||
11 | #include "hfsplus_fs.h" | |
12 | #include "hfsplus_raw.h" | |
13 | ||
14 | static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd); | |
15 | static int hfs_brec_update_parent(struct hfs_find_data *fd); | |
16 | static int hfs_btree_inc_height(struct hfs_btree *); | |
17 | ||
18 | /* Get the length and offset of the given record in the given node */ | |
19 | u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) | |
20 | { | |
21 | __be16 retval[2]; | |
22 | u16 dataoff; | |
23 | ||
24 | dataoff = node->tree->node_size - (rec + 2) * 2; | |
25 | hfs_bnode_read(node, retval, dataoff, 4); | |
26 | *off = be16_to_cpu(retval[1]); | |
27 | return be16_to_cpu(retval[0]) - *off; | |
28 | } | |
29 | ||
30 | /* Get the length of the key from a keyed record */ | |
31 | u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) | |
32 | { | |
33 | u16 retval, recoff; | |
34 | ||
35 | if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) | |
36 | return 0; | |
37 | ||
38 | if ((node->type == HFS_NODE_INDEX) && | |
39 | !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { | |
40 | retval = node->tree->max_key_len + 2; | |
41 | } else { | |
42 | recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); | |
43 | if (!recoff) | |
44 | return 0; | |
45 | if (node->tree->attributes & HFS_TREE_BIGKEYS) | |
46 | retval = hfs_bnode_read_u16(node, recoff) + 2; | |
47 | else | |
48 | retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1; | |
49 | } | |
50 | return retval; | |
51 | } | |
52 | ||
53 | int hfs_brec_insert(struct hfs_find_data *fd, void *entry, int entry_len) | |
54 | { | |
55 | struct hfs_btree *tree; | |
56 | struct hfs_bnode *node, *new_node; | |
57 | int size, key_len, rec; | |
58 | int data_off, end_off; | |
59 | int idx_rec_off, data_rec_off, end_rec_off; | |
60 | __be32 cnid; | |
61 | ||
62 | tree = fd->tree; | |
63 | if (!fd->bnode) { | |
64 | if (!tree->root) | |
65 | hfs_btree_inc_height(tree); | |
66 | fd->bnode = hfs_bnode_find(tree, tree->leaf_head); | |
67 | if (IS_ERR(fd->bnode)) | |
68 | return PTR_ERR(fd->bnode); | |
69 | fd->record = -1; | |
70 | } | |
71 | new_node = NULL; | |
72 | key_len = be16_to_cpu(fd->search_key->key_len) + 2; | |
73 | again: | |
74 | /* new record idx and complete record size */ | |
75 | rec = fd->record + 1; | |
76 | size = key_len + entry_len; | |
77 | ||
78 | node = fd->bnode; | |
79 | hfs_bnode_dump(node); | |
80 | /* get last offset */ | |
81 | end_rec_off = tree->node_size - (node->num_recs + 1) * 2; | |
82 | end_off = hfs_bnode_read_u16(node, end_rec_off); | |
83 | end_rec_off -= 2; | |
84 | dprint(DBG_BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", rec, size, end_off, end_rec_off); | |
85 | if (size > end_rec_off - end_off) { | |
86 | if (new_node) | |
87 | panic("not enough room!\n"); | |
88 | new_node = hfs_bnode_split(fd); | |
89 | if (IS_ERR(new_node)) | |
90 | return PTR_ERR(new_node); | |
91 | goto again; | |
92 | } | |
93 | if (node->type == HFS_NODE_LEAF) { | |
94 | tree->leaf_count++; | |
95 | mark_inode_dirty(tree->inode); | |
96 | } | |
97 | node->num_recs++; | |
98 | /* write new last offset */ | |
99 | hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); | |
100 | hfs_bnode_write_u16(node, end_rec_off, end_off + size); | |
101 | data_off = end_off; | |
102 | data_rec_off = end_rec_off + 2; | |
103 | idx_rec_off = tree->node_size - (rec + 1) * 2; | |
104 | if (idx_rec_off == data_rec_off) | |
105 | goto skip; | |
106 | /* move all following entries */ | |
107 | do { | |
108 | data_off = hfs_bnode_read_u16(node, data_rec_off + 2); | |
109 | hfs_bnode_write_u16(node, data_rec_off, data_off + size); | |
110 | data_rec_off += 2; | |
111 | } while (data_rec_off < idx_rec_off); | |
112 | ||
113 | /* move data away */ | |
114 | hfs_bnode_move(node, data_off + size, data_off, | |
115 | end_off - data_off); | |
116 | ||
117 | skip: | |
118 | hfs_bnode_write(node, fd->search_key, data_off, key_len); | |
119 | hfs_bnode_write(node, entry, data_off + key_len, entry_len); | |
120 | hfs_bnode_dump(node); | |
121 | ||
122 | if (new_node) { | |
123 | /* update parent key if we inserted a key | |
124 | * at the start of the first node | |
125 | */ | |
126 | if (!rec && new_node != node) | |
127 | hfs_brec_update_parent(fd); | |
128 | ||
129 | hfs_bnode_put(fd->bnode); | |
130 | if (!new_node->parent) { | |
131 | hfs_btree_inc_height(tree); | |
132 | new_node->parent = tree->root; | |
133 | } | |
134 | fd->bnode = hfs_bnode_find(tree, new_node->parent); | |
135 | ||
136 | /* create index data entry */ | |
137 | cnid = cpu_to_be32(new_node->this); | |
138 | entry = &cnid; | |
139 | entry_len = sizeof(cnid); | |
140 | ||
141 | /* get index key */ | |
142 | hfs_bnode_read_key(new_node, fd->search_key, 14); | |
143 | __hfs_brec_find(fd->bnode, fd); | |
144 | ||
145 | hfs_bnode_put(new_node); | |
146 | new_node = NULL; | |
147 | ||
148 | if (tree->attributes & HFS_TREE_VARIDXKEYS) | |
149 | key_len = be16_to_cpu(fd->search_key->key_len) + 2; | |
150 | else { | |
151 | fd->search_key->key_len = cpu_to_be16(tree->max_key_len); | |
152 | key_len = tree->max_key_len + 2; | |
153 | } | |
154 | goto again; | |
155 | } | |
156 | ||
157 | if (!rec) | |
158 | hfs_brec_update_parent(fd); | |
159 | ||
160 | return 0; | |
161 | } | |
162 | ||
163 | int hfs_brec_remove(struct hfs_find_data *fd) | |
164 | { | |
165 | struct hfs_btree *tree; | |
166 | struct hfs_bnode *node, *parent; | |
167 | int end_off, rec_off, data_off, size; | |
168 | ||
169 | tree = fd->tree; | |
170 | node = fd->bnode; | |
171 | again: | |
172 | rec_off = tree->node_size - (fd->record + 2) * 2; | |
173 | end_off = tree->node_size - (node->num_recs + 1) * 2; | |
174 | ||
175 | if (node->type == HFS_NODE_LEAF) { | |
176 | tree->leaf_count--; | |
177 | mark_inode_dirty(tree->inode); | |
178 | } | |
179 | hfs_bnode_dump(node); | |
180 | dprint(DBG_BNODE_MOD, "remove_rec: %d, %d\n", fd->record, fd->keylength + fd->entrylength); | |
181 | if (!--node->num_recs) { | |
182 | hfs_bnode_unlink(node); | |
183 | if (!node->parent) | |
184 | return 0; | |
185 | parent = hfs_bnode_find(tree, node->parent); | |
186 | if (IS_ERR(parent)) | |
187 | return PTR_ERR(parent); | |
188 | hfs_bnode_put(node); | |
189 | node = fd->bnode = parent; | |
190 | ||
191 | __hfs_brec_find(node, fd); | |
192 | goto again; | |
193 | } | |
194 | hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); | |
195 | ||
196 | if (rec_off == end_off) | |
197 | goto skip; | |
198 | size = fd->keylength + fd->entrylength; | |
199 | ||
200 | do { | |
201 | data_off = hfs_bnode_read_u16(node, rec_off); | |
202 | hfs_bnode_write_u16(node, rec_off + 2, data_off - size); | |
203 | rec_off -= 2; | |
204 | } while (rec_off >= end_off); | |
205 | ||
206 | /* fill hole */ | |
207 | hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size, | |
208 | data_off - fd->keyoffset - size); | |
209 | skip: | |
210 | hfs_bnode_dump(node); | |
211 | if (!fd->record) | |
212 | hfs_brec_update_parent(fd); | |
213 | return 0; | |
214 | } | |
215 | ||
216 | static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | |
217 | { | |
218 | struct hfs_btree *tree; | |
b6b41424 | 219 | struct hfs_bnode *node, *new_node, *next_node; |
1da177e4 LT |
220 | struct hfs_bnode_desc node_desc; |
221 | int num_recs, new_rec_off, new_off, old_rec_off; | |
222 | int data_start, data_end, size; | |
223 | ||
224 | tree = fd->tree; | |
225 | node = fd->bnode; | |
226 | new_node = hfs_bmap_alloc(tree); | |
227 | if (IS_ERR(new_node)) | |
228 | return new_node; | |
229 | hfs_bnode_get(node); | |
230 | dprint(DBG_BNODE_MOD, "split_nodes: %d - %d - %d\n", | |
231 | node->this, new_node->this, node->next); | |
232 | new_node->next = node->next; | |
233 | new_node->prev = node->this; | |
234 | new_node->parent = node->parent; | |
235 | new_node->type = node->type; | |
236 | new_node->height = node->height; | |
237 | ||
b6b41424 AV |
238 | if (node->next) |
239 | next_node = hfs_bnode_find(tree, node->next); | |
240 | else | |
241 | next_node = NULL; | |
242 | ||
243 | if (IS_ERR(next_node)) { | |
244 | hfs_bnode_put(node); | |
245 | hfs_bnode_put(new_node); | |
246 | return next_node; | |
247 | } | |
248 | ||
1da177e4 LT |
249 | size = tree->node_size / 2 - node->num_recs * 2 - 14; |
250 | old_rec_off = tree->node_size - 4; | |
251 | num_recs = 1; | |
252 | for (;;) { | |
253 | data_start = hfs_bnode_read_u16(node, old_rec_off); | |
254 | if (data_start > size) | |
255 | break; | |
256 | old_rec_off -= 2; | |
257 | if (++num_recs < node->num_recs) | |
258 | continue; | |
259 | /* panic? */ | |
260 | hfs_bnode_put(node); | |
261 | hfs_bnode_put(new_node); | |
b6b41424 AV |
262 | if (next_node) |
263 | hfs_bnode_put(next_node); | |
1da177e4 LT |
264 | return ERR_PTR(-ENOSPC); |
265 | } | |
266 | ||
267 | if (fd->record + 1 < num_recs) { | |
268 | /* new record is in the lower half, | |
269 | * so leave some more space there | |
270 | */ | |
271 | old_rec_off += 2; | |
272 | num_recs--; | |
273 | data_start = hfs_bnode_read_u16(node, old_rec_off); | |
274 | } else { | |
275 | hfs_bnode_put(node); | |
276 | hfs_bnode_get(new_node); | |
277 | fd->bnode = new_node; | |
278 | fd->record -= num_recs; | |
279 | fd->keyoffset -= data_start - 14; | |
280 | fd->entryoffset -= data_start - 14; | |
281 | } | |
282 | new_node->num_recs = node->num_recs - num_recs; | |
283 | node->num_recs = num_recs; | |
284 | ||
285 | new_rec_off = tree->node_size - 2; | |
286 | new_off = 14; | |
287 | size = data_start - new_off; | |
288 | num_recs = new_node->num_recs; | |
289 | data_end = data_start; | |
290 | while (num_recs) { | |
291 | hfs_bnode_write_u16(new_node, new_rec_off, new_off); | |
292 | old_rec_off -= 2; | |
293 | new_rec_off -= 2; | |
294 | data_end = hfs_bnode_read_u16(node, old_rec_off); | |
295 | new_off = data_end - size; | |
296 | num_recs--; | |
297 | } | |
298 | hfs_bnode_write_u16(new_node, new_rec_off, new_off); | |
299 | hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start); | |
300 | ||
301 | /* update new bnode header */ | |
302 | node_desc.next = cpu_to_be32(new_node->next); | |
303 | node_desc.prev = cpu_to_be32(new_node->prev); | |
304 | node_desc.type = new_node->type; | |
305 | node_desc.height = new_node->height; | |
306 | node_desc.num_recs = cpu_to_be16(new_node->num_recs); | |
307 | node_desc.reserved = 0; | |
308 | hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); | |
309 | ||
310 | /* update previous bnode header */ | |
311 | node->next = new_node->this; | |
312 | hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc)); | |
313 | node_desc.next = cpu_to_be32(node->next); | |
314 | node_desc.num_recs = cpu_to_be16(node->num_recs); | |
315 | hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc)); | |
316 | ||
317 | /* update next bnode header */ | |
b6b41424 | 318 | if (next_node) { |
1da177e4 LT |
319 | next_node->prev = new_node->this; |
320 | hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); | |
321 | node_desc.prev = cpu_to_be32(next_node->prev); | |
322 | hfs_bnode_write(next_node, &node_desc, 0, sizeof(node_desc)); | |
323 | hfs_bnode_put(next_node); | |
324 | } else if (node->this == tree->leaf_tail) { | |
325 | /* if there is no next node, this might be the new tail */ | |
326 | tree->leaf_tail = new_node->this; | |
327 | mark_inode_dirty(tree->inode); | |
328 | } | |
329 | ||
330 | hfs_bnode_dump(node); | |
331 | hfs_bnode_dump(new_node); | |
332 | hfs_bnode_put(node); | |
333 | ||
334 | return new_node; | |
335 | } | |
336 | ||
337 | static int hfs_brec_update_parent(struct hfs_find_data *fd) | |
338 | { | |
339 | struct hfs_btree *tree; | |
340 | struct hfs_bnode *node, *new_node, *parent; | |
341 | int newkeylen, diff; | |
342 | int rec, rec_off, end_rec_off; | |
343 | int start_off, end_off; | |
344 | ||
345 | tree = fd->tree; | |
346 | node = fd->bnode; | |
347 | new_node = NULL; | |
348 | if (!node->parent) | |
349 | return 0; | |
350 | ||
351 | again: | |
352 | parent = hfs_bnode_find(tree, node->parent); | |
353 | if (IS_ERR(parent)) | |
354 | return PTR_ERR(parent); | |
355 | __hfs_brec_find(parent, fd); | |
356 | hfs_bnode_dump(parent); | |
357 | rec = fd->record; | |
358 | ||
359 | /* size difference between old and new key */ | |
360 | if (tree->attributes & HFS_TREE_VARIDXKEYS) | |
361 | newkeylen = hfs_bnode_read_u16(node, 14) + 2; | |
362 | else | |
363 | fd->keylength = newkeylen = tree->max_key_len + 2; | |
364 | dprint(DBG_BNODE_MOD, "update_rec: %d, %d, %d\n", rec, fd->keylength, newkeylen); | |
365 | ||
366 | rec_off = tree->node_size - (rec + 2) * 2; | |
367 | end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; | |
368 | diff = newkeylen - fd->keylength; | |
369 | if (!diff) | |
370 | goto skip; | |
371 | if (diff > 0) { | |
372 | end_off = hfs_bnode_read_u16(parent, end_rec_off); | |
373 | if (end_rec_off - end_off < diff) { | |
374 | ||
634725a9 | 375 | printk(KERN_DEBUG "hfs: splitting index node...\n"); |
1da177e4 LT |
376 | fd->bnode = parent; |
377 | new_node = hfs_bnode_split(fd); | |
378 | if (IS_ERR(new_node)) | |
379 | return PTR_ERR(new_node); | |
380 | parent = fd->bnode; | |
381 | rec = fd->record; | |
382 | rec_off = tree->node_size - (rec + 2) * 2; | |
383 | end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; | |
384 | } | |
385 | } | |
386 | ||
387 | end_off = start_off = hfs_bnode_read_u16(parent, rec_off); | |
388 | hfs_bnode_write_u16(parent, rec_off, start_off + diff); | |
389 | start_off -= 4; /* move previous cnid too */ | |
390 | ||
391 | while (rec_off > end_rec_off) { | |
392 | rec_off -= 2; | |
393 | end_off = hfs_bnode_read_u16(parent, rec_off); | |
394 | hfs_bnode_write_u16(parent, rec_off, end_off + diff); | |
395 | } | |
396 | hfs_bnode_move(parent, start_off + diff, start_off, | |
397 | end_off - start_off); | |
398 | skip: | |
399 | hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen); | |
400 | hfs_bnode_dump(parent); | |
401 | ||
402 | hfs_bnode_put(node); | |
403 | node = parent; | |
404 | ||
405 | if (new_node) { | |
406 | __be32 cnid; | |
407 | ||
408 | fd->bnode = hfs_bnode_find(tree, new_node->parent); | |
409 | /* create index key and entry */ | |
410 | hfs_bnode_read_key(new_node, fd->search_key, 14); | |
411 | cnid = cpu_to_be32(new_node->this); | |
412 | ||
413 | __hfs_brec_find(fd->bnode, fd); | |
414 | hfs_brec_insert(fd, &cnid, sizeof(cnid)); | |
415 | hfs_bnode_put(fd->bnode); | |
416 | hfs_bnode_put(new_node); | |
417 | ||
418 | if (!rec) { | |
419 | if (new_node == node) | |
420 | goto out; | |
421 | /* restore search_key */ | |
422 | hfs_bnode_read_key(node, fd->search_key, 14); | |
423 | } | |
424 | } | |
425 | ||
426 | if (!rec && node->parent) | |
427 | goto again; | |
428 | out: | |
429 | fd->bnode = node; | |
430 | return 0; | |
431 | } | |
432 | ||
433 | static int hfs_btree_inc_height(struct hfs_btree *tree) | |
434 | { | |
435 | struct hfs_bnode *node, *new_node; | |
436 | struct hfs_bnode_desc node_desc; | |
437 | int key_size, rec; | |
438 | __be32 cnid; | |
439 | ||
440 | node = NULL; | |
441 | if (tree->root) { | |
442 | node = hfs_bnode_find(tree, tree->root); | |
443 | if (IS_ERR(node)) | |
444 | return PTR_ERR(node); | |
445 | } | |
446 | new_node = hfs_bmap_alloc(tree); | |
447 | if (IS_ERR(new_node)) { | |
448 | hfs_bnode_put(node); | |
449 | return PTR_ERR(new_node); | |
450 | } | |
451 | ||
452 | tree->root = new_node->this; | |
453 | if (!tree->depth) { | |
454 | tree->leaf_head = tree->leaf_tail = new_node->this; | |
455 | new_node->type = HFS_NODE_LEAF; | |
456 | new_node->num_recs = 0; | |
457 | } else { | |
458 | new_node->type = HFS_NODE_INDEX; | |
459 | new_node->num_recs = 1; | |
460 | } | |
461 | new_node->parent = 0; | |
462 | new_node->next = 0; | |
463 | new_node->prev = 0; | |
464 | new_node->height = ++tree->depth; | |
465 | ||
466 | node_desc.next = cpu_to_be32(new_node->next); | |
467 | node_desc.prev = cpu_to_be32(new_node->prev); | |
468 | node_desc.type = new_node->type; | |
469 | node_desc.height = new_node->height; | |
470 | node_desc.num_recs = cpu_to_be16(new_node->num_recs); | |
471 | node_desc.reserved = 0; | |
472 | hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); | |
473 | ||
474 | rec = tree->node_size - 2; | |
475 | hfs_bnode_write_u16(new_node, rec, 14); | |
476 | ||
477 | if (node) { | |
478 | /* insert old root idx into new root */ | |
479 | node->parent = tree->root; | |
480 | if (node->type == HFS_NODE_LEAF || | |
481 | tree->attributes & HFS_TREE_VARIDXKEYS) | |
482 | key_size = hfs_bnode_read_u16(node, 14) + 2; | |
483 | else | |
484 | key_size = tree->max_key_len + 2; | |
485 | hfs_bnode_copy(new_node, 14, node, 14, key_size); | |
486 | ||
487 | if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) { | |
488 | key_size = tree->max_key_len + 2; | |
489 | hfs_bnode_write_u16(new_node, 14, tree->max_key_len); | |
490 | } | |
491 | cnid = cpu_to_be32(node->this); | |
492 | hfs_bnode_write(new_node, &cnid, 14 + key_size, 4); | |
493 | ||
494 | rec -= 2; | |
495 | hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); | |
496 | ||
497 | hfs_bnode_put(node); | |
498 | } | |
499 | hfs_bnode_put(new_node); | |
500 | mark_inode_dirty(tree->inode); | |
501 | ||
502 | return 0; | |
503 | } |