]>
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; | |
9b7b265c | 922 | int nchildren, n, move, ncblk; |
17c76b01 | 923 | |
6d28f7ea RK |
924 | node = nilfs_btree_get_nonroot_node(path, level); |
925 | right = nilfs_btree_get_sib_node(path, level); | |
926 | nchildren = nilfs_btree_node_get_nchildren(node); | |
9b7b265c | 927 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
928 | move = 0; |
929 | ||
930 | n = (nchildren + 1) / 2; | |
931 | if (n > nchildren - path[level].bp_index) { | |
932 | n--; | |
933 | move = 1; | |
934 | } | |
935 | ||
9b7b265c | 936 | nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); |
17c76b01 KS |
937 | |
938 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 939 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 940 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 941 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 942 | |
17c76b01 | 943 | if (move) { |
6d28f7ea | 944 | path[level].bp_index -= nilfs_btree_node_get_nchildren(node); |
9b7b265c RK |
945 | nilfs_btree_node_insert(right, path[level].bp_index, |
946 | *keyp, *ptrp, ncblk); | |
17c76b01 | 947 | |
6d28f7ea | 948 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
949 | *ptrp = path[level].bp_newreq.bpr_ptr; |
950 | ||
087d01b4 | 951 | brelse(path[level].bp_bh); |
17c76b01 KS |
952 | path[level].bp_bh = path[level].bp_sib_bh; |
953 | path[level].bp_sib_bh = NULL; | |
954 | } else { | |
955 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
956 | ||
6d28f7ea | 957 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
958 | *ptrp = path[level].bp_newreq.bpr_ptr; |
959 | ||
087d01b4 | 960 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
961 | path[level].bp_sib_bh = NULL; |
962 | } | |
963 | ||
964 | path[level + 1].bp_index++; | |
965 | } | |
966 | ||
e7c274f8 | 967 | static void nilfs_btree_grow(struct nilfs_bmap *btree, |
17c76b01 KS |
968 | struct nilfs_btree_path *path, |
969 | int level, __u64 *keyp, __u64 *ptrp) | |
970 | { | |
971 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 972 | int n, ncblk; |
17c76b01 | 973 | |
17c76b01 | 974 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 975 | child = nilfs_btree_get_sib_node(path, level); |
9b7b265c | 976 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 977 | |
6d28f7ea | 978 | n = nilfs_btree_node_get_nchildren(root); |
17c76b01 | 979 | |
9b7b265c RK |
980 | nilfs_btree_node_move_right(root, child, n, |
981 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
6d28f7ea | 982 | nilfs_btree_node_set_level(root, level + 1); |
17c76b01 KS |
983 | |
984 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
5fc7b141 | 985 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 986 | |
17c76b01 KS |
987 | path[level].bp_bh = path[level].bp_sib_bh; |
988 | path[level].bp_sib_bh = NULL; | |
989 | ||
990 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
991 | ||
6d28f7ea | 992 | *keyp = nilfs_btree_node_get_key(child, 0); |
17c76b01 KS |
993 | *ptrp = path[level].bp_newreq.bpr_ptr; |
994 | } | |
995 | ||
e7c274f8 | 996 | static __u64 nilfs_btree_find_near(const struct nilfs_bmap *btree, |
17c76b01 KS |
997 | const struct nilfs_btree_path *path) |
998 | { | |
999 | struct nilfs_btree_node *node; | |
9b7b265c | 1000 | int level, ncmax; |
17c76b01 KS |
1001 | |
1002 | if (path == NULL) | |
1003 | return NILFS_BMAP_INVALID_PTR; | |
1004 | ||
1005 | /* left sibling */ | |
1006 | level = NILFS_BTREE_LEVEL_NODE_MIN; | |
1007 | if (path[level].bp_index > 0) { | |
9b7b265c RK |
1008 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
1009 | return nilfs_btree_node_get_ptr(node, | |
1010 | path[level].bp_index - 1, | |
1011 | ncmax); | |
17c76b01 KS |
1012 | } |
1013 | ||
1014 | /* parent */ | |
1015 | level = NILFS_BTREE_LEVEL_NODE_MIN + 1; | |
1016 | if (level <= nilfs_btree_height(btree) - 1) { | |
9b7b265c RK |
1017 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
1018 | return nilfs_btree_node_get_ptr(node, path[level].bp_index, | |
1019 | ncmax); | |
17c76b01 KS |
1020 | } |
1021 | ||
1022 | return NILFS_BMAP_INVALID_PTR; | |
1023 | } | |
1024 | ||
e7c274f8 | 1025 | static __u64 nilfs_btree_find_target_v(const struct nilfs_bmap *btree, |
17c76b01 KS |
1026 | const struct nilfs_btree_path *path, |
1027 | __u64 key) | |
1028 | { | |
1029 | __u64 ptr; | |
1030 | ||
e7c274f8 | 1031 | ptr = nilfs_bmap_find_target_seq(btree, key); |
17c76b01 KS |
1032 | if (ptr != NILFS_BMAP_INVALID_PTR) |
1033 | /* sequential access */ | |
1034 | return ptr; | |
1035 | else { | |
1036 | ptr = nilfs_btree_find_near(btree, path); | |
1037 | if (ptr != NILFS_BMAP_INVALID_PTR) | |
1038 | /* near */ | |
1039 | return ptr; | |
1040 | } | |
1041 | /* block group */ | |
e7c274f8 | 1042 | return nilfs_bmap_find_target_in_group(btree); |
17c76b01 KS |
1043 | } |
1044 | ||
e7c274f8 | 1045 | static int nilfs_btree_prepare_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1046 | struct nilfs_btree_path *path, |
1047 | int *levelp, __u64 key, __u64 ptr, | |
1048 | struct nilfs_bmap_stats *stats) | |
1049 | { | |
1050 | struct buffer_head *bh; | |
1051 | struct nilfs_btree_node *node, *parent, *sib; | |
1052 | __u64 sibptr; | |
9b7b265c | 1053 | int pindex, level, ncmax, ncblk, ret; |
2e0c2c73 | 1054 | struct inode *dat = NULL; |
17c76b01 KS |
1055 | |
1056 | stats->bs_nblocks = 0; | |
1057 | level = NILFS_BTREE_LEVEL_DATA; | |
1058 | ||
1059 | /* allocate a new ptr for data block */ | |
e7c274f8 | 1060 | if (NILFS_BMAP_USE_VBN(btree)) { |
17c76b01 | 1061 | path[level].bp_newreq.bpr_ptr = |
7cde31d7 | 1062 | nilfs_btree_find_target_v(btree, path, key); |
e7c274f8 | 1063 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1064 | } |
17c76b01 | 1065 | |
e7c274f8 | 1066 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1067 | if (ret < 0) |
1068 | goto err_out_data; | |
1069 | ||
9b7b265c | 1070 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 1071 | |
17c76b01 KS |
1072 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; |
1073 | level < nilfs_btree_height(btree) - 1; | |
1074 | level++) { | |
6d28f7ea | 1075 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 1076 | if (nilfs_btree_node_get_nchildren(node) < ncblk) { |
17c76b01 KS |
1077 | path[level].bp_op = nilfs_btree_do_insert; |
1078 | stats->bs_nblocks++; | |
1079 | goto out; | |
1080 | } | |
1081 | ||
9b7b265c | 1082 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 KS |
1083 | pindex = path[level + 1].bp_index; |
1084 | ||
1085 | /* left sibling */ | |
1086 | if (pindex > 0) { | |
9b7b265c RK |
1087 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1088 | ncmax); | |
f198dbb9 | 1089 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1090 | if (ret < 0) |
1091 | goto err_out_child_node; | |
1092 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1093 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1094 | path[level].bp_sib_bh = bh; |
1095 | path[level].bp_op = nilfs_btree_carry_left; | |
1096 | stats->bs_nblocks++; | |
1097 | goto out; | |
9b7b265c | 1098 | } else { |
087d01b4 | 1099 | brelse(bh); |
9b7b265c | 1100 | } |
17c76b01 KS |
1101 | } |
1102 | ||
1103 | /* right sibling */ | |
9b7b265c RK |
1104 | if (pindex < nilfs_btree_node_get_nchildren(parent) - 1) { |
1105 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, | |
1106 | ncmax); | |
f198dbb9 | 1107 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1108 | if (ret < 0) |
1109 | goto err_out_child_node; | |
1110 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1111 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1112 | path[level].bp_sib_bh = bh; |
1113 | path[level].bp_op = nilfs_btree_carry_right; | |
1114 | stats->bs_nblocks++; | |
1115 | goto out; | |
9b7b265c | 1116 | } else { |
087d01b4 | 1117 | brelse(bh); |
9b7b265c | 1118 | } |
17c76b01 KS |
1119 | } |
1120 | ||
1121 | /* split */ | |
1122 | path[level].bp_newreq.bpr_ptr = | |
1123 | path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1124 | ret = nilfs_bmap_prepare_alloc_ptr(btree, |
2e0c2c73 | 1125 | &path[level].bp_newreq, dat); |
17c76b01 KS |
1126 | if (ret < 0) |
1127 | goto err_out_child_node; | |
f198dbb9 RK |
1128 | ret = nilfs_btree_get_new_block(btree, |
1129 | path[level].bp_newreq.bpr_ptr, | |
1130 | &bh); | |
17c76b01 KS |
1131 | if (ret < 0) |
1132 | goto err_out_curr_node; | |
1133 | ||
1134 | stats->bs_nblocks++; | |
1135 | ||
9b7b265c RK |
1136 | sib = (struct nilfs_btree_node *)bh->b_data; |
1137 | nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1138 | path[level].bp_sib_bh = bh; |
1139 | path[level].bp_op = nilfs_btree_split; | |
1140 | } | |
1141 | ||
1142 | /* root */ | |
1143 | node = nilfs_btree_get_root(btree); | |
6d28f7ea | 1144 | if (nilfs_btree_node_get_nchildren(node) < |
ea64ab87 | 1145 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
17c76b01 KS |
1146 | path[level].bp_op = nilfs_btree_do_insert; |
1147 | stats->bs_nblocks++; | |
1148 | goto out; | |
1149 | } | |
1150 | ||
1151 | /* grow */ | |
1152 | path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1153 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1154 | if (ret < 0) |
1155 | goto err_out_child_node; | |
f198dbb9 RK |
1156 | ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr, |
1157 | &bh); | |
17c76b01 KS |
1158 | if (ret < 0) |
1159 | goto err_out_curr_node; | |
1160 | ||
9b7b265c RK |
1161 | nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data, |
1162 | 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1163 | path[level].bp_sib_bh = bh; |
1164 | path[level].bp_op = nilfs_btree_grow; | |
1165 | ||
1166 | level++; | |
1167 | path[level].bp_op = nilfs_btree_do_insert; | |
1168 | ||
1169 | /* a newly-created node block and a data block are added */ | |
1170 | stats->bs_nblocks += 2; | |
1171 | ||
1172 | /* success */ | |
1173 | out: | |
1174 | *levelp = level; | |
1175 | return ret; | |
1176 | ||
1177 | /* error */ | |
1178 | err_out_curr_node: | |
e7c274f8 | 1179 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1180 | err_out_child_node: |
1181 | for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) { | |
9f098900 | 1182 | nilfs_btnode_delete(path[level].bp_sib_bh); |
e7c274f8 | 1183 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1184 | |
1185 | } | |
1186 | ||
e7c274f8 | 1187 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1188 | err_out_data: |
1189 | *levelp = level; | |
1190 | stats->bs_nblocks = 0; | |
1191 | return ret; | |
1192 | } | |
1193 | ||
e7c274f8 | 1194 | static void nilfs_btree_commit_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1195 | struct nilfs_btree_path *path, |
1196 | int maxlevel, __u64 key, __u64 ptr) | |
1197 | { | |
2e0c2c73 | 1198 | struct inode *dat = NULL; |
17c76b01 KS |
1199 | int level; |
1200 | ||
1201 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1202 | ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr; | |
e7c274f8 | 1203 | if (NILFS_BMAP_USE_VBN(btree)) { |
dc935be2 | 1204 | nilfs_bmap_set_target_v(btree, key, ptr); |
e7c274f8 | 1205 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1206 | } |
17c76b01 KS |
1207 | |
1208 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1209 | nilfs_bmap_commit_alloc_ptr(btree, |
2e0c2c73 | 1210 | &path[level - 1].bp_newreq, dat); |
8acfbf09 | 1211 | path[level].bp_op(btree, path, level, &key, &ptr); |
17c76b01 KS |
1212 | } |
1213 | ||
e7c274f8 RK |
1214 | if (!nilfs_bmap_dirty(btree)) |
1215 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1216 | } |
1217 | ||
e7c274f8 | 1218 | static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr) |
17c76b01 | 1219 | { |
17c76b01 KS |
1220 | struct nilfs_btree_path *path; |
1221 | struct nilfs_bmap_stats stats; | |
1222 | int level, ret; | |
1223 | ||
6d28f7ea | 1224 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1225 | if (path == NULL) |
1226 | return -ENOMEM; | |
17c76b01 KS |
1227 | |
1228 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, | |
03bdb5ac | 1229 | NILFS_BTREE_LEVEL_NODE_MIN, 0); |
17c76b01 KS |
1230 | if (ret != -ENOENT) { |
1231 | if (ret == 0) | |
1232 | ret = -EEXIST; | |
1233 | goto out; | |
1234 | } | |
1235 | ||
1236 | ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats); | |
1237 | if (ret < 0) | |
1238 | goto out; | |
1239 | nilfs_btree_commit_insert(btree, path, level, key, ptr); | |
be667377 | 1240 | nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1241 | |
1242 | out: | |
6d28f7ea | 1243 | nilfs_btree_free_path(path); |
17c76b01 KS |
1244 | return ret; |
1245 | } | |
1246 | ||
e7c274f8 | 1247 | static void nilfs_btree_do_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1248 | struct nilfs_btree_path *path, |
1249 | int level, __u64 *keyp, __u64 *ptrp) | |
1250 | { | |
1251 | struct nilfs_btree_node *node; | |
9b7b265c | 1252 | int ncblk; |
17c76b01 KS |
1253 | |
1254 | if (level < nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 1255 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c RK |
1256 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1257 | nilfs_btree_node_delete(node, path[level].bp_index, | |
1258 | keyp, ptrp, ncblk); | |
17c76b01 | 1259 | if (!buffer_dirty(path[level].bp_bh)) |
5fc7b141 | 1260 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
1261 | if (path[level].bp_index == 0) |
1262 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1263 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 KS |
1264 | } else { |
1265 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1266 | nilfs_btree_node_delete(node, path[level].bp_index, |
1267 | keyp, ptrp, | |
1268 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
1269 | } |
1270 | } | |
1271 | ||
e7c274f8 | 1272 | static void nilfs_btree_borrow_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1273 | struct nilfs_btree_path *path, |
1274 | int level, __u64 *keyp, __u64 *ptrp) | |
1275 | { | |
1276 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1277 | int nchildren, lnchildren, n, ncblk; |
17c76b01 KS |
1278 | |
1279 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1280 | ||
6d28f7ea RK |
1281 | node = nilfs_btree_get_nonroot_node(path, level); |
1282 | left = nilfs_btree_get_sib_node(path, level); | |
1283 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1284 | lnchildren = nilfs_btree_node_get_nchildren(left); | |
9b7b265c | 1285 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1286 | |
1287 | n = (nchildren + lnchildren) / 2 - nchildren; | |
1288 | ||
9b7b265c | 1289 | nilfs_btree_node_move_right(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1290 | |
1291 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1292 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1293 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 1294 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1295 | |
17c76b01 | 1296 | nilfs_btree_promote_key(btree, path, level + 1, |
6d28f7ea | 1297 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 | 1298 | |
087d01b4 | 1299 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1300 | path[level].bp_sib_bh = NULL; |
1301 | path[level].bp_index += n; | |
1302 | } | |
1303 | ||
e7c274f8 | 1304 | static void nilfs_btree_borrow_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1305 | struct nilfs_btree_path *path, |
1306 | int level, __u64 *keyp, __u64 *ptrp) | |
1307 | { | |
1308 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1309 | int nchildren, rnchildren, n, ncblk; |
17c76b01 KS |
1310 | |
1311 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1312 | ||
6d28f7ea RK |
1313 | node = nilfs_btree_get_nonroot_node(path, level); |
1314 | right = nilfs_btree_get_sib_node(path, level); | |
1315 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1316 | rnchildren = nilfs_btree_node_get_nchildren(right); | |
9b7b265c | 1317 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1318 | |
1319 | n = (nchildren + rnchildren) / 2 - nchildren; | |
1320 | ||
9b7b265c | 1321 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1322 | |
1323 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1324 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1325 | if (!buffer_dirty(path[level].bp_sib_bh)) |
5fc7b141 | 1326 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1327 | |
17c76b01 KS |
1328 | path[level + 1].bp_index++; |
1329 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1330 | nilfs_btree_node_get_key(right, 0)); |
17c76b01 KS |
1331 | path[level + 1].bp_index--; |
1332 | ||
087d01b4 | 1333 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1334 | path[level].bp_sib_bh = NULL; |
1335 | } | |
1336 | ||
e7c274f8 | 1337 | static void nilfs_btree_concat_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1338 | struct nilfs_btree_path *path, |
1339 | int level, __u64 *keyp, __u64 *ptrp) | |
1340 | { | |
1341 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1342 | int n, ncblk; |
17c76b01 KS |
1343 | |
1344 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1345 | ||
6d28f7ea RK |
1346 | node = nilfs_btree_get_nonroot_node(path, level); |
1347 | left = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1348 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1349 | |
6d28f7ea | 1350 | n = nilfs_btree_node_get_nchildren(node); |
17c76b01 | 1351 | |
9b7b265c | 1352 | nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1353 | |
1354 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
5fc7b141 | 1355 | mark_buffer_dirty(path[level].bp_sib_bh); |
17c76b01 | 1356 | |
9f098900 | 1357 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1358 | path[level].bp_bh = path[level].bp_sib_bh; |
1359 | path[level].bp_sib_bh = NULL; | |
6d28f7ea | 1360 | path[level].bp_index += nilfs_btree_node_get_nchildren(left); |
17c76b01 KS |
1361 | } |
1362 | ||
e7c274f8 | 1363 | static void nilfs_btree_concat_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1364 | struct nilfs_btree_path *path, |
1365 | int level, __u64 *keyp, __u64 *ptrp) | |
1366 | { | |
1367 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1368 | int n, ncblk; |
17c76b01 KS |
1369 | |
1370 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1371 | ||
6d28f7ea RK |
1372 | node = nilfs_btree_get_nonroot_node(path, level); |
1373 | right = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1374 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1375 | |
6d28f7ea | 1376 | n = nilfs_btree_node_get_nchildren(right); |
17c76b01 | 1377 | |
9b7b265c | 1378 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1379 | |
1380 | if (!buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1381 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 | 1382 | |
9f098900 | 1383 | nilfs_btnode_delete(path[level].bp_sib_bh); |
17c76b01 KS |
1384 | path[level].bp_sib_bh = NULL; |
1385 | path[level + 1].bp_index++; | |
1386 | } | |
1387 | ||
e7c274f8 | 1388 | static void nilfs_btree_shrink(struct nilfs_bmap *btree, |
17c76b01 KS |
1389 | struct nilfs_btree_path *path, |
1390 | int level, __u64 *keyp, __u64 *ptrp) | |
1391 | { | |
1392 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 1393 | int n, ncblk; |
17c76b01 KS |
1394 | |
1395 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1396 | ||
17c76b01 | 1397 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 1398 | child = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 1399 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1400 | |
9b7b265c RK |
1401 | nilfs_btree_node_delete(root, 0, NULL, NULL, |
1402 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
6d28f7ea RK |
1403 | nilfs_btree_node_set_level(root, level); |
1404 | n = nilfs_btree_node_get_nchildren(child); | |
9b7b265c RK |
1405 | nilfs_btree_node_move_left(root, child, n, |
1406 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
17c76b01 | 1407 | |
9f098900 | 1408 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1409 | path[level].bp_bh = NULL; |
1410 | } | |
1411 | ||
d4099053 RK |
1412 | static void nilfs_btree_nop(struct nilfs_bmap *btree, |
1413 | struct nilfs_btree_path *path, | |
1414 | int level, __u64 *keyp, __u64 *ptrp) | |
1415 | { | |
1416 | } | |
17c76b01 | 1417 | |
e7c274f8 | 1418 | static int nilfs_btree_prepare_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1419 | struct nilfs_btree_path *path, |
1420 | int *levelp, | |
2e0c2c73 RK |
1421 | struct nilfs_bmap_stats *stats, |
1422 | struct inode *dat) | |
17c76b01 KS |
1423 | { |
1424 | struct buffer_head *bh; | |
1425 | struct nilfs_btree_node *node, *parent, *sib; | |
1426 | __u64 sibptr; | |
fe744fdb | 1427 | int pindex, dindex, level, ncmin, ncmax, ncblk, ret; |
17c76b01 KS |
1428 | |
1429 | ret = 0; | |
1430 | stats->bs_nblocks = 0; | |
ea64ab87 | 1431 | ncmin = NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree)); |
9b7b265c | 1432 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 1433 | |
fe744fdb | 1434 | for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index; |
17c76b01 KS |
1435 | level < nilfs_btree_height(btree) - 1; |
1436 | level++) { | |
6d28f7ea | 1437 | node = nilfs_btree_get_nonroot_node(path, level); |
17c76b01 | 1438 | path[level].bp_oldreq.bpr_ptr = |
fe744fdb | 1439 | nilfs_btree_node_get_ptr(node, dindex, ncblk); |
e7c274f8 | 1440 | ret = nilfs_bmap_prepare_end_ptr(btree, |
2e0c2c73 | 1441 | &path[level].bp_oldreq, dat); |
d4b96157 RK |
1442 | if (ret < 0) |
1443 | goto err_out_child_node; | |
17c76b01 | 1444 | |
ea64ab87 | 1445 | if (nilfs_btree_node_get_nchildren(node) > ncmin) { |
17c76b01 KS |
1446 | path[level].bp_op = nilfs_btree_do_delete; |
1447 | stats->bs_nblocks++; | |
1448 | goto out; | |
1449 | } | |
1450 | ||
9b7b265c | 1451 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 | 1452 | pindex = path[level + 1].bp_index; |
fe744fdb | 1453 | dindex = pindex; |
17c76b01 KS |
1454 | |
1455 | if (pindex > 0) { | |
1456 | /* left sibling */ | |
9b7b265c RK |
1457 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1458 | ncmax); | |
f198dbb9 | 1459 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1460 | if (ret < 0) |
1461 | goto err_out_curr_node; | |
1462 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1463 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1464 | path[level].bp_sib_bh = bh; |
1465 | path[level].bp_op = nilfs_btree_borrow_left; | |
1466 | stats->bs_nblocks++; | |
1467 | goto out; | |
1468 | } else { | |
1469 | path[level].bp_sib_bh = bh; | |
1470 | path[level].bp_op = nilfs_btree_concat_left; | |
1471 | stats->bs_nblocks++; | |
1472 | /* continue; */ | |
1473 | } | |
1474 | } else if (pindex < | |
6d28f7ea | 1475 | nilfs_btree_node_get_nchildren(parent) - 1) { |
17c76b01 | 1476 | /* right sibling */ |
9b7b265c RK |
1477 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, |
1478 | ncmax); | |
f198dbb9 | 1479 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1480 | if (ret < 0) |
1481 | goto err_out_curr_node; | |
1482 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1483 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1484 | path[level].bp_sib_bh = bh; |
1485 | path[level].bp_op = nilfs_btree_borrow_right; | |
1486 | stats->bs_nblocks++; | |
1487 | goto out; | |
1488 | } else { | |
1489 | path[level].bp_sib_bh = bh; | |
1490 | path[level].bp_op = nilfs_btree_concat_right; | |
1491 | stats->bs_nblocks++; | |
fe744fdb RK |
1492 | /* |
1493 | * When merging right sibling node | |
1494 | * into the current node, pointer to | |
1495 | * the right sibling node must be | |
1496 | * terminated instead. The adjustment | |
1497 | * below is required for that. | |
1498 | */ | |
1499 | dindex = pindex + 1; | |
17c76b01 KS |
1500 | /* continue; */ |
1501 | } | |
1502 | } else { | |
1503 | /* no siblings */ | |
1504 | /* the only child of the root node */ | |
1f5abe7e | 1505 | WARN_ON(level != nilfs_btree_height(btree) - 2); |
6d28f7ea | 1506 | if (nilfs_btree_node_get_nchildren(node) - 1 <= |
17c76b01 KS |
1507 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
1508 | path[level].bp_op = nilfs_btree_shrink; | |
1509 | stats->bs_nblocks += 2; | |
d4099053 RK |
1510 | level++; |
1511 | path[level].bp_op = nilfs_btree_nop; | |
1512 | goto shrink_root_child; | |
17c76b01 KS |
1513 | } else { |
1514 | path[level].bp_op = nilfs_btree_do_delete; | |
1515 | stats->bs_nblocks++; | |
d4099053 | 1516 | goto out; |
17c76b01 | 1517 | } |
17c76b01 KS |
1518 | } |
1519 | } | |
1520 | ||
d4099053 RK |
1521 | /* child of the root node is deleted */ |
1522 | path[level].bp_op = nilfs_btree_do_delete; | |
1523 | stats->bs_nblocks++; | |
1524 | ||
1525 | shrink_root_child: | |
17c76b01 KS |
1526 | node = nilfs_btree_get_root(btree); |
1527 | path[level].bp_oldreq.bpr_ptr = | |
fe744fdb | 1528 | nilfs_btree_node_get_ptr(node, dindex, |
9b7b265c | 1529 | NILFS_BTREE_ROOT_NCHILDREN_MAX); |
d4b96157 | 1530 | |
e7c274f8 | 1531 | ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat); |
d4b96157 RK |
1532 | if (ret < 0) |
1533 | goto err_out_child_node; | |
1534 | ||
17c76b01 KS |
1535 | /* success */ |
1536 | out: | |
1537 | *levelp = level; | |
1538 | return ret; | |
1539 | ||
1540 | /* error */ | |
1541 | err_out_curr_node: | |
e7c274f8 | 1542 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1543 | err_out_child_node: |
1544 | for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) { | |
087d01b4 | 1545 | brelse(path[level].bp_sib_bh); |
e7c274f8 | 1546 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1547 | } |
1548 | *levelp = level; | |
1549 | stats->bs_nblocks = 0; | |
1550 | return ret; | |
1551 | } | |
1552 | ||
e7c274f8 | 1553 | static void nilfs_btree_commit_delete(struct nilfs_bmap *btree, |
17c76b01 | 1554 | struct nilfs_btree_path *path, |
2e0c2c73 | 1555 | int maxlevel, struct inode *dat) |
17c76b01 KS |
1556 | { |
1557 | int level; | |
1558 | ||
1559 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1560 | nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat); |
8acfbf09 | 1561 | path[level].bp_op(btree, path, level, NULL, NULL); |
17c76b01 KS |
1562 | } |
1563 | ||
e7c274f8 RK |
1564 | if (!nilfs_bmap_dirty(btree)) |
1565 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1566 | } |
1567 | ||
e7c274f8 | 1568 | static int nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1569 | |
1570 | { | |
17c76b01 KS |
1571 | struct nilfs_btree_path *path; |
1572 | struct nilfs_bmap_stats stats; | |
2e0c2c73 | 1573 | struct inode *dat; |
17c76b01 KS |
1574 | int level, ret; |
1575 | ||
6d28f7ea | 1576 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1577 | if (path == NULL) |
1578 | return -ENOMEM; | |
f905440f | 1579 | |
17c76b01 | 1580 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, |
03bdb5ac | 1581 | NILFS_BTREE_LEVEL_NODE_MIN, 0); |
17c76b01 KS |
1582 | if (ret < 0) |
1583 | goto out; | |
1584 | ||
2e0c2c73 | 1585 | |
e7c274f8 | 1586 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
2e0c2c73 RK |
1587 | |
1588 | ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat); | |
17c76b01 KS |
1589 | if (ret < 0) |
1590 | goto out; | |
2e0c2c73 | 1591 | nilfs_btree_commit_delete(btree, path, level, dat); |
be667377 | 1592 | nilfs_inode_sub_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1593 | |
1594 | out: | |
6d28f7ea | 1595 | nilfs_btree_free_path(path); |
17c76b01 KS |
1596 | return ret; |
1597 | } | |
1598 | ||
5b20384f RK |
1599 | static int nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, |
1600 | __u64 *keyp) | |
1601 | { | |
1602 | struct nilfs_btree_path *path; | |
1603 | const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN; | |
1604 | int ret; | |
1605 | ||
1606 | path = nilfs_btree_alloc_path(); | |
1607 | if (!path) | |
1608 | return -ENOMEM; | |
1609 | ||
1610 | ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0); | |
1611 | if (!ret) | |
1612 | *keyp = start; | |
1613 | else if (ret == -ENOENT) | |
1614 | ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); | |
1615 | ||
1616 | nilfs_btree_free_path(path); | |
1617 | return ret; | |
1618 | } | |
1619 | ||
e7c274f8 | 1620 | static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) |
17c76b01 | 1621 | { |
17c76b01 KS |
1622 | struct nilfs_btree_path *path; |
1623 | int ret; | |
1624 | ||
6d28f7ea | 1625 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1626 | if (path == NULL) |
1627 | return -ENOMEM; | |
17c76b01 KS |
1628 | |
1629 | ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); | |
1630 | ||
6d28f7ea | 1631 | nilfs_btree_free_path(path); |
17c76b01 KS |
1632 | |
1633 | return ret; | |
1634 | } | |
1635 | ||
e7c274f8 | 1636 | static int nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1637 | { |
1638 | struct buffer_head *bh; | |
17c76b01 KS |
1639 | struct nilfs_btree_node *root, *node; |
1640 | __u64 maxkey, nextmaxkey; | |
1641 | __u64 ptr; | |
1642 | int nchildren, ret; | |
1643 | ||
17c76b01 KS |
1644 | root = nilfs_btree_get_root(btree); |
1645 | switch (nilfs_btree_height(btree)) { | |
1646 | case 2: | |
1647 | bh = NULL; | |
1648 | node = root; | |
1649 | break; | |
1650 | case 3: | |
6d28f7ea | 1651 | nchildren = nilfs_btree_node_get_nchildren(root); |
17c76b01 KS |
1652 | if (nchildren > 1) |
1653 | return 0; | |
9b7b265c RK |
1654 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1655 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1656 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1657 | if (ret < 0) |
1658 | return ret; | |
1659 | node = (struct nilfs_btree_node *)bh->b_data; | |
1660 | break; | |
1661 | default: | |
1662 | return 0; | |
1663 | } | |
1664 | ||
6d28f7ea RK |
1665 | nchildren = nilfs_btree_node_get_nchildren(node); |
1666 | maxkey = nilfs_btree_node_get_key(node, nchildren - 1); | |
17c76b01 | 1667 | nextmaxkey = (nchildren > 1) ? |
6d28f7ea | 1668 | nilfs_btree_node_get_key(node, nchildren - 2) : 0; |
17c76b01 | 1669 | if (bh != NULL) |
087d01b4 | 1670 | brelse(bh); |
17c76b01 | 1671 | |
3033342a | 1672 | return (maxkey == key) && (nextmaxkey < NILFS_BMAP_LARGE_LOW); |
17c76b01 KS |
1673 | } |
1674 | ||
e7c274f8 | 1675 | static int nilfs_btree_gather_data(struct nilfs_bmap *btree, |
17c76b01 KS |
1676 | __u64 *keys, __u64 *ptrs, int nitems) |
1677 | { | |
1678 | struct buffer_head *bh; | |
17c76b01 KS |
1679 | struct nilfs_btree_node *node, *root; |
1680 | __le64 *dkeys; | |
1681 | __le64 *dptrs; | |
1682 | __u64 ptr; | |
9b7b265c | 1683 | int nchildren, ncmax, i, ret; |
17c76b01 | 1684 | |
17c76b01 KS |
1685 | root = nilfs_btree_get_root(btree); |
1686 | switch (nilfs_btree_height(btree)) { | |
1687 | case 2: | |
1688 | bh = NULL; | |
1689 | node = root; | |
9b7b265c | 1690 | ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX; |
17c76b01 KS |
1691 | break; |
1692 | case 3: | |
6d28f7ea | 1693 | nchildren = nilfs_btree_node_get_nchildren(root); |
1f5abe7e | 1694 | WARN_ON(nchildren > 1); |
9b7b265c RK |
1695 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1696 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1697 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1698 | if (ret < 0) |
1699 | return ret; | |
1700 | node = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1701 | ncmax = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1702 | break; |
1703 | default: | |
1704 | node = NULL; | |
1f5abe7e | 1705 | return -EINVAL; |
17c76b01 KS |
1706 | } |
1707 | ||
6d28f7ea | 1708 | nchildren = nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
1709 | if (nchildren < nitems) |
1710 | nitems = nchildren; | |
6d28f7ea | 1711 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 1712 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
17c76b01 | 1713 | for (i = 0; i < nitems; i++) { |
25b8d7de RK |
1714 | keys[i] = le64_to_cpu(dkeys[i]); |
1715 | ptrs[i] = le64_to_cpu(dptrs[i]); | |
17c76b01 KS |
1716 | } |
1717 | ||
1718 | if (bh != NULL) | |
087d01b4 | 1719 | brelse(bh); |
17c76b01 KS |
1720 | |
1721 | return nitems; | |
1722 | } | |
1723 | ||
1724 | static int | |
e7c274f8 | 1725 | nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key, |
17c76b01 KS |
1726 | union nilfs_bmap_ptr_req *dreq, |
1727 | union nilfs_bmap_ptr_req *nreq, | |
1728 | struct buffer_head **bhp, | |
1729 | struct nilfs_bmap_stats *stats) | |
1730 | { | |
1731 | struct buffer_head *bh; | |
2e0c2c73 | 1732 | struct inode *dat = NULL; |
17c76b01 KS |
1733 | int ret; |
1734 | ||
17c76b01 KS |
1735 | stats->bs_nblocks = 0; |
1736 | ||
1737 | /* for data */ | |
1738 | /* cannot find near ptr */ | |
e7c274f8 | 1739 | if (NILFS_BMAP_USE_VBN(btree)) { |
7cde31d7 | 1740 | dreq->bpr_ptr = nilfs_btree_find_target_v(btree, NULL, key); |
e7c274f8 | 1741 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1742 | } |
7cde31d7 | 1743 | |
e7c274f8 | 1744 | ret = nilfs_bmap_prepare_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1745 | if (ret < 0) |
1746 | return ret; | |
1747 | ||
1748 | *bhp = NULL; | |
1749 | stats->bs_nblocks++; | |
1750 | if (nreq != NULL) { | |
1751 | nreq->bpr_ptr = dreq->bpr_ptr + 1; | |
e7c274f8 | 1752 | ret = nilfs_bmap_prepare_alloc_ptr(btree, nreq, dat); |
17c76b01 KS |
1753 | if (ret < 0) |
1754 | goto err_out_dreq; | |
1755 | ||
f198dbb9 | 1756 | ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh); |
17c76b01 KS |
1757 | if (ret < 0) |
1758 | goto err_out_nreq; | |
1759 | ||
1760 | *bhp = bh; | |
1761 | stats->bs_nblocks++; | |
1762 | } | |
1763 | ||
1764 | /* success */ | |
1765 | return 0; | |
1766 | ||
1767 | /* error */ | |
1768 | err_out_nreq: | |
e7c274f8 | 1769 | nilfs_bmap_abort_alloc_ptr(btree, nreq, dat); |
17c76b01 | 1770 | err_out_dreq: |
e7c274f8 | 1771 | nilfs_bmap_abort_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1772 | stats->bs_nblocks = 0; |
1773 | return ret; | |
1774 | ||
1775 | } | |
1776 | ||
1777 | static void | |
e7c274f8 | 1778 | nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1779 | __u64 key, __u64 ptr, |
1780 | const __u64 *keys, const __u64 *ptrs, | |
3033342a | 1781 | int n, |
17c76b01 KS |
1782 | union nilfs_bmap_ptr_req *dreq, |
1783 | union nilfs_bmap_ptr_req *nreq, | |
1784 | struct buffer_head *bh) | |
1785 | { | |
17c76b01 | 1786 | struct nilfs_btree_node *node; |
2e0c2c73 | 1787 | struct inode *dat; |
17c76b01 | 1788 | __u64 tmpptr; |
9b7b265c | 1789 | int ncblk; |
17c76b01 KS |
1790 | |
1791 | /* free resources */ | |
e7c274f8 RK |
1792 | if (btree->b_ops->bop_clear != NULL) |
1793 | btree->b_ops->bop_clear(btree); | |
17c76b01 KS |
1794 | |
1795 | /* ptr must be a pointer to a buffer head. */ | |
1796 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1797 | ||
1798 | /* convert and insert */ | |
e7c274f8 | 1799 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
957ed60b | 1800 | __nilfs_btree_init(btree); |
17c76b01 | 1801 | if (nreq != NULL) { |
e7c274f8 RK |
1802 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
1803 | nilfs_bmap_commit_alloc_ptr(btree, nreq, dat); | |
17c76b01 KS |
1804 | |
1805 | /* create child node at level 1 */ | |
17c76b01 | 1806 | node = (struct nilfs_btree_node *)bh->b_data; |
9b7b265c RK |
1807 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1808 | nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs); | |
1809 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk); | |
17c76b01 | 1810 | if (!buffer_dirty(bh)) |
5fc7b141 | 1811 | mark_buffer_dirty(bh); |
e7c274f8 RK |
1812 | if (!nilfs_bmap_dirty(btree)) |
1813 | nilfs_bmap_set_dirty(btree); | |
17c76b01 | 1814 | |
087d01b4 | 1815 | brelse(bh); |
17c76b01 KS |
1816 | |
1817 | /* create root node at level 2 */ | |
1818 | node = nilfs_btree_get_root(btree); | |
1819 | tmpptr = nreq->bpr_ptr; | |
9b7b265c RK |
1820 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 2, 1, |
1821 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1822 | &keys[0], &tmpptr); | |
17c76b01 | 1823 | } else { |
e7c274f8 | 1824 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1825 | |
1826 | /* create root node at level 1 */ | |
1827 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1828 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 1, n, |
1829 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1830 | keys, ptrs); | |
1831 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, | |
1832 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
e7c274f8 RK |
1833 | if (!nilfs_bmap_dirty(btree)) |
1834 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1835 | } |
1836 | ||
e7c274f8 | 1837 | if (NILFS_BMAP_USE_VBN(btree)) |
dc935be2 | 1838 | nilfs_bmap_set_target_v(btree, key, dreq->bpr_ptr); |
17c76b01 KS |
1839 | } |
1840 | ||
1841 | /** | |
1842 | * nilfs_btree_convert_and_insert - | |
1843 | * @bmap: | |
1844 | * @key: | |
1845 | * @ptr: | |
1846 | * @keys: | |
1847 | * @ptrs: | |
1848 | * @n: | |
17c76b01 | 1849 | */ |
e7c274f8 | 1850 | int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 | 1851 | __u64 key, __u64 ptr, |
3033342a | 1852 | const __u64 *keys, const __u64 *ptrs, int n) |
17c76b01 | 1853 | { |
4f05028f | 1854 | struct buffer_head *bh = NULL; |
17c76b01 KS |
1855 | union nilfs_bmap_ptr_req dreq, nreq, *di, *ni; |
1856 | struct nilfs_bmap_stats stats; | |
1857 | int ret; | |
1858 | ||
1859 | if (n + 1 <= NILFS_BTREE_ROOT_NCHILDREN_MAX) { | |
1860 | di = &dreq; | |
1861 | ni = NULL; | |
1862 | } else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX( | |
e7c274f8 | 1863 | 1 << btree->b_inode->i_blkbits)) { |
17c76b01 KS |
1864 | di = &dreq; |
1865 | ni = &nreq; | |
1866 | } else { | |
1867 | di = NULL; | |
1868 | ni = NULL; | |
1869 | BUG(); | |
1870 | } | |
1871 | ||
e7c274f8 | 1872 | ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh, |
17c76b01 KS |
1873 | &stats); |
1874 | if (ret < 0) | |
1875 | return ret; | |
e7c274f8 | 1876 | nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n, |
3033342a | 1877 | di, ni, bh); |
be667377 | 1878 | nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks); |
17c76b01 KS |
1879 | return 0; |
1880 | } | |
1881 | ||
e7c274f8 | 1882 | static int nilfs_btree_propagate_p(struct nilfs_bmap *btree, |
17c76b01 KS |
1883 | struct nilfs_btree_path *path, |
1884 | int level, | |
1885 | struct buffer_head *bh) | |
1886 | { | |
1887 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1888 | !buffer_dirty(path[level].bp_bh)) | |
5fc7b141 | 1889 | mark_buffer_dirty(path[level].bp_bh); |
17c76b01 KS |
1890 | |
1891 | return 0; | |
1892 | } | |
1893 | ||
e7c274f8 | 1894 | static int nilfs_btree_prepare_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1895 | struct nilfs_btree_path *path, |
2e0c2c73 | 1896 | int level, struct inode *dat) |
17c76b01 KS |
1897 | { |
1898 | struct nilfs_btree_node *parent; | |
9b7b265c | 1899 | int ncmax, ret; |
17c76b01 | 1900 | |
9b7b265c | 1901 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 | 1902 | path[level].bp_oldreq.bpr_ptr = |
9b7b265c RK |
1903 | nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, |
1904 | ncmax); | |
17c76b01 | 1905 | path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1; |
2e0c2c73 RK |
1906 | ret = nilfs_dat_prepare_update(dat, &path[level].bp_oldreq.bpr_req, |
1907 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1908 | if (ret < 0) |
1909 | return ret; | |
1910 | ||
1911 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1912 | path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr; | |
1913 | path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr; | |
1914 | path[level].bp_ctxt.bh = path[level].bp_bh; | |
1915 | ret = nilfs_btnode_prepare_change_key( | |
e7c274f8 | 1916 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1917 | &path[level].bp_ctxt); |
1918 | if (ret < 0) { | |
2e0c2c73 RK |
1919 | nilfs_dat_abort_update(dat, |
1920 | &path[level].bp_oldreq.bpr_req, | |
1921 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1922 | return ret; |
1923 | } | |
1924 | } | |
1925 | ||
1926 | return 0; | |
1927 | } | |
1928 | ||
e7c274f8 | 1929 | static void nilfs_btree_commit_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1930 | struct nilfs_btree_path *path, |
2e0c2c73 | 1931 | int level, struct inode *dat) |
17c76b01 KS |
1932 | { |
1933 | struct nilfs_btree_node *parent; | |
9b7b265c | 1934 | int ncmax; |
17c76b01 | 1935 | |
2e0c2c73 RK |
1936 | nilfs_dat_commit_update(dat, &path[level].bp_oldreq.bpr_req, |
1937 | &path[level].bp_newreq.bpr_req, | |
e7c274f8 | 1938 | btree->b_ptr_type == NILFS_BMAP_PTR_VS); |
17c76b01 KS |
1939 | |
1940 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1941 | nilfs_btnode_commit_change_key( | |
e7c274f8 | 1942 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1943 | &path[level].bp_ctxt); |
1944 | path[level].bp_bh = path[level].bp_ctxt.bh; | |
1945 | } | |
1946 | set_buffer_nilfs_volatile(path[level].bp_bh); | |
1947 | ||
9b7b265c RK |
1948 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
1949 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, | |
1950 | path[level].bp_newreq.bpr_ptr, ncmax); | |
17c76b01 KS |
1951 | } |
1952 | ||
e7c274f8 | 1953 | static void nilfs_btree_abort_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1954 | struct nilfs_btree_path *path, |
2e0c2c73 | 1955 | int level, struct inode *dat) |
17c76b01 | 1956 | { |
2e0c2c73 RK |
1957 | nilfs_dat_abort_update(dat, &path[level].bp_oldreq.bpr_req, |
1958 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1959 | if (buffer_nilfs_node(path[level].bp_bh)) |
1960 | nilfs_btnode_abort_change_key( | |
e7c274f8 | 1961 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1962 | &path[level].bp_ctxt); |
1963 | } | |
1964 | ||
e7c274f8 | 1965 | static int nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 1966 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
1967 | int minlevel, int *maxlevelp, |
1968 | struct inode *dat) | |
17c76b01 KS |
1969 | { |
1970 | int level, ret; | |
1971 | ||
1972 | level = minlevel; | |
1973 | if (!buffer_nilfs_volatile(path[level].bp_bh)) { | |
2e0c2c73 | 1974 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1975 | if (ret < 0) |
1976 | return ret; | |
1977 | } | |
1978 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1979 | !buffer_dirty(path[level].bp_bh)) { | |
1980 | ||
1f5abe7e | 1981 | WARN_ON(buffer_nilfs_volatile(path[level].bp_bh)); |
2e0c2c73 | 1982 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1983 | if (ret < 0) |
1984 | goto out; | |
1985 | } | |
1986 | ||
1987 | /* success */ | |
17c76b01 KS |
1988 | *maxlevelp = level - 1; |
1989 | return 0; | |
1990 | ||
1991 | /* error */ | |
1992 | out: | |
1993 | while (--level > minlevel) | |
2e0c2c73 | 1994 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 | 1995 | if (!buffer_nilfs_volatile(path[level].bp_bh)) |
2e0c2c73 | 1996 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 KS |
1997 | return ret; |
1998 | } | |
1999 | ||
e7c274f8 | 2000 | static void nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 2001 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
2002 | int minlevel, int maxlevel, |
2003 | struct buffer_head *bh, | |
2004 | struct inode *dat) | |
17c76b01 KS |
2005 | { |
2006 | int level; | |
2007 | ||
2008 | if (!buffer_nilfs_volatile(path[minlevel].bp_bh)) | |
2e0c2c73 | 2009 | nilfs_btree_commit_update_v(btree, path, minlevel, dat); |
17c76b01 KS |
2010 | |
2011 | for (level = minlevel + 1; level <= maxlevel; level++) | |
2e0c2c73 | 2012 | nilfs_btree_commit_update_v(btree, path, level, dat); |
17c76b01 KS |
2013 | } |
2014 | ||
e7c274f8 | 2015 | static int nilfs_btree_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 2016 | struct nilfs_btree_path *path, |
2e0c2c73 | 2017 | int level, struct buffer_head *bh) |
17c76b01 | 2018 | { |
308f4419 | 2019 | int maxlevel = 0, ret; |
17c76b01 | 2020 | struct nilfs_btree_node *parent; |
e7c274f8 | 2021 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 | 2022 | __u64 ptr; |
9b7b265c | 2023 | int ncmax; |
17c76b01 KS |
2024 | |
2025 | get_bh(bh); | |
2026 | path[level].bp_bh = bh; | |
2e0c2c73 RK |
2027 | ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel, |
2028 | dat); | |
17c76b01 KS |
2029 | if (ret < 0) |
2030 | goto out; | |
2031 | ||
2032 | if (buffer_nilfs_volatile(path[level].bp_bh)) { | |
9b7b265c RK |
2033 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2034 | ptr = nilfs_btree_node_get_ptr(parent, | |
2035 | path[level + 1].bp_index, | |
2036 | ncmax); | |
2e0c2c73 | 2037 | ret = nilfs_dat_mark_dirty(dat, ptr); |
17c76b01 KS |
2038 | if (ret < 0) |
2039 | goto out; | |
2040 | } | |
2041 | ||
2e0c2c73 | 2042 | nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); |
17c76b01 KS |
2043 | |
2044 | out: | |
2045 | brelse(path[level].bp_bh); | |
2046 | path[level].bp_bh = NULL; | |
2047 | return ret; | |
2048 | } | |
2049 | ||
e7c274f8 | 2050 | static int nilfs_btree_propagate(struct nilfs_bmap *btree, |
17c76b01 KS |
2051 | struct buffer_head *bh) |
2052 | { | |
17c76b01 KS |
2053 | struct nilfs_btree_path *path; |
2054 | struct nilfs_btree_node *node; | |
2055 | __u64 key; | |
2056 | int level, ret; | |
2057 | ||
1f5abe7e | 2058 | WARN_ON(!buffer_dirty(bh)); |
17c76b01 | 2059 | |
6d28f7ea | 2060 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2061 | if (path == NULL) |
2062 | return -ENOMEM; | |
17c76b01 KS |
2063 | |
2064 | if (buffer_nilfs_node(bh)) { | |
2065 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
2066 | key = nilfs_btree_node_get_key(node, 0); |
2067 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 2068 | } else { |
e7c274f8 | 2069 | key = nilfs_bmap_data_get_key(btree, bh); |
17c76b01 KS |
2070 | level = NILFS_BTREE_LEVEL_DATA; |
2071 | } | |
2072 | ||
03bdb5ac | 2073 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); |
17c76b01 | 2074 | if (ret < 0) { |
1f5abe7e | 2075 | if (unlikely(ret == -ENOENT)) |
17c76b01 KS |
2076 | printk(KERN_CRIT "%s: key = %llu, level == %d\n", |
2077 | __func__, (unsigned long long)key, level); | |
17c76b01 KS |
2078 | goto out; |
2079 | } | |
2080 | ||
e7c274f8 | 2081 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
2082 | nilfs_btree_propagate_v(btree, path, level, bh) : |
2083 | nilfs_btree_propagate_p(btree, path, level, bh); | |
17c76b01 KS |
2084 | |
2085 | out: | |
6d28f7ea | 2086 | nilfs_btree_free_path(path); |
17c76b01 KS |
2087 | |
2088 | return ret; | |
2089 | } | |
2090 | ||
e7c274f8 | 2091 | static int nilfs_btree_propagate_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
2092 | struct buffer_head *bh) |
2093 | { | |
e7c274f8 | 2094 | return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr); |
17c76b01 KS |
2095 | } |
2096 | ||
e7c274f8 | 2097 | static void nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree, |
17c76b01 KS |
2098 | struct list_head *lists, |
2099 | struct buffer_head *bh) | |
2100 | { | |
2101 | struct list_head *head; | |
2102 | struct buffer_head *cbh; | |
2103 | struct nilfs_btree_node *node, *cnode; | |
2104 | __u64 key, ckey; | |
2105 | int level; | |
2106 | ||
2107 | get_bh(bh); | |
2108 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
2109 | key = nilfs_btree_node_get_key(node, 0); |
2110 | level = nilfs_btree_node_get_level(node); | |
cfa913a5 RK |
2111 | if (level < NILFS_BTREE_LEVEL_NODE_MIN || |
2112 | level >= NILFS_BTREE_LEVEL_MAX) { | |
2113 | dump_stack(); | |
2114 | printk(KERN_WARNING | |
2115 | "%s: invalid btree level: %d (key=%llu, ino=%lu, " | |
2116 | "blocknr=%llu)\n", | |
2117 | __func__, level, (unsigned long long)key, | |
e7c274f8 | 2118 | NILFS_BMAP_I(btree)->vfs_inode.i_ino, |
cfa913a5 RK |
2119 | (unsigned long long)bh->b_blocknr); |
2120 | return; | |
2121 | } | |
2122 | ||
17c76b01 KS |
2123 | list_for_each(head, &lists[level]) { |
2124 | cbh = list_entry(head, struct buffer_head, b_assoc_buffers); | |
2125 | cnode = (struct nilfs_btree_node *)cbh->b_data; | |
6d28f7ea | 2126 | ckey = nilfs_btree_node_get_key(cnode, 0); |
17c76b01 KS |
2127 | if (key < ckey) |
2128 | break; | |
2129 | } | |
2130 | list_add_tail(&bh->b_assoc_buffers, head); | |
2131 | } | |
2132 | ||
e7c274f8 | 2133 | static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree, |
17c76b01 KS |
2134 | struct list_head *listp) |
2135 | { | |
e7c274f8 | 2136 | struct address_space *btcache = &NILFS_BMAP_I(btree)->i_btnode_cache; |
17c76b01 KS |
2137 | struct list_head lists[NILFS_BTREE_LEVEL_MAX]; |
2138 | struct pagevec pvec; | |
2139 | struct buffer_head *bh, *head; | |
2140 | pgoff_t index = 0; | |
2141 | int level, i; | |
2142 | ||
2143 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2144 | level < NILFS_BTREE_LEVEL_MAX; | |
2145 | level++) | |
2146 | INIT_LIST_HEAD(&lists[level]); | |
2147 | ||
2148 | pagevec_init(&pvec, 0); | |
2149 | ||
2150 | while (pagevec_lookup_tag(&pvec, btcache, &index, PAGECACHE_TAG_DIRTY, | |
2151 | PAGEVEC_SIZE)) { | |
2152 | for (i = 0; i < pagevec_count(&pvec); i++) { | |
2153 | bh = head = page_buffers(pvec.pages[i]); | |
2154 | do { | |
2155 | if (buffer_dirty(bh)) | |
2156 | nilfs_btree_add_dirty_buffer(btree, | |
2157 | lists, bh); | |
2158 | } while ((bh = bh->b_this_page) != head); | |
2159 | } | |
2160 | pagevec_release(&pvec); | |
2161 | cond_resched(); | |
2162 | } | |
2163 | ||
2164 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2165 | level < NILFS_BTREE_LEVEL_MAX; | |
2166 | level++) | |
0935db74 | 2167 | list_splice_tail(&lists[level], listp); |
17c76b01 KS |
2168 | } |
2169 | ||
e7c274f8 | 2170 | static int nilfs_btree_assign_p(struct nilfs_bmap *btree, |
17c76b01 KS |
2171 | struct nilfs_btree_path *path, |
2172 | int level, | |
2173 | struct buffer_head **bh, | |
2174 | sector_t blocknr, | |
2175 | union nilfs_binfo *binfo) | |
2176 | { | |
2177 | struct nilfs_btree_node *parent; | |
2178 | __u64 key; | |
2179 | __u64 ptr; | |
9b7b265c | 2180 | int ncmax, ret; |
17c76b01 | 2181 | |
9b7b265c RK |
2182 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2183 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2184 | ncmax); | |
17c76b01 KS |
2185 | if (buffer_nilfs_node(*bh)) { |
2186 | path[level].bp_ctxt.oldkey = ptr; | |
2187 | path[level].bp_ctxt.newkey = blocknr; | |
2188 | path[level].bp_ctxt.bh = *bh; | |
2189 | ret = nilfs_btnode_prepare_change_key( | |
e7c274f8 | 2190 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
2191 | &path[level].bp_ctxt); |
2192 | if (ret < 0) | |
2193 | return ret; | |
2194 | nilfs_btnode_commit_change_key( | |
e7c274f8 | 2195 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
2196 | &path[level].bp_ctxt); |
2197 | *bh = path[level].bp_ctxt.bh; | |
2198 | } | |
2199 | ||
9b7b265c RK |
2200 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, |
2201 | ncmax); | |
17c76b01 | 2202 | |
6d28f7ea | 2203 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2204 | /* on-disk format */ |
25b8d7de | 2205 | binfo->bi_dat.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2206 | binfo->bi_dat.bi_level = level; |
2207 | ||
2208 | return 0; | |
2209 | } | |
2210 | ||
e7c274f8 | 2211 | static int nilfs_btree_assign_v(struct nilfs_bmap *btree, |
17c76b01 KS |
2212 | struct nilfs_btree_path *path, |
2213 | int level, | |
2214 | struct buffer_head **bh, | |
2215 | sector_t blocknr, | |
2216 | union nilfs_binfo *binfo) | |
2217 | { | |
2218 | struct nilfs_btree_node *parent; | |
e7c274f8 | 2219 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 KS |
2220 | __u64 key; |
2221 | __u64 ptr; | |
2222 | union nilfs_bmap_ptr_req req; | |
9b7b265c | 2223 | int ncmax, ret; |
17c76b01 | 2224 | |
9b7b265c RK |
2225 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2226 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2227 | ncmax); | |
17c76b01 | 2228 | req.bpr_ptr = ptr; |
2e0c2c73 RK |
2229 | ret = nilfs_dat_prepare_start(dat, &req.bpr_req); |
2230 | if (ret < 0) | |
17c76b01 | 2231 | return ret; |
2e0c2c73 | 2232 | nilfs_dat_commit_start(dat, &req.bpr_req, blocknr); |
17c76b01 | 2233 | |
6d28f7ea | 2234 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2235 | /* on-disk format */ |
25b8d7de RK |
2236 | binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr); |
2237 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); | |
17c76b01 KS |
2238 | |
2239 | return 0; | |
2240 | } | |
2241 | ||
e7c274f8 | 2242 | static int nilfs_btree_assign(struct nilfs_bmap *btree, |
17c76b01 KS |
2243 | struct buffer_head **bh, |
2244 | sector_t blocknr, | |
2245 | union nilfs_binfo *binfo) | |
2246 | { | |
17c76b01 KS |
2247 | struct nilfs_btree_path *path; |
2248 | struct nilfs_btree_node *node; | |
2249 | __u64 key; | |
2250 | int level, ret; | |
2251 | ||
6d28f7ea | 2252 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2253 | if (path == NULL) |
2254 | return -ENOMEM; | |
17c76b01 KS |
2255 | |
2256 | if (buffer_nilfs_node(*bh)) { | |
2257 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea RK |
2258 | key = nilfs_btree_node_get_key(node, 0); |
2259 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 2260 | } else { |
e7c274f8 | 2261 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2262 | level = NILFS_BTREE_LEVEL_DATA; |
2263 | } | |
2264 | ||
03bdb5ac | 2265 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); |
17c76b01 | 2266 | if (ret < 0) { |
1f5abe7e | 2267 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2268 | goto out; |
2269 | } | |
2270 | ||
e7c274f8 | 2271 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
2272 | nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : |
2273 | nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); | |
17c76b01 KS |
2274 | |
2275 | out: | |
6d28f7ea | 2276 | nilfs_btree_free_path(path); |
17c76b01 KS |
2277 | |
2278 | return ret; | |
2279 | } | |
2280 | ||
e7c274f8 | 2281 | static int nilfs_btree_assign_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
2282 | struct buffer_head **bh, |
2283 | sector_t blocknr, | |
2284 | union nilfs_binfo *binfo) | |
2285 | { | |
17c76b01 KS |
2286 | struct nilfs_btree_node *node; |
2287 | __u64 key; | |
2288 | int ret; | |
2289 | ||
e7c274f8 | 2290 | ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr, |
2e0c2c73 | 2291 | blocknr); |
17c76b01 KS |
2292 | if (ret < 0) |
2293 | return ret; | |
2294 | ||
2295 | if (buffer_nilfs_node(*bh)) { | |
2296 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea | 2297 | key = nilfs_btree_node_get_key(node, 0); |
17c76b01 | 2298 | } else |
e7c274f8 | 2299 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2300 | |
2301 | /* on-disk format */ | |
2302 | binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr); | |
25b8d7de | 2303 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2304 | |
2305 | return 0; | |
2306 | } | |
2307 | ||
e7c274f8 | 2308 | static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) |
17c76b01 KS |
2309 | { |
2310 | struct buffer_head *bh; | |
17c76b01 KS |
2311 | struct nilfs_btree_path *path; |
2312 | __u64 ptr; | |
2313 | int ret; | |
2314 | ||
6d28f7ea | 2315 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2316 | if (path == NULL) |
2317 | return -ENOMEM; | |
17c76b01 | 2318 | |
03bdb5ac | 2319 | ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0); |
17c76b01 | 2320 | if (ret < 0) { |
1f5abe7e | 2321 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2322 | goto out; |
2323 | } | |
f198dbb9 | 2324 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 | 2325 | if (ret < 0) { |
1f5abe7e | 2326 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2327 | goto out; |
2328 | } | |
2329 | ||
2330 | if (!buffer_dirty(bh)) | |
5fc7b141 | 2331 | mark_buffer_dirty(bh); |
087d01b4 | 2332 | brelse(bh); |
e7c274f8 RK |
2333 | if (!nilfs_bmap_dirty(btree)) |
2334 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
2335 | |
2336 | out: | |
6d28f7ea | 2337 | nilfs_btree_free_path(path); |
17c76b01 KS |
2338 | return ret; |
2339 | } | |
2340 | ||
2341 | static const struct nilfs_bmap_operations nilfs_btree_ops = { | |
2342 | .bop_lookup = nilfs_btree_lookup, | |
c3a7abf0 | 2343 | .bop_lookup_contig = nilfs_btree_lookup_contig, |
17c76b01 KS |
2344 | .bop_insert = nilfs_btree_insert, |
2345 | .bop_delete = nilfs_btree_delete, | |
2346 | .bop_clear = NULL, | |
2347 | ||
2348 | .bop_propagate = nilfs_btree_propagate, | |
2349 | ||
2350 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2351 | ||
2352 | .bop_assign = nilfs_btree_assign, | |
2353 | .bop_mark = nilfs_btree_mark, | |
2354 | ||
5b20384f | 2355 | .bop_seek_key = nilfs_btree_seek_key, |
17c76b01 | 2356 | .bop_last_key = nilfs_btree_last_key, |
5b20384f | 2357 | |
17c76b01 KS |
2358 | .bop_check_insert = NULL, |
2359 | .bop_check_delete = nilfs_btree_check_delete, | |
2360 | .bop_gather_data = nilfs_btree_gather_data, | |
2361 | }; | |
2362 | ||
2363 | static const struct nilfs_bmap_operations nilfs_btree_ops_gc = { | |
2364 | .bop_lookup = NULL, | |
c3a7abf0 | 2365 | .bop_lookup_contig = NULL, |
17c76b01 KS |
2366 | .bop_insert = NULL, |
2367 | .bop_delete = NULL, | |
2368 | .bop_clear = NULL, | |
2369 | ||
2370 | .bop_propagate = nilfs_btree_propagate_gc, | |
2371 | ||
2372 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2373 | ||
2374 | .bop_assign = nilfs_btree_assign_gc, | |
2375 | .bop_mark = NULL, | |
2376 | ||
5b20384f | 2377 | .bop_seek_key = NULL, |
17c76b01 | 2378 | .bop_last_key = NULL, |
5b20384f | 2379 | |
17c76b01 KS |
2380 | .bop_check_insert = NULL, |
2381 | .bop_check_delete = NULL, | |
2382 | .bop_gather_data = NULL, | |
2383 | }; | |
2384 | ||
957ed60b | 2385 | static void __nilfs_btree_init(struct nilfs_bmap *bmap) |
17c76b01 | 2386 | { |
17c76b01 | 2387 | bmap->b_ops = &nilfs_btree_ops; |
5ad2686e RK |
2388 | bmap->b_nchildren_per_block = |
2389 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
957ed60b RK |
2390 | } |
2391 | ||
2392 | int nilfs_btree_init(struct nilfs_bmap *bmap) | |
2393 | { | |
2394 | int ret = 0; | |
2395 | ||
2396 | __nilfs_btree_init(bmap); | |
2397 | ||
2398 | if (nilfs_btree_root_broken(nilfs_btree_get_root(bmap), | |
2399 | bmap->b_inode->i_ino)) | |
2400 | ret = -EIO; | |
2401 | return ret; | |
17c76b01 KS |
2402 | } |
2403 | ||
2404 | void nilfs_btree_init_gc(struct nilfs_bmap *bmap) | |
2405 | { | |
17c76b01 | 2406 | bmap->b_ops = &nilfs_btree_ops_gc; |
5ad2686e RK |
2407 | bmap->b_nchildren_per_block = |
2408 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
17c76b01 | 2409 | } |