Lines Matching full:level
26 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_alloc_path() local
32 for (; level < NILFS_BTREE_LEVEL_MAX; level++) { in nilfs_btree_alloc_path()
33 path[level].bp_bh = NULL; in nilfs_btree_alloc_path()
34 path[level].bp_sib_bh = NULL; in nilfs_btree_alloc_path()
35 path[level].bp_index = 0; in nilfs_btree_alloc_path()
36 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
37 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
38 path[level].bp_op = NULL; in nilfs_btree_alloc_path()
47 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_free_path() local
49 for (; level < NILFS_BTREE_LEVEL_MAX; level++) in nilfs_btree_free_path()
50 brelse(path[level].bp_bh); in nilfs_btree_free_path()
95 nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) in nilfs_btree_node_set_level() argument
97 node->bn_level = level; in nilfs_btree_node_set_level()
162 int level, int nchildren, int ncmax, in nilfs_btree_node_init() argument
170 nilfs_btree_node_set_level(node, level); in nilfs_btree_node_init()
342 int level, flags, nchildren; in nilfs_btree_node_broken() local
345 level = nilfs_btree_node_get_level(node); in nilfs_btree_node_broken()
349 if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN || in nilfs_btree_node_broken()
350 level >= NILFS_BTREE_LEVEL_MAX || in nilfs_btree_node_broken()
355 "bad btree node (ino=%lu, blocknr=%llu): level = %d, flags = 0x%x, nchildren = %d", in nilfs_btree_node_broken()
356 inode->i_ino, (unsigned long long)blocknr, level, in nilfs_btree_node_broken()
373 int level, flags, nchildren; in nilfs_btree_root_broken() local
376 level = nilfs_btree_node_get_level(node); in nilfs_btree_root_broken()
380 if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN || in nilfs_btree_root_broken()
381 level >= NILFS_BTREE_LEVEL_MAX || in nilfs_btree_root_broken()
385 "bad btree root (ino=%lu): level = %d, flags = 0x%x, nchildren = %d", in nilfs_btree_root_broken()
386 inode->i_ino, level, flags, nchildren); in nilfs_btree_root_broken()
415 nilfs_btree_get_nonroot_node(const struct nilfs_btree_path *path, int level) in nilfs_btree_get_nonroot_node() argument
417 return (struct nilfs_btree_node *)path[level].bp_bh->b_data; in nilfs_btree_get_nonroot_node()
421 nilfs_btree_get_sib_node(const struct nilfs_btree_path *path, int level) in nilfs_btree_get_sib_node() argument
423 return (struct nilfs_btree_node *)path[level].bp_sib_bh->b_data; in nilfs_btree_get_sib_node()
434 int level, int *ncmaxp) in nilfs_btree_get_node() argument
438 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_get_node()
442 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_get_node()
449 struct nilfs_btree_node *node, int level) in nilfs_btree_bad_node() argument
451 if (unlikely(nilfs_btree_node_get_level(node) != level)) { in nilfs_btree_bad_node()
454 "btree level mismatch (ino=%lu): %d != %d", in nilfs_btree_bad_node()
456 nilfs_btree_node_get_level(node), level); in nilfs_btree_bad_node()
543 int level, index, found, ncmax, ret; in nilfs_btree_do_lookup() local
546 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup()
547 if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) in nilfs_btree_do_lookup()
553 path[level].bp_bh = NULL; in nilfs_btree_do_lookup()
554 path[level].bp_index = index; in nilfs_btree_do_lookup()
558 while (--level >= minlevel) { in nilfs_btree_do_lookup()
560 if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) { in nilfs_btree_do_lookup()
561 p.node = nilfs_btree_get_node(btree, path, level + 1, in nilfs_btree_do_lookup()
567 ret = __nilfs_btree_get_block(btree, ptr, &path[level].bp_bh, in nilfs_btree_do_lookup()
572 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup()
573 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup()
582 WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN); in nilfs_btree_do_lookup()
586 path[level].bp_index = index; in nilfs_btree_do_lookup()
603 int index, level, ncmax, ret; in nilfs_btree_do_lookup_last() local
609 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup_last()
612 path[level].bp_bh = NULL; in nilfs_btree_do_lookup_last()
613 path[level].bp_index = index; in nilfs_btree_do_lookup_last()
616 for (level--; level > 0; level--) { in nilfs_btree_do_lookup_last()
617 ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh); in nilfs_btree_do_lookup_last()
620 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup_last()
621 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup_last()
625 path[level].bp_index = index; in nilfs_btree_do_lookup_last()
640 * @minlevel: start level
652 int index, next_adj, level; in nilfs_btree_get_next_key() local
656 for (level = minlevel; level <= maxlevel; level++) { in nilfs_btree_get_next_key()
657 if (level == maxlevel) in nilfs_btree_get_next_key()
660 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_get_next_key()
662 index = path[level].bp_index + next_adj; in nilfs_btree_get_next_key()
675 __u64 key, int level, __u64 *ptrp) in nilfs_btree_lookup() argument
684 ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0); in nilfs_btree_lookup()
700 int level = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_lookup_contig() local
708 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level, 1); in nilfs_btree_lookup_contig()
724 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_lookup_contig()
725 index = path[level].bp_index + 1; in nilfs_btree_lookup_contig()
742 if (level == maxlevel) in nilfs_btree_lookup_contig()
746 p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax); in nilfs_btree_lookup_contig()
747 p.index = path[level + 1].bp_index + 1; in nilfs_btree_lookup_contig()
753 path[level + 1].bp_index = p.index; in nilfs_btree_lookup_contig()
755 brelse(path[level].bp_bh); in nilfs_btree_lookup_contig()
756 path[level].bp_bh = NULL; in nilfs_btree_lookup_contig()
758 ret = __nilfs_btree_get_block(btree, ptr2, &path[level].bp_bh, in nilfs_btree_lookup_contig()
762 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_lookup_contig()
765 path[level].bp_index = index; in nilfs_btree_lookup_contig()
777 int level, __u64 key) in nilfs_btree_promote_key() argument
779 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
782 nilfs_btree_get_nonroot_node(path, level), in nilfs_btree_promote_key()
783 path[level].bp_index, key); in nilfs_btree_promote_key()
784 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_promote_key()
785 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_promote_key()
786 } while ((path[level].bp_index == 0) && in nilfs_btree_promote_key()
787 (++level < nilfs_btree_height(btree) - 1)); in nilfs_btree_promote_key()
791 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
793 path[level].bp_index, key); in nilfs_btree_promote_key()
799 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_insert() argument
804 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_insert()
805 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_insert()
807 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
809 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_do_insert()
810 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_do_insert()
812 if (path[level].bp_index == 0) in nilfs_btree_do_insert()
813 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_do_insert()
818 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
826 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_carry_left() argument
831 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_left()
832 left = nilfs_btree_get_sib_node(path, level); in nilfs_btree_carry_left()
839 if (n > path[level].bp_index) { in nilfs_btree_carry_left()
847 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_carry_left()
848 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_carry_left()
849 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_carry_left()
850 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_carry_left()
852 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_carry_left()
856 brelse(path[level].bp_bh); in nilfs_btree_carry_left()
857 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_carry_left()
858 path[level].bp_sib_bh = NULL; in nilfs_btree_carry_left()
859 path[level].bp_index += lnchildren; in nilfs_btree_carry_left()
860 path[level + 1].bp_index--; in nilfs_btree_carry_left()
862 brelse(path[level].bp_sib_bh); in nilfs_btree_carry_left()
863 path[level].bp_sib_bh = NULL; in nilfs_btree_carry_left()
864 path[level].bp_index -= n; in nilfs_btree_carry_left()
867 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_carry_left()
872 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_carry_right() argument
877 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_right()
878 right = nilfs_btree_get_sib_node(path, level); in nilfs_btree_carry_right()
885 if (n > nchildren - path[level].bp_index) { in nilfs_btree_carry_right()
893 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_carry_right()
894 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_carry_right()
895 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_carry_right()
896 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_carry_right()
898 path[level + 1].bp_index++; in nilfs_btree_carry_right()
899 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_carry_right()
901 path[level + 1].bp_index--; in nilfs_btree_carry_right()
904 brelse(path[level].bp_bh); in nilfs_btree_carry_right()
905 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_carry_right()
906 path[level].bp_sib_bh = NULL; in nilfs_btree_carry_right()
907 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_right()
908 path[level + 1].bp_index++; in nilfs_btree_carry_right()
910 brelse(path[level].bp_sib_bh); in nilfs_btree_carry_right()
911 path[level].bp_sib_bh = NULL; in nilfs_btree_carry_right()
914 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_carry_right()
919 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_split() argument
924 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_split()
925 right = nilfs_btree_get_sib_node(path, level); in nilfs_btree_split()
931 if (n > nchildren - path[level].bp_index) { in nilfs_btree_split()
938 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_split()
939 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_split()
940 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_split()
941 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_split()
944 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_split()
945 nilfs_btree_node_insert(right, path[level].bp_index, in nilfs_btree_split()
949 *ptrp = path[level].bp_newreq.bpr_ptr; in nilfs_btree_split()
951 brelse(path[level].bp_bh); in nilfs_btree_split()
952 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_split()
953 path[level].bp_sib_bh = NULL; in nilfs_btree_split()
955 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_split()
958 *ptrp = path[level].bp_newreq.bpr_ptr; in nilfs_btree_split()
960 brelse(path[level].bp_sib_bh); in nilfs_btree_split()
961 path[level].bp_sib_bh = NULL; in nilfs_btree_split()
964 path[level + 1].bp_index++; in nilfs_btree_split()
969 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_grow() argument
975 child = nilfs_btree_get_sib_node(path, level); in nilfs_btree_grow()
982 nilfs_btree_node_set_level(root, level + 1); in nilfs_btree_grow()
984 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_grow()
985 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_grow()
987 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_grow()
988 path[level].bp_sib_bh = NULL; in nilfs_btree_grow()
990 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_grow()
993 *ptrp = path[level].bp_newreq.bpr_ptr; in nilfs_btree_grow()
1000 int level, ncmax; in nilfs_btree_find_near() local
1006 level = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_find_near()
1007 if (path[level].bp_index > 0) { in nilfs_btree_find_near()
1008 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1010 path[level].bp_index - 1, in nilfs_btree_find_near()
1015 level = NILFS_BTREE_LEVEL_NODE_MIN + 1; in nilfs_btree_find_near()
1016 if (level <= nilfs_btree_height(btree) - 1) { in nilfs_btree_find_near()
1017 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1018 return nilfs_btree_node_get_ptr(node, path[level].bp_index, in nilfs_btree_find_near()
1053 int pindex, level, ncmax, ncblk, ret; in nilfs_btree_prepare_insert() local
1057 level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_prepare_insert()
1061 path[level].bp_newreq.bpr_ptr = in nilfs_btree_prepare_insert()
1066 ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1072 for (level = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_prepare_insert()
1073 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_insert()
1074 level++) { in nilfs_btree_prepare_insert()
1075 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_insert()
1077 path[level].bp_op = nilfs_btree_do_insert; in nilfs_btree_prepare_insert()
1082 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_prepare_insert()
1083 pindex = path[level + 1].bp_index; in nilfs_btree_prepare_insert()
1094 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1095 path[level].bp_op = nilfs_btree_carry_left; in nilfs_btree_prepare_insert()
1112 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1113 path[level].bp_op = nilfs_btree_carry_right; in nilfs_btree_prepare_insert()
1122 path[level].bp_newreq.bpr_ptr = in nilfs_btree_prepare_insert()
1123 path[level - 1].bp_newreq.bpr_ptr + 1; in nilfs_btree_prepare_insert()
1125 &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1129 path[level].bp_newreq.bpr_ptr, in nilfs_btree_prepare_insert()
1137 nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL); in nilfs_btree_prepare_insert()
1138 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1139 path[level].bp_op = nilfs_btree_split; in nilfs_btree_prepare_insert()
1146 path[level].bp_op = nilfs_btree_do_insert; in nilfs_btree_prepare_insert()
1152 path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1; in nilfs_btree_prepare_insert()
1153 ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1156 ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr, in nilfs_btree_prepare_insert()
1162 0, level, 0, ncblk, NULL, NULL); in nilfs_btree_prepare_insert()
1163 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1164 path[level].bp_op = nilfs_btree_grow; in nilfs_btree_prepare_insert()
1166 level++; in nilfs_btree_prepare_insert()
1167 path[level].bp_op = nilfs_btree_do_insert; in nilfs_btree_prepare_insert()
1174 *levelp = level; in nilfs_btree_prepare_insert()
1179 nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1181 for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) { in nilfs_btree_prepare_insert()
1182 nilfs_btnode_delete(path[level].bp_sib_bh); in nilfs_btree_prepare_insert()
1183 nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1187 nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat); in nilfs_btree_prepare_insert()
1189 *levelp = level; in nilfs_btree_prepare_insert()
1199 int level; in nilfs_btree_commit_insert() local
1208 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_insert()
1210 &path[level - 1].bp_newreq, dat); in nilfs_btree_commit_insert()
1211 path[level].bp_op(btree, path, level, &key, &ptr); in nilfs_btree_commit_insert()
1222 int level, ret; in nilfs_btree_insert() local
1236 ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats); in nilfs_btree_insert()
1239 nilfs_btree_commit_insert(btree, path, level, key, ptr); in nilfs_btree_insert()
1249 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_delete() argument
1254 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_delete()
1255 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_delete()
1257 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1259 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_do_delete()
1260 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_do_delete()
1261 if (path[level].bp_index == 0) in nilfs_btree_do_delete()
1262 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_do_delete()
1266 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1274 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_borrow_left() argument
1279 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_borrow_left()
1281 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_left()
1282 left = nilfs_btree_get_sib_node(path, level); in nilfs_btree_borrow_left()
1291 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_borrow_left()
1292 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_borrow_left()
1293 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_borrow_left()
1294 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_borrow_left()
1296 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_borrow_left()
1299 brelse(path[level].bp_sib_bh); in nilfs_btree_borrow_left()
1300 path[level].bp_sib_bh = NULL; in nilfs_btree_borrow_left()
1301 path[level].bp_index += n; in nilfs_btree_borrow_left()
1306 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_borrow_right() argument
1311 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_borrow_right()
1313 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_right()
1314 right = nilfs_btree_get_sib_node(path, level); in nilfs_btree_borrow_right()
1323 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_borrow_right()
1324 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_borrow_right()
1325 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_borrow_right()
1326 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_borrow_right()
1328 path[level + 1].bp_index++; in nilfs_btree_borrow_right()
1329 nilfs_btree_promote_key(btree, path, level + 1, in nilfs_btree_borrow_right()
1331 path[level + 1].bp_index--; in nilfs_btree_borrow_right()
1333 brelse(path[level].bp_sib_bh); in nilfs_btree_borrow_right()
1334 path[level].bp_sib_bh = NULL; in nilfs_btree_borrow_right()
1339 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_concat_left() argument
1344 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_concat_left()
1346 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_left()
1347 left = nilfs_btree_get_sib_node(path, level); in nilfs_btree_concat_left()
1354 if (!buffer_dirty(path[level].bp_sib_bh)) in nilfs_btree_concat_left()
1355 mark_buffer_dirty(path[level].bp_sib_bh); in nilfs_btree_concat_left()
1357 nilfs_btnode_delete(path[level].bp_bh); in nilfs_btree_concat_left()
1358 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_concat_left()
1359 path[level].bp_sib_bh = NULL; in nilfs_btree_concat_left()
1360 path[level].bp_index += nilfs_btree_node_get_nchildren(left); in nilfs_btree_concat_left()
1365 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_concat_right() argument
1370 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_concat_right()
1372 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_right()
1373 right = nilfs_btree_get_sib_node(path, level); in nilfs_btree_concat_right()
1380 if (!buffer_dirty(path[level].bp_bh)) in nilfs_btree_concat_right()
1381 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_concat_right()
1383 nilfs_btnode_delete(path[level].bp_sib_bh); in nilfs_btree_concat_right()
1384 path[level].bp_sib_bh = NULL; in nilfs_btree_concat_right()
1385 path[level + 1].bp_index++; in nilfs_btree_concat_right()
1390 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_shrink() argument
1395 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_shrink()
1398 child = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_shrink()
1403 nilfs_btree_node_set_level(root, level); in nilfs_btree_shrink()
1408 nilfs_btnode_delete(path[level].bp_bh); in nilfs_btree_shrink()
1409 path[level].bp_bh = NULL; in nilfs_btree_shrink()
1414 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_nop() argument
1427 int pindex, dindex, level, ncmin, ncmax, ncblk, ret; in nilfs_btree_prepare_delete() local
1434 for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index; in nilfs_btree_prepare_delete()
1435 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_delete()
1436 level++) { in nilfs_btree_prepare_delete()
1437 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_delete()
1438 path[level].bp_oldreq.bpr_ptr = in nilfs_btree_prepare_delete()
1441 &path[level].bp_oldreq, dat); in nilfs_btree_prepare_delete()
1446 path[level].bp_op = nilfs_btree_do_delete; in nilfs_btree_prepare_delete()
1451 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_prepare_delete()
1452 pindex = path[level + 1].bp_index; in nilfs_btree_prepare_delete()
1464 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1465 path[level].bp_op = nilfs_btree_borrow_left; in nilfs_btree_prepare_delete()
1469 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1470 path[level].bp_op = nilfs_btree_concat_left; in nilfs_btree_prepare_delete()
1484 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1485 path[level].bp_op = nilfs_btree_borrow_right; in nilfs_btree_prepare_delete()
1489 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1490 path[level].bp_op = nilfs_btree_concat_right; in nilfs_btree_prepare_delete()
1505 WARN_ON(level != nilfs_btree_height(btree) - 2); in nilfs_btree_prepare_delete()
1508 path[level].bp_op = nilfs_btree_shrink; in nilfs_btree_prepare_delete()
1510 level++; in nilfs_btree_prepare_delete()
1511 path[level].bp_op = nilfs_btree_nop; in nilfs_btree_prepare_delete()
1514 path[level].bp_op = nilfs_btree_do_delete; in nilfs_btree_prepare_delete()
1522 path[level].bp_op = nilfs_btree_do_delete; in nilfs_btree_prepare_delete()
1527 path[level].bp_oldreq.bpr_ptr = in nilfs_btree_prepare_delete()
1531 ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat); in nilfs_btree_prepare_delete()
1537 *levelp = level; in nilfs_btree_prepare_delete()
1542 nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); in nilfs_btree_prepare_delete()
1544 for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) { in nilfs_btree_prepare_delete()
1545 brelse(path[level].bp_sib_bh); in nilfs_btree_prepare_delete()
1546 nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat); in nilfs_btree_prepare_delete()
1548 *levelp = level; in nilfs_btree_prepare_delete()
1557 int level; in nilfs_btree_commit_delete() local
1559 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_delete()
1560 nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat); in nilfs_btree_commit_delete()
1561 path[level].bp_op(btree, path, level, NULL, NULL); in nilfs_btree_commit_delete()
1574 int level, ret; in nilfs_btree_delete() local
1588 ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat); in nilfs_btree_delete()
1591 nilfs_btree_commit_delete(btree, path, level, dat); in nilfs_btree_delete()
1805 /* create child node at level 1 */ in nilfs_btree_commit_convert_and_insert()
1817 /* create root node at level 2 */ in nilfs_btree_commit_convert_and_insert()
1826 /* create root node at level 1 */ in nilfs_btree_commit_convert_and_insert()
1884 int level, in nilfs_btree_propagate_p() argument
1887 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_propagate_p()
1888 !buffer_dirty(path[level].bp_bh)) in nilfs_btree_propagate_p()
1889 mark_buffer_dirty(path[level].bp_bh); in nilfs_btree_propagate_p()
1896 int level, struct inode *dat) in nilfs_btree_prepare_update_v() argument
1901 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_prepare_update_v()
1902 path[level].bp_oldreq.bpr_ptr = in nilfs_btree_prepare_update_v()
1903 nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, in nilfs_btree_prepare_update_v()
1905 path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1; in nilfs_btree_prepare_update_v()
1906 ret = nilfs_dat_prepare_update(dat, &path[level].bp_oldreq.bpr_req, in nilfs_btree_prepare_update_v()
1907 &path[level].bp_newreq.bpr_req); in nilfs_btree_prepare_update_v()
1911 if (buffer_nilfs_node(path[level].bp_bh)) { in nilfs_btree_prepare_update_v()
1912 path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr; in nilfs_btree_prepare_update_v()
1913 path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr; in nilfs_btree_prepare_update_v()
1914 path[level].bp_ctxt.bh = path[level].bp_bh; in nilfs_btree_prepare_update_v()
1917 &path[level].bp_ctxt); in nilfs_btree_prepare_update_v()
1920 &path[level].bp_oldreq.bpr_req, in nilfs_btree_prepare_update_v()
1921 &path[level].bp_newreq.bpr_req); in nilfs_btree_prepare_update_v()
1931 int level, struct inode *dat) in nilfs_btree_commit_update_v() argument
1936 nilfs_dat_commit_update(dat, &path[level].bp_oldreq.bpr_req, in nilfs_btree_commit_update_v()
1937 &path[level].bp_newreq.bpr_req, in nilfs_btree_commit_update_v()
1940 if (buffer_nilfs_node(path[level].bp_bh)) { in nilfs_btree_commit_update_v()
1943 &path[level].bp_ctxt); in nilfs_btree_commit_update_v()
1944 path[level].bp_bh = path[level].bp_ctxt.bh; in nilfs_btree_commit_update_v()
1946 set_buffer_nilfs_volatile(path[level].bp_bh); in nilfs_btree_commit_update_v()
1948 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_commit_update_v()
1949 nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, in nilfs_btree_commit_update_v()
1950 path[level].bp_newreq.bpr_ptr, ncmax); in nilfs_btree_commit_update_v()
1955 int level, struct inode *dat) in nilfs_btree_abort_update_v() argument
1957 nilfs_dat_abort_update(dat, &path[level].bp_oldreq.bpr_req, in nilfs_btree_abort_update_v()
1958 &path[level].bp_newreq.bpr_req); in nilfs_btree_abort_update_v()
1959 if (buffer_nilfs_node(path[level].bp_bh)) in nilfs_btree_abort_update_v()
1962 &path[level].bp_ctxt); in nilfs_btree_abort_update_v()
1970 int level, ret; in nilfs_btree_prepare_propagate_v() local
1972 level = minlevel; in nilfs_btree_prepare_propagate_v()
1973 if (!buffer_nilfs_volatile(path[level].bp_bh)) { in nilfs_btree_prepare_propagate_v()
1974 ret = nilfs_btree_prepare_update_v(btree, path, level, dat); in nilfs_btree_prepare_propagate_v()
1978 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_prepare_propagate_v()
1979 !buffer_dirty(path[level].bp_bh)) { in nilfs_btree_prepare_propagate_v()
1981 WARN_ON(buffer_nilfs_volatile(path[level].bp_bh)); in nilfs_btree_prepare_propagate_v()
1982 ret = nilfs_btree_prepare_update_v(btree, path, level, dat); in nilfs_btree_prepare_propagate_v()
1988 *maxlevelp = level - 1; in nilfs_btree_prepare_propagate_v()
1993 while (--level > minlevel) in nilfs_btree_prepare_propagate_v()
1994 nilfs_btree_abort_update_v(btree, path, level, dat); in nilfs_btree_prepare_propagate_v()
1995 if (!buffer_nilfs_volatile(path[level].bp_bh)) in nilfs_btree_prepare_propagate_v()
1996 nilfs_btree_abort_update_v(btree, path, level, dat); in nilfs_btree_prepare_propagate_v()
2006 int level; in nilfs_btree_commit_propagate_v() local
2011 for (level = minlevel + 1; level <= maxlevel; level++) in nilfs_btree_commit_propagate_v()
2012 nilfs_btree_commit_update_v(btree, path, level, dat); in nilfs_btree_commit_propagate_v()
2017 int level, struct buffer_head *bh) in nilfs_btree_propagate_v() argument
2026 path[level].bp_bh = bh; in nilfs_btree_propagate_v()
2027 ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel, in nilfs_btree_propagate_v()
2032 if (buffer_nilfs_volatile(path[level].bp_bh)) { in nilfs_btree_propagate_v()
2033 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_propagate_v()
2035 path[level + 1].bp_index, in nilfs_btree_propagate_v()
2042 nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); in nilfs_btree_propagate_v()
2045 brelse(path[level].bp_bh); in nilfs_btree_propagate_v()
2046 path[level].bp_bh = NULL; in nilfs_btree_propagate_v()
2056 int level, ret; in nilfs_btree_propagate() local
2067 level = nilfs_btree_node_get_level(node); in nilfs_btree_propagate()
2070 level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_propagate()
2073 ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); in nilfs_btree_propagate()
2077 "writing node/leaf block does not appear in b-tree (ino=%lu) at key=%llu, level=%d", in nilfs_btree_propagate()
2079 (unsigned long long)key, level); in nilfs_btree_propagate()
2084 nilfs_btree_propagate_v(btree, path, level, bh) : in nilfs_btree_propagate()
2085 nilfs_btree_propagate_p(btree, path, level, bh); in nilfs_btree_propagate()
2107 int level; in nilfs_btree_add_dirty_buffer() local
2112 level = nilfs_btree_node_get_level(node); in nilfs_btree_add_dirty_buffer()
2113 if (level < NILFS_BTREE_LEVEL_NODE_MIN || in nilfs_btree_add_dirty_buffer()
2114 level >= NILFS_BTREE_LEVEL_MAX) { in nilfs_btree_add_dirty_buffer()
2117 "invalid btree level: %d (key=%llu, ino=%lu, blocknr=%llu)", in nilfs_btree_add_dirty_buffer()
2118 level, (unsigned long long)key, in nilfs_btree_add_dirty_buffer()
2124 list_for_each(head, &lists[level]) { in nilfs_btree_add_dirty_buffer()
2142 int level, i; in nilfs_btree_lookup_dirty_buffers() local
2144 for (level = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_lookup_dirty_buffers()
2145 level < NILFS_BTREE_LEVEL_MAX; in nilfs_btree_lookup_dirty_buffers()
2146 level++) in nilfs_btree_lookup_dirty_buffers()
2147 INIT_LIST_HEAD(&lists[level]); in nilfs_btree_lookup_dirty_buffers()
2165 for (level = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_lookup_dirty_buffers()
2166 level < NILFS_BTREE_LEVEL_MAX; in nilfs_btree_lookup_dirty_buffers()
2167 level++) in nilfs_btree_lookup_dirty_buffers()
2168 list_splice_tail(&lists[level], listp); in nilfs_btree_lookup_dirty_buffers()
2173 int level, in nilfs_btree_assign_p() argument
2183 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_assign_p()
2184 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, in nilfs_btree_assign_p()
2187 path[level].bp_ctxt.oldkey = ptr; in nilfs_btree_assign_p()
2188 path[level].bp_ctxt.newkey = blocknr; in nilfs_btree_assign_p()
2189 path[level].bp_ctxt.bh = *bh; in nilfs_btree_assign_p()
2192 &path[level].bp_ctxt); in nilfs_btree_assign_p()
2197 &path[level].bp_ctxt); in nilfs_btree_assign_p()
2198 *bh = path[level].bp_ctxt.bh; in nilfs_btree_assign_p()
2201 nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, in nilfs_btree_assign_p()
2204 key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); in nilfs_btree_assign_p()
2207 binfo->bi_dat.bi_level = level; in nilfs_btree_assign_p()
2214 int level, in nilfs_btree_assign_v() argument
2226 parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); in nilfs_btree_assign_v()
2227 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, in nilfs_btree_assign_v()
2235 key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); in nilfs_btree_assign_v()
2251 int level, ret; in nilfs_btree_assign() local
2260 level = nilfs_btree_node_get_level(node); in nilfs_btree_assign()
2263 level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_assign()
2266 ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0); in nilfs_btree_assign()
2273 nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : in nilfs_btree_assign()
2274 nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); in nilfs_btree_assign()
2309 static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) in nilfs_btree_mark() argument
2320 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0); in nilfs_btree_mark()