2 * btree.c - NILFS B-tree.
4 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
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.
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.
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
20 * Written by Koji Sato <koji@osrg.net>.
23 #include <linux/slab.h>
24 #include <linux/string.h>
25 #include <linux/errno.h>
26 #include <linux/pagevec.h>
34 * struct nilfs_btree_path - A path on which B-tree operations are executed
35 * @bp_bh: buffer head of node block
36 * @bp_sib_bh: buffer head of sibling node block
37 * @bp_index: index of child node
38 * @bp_oldreq: ptr end request for old ptr
39 * @bp_newreq: ptr alloc request for new ptr
40 * @bp_op: rebalance operation
42 struct nilfs_btree_path {
43 struct buffer_head *bp_bh;
44 struct buffer_head *bp_sib_bh;
46 union nilfs_bmap_ptr_req bp_oldreq;
47 union nilfs_bmap_ptr_req bp_newreq;
48 struct nilfs_btnode_chkey_ctxt bp_ctxt;
49 void (*bp_op)(struct nilfs_btree *, struct nilfs_btree_path *,
50 int, __u64 *, __u64 *);
54 * B-tree path operations
57 static struct kmem_cache *nilfs_btree_path_cache;
59 int __init nilfs_btree_path_cache_init(void)
61 nilfs_btree_path_cache =
62 kmem_cache_create("nilfs2_btree_path_cache",
63 sizeof(struct nilfs_btree_path) *
64 NILFS_BTREE_LEVEL_MAX, 0, 0, NULL);
65 return (nilfs_btree_path_cache != NULL) ? 0 : -ENOMEM;
68 void nilfs_btree_path_cache_destroy(void)
70 kmem_cache_destroy(nilfs_btree_path_cache);
73 static inline struct nilfs_btree_path *
74 nilfs_btree_alloc_path(const struct nilfs_btree *btree)
76 return (struct nilfs_btree_path *)
77 kmem_cache_alloc(nilfs_btree_path_cache, GFP_NOFS);
80 static inline void nilfs_btree_free_path(const struct nilfs_btree *btree,
81 struct nilfs_btree_path *path)
83 kmem_cache_free(nilfs_btree_path_cache, path);
86 static void nilfs_btree_init_path(const struct nilfs_btree *btree,
87 struct nilfs_btree_path *path)
91 for (level = NILFS_BTREE_LEVEL_DATA;
92 level < NILFS_BTREE_LEVEL_MAX;
94 path[level].bp_bh = NULL;
95 path[level].bp_sib_bh = NULL;
96 path[level].bp_index = 0;
97 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
98 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
99 path[level].bp_op = NULL;
103 static void nilfs_btree_clear_path(const struct nilfs_btree *btree,
104 struct nilfs_btree_path *path)
108 for (level = NILFS_BTREE_LEVEL_DATA;
109 level < NILFS_BTREE_LEVEL_MAX;
111 if (path[level].bp_bh != NULL) {
112 brelse(path[level].bp_bh);
113 path[level].bp_bh = NULL;
115 /* sib_bh is released or deleted by prepare or commit
117 path[level].bp_sib_bh = NULL;
118 path[level].bp_index = 0;
119 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
120 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
121 path[level].bp_op = NULL;
126 * B-tree node operations
128 static int nilfs_btree_get_block(const struct nilfs_btree *btree, __u64 ptr,
129 struct buffer_head **bhp)
131 struct address_space *btnc =
132 &NILFS_BMAP_I((struct nilfs_bmap *)btree)->i_btnode_cache;
133 return nilfs_btnode_get(btnc, ptr, 0, bhp, 0);
136 static int nilfs_btree_get_new_block(const struct nilfs_btree *btree,
137 __u64 ptr, struct buffer_head **bhp)
139 struct address_space *btnc =
140 &NILFS_BMAP_I((struct nilfs_bmap *)btree)->i_btnode_cache;
143 ret = nilfs_btnode_get(btnc, ptr, 0, bhp, 1);
145 set_buffer_nilfs_volatile(*bhp);
150 nilfs_btree_node_get_flags(const struct nilfs_btree *btree,
151 const struct nilfs_btree_node *node)
153 return node->bn_flags;
157 nilfs_btree_node_set_flags(struct nilfs_btree *btree,
158 struct nilfs_btree_node *node,
161 node->bn_flags = flags;
164 static inline int nilfs_btree_node_root(const struct nilfs_btree *btree,
165 const struct nilfs_btree_node *node)
167 return nilfs_btree_node_get_flags(btree, node) & NILFS_BTREE_NODE_ROOT;
171 nilfs_btree_node_get_level(const struct nilfs_btree *btree,
172 const struct nilfs_btree_node *node)
174 return node->bn_level;
178 nilfs_btree_node_set_level(struct nilfs_btree *btree,
179 struct nilfs_btree_node *node,
182 node->bn_level = level;
186 nilfs_btree_node_get_nchildren(const struct nilfs_btree *btree,
187 const struct nilfs_btree_node *node)
189 return le16_to_cpu(node->bn_nchildren);
193 nilfs_btree_node_set_nchildren(struct nilfs_btree *btree,
194 struct nilfs_btree_node *node,
197 node->bn_nchildren = cpu_to_le16(nchildren);
201 nilfs_btree_node_size(const struct nilfs_btree *btree)
203 return 1 << btree->bt_bmap.b_inode->i_blkbits;
207 nilfs_btree_node_nchildren_min(const struct nilfs_btree *btree,
208 const struct nilfs_btree_node *node)
210 return nilfs_btree_node_root(btree, node) ?
211 NILFS_BTREE_ROOT_NCHILDREN_MIN :
212 NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree));
216 nilfs_btree_node_nchildren_max(const struct nilfs_btree *btree,
217 const struct nilfs_btree_node *node)
219 return nilfs_btree_node_root(btree, node) ?
220 NILFS_BTREE_ROOT_NCHILDREN_MAX :
221 NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(btree));
224 static inline __le64 *
225 nilfs_btree_node_dkeys(const struct nilfs_btree *btree,
226 const struct nilfs_btree_node *node)
228 return (__le64 *)((char *)(node + 1) +
229 (nilfs_btree_node_root(btree, node) ?
230 0 : NILFS_BTREE_NODE_EXTRA_PAD_SIZE));
233 static inline __le64 *
234 nilfs_btree_node_dptrs(const struct nilfs_btree *btree,
235 const struct nilfs_btree_node *node)
237 return (__le64 *)(nilfs_btree_node_dkeys(btree, node) +
238 nilfs_btree_node_nchildren_max(btree, node));
242 nilfs_btree_node_get_key(const struct nilfs_btree *btree,
243 const struct nilfs_btree_node *node, int index)
245 return nilfs_bmap_dkey_to_key(*(nilfs_btree_node_dkeys(btree, node) +
250 nilfs_btree_node_set_key(struct nilfs_btree *btree,
251 struct nilfs_btree_node *node, int index, __u64 key)
253 *(nilfs_btree_node_dkeys(btree, node) + index) =
254 nilfs_bmap_key_to_dkey(key);
258 nilfs_btree_node_get_ptr(const struct nilfs_btree *btree,
259 const struct nilfs_btree_node *node,
262 return nilfs_bmap_dptr_to_ptr(*(nilfs_btree_node_dptrs(btree, node) +
267 nilfs_btree_node_set_ptr(struct nilfs_btree *btree,
268 struct nilfs_btree_node *node,
272 *(nilfs_btree_node_dptrs(btree, node) + index) =
273 nilfs_bmap_ptr_to_dptr(ptr);
276 static void nilfs_btree_node_init(struct nilfs_btree *btree,
277 struct nilfs_btree_node *node,
278 int flags, int level, int nchildren,
279 const __u64 *keys, const __u64 *ptrs)
285 nilfs_btree_node_set_flags(btree, node, flags);
286 nilfs_btree_node_set_level(btree, node, level);
287 nilfs_btree_node_set_nchildren(btree, node, nchildren);
289 dkeys = nilfs_btree_node_dkeys(btree, node);
290 dptrs = nilfs_btree_node_dptrs(btree, node);
291 for (i = 0; i < nchildren; i++) {
292 dkeys[i] = nilfs_bmap_key_to_dkey(keys[i]);
293 dptrs[i] = nilfs_bmap_ptr_to_dptr(ptrs[i]);
297 /* Assume the buffer heads corresponding to left and right are locked. */
298 static void nilfs_btree_node_move_left(struct nilfs_btree *btree,
299 struct nilfs_btree_node *left,
300 struct nilfs_btree_node *right,
303 __le64 *ldkeys, *rdkeys;
304 __le64 *ldptrs, *rdptrs;
305 int lnchildren, rnchildren;
307 ldkeys = nilfs_btree_node_dkeys(btree, left);
308 ldptrs = nilfs_btree_node_dptrs(btree, left);
309 lnchildren = nilfs_btree_node_get_nchildren(btree, left);
311 rdkeys = nilfs_btree_node_dkeys(btree, right);
312 rdptrs = nilfs_btree_node_dptrs(btree, right);
313 rnchildren = nilfs_btree_node_get_nchildren(btree, right);
315 memcpy(ldkeys + lnchildren, rdkeys, n * sizeof(*rdkeys));
316 memcpy(ldptrs + lnchildren, rdptrs, n * sizeof(*rdptrs));
317 memmove(rdkeys, rdkeys + n, (rnchildren - n) * sizeof(*rdkeys));
318 memmove(rdptrs, rdptrs + n, (rnchildren - n) * sizeof(*rdptrs));
322 nilfs_btree_node_set_nchildren(btree, left, lnchildren);
323 nilfs_btree_node_set_nchildren(btree, right, rnchildren);
326 /* Assume that the buffer heads corresponding to left and right are locked. */
327 static void nilfs_btree_node_move_right(struct nilfs_btree *btree,
328 struct nilfs_btree_node *left,
329 struct nilfs_btree_node *right,
332 __le64 *ldkeys, *rdkeys;
333 __le64 *ldptrs, *rdptrs;
334 int lnchildren, rnchildren;
336 ldkeys = nilfs_btree_node_dkeys(btree, left);
337 ldptrs = nilfs_btree_node_dptrs(btree, left);
338 lnchildren = nilfs_btree_node_get_nchildren(btree, left);
340 rdkeys = nilfs_btree_node_dkeys(btree, right);
341 rdptrs = nilfs_btree_node_dptrs(btree, right);
342 rnchildren = nilfs_btree_node_get_nchildren(btree, right);
344 memmove(rdkeys + n, rdkeys, rnchildren * sizeof(*rdkeys));
345 memmove(rdptrs + n, rdptrs, rnchildren * sizeof(*rdptrs));
346 memcpy(rdkeys, ldkeys + lnchildren - n, n * sizeof(*rdkeys));
347 memcpy(rdptrs, ldptrs + lnchildren - n, n * sizeof(*rdptrs));
351 nilfs_btree_node_set_nchildren(btree, left, lnchildren);
352 nilfs_btree_node_set_nchildren(btree, right, rnchildren);
355 /* Assume that the buffer head corresponding to node is locked. */
356 static void nilfs_btree_node_insert(struct nilfs_btree *btree,
357 struct nilfs_btree_node *node,
358 __u64 key, __u64 ptr, int index)
364 dkeys = nilfs_btree_node_dkeys(btree, node);
365 dptrs = nilfs_btree_node_dptrs(btree, node);
366 nchildren = nilfs_btree_node_get_nchildren(btree, node);
367 if (index < nchildren) {
368 memmove(dkeys + index + 1, dkeys + index,
369 (nchildren - index) * sizeof(*dkeys));
370 memmove(dptrs + index + 1, dptrs + index,
371 (nchildren - index) * sizeof(*dptrs));
373 dkeys[index] = nilfs_bmap_key_to_dkey(key);
374 dptrs[index] = nilfs_bmap_ptr_to_dptr(ptr);
376 nilfs_btree_node_set_nchildren(btree, node, nchildren);
379 /* Assume that the buffer head corresponding to node is locked. */
380 static void nilfs_btree_node_delete(struct nilfs_btree *btree,
381 struct nilfs_btree_node *node,
382 __u64 *keyp, __u64 *ptrp, int index)
390 dkeys = nilfs_btree_node_dkeys(btree, node);
391 dptrs = nilfs_btree_node_dptrs(btree, node);
392 key = nilfs_bmap_dkey_to_key(dkeys[index]);
393 ptr = nilfs_bmap_dptr_to_ptr(dptrs[index]);
394 nchildren = nilfs_btree_node_get_nchildren(btree, node);
400 if (index < nchildren - 1) {
401 memmove(dkeys + index, dkeys + index + 1,
402 (nchildren - index - 1) * sizeof(*dkeys));
403 memmove(dptrs + index, dptrs + index + 1,
404 (nchildren - index - 1) * sizeof(*dptrs));
407 nilfs_btree_node_set_nchildren(btree, node, nchildren);
410 static int nilfs_btree_node_lookup(const struct nilfs_btree *btree,
411 const struct nilfs_btree_node *node,
412 __u64 key, int *indexp)
415 int index, low, high, s;
419 high = nilfs_btree_node_get_nchildren(btree, node) - 1;
422 while (low <= high) {
423 index = (low + high) / 2;
424 nkey = nilfs_btree_node_get_key(btree, node, index);
428 } else if (nkey < key) {
438 if (nilfs_btree_node_get_level(btree, node) >
439 NILFS_BTREE_LEVEL_NODE_MIN) {
440 if ((s > 0) && (index > 0))
451 static inline struct nilfs_btree_node *
452 nilfs_btree_get_root(const struct nilfs_btree *btree)
454 return (struct nilfs_btree_node *)btree->bt_bmap.b_u.u_data;
457 static inline struct nilfs_btree_node *
458 nilfs_btree_get_nonroot_node(const struct nilfs_btree *btree,
459 const struct nilfs_btree_path *path,
462 return (struct nilfs_btree_node *)path[level].bp_bh->b_data;
465 static inline struct nilfs_btree_node *
466 nilfs_btree_get_sib_node(const struct nilfs_btree *btree,
467 const struct nilfs_btree_path *path,
470 return (struct nilfs_btree_node *)path[level].bp_sib_bh->b_data;
473 static inline int nilfs_btree_height(const struct nilfs_btree *btree)
475 return nilfs_btree_node_get_level(btree, nilfs_btree_get_root(btree))
479 static inline struct nilfs_btree_node *
480 nilfs_btree_get_node(const struct nilfs_btree *btree,
481 const struct nilfs_btree_path *path,
484 return (level == nilfs_btree_height(btree) - 1) ?
485 nilfs_btree_get_root(btree) :
486 nilfs_btree_get_nonroot_node(btree, path, level);
489 static int nilfs_btree_do_lookup(const struct nilfs_btree *btree,
490 struct nilfs_btree_path *path,
491 __u64 key, __u64 *ptrp, int minlevel)
493 struct nilfs_btree_node *node;
495 int level, index, found, ret;
497 node = nilfs_btree_get_root(btree);
498 level = nilfs_btree_node_get_level(btree, node);
499 if ((level < minlevel) ||
500 (nilfs_btree_node_get_nchildren(btree, node) <= 0))
503 found = nilfs_btree_node_lookup(btree, node, key, &index);
504 ptr = nilfs_btree_node_get_ptr(btree, node, index);
505 path[level].bp_bh = NULL;
506 path[level].bp_index = index;
508 for (level--; level >= minlevel; level--) {
509 ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh);
512 node = nilfs_btree_get_nonroot_node(btree, path, level);
513 BUG_ON(level != nilfs_btree_node_get_level(btree, node));
515 found = nilfs_btree_node_lookup(btree, node, key,
519 if (index < nilfs_btree_node_nchildren_max(btree, node))
520 ptr = nilfs_btree_node_get_ptr(btree, node, index);
522 WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);
524 ptr = NILFS_BMAP_INVALID_PTR;
526 path[level].bp_index = index;
537 static int nilfs_btree_do_lookup_last(const struct nilfs_btree *btree,
538 struct nilfs_btree_path *path,
539 __u64 *keyp, __u64 *ptrp)
541 struct nilfs_btree_node *node;
543 int index, level, ret;
545 node = nilfs_btree_get_root(btree);
546 index = nilfs_btree_node_get_nchildren(btree, node) - 1;
549 level = nilfs_btree_node_get_level(btree, node);
550 ptr = nilfs_btree_node_get_ptr(btree, node, index);
551 path[level].bp_bh = NULL;
552 path[level].bp_index = index;
554 for (level--; level > 0; level--) {
555 ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh);
558 node = nilfs_btree_get_nonroot_node(btree, path, level);
559 BUG_ON(level != nilfs_btree_node_get_level(btree, node));
560 index = nilfs_btree_node_get_nchildren(btree, node) - 1;
561 ptr = nilfs_btree_node_get_ptr(btree, node, index);
562 path[level].bp_index = index;
566 *keyp = nilfs_btree_node_get_key(btree, node, index);
573 static int nilfs_btree_lookup(const struct nilfs_bmap *bmap,
574 __u64 key, int level, __u64 *ptrp)
576 struct nilfs_btree *btree;
577 struct nilfs_btree_path *path;
581 btree = (struct nilfs_btree *)bmap;
582 path = nilfs_btree_alloc_path(btree);
585 nilfs_btree_init_path(btree, path);
587 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level);
592 nilfs_btree_clear_path(btree, path);
593 nilfs_btree_free_path(btree, path);
598 static void nilfs_btree_promote_key(struct nilfs_btree *btree,
599 struct nilfs_btree_path *path,
600 int level, __u64 key)
602 if (level < nilfs_btree_height(btree) - 1) {
604 lock_buffer(path[level].bp_bh);
605 nilfs_btree_node_set_key(
607 nilfs_btree_get_nonroot_node(
609 path[level].bp_index, key);
610 if (!buffer_dirty(path[level].bp_bh))
611 nilfs_btnode_mark_dirty(path[level].bp_bh);
612 unlock_buffer(path[level].bp_bh);
613 } while ((path[level].bp_index == 0) &&
614 (++level < nilfs_btree_height(btree) - 1));
618 if (level == nilfs_btree_height(btree) - 1) {
619 nilfs_btree_node_set_key(btree,
620 nilfs_btree_get_root(btree),
621 path[level].bp_index, key);
625 static void nilfs_btree_do_insert(struct nilfs_btree *btree,
626 struct nilfs_btree_path *path,
627 int level, __u64 *keyp, __u64 *ptrp)
629 struct nilfs_btree_node *node;
631 if (level < nilfs_btree_height(btree) - 1) {
632 lock_buffer(path[level].bp_bh);
633 node = nilfs_btree_get_nonroot_node(btree, path, level);
634 nilfs_btree_node_insert(btree, node, *keyp, *ptrp,
635 path[level].bp_index);
636 if (!buffer_dirty(path[level].bp_bh))
637 nilfs_btnode_mark_dirty(path[level].bp_bh);
638 unlock_buffer(path[level].bp_bh);
640 if (path[level].bp_index == 0)
641 nilfs_btree_promote_key(btree, path, level + 1,
642 nilfs_btree_node_get_key(
645 node = nilfs_btree_get_root(btree);
646 nilfs_btree_node_insert(btree, node, *keyp, *ptrp,
647 path[level].bp_index);
651 static void nilfs_btree_carry_left(struct nilfs_btree *btree,
652 struct nilfs_btree_path *path,
653 int level, __u64 *keyp, __u64 *ptrp)
655 struct nilfs_btree_node *node, *left;
656 int nchildren, lnchildren, n, move;
658 lock_buffer(path[level].bp_bh);
659 lock_buffer(path[level].bp_sib_bh);
661 node = nilfs_btree_get_nonroot_node(btree, path, level);
662 left = nilfs_btree_get_sib_node(btree, path, level);
663 nchildren = nilfs_btree_node_get_nchildren(btree, node);
664 lnchildren = nilfs_btree_node_get_nchildren(btree, left);
667 n = (nchildren + lnchildren + 1) / 2 - lnchildren;
668 if (n > path[level].bp_index) {
669 /* move insert point */
674 nilfs_btree_node_move_left(btree, left, node, n);
676 if (!buffer_dirty(path[level].bp_bh))
677 nilfs_btnode_mark_dirty(path[level].bp_bh);
678 if (!buffer_dirty(path[level].bp_sib_bh))
679 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
681 unlock_buffer(path[level].bp_bh);
682 unlock_buffer(path[level].bp_sib_bh);
684 nilfs_btree_promote_key(btree, path, level + 1,
685 nilfs_btree_node_get_key(btree, node, 0));
688 brelse(path[level].bp_bh);
689 path[level].bp_bh = path[level].bp_sib_bh;
690 path[level].bp_sib_bh = NULL;
691 path[level].bp_index += lnchildren;
692 path[level + 1].bp_index--;
694 brelse(path[level].bp_sib_bh);
695 path[level].bp_sib_bh = NULL;
696 path[level].bp_index -= n;
699 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
702 static void nilfs_btree_carry_right(struct nilfs_btree *btree,
703 struct nilfs_btree_path *path,
704 int level, __u64 *keyp, __u64 *ptrp)
706 struct nilfs_btree_node *node, *right;
707 int nchildren, rnchildren, n, move;
709 lock_buffer(path[level].bp_bh);
710 lock_buffer(path[level].bp_sib_bh);
712 node = nilfs_btree_get_nonroot_node(btree, path, level);
713 right = nilfs_btree_get_sib_node(btree, path, level);
714 nchildren = nilfs_btree_node_get_nchildren(btree, node);
715 rnchildren = nilfs_btree_node_get_nchildren(btree, right);
718 n = (nchildren + rnchildren + 1) / 2 - rnchildren;
719 if (n > nchildren - path[level].bp_index) {
720 /* move insert point */
725 nilfs_btree_node_move_right(btree, node, right, n);
727 if (!buffer_dirty(path[level].bp_bh))
728 nilfs_btnode_mark_dirty(path[level].bp_bh);
729 if (!buffer_dirty(path[level].bp_sib_bh))
730 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
732 unlock_buffer(path[level].bp_bh);
733 unlock_buffer(path[level].bp_sib_bh);
735 path[level + 1].bp_index++;
736 nilfs_btree_promote_key(btree, path, level + 1,
737 nilfs_btree_node_get_key(btree, right, 0));
738 path[level + 1].bp_index--;
741 brelse(path[level].bp_bh);
742 path[level].bp_bh = path[level].bp_sib_bh;
743 path[level].bp_sib_bh = NULL;
744 path[level].bp_index -=
745 nilfs_btree_node_get_nchildren(btree, node);
746 path[level + 1].bp_index++;
748 brelse(path[level].bp_sib_bh);
749 path[level].bp_sib_bh = NULL;
752 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
755 static void nilfs_btree_split(struct nilfs_btree *btree,
756 struct nilfs_btree_path *path,
757 int level, __u64 *keyp, __u64 *ptrp)
759 struct nilfs_btree_node *node, *right;
762 int nchildren, n, move;
764 lock_buffer(path[level].bp_bh);
765 lock_buffer(path[level].bp_sib_bh);
767 node = nilfs_btree_get_nonroot_node(btree, path, level);
768 right = nilfs_btree_get_sib_node(btree, path, level);
769 nchildren = nilfs_btree_node_get_nchildren(btree, node);
772 n = (nchildren + 1) / 2;
773 if (n > nchildren - path[level].bp_index) {
778 nilfs_btree_node_move_right(btree, node, right, n);
780 if (!buffer_dirty(path[level].bp_bh))
781 nilfs_btnode_mark_dirty(path[level].bp_bh);
782 if (!buffer_dirty(path[level].bp_sib_bh))
783 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
785 unlock_buffer(path[level].bp_bh);
786 unlock_buffer(path[level].bp_sib_bh);
788 newkey = nilfs_btree_node_get_key(btree, right, 0);
789 newptr = path[level].bp_newreq.bpr_ptr;
792 path[level].bp_index -=
793 nilfs_btree_node_get_nchildren(btree, node);
794 nilfs_btree_node_insert(btree, right, *keyp, *ptrp,
795 path[level].bp_index);
797 *keyp = nilfs_btree_node_get_key(btree, right, 0);
798 *ptrp = path[level].bp_newreq.bpr_ptr;
800 brelse(path[level].bp_bh);
801 path[level].bp_bh = path[level].bp_sib_bh;
802 path[level].bp_sib_bh = NULL;
804 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
806 *keyp = nilfs_btree_node_get_key(btree, right, 0);
807 *ptrp = path[level].bp_newreq.bpr_ptr;
809 brelse(path[level].bp_sib_bh);
810 path[level].bp_sib_bh = NULL;
813 path[level + 1].bp_index++;
816 static void nilfs_btree_grow(struct nilfs_btree *btree,
817 struct nilfs_btree_path *path,
818 int level, __u64 *keyp, __u64 *ptrp)
820 struct nilfs_btree_node *root, *child;
823 lock_buffer(path[level].bp_sib_bh);
825 root = nilfs_btree_get_root(btree);
826 child = nilfs_btree_get_sib_node(btree, path, level);
828 n = nilfs_btree_node_get_nchildren(btree, root);
830 nilfs_btree_node_move_right(btree, root, child, n);
831 nilfs_btree_node_set_level(btree, root, level + 1);
833 if (!buffer_dirty(path[level].bp_sib_bh))
834 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
836 unlock_buffer(path[level].bp_sib_bh);
838 path[level].bp_bh = path[level].bp_sib_bh;
839 path[level].bp_sib_bh = NULL;
841 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
843 *keyp = nilfs_btree_node_get_key(btree, child, 0);
844 *ptrp = path[level].bp_newreq.bpr_ptr;
847 static __u64 nilfs_btree_find_near(const struct nilfs_btree *btree,
848 const struct nilfs_btree_path *path)
850 struct nilfs_btree_node *node;
854 return NILFS_BMAP_INVALID_PTR;
857 level = NILFS_BTREE_LEVEL_NODE_MIN;
858 if (path[level].bp_index > 0) {
859 node = nilfs_btree_get_node(btree, path, level);
860 return nilfs_btree_node_get_ptr(btree, node,
861 path[level].bp_index - 1);
865 level = NILFS_BTREE_LEVEL_NODE_MIN + 1;
866 if (level <= nilfs_btree_height(btree) - 1) {
867 node = nilfs_btree_get_node(btree, path, level);
868 return nilfs_btree_node_get_ptr(btree, node,
869 path[level].bp_index);
872 return NILFS_BMAP_INVALID_PTR;
875 static __u64 nilfs_btree_find_target_v(const struct nilfs_btree *btree,
876 const struct nilfs_btree_path *path,
881 ptr = nilfs_bmap_find_target_seq(&btree->bt_bmap, key);
882 if (ptr != NILFS_BMAP_INVALID_PTR)
883 /* sequential access */
886 ptr = nilfs_btree_find_near(btree, path);
887 if (ptr != NILFS_BMAP_INVALID_PTR)
892 return nilfs_bmap_find_target_in_group(&btree->bt_bmap);
895 static void nilfs_btree_set_target_v(struct nilfs_btree *btree, __u64 key,
898 btree->bt_bmap.b_last_allocated_key = key;
899 btree->bt_bmap.b_last_allocated_ptr = ptr;
902 static int nilfs_btree_prepare_insert(struct nilfs_btree *btree,
903 struct nilfs_btree_path *path,
904 int *levelp, __u64 key, __u64 ptr,
905 struct nilfs_bmap_stats *stats)
907 struct buffer_head *bh;
908 struct nilfs_btree_node *node, *parent, *sib;
910 int pindex, level, ret;
912 stats->bs_nblocks = 0;
913 level = NILFS_BTREE_LEVEL_DATA;
915 /* allocate a new ptr for data block */
916 if (btree->bt_ops->btop_find_target != NULL)
917 path[level].bp_newreq.bpr_ptr =
918 btree->bt_ops->btop_find_target(btree, path, key);
920 ret = btree->bt_bmap.b_pops->bpop_prepare_alloc_ptr(
921 &btree->bt_bmap, &path[level].bp_newreq);
925 for (level = NILFS_BTREE_LEVEL_NODE_MIN;
926 level < nilfs_btree_height(btree) - 1;
928 node = nilfs_btree_get_nonroot_node(btree, path, level);
929 if (nilfs_btree_node_get_nchildren(btree, node) <
930 nilfs_btree_node_nchildren_max(btree, node)) {
931 path[level].bp_op = nilfs_btree_do_insert;
936 parent = nilfs_btree_get_node(btree, path, level + 1);
937 pindex = path[level + 1].bp_index;
941 sibptr = nilfs_btree_node_get_ptr(btree, parent,
943 ret = nilfs_btree_get_block(btree, sibptr, &bh);
945 goto err_out_child_node;
946 sib = (struct nilfs_btree_node *)bh->b_data;
947 if (nilfs_btree_node_get_nchildren(btree, sib) <
948 nilfs_btree_node_nchildren_max(btree, sib)) {
949 path[level].bp_sib_bh = bh;
950 path[level].bp_op = nilfs_btree_carry_left;
959 nilfs_btree_node_get_nchildren(btree, parent) - 1) {
960 sibptr = nilfs_btree_node_get_ptr(btree, parent,
962 ret = nilfs_btree_get_block(btree, sibptr, &bh);
964 goto err_out_child_node;
965 sib = (struct nilfs_btree_node *)bh->b_data;
966 if (nilfs_btree_node_get_nchildren(btree, sib) <
967 nilfs_btree_node_nchildren_max(btree, sib)) {
968 path[level].bp_sib_bh = bh;
969 path[level].bp_op = nilfs_btree_carry_right;
977 path[level].bp_newreq.bpr_ptr =
978 path[level - 1].bp_newreq.bpr_ptr + 1;
979 ret = btree->bt_bmap.b_pops->bpop_prepare_alloc_ptr(
980 &btree->bt_bmap, &path[level].bp_newreq);
982 goto err_out_child_node;
983 ret = nilfs_btree_get_new_block(btree,
984 path[level].bp_newreq.bpr_ptr,
987 goto err_out_curr_node;
992 nilfs_btree_node_init(btree,
993 (struct nilfs_btree_node *)bh->b_data,
994 0, level, 0, NULL, NULL);
996 path[level].bp_sib_bh = bh;
997 path[level].bp_op = nilfs_btree_split;
1001 node = nilfs_btree_get_root(btree);
1002 if (nilfs_btree_node_get_nchildren(btree, node) <
1003 nilfs_btree_node_nchildren_max(btree, node)) {
1004 path[level].bp_op = nilfs_btree_do_insert;
1005 stats->bs_nblocks++;
1010 path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1;
1011 ret = btree->bt_bmap.b_pops->bpop_prepare_alloc_ptr(
1012 &btree->bt_bmap, &path[level].bp_newreq);
1014 goto err_out_child_node;
1015 ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr,
1018 goto err_out_curr_node;
1021 nilfs_btree_node_init(btree, (struct nilfs_btree_node *)bh->b_data,
1022 0, level, 0, NULL, NULL);
1024 path[level].bp_sib_bh = bh;
1025 path[level].bp_op = nilfs_btree_grow;
1028 path[level].bp_op = nilfs_btree_do_insert;
1030 /* a newly-created node block and a data block are added */
1031 stats->bs_nblocks += 2;
1040 btree->bt_bmap.b_pops->bpop_abort_alloc_ptr(&btree->bt_bmap,
1041 &path[level].bp_newreq);
1043 for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) {
1044 nilfs_btnode_delete(path[level].bp_sib_bh);
1045 btree->bt_bmap.b_pops->bpop_abort_alloc_ptr(
1046 &btree->bt_bmap, &path[level].bp_newreq);
1050 btree->bt_bmap.b_pops->bpop_abort_alloc_ptr(&btree->bt_bmap,
1051 &path[level].bp_newreq);
1054 stats->bs_nblocks = 0;
1058 static void nilfs_btree_commit_insert(struct nilfs_btree *btree,
1059 struct nilfs_btree_path *path,
1060 int maxlevel, __u64 key, __u64 ptr)
1064 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1065 ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr;
1066 if (btree->bt_ops->btop_set_target != NULL)
1067 btree->bt_ops->btop_set_target(btree, key, ptr);
1069 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
1070 btree->bt_bmap.b_pops->bpop_commit_alloc_ptr(
1071 &btree->bt_bmap, &path[level - 1].bp_newreq);
1072 path[level].bp_op(btree, path, level, &key, &ptr);
1075 if (!nilfs_bmap_dirty(&btree->bt_bmap))
1076 nilfs_bmap_set_dirty(&btree->bt_bmap);
1079 static int nilfs_btree_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
1081 struct nilfs_btree *btree;
1082 struct nilfs_btree_path *path;
1083 struct nilfs_bmap_stats stats;
1086 btree = (struct nilfs_btree *)bmap;
1087 path = nilfs_btree_alloc_path(btree);
1090 nilfs_btree_init_path(btree, path);
1092 ret = nilfs_btree_do_lookup(btree, path, key, NULL,
1093 NILFS_BTREE_LEVEL_NODE_MIN);
1094 if (ret != -ENOENT) {
1100 ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats);
1103 nilfs_btree_commit_insert(btree, path, level, key, ptr);
1104 nilfs_bmap_add_blocks(bmap, stats.bs_nblocks);
1107 nilfs_btree_clear_path(btree, path);
1108 nilfs_btree_free_path(btree, path);
1112 static void nilfs_btree_do_delete(struct nilfs_btree *btree,
1113 struct nilfs_btree_path *path,
1114 int level, __u64 *keyp, __u64 *ptrp)
1116 struct nilfs_btree_node *node;
1118 if (level < nilfs_btree_height(btree) - 1) {
1119 lock_buffer(path[level].bp_bh);
1120 node = nilfs_btree_get_nonroot_node(btree, path, level);
1121 nilfs_btree_node_delete(btree, node, keyp, ptrp,
1122 path[level].bp_index);
1123 if (!buffer_dirty(path[level].bp_bh))
1124 nilfs_btnode_mark_dirty(path[level].bp_bh);
1125 unlock_buffer(path[level].bp_bh);
1126 if (path[level].bp_index == 0)
1127 nilfs_btree_promote_key(btree, path, level + 1,
1128 nilfs_btree_node_get_key(btree, node, 0));
1130 node = nilfs_btree_get_root(btree);
1131 nilfs_btree_node_delete(btree, node, keyp, ptrp,
1132 path[level].bp_index);
1136 static void nilfs_btree_borrow_left(struct nilfs_btree *btree,
1137 struct nilfs_btree_path *path,
1138 int level, __u64 *keyp, __u64 *ptrp)
1140 struct nilfs_btree_node *node, *left;
1141 int nchildren, lnchildren, n;
1143 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1145 lock_buffer(path[level].bp_bh);
1146 lock_buffer(path[level].bp_sib_bh);
1148 node = nilfs_btree_get_nonroot_node(btree, path, level);
1149 left = nilfs_btree_get_sib_node(btree, path, level);
1150 nchildren = nilfs_btree_node_get_nchildren(btree, node);
1151 lnchildren = nilfs_btree_node_get_nchildren(btree, left);
1153 n = (nchildren + lnchildren) / 2 - nchildren;
1155 nilfs_btree_node_move_right(btree, left, node, n);
1157 if (!buffer_dirty(path[level].bp_bh))
1158 nilfs_btnode_mark_dirty(path[level].bp_bh);
1159 if (!buffer_dirty(path[level].bp_sib_bh))
1160 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
1162 unlock_buffer(path[level].bp_bh);
1163 unlock_buffer(path[level].bp_sib_bh);
1165 nilfs_btree_promote_key(btree, path, level + 1,
1166 nilfs_btree_node_get_key(btree, node, 0));
1168 brelse(path[level].bp_sib_bh);
1169 path[level].bp_sib_bh = NULL;
1170 path[level].bp_index += n;
1173 static void nilfs_btree_borrow_right(struct nilfs_btree *btree,
1174 struct nilfs_btree_path *path,
1175 int level, __u64 *keyp, __u64 *ptrp)
1177 struct nilfs_btree_node *node, *right;
1178 int nchildren, rnchildren, n;
1180 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1182 lock_buffer(path[level].bp_bh);
1183 lock_buffer(path[level].bp_sib_bh);
1185 node = nilfs_btree_get_nonroot_node(btree, path, level);
1186 right = nilfs_btree_get_sib_node(btree, path, level);
1187 nchildren = nilfs_btree_node_get_nchildren(btree, node);
1188 rnchildren = nilfs_btree_node_get_nchildren(btree, right);
1190 n = (nchildren + rnchildren) / 2 - nchildren;
1192 nilfs_btree_node_move_left(btree, node, right, n);
1194 if (!buffer_dirty(path[level].bp_bh))
1195 nilfs_btnode_mark_dirty(path[level].bp_bh);
1196 if (!buffer_dirty(path[level].bp_sib_bh))
1197 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
1199 unlock_buffer(path[level].bp_bh);
1200 unlock_buffer(path[level].bp_sib_bh);
1202 path[level + 1].bp_index++;
1203 nilfs_btree_promote_key(btree, path, level + 1,
1204 nilfs_btree_node_get_key(btree, right, 0));
1205 path[level + 1].bp_index--;
1207 brelse(path[level].bp_sib_bh);
1208 path[level].bp_sib_bh = NULL;
1211 static void nilfs_btree_concat_left(struct nilfs_btree *btree,
1212 struct nilfs_btree_path *path,
1213 int level, __u64 *keyp, __u64 *ptrp)
1215 struct nilfs_btree_node *node, *left;
1218 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1220 lock_buffer(path[level].bp_bh);
1221 lock_buffer(path[level].bp_sib_bh);
1223 node = nilfs_btree_get_nonroot_node(btree, path, level);
1224 left = nilfs_btree_get_sib_node(btree, path, level);
1226 n = nilfs_btree_node_get_nchildren(btree, node);
1228 nilfs_btree_node_move_left(btree, left, node, n);
1230 if (!buffer_dirty(path[level].bp_sib_bh))
1231 nilfs_btnode_mark_dirty(path[level].bp_sib_bh);
1233 unlock_buffer(path[level].bp_bh);
1234 unlock_buffer(path[level].bp_sib_bh);
1236 nilfs_btnode_delete(path[level].bp_bh);
1237 path[level].bp_bh = path[level].bp_sib_bh;
1238 path[level].bp_sib_bh = NULL;
1239 path[level].bp_index += nilfs_btree_node_get_nchildren(btree, left);
1242 static void nilfs_btree_concat_right(struct nilfs_btree *btree,
1243 struct nilfs_btree_path *path,
1244 int level, __u64 *keyp, __u64 *ptrp)
1246 struct nilfs_btree_node *node, *right;
1249 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1251 lock_buffer(path[level].bp_bh);
1252 lock_buffer(path[level].bp_sib_bh);
1254 node = nilfs_btree_get_nonroot_node(btree, path, level);
1255 right = nilfs_btree_get_sib_node(btree, path, level);
1257 n = nilfs_btree_node_get_nchildren(btree, right);
1259 nilfs_btree_node_move_left(btree, node, right, n);
1261 if (!buffer_dirty(path[level].bp_bh))
1262 nilfs_btnode_mark_dirty(path[level].bp_bh);
1264 unlock_buffer(path[level].bp_bh);
1265 unlock_buffer(path[level].bp_sib_bh);
1267 nilfs_btnode_delete(path[level].bp_sib_bh);
1268 path[level].bp_sib_bh = NULL;
1269 path[level + 1].bp_index++;
1272 static void nilfs_btree_shrink(struct nilfs_btree *btree,
1273 struct nilfs_btree_path *path,
1274 int level, __u64 *keyp, __u64 *ptrp)
1276 struct nilfs_btree_node *root, *child;
1279 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1281 lock_buffer(path[level].bp_bh);
1282 root = nilfs_btree_get_root(btree);
1283 child = nilfs_btree_get_nonroot_node(btree, path, level);
1285 nilfs_btree_node_delete(btree, root, NULL, NULL, 0);
1286 nilfs_btree_node_set_level(btree, root, level);
1287 n = nilfs_btree_node_get_nchildren(btree, child);
1288 nilfs_btree_node_move_left(btree, root, child, n);
1289 unlock_buffer(path[level].bp_bh);
1291 nilfs_btnode_delete(path[level].bp_bh);
1292 path[level].bp_bh = NULL;
1296 static int nilfs_btree_prepare_delete(struct nilfs_btree *btree,
1297 struct nilfs_btree_path *path,
1299 struct nilfs_bmap_stats *stats)
1301 struct buffer_head *bh;
1302 struct nilfs_btree_node *node, *parent, *sib;
1304 int pindex, level, ret;
1307 stats->bs_nblocks = 0;
1308 for (level = NILFS_BTREE_LEVEL_NODE_MIN;
1309 level < nilfs_btree_height(btree) - 1;
1311 node = nilfs_btree_get_nonroot_node(btree, path, level);
1312 path[level].bp_oldreq.bpr_ptr =
1313 nilfs_btree_node_get_ptr(btree, node,
1314 path[level].bp_index);
1315 if (btree->bt_bmap.b_pops->bpop_prepare_end_ptr != NULL) {
1316 ret = btree->bt_bmap.b_pops->bpop_prepare_end_ptr(
1317 &btree->bt_bmap, &path[level].bp_oldreq);
1319 goto err_out_child_node;
1322 if (nilfs_btree_node_get_nchildren(btree, node) >
1323 nilfs_btree_node_nchildren_min(btree, node)) {
1324 path[level].bp_op = nilfs_btree_do_delete;
1325 stats->bs_nblocks++;
1329 parent = nilfs_btree_get_node(btree, path, level + 1);
1330 pindex = path[level + 1].bp_index;
1334 sibptr = nilfs_btree_node_get_ptr(btree, parent,
1336 ret = nilfs_btree_get_block(btree, sibptr, &bh);
1338 goto err_out_curr_node;
1339 sib = (struct nilfs_btree_node *)bh->b_data;
1340 if (nilfs_btree_node_get_nchildren(btree, sib) >
1341 nilfs_btree_node_nchildren_min(btree, sib)) {
1342 path[level].bp_sib_bh = bh;
1343 path[level].bp_op = nilfs_btree_borrow_left;
1344 stats->bs_nblocks++;
1347 path[level].bp_sib_bh = bh;
1348 path[level].bp_op = nilfs_btree_concat_left;
1349 stats->bs_nblocks++;
1353 nilfs_btree_node_get_nchildren(btree, parent) - 1) {
1355 sibptr = nilfs_btree_node_get_ptr(btree, parent,
1357 ret = nilfs_btree_get_block(btree, sibptr, &bh);
1359 goto err_out_curr_node;
1360 sib = (struct nilfs_btree_node *)bh->b_data;
1361 if (nilfs_btree_node_get_nchildren(btree, sib) >
1362 nilfs_btree_node_nchildren_min(btree, sib)) {
1363 path[level].bp_sib_bh = bh;
1364 path[level].bp_op = nilfs_btree_borrow_right;
1365 stats->bs_nblocks++;
1368 path[level].bp_sib_bh = bh;
1369 path[level].bp_op = nilfs_btree_concat_right;
1370 stats->bs_nblocks++;
1375 /* the only child of the root node */
1376 WARN_ON(level != nilfs_btree_height(btree) - 2);
1377 if (nilfs_btree_node_get_nchildren(btree, node) - 1 <=
1378 NILFS_BTREE_ROOT_NCHILDREN_MAX) {
1379 path[level].bp_op = nilfs_btree_shrink;
1380 stats->bs_nblocks += 2;
1382 path[level].bp_op = nilfs_btree_do_delete;
1383 stats->bs_nblocks++;
1391 node = nilfs_btree_get_root(btree);
1392 path[level].bp_oldreq.bpr_ptr =
1393 nilfs_btree_node_get_ptr(btree, node, path[level].bp_index);
1394 if (btree->bt_bmap.b_pops->bpop_prepare_end_ptr != NULL) {
1395 ret = btree->bt_bmap.b_pops->bpop_prepare_end_ptr(
1396 &btree->bt_bmap, &path[level].bp_oldreq);
1398 goto err_out_child_node;
1400 /* child of the root node is deleted */
1401 path[level].bp_op = nilfs_btree_do_delete;
1402 stats->bs_nblocks++;
1411 if (btree->bt_bmap.b_pops->bpop_abort_end_ptr != NULL)
1412 btree->bt_bmap.b_pops->bpop_abort_end_ptr(
1413 &btree->bt_bmap, &path[level].bp_oldreq);
1415 for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {
1416 brelse(path[level].bp_sib_bh);
1417 if (btree->bt_bmap.b_pops->bpop_abort_end_ptr != NULL)
1418 btree->bt_bmap.b_pops->bpop_abort_end_ptr(
1419 &btree->bt_bmap, &path[level].bp_oldreq);
1422 stats->bs_nblocks = 0;
1426 static void nilfs_btree_commit_delete(struct nilfs_btree *btree,
1427 struct nilfs_btree_path *path,
1432 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
1433 if (btree->bt_bmap.b_pops->bpop_commit_end_ptr != NULL)
1434 btree->bt_bmap.b_pops->bpop_commit_end_ptr(
1435 &btree->bt_bmap, &path[level].bp_oldreq);
1436 path[level].bp_op(btree, path, level, NULL, NULL);
1439 if (!nilfs_bmap_dirty(&btree->bt_bmap))
1440 nilfs_bmap_set_dirty(&btree->bt_bmap);
1443 static int nilfs_btree_delete(struct nilfs_bmap *bmap, __u64 key)
1446 struct nilfs_btree *btree;
1447 struct nilfs_btree_path *path;
1448 struct nilfs_bmap_stats stats;
1451 btree = (struct nilfs_btree *)bmap;
1452 path = nilfs_btree_alloc_path(btree);
1455 nilfs_btree_init_path(btree, path);
1456 ret = nilfs_btree_do_lookup(btree, path, key, NULL,
1457 NILFS_BTREE_LEVEL_NODE_MIN);
1461 ret = nilfs_btree_prepare_delete(btree, path, &level, &stats);
1464 nilfs_btree_commit_delete(btree, path, level);
1465 nilfs_bmap_sub_blocks(bmap, stats.bs_nblocks);
1468 nilfs_btree_clear_path(btree, path);
1469 nilfs_btree_free_path(btree, path);
1473 static int nilfs_btree_last_key(const struct nilfs_bmap *bmap, __u64 *keyp)
1475 struct nilfs_btree *btree;
1476 struct nilfs_btree_path *path;
1479 btree = (struct nilfs_btree *)bmap;
1480 path = nilfs_btree_alloc_path(btree);
1483 nilfs_btree_init_path(btree, path);
1485 ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);
1487 nilfs_btree_clear_path(btree, path);
1488 nilfs_btree_free_path(btree, path);
1493 static int nilfs_btree_check_delete(struct nilfs_bmap *bmap, __u64 key)
1495 struct buffer_head *bh;
1496 struct nilfs_btree *btree;
1497 struct nilfs_btree_node *root, *node;
1498 __u64 maxkey, nextmaxkey;
1502 btree = (struct nilfs_btree *)bmap;
1503 root = nilfs_btree_get_root(btree);
1504 switch (nilfs_btree_height(btree)) {
1510 nchildren = nilfs_btree_node_get_nchildren(btree, root);
1513 ptr = nilfs_btree_node_get_ptr(btree, root, nchildren - 1);
1514 ret = nilfs_btree_get_block(btree, ptr, &bh);
1517 node = (struct nilfs_btree_node *)bh->b_data;
1523 nchildren = nilfs_btree_node_get_nchildren(btree, node);
1524 maxkey = nilfs_btree_node_get_key(btree, node, nchildren - 1);
1525 nextmaxkey = (nchildren > 1) ?
1526 nilfs_btree_node_get_key(btree, node, nchildren - 2) : 0;
1530 return (maxkey == key) && (nextmaxkey < bmap->b_low);
1533 static int nilfs_btree_gather_data(struct nilfs_bmap *bmap,
1534 __u64 *keys, __u64 *ptrs, int nitems)
1536 struct buffer_head *bh;
1537 struct nilfs_btree *btree;
1538 struct nilfs_btree_node *node, *root;
1542 int nchildren, i, ret;
1544 btree = (struct nilfs_btree *)bmap;
1545 root = nilfs_btree_get_root(btree);
1546 switch (nilfs_btree_height(btree)) {
1552 nchildren = nilfs_btree_node_get_nchildren(btree, root);
1553 WARN_ON(nchildren > 1);
1554 ptr = nilfs_btree_node_get_ptr(btree, root, nchildren - 1);
1555 ret = nilfs_btree_get_block(btree, ptr, &bh);
1558 node = (struct nilfs_btree_node *)bh->b_data;
1565 nchildren = nilfs_btree_node_get_nchildren(btree, node);
1566 if (nchildren < nitems)
1568 dkeys = nilfs_btree_node_dkeys(btree, node);
1569 dptrs = nilfs_btree_node_dptrs(btree, node);
1570 for (i = 0; i < nitems; i++) {
1571 keys[i] = nilfs_bmap_dkey_to_key(dkeys[i]);
1572 ptrs[i] = nilfs_bmap_dptr_to_ptr(dptrs[i]);
1582 nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *bmap, __u64 key,
1583 union nilfs_bmap_ptr_req *dreq,
1584 union nilfs_bmap_ptr_req *nreq,
1585 struct buffer_head **bhp,
1586 struct nilfs_bmap_stats *stats)
1588 struct buffer_head *bh;
1589 struct nilfs_btree *btree;
1592 btree = (struct nilfs_btree *)bmap;
1593 stats->bs_nblocks = 0;
1596 /* cannot find near ptr */
1597 if (btree->bt_ops->btop_find_target != NULL)
1599 = btree->bt_ops->btop_find_target(btree, NULL, key);
1600 ret = bmap->b_pops->bpop_prepare_alloc_ptr(bmap, dreq);
1605 stats->bs_nblocks++;
1607 nreq->bpr_ptr = dreq->bpr_ptr + 1;
1608 ret = bmap->b_pops->bpop_prepare_alloc_ptr(bmap, nreq);
1612 ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh);
1617 stats->bs_nblocks++;
1625 bmap->b_pops->bpop_abort_alloc_ptr(bmap, nreq);
1627 bmap->b_pops->bpop_abort_alloc_ptr(bmap, dreq);
1628 stats->bs_nblocks = 0;
1634 nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *bmap,
1635 __u64 key, __u64 ptr,
1636 const __u64 *keys, const __u64 *ptrs,
1637 int n, __u64 low, __u64 high,
1638 union nilfs_bmap_ptr_req *dreq,
1639 union nilfs_bmap_ptr_req *nreq,
1640 struct buffer_head *bh)
1642 struct nilfs_btree *btree;
1643 struct nilfs_btree_node *node;
1646 /* free resources */
1647 if (bmap->b_ops->bop_clear != NULL)
1648 bmap->b_ops->bop_clear(bmap);
1650 /* ptr must be a pointer to a buffer head. */
1651 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1653 /* convert and insert */
1654 btree = (struct nilfs_btree *)bmap;
1655 nilfs_btree_init(bmap, low, high);
1657 bmap->b_pops->bpop_commit_alloc_ptr(bmap, dreq);
1658 bmap->b_pops->bpop_commit_alloc_ptr(bmap, nreq);
1660 /* create child node at level 1 */
1662 node = (struct nilfs_btree_node *)bh->b_data;
1663 nilfs_btree_node_init(btree, node, 0, 1, n, keys, ptrs);
1664 nilfs_btree_node_insert(btree, node,
1665 key, dreq->bpr_ptr, n);
1666 if (!buffer_dirty(bh))
1667 nilfs_btnode_mark_dirty(bh);
1668 if (!nilfs_bmap_dirty(bmap))
1669 nilfs_bmap_set_dirty(bmap);
1674 /* create root node at level 2 */
1675 node = nilfs_btree_get_root(btree);
1676 tmpptr = nreq->bpr_ptr;
1677 nilfs_btree_node_init(btree, node, NILFS_BTREE_NODE_ROOT,
1678 2, 1, &keys[0], &tmpptr);
1680 bmap->b_pops->bpop_commit_alloc_ptr(bmap, dreq);
1682 /* create root node at level 1 */
1683 node = nilfs_btree_get_root(btree);
1684 nilfs_btree_node_init(btree, node, NILFS_BTREE_NODE_ROOT,
1686 nilfs_btree_node_insert(btree, node,
1687 key, dreq->bpr_ptr, n);
1688 if (!nilfs_bmap_dirty(bmap))
1689 nilfs_bmap_set_dirty(bmap);
1692 if (btree->bt_ops->btop_set_target != NULL)
1693 btree->bt_ops->btop_set_target(btree, key, dreq->bpr_ptr);
1697 * nilfs_btree_convert_and_insert -
1707 int nilfs_btree_convert_and_insert(struct nilfs_bmap *bmap,
1708 __u64 key, __u64 ptr,
1709 const __u64 *keys, const __u64 *ptrs,
1710 int n, __u64 low, __u64 high)
1712 struct buffer_head *bh;
1713 union nilfs_bmap_ptr_req dreq, nreq, *di, *ni;
1714 struct nilfs_bmap_stats stats;
1717 if (n + 1 <= NILFS_BTREE_ROOT_NCHILDREN_MAX) {
1720 } else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX(
1721 1 << bmap->b_inode->i_blkbits)) {
1730 ret = nilfs_btree_prepare_convert_and_insert(bmap, key, di, ni, &bh,
1734 nilfs_btree_commit_convert_and_insert(bmap, key, ptr, keys, ptrs, n,
1735 low, high, di, ni, bh);
1736 nilfs_bmap_add_blocks(bmap, stats.bs_nblocks);
1740 static int nilfs_btree_propagate_p(struct nilfs_btree *btree,
1741 struct nilfs_btree_path *path,
1743 struct buffer_head *bh)
1745 while ((++level < nilfs_btree_height(btree) - 1) &&
1746 !buffer_dirty(path[level].bp_bh))
1747 nilfs_btnode_mark_dirty(path[level].bp_bh);
1752 static int nilfs_btree_prepare_update_v(struct nilfs_btree *btree,
1753 struct nilfs_btree_path *path,
1756 struct nilfs_btree_node *parent;
1759 parent = nilfs_btree_get_node(btree, path, level + 1);
1760 path[level].bp_oldreq.bpr_ptr =
1761 nilfs_btree_node_get_ptr(btree, parent,
1762 path[level + 1].bp_index);
1763 path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1;
1764 ret = nilfs_bmap_prepare_update(&btree->bt_bmap,
1765 &path[level].bp_oldreq,
1766 &path[level].bp_newreq);
1770 if (buffer_nilfs_node(path[level].bp_bh)) {
1771 path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr;
1772 path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr;
1773 path[level].bp_ctxt.bh = path[level].bp_bh;
1774 ret = nilfs_btnode_prepare_change_key(
1775 &NILFS_BMAP_I(&btree->bt_bmap)->i_btnode_cache,
1776 &path[level].bp_ctxt);
1778 nilfs_bmap_abort_update(&btree->bt_bmap,
1779 &path[level].bp_oldreq,
1780 &path[level].bp_newreq);
1788 static void nilfs_btree_commit_update_v(struct nilfs_btree *btree,
1789 struct nilfs_btree_path *path,
1792 struct nilfs_btree_node *parent;
1794 nilfs_bmap_commit_update(&btree->bt_bmap,
1795 &path[level].bp_oldreq,
1796 &path[level].bp_newreq);
1798 if (buffer_nilfs_node(path[level].bp_bh)) {
1799 nilfs_btnode_commit_change_key(
1800 &NILFS_BMAP_I(&btree->bt_bmap)->i_btnode_cache,
1801 &path[level].bp_ctxt);
1802 path[level].bp_bh = path[level].bp_ctxt.bh;
1804 set_buffer_nilfs_volatile(path[level].bp_bh);
1806 parent = nilfs_btree_get_node(btree, path, level + 1);
1807 nilfs_btree_node_set_ptr(btree, parent, path[level + 1].bp_index,
1808 path[level].bp_newreq.bpr_ptr);
1811 static void nilfs_btree_abort_update_v(struct nilfs_btree *btree,
1812 struct nilfs_btree_path *path,
1815 nilfs_bmap_abort_update(&btree->bt_bmap,
1816 &path[level].bp_oldreq,
1817 &path[level].bp_newreq);
1818 if (buffer_nilfs_node(path[level].bp_bh))
1819 nilfs_btnode_abort_change_key(
1820 &NILFS_BMAP_I(&btree->bt_bmap)->i_btnode_cache,
1821 &path[level].bp_ctxt);
1824 static int nilfs_btree_prepare_propagate_v(struct nilfs_btree *btree,
1825 struct nilfs_btree_path *path,
1832 if (!buffer_nilfs_volatile(path[level].bp_bh)) {
1833 ret = nilfs_btree_prepare_update_v(btree, path, level);
1837 while ((++level < nilfs_btree_height(btree) - 1) &&
1838 !buffer_dirty(path[level].bp_bh)) {
1840 WARN_ON(buffer_nilfs_volatile(path[level].bp_bh));
1841 ret = nilfs_btree_prepare_update_v(btree, path, level);
1847 *maxlevelp = level - 1;
1852 while (--level > minlevel)
1853 nilfs_btree_abort_update_v(btree, path, level);
1854 if (!buffer_nilfs_volatile(path[level].bp_bh))
1855 nilfs_btree_abort_update_v(btree, path, level);
1859 static void nilfs_btree_commit_propagate_v(struct nilfs_btree *btree,
1860 struct nilfs_btree_path *path,
1863 struct buffer_head *bh)
1867 if (!buffer_nilfs_volatile(path[minlevel].bp_bh))
1868 nilfs_btree_commit_update_v(btree, path, minlevel);
1870 for (level = minlevel + 1; level <= maxlevel; level++)
1871 nilfs_btree_commit_update_v(btree, path, level);
1874 static int nilfs_btree_propagate_v(struct nilfs_btree *btree,
1875 struct nilfs_btree_path *path,
1877 struct buffer_head *bh)
1880 struct nilfs_btree_node *parent;
1884 path[level].bp_bh = bh;
1885 ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel);
1889 if (buffer_nilfs_volatile(path[level].bp_bh)) {
1890 parent = nilfs_btree_get_node(btree, path, level + 1);
1891 ptr = nilfs_btree_node_get_ptr(btree, parent,
1892 path[level + 1].bp_index);
1893 ret = nilfs_bmap_mark_dirty(&btree->bt_bmap, ptr);
1898 nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh);
1901 brelse(path[level].bp_bh);
1902 path[level].bp_bh = NULL;
1906 static int nilfs_btree_propagate(const struct nilfs_bmap *bmap,
1907 struct buffer_head *bh)
1909 struct nilfs_btree *btree;
1910 struct nilfs_btree_path *path;
1911 struct nilfs_btree_node *node;
1915 WARN_ON(!buffer_dirty(bh));
1917 btree = (struct nilfs_btree *)bmap;
1918 path = nilfs_btree_alloc_path(btree);
1921 nilfs_btree_init_path(btree, path);
1923 if (buffer_nilfs_node(bh)) {
1924 node = (struct nilfs_btree_node *)bh->b_data;
1925 key = nilfs_btree_node_get_key(btree, node, 0);
1926 level = nilfs_btree_node_get_level(btree, node);
1928 key = nilfs_bmap_data_get_key(bmap, bh);
1929 level = NILFS_BTREE_LEVEL_DATA;
1932 ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1);
1934 if (unlikely(ret == -ENOENT))
1935 printk(KERN_CRIT "%s: key = %llu, level == %d\n",
1936 __func__, (unsigned long long)key, level);
1940 ret = btree->bt_ops->btop_propagate(btree, path, level, bh);
1943 nilfs_btree_clear_path(btree, path);
1944 nilfs_btree_free_path(btree, path);
1949 static int nilfs_btree_propagate_gc(const struct nilfs_bmap *bmap,
1950 struct buffer_head *bh)
1952 return nilfs_bmap_mark_dirty(bmap, bh->b_blocknr);
1955 static void nilfs_btree_add_dirty_buffer(struct nilfs_btree *btree,
1956 struct list_head *lists,
1957 struct buffer_head *bh)
1959 struct list_head *head;
1960 struct buffer_head *cbh;
1961 struct nilfs_btree_node *node, *cnode;
1966 node = (struct nilfs_btree_node *)bh->b_data;
1967 key = nilfs_btree_node_get_key(btree, node, 0);
1968 level = nilfs_btree_node_get_level(btree, node);
1969 list_for_each(head, &lists[level]) {
1970 cbh = list_entry(head, struct buffer_head, b_assoc_buffers);
1971 cnode = (struct nilfs_btree_node *)cbh->b_data;
1972 ckey = nilfs_btree_node_get_key(btree, cnode, 0);
1976 list_add_tail(&bh->b_assoc_buffers, head);
1979 static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *bmap,
1980 struct list_head *listp)
1982 struct nilfs_btree *btree = (struct nilfs_btree *)bmap;
1983 struct address_space *btcache = &NILFS_BMAP_I(bmap)->i_btnode_cache;
1984 struct list_head lists[NILFS_BTREE_LEVEL_MAX];
1985 struct pagevec pvec;
1986 struct buffer_head *bh, *head;
1990 for (level = NILFS_BTREE_LEVEL_NODE_MIN;
1991 level < NILFS_BTREE_LEVEL_MAX;
1993 INIT_LIST_HEAD(&lists[level]);
1995 pagevec_init(&pvec, 0);
1997 while (pagevec_lookup_tag(&pvec, btcache, &index, PAGECACHE_TAG_DIRTY,
1999 for (i = 0; i < pagevec_count(&pvec); i++) {
2000 bh = head = page_buffers(pvec.pages[i]);
2002 if (buffer_dirty(bh))
2003 nilfs_btree_add_dirty_buffer(btree,
2005 } while ((bh = bh->b_this_page) != head);
2007 pagevec_release(&pvec);
2011 for (level = NILFS_BTREE_LEVEL_NODE_MIN;
2012 level < NILFS_BTREE_LEVEL_MAX;
2014 list_splice(&lists[level], listp->prev);
2017 static int nilfs_btree_assign_p(struct nilfs_btree *btree,
2018 struct nilfs_btree_path *path,
2020 struct buffer_head **bh,
2022 union nilfs_binfo *binfo)
2024 struct nilfs_btree_node *parent;
2029 parent = nilfs_btree_get_node(btree, path, level + 1);
2030 ptr = nilfs_btree_node_get_ptr(btree, parent,
2031 path[level + 1].bp_index);
2032 if (buffer_nilfs_node(*bh)) {
2033 path[level].bp_ctxt.oldkey = ptr;
2034 path[level].bp_ctxt.newkey = blocknr;
2035 path[level].bp_ctxt.bh = *bh;
2036 ret = nilfs_btnode_prepare_change_key(
2037 &NILFS_BMAP_I(&btree->bt_bmap)->i_btnode_cache,
2038 &path[level].bp_ctxt);
2041 nilfs_btnode_commit_change_key(
2042 &NILFS_BMAP_I(&btree->bt_bmap)->i_btnode_cache,
2043 &path[level].bp_ctxt);
2044 *bh = path[level].bp_ctxt.bh;
2047 nilfs_btree_node_set_ptr(btree, parent,
2048 path[level + 1].bp_index, blocknr);
2050 key = nilfs_btree_node_get_key(btree, parent,
2051 path[level + 1].bp_index);
2052 /* on-disk format */
2053 binfo->bi_dat.bi_blkoff = nilfs_bmap_key_to_dkey(key);
2054 binfo->bi_dat.bi_level = level;
2059 static int nilfs_btree_assign_v(struct nilfs_btree *btree,
2060 struct nilfs_btree_path *path,
2062 struct buffer_head **bh,
2064 union nilfs_binfo *binfo)
2066 struct nilfs_btree_node *parent;
2069 union nilfs_bmap_ptr_req req;
2072 parent = nilfs_btree_get_node(btree, path, level + 1);
2073 ptr = nilfs_btree_node_get_ptr(btree, parent,
2074 path[level + 1].bp_index);
2076 ret = nilfs_bmap_start_v(&btree->bt_bmap, &req, blocknr);
2077 if (unlikely(ret < 0))
2080 key = nilfs_btree_node_get_key(btree, parent,
2081 path[level + 1].bp_index);
2082 /* on-disk format */
2083 binfo->bi_v.bi_vblocknr = nilfs_bmap_ptr_to_dptr(ptr);
2084 binfo->bi_v.bi_blkoff = nilfs_bmap_key_to_dkey(key);
2089 static int nilfs_btree_assign(struct nilfs_bmap *bmap,
2090 struct buffer_head **bh,
2092 union nilfs_binfo *binfo)
2094 struct nilfs_btree *btree;
2095 struct nilfs_btree_path *path;
2096 struct nilfs_btree_node *node;
2100 btree = (struct nilfs_btree *)bmap;
2101 path = nilfs_btree_alloc_path(btree);
2104 nilfs_btree_init_path(btree, path);
2106 if (buffer_nilfs_node(*bh)) {
2107 node = (struct nilfs_btree_node *)(*bh)->b_data;
2108 key = nilfs_btree_node_get_key(btree, node, 0);
2109 level = nilfs_btree_node_get_level(btree, node);
2111 key = nilfs_bmap_data_get_key(bmap, *bh);
2112 level = NILFS_BTREE_LEVEL_DATA;
2115 ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1);
2117 WARN_ON(ret == -ENOENT);
2121 ret = btree->bt_ops->btop_assign(btree, path, level, bh,
2125 nilfs_btree_clear_path(btree, path);
2126 nilfs_btree_free_path(btree, path);
2131 static int nilfs_btree_assign_gc(struct nilfs_bmap *bmap,
2132 struct buffer_head **bh,
2134 union nilfs_binfo *binfo)
2136 struct nilfs_btree *btree;
2137 struct nilfs_btree_node *node;
2141 btree = (struct nilfs_btree *)bmap;
2142 ret = nilfs_bmap_move_v(bmap, (*bh)->b_blocknr, blocknr);
2146 if (buffer_nilfs_node(*bh)) {
2147 node = (struct nilfs_btree_node *)(*bh)->b_data;
2148 key = nilfs_btree_node_get_key(btree, node, 0);
2150 key = nilfs_bmap_data_get_key(bmap, *bh);
2152 /* on-disk format */
2153 binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr);
2154 binfo->bi_v.bi_blkoff = nilfs_bmap_key_to_dkey(key);
2159 static int nilfs_btree_mark(struct nilfs_bmap *bmap, __u64 key, int level)
2161 struct buffer_head *bh;
2162 struct nilfs_btree *btree;
2163 struct nilfs_btree_path *path;
2167 btree = (struct nilfs_btree *)bmap;
2168 path = nilfs_btree_alloc_path(btree);
2171 nilfs_btree_init_path(btree, path);
2173 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1);
2175 WARN_ON(ret == -ENOENT);
2178 ret = nilfs_btree_get_block(btree, ptr, &bh);
2180 WARN_ON(ret == -ENOENT);
2184 if (!buffer_dirty(bh))
2185 nilfs_btnode_mark_dirty(bh);
2187 if (!nilfs_bmap_dirty(&btree->bt_bmap))
2188 nilfs_bmap_set_dirty(&btree->bt_bmap);
2191 nilfs_btree_clear_path(btree, path);
2192 nilfs_btree_free_path(btree, path);
2196 static const struct nilfs_bmap_operations nilfs_btree_ops = {
2197 .bop_lookup = nilfs_btree_lookup,
2198 .bop_insert = nilfs_btree_insert,
2199 .bop_delete = nilfs_btree_delete,
2202 .bop_propagate = nilfs_btree_propagate,
2204 .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers,
2206 .bop_assign = nilfs_btree_assign,
2207 .bop_mark = nilfs_btree_mark,
2209 .bop_last_key = nilfs_btree_last_key,
2210 .bop_check_insert = NULL,
2211 .bop_check_delete = nilfs_btree_check_delete,
2212 .bop_gather_data = nilfs_btree_gather_data,
2215 static const struct nilfs_bmap_operations nilfs_btree_ops_gc = {
2221 .bop_propagate = nilfs_btree_propagate_gc,
2223 .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers,
2225 .bop_assign = nilfs_btree_assign_gc,
2228 .bop_last_key = NULL,
2229 .bop_check_insert = NULL,
2230 .bop_check_delete = NULL,
2231 .bop_gather_data = NULL,
2234 static const struct nilfs_btree_operations nilfs_btree_ops_v = {
2235 .btop_find_target = nilfs_btree_find_target_v,
2236 .btop_set_target = nilfs_btree_set_target_v,
2237 .btop_propagate = nilfs_btree_propagate_v,
2238 .btop_assign = nilfs_btree_assign_v,
2241 static const struct nilfs_btree_operations nilfs_btree_ops_p = {
2242 .btop_find_target = NULL,
2243 .btop_set_target = NULL,
2244 .btop_propagate = nilfs_btree_propagate_p,
2245 .btop_assign = nilfs_btree_assign_p,
2248 int nilfs_btree_init(struct nilfs_bmap *bmap, __u64 low, __u64 high)
2250 struct nilfs_btree *btree;
2252 btree = (struct nilfs_btree *)bmap;
2253 bmap->b_ops = &nilfs_btree_ops;
2255 bmap->b_high = high;
2256 switch (bmap->b_inode->i_ino) {
2258 btree->bt_ops = &nilfs_btree_ops_p;
2261 btree->bt_ops = &nilfs_btree_ops_v;
2268 void nilfs_btree_init_gc(struct nilfs_bmap *bmap)
2270 bmap->b_low = NILFS_BMAP_LARGE_LOW;
2271 bmap->b_high = NILFS_BMAP_LARGE_HIGH;
2272 bmap->b_ops = &nilfs_btree_ops_gc;