blob: 759708fd9331cc37a6775c31e068117eddbec11d [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/fs/hfsplus/bnode.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Handle basic btree node operations
9 */
10
11#include <linux/string.h>
12#include <linux/slab.h>
13#include <linux/pagemap.h>
14#include <linux/fs.h>
15#include <linux/swap.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016
17#include "hfsplus_fs.h"
18#include "hfsplus_raw.h"
19
Linus Torvalds1da177e2005-04-16 15:20:36 -070020/* Copy a specified range of bytes from the raw data of a node */
21void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len)
22{
23 struct page **pagep;
24 int l;
25
26 off += node->page_offset;
27 pagep = node->page + (off >> PAGE_CACHE_SHIFT);
28 off &= ~PAGE_CACHE_MASK;
29
Fabian Fredericke46707d2014-06-06 14:36:25 -070030 l = min_t(int, len, PAGE_CACHE_SIZE - off);
Linus Torvalds1da177e2005-04-16 15:20:36 -070031 memcpy(buf, kmap(*pagep) + off, l);
32 kunmap(*pagep);
33
34 while ((len -= l) != 0) {
35 buf += l;
Fabian Fredericke46707d2014-06-06 14:36:25 -070036 l = min_t(int, len, PAGE_CACHE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -070037 memcpy(buf, kmap(*++pagep), l);
38 kunmap(*pagep);
39 }
40}
41
42u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
43{
44 __be16 data;
Anton Salikhmetov21f22962010-12-16 18:08:39 +020045 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 hfs_bnode_read(node, &data, off, 2);
47 return be16_to_cpu(data);
48}
49
50u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
51{
52 u8 data;
Anton Salikhmetov21f22962010-12-16 18:08:39 +020053 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 hfs_bnode_read(node, &data, off, 1);
55 return data;
56}
57
58void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
59{
60 struct hfs_btree *tree;
61 int key_len;
62
63 tree = node->tree;
64 if (node->type == HFS_NODE_LEAF ||
Vyacheslav Dubeyko324ef392013-02-27 17:03:04 -080065 tree->attributes & HFS_TREE_VARIDXKEYS ||
66 node->tree->cnid == HFSPLUS_ATTR_CNID)
Linus Torvalds1da177e2005-04-16 15:20:36 -070067 key_len = hfs_bnode_read_u16(node, off) + 2;
68 else
69 key_len = tree->max_key_len + 2;
70
71 hfs_bnode_read(node, key, off, key_len);
72}
73
74void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
75{
76 struct page **pagep;
77 int l;
78
79 off += node->page_offset;
80 pagep = node->page + (off >> PAGE_CACHE_SHIFT);
81 off &= ~PAGE_CACHE_MASK;
82
Fabian Fredericke46707d2014-06-06 14:36:25 -070083 l = min_t(int, len, PAGE_CACHE_SIZE - off);
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 memcpy(kmap(*pagep) + off, buf, l);
85 set_page_dirty(*pagep);
86 kunmap(*pagep);
87
88 while ((len -= l) != 0) {
89 buf += l;
Fabian Fredericke46707d2014-06-06 14:36:25 -070090 l = min_t(int, len, PAGE_CACHE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 memcpy(kmap(*++pagep), buf, l);
92 set_page_dirty(*pagep);
93 kunmap(*pagep);
94 }
95}
96
97void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
98{
99 __be16 v = cpu_to_be16(data);
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200100 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 hfs_bnode_write(node, &v, off, 2);
102}
103
104void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
105{
106 struct page **pagep;
107 int l;
108
109 off += node->page_offset;
110 pagep = node->page + (off >> PAGE_CACHE_SHIFT);
111 off &= ~PAGE_CACHE_MASK;
112
Fabian Fredericke46707d2014-06-06 14:36:25 -0700113 l = min_t(int, len, PAGE_CACHE_SIZE - off);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114 memset(kmap(*pagep) + off, 0, l);
115 set_page_dirty(*pagep);
116 kunmap(*pagep);
117
118 while ((len -= l) != 0) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700119 l = min_t(int, len, PAGE_CACHE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 memset(kmap(*++pagep), 0, l);
121 set_page_dirty(*pagep);
122 kunmap(*pagep);
123 }
124}
125
126void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst,
127 struct hfs_bnode *src_node, int src, int len)
128{
129 struct hfs_btree *tree;
130 struct page **src_page, **dst_page;
131 int l;
132
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700133 hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134 if (!len)
135 return;
136 tree = src_node->tree;
137 src += src_node->page_offset;
138 dst += dst_node->page_offset;
139 src_page = src_node->page + (src >> PAGE_CACHE_SHIFT);
140 src &= ~PAGE_CACHE_MASK;
141 dst_page = dst_node->page + (dst >> PAGE_CACHE_SHIFT);
142 dst &= ~PAGE_CACHE_MASK;
143
144 if (src == dst) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700145 l = min_t(int, len, PAGE_CACHE_SIZE - src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146 memcpy(kmap(*dst_page) + src, kmap(*src_page) + src, l);
147 kunmap(*src_page);
148 set_page_dirty(*dst_page);
149 kunmap(*dst_page);
150
151 while ((len -= l) != 0) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700152 l = min_t(int, len, PAGE_CACHE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 memcpy(kmap(*++dst_page), kmap(*++src_page), l);
154 kunmap(*src_page);
155 set_page_dirty(*dst_page);
156 kunmap(*dst_page);
157 }
158 } else {
159 void *src_ptr, *dst_ptr;
160
161 do {
162 src_ptr = kmap(*src_page) + src;
163 dst_ptr = kmap(*dst_page) + dst;
164 if (PAGE_CACHE_SIZE - src < PAGE_CACHE_SIZE - dst) {
165 l = PAGE_CACHE_SIZE - src;
166 src = 0;
167 dst += l;
168 } else {
169 l = PAGE_CACHE_SIZE - dst;
170 src += l;
171 dst = 0;
172 }
173 l = min(len, l);
174 memcpy(dst_ptr, src_ptr, l);
175 kunmap(*src_page);
176 set_page_dirty(*dst_page);
177 kunmap(*dst_page);
178 if (!dst)
179 dst_page++;
180 else
181 src_page++;
182 } while ((len -= l));
183 }
184}
185
186void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
187{
188 struct page **src_page, **dst_page;
189 int l;
190
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700191 hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192 if (!len)
193 return;
194 src += node->page_offset;
195 dst += node->page_offset;
196 if (dst > src) {
197 src += len - 1;
198 src_page = node->page + (src >> PAGE_CACHE_SHIFT);
199 src = (src & ~PAGE_CACHE_MASK) + 1;
200 dst += len - 1;
201 dst_page = node->page + (dst >> PAGE_CACHE_SHIFT);
202 dst = (dst & ~PAGE_CACHE_MASK) + 1;
203
204 if (src == dst) {
205 while (src < len) {
206 memmove(kmap(*dst_page), kmap(*src_page), src);
207 kunmap(*src_page);
208 set_page_dirty(*dst_page);
209 kunmap(*dst_page);
210 len -= src;
211 src = PAGE_CACHE_SIZE;
212 src_page--;
213 dst_page--;
214 }
215 src -= len;
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200216 memmove(kmap(*dst_page) + src,
217 kmap(*src_page) + src, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 kunmap(*src_page);
219 set_page_dirty(*dst_page);
220 kunmap(*dst_page);
221 } else {
222 void *src_ptr, *dst_ptr;
223
224 do {
225 src_ptr = kmap(*src_page) + src;
226 dst_ptr = kmap(*dst_page) + dst;
227 if (src < dst) {
228 l = src;
229 src = PAGE_CACHE_SIZE;
230 dst -= l;
231 } else {
232 l = dst;
233 src -= l;
234 dst = PAGE_CACHE_SIZE;
235 }
236 l = min(len, l);
237 memmove(dst_ptr - l, src_ptr - l, l);
238 kunmap(*src_page);
239 set_page_dirty(*dst_page);
240 kunmap(*dst_page);
241 if (dst == PAGE_CACHE_SIZE)
242 dst_page--;
243 else
244 src_page--;
245 } while ((len -= l));
246 }
247 } else {
248 src_page = node->page + (src >> PAGE_CACHE_SHIFT);
249 src &= ~PAGE_CACHE_MASK;
250 dst_page = node->page + (dst >> PAGE_CACHE_SHIFT);
251 dst &= ~PAGE_CACHE_MASK;
252
253 if (src == dst) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700254 l = min_t(int, len, PAGE_CACHE_SIZE - src);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200255 memmove(kmap(*dst_page) + src,
256 kmap(*src_page) + src, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 kunmap(*src_page);
258 set_page_dirty(*dst_page);
259 kunmap(*dst_page);
260
261 while ((len -= l) != 0) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700262 l = min_t(int, len, PAGE_CACHE_SIZE);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200263 memmove(kmap(*++dst_page),
264 kmap(*++src_page), l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 kunmap(*src_page);
266 set_page_dirty(*dst_page);
267 kunmap(*dst_page);
268 }
269 } else {
270 void *src_ptr, *dst_ptr;
271
272 do {
273 src_ptr = kmap(*src_page) + src;
274 dst_ptr = kmap(*dst_page) + dst;
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200275 if (PAGE_CACHE_SIZE - src <
276 PAGE_CACHE_SIZE - dst) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 l = PAGE_CACHE_SIZE - src;
278 src = 0;
279 dst += l;
280 } else {
281 l = PAGE_CACHE_SIZE - dst;
282 src += l;
283 dst = 0;
284 }
285 l = min(len, l);
286 memmove(dst_ptr, src_ptr, l);
287 kunmap(*src_page);
288 set_page_dirty(*dst_page);
289 kunmap(*dst_page);
290 if (!dst)
291 dst_page++;
292 else
293 src_page++;
294 } while ((len -= l));
295 }
296 }
297}
298
299void hfs_bnode_dump(struct hfs_bnode *node)
300{
301 struct hfs_bnode_desc desc;
302 __be32 cnid;
303 int i, off, key_off;
304
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700305 hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 hfs_bnode_read(node, &desc, 0, sizeof(desc));
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700307 hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308 be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
309 desc.type, desc.height, be16_to_cpu(desc.num_recs));
310
311 off = node->tree->node_size - 2;
312 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
313 key_off = hfs_bnode_read_u16(node, off);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700314 hfs_dbg(BNODE_MOD, " %d", key_off);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 if (i && node->type == HFS_NODE_INDEX) {
316 int tmp;
317
Vyacheslav Dubeyko324ef392013-02-27 17:03:04 -0800318 if (node->tree->attributes & HFS_TREE_VARIDXKEYS ||
319 node->tree->cnid == HFSPLUS_ATTR_CNID)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 tmp = hfs_bnode_read_u16(node, key_off) + 2;
321 else
322 tmp = node->tree->max_key_len + 2;
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700323 hfs_dbg_cont(BNODE_MOD, " (%d", tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700325 hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 } else if (i && node->type == HFS_NODE_LEAF) {
327 int tmp;
328
329 tmp = hfs_bnode_read_u16(node, key_off);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700330 hfs_dbg_cont(BNODE_MOD, " (%d)", tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 }
332 }
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700333 hfs_dbg_cont(BNODE_MOD, "\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334}
335
336void hfs_bnode_unlink(struct hfs_bnode *node)
337{
338 struct hfs_btree *tree;
339 struct hfs_bnode *tmp;
340 __be32 cnid;
341
342 tree = node->tree;
343 if (node->prev) {
344 tmp = hfs_bnode_find(tree, node->prev);
345 if (IS_ERR(tmp))
346 return;
347 tmp->next = node->next;
348 cnid = cpu_to_be32(tmp->next);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200349 hfs_bnode_write(tmp, &cnid,
350 offsetof(struct hfs_bnode_desc, next), 4);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 hfs_bnode_put(tmp);
352 } else if (node->type == HFS_NODE_LEAF)
353 tree->leaf_head = node->next;
354
355 if (node->next) {
356 tmp = hfs_bnode_find(tree, node->next);
357 if (IS_ERR(tmp))
358 return;
359 tmp->prev = node->prev;
360 cnid = cpu_to_be32(tmp->prev);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200361 hfs_bnode_write(tmp, &cnid,
362 offsetof(struct hfs_bnode_desc, prev), 4);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 hfs_bnode_put(tmp);
364 } else if (node->type == HFS_NODE_LEAF)
365 tree->leaf_tail = node->prev;
366
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200367 /* move down? */
Anton Salikhmetovb2837fc2010-12-16 18:08:41 +0200368 if (!node->prev && !node->next)
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700369 hfs_dbg(BNODE_MOD, "hfs_btree_del_level\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 if (!node->parent) {
371 tree->root = 0;
372 tree->depth = 0;
373 }
374 set_bit(HFS_BNODE_DELETED, &node->flags);
375}
376
377static inline int hfs_bnode_hash(u32 num)
378{
379 num = (num >> 16) + num;
380 num += num >> 8;
381 return num & (NODE_HASH_SIZE - 1);
382}
383
384struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
385{
386 struct hfs_bnode *node;
387
388 if (cnid >= tree->node_count) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700389 pr_err("request for non-existent node %d in B*Tree\n",
390 cnid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 return NULL;
392 }
393
394 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
Anton Salikhmetovb2837fc2010-12-16 18:08:41 +0200395 node; node = node->next_hash)
396 if (node->this == cnid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397 return node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398 return NULL;
399}
400
401static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
402{
403 struct super_block *sb;
404 struct hfs_bnode *node, *node2;
405 struct address_space *mapping;
406 struct page *page;
407 int size, block, i, hash;
408 loff_t off;
409
410 if (cnid >= tree->node_count) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700411 pr_err("request for non-existent node %d in B*Tree\n",
412 cnid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 return NULL;
414 }
415
416 sb = tree->inode->i_sb;
417 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
418 sizeof(struct page *);
Panagiotis Issarisf8314dc2006-09-27 01:49:37 -0700419 node = kzalloc(size, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420 if (!node)
421 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 node->tree = tree;
423 node->this = cnid;
424 set_bit(HFS_BNODE_NEW, &node->flags);
425 atomic_set(&node->refcnt, 1);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700426 hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n",
427 node->tree->cnid, node->this);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 init_waitqueue_head(&node->lock_wq);
429 spin_lock(&tree->hash_lock);
430 node2 = hfs_bnode_findhash(tree, cnid);
431 if (!node2) {
432 hash = hfs_bnode_hash(cnid);
433 node->next_hash = tree->node_hash[hash];
434 tree->node_hash[hash] = node;
435 tree->node_hash_cnt++;
436 } else {
437 spin_unlock(&tree->hash_lock);
438 kfree(node);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200439 wait_event(node2->lock_wq,
440 !test_bit(HFS_BNODE_NEW, &node2->flags));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 return node2;
442 }
443 spin_unlock(&tree->hash_lock);
444
445 mapping = tree->inode->i_mapping;
446 off = (loff_t)cnid << tree->node_size_shift;
447 block = off >> PAGE_CACHE_SHIFT;
448 node->page_offset = off & ~PAGE_CACHE_MASK;
449 for (i = 0; i < tree->pages_per_bnode; block++, i++) {
Pekka Enberg090d2b12006-06-23 02:05:08 -0700450 page = read_mapping_page(mapping, block, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451 if (IS_ERR(page))
452 goto fail;
453 if (PageError(page)) {
454 page_cache_release(page);
455 goto fail;
456 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 page_cache_release(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458 node->page[i] = page;
459 }
460
461 return node;
462fail:
463 set_bit(HFS_BNODE_ERROR, &node->flags);
464 return node;
465}
466
467void hfs_bnode_unhash(struct hfs_bnode *node)
468{
469 struct hfs_bnode **p;
470
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700471 hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472 node->tree->cnid, node->this, atomic_read(&node->refcnt));
473 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
474 *p && *p != node; p = &(*p)->next_hash)
475 ;
Eric Sesterhenn0bf3ba52006-04-01 01:14:43 +0200476 BUG_ON(!*p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 *p = node->next_hash;
478 node->tree->node_hash_cnt--;
479}
480
481/* Load a particular node out of a tree */
482struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
483{
484 struct hfs_bnode *node;
485 struct hfs_bnode_desc *desc;
486 int i, rec_off, off, next_off;
487 int entry_size, key_size;
488
489 spin_lock(&tree->hash_lock);
490 node = hfs_bnode_findhash(tree, num);
491 if (node) {
492 hfs_bnode_get(node);
493 spin_unlock(&tree->hash_lock);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200494 wait_event(node->lock_wq,
495 !test_bit(HFS_BNODE_NEW, &node->flags));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 if (test_bit(HFS_BNODE_ERROR, &node->flags))
497 goto node_error;
498 return node;
499 }
500 spin_unlock(&tree->hash_lock);
501 node = __hfs_bnode_create(tree, num);
502 if (!node)
503 return ERR_PTR(-ENOMEM);
504 if (test_bit(HFS_BNODE_ERROR, &node->flags))
505 goto node_error;
506 if (!test_bit(HFS_BNODE_NEW, &node->flags))
507 return node;
508
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200509 desc = (struct hfs_bnode_desc *)(kmap(node->page[0]) +
510 node->page_offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 node->prev = be32_to_cpu(desc->prev);
512 node->next = be32_to_cpu(desc->next);
513 node->num_recs = be16_to_cpu(desc->num_recs);
514 node->type = desc->type;
515 node->height = desc->height;
516 kunmap(node->page[0]);
517
518 switch (node->type) {
519 case HFS_NODE_HEADER:
520 case HFS_NODE_MAP:
521 if (node->height != 0)
522 goto node_error;
523 break;
524 case HFS_NODE_LEAF:
525 if (node->height != 1)
526 goto node_error;
527 break;
528 case HFS_NODE_INDEX:
529 if (node->height <= 1 || node->height > tree->depth)
530 goto node_error;
531 break;
532 default:
533 goto node_error;
534 }
535
536 rec_off = tree->node_size - 2;
537 off = hfs_bnode_read_u16(node, rec_off);
538 if (off != sizeof(struct hfs_bnode_desc))
539 goto node_error;
540 for (i = 1; i <= node->num_recs; off = next_off, i++) {
541 rec_off -= 2;
542 next_off = hfs_bnode_read_u16(node, rec_off);
543 if (next_off <= off ||
544 next_off > tree->node_size ||
545 next_off & 1)
546 goto node_error;
547 entry_size = next_off - off;
548 if (node->type != HFS_NODE_INDEX &&
549 node->type != HFS_NODE_LEAF)
550 continue;
551 key_size = hfs_bnode_read_u16(node, off) + 2;
552 if (key_size >= entry_size || key_size & 1)
553 goto node_error;
554 }
555 clear_bit(HFS_BNODE_NEW, &node->flags);
556 wake_up(&node->lock_wq);
557 return node;
558
559node_error:
560 set_bit(HFS_BNODE_ERROR, &node->flags);
561 clear_bit(HFS_BNODE_NEW, &node->flags);
562 wake_up(&node->lock_wq);
563 hfs_bnode_put(node);
564 return ERR_PTR(-EIO);
565}
566
567void hfs_bnode_free(struct hfs_bnode *node)
568{
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200569#if 0
570 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200572 for (i = 0; i < node->tree->pages_per_bnode; i++)
573 if (node->page[i])
574 page_cache_release(node->page[i]);
575#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700576 kfree(node);
577}
578
579struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
580{
581 struct hfs_bnode *node;
582 struct page **pagep;
583 int i;
584
585 spin_lock(&tree->hash_lock);
586 node = hfs_bnode_findhash(tree, num);
587 spin_unlock(&tree->hash_lock);
588 if (node) {
Joe Perchesd6142672013-04-30 15:27:55 -0700589 pr_crit("new node %u already hashed?\n", num);
Roman Zippel634725a2006-01-18 17:43:05 -0800590 WARN_ON(1);
591 return node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592 }
593 node = __hfs_bnode_create(tree, num);
594 if (!node)
595 return ERR_PTR(-ENOMEM);
596 if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
597 hfs_bnode_put(node);
598 return ERR_PTR(-EIO);
599 }
600
601 pagep = node->page;
602 memset(kmap(*pagep) + node->page_offset, 0,
Fabian Fredericke46707d2014-06-06 14:36:25 -0700603 min_t(int, PAGE_CACHE_SIZE, tree->node_size));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 set_page_dirty(*pagep);
605 kunmap(*pagep);
606 for (i = 1; i < tree->pages_per_bnode; i++) {
607 memset(kmap(*++pagep), 0, PAGE_CACHE_SIZE);
608 set_page_dirty(*pagep);
609 kunmap(*pagep);
610 }
611 clear_bit(HFS_BNODE_NEW, &node->flags);
612 wake_up(&node->lock_wq);
613
614 return node;
615}
616
617void hfs_bnode_get(struct hfs_bnode *node)
618{
619 if (node) {
620 atomic_inc(&node->refcnt);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700621 hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n",
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200622 node->tree->cnid, node->this,
623 atomic_read(&node->refcnt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624 }
625}
626
627/* Dispose of resources used by a node */
628void hfs_bnode_put(struct hfs_bnode *node)
629{
630 if (node) {
631 struct hfs_btree *tree = node->tree;
632 int i;
633
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700634 hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n",
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200635 node->tree->cnid, node->this,
636 atomic_read(&node->refcnt));
Eric Sesterhenn0bf3ba52006-04-01 01:14:43 +0200637 BUG_ON(!atomic_read(&node->refcnt));
Roman Zippela5e39852005-09-06 15:18:47 -0700638 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 for (i = 0; i < tree->pages_per_bnode; i++) {
Roman Zippel74f9c9c2005-08-01 21:11:41 -0700641 if (!node->page[i])
642 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 mark_page_accessed(node->page[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700644 }
645
646 if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
647 hfs_bnode_unhash(node);
648 spin_unlock(&tree->hash_lock);
Sergei Antonov2cd282a2014-06-06 14:36:28 -0700649 if (hfs_bnode_need_zeroout(tree))
650 hfs_bnode_clear(node, 0, tree->node_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651 hfs_bmap_free(node);
652 hfs_bnode_free(node);
653 return;
654 }
655 spin_unlock(&tree->hash_lock);
656 }
657}
658
Sergei Antonov2cd282a2014-06-06 14:36:28 -0700659/*
660 * Unused nodes have to be zeroed if this is the catalog tree and
661 * a corresponding flag in the volume header is set.
662 */
663bool hfs_bnode_need_zeroout(struct hfs_btree *tree)
664{
665 struct super_block *sb = tree->inode->i_sb;
666 struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
667 const u32 volume_attr = be32_to_cpu(sbi->s_vhdr->attributes);
668
669 return tree->cnid == HFSPLUS_CAT_CNID &&
670 volume_attr & HFSPLUS_VOL_UNUSED_NODE_FIX;
671}