Lines Matching refs:node
74 static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node) in nilfs_btree_node_get_flags() argument
76 return node->bn_flags; in nilfs_btree_node_get_flags()
80 nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags) in nilfs_btree_node_set_flags() argument
82 node->bn_flags = flags; in nilfs_btree_node_set_flags()
85 static int nilfs_btree_node_root(const struct nilfs_btree_node *node) in nilfs_btree_node_root() argument
87 return nilfs_btree_node_get_flags(node) & NILFS_BTREE_NODE_ROOT; in nilfs_btree_node_root()
90 static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node) in nilfs_btree_node_get_level() argument
92 return node->bn_level; in nilfs_btree_node_get_level()
96 nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) in nilfs_btree_node_set_level() argument
98 node->bn_level = level; in nilfs_btree_node_set_level()
101 static int nilfs_btree_node_get_nchildren(const struct nilfs_btree_node *node) in nilfs_btree_node_get_nchildren() argument
103 return le16_to_cpu(node->bn_nchildren); in nilfs_btree_node_get_nchildren()
107 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren) in nilfs_btree_node_set_nchildren() argument
109 node->bn_nchildren = cpu_to_le16(nchildren); in nilfs_btree_node_set_nchildren()
123 nilfs_btree_node_dkeys(const struct nilfs_btree_node *node) in nilfs_btree_node_dkeys() argument
125 return (__le64 *)((char *)(node + 1) + in nilfs_btree_node_dkeys()
126 (nilfs_btree_node_root(node) ? in nilfs_btree_node_dkeys()
131 nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax) in nilfs_btree_node_dptrs() argument
133 return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax); in nilfs_btree_node_dptrs()
137 nilfs_btree_node_get_key(const struct nilfs_btree_node *node, int index) in nilfs_btree_node_get_key() argument
139 return le64_to_cpu(*(nilfs_btree_node_dkeys(node) + index)); in nilfs_btree_node_get_key()
143 nilfs_btree_node_set_key(struct nilfs_btree_node *node, int index, __u64 key) in nilfs_btree_node_set_key() argument
145 *(nilfs_btree_node_dkeys(node) + index) = cpu_to_le64(key); in nilfs_btree_node_set_key()
149 nilfs_btree_node_get_ptr(const struct nilfs_btree_node *node, int index, in nilfs_btree_node_get_ptr() argument
152 return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index)); in nilfs_btree_node_get_ptr()
156 nilfs_btree_node_set_ptr(struct nilfs_btree_node *node, int index, __u64 ptr, in nilfs_btree_node_set_ptr() argument
159 *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr); in nilfs_btree_node_set_ptr()
162 static void nilfs_btree_node_init(struct nilfs_btree_node *node, int flags, in nilfs_btree_node_init() argument
170 nilfs_btree_node_set_flags(node, flags); in nilfs_btree_node_init()
171 nilfs_btree_node_set_level(node, level); in nilfs_btree_node_init()
172 nilfs_btree_node_set_nchildren(node, nchildren); in nilfs_btree_node_init()
174 dkeys = nilfs_btree_node_dkeys(node); in nilfs_btree_node_init()
175 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_node_init()
239 static void nilfs_btree_node_insert(struct nilfs_btree_node *node, int index, in nilfs_btree_node_insert() argument
246 dkeys = nilfs_btree_node_dkeys(node); in nilfs_btree_node_insert()
247 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_node_insert()
248 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_node_insert()
258 nilfs_btree_node_set_nchildren(node, nchildren); in nilfs_btree_node_insert()
262 static void nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, in nilfs_btree_node_delete() argument
271 dkeys = nilfs_btree_node_dkeys(node); in nilfs_btree_node_delete()
272 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_node_delete()
275 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_node_delete()
288 nilfs_btree_node_set_nchildren(node, nchildren); in nilfs_btree_node_delete()
291 static int nilfs_btree_node_lookup(const struct nilfs_btree_node *node, in nilfs_btree_node_lookup() argument
299 high = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_node_lookup()
304 nkey = nilfs_btree_node_get_key(node, index); in nilfs_btree_node_lookup()
318 if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) { in nilfs_btree_node_lookup()
339 static int nilfs_btree_node_broken(const struct nilfs_btree_node *node, in nilfs_btree_node_broken() argument
346 level = nilfs_btree_node_get_level(node); in nilfs_btree_node_broken()
347 flags = nilfs_btree_node_get_flags(node); in nilfs_btree_node_broken()
348 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_node_broken()
371 static int nilfs_btree_root_broken(const struct nilfs_btree_node *node, in nilfs_btree_root_broken() argument
377 level = nilfs_btree_node_get_level(node); in nilfs_btree_root_broken()
378 flags = nilfs_btree_node_get_flags(node); in nilfs_btree_root_broken()
379 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_root_broken()
438 struct nilfs_btree_node *node; in nilfs_btree_get_node() local
441 node = nilfs_btree_get_root(btree); in nilfs_btree_get_node()
444 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_get_node()
447 return node; in nilfs_btree_get_node()
451 struct nilfs_btree_node *node, int level) in nilfs_btree_bad_node() argument
453 if (unlikely(nilfs_btree_node_get_level(node) != level)) { in nilfs_btree_bad_node()
458 nilfs_btree_node_get_level(node), level); in nilfs_btree_bad_node()
465 struct nilfs_btree_node *node; /* parent node */ member
505 ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax); in __nilfs_btree_get_block()
552 struct nilfs_btree_node *node; in nilfs_btree_do_lookup() local
557 node = nilfs_btree_get_root(btree); in nilfs_btree_do_lookup()
558 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup()
559 if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) in nilfs_btree_do_lookup()
562 found = nilfs_btree_node_lookup(node, key, &index); in nilfs_btree_do_lookup()
563 ptr = nilfs_btree_node_get_ptr(node, index, in nilfs_btree_do_lookup()
573 p.node = nilfs_btree_get_node(btree, path, level + 1, in nilfs_btree_do_lookup()
584 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup()
585 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup()
588 found = nilfs_btree_node_lookup(node, key, &index); in nilfs_btree_do_lookup()
592 ptr = nilfs_btree_node_get_ptr(node, index, ncmax); in nilfs_btree_do_lookup()
613 struct nilfs_btree_node *node; in nilfs_btree_do_lookup_last() local
617 node = nilfs_btree_get_root(btree); in nilfs_btree_do_lookup_last()
618 index = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_do_lookup_last()
621 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup_last()
622 ptr = nilfs_btree_node_get_ptr(node, index, in nilfs_btree_do_lookup_last()
632 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup_last()
633 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup_last()
635 index = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_do_lookup_last()
636 ptr = nilfs_btree_node_get_ptr(node, index, ncmax); in nilfs_btree_do_lookup_last()
641 *keyp = nilfs_btree_node_get_key(node, index); in nilfs_btree_do_lookup_last()
661 struct nilfs_btree_node *node; in nilfs_btree_get_next_key() local
669 node = nilfs_btree_get_root(btree); in nilfs_btree_get_next_key()
671 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_get_next_key()
674 if (index < nilfs_btree_node_get_nchildren(node)) { in nilfs_btree_get_next_key()
676 *nextkey = nilfs_btree_node_get_key(node, index); in nilfs_btree_get_next_key()
707 struct nilfs_btree_node *node; in nilfs_btree_lookup_contig() local
735 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_lookup_contig()
738 while (index < nilfs_btree_node_get_nchildren(node)) { in nilfs_btree_lookup_contig()
739 if (nilfs_btree_node_get_key(node, index) != in nilfs_btree_lookup_contig()
742 ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax); in nilfs_btree_lookup_contig()
757 p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax); in nilfs_btree_lookup_contig()
760 if (p.index >= nilfs_btree_node_get_nchildren(p.node) || in nilfs_btree_lookup_contig()
761 nilfs_btree_node_get_key(p.node, p.index) != key + cnt) in nilfs_btree_lookup_contig()
763 ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax); in nilfs_btree_lookup_contig()
773 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_lookup_contig()
817 struct nilfs_btree_node *node; in nilfs_btree_do_insert() local
821 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_insert()
823 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
830 nilfs_btree_node_get_key(node, in nilfs_btree_do_insert()
833 node = nilfs_btree_get_root(btree); in nilfs_btree_do_insert()
834 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
844 struct nilfs_btree_node *node, *left; in nilfs_btree_carry_left() local
847 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_left()
849 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_left()
861 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); in nilfs_btree_carry_left()
869 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_carry_left()
890 struct nilfs_btree_node *node, *right; in nilfs_btree_carry_right() local
893 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_right()
895 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_right()
907 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); in nilfs_btree_carry_right()
923 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_right()
937 struct nilfs_btree_node *node, *right; in nilfs_btree_split() local
940 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_split()
942 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_split()
952 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); in nilfs_btree_split()
960 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_split()
1015 struct nilfs_btree_node *node; in nilfs_btree_find_near() local
1024 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1025 return nilfs_btree_node_get_ptr(node, in nilfs_btree_find_near()
1033 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1034 return nilfs_btree_node_get_ptr(node, path[level].bp_index, in nilfs_btree_find_near()
1067 struct nilfs_btree_node *node, *parent, *sib; in nilfs_btree_prepare_insert() local
1091 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_insert()
1092 if (nilfs_btree_node_get_nchildren(node) < ncblk) { in nilfs_btree_prepare_insert()
1159 node = nilfs_btree_get_root(btree); in nilfs_btree_prepare_insert()
1160 if (nilfs_btree_node_get_nchildren(node) < in nilfs_btree_prepare_insert()
1267 struct nilfs_btree_node *node; in nilfs_btree_do_delete() local
1271 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_delete()
1273 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1279 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_do_delete()
1281 node = nilfs_btree_get_root(btree); in nilfs_btree_do_delete()
1282 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1292 struct nilfs_btree_node *node, *left; in nilfs_btree_borrow_left() local
1297 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_left()
1299 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_borrow_left()
1305 nilfs_btree_node_move_right(left, node, n, ncblk, ncblk); in nilfs_btree_borrow_left()
1313 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_borrow_left()
1324 struct nilfs_btree_node *node, *right; in nilfs_btree_borrow_right() local
1329 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_right()
1331 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_borrow_right()
1337 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); in nilfs_btree_borrow_right()
1357 struct nilfs_btree_node *node, *left; in nilfs_btree_concat_left() local
1362 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_left()
1366 n = nilfs_btree_node_get_nchildren(node); in nilfs_btree_concat_left()
1368 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); in nilfs_btree_concat_left()
1383 struct nilfs_btree_node *node, *right; in nilfs_btree_concat_right() local
1388 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_right()
1394 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); in nilfs_btree_concat_right()
1441 struct nilfs_btree_node *node, *parent, *sib; in nilfs_btree_prepare_delete() local
1453 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_delete()
1455 nilfs_btree_node_get_ptr(node, dindex, ncblk); in nilfs_btree_prepare_delete()
1461 if (nilfs_btree_node_get_nchildren(node) > ncmin) { in nilfs_btree_prepare_delete()
1522 if (nilfs_btree_node_get_nchildren(node) - 1 <= in nilfs_btree_prepare_delete()
1542 node = nilfs_btree_get_root(btree); in nilfs_btree_prepare_delete()
1544 nilfs_btree_node_get_ptr(node, dindex, in nilfs_btree_prepare_delete()
1655 struct nilfs_btree_node *root, *node; in nilfs_btree_check_delete() local
1668 node = root; in nilfs_btree_check_delete()
1678 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_check_delete()
1679 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_check_delete()
1685 maxkey = nilfs_btree_node_get_key(node, nchildren - 1); in nilfs_btree_check_delete()
1687 nilfs_btree_node_get_key(node, nchildren - 2) : 0; in nilfs_btree_check_delete()
1697 struct nilfs_btree_node *node, *root; in nilfs_btree_gather_data() local
1707 node = root; in nilfs_btree_gather_data()
1718 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_gather_data()
1722 node = NULL; in nilfs_btree_gather_data()
1726 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_gather_data()
1729 dkeys = nilfs_btree_node_dkeys(node); in nilfs_btree_gather_data()
1730 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_gather_data()
1807 struct nilfs_btree_node *node; in nilfs_btree_commit_convert_and_insert() local
1827 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_commit_convert_and_insert()
1829 nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs); in nilfs_btree_commit_convert_and_insert()
1830 nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk); in nilfs_btree_commit_convert_and_insert()
1839 node = nilfs_btree_get_root(btree); in nilfs_btree_commit_convert_and_insert()
1841 nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 2, 1, in nilfs_btree_commit_convert_and_insert()
1848 node = nilfs_btree_get_root(btree); in nilfs_btree_commit_convert_and_insert()
1849 nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 1, n, in nilfs_btree_commit_convert_and_insert()
1852 nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, in nilfs_btree_commit_convert_and_insert()
2084 struct nilfs_btree_node *node; in nilfs_btree_propagate() local
2095 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_propagate()
2096 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_propagate()
2097 level = nilfs_btree_node_get_level(node); in nilfs_btree_propagate()
2137 struct nilfs_btree_node *node, *cnode; in nilfs_btree_add_dirty_buffer() local
2142 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_add_dirty_buffer()
2143 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_add_dirty_buffer()
2144 level = nilfs_btree_node_get_level(node); in nilfs_btree_add_dirty_buffer()
2283 struct nilfs_btree_node *node; in nilfs_btree_assign() local
2292 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign()
2293 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_assign()
2294 level = nilfs_btree_node_get_level(node); in nilfs_btree_assign()
2321 struct nilfs_btree_node *node; in nilfs_btree_assign_gc() local
2331 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign_gc()
2332 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_assign_gc()