]>
Commit | Line | Data |
---|---|---|
ae98043f | 1 | // SPDX-License-Identifier: GPL-2.0+ |
17c76b01 | 2 | /* |
94ee1d91 | 3 | * NILFS B-tree. |
17c76b01 KS |
4 | * |
5 | * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation. | |
6 | * | |
4b420ab4 | 7 | * Written by Koji Sato. |
17c76b01 KS |
8 | */ |
9 | ||
10 | #include <linux/slab.h> | |
11 | #include <linux/string.h> | |
12 | #include <linux/errno.h> | |
13 | #include <linux/pagevec.h> | |
14 | #include "nilfs.h" | |
15 | #include "page.h" | |
16 | #include "btnode.h" | |
17 | #include "btree.h" | |
18 | #include "alloc.h" | |
c3a7abf0 | 19 | #include "dat.h" |
17c76b01 | 20 | |
957ed60b RK |
21 | static void __nilfs_btree_init(struct nilfs_bmap *bmap); |
22 | ||
f905440f | 23 | static struct nilfs_btree_path *nilfs_btree_alloc_path(void) |
17c76b01 | 24 | { |
f905440f LH |
25 | struct nilfs_btree_path *path; |
26 | int level = NILFS_BTREE_LEVEL_DATA; | |
17c76b01 | 27 | |
f905440f LH |
28 | path = kmem_cache_alloc(nilfs_btree_path_cache, GFP_NOFS); |
29 | if (path == NULL) | |
30 | goto out; | |
17c76b01 | 31 | |
f905440f | 32 | for (; level < NILFS_BTREE_LEVEL_MAX; level++) { |
17c76b01 KS |
33 | path[level].bp_bh = NULL; |
34 | path[level].bp_sib_bh = NULL; | |
35 | path[level].bp_index = 0; | |
36 | path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; | |
37 | path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; | |
38 | path[level].bp_op = NULL; | |
39 | } | |
f905440f LH |
40 | |
41 | out: | |
42 | return path; | |
43 | } | |
44 | ||
73bb4886 | 45 | static void nilfs_btree_free_path(struct nilfs_btree_path *path) |
f905440f | 46 | { |
73bb4886 | 47 | int level = NILFS_BTREE_LEVEL_DATA; |
17c76b01 | 48 | |
73bb4886 | 49 | for (; level < NILFS_BTREE_LEVEL_MAX; level++) |
3218929d | 50 | brelse(path[level].bp_bh); |
73bb4886 LH |
51 | |
52 | kmem_cache_free(nilfs_btree_path_cache, path); | |
17c76b01 KS |
53 | } |
54 | ||
17c76b01 KS |
55 | /* |
56 | * B-tree node operations | |
57 | */ | |
e7c274f8 | 58 | static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, |
f198dbb9 RK |
59 | __u64 ptr, struct buffer_head **bhp) |
60 | { | |
e897be17 RK |
61 | struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; |
62 | struct address_space *btnc = btnc_inode->i_mapping; | |
45f4910b | 63 | struct buffer_head *bh; |
f198dbb9 | 64 | |
45f4910b RK |
65 | bh = nilfs_btnode_create_block(btnc, ptr); |
66 | if (!bh) | |
67 | return -ENOMEM; | |
68 | ||
69 | set_buffer_nilfs_volatile(bh); | |
70 | *bhp = bh; | |
71 | return 0; | |
f198dbb9 | 72 | } |
17c76b01 | 73 | |
7c397a81 | 74 | static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node) |
17c76b01 KS |
75 | { |
76 | return node->bn_flags; | |
77 | } | |
78 | ||
7c397a81 | 79 | static void |
6d28f7ea | 80 | nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags) |
17c76b01 KS |
81 | { |
82 | node->bn_flags = flags; | |
83 | } | |
84 | ||
7c397a81 | 85 | static int nilfs_btree_node_root(const struct nilfs_btree_node *node) |
17c76b01 | 86 | { |
6d28f7ea | 87 | return nilfs_btree_node_get_flags(node) & NILFS_BTREE_NODE_ROOT; |
17c76b01 KS |
88 | } |
89 | ||
7c397a81 | 90 | static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node) |
17c76b01 KS |
91 | { |
92 | return node->bn_level; | |
93 | } | |
94 | ||
7c397a81 | 95 | static void |
6d28f7ea | 96 | nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) |
17c76b01 KS |
97 | { |
98 | node->bn_level = level; | |
99 | } | |
100 | ||
7c397a81 | 101 | static int nilfs_btree_node_get_nchildren(const struct nilfs_btree_node *node) |
17c76b01 KS |
102 | { |
103 | return le16_to_cpu(node->bn_nchildren); | |
104 | } | |
105 | ||
7c397a81 | 106 | static void |
6d28f7ea | 107 | nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren) |
17c76b01 KS |
108 | { |
109 | node->bn_nchildren = cpu_to_le16(nchildren); | |
110 | } | |
111 | ||
7c397a81 | 112 | static int nilfs_btree_node_size(const struct nilfs_bmap *btree) |
17c76b01 | 113 | { |
f3048d17 | 114 | return i_blocksize(btree->b_inode); |
17c76b01 KS |
115 | } |
116 | ||
9b7b265c | 117 | static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) |
17c76b01 | 118 | { |
5ad2686e | 119 | return btree->b_nchildren_per_block; |
17c76b01 KS |
120 | } |
121 | ||
7c397a81 | 122 | static __le64 * |
6d28f7ea | 123 | nilfs_btree_node_dkeys(const struct nilfs_btree_node *node) |
17c76b01 KS |
124 | { |
125 | return (__le64 *)((char *)(node + 1) + | |
6d28f7ea | 126 | (nilfs_btree_node_root(node) ? |
17c76b01 KS |
127 | 0 : NILFS_BTREE_NODE_EXTRA_PAD_SIZE)); |
128 | } | |
129 | ||
7c397a81 | 130 | static __le64 * |
9b7b265c | 131 | nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax) |
17c76b01 | 132 | { |
9b7b265c | 133 | return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax); |
17c76b01 KS |
134 | } |
135 | ||
7c397a81 | 136 | static __u64 |
6d28f7ea | 137 | nilfs_btree_node_get_key(const struct nilfs_btree_node *node, int index) |
17c76b01 | 138 | { |
25b8d7de | 139 | return le64_to_cpu(*(nilfs_btree_node_dkeys(node) + index)); |
17c76b01 KS |
140 | } |
141 | ||
7c397a81 | 142 | static void |
6d28f7ea | 143 | nilfs_btree_node_set_key(struct nilfs_btree_node *node, int index, __u64 key) |
17c76b01 | 144 | { |
25b8d7de | 145 | *(nilfs_btree_node_dkeys(node) + index) = cpu_to_le64(key); |
17c76b01 KS |
146 | } |
147 | ||
7c397a81 | 148 | static __u64 |
9b7b265c RK |
149 | nilfs_btree_node_get_ptr(const struct nilfs_btree_node *node, int index, |
150 | int ncmax) | |
17c76b01 | 151 | { |
9b7b265c | 152 | return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index)); |
17c76b01 KS |
153 | } |
154 | ||
7c397a81 | 155 | static void |
9b7b265c RK |
156 | nilfs_btree_node_set_ptr(struct nilfs_btree_node *node, int index, __u64 ptr, |
157 | int ncmax) | |
17c76b01 | 158 | { |
9b7b265c | 159 | *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr); |
17c76b01 KS |
160 | } |
161 | ||
9b7b265c RK |
162 | static void nilfs_btree_node_init(struct nilfs_btree_node *node, int flags, |
163 | int level, int nchildren, int ncmax, | |
17c76b01 KS |
164 | const __u64 *keys, const __u64 *ptrs) |
165 | { | |
166 | __le64 *dkeys; | |
167 | __le64 *dptrs; | |
168 | int i; | |
169 | ||
6d28f7ea RK |
170 | nilfs_btree_node_set_flags(node, flags); |
171 | nilfs_btree_node_set_level(node, level); | |
172 | nilfs_btree_node_set_nchildren(node, nchildren); | |
17c76b01 | 173 | |
6d28f7ea | 174 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 175 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
17c76b01 | 176 | for (i = 0; i < nchildren; i++) { |
25b8d7de RK |
177 | dkeys[i] = cpu_to_le64(keys[i]); |
178 | dptrs[i] = cpu_to_le64(ptrs[i]); | |
17c76b01 KS |
179 | } |
180 | } | |
181 | ||
182 | /* Assume the buffer heads corresponding to left and right are locked. */ | |
9b7b265c | 183 | static void nilfs_btree_node_move_left(struct nilfs_btree_node *left, |
17c76b01 | 184 | struct nilfs_btree_node *right, |
9b7b265c | 185 | int n, int lncmax, int rncmax) |
17c76b01 KS |
186 | { |
187 | __le64 *ldkeys, *rdkeys; | |
188 | __le64 *ldptrs, *rdptrs; | |
189 | int lnchildren, rnchildren; | |
190 | ||
6d28f7ea | 191 | ldkeys = nilfs_btree_node_dkeys(left); |
9b7b265c | 192 | ldptrs = nilfs_btree_node_dptrs(left, lncmax); |
6d28f7ea | 193 | lnchildren = nilfs_btree_node_get_nchildren(left); |
17c76b01 | 194 | |
6d28f7ea | 195 | rdkeys = nilfs_btree_node_dkeys(right); |
9b7b265c | 196 | rdptrs = nilfs_btree_node_dptrs(right, rncmax); |
6d28f7ea | 197 | rnchildren = nilfs_btree_node_get_nchildren(right); |
17c76b01 KS |
198 | |
199 | memcpy(ldkeys + lnchildren, rdkeys, n * sizeof(*rdkeys)); | |
200 | memcpy(ldptrs + lnchildren, rdptrs, n * sizeof(*rdptrs)); | |
201 | memmove(rdkeys, rdkeys + n, (rnchildren - n) * sizeof(*rdkeys)); | |
202 | memmove(rdptrs, rdptrs + n, (rnchildren - n) * sizeof(*rdptrs)); | |
203 | ||
204 | lnchildren += n; | |
205 | rnchildren -= n; | |
6d28f7ea RK |
206 | nilfs_btree_node_set_nchildren(left, lnchildren); |
207 | nilfs_btree_node_set_nchildren(right, rnchildren); | |
17c76b01 KS |
208 | } |
209 | ||
210 | /* Assume that the buffer heads corresponding to left and right are locked. */ | |
9b7b265c | 211 | static void nilfs_btree_node_move_right(struct nilfs_btree_node *left, |
17c76b01 | 212 | struct nilfs_btree_node *right, |
9b7b265c | 213 | int n, int lncmax, int rncmax) |
17c76b01 KS |
214 | { |
215 | __le64 *ldkeys, *rdkeys; | |
216 | __le64 *ldptrs, *rdptrs; | |
217 | int lnchildren, rnchildren; | |
218 | ||
6d28f7ea | 219 | ldkeys = nilfs_btree_node_dkeys(left); |
9b7b265c | 220 | ldptrs = nilfs_btree_node_dptrs(left, lncmax); |
6d28f7ea | 221 | lnchildren = nilfs_btree_node_get_nchildren(left); |
17c76b01 | 222 | |
6d28f7ea | 223 | rdkeys = nilfs_btree_node_dkeys(right); |
9b7b265c | 224 | rdptrs = nilfs_btree_node_dptrs(right, rncmax); |
6d28f7ea | 225 | rnchildren = nilfs_btree_node_get_nchildren(right); |
17c76b01 KS |
226 | |
227 | memmove(rdkeys + n, rdkeys, rnchildren * sizeof(*rdkeys)); | |
228 | memmove(rdptrs + n, rdptrs, rnchildren * sizeof(*rdptrs)); | |
229 | memcpy(rdkeys, ldkeys + lnchildren - n, n * sizeof(*rdkeys)); | |
230 | memcpy(rdptrs, ldptrs + lnchildren - n, n * sizeof(*rdptrs)); | |
231 | ||
232 | lnchildren -= n; | |
233 | rnchildren += n; | |
6d28f7ea RK |
234 | nilfs_btree_node_set_nchildren(left, lnchildren); |
235 | nilfs_btree_node_set_nchildren(right, rnchildren); | |
17c76b01 KS |
236 | } |
237 | ||
238 | /* Assume that the buffer head corresponding to node is locked. */ | |
9b7b265c RK |
239 | static void nilfs_btree_node_insert(struct nilfs_btree_node *node, int index, |
240 | __u64 key, __u64 ptr, int ncmax) | |
17c76b01 KS |
241 | { |
242 | __le64 *dkeys; | |
243 | __le64 *dptrs; | |
244 | int nchildren; | |
245 | ||
6d28f7ea | 246 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 247 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
6d28f7ea | 248 | nchildren = nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
249 | if (index < nchildren) { |
250 | memmove(dkeys + index + 1, dkeys + index, | |
251 | (nchildren - index) * sizeof(*dkeys)); | |
252 | memmove(dptrs + index + 1, dptrs + index, | |
253 | (nchildren - index) * sizeof(*dptrs)); | |
254 | } | |
25b8d7de RK |
255 | dkeys[index] = cpu_to_le64(key); |
256 | dptrs[index] = cpu_to_le64(ptr); | |
17c76b01 | 257 | nchildren++; |
6d28f7ea | 258 | nilfs_btree_node_set_nchildren(node, nchildren); |
17c76b01 KS |
259 | } |
260 | ||
261 | /* Assume that the buffer head corresponding to node is locked. */ | |
9b7b265c RK |
262 | static void nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, |
263 | __u64 *keyp, __u64 *ptrp, int ncmax) | |
17c76b01 KS |
264 | { |
265 | __u64 key; | |
266 | __u64 ptr; | |
267 | __le64 *dkeys; | |
268 | __le64 *dptrs; | |
269 | int nchildren; | |
270 | ||
6d28f7ea | 271 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 272 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
25b8d7de RK |
273 | key = le64_to_cpu(dkeys[index]); |
274 | ptr = le64_to_cpu(dptrs[index]); | |
6d28f7ea | 275 | nchildren = nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
276 | if (keyp != NULL) |
277 | *keyp = key; | |
278 | if (ptrp != NULL) | |
279 | *ptrp = ptr; | |
280 | ||
281 | if (index < nchildren - 1) { | |
282 | memmove(dkeys + index, dkeys + index + 1, | |
283 | (nchildren - index - 1) * sizeof(*dkeys)); | |
284 | memmove(dptrs + index, dptrs + index + 1, | |
285 | (nchildren - index - 1) * sizeof(*dptrs)); | |
286 | } | |
287 | nchildren--; | |
6d28f7ea | 288 | nilfs_btree_node_set_nchildren(node, nchildren); |
17c76b01 KS |
289 | } |
290 | ||
6d28f7ea | 291 | static int nilfs_btree_node_lookup(const struct nilfs_btree_node *node, |
17c76b01 KS |
292 | __u64 key, int *indexp) |
293 | { | |
294 | __u64 nkey; | |
295 | int index, low, high, s; | |
296 | ||
297 | /* binary search */ | |
298 | low = 0; | |
6d28f7ea | 299 | high = nilfs_btree_node_get_nchildren(node) - 1; |
17c76b01 KS |
300 | index = 0; |
301 | s = 0; | |
302 | while (low <= high) { | |
303 | index = (low + high) / 2; | |
6d28f7ea | 304 | nkey = nilfs_btree_node_get_key(node, index); |
17c76b01 KS |
305 | if (nkey == key) { |
306 | s = 0; | |
307 | goto out; | |
308 | } else if (nkey < key) { | |
309 | low = index + 1; | |
310 | s = -1; | |
311 | } else { | |
312 | high = index - 1; | |
313 | s = 1; | |
314 | } | |
315 | } | |
316 | ||
317 | /* adjust index */ | |
6d28f7ea RK |
318 | if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) { |
319 | if (s > 0 && index > 0) | |
17c76b01 KS |
320 | index--; |
321 | } else if (s < 0) | |
322 | index++; | |
323 | ||
324 | out: | |
17c76b01 KS |
325 | *indexp = index; |
326 | ||
327 | return s == 0; | |
328 | } | |
329 | ||
1d5385b9 RK |
330 | /** |
331 | * nilfs_btree_node_broken - verify consistency of btree node | |
332 | * @node: btree node block to be examined | |
333 | * @size: node size (in bytes) | |
feee880f | 334 | * @inode: host inode of btree |
1d5385b9 RK |
335 | * @blocknr: block number |
336 | * | |
337 | * Return Value: If node is broken, 1 is returned. Otherwise, 0 is returned. | |
338 | */ | |
339 | static int nilfs_btree_node_broken(const struct nilfs_btree_node *node, | |
feee880f RK |
340 | size_t size, struct inode *inode, |
341 | sector_t blocknr) | |
1d5385b9 RK |
342 | { |
343 | int level, flags, nchildren; | |
344 | int ret = 0; | |
345 | ||
346 | level = nilfs_btree_node_get_level(node); | |
347 | flags = nilfs_btree_node_get_flags(node); | |
348 | nchildren = nilfs_btree_node_get_nchildren(node); | |
349 | ||
350 | if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN || | |
351 | level >= NILFS_BTREE_LEVEL_MAX || | |
352 | (flags & NILFS_BTREE_NODE_ROOT) || | |
353 | nchildren < 0 || | |
354 | nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) { | |
a1d0747a JP |
355 | nilfs_crit(inode->i_sb, |
356 | "bad btree node (ino=%lu, blocknr=%llu): level = %d, flags = 0x%x, nchildren = %d", | |
357 | inode->i_ino, (unsigned long long)blocknr, level, | |
358 | flags, nchildren); | |
1d5385b9 RK |
359 | ret = 1; |
360 | } | |
361 | return ret; | |
362 | } | |
363 | ||
957ed60b RK |
364 | /** |
365 | * nilfs_btree_root_broken - verify consistency of btree root node | |
366 | * @node: btree root node to be examined | |
feee880f | 367 | * @inode: host inode of btree |
957ed60b RK |
368 | * |
369 | * Return Value: If node is broken, 1 is returned. Otherwise, 0 is returned. | |
370 | */ | |
371 | static int nilfs_btree_root_broken(const struct nilfs_btree_node *node, | |
feee880f | 372 | struct inode *inode) |
957ed60b RK |
373 | { |
374 | int level, flags, nchildren; | |
375 | int ret = 0; | |
376 | ||
377 | level = nilfs_btree_node_get_level(node); | |
378 | flags = nilfs_btree_node_get_flags(node); | |
379 | nchildren = nilfs_btree_node_get_nchildren(node); | |
380 | ||
381 | if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN || | |
d8fd150f | 382 | level >= NILFS_BTREE_LEVEL_MAX || |
957ed60b RK |
383 | nchildren < 0 || |
384 | nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) { | |
a1d0747a JP |
385 | nilfs_crit(inode->i_sb, |
386 | "bad btree root (ino=%lu): level = %d, flags = 0x%x, nchildren = %d", | |
387 | inode->i_ino, level, flags, nchildren); | |
957ed60b RK |
388 | ret = 1; |
389 | } | |
390 | return ret; | |
391 | } | |
392 | ||
1d5385b9 RK |
393 | int nilfs_btree_broken_node_block(struct buffer_head *bh) |
394 | { | |
feee880f | 395 | struct inode *inode; |
4e13e66b RK |
396 | int ret; |
397 | ||
398 | if (buffer_nilfs_checked(bh)) | |
399 | return 0; | |
400 | ||
feee880f | 401 | inode = bh->b_page->mapping->host; |
4e13e66b | 402 | ret = nilfs_btree_node_broken((struct nilfs_btree_node *)bh->b_data, |
feee880f | 403 | bh->b_size, inode, bh->b_blocknr); |
4e13e66b RK |
404 | if (likely(!ret)) |
405 | set_buffer_nilfs_checked(bh); | |
406 | return ret; | |
1d5385b9 RK |
407 | } |
408 | ||
7c397a81 | 409 | static struct nilfs_btree_node * |
e7c274f8 | 410 | nilfs_btree_get_root(const struct nilfs_bmap *btree) |
17c76b01 | 411 | { |
e7c274f8 | 412 | return (struct nilfs_btree_node *)btree->b_u.u_data; |
17c76b01 KS |
413 | } |
414 | ||
7c397a81 | 415 | static struct nilfs_btree_node * |
6d28f7ea | 416 | nilfs_btree_get_nonroot_node(const struct nilfs_btree_path *path, int level) |
17c76b01 KS |
417 | { |
418 | return (struct nilfs_btree_node *)path[level].bp_bh->b_data; | |
419 | } | |
420 | ||
7c397a81 | 421 | static struct nilfs_btree_node * |
6d28f7ea | 422 | nilfs_btree_get_sib_node(const struct nilfs_btree_path *path, int level) |
17c76b01 KS |
423 | { |
424 | return (struct nilfs_btree_node *)path[level].bp_sib_bh->b_data; | |
425 | } | |
426 | ||
7c397a81 | 427 | static int nilfs_btree_height(const struct nilfs_bmap *btree) |
17c76b01 | 428 | { |
6d28f7ea | 429 | return nilfs_btree_node_get_level(nilfs_btree_get_root(btree)) + 1; |
17c76b01 KS |
430 | } |
431 | ||
9b7b265c | 432 | static struct nilfs_btree_node * |
e7c274f8 | 433 | nilfs_btree_get_node(const struct nilfs_bmap *btree, |
17c76b01 | 434 | const struct nilfs_btree_path *path, |
9b7b265c | 435 | int level, int *ncmaxp) |
17c76b01 | 436 | { |
9b7b265c RK |
437 | struct nilfs_btree_node *node; |
438 | ||
439 | if (level == nilfs_btree_height(btree) - 1) { | |
440 | node = nilfs_btree_get_root(btree); | |
441 | *ncmaxp = NILFS_BTREE_ROOT_NCHILDREN_MAX; | |
442 | } else { | |
443 | node = nilfs_btree_get_nonroot_node(path, level); | |
444 | *ncmaxp = nilfs_btree_nchildren_per_block(btree); | |
445 | } | |
446 | return node; | |
17c76b01 KS |
447 | } |
448 | ||
feee880f RK |
449 | static int nilfs_btree_bad_node(const struct nilfs_bmap *btree, |
450 | struct nilfs_btree_node *node, int level) | |
9b945d53 RK |
451 | { |
452 | if (unlikely(nilfs_btree_node_get_level(node) != level)) { | |
453 | dump_stack(); | |
a1d0747a JP |
454 | nilfs_crit(btree->b_inode->i_sb, |
455 | "btree level mismatch (ino=%lu): %d != %d", | |
456 | btree->b_inode->i_ino, | |
457 | nilfs_btree_node_get_level(node), level); | |
9b945d53 RK |
458 | return 1; |
459 | } | |
460 | return 0; | |
461 | } | |
462 | ||
464ece88 RK |
463 | struct nilfs_btree_readahead_info { |
464 | struct nilfs_btree_node *node; /* parent node */ | |
465 | int max_ra_blocks; /* max nof blocks to read ahead */ | |
466 | int index; /* current index on the parent node */ | |
467 | int ncmax; /* nof children in the parent node */ | |
468 | }; | |
469 | ||
470 | static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, | |
471 | struct buffer_head **bhp, | |
472 | const struct nilfs_btree_readahead_info *ra) | |
473 | { | |
e897be17 RK |
474 | struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; |
475 | struct address_space *btnc = btnc_inode->i_mapping; | |
464ece88 RK |
476 | struct buffer_head *bh, *ra_bh; |
477 | sector_t submit_ptr = 0; | |
478 | int ret; | |
479 | ||
ed451259 | 480 | ret = nilfs_btnode_submit_block(btnc, ptr, 0, REQ_OP_READ, &bh, |
2a222ca9 | 481 | &submit_ptr); |
464ece88 RK |
482 | if (ret) { |
483 | if (ret != -EEXIST) | |
484 | return ret; | |
485 | goto out_check; | |
486 | } | |
487 | ||
488 | if (ra) { | |
489 | int i, n; | |
490 | __u64 ptr2; | |
491 | ||
492 | /* read ahead sibling nodes */ | |
493 | for (n = ra->max_ra_blocks, i = ra->index + 1; | |
494 | n > 0 && i < ra->ncmax; n--, i++) { | |
495 | ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax); | |
496 | ||
2a222ca9 | 497 | ret = nilfs_btnode_submit_block(btnc, ptr2, 0, |
ed451259 BVA |
498 | REQ_OP_READ | REQ_RAHEAD, |
499 | &ra_bh, &submit_ptr); | |
464ece88 RK |
500 | if (likely(!ret || ret == -EEXIST)) |
501 | brelse(ra_bh); | |
502 | else if (ret != -EBUSY) | |
503 | break; | |
504 | if (!buffer_locked(bh)) | |
505 | goto out_no_wait; | |
506 | } | |
507 | } | |
508 | ||
509 | wait_on_buffer(bh); | |
510 | ||
511 | out_no_wait: | |
512 | if (!buffer_uptodate(bh)) { | |
a1d0747a | 513 | nilfs_err(btree->b_inode->i_sb, |
39a9dcca RK |
514 | "I/O error reading b-tree node block (ino=%lu, blocknr=%llu)", |
515 | btree->b_inode->i_ino, (unsigned long long)ptr); | |
464ece88 RK |
516 | brelse(bh); |
517 | return -EIO; | |
518 | } | |
519 | ||
520 | out_check: | |
521 | if (nilfs_btree_broken_node_block(bh)) { | |
522 | clear_buffer_uptodate(bh); | |
523 | brelse(bh); | |
524 | return -EINVAL; | |
525 | } | |
526 | ||
527 | *bhp = bh; | |
528 | return 0; | |
529 | } | |
530 | ||
531 | static int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, | |
532 | struct buffer_head **bhp) | |
533 | { | |
534 | return __nilfs_btree_get_block(btree, ptr, bhp, NULL); | |
535 | } | |
536 | ||
e7c274f8 | 537 | static int nilfs_btree_do_lookup(const struct nilfs_bmap *btree, |
17c76b01 | 538 | struct nilfs_btree_path *path, |
03bdb5ac RK |
539 | __u64 key, __u64 *ptrp, int minlevel, |
540 | int readahead) | |
17c76b01 KS |
541 | { |
542 | struct nilfs_btree_node *node; | |
03bdb5ac | 543 | struct nilfs_btree_readahead_info p, *ra; |
17c76b01 | 544 | __u64 ptr; |
ea64ab87 | 545 | int level, index, found, ncmax, ret; |
17c76b01 | 546 | |
17c76b01 | 547 | node = nilfs_btree_get_root(btree); |
6d28f7ea RK |
548 | level = nilfs_btree_node_get_level(node); |
549 | if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) | |
17c76b01 KS |
550 | return -ENOENT; |
551 | ||
6d28f7ea | 552 | found = nilfs_btree_node_lookup(node, key, &index); |
9b7b265c RK |
553 | ptr = nilfs_btree_node_get_ptr(node, index, |
554 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
555 | path[level].bp_bh = NULL; |
556 | path[level].bp_index = index; | |
557 | ||
9b7b265c | 558 | ncmax = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 559 | |
03bdb5ac RK |
560 | while (--level >= minlevel) { |
561 | ra = NULL; | |
562 | if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) { | |
563 | p.node = nilfs_btree_get_node(btree, path, level + 1, | |
564 | &p.ncmax); | |
565 | p.index = index; | |
566 | p.max_ra_blocks = 7; | |
567 | ra = &p; | |
568 | } | |
569 | ret = __nilfs_btree_get_block(btree, ptr, &path[level].bp_bh, | |
570 | ra); | |
17c76b01 KS |
571 | if (ret < 0) |
572 | return ret; | |
03bdb5ac | 573 | |
6d28f7ea | 574 | node = nilfs_btree_get_nonroot_node(path, level); |
feee880f | 575 | if (nilfs_btree_bad_node(btree, node, level)) |
9b945d53 | 576 | return -EINVAL; |
17c76b01 | 577 | if (!found) |
6d28f7ea | 578 | found = nilfs_btree_node_lookup(node, key, &index); |
17c76b01 KS |
579 | else |
580 | index = 0; | |
ea64ab87 | 581 | if (index < ncmax) { |
9b7b265c | 582 | ptr = nilfs_btree_node_get_ptr(node, index, ncmax); |
ea64ab87 | 583 | } else { |
1f5abe7e | 584 | WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN); |
17c76b01 KS |
585 | /* insert */ |
586 | ptr = NILFS_BMAP_INVALID_PTR; | |
587 | } | |
588 | path[level].bp_index = index; | |
589 | } | |
590 | if (!found) | |
591 | return -ENOENT; | |
592 | ||
593 | if (ptrp != NULL) | |
594 | *ptrp = ptr; | |
595 | ||
596 | return 0; | |
597 | } | |
598 | ||
e7c274f8 | 599 | static int nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, |
17c76b01 KS |
600 | struct nilfs_btree_path *path, |
601 | __u64 *keyp, __u64 *ptrp) | |
602 | { | |
603 | struct nilfs_btree_node *node; | |
604 | __u64 ptr; | |
9b7b265c | 605 | int index, level, ncmax, ret; |
17c76b01 KS |
606 | |
607 | node = nilfs_btree_get_root(btree); | |
6d28f7ea | 608 | index = nilfs_btree_node_get_nchildren(node) - 1; |
17c76b01 KS |
609 | if (index < 0) |
610 | return -ENOENT; | |
6d28f7ea | 611 | level = nilfs_btree_node_get_level(node); |
9b7b265c RK |
612 | ptr = nilfs_btree_node_get_ptr(node, index, |
613 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
614 | path[level].bp_bh = NULL; |
615 | path[level].bp_index = index; | |
9b7b265c | 616 | ncmax = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
617 | |
618 | for (level--; level > 0; level--) { | |
f198dbb9 | 619 | ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh); |
17c76b01 KS |
620 | if (ret < 0) |
621 | return ret; | |
6d28f7ea | 622 | node = nilfs_btree_get_nonroot_node(path, level); |
feee880f | 623 | if (nilfs_btree_bad_node(btree, node, level)) |
9b945d53 | 624 | return -EINVAL; |
6d28f7ea | 625 | index = nilfs_btree_node_get_nchildren(node) - 1; |
9b7b265c | 626 | ptr = nilfs_btree_node_get_ptr(node, index, ncmax); |
17c76b01 KS |
627 | path[level].bp_index = index; |
628 | } | |
629 | ||
630 | if (keyp != NULL) | |
6d28f7ea | 631 | *keyp = nilfs_btree_node_get_key(node, index); |
17c76b01 KS |
632 | if (ptrp != NULL) |
633 | *ptrp = ptr; | |
634 | ||
635 | return 0; | |
636 | } | |
637 | ||
5b20384f RK |
638 | /** |
639 | * nilfs_btree_get_next_key - get next valid key from btree path array | |
640 | * @btree: bmap struct of btree | |
641 | * @path: array of nilfs_btree_path struct | |
642 | * @minlevel: start level | |
643 | * @nextkey: place to store the next valid key | |
644 | * | |
645 | * Return Value: If a next key was found, 0 is returned. Otherwise, | |
646 | * -ENOENT is returned. | |
647 | */ | |
648 | static int nilfs_btree_get_next_key(const struct nilfs_bmap *btree, | |
649 | const struct nilfs_btree_path *path, | |
650 | int minlevel, __u64 *nextkey) | |
651 | { | |
652 | struct nilfs_btree_node *node; | |
653 | int maxlevel = nilfs_btree_height(btree) - 1; | |
654 | int index, next_adj, level; | |
655 | ||
656 | /* Next index is already set to bp_index for leaf nodes. */ | |
657 | next_adj = 0; | |
658 | for (level = minlevel; level <= maxlevel; level++) { | |
659 | if (level == maxlevel) | |
660 | node = nilfs_btree_get_root(btree); | |
661 | else | |
662 | node = nilfs_btree_get_nonroot_node(path, level); | |
663 | ||
664 | index = path[level].bp_index + next_adj; | |
665 | if (index < nilfs_btree_node_get_nchildren(node)) { | |
666 | /* Next key is in this node */ | |
667 | *nextkey = nilfs_btree_node_get_key(node, index); | |
668 | return 0; | |
669 | } | |
670 | /* For non-leaf nodes, next index is stored at bp_index + 1. */ | |
671 | next_adj = 1; | |
672 | } | |
673 | return -ENOENT; | |
674 | } | |
675 | ||
e7c274f8 | 676 | static int nilfs_btree_lookup(const struct nilfs_bmap *btree, |
17c76b01 KS |
677 | __u64 key, int level, __u64 *ptrp) |
678 | { | |
17c76b01 | 679 | struct nilfs_btree_path *path; |
17c76b01 KS |
680 | int ret; |
681 | ||
6d28f7ea | 682 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
683 | if (path == NULL) |
684 | return -ENOMEM; | |
17c76b01 | 685 | |
03bdb5ac | 686 | ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0); |
17c76b01 | 687 | |
6d28f7ea | 688 | nilfs_btree_free_path(path); |
17c76b01 KS |
689 | |
690 | return ret; | |
691 | } | |
692 | ||
e7c274f8 | 693 | static int nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, |
0c6c44cb RK |
694 | __u64 key, __u64 *ptrp, |
695 | unsigned int maxblocks) | |
c3a7abf0 | 696 | { |
c3a7abf0 RK |
697 | struct nilfs_btree_path *path; |
698 | struct nilfs_btree_node *node; | |
699 | struct inode *dat = NULL; | |
700 | __u64 ptr, ptr2; | |
701 | sector_t blocknr; | |
702 | int level = NILFS_BTREE_LEVEL_NODE_MIN; | |
9b7b265c | 703 | int ret, cnt, index, maxlevel, ncmax; |
03bdb5ac | 704 | struct nilfs_btree_readahead_info p; |
c3a7abf0 | 705 | |
6d28f7ea | 706 | path = nilfs_btree_alloc_path(); |
c3a7abf0 RK |
707 | if (path == NULL) |
708 | return -ENOMEM; | |
f905440f | 709 | |
03bdb5ac | 710 | ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level, 1); |
c3a7abf0 RK |
711 | if (ret < 0) |
712 | goto out; | |
713 | ||
e7c274f8 RK |
714 | if (NILFS_BMAP_USE_VBN(btree)) { |
715 | dat = nilfs_bmap_get_dat(btree); | |
c3a7abf0 RK |
716 | ret = nilfs_dat_translate(dat, ptr, &blocknr); |
717 | if (ret < 0) | |
718 | goto out; | |
719 | ptr = blocknr; | |
720 | } | |
721 | cnt = 1; | |
722 | if (cnt == maxblocks) | |
723 | goto end; | |
724 | ||
725 | maxlevel = nilfs_btree_height(btree) - 1; | |
9b7b265c | 726 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
c3a7abf0 RK |
727 | index = path[level].bp_index + 1; |
728 | for (;;) { | |
6d28f7ea RK |
729 | while (index < nilfs_btree_node_get_nchildren(node)) { |
730 | if (nilfs_btree_node_get_key(node, index) != | |
c3a7abf0 RK |
731 | key + cnt) |
732 | goto end; | |
9b7b265c | 733 | ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax); |
c3a7abf0 RK |
734 | if (dat) { |
735 | ret = nilfs_dat_translate(dat, ptr2, &blocknr); | |
736 | if (ret < 0) | |
737 | goto out; | |
738 | ptr2 = blocknr; | |
739 | } | |
740 | if (ptr2 != ptr + cnt || ++cnt == maxblocks) | |
741 | goto end; | |
742 | index++; | |
c3a7abf0 RK |
743 | } |
744 | if (level == maxlevel) | |
745 | break; | |
746 | ||
747 | /* look-up right sibling node */ | |
03bdb5ac RK |
748 | p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax); |
749 | p.index = path[level + 1].bp_index + 1; | |
750 | p.max_ra_blocks = 7; | |
751 | if (p.index >= nilfs_btree_node_get_nchildren(p.node) || | |
752 | nilfs_btree_node_get_key(p.node, p.index) != key + cnt) | |
c3a7abf0 | 753 | break; |
03bdb5ac RK |
754 | ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax); |
755 | path[level + 1].bp_index = p.index; | |
c3a7abf0 RK |
756 | |
757 | brelse(path[level].bp_bh); | |
758 | path[level].bp_bh = NULL; | |
03bdb5ac RK |
759 | |
760 | ret = __nilfs_btree_get_block(btree, ptr2, &path[level].bp_bh, | |
761 | &p); | |
c3a7abf0 RK |
762 | if (ret < 0) |
763 | goto out; | |
6d28f7ea | 764 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 765 | ncmax = nilfs_btree_nchildren_per_block(btree); |
c3a7abf0 RK |
766 | index = 0; |
767 | path[level].bp_index = index; | |
768 | } | |
769 | end: | |
770 | *ptrp = ptr; | |
771 | ret = cnt; | |
772 | out: | |
6d28f7ea | 773 | nilfs_btree_free_path(path); |
c3a7abf0 RK |
774 | return ret; |
775 | } | |
776 | ||
e7c274f8 | 777 | static void nilfs_btree_promote_key(struct nilfs_bmap *btree, |
17c76b01 KS |
778 | struct nilfs_btree_path *path, |
779 | int level, __u64 key) | |
780 | { | |
781 | if (level < nilfs_btree_height(btree) - 1) { | |
782 | do { | |
17c76b01 | 783 | nilfs_btree_node_set_key( |
6d28f7ea | 784 | nilfs_btree_get_nonroot_node(path, level), |
17c76b01 KS |
785 | path[level].bp_index, key); |
786 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 787 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
788 | } while ((path[level].bp_index == 0) && |
789 | (++level < nilfs_btree_height(btree) - 1)); | |
790 | } | |
791 | ||
792 | /* root */ | |
793 | if (level == nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 794 | nilfs_btree_node_set_key(nilfs_btree_get_root(btree), |
17c76b01 KS |
795 | path[level].bp_index, key); |
796 | } | |
797 | } | |
798 | ||
e7c274f8 | 799 | static void nilfs_btree_do_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
800 | struct nilfs_btree_path *path, |
801 | int level, __u64 *keyp, __u64 *ptrp) | |
802 | { | |
803 | struct nilfs_btree_node *node; | |
9b7b265c | 804 | int ncblk; |
17c76b01 KS |
805 | |
806 | if (level < nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 807 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c RK |
808 | ncblk = nilfs_btree_nchildren_per_block(btree); |
809 | nilfs_btree_node_insert(node, path[level].bp_index, | |
810 | *keyp, *ptrp, ncblk); | |
17c76b01 | 811 | if (!buffer_dirty(path[level].bp_bh)) |
5fc7b141 | 812 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
813 | |
814 | if (path[level].bp_index == 0) | |
815 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea RK |
816 | nilfs_btree_node_get_key(node, |
817 | 0)); | |
17c76b01 KS |
818 | } else { |
819 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
820 | nilfs_btree_node_insert(node, path[level].bp_index, |
821 | *keyp, *ptrp, | |
822 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
823 | } |
824 | } | |
825 | ||
e7c274f8 | 826 | static void nilfs_btree_carry_left(struct nilfs_bmap *btree, |
17c76b01 KS |
827 | struct nilfs_btree_path *path, |
828 | int level, __u64 *keyp, __u64 *ptrp) | |
829 | { | |
830 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 831 | int nchildren, lnchildren, n, move, ncblk; |
17c76b01 | 832 | |
6d28f7ea RK |
833 | node = nilfs_btree_get_nonroot_node(path, level); |
834 | left = nilfs_btree_get_sib_node(path, level); | |
835 | nchildren = nilfs_btree_node_get_nchildren(node); | |
836 | lnchildren = nilfs_btree_node_get_nchildren(left); | |
9b7b265c | 837 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
838 | move = 0; |
839 | ||
840 | n = (nchildren + lnchildren + 1) / 2 - lnchildren; | |
841 | if (n > path[level].bp_index) { | |
842 | /* move insert point */ | |
843 | n--; | |
844 | move = 1; | |
845 | } | |
846 | ||
9b7b265c | 847 | nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); |
17c76b01 KS |
848 | |
849 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 850 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 851 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 852 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 853 | |
17c76b01 | 854 | nilfs_btree_promote_key(btree, path, level + 1, |
6d28f7ea | 855 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 KS |
856 | |
857 | if (move) { | |
087d01b4 | 858 | brelse(path[level].bp_bh); |
17c76b01 KS |
859 | path[level].bp_bh = path[level].bp_sib_bh; |
860 | path[level].bp_sib_bh = NULL; | |
861 | path[level].bp_index += lnchildren; | |
862 | path[level + 1].bp_index--; | |
863 | } else { | |
087d01b4 | 864 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
865 | path[level].bp_sib_bh = NULL; |
866 | path[level].bp_index -= n; | |
867 | } | |
868 | ||
869 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
870 | } | |
871 | ||
e7c274f8 | 872 | static void nilfs_btree_carry_right(struct nilfs_bmap *btree, |
17c76b01 KS |
873 | struct nilfs_btree_path *path, |
874 | int level, __u64 *keyp, __u64 *ptrp) | |
875 | { | |
876 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 877 | int nchildren, rnchildren, n, move, ncblk; |
17c76b01 | 878 | |
6d28f7ea RK |
879 | node = nilfs_btree_get_nonroot_node(path, level); |
880 | right = nilfs_btree_get_sib_node(path, level); | |
881 | nchildren = nilfs_btree_node_get_nchildren(node); | |
882 | rnchildren = nilfs_btree_node_get_nchildren(right); | |
9b7b265c | 883 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
884 | move = 0; |
885 | ||
886 | n = (nchildren + rnchildren + 1) / 2 - rnchildren; | |
887 | if (n > nchildren - path[level].bp_index) { | |
888 | /* move insert point */ | |
889 | n--; | |
890 | move = 1; | |
891 | } | |
892 | ||
9b7b265c | 893 | nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); |
17c76b01 KS |
894 | |
895 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 896 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 897 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 898 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 899 | |
17c76b01 KS |
900 | path[level + 1].bp_index++; |
901 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 902 | nilfs_btree_node_get_key(right, 0)); |
17c76b01 KS |
903 | path[level + 1].bp_index--; |
904 | ||
905 | if (move) { | |
087d01b4 | 906 | brelse(path[level].bp_bh); |
17c76b01 KS |
907 | path[level].bp_bh = path[level].bp_sib_bh; |
908 | path[level].bp_sib_bh = NULL; | |
6d28f7ea | 909 | path[level].bp_index -= nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
910 | path[level + 1].bp_index++; |
911 | } else { | |
087d01b4 | 912 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
913 | path[level].bp_sib_bh = NULL; |
914 | } | |
915 | ||
916 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
917 | } | |
918 | ||
e7c274f8 | 919 | static void nilfs_btree_split(struct nilfs_bmap *btree, |
17c76b01 KS |
920 | struct nilfs_btree_path *path, |
921 | int level, __u64 *keyp, __u64 *ptrp) | |
922 | { | |
923 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 924 | int nchildren, n, move, ncblk; |
17c76b01 | 925 | |
6d28f7ea RK |
926 | node = nilfs_btree_get_nonroot_node(path, level); |
927 | right = nilfs_btree_get_sib_node(path, level); | |
928 | nchildren = nilfs_btree_node_get_nchildren(node); | |
9b7b265c | 929 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
930 | move = 0; |
931 | ||
932 | n = (nchildren + 1) / 2; | |
933 | if (n > nchildren - path[level].bp_index) { | |
934 | n--; | |
935 | move = 1; | |
936 | } | |
937 | ||
9b7b265c | 938 | nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); |
17c76b01 KS |
939 | |
940 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 941 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 942 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 943 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 944 | |
17c76b01 | 945 | if (move) { |
6d28f7ea | 946 | path[level].bp_index -= nilfs_btree_node_get_nchildren(node); |
9b7b265c RK |
947 | nilfs_btree_node_insert(right, path[level].bp_index, |
948 | *keyp, *ptrp, ncblk); | |
17c76b01 | 949 | |
6d28f7ea | 950 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
951 | *ptrp = path[level].bp_newreq.bpr_ptr; |
952 | ||
087d01b4 | 953 | brelse(path[level].bp_bh); |
17c76b01 KS |
954 | path[level].bp_bh = path[level].bp_sib_bh; |
955 | path[level].bp_sib_bh = NULL; | |
956 | } else { | |
957 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
958 | ||
6d28f7ea | 959 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
960 | *ptrp = path[level].bp_newreq.bpr_ptr; |
961 | ||
087d01b4 | 962 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
963 | path[level].bp_sib_bh = NULL; |
964 | } | |
965 | ||
966 | path[level + 1].bp_index++; | |
967 | } | |
968 | ||
e7c274f8 | 969 | static void nilfs_btree_grow(struct nilfs_bmap *btree, |
17c76b01 KS |
970 | struct nilfs_btree_path *path, |
971 | int level, __u64 *keyp, __u64 *ptrp) | |
972 | { | |
973 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 974 | int n, ncblk; |
17c76b01 | 975 | |
17c76b01 | 976 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 977 | child = nilfs_btree_get_sib_node(path, level); |
9b7b265c | 978 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 979 | |
6d28f7ea | 980 | n = nilfs_btree_node_get_nchildren(root); |
17c76b01 | 981 | |
9b7b265c RK |
982 | nilfs_btree_node_move_right(root, child, n, |
983 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
6d28f7ea | 984 | nilfs_btree_node_set_level(root, level + 1); |
17c76b01 KS |
985 | |
986 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
5fc7b141 | 987 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 988 | |
17c76b01 KS |
989 | path[level].bp_bh = path[level].bp_sib_bh; |
990 | path[level].bp_sib_bh = NULL; | |
991 | ||
992 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
993 | ||
6d28f7ea | 994 | *keyp = nilfs_btree_node_get_key(child, 0); |
17c76b01 KS |
995 | *ptrp = path[level].bp_newreq.bpr_ptr; |
996 | } | |
997 | ||
e7c274f8 | 998 | static __u64 nilfs_btree_find_near(const struct nilfs_bmap *btree, |
17c76b01 KS |
999 | const struct nilfs_btree_path *path) |
1000 | { | |
1001 | struct nilfs_btree_node *node; | |
9b7b265c | 1002 | int level, ncmax; |
17c76b01 KS |
1003 | |
1004 | if (path == NULL) | |
1005 | return NILFS_BMAP_INVALID_PTR; | |
1006 | ||
1007 | /* left sibling */ | |
1008 | level = NILFS_BTREE_LEVEL_NODE_MIN; | |
1009 | if (path[level].bp_index > 0) { | |
9b7b265c RK |
1010 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
1011 | return nilfs_btree_node_get_ptr(node, | |
1012 | path[level].bp_index - 1, | |
1013 | ncmax); | |
17c76b01 KS |
1014 | } |
1015 | ||
1016 | /* parent */ | |
1017 | level = NILFS_BTREE_LEVEL_NODE_MIN + 1; | |
1018 | if (level <= nilfs_btree_height(btree) - 1) { | |
9b7b265c RK |
1019 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
1020 | return nilfs_btree_node_get_ptr(node, path[level].bp_index, | |
1021 | ncmax); | |
17c76b01 KS |
1022 | } |
1023 | ||
1024 | return NILFS_BMAP_INVALID_PTR; | |
1025 | } | |
1026 | ||
e7c274f8 | 1027 | static __u64 nilfs_btree_find_target_v(const struct nilfs_bmap *btree, |
17c76b01 KS |
1028 | const struct nilfs_btree_path *path, |
1029 | __u64 key) | |
1030 | { | |
1031 | __u64 ptr; | |
1032 | ||
e7c274f8 | 1033 | ptr = nilfs_bmap_find_target_seq(btree, key); |
17c76b01 KS |
1034 | if (ptr != NILFS_BMAP_INVALID_PTR) |
1035 | /* sequential access */ | |
1036 | return ptr; | |
7f00184e RK |
1037 | |
1038 | ptr = nilfs_btree_find_near(btree, path); | |
1039 | if (ptr != NILFS_BMAP_INVALID_PTR) | |
1040 | /* near */ | |
1041 | return ptr; | |
1042 | ||
17c76b01 | 1043 | /* block group */ |
e7c274f8 | 1044 | return nilfs_bmap_find_target_in_group(btree); |
17c76b01 KS |
1045 | } |
1046 | ||
e7c274f8 | 1047 | static int nilfs_btree_prepare_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1048 | struct nilfs_btree_path *path, |
1049 | int *levelp, __u64 key, __u64 ptr, | |
1050 | struct nilfs_bmap_stats *stats) | |
1051 | { | |
1052 | struct buffer_head *bh; | |
1053 | struct nilfs_btree_node *node, *parent, *sib; | |
1054 | __u64 sibptr; | |
9b7b265c | 1055 | int pindex, level, ncmax, ncblk, ret; |
2e0c2c73 | 1056 | struct inode *dat = NULL; |
17c76b01 KS |
1057 | |
1058 | stats->bs_nblocks = 0; | |
1059 | level = NILFS_BTREE_LEVEL_DATA; | |
1060 | ||
1061 | /* allocate a new ptr for data block */ | |
e7c274f8 | 1062 | if (NILFS_BMAP_USE_VBN(btree)) { |
17c76b01 | 1063 | path[level].bp_newreq.bpr_ptr = |
7cde31d7 | 1064 | nilfs_btree_find_target_v(btree, path, key); |
e7c274f8 | 1065 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1066 | } |
17c76b01 | 1067 | |
e7c274f8 | 1068 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1069 | if (ret < 0) |
1070 | goto err_out_data; | |
1071 | ||
9b7b265c | 1072 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 1073 | |
17c76b01 KS |
1074 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; |
1075 | level < nilfs_btree_height(btree) - 1; | |
1076 | level++) { | |
6d28f7ea | 1077 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 1078 | if (nilfs_btree_node_get_nchildren(node) < ncblk) { |
17c76b01 KS |
1079 | path[level].bp_op = nilfs_btree_do_insert; |
1080 | stats->bs_nblocks++; | |
1081 | goto out; | |
1082 | } | |
1083 | ||
9b7b265c | 1084 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 KS |
1085 | pindex = path[level + 1].bp_index; |
1086 | ||
1087 | /* left sibling */ | |
1088 | if (pindex > 0) { | |
9b7b265c RK |
1089 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1090 | ncmax); | |
f198dbb9 | 1091 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1092 | if (ret < 0) |
1093 | goto err_out_child_node; | |
1094 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1095 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1096 | path[level].bp_sib_bh = bh; |
1097 | path[level].bp_op = nilfs_btree_carry_left; | |
1098 | stats->bs_nblocks++; | |
1099 | goto out; | |
9b7b265c | 1100 | } else { |
087d01b4 | 1101 | brelse(bh); |
9b7b265c | 1102 | } |
17c76b01 KS |
1103 | } |
1104 | ||
1105 | /* right sibling */ | |
9b7b265c RK |
1106 | if (pindex < nilfs_btree_node_get_nchildren(parent) - 1) { |
1107 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, | |
1108 | ncmax); | |
f198dbb9 | 1109 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1110 | if (ret < 0) |
1111 | goto err_out_child_node; | |
1112 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1113 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1114 | path[level].bp_sib_bh = bh; |
1115 | path[level].bp_op = nilfs_btree_carry_right; | |
1116 | stats->bs_nblocks++; | |
1117 | goto out; | |
9b7b265c | 1118 | } else { |
087d01b4 | 1119 | brelse(bh); |
9b7b265c | 1120 | } |
17c76b01 KS |
1121 | } |
1122 | ||
1123 | /* split */ | |
1124 | path[level].bp_newreq.bpr_ptr = | |
1125 | path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1126 | ret = nilfs_bmap_prepare_alloc_ptr(btree, |
2e0c2c73 | 1127 | &path[level].bp_newreq, dat); |
17c76b01 KS |
1128 | if (ret < 0) |
1129 | goto err_out_child_node; | |
f198dbb9 RK |
1130 | ret = nilfs_btree_get_new_block(btree, |
1131 | path[level].bp_newreq.bpr_ptr, | |
1132 | &bh); | |
17c76b01 KS |
1133 | if (ret < 0) |
1134 | goto err_out_curr_node; | |
1135 | ||
1136 | stats->bs_nblocks++; | |
1137 | ||
9b7b265c RK |
1138 | sib = (struct nilfs_btree_node *)bh->b_data; |
1139 | nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1140 | path[level].bp_sib_bh = bh; |
1141 | path[level].bp_op = nilfs_btree_split; | |
1142 | } | |
1143 | ||
1144 | /* root */ | |
1145 | node = nilfs_btree_get_root(btree); | |
6d28f7ea | 1146 | if (nilfs_btree_node_get_nchildren(node) < |
ea64ab87 | 1147 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
17c76b01 KS |
1148 | path[level].bp_op = nilfs_btree_do_insert; |
1149 | stats->bs_nblocks++; | |
1150 | goto out; | |
1151 | } | |
1152 | ||
1153 | /* grow */ | |
1154 | path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1155 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1156 | if (ret < 0) |
1157 | goto err_out_child_node; | |
f198dbb9 RK |
1158 | ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr, |
1159 | &bh); | |
17c76b01 KS |
1160 | if (ret < 0) |
1161 | goto err_out_curr_node; | |
1162 | ||
9b7b265c RK |
1163 | nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data, |
1164 | 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1165 | path[level].bp_sib_bh = bh; |
1166 | path[level].bp_op = nilfs_btree_grow; | |
1167 | ||
1168 | level++; | |
1169 | path[level].bp_op = nilfs_btree_do_insert; | |
1170 | ||
1171 | /* a newly-created node block and a data block are added */ | |
1172 | stats->bs_nblocks += 2; | |
1173 | ||
1174 | /* success */ | |
1175 | out: | |
1176 | *levelp = level; | |
1177 | return ret; | |
1178 | ||
1179 | /* error */ | |
1180 | err_out_curr_node: | |
e7c274f8 | 1181 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1182 | err_out_child_node: |
1183 | for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) { | |
9f098900 | 1184 | nilfs_btnode_delete(path[level].bp_sib_bh); |
e7c274f8 | 1185 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1186 | |
1187 | } | |
1188 | ||
e7c274f8 | 1189 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1190 | err_out_data: |
1191 | *levelp = level; | |
1192 | stats->bs_nblocks = 0; | |
1193 | return ret; | |
1194 | } | |
1195 | ||
e7c274f8 | 1196 | static void nilfs_btree_commit_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1197 | struct nilfs_btree_path *path, |
1198 | int maxlevel, __u64 key, __u64 ptr) | |
1199 | { | |
2e0c2c73 | 1200 | struct inode *dat = NULL; |
17c76b01 KS |
1201 | int level; |
1202 | ||
1203 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1204 | ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr; | |
e7c274f8 | 1205 | if (NILFS_BMAP_USE_VBN(btree)) { |
dc935be2 | 1206 | nilfs_bmap_set_target_v(btree, key, ptr); |
e7c274f8 | 1207 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1208 | } |
17c76b01 KS |
1209 | |
1210 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1211 | nilfs_bmap_commit_alloc_ptr(btree, |
2e0c2c73 | 1212 | &path[level - 1].bp_newreq, dat); |
8acfbf09 | 1213 | path[level].bp_op(btree, path, level, &key, &ptr); |
17c76b01 KS |
1214 | } |
1215 | ||
e7c274f8 RK |
1216 | if (!nilfs_bmap_dirty(btree)) |
1217 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1218 | } |
1219 | ||
e7c274f8 | 1220 | static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr) |
17c76b01 | 1221 | { |
17c76b01 KS |
1222 | struct nilfs_btree_path *path; |
1223 | struct nilfs_bmap_stats stats; | |
1224 | int level, ret; | |
1225 | ||
6d28f7ea | 1226 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1227 | if (path == NULL) |
1228 | return -ENOMEM; | |
17c76b01 KS |
1229 | |
1230 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, | |
03bdb5ac | 1231 | NILFS_BTREE_LEVEL_NODE_MIN, 0); |
17c76b01 KS |
1232 | if (ret != -ENOENT) { |
1233 | if (ret == 0) | |
1234 | ret = -EEXIST; | |
1235 | goto out; | |
1236 | } | |
1237 | ||
1238 | ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats); | |
1239 | if (ret < 0) | |
1240 | goto out; | |
1241 | nilfs_btree_commit_insert(btree, path, level, key, ptr); | |
be667377 | 1242 | nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1243 | |
1244 | out: | |
6d28f7ea | 1245 | nilfs_btree_free_path(path); |
17c76b01 KS |
1246 | return ret; |
1247 | } | |
1248 | ||
e7c274f8 | 1249 | static void nilfs_btree_do_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1250 | struct nilfs_btree_path *path, |
1251 | int level, __u64 *keyp, __u64 *ptrp) | |
1252 | { | |
1253 | struct nilfs_btree_node *node; | |
9b7b265c | 1254 | int ncblk; |
17c76b01 KS |
1255 | |
1256 | if (level < nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 1257 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c RK |
1258 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1259 | nilfs_btree_node_delete(node, path[level].bp_index, | |
1260 | keyp, ptrp, ncblk); | |
17c76b01 | 1261 | if (!buffer_dirty(path[level].bp_bh)) |
5fc7b141 | 1262 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
1263 | if (path[level].bp_index == 0) |
1264 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1265 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 KS |
1266 | } else { |
1267 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1268 | nilfs_btree_node_delete(node, path[level].bp_index, |
1269 | keyp, ptrp, | |
1270 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
1271 | } |
1272 | } | |
1273 | ||
e7c274f8 | 1274 | static void nilfs_btree_borrow_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1275 | struct nilfs_btree_path *path, |
1276 | int level, __u64 *keyp, __u64 *ptrp) | |
1277 | { | |
1278 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1279 | int nchildren, lnchildren, n, ncblk; |
17c76b01 KS |
1280 | |
1281 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1282 | ||
6d28f7ea RK |
1283 | node = nilfs_btree_get_nonroot_node(path, level); |
1284 | left = nilfs_btree_get_sib_node(path, level); | |
1285 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1286 | lnchildren = nilfs_btree_node_get_nchildren(left); | |
9b7b265c | 1287 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1288 | |
1289 | n = (nchildren + lnchildren) / 2 - nchildren; | |
1290 | ||
9b7b265c | 1291 | nilfs_btree_node_move_right(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1292 | |
1293 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1294 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1295 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 1296 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1297 | |
17c76b01 | 1298 | nilfs_btree_promote_key(btree, path, level + 1, |
6d28f7ea | 1299 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 | 1300 | |
087d01b4 | 1301 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1302 | path[level].bp_sib_bh = NULL; |
1303 | path[level].bp_index += n; | |
1304 | } | |
1305 | ||
e7c274f8 | 1306 | static void nilfs_btree_borrow_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1307 | struct nilfs_btree_path *path, |
1308 | int level, __u64 *keyp, __u64 *ptrp) | |
1309 | { | |
1310 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1311 | int nchildren, rnchildren, n, ncblk; |
17c76b01 KS |
1312 | |
1313 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1314 | ||
6d28f7ea RK |
1315 | node = nilfs_btree_get_nonroot_node(path, level); |
1316 | right = nilfs_btree_get_sib_node(path, level); | |
1317 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1318 | rnchildren = nilfs_btree_node_get_nchildren(right); | |
9b7b265c | 1319 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1320 | |
1321 | n = (nchildren + rnchildren) / 2 - nchildren; | |
1322 | ||
9b7b265c | 1323 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1324 | |
1325 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1326 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1327 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 1328 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1329 | |
17c76b01 KS |
1330 | path[level + 1].bp_index++; |
1331 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1332 | nilfs_btree_node_get_key(right, 0)); |
17c76b01 KS |
1333 | path[level + 1].bp_index--; |
1334 | ||
087d01b4 | 1335 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1336 | path[level].bp_sib_bh = NULL; |
1337 | } | |
1338 | ||
e7c274f8 | 1339 | static void nilfs_btree_concat_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1340 | struct nilfs_btree_path *path, |
1341 | int level, __u64 *keyp, __u64 *ptrp) | |
1342 | { | |
1343 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1344 | int n, ncblk; |
17c76b01 KS |
1345 | |
1346 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1347 | ||
6d28f7ea RK |
1348 | node = nilfs_btree_get_nonroot_node(path, level); |
1349 | left = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1350 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1351 | |
6d28f7ea | 1352 | n = nilfs_btree_node_get_nchildren(node); |
17c76b01 | 1353 | |
9b7b265c | 1354 | nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1355 | |
1356 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
5fc7b141 | 1357 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1358 | |
9f098900 | 1359 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1360 | path[level].bp_bh = path[level].bp_sib_bh; |
1361 | path[level].bp_sib_bh = NULL; | |
6d28f7ea | 1362 | path[level].bp_index += nilfs_btree_node_get_nchildren(left); |
17c76b01 KS |
1363 | } |
1364 | ||
e7c274f8 | 1365 | static void nilfs_btree_concat_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1366 | struct nilfs_btree_path *path, |
1367 | int level, __u64 *keyp, __u64 *ptrp) | |
1368 | { | |
1369 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1370 | int n, ncblk; |
17c76b01 KS |
1371 | |
1372 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1373 | ||
6d28f7ea RK |
1374 | node = nilfs_btree_get_nonroot_node(path, level); |
1375 | right = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1376 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1377 | |
6d28f7ea | 1378 | n = nilfs_btree_node_get_nchildren(right); |
17c76b01 | 1379 | |
9b7b265c | 1380 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1381 | |
1382 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1383 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1384 | |
9f098900 | 1385 | nilfs_btnode_delete(path[level].bp_sib_bh); |
17c76b01 KS |
1386 | path[level].bp_sib_bh = NULL; |
1387 | path[level + 1].bp_index++; | |
1388 | } | |
1389 | ||
e7c274f8 | 1390 | static void nilfs_btree_shrink(struct nilfs_bmap *btree, |
17c76b01 KS |
1391 | struct nilfs_btree_path *path, |
1392 | int level, __u64 *keyp, __u64 *ptrp) | |
1393 | { | |
1394 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 1395 | int n, ncblk; |
17c76b01 KS |
1396 | |
1397 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1398 | ||
17c76b01 | 1399 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 1400 | child = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 1401 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1402 | |
9b7b265c RK |
1403 | nilfs_btree_node_delete(root, 0, NULL, NULL, |
1404 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
6d28f7ea RK |
1405 | nilfs_btree_node_set_level(root, level); |
1406 | n = nilfs_btree_node_get_nchildren(child); | |
9b7b265c RK |
1407 | nilfs_btree_node_move_left(root, child, n, |
1408 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
17c76b01 | 1409 | |
9f098900 | 1410 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1411 | path[level].bp_bh = NULL; |
1412 | } | |
1413 | ||
d4099053 RK |
1414 | static void nilfs_btree_nop(struct nilfs_bmap *btree, |
1415 | struct nilfs_btree_path *path, | |
1416 | int level, __u64 *keyp, __u64 *ptrp) | |
1417 | { | |
1418 | } | |
17c76b01 | 1419 | |
e7c274f8 | 1420 | static int nilfs_btree_prepare_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1421 | struct nilfs_btree_path *path, |
1422 | int *levelp, | |
2e0c2c73 RK |
1423 | struct nilfs_bmap_stats *stats, |
1424 | struct inode *dat) | |
17c76b01 KS |
1425 | { |
1426 | struct buffer_head *bh; | |
1427 | struct nilfs_btree_node *node, *parent, *sib; | |
1428 | __u64 sibptr; | |
fe744fdb | 1429 | int pindex, dindex, level, ncmin, ncmax, ncblk, ret; |
17c76b01 KS |
1430 | |
1431 | ret = 0; | |
1432 | stats->bs_nblocks = 0; | |
ea64ab87 | 1433 | ncmin = NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree)); |
9b7b265c | 1434 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 1435 | |
fe744fdb | 1436 | for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index; |
17c76b01 KS |
1437 | level < nilfs_btree_height(btree) - 1; |
1438 | level++) { | |
6d28f7ea | 1439 | node = nilfs_btree_get_nonroot_node(path, level); |
17c76b01 | 1440 | path[level].bp_oldreq.bpr_ptr = |
fe744fdb | 1441 | nilfs_btree_node_get_ptr(node, dindex, ncblk); |
e7c274f8 | 1442 | ret = nilfs_bmap_prepare_end_ptr(btree, |
2e0c2c73 | 1443 | &path[level].bp_oldreq, dat); |
d4b96157 RK |
1444 | if (ret < 0) |
1445 | goto err_out_child_node; | |
17c76b01 | 1446 | |
ea64ab87 | 1447 | if (nilfs_btree_node_get_nchildren(node) > ncmin) { |
17c76b01 KS |
1448 | path[level].bp_op = nilfs_btree_do_delete; |
1449 | stats->bs_nblocks++; | |
1450 | goto out; | |
1451 | } | |
1452 | ||
9b7b265c | 1453 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 | 1454 | pindex = path[level + 1].bp_index; |
fe744fdb | 1455 | dindex = pindex; |
17c76b01 KS |
1456 | |
1457 | if (pindex > 0) { | |
1458 | /* left sibling */ | |
9b7b265c RK |
1459 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1460 | ncmax); | |
f198dbb9 | 1461 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1462 | if (ret < 0) |
1463 | goto err_out_curr_node; | |
1464 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1465 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1466 | path[level].bp_sib_bh = bh; |
1467 | path[level].bp_op = nilfs_btree_borrow_left; | |
1468 | stats->bs_nblocks++; | |
1469 | goto out; | |
1470 | } else { | |
1471 | path[level].bp_sib_bh = bh; | |
1472 | path[level].bp_op = nilfs_btree_concat_left; | |
1473 | stats->bs_nblocks++; | |
1474 | /* continue; */ | |
1475 | } | |
1476 | } else if (pindex < | |
6d28f7ea | 1477 | nilfs_btree_node_get_nchildren(parent) - 1) { |
17c76b01 | 1478 | /* right sibling */ |
9b7b265c RK |
1479 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, |
1480 | ncmax); | |
f198dbb9 | 1481 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1482 | if (ret < 0) |
1483 | goto err_out_curr_node; | |
1484 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1485 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1486 | path[level].bp_sib_bh = bh; |
1487 | path[level].bp_op = nilfs_btree_borrow_right; | |
1488 | stats->bs_nblocks++; | |
1489 | goto out; | |
1490 | } else { | |
1491 | path[level].bp_sib_bh = bh; | |
1492 | path[level].bp_op = nilfs_btree_concat_right; | |
1493 | stats->bs_nblocks++; | |
fe744fdb RK |
1494 | /* |
1495 | * When merging right sibling node | |
1496 | * into the current node, pointer to | |
1497 | * the right sibling node must be | |
1498 | * terminated instead. The adjustment | |
1499 | * below is required for that. | |
1500 | */ | |
1501 | dindex = pindex + 1; | |
17c76b01 KS |
1502 | /* continue; */ |
1503 | } | |
1504 | } else { | |
1505 | /* no siblings */ | |
1506 | /* the only child of the root node */ | |
1f5abe7e | 1507 | WARN_ON(level != nilfs_btree_height(btree) - 2); |
6d28f7ea | 1508 | if (nilfs_btree_node_get_nchildren(node) - 1 <= |
17c76b01 KS |
1509 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
1510 | path[level].bp_op = nilfs_btree_shrink; | |
1511 | stats->bs_nblocks += 2; | |
d4099053 RK |
1512 | level++; |
1513 | path[level].bp_op = nilfs_btree_nop; | |
1514 | goto shrink_root_child; | |
17c76b01 KS |
1515 | } else { |
1516 | path[level].bp_op = nilfs_btree_do_delete; | |
1517 | stats->bs_nblocks++; | |
d4099053 | 1518 | goto out; |
17c76b01 | 1519 | } |
17c76b01 KS |
1520 | } |
1521 | } | |
1522 | ||
d4099053 RK |
1523 | /* child of the root node is deleted */ |
1524 | path[level].bp_op = nilfs_btree_do_delete; | |
1525 | stats->bs_nblocks++; | |
1526 | ||
1527 | shrink_root_child: | |
17c76b01 KS |
1528 | node = nilfs_btree_get_root(btree); |
1529 | path[level].bp_oldreq.bpr_ptr = | |
fe744fdb | 1530 | nilfs_btree_node_get_ptr(node, dindex, |
9b7b265c | 1531 | NILFS_BTREE_ROOT_NCHILDREN_MAX); |
d4b96157 | 1532 | |
e7c274f8 | 1533 | ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat); |
d4b96157 RK |
1534 | if (ret < 0) |
1535 | goto err_out_child_node; | |
1536 | ||
17c76b01 KS |
1537 | /* success */ |
1538 | out: | |
1539 | *levelp = level; | |
1540 | return ret; | |
1541 | ||
1542 | /* error */ | |
1543 | err_out_curr_node: | |
e7c274f8 | 1544 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1545 | err_out_child_node: |
1546 | for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) { | |
087d01b4 | 1547 | brelse(path[level].bp_sib_bh); |
e7c274f8 | 1548 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1549 | } |
1550 | *levelp = level; | |
1551 | stats->bs_nblocks = 0; | |
1552 | return ret; | |
1553 | } | |
1554 | ||
e7c274f8 | 1555 | static void nilfs_btree_commit_delete(struct nilfs_bmap *btree, |
17c76b01 | 1556 | struct nilfs_btree_path *path, |
2e0c2c73 | 1557 | int maxlevel, struct inode *dat) |
17c76b01 KS |
1558 | { |
1559 | int level; | |
1560 | ||
1561 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1562 | nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat); |
8acfbf09 | 1563 | path[level].bp_op(btree, path, level, NULL, NULL); |
17c76b01 KS |
1564 | } |
1565 | ||
e7c274f8 RK |
1566 | if (!nilfs_bmap_dirty(btree)) |
1567 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1568 | } |
1569 | ||
e7c274f8 | 1570 | static int nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1571 | |
1572 | { | |
17c76b01 KS |
1573 | struct nilfs_btree_path *path; |
1574 | struct nilfs_bmap_stats stats; | |
2e0c2c73 | 1575 | struct inode *dat; |
17c76b01 KS |
1576 | int level, ret; |
1577 | ||
6d28f7ea | 1578 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1579 | if (path == NULL) |
1580 | return -ENOMEM; | |
f905440f | 1581 | |
17c76b01 | 1582 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, |
03bdb5ac | 1583 | NILFS_BTREE_LEVEL_NODE_MIN, 0); |
17c76b01 KS |
1584 | if (ret < 0) |
1585 | goto out; | |
1586 | ||
2e0c2c73 | 1587 | |
e7c274f8 | 1588 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
2e0c2c73 RK |
1589 | |
1590 | ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat); | |
17c76b01 KS |
1591 | if (ret < 0) |
1592 | goto out; | |
2e0c2c73 | 1593 | nilfs_btree_commit_delete(btree, path, level, dat); |
be667377 | 1594 | nilfs_inode_sub_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1595 | |
1596 | out: | |
6d28f7ea | 1597 | nilfs_btree_free_path(path); |
17c76b01 KS |
1598 | return ret; |
1599 | } | |
1600 | ||
5b20384f RK |
1601 | static int nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, |
1602 | __u64 *keyp) | |
1603 | { | |
1604 | struct nilfs_btree_path *path; | |
1605 | const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN; | |
1606 | int ret; | |
1607 | ||
1608 | path = nilfs_btree_alloc_path(); | |
1609 | if (!path) | |
1610 | return -ENOMEM; | |
1611 | ||
1612 | ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0); | |
1613 | if (!ret) | |
1614 | *keyp = start; | |
1615 | else if (ret == -ENOENT) | |
1616 | ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); | |
1617 | ||
1618 | nilfs_btree_free_path(path); | |
1619 | return ret; | |
1620 | } | |
1621 | ||
e7c274f8 | 1622 | static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) |
17c76b01 | 1623 | { |
17c76b01 KS |
1624 | struct nilfs_btree_path *path; |
1625 | int ret; | |
1626 | ||
6d28f7ea | 1627 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1628 | if (path == NULL) |
1629 | return -ENOMEM; | |
17c76b01 KS |
1630 | |
1631 | ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); | |
1632 | ||
6d28f7ea | 1633 | nilfs_btree_free_path(path); |
17c76b01 KS |
1634 | |
1635 | return ret; | |
1636 | } | |
1637 | ||
e7c274f8 | 1638 | static int nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1639 | { |
1640 | struct buffer_head *bh; | |
17c76b01 KS |
1641 | struct nilfs_btree_node *root, *node; |
1642 | __u64 maxkey, nextmaxkey; | |
1643 | __u64 ptr; | |
1644 | int nchildren, ret; | |
1645 | ||
17c76b01 KS |
1646 | root = nilfs_btree_get_root(btree); |
1647 | switch (nilfs_btree_height(btree)) { | |
1648 | case 2: | |
1649 | bh = NULL; | |
1650 | node = root; | |
1651 | break; | |
1652 | case 3: | |
6d28f7ea | 1653 | nchildren = nilfs_btree_node_get_nchildren(root); |
17c76b01 KS |
1654 | if (nchildren > 1) |
1655 | return 0; | |
9b7b265c RK |
1656 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1657 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1658 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1659 | if (ret < 0) |
1660 | return ret; | |
1661 | node = (struct nilfs_btree_node *)bh->b_data; | |
1662 | break; | |
1663 | default: | |
1664 | return 0; | |
1665 | } | |
1666 | ||
6d28f7ea RK |
1667 | nchildren = nilfs_btree_node_get_nchildren(node); |
1668 | maxkey = nilfs_btree_node_get_key(node, nchildren - 1); | |
17c76b01 | 1669 | nextmaxkey = (nchildren > 1) ? |
6d28f7ea | 1670 | nilfs_btree_node_get_key(node, nchildren - 2) : 0; |
17c76b01 | 1671 | if (bh != NULL) |
087d01b4 | 1672 | brelse(bh); |
17c76b01 | 1673 | |
3033342a | 1674 | return (maxkey == key) && (nextmaxkey < NILFS_BMAP_LARGE_LOW); |
17c76b01 KS |
1675 | } |
1676 | ||
e7c274f8 | 1677 | static int nilfs_btree_gather_data(struct nilfs_bmap *btree, |
17c76b01 KS |
1678 | __u64 *keys, __u64 *ptrs, int nitems) |
1679 | { | |
1680 | struct buffer_head *bh; | |
17c76b01 KS |
1681 | struct nilfs_btree_node *node, *root; |
1682 | __le64 *dkeys; | |
1683 | __le64 *dptrs; | |
1684 | __u64 ptr; | |
9b7b265c | 1685 | int nchildren, ncmax, i, ret; |
17c76b01 | 1686 | |
17c76b01 KS |
1687 | root = nilfs_btree_get_root(btree); |
1688 | switch (nilfs_btree_height(btree)) { | |
1689 | case 2: | |
1690 | bh = NULL; | |
1691 | node = root; | |
9b7b265c | 1692 | ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX; |
17c76b01 KS |
1693 | break; |
1694 | case 3: | |
6d28f7ea | 1695 | nchildren = nilfs_btree_node_get_nchildren(root); |
1f5abe7e | 1696 | WARN_ON(nchildren > 1); |
9b7b265c RK |
1697 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1698 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1699 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1700 | if (ret < 0) |
1701 | return ret; | |
1702 | node = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1703 | ncmax = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1704 | break; |
1705 | default: | |
1706 | node = NULL; | |
1f5abe7e | 1707 | return -EINVAL; |
17c76b01 KS |
1708 | } |
1709 | ||
6d28f7ea | 1710 | nchildren = nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
1711 | if (nchildren < nitems) |
1712 | nitems = nchildren; | |
6d28f7ea | 1713 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 1714 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
17c76b01 | 1715 | for (i = 0; i < nitems; i++) { |
25b8d7de RK |
1716 | keys[i] = le64_to_cpu(dkeys[i]); |
1717 | ptrs[i] = le64_to_cpu(dptrs[i]); | |
17c76b01 KS |
1718 | } |
1719 | ||
1720 | if (bh != NULL) | |
087d01b4 | 1721 | brelse(bh); |
17c76b01 KS |
1722 | |
1723 | return nitems; | |
1724 | } | |
1725 | ||
1726 | static int | |
e7c274f8 | 1727 | nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key, |
17c76b01 KS |
1728 | union nilfs_bmap_ptr_req *dreq, |
1729 | union nilfs_bmap_ptr_req *nreq, | |
1730 | struct buffer_head **bhp, | |
1731 | struct nilfs_bmap_stats *stats) | |
1732 | { | |
1733 | struct buffer_head *bh; | |
2e0c2c73 | 1734 | struct inode *dat = NULL; |
17c76b01 KS |
1735 | int ret; |
1736 | ||
17c76b01 KS |
1737 | stats->bs_nblocks = 0; |
1738 | ||
1739 | /* for data */ | |
1740 | /* cannot find near ptr */ | |
e7c274f8 | 1741 | if (NILFS_BMAP_USE_VBN(btree)) { |
7cde31d7 | 1742 | dreq->bpr_ptr = nilfs_btree_find_target_v(btree, NULL, key); |
e7c274f8 | 1743 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1744 | } |
7cde31d7 | 1745 | |
e897be17 RK |
1746 | ret = nilfs_attach_btree_node_cache(&NILFS_BMAP_I(btree)->vfs_inode); |
1747 | if (ret < 0) | |
1748 | return ret; | |
1749 | ||
e7c274f8 | 1750 | ret = nilfs_bmap_prepare_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1751 | if (ret < 0) |
1752 | return ret; | |
1753 | ||
1754 | *bhp = NULL; | |
1755 | stats->bs_nblocks++; | |
1756 | if (nreq != NULL) { | |
1757 | nreq->bpr_ptr = dreq->bpr_ptr + 1; | |
e7c274f8 | 1758 | ret = nilfs_bmap_prepare_alloc_ptr(btree, nreq, dat); |
17c76b01 KS |
1759 | if (ret < 0) |
1760 | goto err_out_dreq; | |
1761 | ||
f198dbb9 | 1762 | ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh); |
17c76b01 KS |
1763 | if (ret < 0) |
1764 | goto err_out_nreq; | |
1765 | ||
1766 | *bhp = bh; | |
1767 | stats->bs_nblocks++; | |
1768 | } | |
1769 | ||
1770 | /* success */ | |
1771 | return 0; | |
1772 | ||
1773 | /* error */ | |
1774 | err_out_nreq: | |
e7c274f8 | 1775 | nilfs_bmap_abort_alloc_ptr(btree, nreq, dat); |
17c76b01 | 1776 | err_out_dreq: |
e7c274f8 | 1777 | nilfs_bmap_abort_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1778 | stats->bs_nblocks = 0; |
1779 | return ret; | |
1780 | ||
1781 | } | |
1782 | ||
1783 | static void | |
e7c274f8 | 1784 | nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1785 | __u64 key, __u64 ptr, |
1786 | const __u64 *keys, const __u64 *ptrs, | |
3033342a | 1787 | int n, |
17c76b01 KS |
1788 | union nilfs_bmap_ptr_req *dreq, |
1789 | union nilfs_bmap_ptr_req *nreq, | |
1790 | struct buffer_head *bh) | |
1791 | { | |
17c76b01 | 1792 | struct nilfs_btree_node *node; |
2e0c2c73 | 1793 | struct inode *dat; |
17c76b01 | 1794 | __u64 tmpptr; |
9b7b265c | 1795 | int ncblk; |
17c76b01 KS |
1796 | |
1797 | /* free resources */ | |
e7c274f8 RK |
1798 | if (btree->b_ops->bop_clear != NULL) |
1799 | btree->b_ops->bop_clear(btree); | |
17c76b01 KS |
1800 | |
1801 | /* ptr must be a pointer to a buffer head. */ | |
1802 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1803 | ||
1804 | /* convert and insert */ | |
e7c274f8 | 1805 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
957ed60b | 1806 | __nilfs_btree_init(btree); |
17c76b01 | 1807 | if (nreq != NULL) { |
e7c274f8 RK |
1808 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
1809 | nilfs_bmap_commit_alloc_ptr(btree, nreq, dat); | |
17c76b01 KS |
1810 | |
1811 | /* create child node at level 1 */ | |
17c76b01 | 1812 | node = (struct nilfs_btree_node *)bh->b_data; |
9b7b265c RK |
1813 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1814 | nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs); | |
1815 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk); | |
17c76b01 | 1816 | if (!buffer_dirty(bh)) |
5fc7b141 | 1817 | mark_buffer_dirty(bh); |
e7c274f8 RK |
1818 | if (!nilfs_bmap_dirty(btree)) |
1819 | nilfs_bmap_set_dirty(btree); | |
17c76b01 | 1820 | |
087d01b4 | 1821 | brelse(bh); |
17c76b01 KS |
1822 | |
1823 | /* create root node at level 2 */ | |
1824 | node = nilfs_btree_get_root(btree); | |
1825 | tmpptr = nreq->bpr_ptr; | |
9b7b265c RK |
1826 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 2, 1, |
1827 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1828 | &keys[0], &tmpptr); | |
17c76b01 | 1829 | } else { |
e7c274f8 | 1830 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1831 | |
1832 | /* create root node at level 1 */ | |
1833 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1834 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 1, n, |
1835 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1836 | keys, ptrs); | |
1837 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, | |
1838 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
e7c274f8 RK |
1839 | if (!nilfs_bmap_dirty(btree)) |
1840 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1841 | } |
1842 | ||
e7c274f8 | 1843 | if (NILFS_BMAP_USE_VBN(btree)) |
dc935be2 | 1844 | nilfs_bmap_set_target_v(btree, key, dreq->bpr_ptr); |
17c76b01 KS |
1845 | } |
1846 | ||
1847 | /** | |
1848 | * nilfs_btree_convert_and_insert - | |
1849 | * @bmap: | |
1850 | * @key: | |
1851 | * @ptr: | |
1852 | * @keys: | |
1853 | * @ptrs: | |
1854 | * @n: | |
17c76b01 | 1855 | */ |
e7c274f8 | 1856 | int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 | 1857 | __u64 key, __u64 ptr, |
3033342a | 1858 | const __u64 *keys, const __u64 *ptrs, int n) |
17c76b01 | 1859 | { |
4f05028f | 1860 | struct buffer_head *bh = NULL; |
17c76b01 KS |
1861 | union nilfs_bmap_ptr_req dreq, nreq, *di, *ni; |
1862 | struct nilfs_bmap_stats stats; | |
1863 | int ret; | |
1864 | ||
1865 | if (n + 1 <= NILFS_BTREE_ROOT_NCHILDREN_MAX) { | |
1866 | di = &dreq; | |
1867 | ni = NULL; | |
1868 | } else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX( | |
1508ddc3 | 1869 | nilfs_btree_node_size(btree))) { |
17c76b01 KS |
1870 | di = &dreq; |
1871 | ni = &nreq; | |
1872 | } else { | |
1873 | di = NULL; | |
1874 | ni = NULL; | |
1875 | BUG(); | |
1876 | } | |
1877 | ||
e7c274f8 | 1878 | ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh, |
17c76b01 KS |
1879 | &stats); |
1880 | if (ret < 0) | |
1881 | return ret; | |
e7c274f8 | 1882 | nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n, |
3033342a | 1883 | di, ni, bh); |
be667377 | 1884 | nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1885 | return 0; |
1886 | } | |
1887 | ||
e7c274f8 | 1888 | static int nilfs_btree_propagate_p(struct nilfs_bmap *btree, |
17c76b01 KS |
1889 | struct nilfs_btree_path *path, |
1890 | int level, | |
1891 | struct buffer_head *bh) | |
1892 | { | |
1893 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1894 | !buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1895 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
1896 | |
1897 | return 0; | |
1898 | } | |
1899 | ||
e7c274f8 | 1900 | static int nilfs_btree_prepare_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1901 | struct nilfs_btree_path *path, |
2e0c2c73 | 1902 | int level, struct inode *dat) |
17c76b01 KS |
1903 | { |
1904 | struct nilfs_btree_node *parent; | |
9b7b265c | 1905 | int ncmax, ret; |
17c76b01 | 1906 | |
9b7b265c | 1907 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 | 1908 | path[level].bp_oldreq.bpr_ptr = |
9b7b265c RK |
1909 | nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, |
1910 | ncmax); | |
17c76b01 | 1911 | path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1; |
2e0c2c73 RK |
1912 | ret = nilfs_dat_prepare_update(dat, &path[level].bp_oldreq.bpr_req, |
1913 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1914 | if (ret < 0) |
1915 | return ret; | |
1916 | ||
1917 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1918 | path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr; | |
1919 | path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr; | |
1920 | path[level].bp_ctxt.bh = path[level].bp_bh; | |
1921 | ret = nilfs_btnode_prepare_change_key( | |
e897be17 | 1922 | NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping, |
17c76b01 KS |
1923 | &path[level].bp_ctxt); |
1924 | if (ret < 0) { | |
2e0c2c73 RK |
1925 | nilfs_dat_abort_update(dat, |
1926 | &path[level].bp_oldreq.bpr_req, | |
1927 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1928 | return ret; |
1929 | } | |
1930 | } | |
1931 | ||
1932 | return 0; | |
1933 | } | |
1934 | ||
e7c274f8 | 1935 | static void nilfs_btree_commit_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1936 | struct nilfs_btree_path *path, |
2e0c2c73 | 1937 | int level, struct inode *dat) |
17c76b01 KS |
1938 | { |
1939 | struct nilfs_btree_node *parent; | |
9b7b265c | 1940 | int ncmax; |
17c76b01 | 1941 | |
2e0c2c73 RK |
1942 | nilfs_dat_commit_update(dat, &path[level].bp_oldreq.bpr_req, |
1943 | &path[level].bp_newreq.bpr_req, | |
e7c274f8 | 1944 | btree->b_ptr_type == NILFS_BMAP_PTR_VS); |
17c76b01 KS |
1945 | |
1946 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1947 | nilfs_btnode_commit_change_key( | |
e897be17 | 1948 | NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping, |
17c76b01 KS |
1949 | &path[level].bp_ctxt); |
1950 | path[level].bp_bh = path[level].bp_ctxt.bh; | |
1951 | } | |
1952 | set_buffer_nilfs_volatile(path[level].bp_bh); | |
1953 | ||
9b7b265c RK |
1954 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
1955 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, | |
1956 | path[level].bp_newreq.bpr_ptr, ncmax); | |
17c76b01 KS |
1957 | } |
1958 | ||
e7c274f8 | 1959 | static void nilfs_btree_abort_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1960 | struct nilfs_btree_path *path, |
2e0c2c73 | 1961 | int level, struct inode *dat) |
17c76b01 | 1962 | { |
2e0c2c73 RK |
1963 | nilfs_dat_abort_update(dat, &path[level].bp_oldreq.bpr_req, |
1964 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1965 | if (buffer_nilfs_node(path[level].bp_bh)) |
1966 | nilfs_btnode_abort_change_key( | |
e897be17 | 1967 | NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping, |
17c76b01 KS |
1968 | &path[level].bp_ctxt); |
1969 | } | |
1970 | ||
e7c274f8 | 1971 | static int nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 1972 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
1973 | int minlevel, int *maxlevelp, |
1974 | struct inode *dat) | |
17c76b01 KS |
1975 | { |
1976 | int level, ret; | |
1977 | ||
1978 | level = minlevel; | |
1979 | if (!buffer_nilfs_volatile(path[level].bp_bh)) { | |
2e0c2c73 | 1980 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1981 | if (ret < 0) |
1982 | return ret; | |
1983 | } | |
1984 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1985 | !buffer_dirty(path[level].bp_bh)) { | |
1986 | ||
1f5abe7e | 1987 | WARN_ON(buffer_nilfs_volatile(path[level].bp_bh)); |
2e0c2c73 | 1988 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1989 | if (ret < 0) |
1990 | goto out; | |
1991 | } | |
1992 | ||
1993 | /* success */ | |
17c76b01 KS |
1994 | *maxlevelp = level - 1; |
1995 | return 0; | |
1996 | ||
1997 | /* error */ | |
1998 | out: | |
1999 | while (--level > minlevel) | |
2e0c2c73 | 2000 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 | 2001 | if (!buffer_nilfs_volatile(path[level].bp_bh)) |
2e0c2c73 | 2002 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 KS |
2003 | return ret; |
2004 | } | |
2005 | ||
e7c274f8 | 2006 | static void nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 2007 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
2008 | int minlevel, int maxlevel, |
2009 | struct buffer_head *bh, | |
2010 | struct inode *dat) | |
17c76b01 KS |
2011 | { |
2012 | int level; | |
2013 | ||
2014 | if (!buffer_nilfs_volatile(path[minlevel].bp_bh)) | |
2e0c2c73 | 2015 | nilfs_btree_commit_update_v(btree, path, minlevel, dat); |
17c76b01 KS |
2016 | |
2017 | for (level = minlevel + 1; level <= maxlevel; level++) | |
2e0c2c73 | 2018 | nilfs_btree_commit_update_v(btree, path, level, dat); |
17c76b01 KS |
2019 | } |
2020 | ||
e7c274f8 | 2021 | static int nilfs_btree_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 2022 | struct nilfs_btree_path *path, |
2e0c2c73 | 2023 | int level, struct buffer_head *bh) |
17c76b01 | 2024 | { |
308f4419 | 2025 | int maxlevel = 0, ret; |
17c76b01 | 2026 | struct nilfs_btree_node *parent; |
e7c274f8 | 2027 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 | 2028 | __u64 ptr; |
9b7b265c | 2029 | int ncmax; |
17c76b01 KS |
2030 | |
2031 | get_bh(bh); | |
2032 | path[level].bp_bh = bh; | |
2e0c2c73 RK |
2033 | ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel, |
2034 | dat); | |
17c76b01 KS |
2035 | if (ret < 0) |
2036 | goto out; | |
2037 | ||
2038 | if (buffer_nilfs_volatile(path[level].bp_bh)) { | |
9b7b265c RK |
2039 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2040 | ptr = nilfs_btree_node_get_ptr(parent, | |
2041 | path[level + 1].bp_index, | |
2042 | ncmax); | |
2e0c2c73 | 2043 | ret = nilfs_dat_mark_dirty(dat, ptr); |
17c76b01 KS |
2044 | if (ret < 0) |
2045 | goto out; | |
2046 | } | |
2047 | ||
2e0c2c73 | 2048 | nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); |
17c76b01 KS |
2049 | |
2050 | out: | |
2051 | brelse(path[level].bp_bh); | |
2052 | path[level].bp_bh = NULL; | |
2053 | return ret; | |
2054 | } | |
2055 | ||
e7c274f8 | 2056 | static int nilfs_btree_propagate(struct nilfs_bmap *btree, |
17c76b01 KS |
2057 | struct buffer_head *bh) |
2058 | { | |
17c76b01 KS |
2059 | struct nilfs_btree_path *path; |
2060 | struct nilfs_btree_node *node; | |
2061 | __u64 key; | |
2062 | int level, ret; | |
2063 | ||
1f5abe7e | 2064 | WARN_ON(!buffer_dirty(bh)); |
17c76b01 | 2065 | |
6d28f7ea | 2066 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2067 | if (path == NULL) |
2068 | return -ENOMEM; | |
17c76b01 KS |
2069 | |
2070 | if (buffer_nilfs_node(bh)) { | |
2071 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
2072 | key = nilfs_btree_node_get_key(node, 0); |
2073 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 2074 | } else { |
e7c274f8 | 2075 | key = nilfs_bmap_data_get_key(btree, bh); |
17c76b01 KS |
2076 | level = NILFS_BTREE_LEVEL_DATA; |
2077 | } | |
2078 | ||
03bdb5ac | 2079 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); |
17c76b01 | 2080 | if (ret < 0) { |
1f5abe7e | 2081 | if (unlikely(ret == -ENOENT)) |
a1d0747a JP |
2082 | nilfs_crit(btree->b_inode->i_sb, |
2083 | "writing node/leaf block does not appear in b-tree (ino=%lu) at key=%llu, level=%d", | |
2084 | btree->b_inode->i_ino, | |
2085 | (unsigned long long)key, level); | |
17c76b01 KS |
2086 | goto out; |
2087 | } | |
2088 | ||
e7c274f8 | 2089 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
2090 | nilfs_btree_propagate_v(btree, path, level, bh) : |
2091 | nilfs_btree_propagate_p(btree, path, level, bh); | |
17c76b01 KS |
2092 | |
2093 | out: | |
6d28f7ea | 2094 | nilfs_btree_free_path(path); |
17c76b01 KS |
2095 | |
2096 | return ret; | |
2097 | } | |
2098 | ||
e7c274f8 | 2099 | static int nilfs_btree_propagate_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
2100 | struct buffer_head *bh) |
2101 | { | |
e7c274f8 | 2102 | return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr); |
17c76b01 KS |
2103 | } |
2104 | ||
e7c274f8 | 2105 | static void nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree, |
17c76b01 KS |
2106 | struct list_head *lists, |
2107 | struct buffer_head *bh) | |
2108 | { | |
2109 | struct list_head *head; | |
2110 | struct buffer_head *cbh; | |
2111 | struct nilfs_btree_node *node, *cnode; | |
2112 | __u64 key, ckey; | |
2113 | int level; | |
2114 | ||
2115 | get_bh(bh); | |
2116 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
2117 | key = nilfs_btree_node_get_key(node, 0); |
2118 | level = nilfs_btree_node_get_level(node); | |
cfa913a5 RK |
2119 | if (level < NILFS_BTREE_LEVEL_NODE_MIN || |
2120 | level >= NILFS_BTREE_LEVEL_MAX) { | |
2121 | dump_stack(); | |
a1d0747a JP |
2122 | nilfs_warn(btree->b_inode->i_sb, |
2123 | "invalid btree level: %d (key=%llu, ino=%lu, blocknr=%llu)", | |
2124 | level, (unsigned long long)key, | |
2125 | btree->b_inode->i_ino, | |
2126 | (unsigned long long)bh->b_blocknr); | |
cfa913a5 RK |
2127 | return; |
2128 | } | |
2129 | ||
17c76b01 KS |
2130 | list_for_each(head, &lists[level]) { |
2131 | cbh = list_entry(head, struct buffer_head, b_assoc_buffers); | |
2132 | cnode = (struct nilfs_btree_node *)cbh->b_data; | |
6d28f7ea | 2133 | ckey = nilfs_btree_node_get_key(cnode, 0); |
17c76b01 KS |
2134 | if (key < ckey) |
2135 | break; | |
2136 | } | |
2137 | list_add_tail(&bh->b_assoc_buffers, head); | |
2138 | } | |
2139 | ||
e7c274f8 | 2140 | static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree, |
17c76b01 KS |
2141 | struct list_head *listp) |
2142 | { | |
e897be17 RK |
2143 | struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; |
2144 | struct address_space *btcache = btnc_inode->i_mapping; | |
17c76b01 KS |
2145 | struct list_head lists[NILFS_BTREE_LEVEL_MAX]; |
2146 | struct pagevec pvec; | |
2147 | struct buffer_head *bh, *head; | |
2148 | pgoff_t index = 0; | |
2149 | int level, i; | |
2150 | ||
2151 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2152 | level < NILFS_BTREE_LEVEL_MAX; | |
2153 | level++) | |
2154 | INIT_LIST_HEAD(&lists[level]); | |
2155 | ||
86679820 | 2156 | pagevec_init(&pvec); |
17c76b01 | 2157 | |
67fd707f JK |
2158 | while (pagevec_lookup_tag(&pvec, btcache, &index, |
2159 | PAGECACHE_TAG_DIRTY)) { | |
17c76b01 KS |
2160 | for (i = 0; i < pagevec_count(&pvec); i++) { |
2161 | bh = head = page_buffers(pvec.pages[i]); | |
2162 | do { | |
2163 | if (buffer_dirty(bh)) | |
2164 | nilfs_btree_add_dirty_buffer(btree, | |
2165 | lists, bh); | |
2166 | } while ((bh = bh->b_this_page) != head); | |
2167 | } | |
2168 | pagevec_release(&pvec); | |
2169 | cond_resched(); | |
2170 | } | |
2171 | ||
2172 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2173 | level < NILFS_BTREE_LEVEL_MAX; | |
2174 | level++) | |
0935db74 | 2175 | list_splice_tail(&lists[level], listp); |
17c76b01 KS |
2176 | } |
2177 | ||
e7c274f8 | 2178 | static int nilfs_btree_assign_p(struct nilfs_bmap *btree, |
17c76b01 KS |
2179 | struct nilfs_btree_path *path, |
2180 | int level, | |
2181 | struct buffer_head **bh, | |
2182 | sector_t blocknr, | |
2183 | union nilfs_binfo *binfo) | |
2184 | { | |
2185 | struct nilfs_btree_node *parent; | |
2186 | __u64 key; | |
2187 | __u64 ptr; | |
9b7b265c | 2188 | int ncmax, ret; |
17c76b01 | 2189 | |
9b7b265c RK |
2190 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2191 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2192 | ncmax); | |
17c76b01 KS |
2193 | if (buffer_nilfs_node(*bh)) { |
2194 | path[level].bp_ctxt.oldkey = ptr; | |
2195 | path[level].bp_ctxt.newkey = blocknr; | |
2196 | path[level].bp_ctxt.bh = *bh; | |
2197 | ret = nilfs_btnode_prepare_change_key( | |
e897be17 | 2198 | NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping, |
17c76b01 KS |
2199 | &path[level].bp_ctxt); |
2200 | if (ret < 0) | |
2201 | return ret; | |
2202 | nilfs_btnode_commit_change_key( | |
e897be17 | 2203 | NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping, |
17c76b01 KS |
2204 | &path[level].bp_ctxt); |
2205 | *bh = path[level].bp_ctxt.bh; | |
2206 | } | |
2207 | ||
9b7b265c RK |
2208 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, |
2209 | ncmax); | |
17c76b01 | 2210 | |
6d28f7ea | 2211 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2212 | /* on-disk format */ |
25b8d7de | 2213 | binfo->bi_dat.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2214 | binfo->bi_dat.bi_level = level; |
2215 | ||
2216 | return 0; | |
2217 | } | |
2218 | ||
e7c274f8 | 2219 | static int nilfs_btree_assign_v(struct nilfs_bmap *btree, |
17c76b01 KS |
2220 | struct nilfs_btree_path *path, |
2221 | int level, | |
2222 | struct buffer_head **bh, | |
2223 | sector_t blocknr, | |
2224 | union nilfs_binfo *binfo) | |
2225 | { | |
2226 | struct nilfs_btree_node *parent; | |
e7c274f8 | 2227 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 KS |
2228 | __u64 key; |
2229 | __u64 ptr; | |
2230 | union nilfs_bmap_ptr_req req; | |
9b7b265c | 2231 | int ncmax, ret; |
17c76b01 | 2232 | |
9b7b265c RK |
2233 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2234 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2235 | ncmax); | |
17c76b01 | 2236 | req.bpr_ptr = ptr; |
2e0c2c73 RK |
2237 | ret = nilfs_dat_prepare_start(dat, &req.bpr_req); |
2238 | if (ret < 0) | |
17c76b01 | 2239 | return ret; |
2e0c2c73 | 2240 | nilfs_dat_commit_start(dat, &req.bpr_req, blocknr); |
17c76b01 | 2241 | |
6d28f7ea | 2242 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2243 | /* on-disk format */ |
25b8d7de RK |
2244 | binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr); |
2245 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); | |
17c76b01 KS |
2246 | |
2247 | return 0; | |
2248 | } | |
2249 | ||
e7c274f8 | 2250 | static int nilfs_btree_assign(struct nilfs_bmap *btree, |
17c76b01 KS |
2251 | struct buffer_head **bh, |
2252 | sector_t blocknr, | |
2253 | union nilfs_binfo *binfo) | |
2254 | { | |
17c76b01 KS |
2255 | struct nilfs_btree_path *path; |
2256 | struct nilfs_btree_node *node; | |
2257 | __u64 key; | |
2258 | int level, ret; | |
2259 | ||
6d28f7ea | 2260 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2261 | if (path == NULL) |
2262 | return -ENOMEM; | |
17c76b01 KS |
2263 | |
2264 | if (buffer_nilfs_node(*bh)) { | |
2265 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea RK |
2266 | key = nilfs_btree_node_get_key(node, 0); |
2267 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 2268 | } else { |
e7c274f8 | 2269 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2270 | level = NILFS_BTREE_LEVEL_DATA; |
2271 | } | |
2272 | ||
03bdb5ac | 2273 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); |
17c76b01 | 2274 | if (ret < 0) { |
1f5abe7e | 2275 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2276 | goto out; |
2277 | } | |
2278 | ||
e7c274f8 | 2279 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
2280 | nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : |
2281 | nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); | |
17c76b01 KS |
2282 | |
2283 | out: | |
6d28f7ea | 2284 | nilfs_btree_free_path(path); |
17c76b01 KS |
2285 | |
2286 | return ret; | |
2287 | } | |
2288 | ||
e7c274f8 | 2289 | static int nilfs_btree_assign_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
2290 | struct buffer_head **bh, |
2291 | sector_t blocknr, | |
2292 | union nilfs_binfo *binfo) | |
2293 | { | |
17c76b01 KS |
2294 | struct nilfs_btree_node *node; |
2295 | __u64 key; | |
2296 | int ret; | |
2297 | ||
e7c274f8 | 2298 | ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr, |
2e0c2c73 | 2299 | blocknr); |
17c76b01 KS |
2300 | if (ret < 0) |
2301 | return ret; | |
2302 | ||
2303 | if (buffer_nilfs_node(*bh)) { | |
2304 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea | 2305 | key = nilfs_btree_node_get_key(node, 0); |
17c76b01 | 2306 | } else |
e7c274f8 | 2307 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2308 | |
2309 | /* on-disk format */ | |
2310 | binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr); | |
25b8d7de | 2311 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2312 | |
2313 | return 0; | |
2314 | } | |
2315 | ||
e7c274f8 | 2316 | static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) |
17c76b01 KS |
2317 | { |
2318 | struct buffer_head *bh; | |
17c76b01 KS |
2319 | struct nilfs_btree_path *path; |
2320 | __u64 ptr; | |
2321 | int ret; | |
2322 | ||
6d28f7ea | 2323 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2324 | if (path == NULL) |
2325 | return -ENOMEM; | |
17c76b01 | 2326 | |
03bdb5ac | 2327 | ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0); |
17c76b01 | 2328 | if (ret < 0) { |
1f5abe7e | 2329 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2330 | goto out; |
2331 | } | |
f198dbb9 | 2332 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 | 2333 | if (ret < 0) { |
1f5abe7e | 2334 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2335 | goto out; |
2336 | } | |
2337 | ||
2338 | if (!buffer_dirty(bh)) | |
5fc7b141 | 2339 | mark_buffer_dirty(bh); |
087d01b4 | 2340 | brelse(bh); |
e7c274f8 RK |
2341 | if (!nilfs_bmap_dirty(btree)) |
2342 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
2343 | |
2344 | out: | |
6d28f7ea | 2345 | nilfs_btree_free_path(path); |
17c76b01 KS |
2346 | return ret; |
2347 | } | |
2348 | ||
2349 | static const struct nilfs_bmap_operations nilfs_btree_ops = { | |
2350 | .bop_lookup = nilfs_btree_lookup, | |
c3a7abf0 | 2351 | .bop_lookup_contig = nilfs_btree_lookup_contig, |
17c76b01 KS |
2352 | .bop_insert = nilfs_btree_insert, |
2353 | .bop_delete = nilfs_btree_delete, | |
2354 | .bop_clear = NULL, | |
2355 | ||
2356 | .bop_propagate = nilfs_btree_propagate, | |
2357 | ||
2358 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2359 | ||
2360 | .bop_assign = nilfs_btree_assign, | |
2361 | .bop_mark = nilfs_btree_mark, | |
2362 | ||
5b20384f | 2363 | .bop_seek_key = nilfs_btree_seek_key, |
17c76b01 | 2364 | .bop_last_key = nilfs_btree_last_key, |
5b20384f | 2365 | |
17c76b01 KS |
2366 | .bop_check_insert = NULL, |
2367 | .bop_check_delete = nilfs_btree_check_delete, | |
2368 | .bop_gather_data = nilfs_btree_gather_data, | |
2369 | }; | |
2370 | ||
2371 | static const struct nilfs_bmap_operations nilfs_btree_ops_gc = { | |
2372 | .bop_lookup = NULL, | |
c3a7abf0 | 2373 | .bop_lookup_contig = NULL, |
17c76b01 KS |
2374 | .bop_insert = NULL, |
2375 | .bop_delete = NULL, | |
2376 | .bop_clear = NULL, | |
2377 | ||
2378 | .bop_propagate = nilfs_btree_propagate_gc, | |
2379 | ||
2380 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2381 | ||
2382 | .bop_assign = nilfs_btree_assign_gc, | |
2383 | .bop_mark = NULL, | |
2384 | ||
5b20384f | 2385 | .bop_seek_key = NULL, |
17c76b01 | 2386 | .bop_last_key = NULL, |
5b20384f | 2387 | |
17c76b01 KS |
2388 | .bop_check_insert = NULL, |
2389 | .bop_check_delete = NULL, | |
2390 | .bop_gather_data = NULL, | |
2391 | }; | |
2392 | ||
957ed60b | 2393 | static void __nilfs_btree_init(struct nilfs_bmap *bmap) |
17c76b01 | 2394 | { |
17c76b01 | 2395 | bmap->b_ops = &nilfs_btree_ops; |
5ad2686e RK |
2396 | bmap->b_nchildren_per_block = |
2397 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
957ed60b RK |
2398 | } |
2399 | ||
2400 | int nilfs_btree_init(struct nilfs_bmap *bmap) | |
2401 | { | |
2402 | int ret = 0; | |
2403 | ||
2404 | __nilfs_btree_init(bmap); | |
2405 | ||
feee880f | 2406 | if (nilfs_btree_root_broken(nilfs_btree_get_root(bmap), bmap->b_inode)) |
957ed60b | 2407 | ret = -EIO; |
e897be17 RK |
2408 | else |
2409 | ret = nilfs_attach_btree_node_cache( | |
2410 | &NILFS_BMAP_I(bmap)->vfs_inode); | |
2411 | ||
957ed60b | 2412 | return ret; |
17c76b01 KS |
2413 | } |
2414 | ||
2415 | void nilfs_btree_init_gc(struct nilfs_bmap *bmap) | |
2416 | { | |
17c76b01 | 2417 | bmap->b_ops = &nilfs_btree_ops_gc; |
5ad2686e RK |
2418 | bmap->b_nchildren_per_block = |
2419 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
17c76b01 | 2420 | } |