blob: 87974d5e679156c63809dbae93ddcf32e1e9ab18 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Linus Torvalds1da177e2005-04-16 15:20:36 -07002/*
3 * linux/fs/hfsplus/bnode.c
4 *
5 * Copyright (C) 2001
6 * Brad Boyer (flar@allandria.com)
7 * (C) 2003 Ardis Technologies <roman@ardistech.com>
8 *
9 * Handle basic btree node operations
10 */
11
12#include <linux/string.h>
13#include <linux/slab.h>
14#include <linux/pagemap.h>
15#include <linux/fs.h>
16#include <linux/swap.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017
18#include "hfsplus_fs.h"
19#include "hfsplus_raw.h"
20
Linus Torvalds1da177e2005-04-16 15:20:36 -070021/* Copy a specified range of bytes from the raw data of a node */
22void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len)
23{
24 struct page **pagep;
25 int l;
26
27 off += node->page_offset;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030028 pagep = node->page + (off >> PAGE_SHIFT);
29 off &= ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -070030
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030031 l = min_t(int, len, PAGE_SIZE - off);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +020032 memcpy_from_page(buf, *pagep, off, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
34 while ((len -= l) != 0) {
35 buf += l;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030036 l = min_t(int, len, PAGE_SIZE);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +020037 memcpy_from_page(buf, *++pagep, 0, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -070038 }
39}
40
41u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
42{
43 __be16 data;
Anton Salikhmetov21f22962010-12-16 18:08:39 +020044 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 hfs_bnode_read(node, &data, off, 2);
46 return be16_to_cpu(data);
47}
48
49u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
50{
51 u8 data;
Anton Salikhmetov21f22962010-12-16 18:08:39 +020052 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 hfs_bnode_read(node, &data, off, 1);
54 return data;
55}
56
57void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
58{
59 struct hfs_btree *tree;
60 int key_len;
61
62 tree = node->tree;
63 if (node->type == HFS_NODE_LEAF ||
Vyacheslav Dubeyko324ef392013-02-27 17:03:04 -080064 tree->attributes & HFS_TREE_VARIDXKEYS ||
65 node->tree->cnid == HFSPLUS_ATTR_CNID)
Linus Torvalds1da177e2005-04-16 15:20:36 -070066 key_len = hfs_bnode_read_u16(node, off) + 2;
67 else
68 key_len = tree->max_key_len + 2;
69
70 hfs_bnode_read(node, key, off, key_len);
71}
72
73void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
74{
75 struct page **pagep;
76 int l;
77
78 off += node->page_offset;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030079 pagep = node->page + (off >> PAGE_SHIFT);
80 off &= ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -070081
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030082 l = min_t(int, len, PAGE_SIZE - off);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +020083 memcpy_to_page(*pagep, off, buf, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -070085
86 while ((len -= l) != 0) {
87 buf += l;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +030088 l = min_t(int, len, PAGE_SIZE);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +020089 memcpy_to_page(*++pagep, 0, buf, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 }
92}
93
94void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
95{
96 __be16 v = cpu_to_be16(data);
Anton Salikhmetov21f22962010-12-16 18:08:39 +020097 /* TODO: optimize later... */
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 hfs_bnode_write(node, &v, off, 2);
99}
100
101void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
102{
103 struct page **pagep;
104 int l;
105
106 off += node->page_offset;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300107 pagep = node->page + (off >> PAGE_SHIFT);
108 off &= ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300110 l = min_t(int, len, PAGE_SIZE - off);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200111 memzero_page(*pagep, off, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
114 while ((len -= l) != 0) {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300115 l = min_t(int, len, PAGE_SIZE);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200116 memzero_page(*++pagep, 0, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118 }
119}
120
121void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst,
122 struct hfs_bnode *src_node, int src, int len)
123{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 struct page **src_page, **dst_page;
125 int l;
126
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700127 hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 if (!len)
129 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130 src += src_node->page_offset;
131 dst += dst_node->page_offset;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300132 src_page = src_node->page + (src >> PAGE_SHIFT);
133 src &= ~PAGE_MASK;
134 dst_page = dst_node->page + (dst >> PAGE_SHIFT);
135 dst &= ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136
137 if (src == dst) {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300138 l = min_t(int, len, PAGE_SIZE - src);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200139 memcpy_page(*dst_page, src, *src_page, src, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 set_page_dirty(*dst_page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141
142 while ((len -= l) != 0) {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300143 l = min_t(int, len, PAGE_SIZE);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200144 memcpy_page(*++dst_page, 0, *++src_page, 0, l);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 set_page_dirty(*dst_page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146 }
147 } else {
148 void *src_ptr, *dst_ptr;
149
150 do {
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200151 dst_ptr = kmap_local_page(*dst_page) + dst;
152 src_ptr = kmap_local_page(*src_page) + src;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300153 if (PAGE_SIZE - src < PAGE_SIZE - dst) {
154 l = PAGE_SIZE - src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 src = 0;
156 dst += l;
157 } else {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300158 l = PAGE_SIZE - dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 src += l;
160 dst = 0;
161 }
162 l = min(len, l);
163 memcpy(dst_ptr, src_ptr, l);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200164 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200166 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 if (!dst)
168 dst_page++;
169 else
170 src_page++;
171 } while ((len -= l));
172 }
173}
174
175void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
176{
177 struct page **src_page, **dst_page;
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200178 void *src_ptr, *dst_ptr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 int l;
180
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700181 hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 if (!len)
183 return;
184 src += node->page_offset;
185 dst += node->page_offset;
186 if (dst > src) {
187 src += len - 1;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300188 src_page = node->page + (src >> PAGE_SHIFT);
189 src = (src & ~PAGE_MASK) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 dst += len - 1;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300191 dst_page = node->page + (dst >> PAGE_SHIFT);
192 dst = (dst & ~PAGE_MASK) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193
194 if (src == dst) {
195 while (src < len) {
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200196 dst_ptr = kmap_local_page(*dst_page);
197 src_ptr = kmap_local_page(*src_page);
198 memmove(dst_ptr, src_ptr, src);
199 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200201 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 len -= src;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300203 src = PAGE_SIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 src_page--;
205 dst_page--;
206 }
207 src -= len;
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200208 dst_ptr = kmap_local_page(*dst_page);
209 src_ptr = kmap_local_page(*src_page);
210 memmove(dst_ptr + src, src_ptr + src, len);
211 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200213 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 do {
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200216 dst_ptr = kmap_local_page(*dst_page) + dst;
217 src_ptr = kmap_local_page(*src_page) + src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 if (src < dst) {
219 l = src;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300220 src = PAGE_SIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221 dst -= l;
222 } else {
223 l = dst;
224 src -= l;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300225 dst = PAGE_SIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 }
227 l = min(len, l);
228 memmove(dst_ptr - l, src_ptr - l, l);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200229 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200231 kunmap_local(dst_ptr);
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300232 if (dst == PAGE_SIZE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 dst_page--;
234 else
235 src_page--;
236 } while ((len -= l));
237 }
238 } else {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300239 src_page = node->page + (src >> PAGE_SHIFT);
240 src &= ~PAGE_MASK;
241 dst_page = node->page + (dst >> PAGE_SHIFT);
242 dst &= ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243
244 if (src == dst) {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300245 l = min_t(int, len, PAGE_SIZE - src);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200246
247 dst_ptr = kmap_local_page(*dst_page) + src;
248 src_ptr = kmap_local_page(*src_page) + src;
249 memmove(dst_ptr, src_ptr, l);
250 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200252 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253
254 while ((len -= l) != 0) {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300255 l = min_t(int, len, PAGE_SIZE);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200256 dst_ptr = kmap_local_page(*++dst_page);
257 src_ptr = kmap_local_page(*++src_page);
258 memmove(dst_ptr, src_ptr, l);
259 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200261 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 }
263 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 do {
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200265 dst_ptr = kmap_local_page(*dst_page) + dst;
266 src_ptr = kmap_local_page(*src_page) + src;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300267 if (PAGE_SIZE - src <
268 PAGE_SIZE - dst) {
269 l = PAGE_SIZE - src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 src = 0;
271 dst += l;
272 } else {
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300273 l = PAGE_SIZE - dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 src += l;
275 dst = 0;
276 }
277 l = min(len, l);
278 memmove(dst_ptr, src_ptr, l);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200279 kunmap_local(src_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 set_page_dirty(*dst_page);
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200281 kunmap_local(dst_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 if (!dst)
283 dst_page++;
284 else
285 src_page++;
286 } while ((len -= l));
287 }
288 }
289}
290
291void hfs_bnode_dump(struct hfs_bnode *node)
292{
293 struct hfs_bnode_desc desc;
294 __be32 cnid;
295 int i, off, key_off;
296
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700297 hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 hfs_bnode_read(node, &desc, 0, sizeof(desc));
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700299 hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300 be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
301 desc.type, desc.height, be16_to_cpu(desc.num_recs));
302
303 off = node->tree->node_size - 2;
304 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
305 key_off = hfs_bnode_read_u16(node, off);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700306 hfs_dbg(BNODE_MOD, " %d", key_off);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307 if (i && node->type == HFS_NODE_INDEX) {
308 int tmp;
309
Vyacheslav Dubeyko324ef392013-02-27 17:03:04 -0800310 if (node->tree->attributes & HFS_TREE_VARIDXKEYS ||
311 node->tree->cnid == HFSPLUS_ATTR_CNID)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 tmp = hfs_bnode_read_u16(node, key_off) + 2;
313 else
314 tmp = node->tree->max_key_len + 2;
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700315 hfs_dbg_cont(BNODE_MOD, " (%d", tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700317 hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 } else if (i && node->type == HFS_NODE_LEAF) {
319 int tmp;
320
321 tmp = hfs_bnode_read_u16(node, key_off);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700322 hfs_dbg_cont(BNODE_MOD, " (%d)", tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 }
324 }
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700325 hfs_dbg_cont(BNODE_MOD, "\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326}
327
328void hfs_bnode_unlink(struct hfs_bnode *node)
329{
330 struct hfs_btree *tree;
331 struct hfs_bnode *tmp;
332 __be32 cnid;
333
334 tree = node->tree;
335 if (node->prev) {
336 tmp = hfs_bnode_find(tree, node->prev);
337 if (IS_ERR(tmp))
338 return;
339 tmp->next = node->next;
340 cnid = cpu_to_be32(tmp->next);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200341 hfs_bnode_write(tmp, &cnid,
342 offsetof(struct hfs_bnode_desc, next), 4);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343 hfs_bnode_put(tmp);
344 } else if (node->type == HFS_NODE_LEAF)
345 tree->leaf_head = node->next;
346
347 if (node->next) {
348 tmp = hfs_bnode_find(tree, node->next);
349 if (IS_ERR(tmp))
350 return;
351 tmp->prev = node->prev;
352 cnid = cpu_to_be32(tmp->prev);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200353 hfs_bnode_write(tmp, &cnid,
354 offsetof(struct hfs_bnode_desc, prev), 4);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 hfs_bnode_put(tmp);
356 } else if (node->type == HFS_NODE_LEAF)
357 tree->leaf_tail = node->prev;
358
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200359 /* move down? */
Anton Salikhmetovb2837fc2010-12-16 18:08:41 +0200360 if (!node->prev && !node->next)
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700361 hfs_dbg(BNODE_MOD, "hfs_btree_del_level\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362 if (!node->parent) {
363 tree->root = 0;
364 tree->depth = 0;
365 }
366 set_bit(HFS_BNODE_DELETED, &node->flags);
367}
368
369static inline int hfs_bnode_hash(u32 num)
370{
371 num = (num >> 16) + num;
372 num += num >> 8;
373 return num & (NODE_HASH_SIZE - 1);
374}
375
376struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
377{
378 struct hfs_bnode *node;
379
380 if (cnid >= tree->node_count) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700381 pr_err("request for non-existent node %d in B*Tree\n",
382 cnid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383 return NULL;
384 }
385
386 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
Anton Salikhmetovb2837fc2010-12-16 18:08:41 +0200387 node; node = node->next_hash)
388 if (node->this == cnid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389 return node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 return NULL;
391}
392
393static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
394{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 struct hfs_bnode *node, *node2;
396 struct address_space *mapping;
397 struct page *page;
398 int size, block, i, hash;
399 loff_t off;
400
401 if (cnid >= tree->node_count) {
Fabian Fredericke46707d2014-06-06 14:36:25 -0700402 pr_err("request for non-existent node %d in B*Tree\n",
403 cnid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404 return NULL;
405 }
406
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
408 sizeof(struct page *);
Panagiotis Issarisf8314dc2006-09-27 01:49:37 -0700409 node = kzalloc(size, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 if (!node)
411 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412 node->tree = tree;
413 node->this = cnid;
414 set_bit(HFS_BNODE_NEW, &node->flags);
415 atomic_set(&node->refcnt, 1);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700416 hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n",
417 node->tree->cnid, node->this);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418 init_waitqueue_head(&node->lock_wq);
419 spin_lock(&tree->hash_lock);
420 node2 = hfs_bnode_findhash(tree, cnid);
421 if (!node2) {
422 hash = hfs_bnode_hash(cnid);
423 node->next_hash = tree->node_hash[hash];
424 tree->node_hash[hash] = node;
425 tree->node_hash_cnt++;
426 } else {
427 spin_unlock(&tree->hash_lock);
428 kfree(node);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200429 wait_event(node2->lock_wq,
430 !test_bit(HFS_BNODE_NEW, &node2->flags));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431 return node2;
432 }
433 spin_unlock(&tree->hash_lock);
434
435 mapping = tree->inode->i_mapping;
436 off = (loff_t)cnid << tree->node_size_shift;
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300437 block = off >> PAGE_SHIFT;
438 node->page_offset = off & ~PAGE_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439 for (i = 0; i < tree->pages_per_bnode; block++, i++) {
Pekka Enberg090d2b12006-06-23 02:05:08 -0700440 page = read_mapping_page(mapping, block, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 if (IS_ERR(page))
442 goto fail;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 node->page[i] = page;
444 }
445
446 return node;
447fail:
448 set_bit(HFS_BNODE_ERROR, &node->flags);
449 return node;
450}
451
452void hfs_bnode_unhash(struct hfs_bnode *node)
453{
454 struct hfs_bnode **p;
455
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700456 hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 node->tree->cnid, node->this, atomic_read(&node->refcnt));
458 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
459 *p && *p != node; p = &(*p)->next_hash)
460 ;
Eric Sesterhenn0bf3ba52006-04-01 01:14:43 +0200461 BUG_ON(!*p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 *p = node->next_hash;
463 node->tree->node_hash_cnt--;
464}
465
466/* Load a particular node out of a tree */
467struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
468{
469 struct hfs_bnode *node;
470 struct hfs_bnode_desc *desc;
471 int i, rec_off, off, next_off;
472 int entry_size, key_size;
473
474 spin_lock(&tree->hash_lock);
475 node = hfs_bnode_findhash(tree, num);
476 if (node) {
477 hfs_bnode_get(node);
478 spin_unlock(&tree->hash_lock);
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200479 wait_event(node->lock_wq,
480 !test_bit(HFS_BNODE_NEW, &node->flags));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 if (test_bit(HFS_BNODE_ERROR, &node->flags))
482 goto node_error;
483 return node;
484 }
485 spin_unlock(&tree->hash_lock);
486 node = __hfs_bnode_create(tree, num);
487 if (!node)
488 return ERR_PTR(-ENOMEM);
489 if (test_bit(HFS_BNODE_ERROR, &node->flags))
490 goto node_error;
491 if (!test_bit(HFS_BNODE_NEW, &node->flags))
492 return node;
493
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200494 desc = (struct hfs_bnode_desc *)(kmap_local_page(node->page[0]) +
495 node->page_offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 node->prev = be32_to_cpu(desc->prev);
497 node->next = be32_to_cpu(desc->next);
498 node->num_recs = be16_to_cpu(desc->num_recs);
499 node->type = desc->type;
500 node->height = desc->height;
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200501 kunmap_local(desc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502
503 switch (node->type) {
504 case HFS_NODE_HEADER:
505 case HFS_NODE_MAP:
506 if (node->height != 0)
507 goto node_error;
508 break;
509 case HFS_NODE_LEAF:
510 if (node->height != 1)
511 goto node_error;
512 break;
513 case HFS_NODE_INDEX:
514 if (node->height <= 1 || node->height > tree->depth)
515 goto node_error;
516 break;
517 default:
518 goto node_error;
519 }
520
521 rec_off = tree->node_size - 2;
522 off = hfs_bnode_read_u16(node, rec_off);
523 if (off != sizeof(struct hfs_bnode_desc))
524 goto node_error;
525 for (i = 1; i <= node->num_recs; off = next_off, i++) {
526 rec_off -= 2;
527 next_off = hfs_bnode_read_u16(node, rec_off);
528 if (next_off <= off ||
529 next_off > tree->node_size ||
530 next_off & 1)
531 goto node_error;
532 entry_size = next_off - off;
533 if (node->type != HFS_NODE_INDEX &&
534 node->type != HFS_NODE_LEAF)
535 continue;
536 key_size = hfs_bnode_read_u16(node, off) + 2;
537 if (key_size >= entry_size || key_size & 1)
538 goto node_error;
539 }
540 clear_bit(HFS_BNODE_NEW, &node->flags);
541 wake_up(&node->lock_wq);
542 return node;
543
544node_error:
545 set_bit(HFS_BNODE_ERROR, &node->flags);
546 clear_bit(HFS_BNODE_NEW, &node->flags);
547 wake_up(&node->lock_wq);
548 hfs_bnode_put(node);
549 return ERR_PTR(-EIO);
550}
551
552void hfs_bnode_free(struct hfs_bnode *node)
553{
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200554 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555
Anton Salikhmetov21f22962010-12-16 18:08:39 +0200556 for (i = 0; i < node->tree->pages_per_bnode; i++)
557 if (node->page[i])
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300558 put_page(node->page[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559 kfree(node);
560}
561
562struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
563{
564 struct hfs_bnode *node;
565 struct page **pagep;
566 int i;
567
568 spin_lock(&tree->hash_lock);
569 node = hfs_bnode_findhash(tree, num);
570 spin_unlock(&tree->hash_lock);
571 if (node) {
Joe Perchesd61426732013-04-30 15:27:55 -0700572 pr_crit("new node %u already hashed?\n", num);
Roman Zippel634725a2006-01-18 17:43:05 -0800573 WARN_ON(1);
574 return node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575 }
576 node = __hfs_bnode_create(tree, num);
577 if (!node)
578 return ERR_PTR(-ENOMEM);
579 if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
580 hfs_bnode_put(node);
581 return ERR_PTR(-EIO);
582 }
583
584 pagep = node->page;
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200585 memzero_page(*pagep, node->page_offset,
586 min_t(int, PAGE_SIZE, tree->node_size));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588 for (i = 1; i < tree->pages_per_bnode; i++) {
Fabio M. De Francesco6c3014a2022-08-09 22:31:03 +0200589 memzero_page(*++pagep, 0, PAGE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590 set_page_dirty(*pagep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 }
592 clear_bit(HFS_BNODE_NEW, &node->flags);
593 wake_up(&node->lock_wq);
594
595 return node;
596}
597
598void hfs_bnode_get(struct hfs_bnode *node)
599{
600 if (node) {
601 atomic_inc(&node->refcnt);
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700602 hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n",
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200603 node->tree->cnid, node->this,
604 atomic_read(&node->refcnt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605 }
606}
607
608/* Dispose of resources used by a node */
609void hfs_bnode_put(struct hfs_bnode *node)
610{
611 if (node) {
612 struct hfs_btree *tree = node->tree;
613 int i;
614
Joe Perchesc2b3e1f2013-04-30 15:27:54 -0700615 hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n",
Anton Salikhmetov2753cc22010-12-16 18:08:38 +0200616 node->tree->cnid, node->this,
617 atomic_read(&node->refcnt));
Eric Sesterhenn0bf3ba52006-04-01 01:14:43 +0200618 BUG_ON(!atomic_read(&node->refcnt));
Roman Zippela5e39852005-09-06 15:18:47 -0700619 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621 for (i = 0; i < tree->pages_per_bnode; i++) {
Roman Zippel74f9c9c2005-08-01 21:11:41 -0700622 if (!node->page[i])
623 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624 mark_page_accessed(node->page[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625 }
626
627 if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
628 hfs_bnode_unhash(node);
629 spin_unlock(&tree->hash_lock);
Sergei Antonov2cd282a2014-06-06 14:36:28 -0700630 if (hfs_bnode_need_zeroout(tree))
631 hfs_bnode_clear(node, 0, tree->node_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 hfs_bmap_free(node);
633 hfs_bnode_free(node);
634 return;
635 }
636 spin_unlock(&tree->hash_lock);
637 }
638}
639
Sergei Antonov2cd282a2014-06-06 14:36:28 -0700640/*
641 * Unused nodes have to be zeroed if this is the catalog tree and
642 * a corresponding flag in the volume header is set.
643 */
644bool hfs_bnode_need_zeroout(struct hfs_btree *tree)
645{
646 struct super_block *sb = tree->inode->i_sb;
647 struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
648 const u32 volume_attr = be32_to_cpu(sbi->s_vhdr->attributes);
649
650 return tree->cnid == HFSPLUS_CAT_CNID &&
651 volume_attr & HFSPLUS_VOL_UNUSED_NODE_FIX;
652}