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