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