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