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 KS |
506 | struct nilfs_btree_path *path, |
507 | __u64 key, __u64 *ptrp, int minlevel) | |
508 | { | |
509 | struct nilfs_btree_node *node; | |
510 | __u64 ptr; | |
ea64ab87 | 511 | int level, index, found, ncmax, ret; |
17c76b01 | 512 | |
17c76b01 | 513 | node = nilfs_btree_get_root(btree); |
6d28f7ea RK |
514 | level = nilfs_btree_node_get_level(node); |
515 | if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) | |
17c76b01 KS |
516 | return -ENOENT; |
517 | ||
6d28f7ea | 518 | found = nilfs_btree_node_lookup(node, key, &index); |
9b7b265c RK |
519 | ptr = nilfs_btree_node_get_ptr(node, index, |
520 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
521 | path[level].bp_bh = NULL; |
522 | path[level].bp_index = index; | |
523 | ||
9b7b265c | 524 | ncmax = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 525 | |
17c76b01 | 526 | for (level--; level >= minlevel; level--) { |
f198dbb9 | 527 | ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh); |
17c76b01 KS |
528 | if (ret < 0) |
529 | return ret; | |
6d28f7ea | 530 | node = nilfs_btree_get_nonroot_node(path, level); |
9b945d53 RK |
531 | if (nilfs_btree_bad_node(node, level)) |
532 | return -EINVAL; | |
17c76b01 | 533 | if (!found) |
6d28f7ea | 534 | found = nilfs_btree_node_lookup(node, key, &index); |
17c76b01 KS |
535 | else |
536 | index = 0; | |
ea64ab87 | 537 | if (index < ncmax) { |
9b7b265c | 538 | ptr = nilfs_btree_node_get_ptr(node, index, ncmax); |
ea64ab87 | 539 | } else { |
1f5abe7e | 540 | WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN); |
17c76b01 KS |
541 | /* insert */ |
542 | ptr = NILFS_BMAP_INVALID_PTR; | |
543 | } | |
544 | path[level].bp_index = index; | |
545 | } | |
546 | if (!found) | |
547 | return -ENOENT; | |
548 | ||
549 | if (ptrp != NULL) | |
550 | *ptrp = ptr; | |
551 | ||
552 | return 0; | |
553 | } | |
554 | ||
e7c274f8 | 555 | static int nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, |
17c76b01 KS |
556 | struct nilfs_btree_path *path, |
557 | __u64 *keyp, __u64 *ptrp) | |
558 | { | |
559 | struct nilfs_btree_node *node; | |
560 | __u64 ptr; | |
9b7b265c | 561 | int index, level, ncmax, ret; |
17c76b01 KS |
562 | |
563 | node = nilfs_btree_get_root(btree); | |
6d28f7ea | 564 | index = nilfs_btree_node_get_nchildren(node) - 1; |
17c76b01 KS |
565 | if (index < 0) |
566 | return -ENOENT; | |
6d28f7ea | 567 | level = nilfs_btree_node_get_level(node); |
9b7b265c RK |
568 | ptr = nilfs_btree_node_get_ptr(node, index, |
569 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
570 | path[level].bp_bh = NULL; |
571 | path[level].bp_index = index; | |
9b7b265c | 572 | ncmax = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
573 | |
574 | for (level--; level > 0; level--) { | |
f198dbb9 | 575 | ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh); |
17c76b01 KS |
576 | if (ret < 0) |
577 | return ret; | |
6d28f7ea | 578 | node = nilfs_btree_get_nonroot_node(path, level); |
9b945d53 RK |
579 | if (nilfs_btree_bad_node(node, level)) |
580 | return -EINVAL; | |
6d28f7ea | 581 | index = nilfs_btree_node_get_nchildren(node) - 1; |
9b7b265c | 582 | ptr = nilfs_btree_node_get_ptr(node, index, ncmax); |
17c76b01 KS |
583 | path[level].bp_index = index; |
584 | } | |
585 | ||
586 | if (keyp != NULL) | |
6d28f7ea | 587 | *keyp = nilfs_btree_node_get_key(node, index); |
17c76b01 KS |
588 | if (ptrp != NULL) |
589 | *ptrp = ptr; | |
590 | ||
591 | return 0; | |
592 | } | |
593 | ||
e7c274f8 | 594 | static int nilfs_btree_lookup(const struct nilfs_bmap *btree, |
17c76b01 KS |
595 | __u64 key, int level, __u64 *ptrp) |
596 | { | |
17c76b01 | 597 | struct nilfs_btree_path *path; |
17c76b01 KS |
598 | int ret; |
599 | ||
6d28f7ea | 600 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
601 | if (path == NULL) |
602 | return -ENOMEM; | |
17c76b01 | 603 | |
364ec2d7 | 604 | ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level); |
17c76b01 | 605 | |
6d28f7ea | 606 | nilfs_btree_free_path(path); |
17c76b01 KS |
607 | |
608 | return ret; | |
609 | } | |
610 | ||
e7c274f8 | 611 | static int nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, |
c3a7abf0 RK |
612 | __u64 key, __u64 *ptrp, unsigned maxblocks) |
613 | { | |
c3a7abf0 RK |
614 | struct nilfs_btree_path *path; |
615 | struct nilfs_btree_node *node; | |
616 | struct inode *dat = NULL; | |
617 | __u64 ptr, ptr2; | |
618 | sector_t blocknr; | |
619 | int level = NILFS_BTREE_LEVEL_NODE_MIN; | |
9b7b265c | 620 | int ret, cnt, index, maxlevel, ncmax; |
c3a7abf0 | 621 | |
6d28f7ea | 622 | path = nilfs_btree_alloc_path(); |
c3a7abf0 RK |
623 | if (path == NULL) |
624 | return -ENOMEM; | |
f905440f | 625 | |
c3a7abf0 RK |
626 | ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level); |
627 | if (ret < 0) | |
628 | goto out; | |
629 | ||
e7c274f8 RK |
630 | if (NILFS_BMAP_USE_VBN(btree)) { |
631 | dat = nilfs_bmap_get_dat(btree); | |
c3a7abf0 RK |
632 | ret = nilfs_dat_translate(dat, ptr, &blocknr); |
633 | if (ret < 0) | |
634 | goto out; | |
635 | ptr = blocknr; | |
636 | } | |
637 | cnt = 1; | |
638 | if (cnt == maxblocks) | |
639 | goto end; | |
640 | ||
641 | maxlevel = nilfs_btree_height(btree) - 1; | |
9b7b265c | 642 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
c3a7abf0 RK |
643 | index = path[level].bp_index + 1; |
644 | for (;;) { | |
6d28f7ea RK |
645 | while (index < nilfs_btree_node_get_nchildren(node)) { |
646 | if (nilfs_btree_node_get_key(node, index) != | |
c3a7abf0 RK |
647 | key + cnt) |
648 | goto end; | |
9b7b265c | 649 | ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax); |
c3a7abf0 RK |
650 | if (dat) { |
651 | ret = nilfs_dat_translate(dat, ptr2, &blocknr); | |
652 | if (ret < 0) | |
653 | goto out; | |
654 | ptr2 = blocknr; | |
655 | } | |
656 | if (ptr2 != ptr + cnt || ++cnt == maxblocks) | |
657 | goto end; | |
658 | index++; | |
659 | continue; | |
660 | } | |
661 | if (level == maxlevel) | |
662 | break; | |
663 | ||
664 | /* look-up right sibling node */ | |
9b7b265c | 665 | node = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
c3a7abf0 | 666 | index = path[level + 1].bp_index + 1; |
6d28f7ea RK |
667 | if (index >= nilfs_btree_node_get_nchildren(node) || |
668 | nilfs_btree_node_get_key(node, index) != key + cnt) | |
c3a7abf0 | 669 | break; |
9b7b265c | 670 | ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax); |
c3a7abf0 RK |
671 | path[level + 1].bp_index = index; |
672 | ||
673 | brelse(path[level].bp_bh); | |
674 | path[level].bp_bh = NULL; | |
675 | ret = nilfs_btree_get_block(btree, ptr2, &path[level].bp_bh); | |
676 | if (ret < 0) | |
677 | goto out; | |
6d28f7ea | 678 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 679 | ncmax = nilfs_btree_nchildren_per_block(btree); |
c3a7abf0 RK |
680 | index = 0; |
681 | path[level].bp_index = index; | |
682 | } | |
683 | end: | |
684 | *ptrp = ptr; | |
685 | ret = cnt; | |
686 | out: | |
6d28f7ea | 687 | nilfs_btree_free_path(path); |
c3a7abf0 RK |
688 | return ret; |
689 | } | |
690 | ||
e7c274f8 | 691 | static void nilfs_btree_promote_key(struct nilfs_bmap *btree, |
17c76b01 KS |
692 | struct nilfs_btree_path *path, |
693 | int level, __u64 key) | |
694 | { | |
695 | if (level < nilfs_btree_height(btree) - 1) { | |
696 | do { | |
17c76b01 | 697 | nilfs_btree_node_set_key( |
6d28f7ea | 698 | nilfs_btree_get_nonroot_node(path, level), |
17c76b01 KS |
699 | path[level].bp_index, key); |
700 | if (!buffer_dirty(path[level].bp_bh)) | |
701 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
17c76b01 KS |
702 | } while ((path[level].bp_index == 0) && |
703 | (++level < nilfs_btree_height(btree) - 1)); | |
704 | } | |
705 | ||
706 | /* root */ | |
707 | if (level == nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 708 | nilfs_btree_node_set_key(nilfs_btree_get_root(btree), |
17c76b01 KS |
709 | path[level].bp_index, key); |
710 | } | |
711 | } | |
712 | ||
e7c274f8 | 713 | static void nilfs_btree_do_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
714 | struct nilfs_btree_path *path, |
715 | int level, __u64 *keyp, __u64 *ptrp) | |
716 | { | |
717 | struct nilfs_btree_node *node; | |
9b7b265c | 718 | int ncblk; |
17c76b01 KS |
719 | |
720 | if (level < nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 721 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c RK |
722 | ncblk = nilfs_btree_nchildren_per_block(btree); |
723 | nilfs_btree_node_insert(node, path[level].bp_index, | |
724 | *keyp, *ptrp, ncblk); | |
17c76b01 KS |
725 | if (!buffer_dirty(path[level].bp_bh)) |
726 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
17c76b01 KS |
727 | |
728 | if (path[level].bp_index == 0) | |
729 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea RK |
730 | nilfs_btree_node_get_key(node, |
731 | 0)); | |
17c76b01 KS |
732 | } else { |
733 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
734 | nilfs_btree_node_insert(node, path[level].bp_index, |
735 | *keyp, *ptrp, | |
736 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
737 | } |
738 | } | |
739 | ||
e7c274f8 | 740 | static void nilfs_btree_carry_left(struct nilfs_bmap *btree, |
17c76b01 KS |
741 | struct nilfs_btree_path *path, |
742 | int level, __u64 *keyp, __u64 *ptrp) | |
743 | { | |
744 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 745 | int nchildren, lnchildren, n, move, ncblk; |
17c76b01 | 746 | |
6d28f7ea RK |
747 | node = nilfs_btree_get_nonroot_node(path, level); |
748 | left = nilfs_btree_get_sib_node(path, level); | |
749 | nchildren = nilfs_btree_node_get_nchildren(node); | |
750 | lnchildren = nilfs_btree_node_get_nchildren(left); | |
9b7b265c | 751 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
752 | move = 0; |
753 | ||
754 | n = (nchildren + lnchildren + 1) / 2 - lnchildren; | |
755 | if (n > path[level].bp_index) { | |
756 | /* move insert point */ | |
757 | n--; | |
758 | move = 1; | |
759 | } | |
760 | ||
9b7b265c | 761 | nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); |
17c76b01 KS |
762 | |
763 | if (!buffer_dirty(path[level].bp_bh)) | |
764 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
765 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
766 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
767 | ||
17c76b01 | 768 | nilfs_btree_promote_key(btree, path, level + 1, |
6d28f7ea | 769 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 KS |
770 | |
771 | if (move) { | |
087d01b4 | 772 | brelse(path[level].bp_bh); |
17c76b01 KS |
773 | path[level].bp_bh = path[level].bp_sib_bh; |
774 | path[level].bp_sib_bh = NULL; | |
775 | path[level].bp_index += lnchildren; | |
776 | path[level + 1].bp_index--; | |
777 | } else { | |
087d01b4 | 778 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
779 | path[level].bp_sib_bh = NULL; |
780 | path[level].bp_index -= n; | |
781 | } | |
782 | ||
783 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
784 | } | |
785 | ||
e7c274f8 | 786 | static void nilfs_btree_carry_right(struct nilfs_bmap *btree, |
17c76b01 KS |
787 | struct nilfs_btree_path *path, |
788 | int level, __u64 *keyp, __u64 *ptrp) | |
789 | { | |
790 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 791 | int nchildren, rnchildren, n, move, ncblk; |
17c76b01 | 792 | |
6d28f7ea RK |
793 | node = nilfs_btree_get_nonroot_node(path, level); |
794 | right = nilfs_btree_get_sib_node(path, level); | |
795 | nchildren = nilfs_btree_node_get_nchildren(node); | |
796 | rnchildren = nilfs_btree_node_get_nchildren(right); | |
9b7b265c | 797 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
798 | move = 0; |
799 | ||
800 | n = (nchildren + rnchildren + 1) / 2 - rnchildren; | |
801 | if (n > nchildren - path[level].bp_index) { | |
802 | /* move insert point */ | |
803 | n--; | |
804 | move = 1; | |
805 | } | |
806 | ||
9b7b265c | 807 | nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); |
17c76b01 KS |
808 | |
809 | if (!buffer_dirty(path[level].bp_bh)) | |
810 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
811 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
812 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
813 | ||
17c76b01 KS |
814 | path[level + 1].bp_index++; |
815 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 816 | nilfs_btree_node_get_key(right, 0)); |
17c76b01 KS |
817 | path[level + 1].bp_index--; |
818 | ||
819 | if (move) { | |
087d01b4 | 820 | brelse(path[level].bp_bh); |
17c76b01 KS |
821 | path[level].bp_bh = path[level].bp_sib_bh; |
822 | path[level].bp_sib_bh = NULL; | |
6d28f7ea | 823 | path[level].bp_index -= nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
824 | path[level + 1].bp_index++; |
825 | } else { | |
087d01b4 | 826 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
827 | path[level].bp_sib_bh = NULL; |
828 | } | |
829 | ||
830 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
831 | } | |
832 | ||
e7c274f8 | 833 | static void nilfs_btree_split(struct nilfs_bmap *btree, |
17c76b01 KS |
834 | struct nilfs_btree_path *path, |
835 | int level, __u64 *keyp, __u64 *ptrp) | |
836 | { | |
837 | struct nilfs_btree_node *node, *right; | |
838 | __u64 newkey; | |
839 | __u64 newptr; | |
9b7b265c | 840 | int nchildren, n, move, ncblk; |
17c76b01 | 841 | |
6d28f7ea RK |
842 | node = nilfs_btree_get_nonroot_node(path, level); |
843 | right = nilfs_btree_get_sib_node(path, level); | |
844 | nchildren = nilfs_btree_node_get_nchildren(node); | |
9b7b265c | 845 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
846 | move = 0; |
847 | ||
848 | n = (nchildren + 1) / 2; | |
849 | if (n > nchildren - path[level].bp_index) { | |
850 | n--; | |
851 | move = 1; | |
852 | } | |
853 | ||
9b7b265c | 854 | nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); |
17c76b01 KS |
855 | |
856 | if (!buffer_dirty(path[level].bp_bh)) | |
857 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
858 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
859 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
860 | ||
6d28f7ea | 861 | newkey = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
862 | newptr = path[level].bp_newreq.bpr_ptr; |
863 | ||
864 | if (move) { | |
6d28f7ea | 865 | path[level].bp_index -= nilfs_btree_node_get_nchildren(node); |
9b7b265c RK |
866 | nilfs_btree_node_insert(right, path[level].bp_index, |
867 | *keyp, *ptrp, ncblk); | |
17c76b01 | 868 | |
6d28f7ea | 869 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
870 | *ptrp = path[level].bp_newreq.bpr_ptr; |
871 | ||
087d01b4 | 872 | brelse(path[level].bp_bh); |
17c76b01 KS |
873 | path[level].bp_bh = path[level].bp_sib_bh; |
874 | path[level].bp_sib_bh = NULL; | |
875 | } else { | |
876 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
877 | ||
6d28f7ea | 878 | *keyp = nilfs_btree_node_get_key(right, 0); |
17c76b01 KS |
879 | *ptrp = path[level].bp_newreq.bpr_ptr; |
880 | ||
087d01b4 | 881 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
882 | path[level].bp_sib_bh = NULL; |
883 | } | |
884 | ||
885 | path[level + 1].bp_index++; | |
886 | } | |
887 | ||
e7c274f8 | 888 | static void nilfs_btree_grow(struct nilfs_bmap *btree, |
17c76b01 KS |
889 | struct nilfs_btree_path *path, |
890 | int level, __u64 *keyp, __u64 *ptrp) | |
891 | { | |
892 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 893 | int n, ncblk; |
17c76b01 | 894 | |
17c76b01 | 895 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 896 | child = nilfs_btree_get_sib_node(path, level); |
9b7b265c | 897 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 898 | |
6d28f7ea | 899 | n = nilfs_btree_node_get_nchildren(root); |
17c76b01 | 900 | |
9b7b265c RK |
901 | nilfs_btree_node_move_right(root, child, n, |
902 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
6d28f7ea | 903 | nilfs_btree_node_set_level(root, level + 1); |
17c76b01 KS |
904 | |
905 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
906 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
907 | ||
17c76b01 KS |
908 | path[level].bp_bh = path[level].bp_sib_bh; |
909 | path[level].bp_sib_bh = NULL; | |
910 | ||
911 | nilfs_btree_do_insert(btree, path, level, keyp, ptrp); | |
912 | ||
6d28f7ea | 913 | *keyp = nilfs_btree_node_get_key(child, 0); |
17c76b01 KS |
914 | *ptrp = path[level].bp_newreq.bpr_ptr; |
915 | } | |
916 | ||
e7c274f8 | 917 | static __u64 nilfs_btree_find_near(const struct nilfs_bmap *btree, |
17c76b01 KS |
918 | const struct nilfs_btree_path *path) |
919 | { | |
920 | struct nilfs_btree_node *node; | |
9b7b265c | 921 | int level, ncmax; |
17c76b01 KS |
922 | |
923 | if (path == NULL) | |
924 | return NILFS_BMAP_INVALID_PTR; | |
925 | ||
926 | /* left sibling */ | |
927 | level = NILFS_BTREE_LEVEL_NODE_MIN; | |
928 | if (path[level].bp_index > 0) { | |
9b7b265c RK |
929 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
930 | return nilfs_btree_node_get_ptr(node, | |
931 | path[level].bp_index - 1, | |
932 | ncmax); | |
17c76b01 KS |
933 | } |
934 | ||
935 | /* parent */ | |
936 | level = NILFS_BTREE_LEVEL_NODE_MIN + 1; | |
937 | if (level <= nilfs_btree_height(btree) - 1) { | |
9b7b265c RK |
938 | node = nilfs_btree_get_node(btree, path, level, &ncmax); |
939 | return nilfs_btree_node_get_ptr(node, path[level].bp_index, | |
940 | ncmax); | |
17c76b01 KS |
941 | } |
942 | ||
943 | return NILFS_BMAP_INVALID_PTR; | |
944 | } | |
945 | ||
e7c274f8 | 946 | static __u64 nilfs_btree_find_target_v(const struct nilfs_bmap *btree, |
17c76b01 KS |
947 | const struct nilfs_btree_path *path, |
948 | __u64 key) | |
949 | { | |
950 | __u64 ptr; | |
951 | ||
e7c274f8 | 952 | ptr = nilfs_bmap_find_target_seq(btree, key); |
17c76b01 KS |
953 | if (ptr != NILFS_BMAP_INVALID_PTR) |
954 | /* sequential access */ | |
955 | return ptr; | |
956 | else { | |
957 | ptr = nilfs_btree_find_near(btree, path); | |
958 | if (ptr != NILFS_BMAP_INVALID_PTR) | |
959 | /* near */ | |
960 | return ptr; | |
961 | } | |
962 | /* block group */ | |
e7c274f8 | 963 | return nilfs_bmap_find_target_in_group(btree); |
17c76b01 KS |
964 | } |
965 | ||
e7c274f8 | 966 | static int nilfs_btree_prepare_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
967 | struct nilfs_btree_path *path, |
968 | int *levelp, __u64 key, __u64 ptr, | |
969 | struct nilfs_bmap_stats *stats) | |
970 | { | |
971 | struct buffer_head *bh; | |
972 | struct nilfs_btree_node *node, *parent, *sib; | |
973 | __u64 sibptr; | |
9b7b265c | 974 | int pindex, level, ncmax, ncblk, ret; |
2e0c2c73 | 975 | struct inode *dat = NULL; |
17c76b01 KS |
976 | |
977 | stats->bs_nblocks = 0; | |
978 | level = NILFS_BTREE_LEVEL_DATA; | |
979 | ||
980 | /* allocate a new ptr for data block */ | |
e7c274f8 | 981 | if (NILFS_BMAP_USE_VBN(btree)) { |
17c76b01 | 982 | path[level].bp_newreq.bpr_ptr = |
7cde31d7 | 983 | nilfs_btree_find_target_v(btree, path, key); |
e7c274f8 | 984 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 985 | } |
17c76b01 | 986 | |
e7c274f8 | 987 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
988 | if (ret < 0) |
989 | goto err_out_data; | |
990 | ||
9b7b265c | 991 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 992 | |
17c76b01 KS |
993 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; |
994 | level < nilfs_btree_height(btree) - 1; | |
995 | level++) { | |
6d28f7ea | 996 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 997 | if (nilfs_btree_node_get_nchildren(node) < ncblk) { |
17c76b01 KS |
998 | path[level].bp_op = nilfs_btree_do_insert; |
999 | stats->bs_nblocks++; | |
1000 | goto out; | |
1001 | } | |
1002 | ||
9b7b265c | 1003 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 KS |
1004 | pindex = path[level + 1].bp_index; |
1005 | ||
1006 | /* left sibling */ | |
1007 | if (pindex > 0) { | |
9b7b265c RK |
1008 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1009 | ncmax); | |
f198dbb9 | 1010 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1011 | if (ret < 0) |
1012 | goto err_out_child_node; | |
1013 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1014 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1015 | path[level].bp_sib_bh = bh; |
1016 | path[level].bp_op = nilfs_btree_carry_left; | |
1017 | stats->bs_nblocks++; | |
1018 | goto out; | |
9b7b265c | 1019 | } else { |
087d01b4 | 1020 | brelse(bh); |
9b7b265c | 1021 | } |
17c76b01 KS |
1022 | } |
1023 | ||
1024 | /* right sibling */ | |
9b7b265c RK |
1025 | if (pindex < nilfs_btree_node_get_nchildren(parent) - 1) { |
1026 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, | |
1027 | ncmax); | |
f198dbb9 | 1028 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1029 | if (ret < 0) |
1030 | goto err_out_child_node; | |
1031 | sib = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1032 | if (nilfs_btree_node_get_nchildren(sib) < ncblk) { |
17c76b01 KS |
1033 | path[level].bp_sib_bh = bh; |
1034 | path[level].bp_op = nilfs_btree_carry_right; | |
1035 | stats->bs_nblocks++; | |
1036 | goto out; | |
9b7b265c | 1037 | } else { |
087d01b4 | 1038 | brelse(bh); |
9b7b265c | 1039 | } |
17c76b01 KS |
1040 | } |
1041 | ||
1042 | /* split */ | |
1043 | path[level].bp_newreq.bpr_ptr = | |
1044 | path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1045 | ret = nilfs_bmap_prepare_alloc_ptr(btree, |
2e0c2c73 | 1046 | &path[level].bp_newreq, dat); |
17c76b01 KS |
1047 | if (ret < 0) |
1048 | goto err_out_child_node; | |
f198dbb9 RK |
1049 | ret = nilfs_btree_get_new_block(btree, |
1050 | path[level].bp_newreq.bpr_ptr, | |
1051 | &bh); | |
17c76b01 KS |
1052 | if (ret < 0) |
1053 | goto err_out_curr_node; | |
1054 | ||
1055 | stats->bs_nblocks++; | |
1056 | ||
9b7b265c RK |
1057 | sib = (struct nilfs_btree_node *)bh->b_data; |
1058 | nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1059 | path[level].bp_sib_bh = bh; |
1060 | path[level].bp_op = nilfs_btree_split; | |
1061 | } | |
1062 | ||
1063 | /* root */ | |
1064 | node = nilfs_btree_get_root(btree); | |
6d28f7ea | 1065 | if (nilfs_btree_node_get_nchildren(node) < |
ea64ab87 | 1066 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
17c76b01 KS |
1067 | path[level].bp_op = nilfs_btree_do_insert; |
1068 | stats->bs_nblocks++; | |
1069 | goto out; | |
1070 | } | |
1071 | ||
1072 | /* grow */ | |
1073 | path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1; | |
e7c274f8 | 1074 | ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1075 | if (ret < 0) |
1076 | goto err_out_child_node; | |
f198dbb9 RK |
1077 | ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr, |
1078 | &bh); | |
17c76b01 KS |
1079 | if (ret < 0) |
1080 | goto err_out_curr_node; | |
1081 | ||
9b7b265c RK |
1082 | nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data, |
1083 | 0, level, 0, ncblk, NULL, NULL); | |
17c76b01 KS |
1084 | path[level].bp_sib_bh = bh; |
1085 | path[level].bp_op = nilfs_btree_grow; | |
1086 | ||
1087 | level++; | |
1088 | path[level].bp_op = nilfs_btree_do_insert; | |
1089 | ||
1090 | /* a newly-created node block and a data block are added */ | |
1091 | stats->bs_nblocks += 2; | |
1092 | ||
1093 | /* success */ | |
1094 | out: | |
1095 | *levelp = level; | |
1096 | return ret; | |
1097 | ||
1098 | /* error */ | |
1099 | err_out_curr_node: | |
e7c274f8 | 1100 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1101 | err_out_child_node: |
1102 | for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) { | |
9f098900 | 1103 | nilfs_btnode_delete(path[level].bp_sib_bh); |
e7c274f8 | 1104 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1105 | |
1106 | } | |
1107 | ||
e7c274f8 | 1108 | nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); |
17c76b01 KS |
1109 | err_out_data: |
1110 | *levelp = level; | |
1111 | stats->bs_nblocks = 0; | |
1112 | return ret; | |
1113 | } | |
1114 | ||
e7c274f8 | 1115 | static void nilfs_btree_commit_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1116 | struct nilfs_btree_path *path, |
1117 | int maxlevel, __u64 key, __u64 ptr) | |
1118 | { | |
2e0c2c73 | 1119 | struct inode *dat = NULL; |
17c76b01 KS |
1120 | int level; |
1121 | ||
1122 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1123 | ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr; | |
e7c274f8 | 1124 | if (NILFS_BMAP_USE_VBN(btree)) { |
dc935be2 | 1125 | nilfs_bmap_set_target_v(btree, key, ptr); |
e7c274f8 | 1126 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1127 | } |
17c76b01 KS |
1128 | |
1129 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1130 | nilfs_bmap_commit_alloc_ptr(btree, |
2e0c2c73 | 1131 | &path[level - 1].bp_newreq, dat); |
8acfbf09 | 1132 | path[level].bp_op(btree, path, level, &key, &ptr); |
17c76b01 KS |
1133 | } |
1134 | ||
e7c274f8 RK |
1135 | if (!nilfs_bmap_dirty(btree)) |
1136 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1137 | } |
1138 | ||
e7c274f8 | 1139 | static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr) |
17c76b01 | 1140 | { |
17c76b01 KS |
1141 | struct nilfs_btree_path *path; |
1142 | struct nilfs_bmap_stats stats; | |
1143 | int level, ret; | |
1144 | ||
6d28f7ea | 1145 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1146 | if (path == NULL) |
1147 | return -ENOMEM; | |
17c76b01 KS |
1148 | |
1149 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, | |
1150 | NILFS_BTREE_LEVEL_NODE_MIN); | |
1151 | if (ret != -ENOENT) { | |
1152 | if (ret == 0) | |
1153 | ret = -EEXIST; | |
1154 | goto out; | |
1155 | } | |
1156 | ||
1157 | ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats); | |
1158 | if (ret < 0) | |
1159 | goto out; | |
1160 | nilfs_btree_commit_insert(btree, path, level, key, ptr); | |
e7c274f8 | 1161 | nilfs_bmap_add_blocks(btree, stats.bs_nblocks); |
17c76b01 KS |
1162 | |
1163 | out: | |
6d28f7ea | 1164 | nilfs_btree_free_path(path); |
17c76b01 KS |
1165 | return ret; |
1166 | } | |
1167 | ||
e7c274f8 | 1168 | static void nilfs_btree_do_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1169 | struct nilfs_btree_path *path, |
1170 | int level, __u64 *keyp, __u64 *ptrp) | |
1171 | { | |
1172 | struct nilfs_btree_node *node; | |
9b7b265c | 1173 | int ncblk; |
17c76b01 KS |
1174 | |
1175 | if (level < nilfs_btree_height(btree) - 1) { | |
6d28f7ea | 1176 | node = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c RK |
1177 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1178 | nilfs_btree_node_delete(node, path[level].bp_index, | |
1179 | keyp, ptrp, ncblk); | |
17c76b01 KS |
1180 | if (!buffer_dirty(path[level].bp_bh)) |
1181 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
17c76b01 KS |
1182 | if (path[level].bp_index == 0) |
1183 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1184 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 KS |
1185 | } else { |
1186 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1187 | nilfs_btree_node_delete(node, path[level].bp_index, |
1188 | keyp, ptrp, | |
1189 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
17c76b01 KS |
1190 | } |
1191 | } | |
1192 | ||
e7c274f8 | 1193 | static void nilfs_btree_borrow_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1194 | struct nilfs_btree_path *path, |
1195 | int level, __u64 *keyp, __u64 *ptrp) | |
1196 | { | |
1197 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1198 | int nchildren, lnchildren, n, ncblk; |
17c76b01 KS |
1199 | |
1200 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1201 | ||
6d28f7ea RK |
1202 | node = nilfs_btree_get_nonroot_node(path, level); |
1203 | left = nilfs_btree_get_sib_node(path, level); | |
1204 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1205 | lnchildren = nilfs_btree_node_get_nchildren(left); | |
9b7b265c | 1206 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1207 | |
1208 | n = (nchildren + lnchildren) / 2 - nchildren; | |
1209 | ||
9b7b265c | 1210 | nilfs_btree_node_move_right(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1211 | |
1212 | if (!buffer_dirty(path[level].bp_bh)) | |
1213 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
1214 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
1215 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
1216 | ||
17c76b01 | 1217 | nilfs_btree_promote_key(btree, path, level + 1, |
6d28f7ea | 1218 | nilfs_btree_node_get_key(node, 0)); |
17c76b01 | 1219 | |
087d01b4 | 1220 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1221 | path[level].bp_sib_bh = NULL; |
1222 | path[level].bp_index += n; | |
1223 | } | |
1224 | ||
e7c274f8 | 1225 | static void nilfs_btree_borrow_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1226 | struct nilfs_btree_path *path, |
1227 | int level, __u64 *keyp, __u64 *ptrp) | |
1228 | { | |
1229 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1230 | int nchildren, rnchildren, n, ncblk; |
17c76b01 KS |
1231 | |
1232 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1233 | ||
6d28f7ea RK |
1234 | node = nilfs_btree_get_nonroot_node(path, level); |
1235 | right = nilfs_btree_get_sib_node(path, level); | |
1236 | nchildren = nilfs_btree_node_get_nchildren(node); | |
1237 | rnchildren = nilfs_btree_node_get_nchildren(right); | |
9b7b265c | 1238 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1239 | |
1240 | n = (nchildren + rnchildren) / 2 - nchildren; | |
1241 | ||
9b7b265c | 1242 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1243 | |
1244 | if (!buffer_dirty(path[level].bp_bh)) | |
1245 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
1246 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
1247 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
1248 | ||
17c76b01 KS |
1249 | path[level + 1].bp_index++; |
1250 | nilfs_btree_promote_key(btree, path, level + 1, | |
6d28f7ea | 1251 | nilfs_btree_node_get_key(right, 0)); |
17c76b01 KS |
1252 | path[level + 1].bp_index--; |
1253 | ||
087d01b4 | 1254 | brelse(path[level].bp_sib_bh); |
17c76b01 KS |
1255 | path[level].bp_sib_bh = NULL; |
1256 | } | |
1257 | ||
e7c274f8 | 1258 | static void nilfs_btree_concat_left(struct nilfs_bmap *btree, |
17c76b01 KS |
1259 | struct nilfs_btree_path *path, |
1260 | int level, __u64 *keyp, __u64 *ptrp) | |
1261 | { | |
1262 | struct nilfs_btree_node *node, *left; | |
9b7b265c | 1263 | int n, ncblk; |
17c76b01 KS |
1264 | |
1265 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1266 | ||
6d28f7ea RK |
1267 | node = nilfs_btree_get_nonroot_node(path, level); |
1268 | left = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1269 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1270 | |
6d28f7ea | 1271 | n = nilfs_btree_node_get_nchildren(node); |
17c76b01 | 1272 | |
9b7b265c | 1273 | nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); |
17c76b01 KS |
1274 | |
1275 | if (!buffer_dirty(path[level].bp_sib_bh)) | |
1276 | nilfs_btnode_mark_dirty(path[level].bp_sib_bh); | |
1277 | ||
9f098900 | 1278 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1279 | path[level].bp_bh = path[level].bp_sib_bh; |
1280 | path[level].bp_sib_bh = NULL; | |
6d28f7ea | 1281 | path[level].bp_index += nilfs_btree_node_get_nchildren(left); |
17c76b01 KS |
1282 | } |
1283 | ||
e7c274f8 | 1284 | static void nilfs_btree_concat_right(struct nilfs_bmap *btree, |
17c76b01 KS |
1285 | struct nilfs_btree_path *path, |
1286 | int level, __u64 *keyp, __u64 *ptrp) | |
1287 | { | |
1288 | struct nilfs_btree_node *node, *right; | |
9b7b265c | 1289 | int n, ncblk; |
17c76b01 KS |
1290 | |
1291 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1292 | ||
6d28f7ea RK |
1293 | node = nilfs_btree_get_nonroot_node(path, level); |
1294 | right = nilfs_btree_get_sib_node(path, level); | |
9b7b265c | 1295 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1296 | |
6d28f7ea | 1297 | n = nilfs_btree_node_get_nchildren(right); |
17c76b01 | 1298 | |
9b7b265c | 1299 | nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); |
17c76b01 KS |
1300 | |
1301 | if (!buffer_dirty(path[level].bp_bh)) | |
1302 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
1303 | ||
9f098900 | 1304 | nilfs_btnode_delete(path[level].bp_sib_bh); |
17c76b01 KS |
1305 | path[level].bp_sib_bh = NULL; |
1306 | path[level + 1].bp_index++; | |
1307 | } | |
1308 | ||
e7c274f8 | 1309 | static void nilfs_btree_shrink(struct nilfs_bmap *btree, |
17c76b01 KS |
1310 | struct nilfs_btree_path *path, |
1311 | int level, __u64 *keyp, __u64 *ptrp) | |
1312 | { | |
1313 | struct nilfs_btree_node *root, *child; | |
9b7b265c | 1314 | int n, ncblk; |
17c76b01 KS |
1315 | |
1316 | nilfs_btree_do_delete(btree, path, level, keyp, ptrp); | |
1317 | ||
17c76b01 | 1318 | root = nilfs_btree_get_root(btree); |
6d28f7ea | 1319 | child = nilfs_btree_get_nonroot_node(path, level); |
9b7b265c | 1320 | ncblk = nilfs_btree_nchildren_per_block(btree); |
17c76b01 | 1321 | |
9b7b265c RK |
1322 | nilfs_btree_node_delete(root, 0, NULL, NULL, |
1323 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
6d28f7ea RK |
1324 | nilfs_btree_node_set_level(root, level); |
1325 | n = nilfs_btree_node_get_nchildren(child); | |
9b7b265c RK |
1326 | nilfs_btree_node_move_left(root, child, n, |
1327 | NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk); | |
17c76b01 | 1328 | |
9f098900 | 1329 | nilfs_btnode_delete(path[level].bp_bh); |
17c76b01 KS |
1330 | path[level].bp_bh = NULL; |
1331 | } | |
1332 | ||
1333 | ||
e7c274f8 | 1334 | static int nilfs_btree_prepare_delete(struct nilfs_bmap *btree, |
17c76b01 KS |
1335 | struct nilfs_btree_path *path, |
1336 | int *levelp, | |
2e0c2c73 RK |
1337 | struct nilfs_bmap_stats *stats, |
1338 | struct inode *dat) | |
17c76b01 KS |
1339 | { |
1340 | struct buffer_head *bh; | |
1341 | struct nilfs_btree_node *node, *parent, *sib; | |
1342 | __u64 sibptr; | |
9b7b265c | 1343 | int pindex, level, ncmin, ncmax, ncblk, ret; |
17c76b01 KS |
1344 | |
1345 | ret = 0; | |
1346 | stats->bs_nblocks = 0; | |
ea64ab87 | 1347 | ncmin = NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree)); |
9b7b265c | 1348 | ncblk = nilfs_btree_nchildren_per_block(btree); |
ea64ab87 | 1349 | |
17c76b01 KS |
1350 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; |
1351 | level < nilfs_btree_height(btree) - 1; | |
1352 | level++) { | |
6d28f7ea | 1353 | node = nilfs_btree_get_nonroot_node(path, level); |
17c76b01 | 1354 | path[level].bp_oldreq.bpr_ptr = |
9b7b265c RK |
1355 | nilfs_btree_node_get_ptr(node, path[level].bp_index, |
1356 | ncblk); | |
e7c274f8 | 1357 | ret = nilfs_bmap_prepare_end_ptr(btree, |
2e0c2c73 | 1358 | &path[level].bp_oldreq, dat); |
d4b96157 RK |
1359 | if (ret < 0) |
1360 | goto err_out_child_node; | |
17c76b01 | 1361 | |
ea64ab87 | 1362 | if (nilfs_btree_node_get_nchildren(node) > ncmin) { |
17c76b01 KS |
1363 | path[level].bp_op = nilfs_btree_do_delete; |
1364 | stats->bs_nblocks++; | |
1365 | goto out; | |
1366 | } | |
1367 | ||
9b7b265c | 1368 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 KS |
1369 | pindex = path[level + 1].bp_index; |
1370 | ||
1371 | if (pindex > 0) { | |
1372 | /* left sibling */ | |
9b7b265c RK |
1373 | sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1, |
1374 | ncmax); | |
f198dbb9 | 1375 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1376 | if (ret < 0) |
1377 | goto err_out_curr_node; | |
1378 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1379 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1380 | path[level].bp_sib_bh = bh; |
1381 | path[level].bp_op = nilfs_btree_borrow_left; | |
1382 | stats->bs_nblocks++; | |
1383 | goto out; | |
1384 | } else { | |
1385 | path[level].bp_sib_bh = bh; | |
1386 | path[level].bp_op = nilfs_btree_concat_left; | |
1387 | stats->bs_nblocks++; | |
1388 | /* continue; */ | |
1389 | } | |
1390 | } else if (pindex < | |
6d28f7ea | 1391 | nilfs_btree_node_get_nchildren(parent) - 1) { |
17c76b01 | 1392 | /* right sibling */ |
9b7b265c RK |
1393 | sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1, |
1394 | ncmax); | |
f198dbb9 | 1395 | ret = nilfs_btree_get_block(btree, sibptr, &bh); |
17c76b01 KS |
1396 | if (ret < 0) |
1397 | goto err_out_curr_node; | |
1398 | sib = (struct nilfs_btree_node *)bh->b_data; | |
ea64ab87 | 1399 | if (nilfs_btree_node_get_nchildren(sib) > ncmin) { |
17c76b01 KS |
1400 | path[level].bp_sib_bh = bh; |
1401 | path[level].bp_op = nilfs_btree_borrow_right; | |
1402 | stats->bs_nblocks++; | |
1403 | goto out; | |
1404 | } else { | |
1405 | path[level].bp_sib_bh = bh; | |
1406 | path[level].bp_op = nilfs_btree_concat_right; | |
1407 | stats->bs_nblocks++; | |
1408 | /* continue; */ | |
1409 | } | |
1410 | } else { | |
1411 | /* no siblings */ | |
1412 | /* the only child of the root node */ | |
1f5abe7e | 1413 | WARN_ON(level != nilfs_btree_height(btree) - 2); |
6d28f7ea | 1414 | if (nilfs_btree_node_get_nchildren(node) - 1 <= |
17c76b01 KS |
1415 | NILFS_BTREE_ROOT_NCHILDREN_MAX) { |
1416 | path[level].bp_op = nilfs_btree_shrink; | |
1417 | stats->bs_nblocks += 2; | |
1418 | } else { | |
1419 | path[level].bp_op = nilfs_btree_do_delete; | |
1420 | stats->bs_nblocks++; | |
1421 | } | |
1422 | ||
1423 | goto out; | |
1424 | ||
1425 | } | |
1426 | } | |
1427 | ||
1428 | node = nilfs_btree_get_root(btree); | |
1429 | path[level].bp_oldreq.bpr_ptr = | |
9b7b265c RK |
1430 | nilfs_btree_node_get_ptr(node, path[level].bp_index, |
1431 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
d4b96157 | 1432 | |
e7c274f8 | 1433 | ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat); |
d4b96157 RK |
1434 | if (ret < 0) |
1435 | goto err_out_child_node; | |
1436 | ||
17c76b01 KS |
1437 | /* child of the root node is deleted */ |
1438 | path[level].bp_op = nilfs_btree_do_delete; | |
1439 | stats->bs_nblocks++; | |
1440 | ||
1441 | /* success */ | |
1442 | out: | |
1443 | *levelp = level; | |
1444 | return ret; | |
1445 | ||
1446 | /* error */ | |
1447 | err_out_curr_node: | |
e7c274f8 | 1448 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1449 | err_out_child_node: |
1450 | for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) { | |
087d01b4 | 1451 | brelse(path[level].bp_sib_bh); |
e7c274f8 | 1452 | nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); |
17c76b01 KS |
1453 | } |
1454 | *levelp = level; | |
1455 | stats->bs_nblocks = 0; | |
1456 | return ret; | |
1457 | } | |
1458 | ||
e7c274f8 | 1459 | static void nilfs_btree_commit_delete(struct nilfs_bmap *btree, |
17c76b01 | 1460 | struct nilfs_btree_path *path, |
2e0c2c73 | 1461 | int maxlevel, struct inode *dat) |
17c76b01 KS |
1462 | { |
1463 | int level; | |
1464 | ||
1465 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { | |
e7c274f8 | 1466 | nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat); |
8acfbf09 | 1467 | path[level].bp_op(btree, path, level, NULL, NULL); |
17c76b01 KS |
1468 | } |
1469 | ||
e7c274f8 RK |
1470 | if (!nilfs_bmap_dirty(btree)) |
1471 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1472 | } |
1473 | ||
e7c274f8 | 1474 | static int nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1475 | |
1476 | { | |
17c76b01 KS |
1477 | struct nilfs_btree_path *path; |
1478 | struct nilfs_bmap_stats stats; | |
2e0c2c73 | 1479 | struct inode *dat; |
17c76b01 KS |
1480 | int level, ret; |
1481 | ||
6d28f7ea | 1482 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1483 | if (path == NULL) |
1484 | return -ENOMEM; | |
f905440f | 1485 | |
17c76b01 KS |
1486 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, |
1487 | NILFS_BTREE_LEVEL_NODE_MIN); | |
1488 | if (ret < 0) | |
1489 | goto out; | |
1490 | ||
2e0c2c73 | 1491 | |
e7c274f8 | 1492 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
2e0c2c73 RK |
1493 | |
1494 | ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat); | |
17c76b01 KS |
1495 | if (ret < 0) |
1496 | goto out; | |
2e0c2c73 | 1497 | nilfs_btree_commit_delete(btree, path, level, dat); |
e7c274f8 | 1498 | nilfs_bmap_sub_blocks(btree, stats.bs_nblocks); |
17c76b01 KS |
1499 | |
1500 | out: | |
6d28f7ea | 1501 | nilfs_btree_free_path(path); |
17c76b01 KS |
1502 | return ret; |
1503 | } | |
1504 | ||
e7c274f8 | 1505 | static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) |
17c76b01 | 1506 | { |
17c76b01 KS |
1507 | struct nilfs_btree_path *path; |
1508 | int ret; | |
1509 | ||
6d28f7ea | 1510 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1511 | if (path == NULL) |
1512 | return -ENOMEM; | |
17c76b01 KS |
1513 | |
1514 | ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); | |
1515 | ||
6d28f7ea | 1516 | nilfs_btree_free_path(path); |
17c76b01 KS |
1517 | |
1518 | return ret; | |
1519 | } | |
1520 | ||
e7c274f8 | 1521 | static int nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key) |
17c76b01 KS |
1522 | { |
1523 | struct buffer_head *bh; | |
17c76b01 KS |
1524 | struct nilfs_btree_node *root, *node; |
1525 | __u64 maxkey, nextmaxkey; | |
1526 | __u64 ptr; | |
1527 | int nchildren, ret; | |
1528 | ||
17c76b01 KS |
1529 | root = nilfs_btree_get_root(btree); |
1530 | switch (nilfs_btree_height(btree)) { | |
1531 | case 2: | |
1532 | bh = NULL; | |
1533 | node = root; | |
1534 | break; | |
1535 | case 3: | |
6d28f7ea | 1536 | nchildren = nilfs_btree_node_get_nchildren(root); |
17c76b01 KS |
1537 | if (nchildren > 1) |
1538 | return 0; | |
9b7b265c RK |
1539 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1540 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1541 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1542 | if (ret < 0) |
1543 | return ret; | |
1544 | node = (struct nilfs_btree_node *)bh->b_data; | |
1545 | break; | |
1546 | default: | |
1547 | return 0; | |
1548 | } | |
1549 | ||
6d28f7ea RK |
1550 | nchildren = nilfs_btree_node_get_nchildren(node); |
1551 | maxkey = nilfs_btree_node_get_key(node, nchildren - 1); | |
17c76b01 | 1552 | nextmaxkey = (nchildren > 1) ? |
6d28f7ea | 1553 | nilfs_btree_node_get_key(node, nchildren - 2) : 0; |
17c76b01 | 1554 | if (bh != NULL) |
087d01b4 | 1555 | brelse(bh); |
17c76b01 | 1556 | |
3033342a | 1557 | return (maxkey == key) && (nextmaxkey < NILFS_BMAP_LARGE_LOW); |
17c76b01 KS |
1558 | } |
1559 | ||
e7c274f8 | 1560 | static int nilfs_btree_gather_data(struct nilfs_bmap *btree, |
17c76b01 KS |
1561 | __u64 *keys, __u64 *ptrs, int nitems) |
1562 | { | |
1563 | struct buffer_head *bh; | |
17c76b01 KS |
1564 | struct nilfs_btree_node *node, *root; |
1565 | __le64 *dkeys; | |
1566 | __le64 *dptrs; | |
1567 | __u64 ptr; | |
9b7b265c | 1568 | int nchildren, ncmax, i, ret; |
17c76b01 | 1569 | |
17c76b01 KS |
1570 | root = nilfs_btree_get_root(btree); |
1571 | switch (nilfs_btree_height(btree)) { | |
1572 | case 2: | |
1573 | bh = NULL; | |
1574 | node = root; | |
9b7b265c | 1575 | ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX; |
17c76b01 KS |
1576 | break; |
1577 | case 3: | |
6d28f7ea | 1578 | nchildren = nilfs_btree_node_get_nchildren(root); |
1f5abe7e | 1579 | WARN_ON(nchildren > 1); |
9b7b265c RK |
1580 | ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, |
1581 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
f198dbb9 | 1582 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 KS |
1583 | if (ret < 0) |
1584 | return ret; | |
1585 | node = (struct nilfs_btree_node *)bh->b_data; | |
9b7b265c | 1586 | ncmax = nilfs_btree_nchildren_per_block(btree); |
17c76b01 KS |
1587 | break; |
1588 | default: | |
1589 | node = NULL; | |
1f5abe7e | 1590 | return -EINVAL; |
17c76b01 KS |
1591 | } |
1592 | ||
6d28f7ea | 1593 | nchildren = nilfs_btree_node_get_nchildren(node); |
17c76b01 KS |
1594 | if (nchildren < nitems) |
1595 | nitems = nchildren; | |
6d28f7ea | 1596 | dkeys = nilfs_btree_node_dkeys(node); |
9b7b265c | 1597 | dptrs = nilfs_btree_node_dptrs(node, ncmax); |
17c76b01 | 1598 | for (i = 0; i < nitems; i++) { |
25b8d7de RK |
1599 | keys[i] = le64_to_cpu(dkeys[i]); |
1600 | ptrs[i] = le64_to_cpu(dptrs[i]); | |
17c76b01 KS |
1601 | } |
1602 | ||
1603 | if (bh != NULL) | |
087d01b4 | 1604 | brelse(bh); |
17c76b01 KS |
1605 | |
1606 | return nitems; | |
1607 | } | |
1608 | ||
1609 | static int | |
e7c274f8 | 1610 | nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key, |
17c76b01 KS |
1611 | union nilfs_bmap_ptr_req *dreq, |
1612 | union nilfs_bmap_ptr_req *nreq, | |
1613 | struct buffer_head **bhp, | |
1614 | struct nilfs_bmap_stats *stats) | |
1615 | { | |
1616 | struct buffer_head *bh; | |
2e0c2c73 | 1617 | struct inode *dat = NULL; |
17c76b01 KS |
1618 | int ret; |
1619 | ||
17c76b01 KS |
1620 | stats->bs_nblocks = 0; |
1621 | ||
1622 | /* for data */ | |
1623 | /* cannot find near ptr */ | |
e7c274f8 | 1624 | if (NILFS_BMAP_USE_VBN(btree)) { |
7cde31d7 | 1625 | dreq->bpr_ptr = nilfs_btree_find_target_v(btree, NULL, key); |
e7c274f8 | 1626 | dat = nilfs_bmap_get_dat(btree); |
2e0c2c73 | 1627 | } |
7cde31d7 | 1628 | |
e7c274f8 | 1629 | ret = nilfs_bmap_prepare_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1630 | if (ret < 0) |
1631 | return ret; | |
1632 | ||
1633 | *bhp = NULL; | |
1634 | stats->bs_nblocks++; | |
1635 | if (nreq != NULL) { | |
1636 | nreq->bpr_ptr = dreq->bpr_ptr + 1; | |
e7c274f8 | 1637 | ret = nilfs_bmap_prepare_alloc_ptr(btree, nreq, dat); |
17c76b01 KS |
1638 | if (ret < 0) |
1639 | goto err_out_dreq; | |
1640 | ||
f198dbb9 | 1641 | ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh); |
17c76b01 KS |
1642 | if (ret < 0) |
1643 | goto err_out_nreq; | |
1644 | ||
1645 | *bhp = bh; | |
1646 | stats->bs_nblocks++; | |
1647 | } | |
1648 | ||
1649 | /* success */ | |
1650 | return 0; | |
1651 | ||
1652 | /* error */ | |
1653 | err_out_nreq: | |
e7c274f8 | 1654 | nilfs_bmap_abort_alloc_ptr(btree, nreq, dat); |
17c76b01 | 1655 | err_out_dreq: |
e7c274f8 | 1656 | nilfs_bmap_abort_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1657 | stats->bs_nblocks = 0; |
1658 | return ret; | |
1659 | ||
1660 | } | |
1661 | ||
1662 | static void | |
e7c274f8 | 1663 | nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 KS |
1664 | __u64 key, __u64 ptr, |
1665 | const __u64 *keys, const __u64 *ptrs, | |
3033342a | 1666 | int n, |
17c76b01 KS |
1667 | union nilfs_bmap_ptr_req *dreq, |
1668 | union nilfs_bmap_ptr_req *nreq, | |
1669 | struct buffer_head *bh) | |
1670 | { | |
17c76b01 | 1671 | struct nilfs_btree_node *node; |
2e0c2c73 | 1672 | struct inode *dat; |
17c76b01 | 1673 | __u64 tmpptr; |
9b7b265c | 1674 | int ncblk; |
17c76b01 KS |
1675 | |
1676 | /* free resources */ | |
e7c274f8 RK |
1677 | if (btree->b_ops->bop_clear != NULL) |
1678 | btree->b_ops->bop_clear(btree); | |
17c76b01 KS |
1679 | |
1680 | /* ptr must be a pointer to a buffer head. */ | |
1681 | set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr)); | |
1682 | ||
1683 | /* convert and insert */ | |
e7c274f8 RK |
1684 | dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; |
1685 | nilfs_btree_init(btree); | |
17c76b01 | 1686 | if (nreq != NULL) { |
e7c274f8 RK |
1687 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
1688 | nilfs_bmap_commit_alloc_ptr(btree, nreq, dat); | |
17c76b01 KS |
1689 | |
1690 | /* create child node at level 1 */ | |
17c76b01 | 1691 | node = (struct nilfs_btree_node *)bh->b_data; |
9b7b265c RK |
1692 | ncblk = nilfs_btree_nchildren_per_block(btree); |
1693 | nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs); | |
1694 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk); | |
17c76b01 KS |
1695 | if (!buffer_dirty(bh)) |
1696 | nilfs_btnode_mark_dirty(bh); | |
e7c274f8 RK |
1697 | if (!nilfs_bmap_dirty(btree)) |
1698 | nilfs_bmap_set_dirty(btree); | |
17c76b01 | 1699 | |
087d01b4 | 1700 | brelse(bh); |
17c76b01 KS |
1701 | |
1702 | /* create root node at level 2 */ | |
1703 | node = nilfs_btree_get_root(btree); | |
1704 | tmpptr = nreq->bpr_ptr; | |
9b7b265c RK |
1705 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 2, 1, |
1706 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1707 | &keys[0], &tmpptr); | |
17c76b01 | 1708 | } else { |
e7c274f8 | 1709 | nilfs_bmap_commit_alloc_ptr(btree, dreq, dat); |
17c76b01 KS |
1710 | |
1711 | /* create root node at level 1 */ | |
1712 | node = nilfs_btree_get_root(btree); | |
9b7b265c RK |
1713 | nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 1, n, |
1714 | NILFS_BTREE_ROOT_NCHILDREN_MAX, | |
1715 | keys, ptrs); | |
1716 | nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, | |
1717 | NILFS_BTREE_ROOT_NCHILDREN_MAX); | |
e7c274f8 RK |
1718 | if (!nilfs_bmap_dirty(btree)) |
1719 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
1720 | } |
1721 | ||
e7c274f8 | 1722 | if (NILFS_BMAP_USE_VBN(btree)) |
dc935be2 | 1723 | nilfs_bmap_set_target_v(btree, key, dreq->bpr_ptr); |
17c76b01 KS |
1724 | } |
1725 | ||
1726 | /** | |
1727 | * nilfs_btree_convert_and_insert - | |
1728 | * @bmap: | |
1729 | * @key: | |
1730 | * @ptr: | |
1731 | * @keys: | |
1732 | * @ptrs: | |
1733 | * @n: | |
17c76b01 | 1734 | */ |
e7c274f8 | 1735 | int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree, |
17c76b01 | 1736 | __u64 key, __u64 ptr, |
3033342a | 1737 | const __u64 *keys, const __u64 *ptrs, int n) |
17c76b01 KS |
1738 | { |
1739 | struct buffer_head *bh; | |
1740 | union nilfs_bmap_ptr_req dreq, nreq, *di, *ni; | |
1741 | struct nilfs_bmap_stats stats; | |
1742 | int ret; | |
1743 | ||
1744 | if (n + 1 <= NILFS_BTREE_ROOT_NCHILDREN_MAX) { | |
1745 | di = &dreq; | |
1746 | ni = NULL; | |
1747 | } else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX( | |
e7c274f8 | 1748 | 1 << btree->b_inode->i_blkbits)) { |
17c76b01 KS |
1749 | di = &dreq; |
1750 | ni = &nreq; | |
1751 | } else { | |
1752 | di = NULL; | |
1753 | ni = NULL; | |
1754 | BUG(); | |
1755 | } | |
1756 | ||
e7c274f8 | 1757 | ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh, |
17c76b01 KS |
1758 | &stats); |
1759 | if (ret < 0) | |
1760 | return ret; | |
e7c274f8 | 1761 | nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n, |
3033342a | 1762 | di, ni, bh); |
e7c274f8 | 1763 | nilfs_bmap_add_blocks(btree, stats.bs_nblocks); |
17c76b01 KS |
1764 | return 0; |
1765 | } | |
1766 | ||
e7c274f8 | 1767 | static int nilfs_btree_propagate_p(struct nilfs_bmap *btree, |
17c76b01 KS |
1768 | struct nilfs_btree_path *path, |
1769 | int level, | |
1770 | struct buffer_head *bh) | |
1771 | { | |
1772 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1773 | !buffer_dirty(path[level].bp_bh)) | |
1774 | nilfs_btnode_mark_dirty(path[level].bp_bh); | |
1775 | ||
1776 | return 0; | |
1777 | } | |
1778 | ||
e7c274f8 | 1779 | static int nilfs_btree_prepare_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1780 | struct nilfs_btree_path *path, |
2e0c2c73 | 1781 | int level, struct inode *dat) |
17c76b01 KS |
1782 | { |
1783 | struct nilfs_btree_node *parent; | |
9b7b265c | 1784 | int ncmax, ret; |
17c76b01 | 1785 | |
9b7b265c | 1786 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
17c76b01 | 1787 | path[level].bp_oldreq.bpr_ptr = |
9b7b265c RK |
1788 | nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, |
1789 | ncmax); | |
17c76b01 | 1790 | path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1; |
2e0c2c73 RK |
1791 | ret = nilfs_dat_prepare_update(dat, &path[level].bp_oldreq.bpr_req, |
1792 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1793 | if (ret < 0) |
1794 | return ret; | |
1795 | ||
1796 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1797 | path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr; | |
1798 | path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr; | |
1799 | path[level].bp_ctxt.bh = path[level].bp_bh; | |
1800 | ret = nilfs_btnode_prepare_change_key( | |
e7c274f8 | 1801 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1802 | &path[level].bp_ctxt); |
1803 | if (ret < 0) { | |
2e0c2c73 RK |
1804 | nilfs_dat_abort_update(dat, |
1805 | &path[level].bp_oldreq.bpr_req, | |
1806 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1807 | return ret; |
1808 | } | |
1809 | } | |
1810 | ||
1811 | return 0; | |
1812 | } | |
1813 | ||
e7c274f8 | 1814 | static void nilfs_btree_commit_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1815 | struct nilfs_btree_path *path, |
2e0c2c73 | 1816 | int level, struct inode *dat) |
17c76b01 KS |
1817 | { |
1818 | struct nilfs_btree_node *parent; | |
9b7b265c | 1819 | int ncmax; |
17c76b01 | 1820 | |
2e0c2c73 RK |
1821 | nilfs_dat_commit_update(dat, &path[level].bp_oldreq.bpr_req, |
1822 | &path[level].bp_newreq.bpr_req, | |
e7c274f8 | 1823 | btree->b_ptr_type == NILFS_BMAP_PTR_VS); |
17c76b01 KS |
1824 | |
1825 | if (buffer_nilfs_node(path[level].bp_bh)) { | |
1826 | nilfs_btnode_commit_change_key( | |
e7c274f8 | 1827 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1828 | &path[level].bp_ctxt); |
1829 | path[level].bp_bh = path[level].bp_ctxt.bh; | |
1830 | } | |
1831 | set_buffer_nilfs_volatile(path[level].bp_bh); | |
1832 | ||
9b7b265c RK |
1833 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
1834 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, | |
1835 | path[level].bp_newreq.bpr_ptr, ncmax); | |
17c76b01 KS |
1836 | } |
1837 | ||
e7c274f8 | 1838 | static void nilfs_btree_abort_update_v(struct nilfs_bmap *btree, |
17c76b01 | 1839 | struct nilfs_btree_path *path, |
2e0c2c73 | 1840 | int level, struct inode *dat) |
17c76b01 | 1841 | { |
2e0c2c73 RK |
1842 | nilfs_dat_abort_update(dat, &path[level].bp_oldreq.bpr_req, |
1843 | &path[level].bp_newreq.bpr_req); | |
17c76b01 KS |
1844 | if (buffer_nilfs_node(path[level].bp_bh)) |
1845 | nilfs_btnode_abort_change_key( | |
e7c274f8 | 1846 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
1847 | &path[level].bp_ctxt); |
1848 | } | |
1849 | ||
e7c274f8 | 1850 | static int nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 1851 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
1852 | int minlevel, int *maxlevelp, |
1853 | struct inode *dat) | |
17c76b01 KS |
1854 | { |
1855 | int level, ret; | |
1856 | ||
1857 | level = minlevel; | |
1858 | if (!buffer_nilfs_volatile(path[level].bp_bh)) { | |
2e0c2c73 | 1859 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1860 | if (ret < 0) |
1861 | return ret; | |
1862 | } | |
1863 | while ((++level < nilfs_btree_height(btree) - 1) && | |
1864 | !buffer_dirty(path[level].bp_bh)) { | |
1865 | ||
1f5abe7e | 1866 | WARN_ON(buffer_nilfs_volatile(path[level].bp_bh)); |
2e0c2c73 | 1867 | ret = nilfs_btree_prepare_update_v(btree, path, level, dat); |
17c76b01 KS |
1868 | if (ret < 0) |
1869 | goto out; | |
1870 | } | |
1871 | ||
1872 | /* success */ | |
17c76b01 KS |
1873 | *maxlevelp = level - 1; |
1874 | return 0; | |
1875 | ||
1876 | /* error */ | |
1877 | out: | |
1878 | while (--level > minlevel) | |
2e0c2c73 | 1879 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 | 1880 | if (!buffer_nilfs_volatile(path[level].bp_bh)) |
2e0c2c73 | 1881 | nilfs_btree_abort_update_v(btree, path, level, dat); |
17c76b01 KS |
1882 | return ret; |
1883 | } | |
1884 | ||
e7c274f8 | 1885 | static void nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 1886 | struct nilfs_btree_path *path, |
2e0c2c73 RK |
1887 | int minlevel, int maxlevel, |
1888 | struct buffer_head *bh, | |
1889 | struct inode *dat) | |
17c76b01 KS |
1890 | { |
1891 | int level; | |
1892 | ||
1893 | if (!buffer_nilfs_volatile(path[minlevel].bp_bh)) | |
2e0c2c73 | 1894 | nilfs_btree_commit_update_v(btree, path, minlevel, dat); |
17c76b01 KS |
1895 | |
1896 | for (level = minlevel + 1; level <= maxlevel; level++) | |
2e0c2c73 | 1897 | nilfs_btree_commit_update_v(btree, path, level, dat); |
17c76b01 KS |
1898 | } |
1899 | ||
e7c274f8 | 1900 | static int nilfs_btree_propagate_v(struct nilfs_bmap *btree, |
17c76b01 | 1901 | struct nilfs_btree_path *path, |
2e0c2c73 | 1902 | int level, struct buffer_head *bh) |
17c76b01 | 1903 | { |
308f4419 | 1904 | int maxlevel = 0, ret; |
17c76b01 | 1905 | struct nilfs_btree_node *parent; |
e7c274f8 | 1906 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 | 1907 | __u64 ptr; |
9b7b265c | 1908 | int ncmax; |
17c76b01 KS |
1909 | |
1910 | get_bh(bh); | |
1911 | path[level].bp_bh = bh; | |
2e0c2c73 RK |
1912 | ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel, |
1913 | dat); | |
17c76b01 KS |
1914 | if (ret < 0) |
1915 | goto out; | |
1916 | ||
1917 | if (buffer_nilfs_volatile(path[level].bp_bh)) { | |
9b7b265c RK |
1918 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
1919 | ptr = nilfs_btree_node_get_ptr(parent, | |
1920 | path[level + 1].bp_index, | |
1921 | ncmax); | |
2e0c2c73 | 1922 | ret = nilfs_dat_mark_dirty(dat, ptr); |
17c76b01 KS |
1923 | if (ret < 0) |
1924 | goto out; | |
1925 | } | |
1926 | ||
2e0c2c73 | 1927 | nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); |
17c76b01 KS |
1928 | |
1929 | out: | |
1930 | brelse(path[level].bp_bh); | |
1931 | path[level].bp_bh = NULL; | |
1932 | return ret; | |
1933 | } | |
1934 | ||
e7c274f8 | 1935 | static int nilfs_btree_propagate(struct nilfs_bmap *btree, |
17c76b01 KS |
1936 | struct buffer_head *bh) |
1937 | { | |
17c76b01 KS |
1938 | struct nilfs_btree_path *path; |
1939 | struct nilfs_btree_node *node; | |
1940 | __u64 key; | |
1941 | int level, ret; | |
1942 | ||
1f5abe7e | 1943 | WARN_ON(!buffer_dirty(bh)); |
17c76b01 | 1944 | |
6d28f7ea | 1945 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
1946 | if (path == NULL) |
1947 | return -ENOMEM; | |
17c76b01 KS |
1948 | |
1949 | if (buffer_nilfs_node(bh)) { | |
1950 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
1951 | key = nilfs_btree_node_get_key(node, 0); |
1952 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 1953 | } else { |
e7c274f8 | 1954 | key = nilfs_bmap_data_get_key(btree, bh); |
17c76b01 KS |
1955 | level = NILFS_BTREE_LEVEL_DATA; |
1956 | } | |
1957 | ||
1958 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1); | |
1959 | if (ret < 0) { | |
1f5abe7e | 1960 | if (unlikely(ret == -ENOENT)) |
17c76b01 KS |
1961 | printk(KERN_CRIT "%s: key = %llu, level == %d\n", |
1962 | __func__, (unsigned long long)key, level); | |
17c76b01 KS |
1963 | goto out; |
1964 | } | |
1965 | ||
e7c274f8 | 1966 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
1967 | nilfs_btree_propagate_v(btree, path, level, bh) : |
1968 | nilfs_btree_propagate_p(btree, path, level, bh); | |
17c76b01 KS |
1969 | |
1970 | out: | |
6d28f7ea | 1971 | nilfs_btree_free_path(path); |
17c76b01 KS |
1972 | |
1973 | return ret; | |
1974 | } | |
1975 | ||
e7c274f8 | 1976 | static int nilfs_btree_propagate_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
1977 | struct buffer_head *bh) |
1978 | { | |
e7c274f8 | 1979 | return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr); |
17c76b01 KS |
1980 | } |
1981 | ||
e7c274f8 | 1982 | static void nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree, |
17c76b01 KS |
1983 | struct list_head *lists, |
1984 | struct buffer_head *bh) | |
1985 | { | |
1986 | struct list_head *head; | |
1987 | struct buffer_head *cbh; | |
1988 | struct nilfs_btree_node *node, *cnode; | |
1989 | __u64 key, ckey; | |
1990 | int level; | |
1991 | ||
1992 | get_bh(bh); | |
1993 | node = (struct nilfs_btree_node *)bh->b_data; | |
6d28f7ea RK |
1994 | key = nilfs_btree_node_get_key(node, 0); |
1995 | level = nilfs_btree_node_get_level(node); | |
cfa913a5 RK |
1996 | if (level < NILFS_BTREE_LEVEL_NODE_MIN || |
1997 | level >= NILFS_BTREE_LEVEL_MAX) { | |
1998 | dump_stack(); | |
1999 | printk(KERN_WARNING | |
2000 | "%s: invalid btree level: %d (key=%llu, ino=%lu, " | |
2001 | "blocknr=%llu)\n", | |
2002 | __func__, level, (unsigned long long)key, | |
e7c274f8 | 2003 | NILFS_BMAP_I(btree)->vfs_inode.i_ino, |
cfa913a5 RK |
2004 | (unsigned long long)bh->b_blocknr); |
2005 | return; | |
2006 | } | |
2007 | ||
17c76b01 KS |
2008 | list_for_each(head, &lists[level]) { |
2009 | cbh = list_entry(head, struct buffer_head, b_assoc_buffers); | |
2010 | cnode = (struct nilfs_btree_node *)cbh->b_data; | |
6d28f7ea | 2011 | ckey = nilfs_btree_node_get_key(cnode, 0); |
17c76b01 KS |
2012 | if (key < ckey) |
2013 | break; | |
2014 | } | |
2015 | list_add_tail(&bh->b_assoc_buffers, head); | |
2016 | } | |
2017 | ||
e7c274f8 | 2018 | static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree, |
17c76b01 KS |
2019 | struct list_head *listp) |
2020 | { | |
e7c274f8 | 2021 | struct address_space *btcache = &NILFS_BMAP_I(btree)->i_btnode_cache; |
17c76b01 KS |
2022 | struct list_head lists[NILFS_BTREE_LEVEL_MAX]; |
2023 | struct pagevec pvec; | |
2024 | struct buffer_head *bh, *head; | |
2025 | pgoff_t index = 0; | |
2026 | int level, i; | |
2027 | ||
2028 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2029 | level < NILFS_BTREE_LEVEL_MAX; | |
2030 | level++) | |
2031 | INIT_LIST_HEAD(&lists[level]); | |
2032 | ||
2033 | pagevec_init(&pvec, 0); | |
2034 | ||
2035 | while (pagevec_lookup_tag(&pvec, btcache, &index, PAGECACHE_TAG_DIRTY, | |
2036 | PAGEVEC_SIZE)) { | |
2037 | for (i = 0; i < pagevec_count(&pvec); i++) { | |
2038 | bh = head = page_buffers(pvec.pages[i]); | |
2039 | do { | |
2040 | if (buffer_dirty(bh)) | |
2041 | nilfs_btree_add_dirty_buffer(btree, | |
2042 | lists, bh); | |
2043 | } while ((bh = bh->b_this_page) != head); | |
2044 | } | |
2045 | pagevec_release(&pvec); | |
2046 | cond_resched(); | |
2047 | } | |
2048 | ||
2049 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | |
2050 | level < NILFS_BTREE_LEVEL_MAX; | |
2051 | level++) | |
0935db74 | 2052 | list_splice_tail(&lists[level], listp); |
17c76b01 KS |
2053 | } |
2054 | ||
e7c274f8 | 2055 | static int nilfs_btree_assign_p(struct nilfs_bmap *btree, |
17c76b01 KS |
2056 | struct nilfs_btree_path *path, |
2057 | int level, | |
2058 | struct buffer_head **bh, | |
2059 | sector_t blocknr, | |
2060 | union nilfs_binfo *binfo) | |
2061 | { | |
2062 | struct nilfs_btree_node *parent; | |
2063 | __u64 key; | |
2064 | __u64 ptr; | |
9b7b265c | 2065 | int ncmax, ret; |
17c76b01 | 2066 | |
9b7b265c RK |
2067 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2068 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2069 | ncmax); | |
17c76b01 KS |
2070 | if (buffer_nilfs_node(*bh)) { |
2071 | path[level].bp_ctxt.oldkey = ptr; | |
2072 | path[level].bp_ctxt.newkey = blocknr; | |
2073 | path[level].bp_ctxt.bh = *bh; | |
2074 | ret = nilfs_btnode_prepare_change_key( | |
e7c274f8 | 2075 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
2076 | &path[level].bp_ctxt); |
2077 | if (ret < 0) | |
2078 | return ret; | |
2079 | nilfs_btnode_commit_change_key( | |
e7c274f8 | 2080 | &NILFS_BMAP_I(btree)->i_btnode_cache, |
17c76b01 KS |
2081 | &path[level].bp_ctxt); |
2082 | *bh = path[level].bp_ctxt.bh; | |
2083 | } | |
2084 | ||
9b7b265c RK |
2085 | nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, |
2086 | ncmax); | |
17c76b01 | 2087 | |
6d28f7ea | 2088 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2089 | /* on-disk format */ |
25b8d7de | 2090 | binfo->bi_dat.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2091 | binfo->bi_dat.bi_level = level; |
2092 | ||
2093 | return 0; | |
2094 | } | |
2095 | ||
e7c274f8 | 2096 | static int nilfs_btree_assign_v(struct nilfs_bmap *btree, |
17c76b01 KS |
2097 | struct nilfs_btree_path *path, |
2098 | int level, | |
2099 | struct buffer_head **bh, | |
2100 | sector_t blocknr, | |
2101 | union nilfs_binfo *binfo) | |
2102 | { | |
2103 | struct nilfs_btree_node *parent; | |
e7c274f8 | 2104 | struct inode *dat = nilfs_bmap_get_dat(btree); |
17c76b01 KS |
2105 | __u64 key; |
2106 | __u64 ptr; | |
2107 | union nilfs_bmap_ptr_req req; | |
9b7b265c | 2108 | int ncmax, ret; |
17c76b01 | 2109 | |
9b7b265c RK |
2110 | parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); |
2111 | ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, | |
2112 | ncmax); | |
17c76b01 | 2113 | req.bpr_ptr = ptr; |
2e0c2c73 RK |
2114 | ret = nilfs_dat_prepare_start(dat, &req.bpr_req); |
2115 | if (ret < 0) | |
17c76b01 | 2116 | return ret; |
2e0c2c73 | 2117 | nilfs_dat_commit_start(dat, &req.bpr_req, blocknr); |
17c76b01 | 2118 | |
6d28f7ea | 2119 | key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); |
17c76b01 | 2120 | /* on-disk format */ |
25b8d7de RK |
2121 | binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr); |
2122 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); | |
17c76b01 KS |
2123 | |
2124 | return 0; | |
2125 | } | |
2126 | ||
e7c274f8 | 2127 | static int nilfs_btree_assign(struct nilfs_bmap *btree, |
17c76b01 KS |
2128 | struct buffer_head **bh, |
2129 | sector_t blocknr, | |
2130 | union nilfs_binfo *binfo) | |
2131 | { | |
17c76b01 KS |
2132 | struct nilfs_btree_path *path; |
2133 | struct nilfs_btree_node *node; | |
2134 | __u64 key; | |
2135 | int level, ret; | |
2136 | ||
6d28f7ea | 2137 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2138 | if (path == NULL) |
2139 | return -ENOMEM; | |
17c76b01 KS |
2140 | |
2141 | if (buffer_nilfs_node(*bh)) { | |
2142 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea RK |
2143 | key = nilfs_btree_node_get_key(node, 0); |
2144 | level = nilfs_btree_node_get_level(node); | |
17c76b01 | 2145 | } else { |
e7c274f8 | 2146 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2147 | level = NILFS_BTREE_LEVEL_DATA; |
2148 | } | |
2149 | ||
2150 | ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1); | |
2151 | if (ret < 0) { | |
1f5abe7e | 2152 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2153 | goto out; |
2154 | } | |
2155 | ||
e7c274f8 | 2156 | ret = NILFS_BMAP_USE_VBN(btree) ? |
7cde31d7 RK |
2157 | nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : |
2158 | nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); | |
17c76b01 KS |
2159 | |
2160 | out: | |
6d28f7ea | 2161 | nilfs_btree_free_path(path); |
17c76b01 KS |
2162 | |
2163 | return ret; | |
2164 | } | |
2165 | ||
e7c274f8 | 2166 | static int nilfs_btree_assign_gc(struct nilfs_bmap *btree, |
17c76b01 KS |
2167 | struct buffer_head **bh, |
2168 | sector_t blocknr, | |
2169 | union nilfs_binfo *binfo) | |
2170 | { | |
17c76b01 KS |
2171 | struct nilfs_btree_node *node; |
2172 | __u64 key; | |
2173 | int ret; | |
2174 | ||
e7c274f8 | 2175 | ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr, |
2e0c2c73 | 2176 | blocknr); |
17c76b01 KS |
2177 | if (ret < 0) |
2178 | return ret; | |
2179 | ||
2180 | if (buffer_nilfs_node(*bh)) { | |
2181 | node = (struct nilfs_btree_node *)(*bh)->b_data; | |
6d28f7ea | 2182 | key = nilfs_btree_node_get_key(node, 0); |
17c76b01 | 2183 | } else |
e7c274f8 | 2184 | key = nilfs_bmap_data_get_key(btree, *bh); |
17c76b01 KS |
2185 | |
2186 | /* on-disk format */ | |
2187 | binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr); | |
25b8d7de | 2188 | binfo->bi_v.bi_blkoff = cpu_to_le64(key); |
17c76b01 KS |
2189 | |
2190 | return 0; | |
2191 | } | |
2192 | ||
e7c274f8 | 2193 | static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) |
17c76b01 KS |
2194 | { |
2195 | struct buffer_head *bh; | |
17c76b01 KS |
2196 | struct nilfs_btree_path *path; |
2197 | __u64 ptr; | |
2198 | int ret; | |
2199 | ||
6d28f7ea | 2200 | path = nilfs_btree_alloc_path(); |
17c76b01 KS |
2201 | if (path == NULL) |
2202 | return -ENOMEM; | |
17c76b01 KS |
2203 | |
2204 | ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1); | |
2205 | if (ret < 0) { | |
1f5abe7e | 2206 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2207 | goto out; |
2208 | } | |
f198dbb9 | 2209 | ret = nilfs_btree_get_block(btree, ptr, &bh); |
17c76b01 | 2210 | if (ret < 0) { |
1f5abe7e | 2211 | WARN_ON(ret == -ENOENT); |
17c76b01 KS |
2212 | goto out; |
2213 | } | |
2214 | ||
2215 | if (!buffer_dirty(bh)) | |
2216 | nilfs_btnode_mark_dirty(bh); | |
087d01b4 | 2217 | brelse(bh); |
e7c274f8 RK |
2218 | if (!nilfs_bmap_dirty(btree)) |
2219 | nilfs_bmap_set_dirty(btree); | |
17c76b01 KS |
2220 | |
2221 | out: | |
6d28f7ea | 2222 | nilfs_btree_free_path(path); |
17c76b01 KS |
2223 | return ret; |
2224 | } | |
2225 | ||
2226 | static const struct nilfs_bmap_operations nilfs_btree_ops = { | |
2227 | .bop_lookup = nilfs_btree_lookup, | |
c3a7abf0 | 2228 | .bop_lookup_contig = nilfs_btree_lookup_contig, |
17c76b01 KS |
2229 | .bop_insert = nilfs_btree_insert, |
2230 | .bop_delete = nilfs_btree_delete, | |
2231 | .bop_clear = NULL, | |
2232 | ||
2233 | .bop_propagate = nilfs_btree_propagate, | |
2234 | ||
2235 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2236 | ||
2237 | .bop_assign = nilfs_btree_assign, | |
2238 | .bop_mark = nilfs_btree_mark, | |
2239 | ||
2240 | .bop_last_key = nilfs_btree_last_key, | |
2241 | .bop_check_insert = NULL, | |
2242 | .bop_check_delete = nilfs_btree_check_delete, | |
2243 | .bop_gather_data = nilfs_btree_gather_data, | |
2244 | }; | |
2245 | ||
2246 | static const struct nilfs_bmap_operations nilfs_btree_ops_gc = { | |
2247 | .bop_lookup = NULL, | |
c3a7abf0 | 2248 | .bop_lookup_contig = NULL, |
17c76b01 KS |
2249 | .bop_insert = NULL, |
2250 | .bop_delete = NULL, | |
2251 | .bop_clear = NULL, | |
2252 | ||
2253 | .bop_propagate = nilfs_btree_propagate_gc, | |
2254 | ||
2255 | .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers, | |
2256 | ||
2257 | .bop_assign = nilfs_btree_assign_gc, | |
2258 | .bop_mark = NULL, | |
2259 | ||
2260 | .bop_last_key = NULL, | |
2261 | .bop_check_insert = NULL, | |
2262 | .bop_check_delete = NULL, | |
2263 | .bop_gather_data = NULL, | |
2264 | }; | |
2265 | ||
3033342a | 2266 | int nilfs_btree_init(struct nilfs_bmap *bmap) |
17c76b01 | 2267 | { |
17c76b01 | 2268 | bmap->b_ops = &nilfs_btree_ops; |
5ad2686e RK |
2269 | bmap->b_nchildren_per_block = |
2270 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
17c76b01 KS |
2271 | return 0; |
2272 | } | |
2273 | ||
2274 | void nilfs_btree_init_gc(struct nilfs_bmap *bmap) | |
2275 | { | |
17c76b01 | 2276 | bmap->b_ops = &nilfs_btree_ops_gc; |
5ad2686e RK |
2277 | bmap->b_nchildren_per_block = |
2278 | NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap)); | |
17c76b01 | 2279 | } |