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