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()
437 struct nilfs_btree_node *node; in nilfs_btree_get_node() local
440 node = nilfs_btree_get_root(btree); in nilfs_btree_get_node()
443 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_get_node()
446 return node; in nilfs_btree_get_node()
450 struct nilfs_btree_node *node, int level) in nilfs_btree_bad_node() argument
452 if (unlikely(nilfs_btree_node_get_level(node) != level)) { in nilfs_btree_bad_node()
457 nilfs_btree_node_get_level(node), level); in nilfs_btree_bad_node()
464 struct nilfs_btree_node *node; /* parent node */ member
504 ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax); in __nilfs_btree_get_block()
551 struct nilfs_btree_node *node; in nilfs_btree_do_lookup() local
556 node = nilfs_btree_get_root(btree); in nilfs_btree_do_lookup()
557 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup()
558 if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) in nilfs_btree_do_lookup()
561 found = nilfs_btree_node_lookup(node, key, &index); in nilfs_btree_do_lookup()
562 ptr = nilfs_btree_node_get_ptr(node, index, in nilfs_btree_do_lookup()
572 p.node = nilfs_btree_get_node(btree, path, level + 1, in nilfs_btree_do_lookup()
583 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup()
584 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup()
587 found = nilfs_btree_node_lookup(node, key, &index); in nilfs_btree_do_lookup()
591 ptr = nilfs_btree_node_get_ptr(node, index, ncmax); in nilfs_btree_do_lookup()
612 struct nilfs_btree_node *node; in nilfs_btree_do_lookup_last() local
616 node = nilfs_btree_get_root(btree); in nilfs_btree_do_lookup_last()
617 index = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_do_lookup_last()
620 level = nilfs_btree_node_get_level(node); in nilfs_btree_do_lookup_last()
621 ptr = nilfs_btree_node_get_ptr(node, index, in nilfs_btree_do_lookup_last()
631 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_lookup_last()
632 if (nilfs_btree_bad_node(btree, node, level)) in nilfs_btree_do_lookup_last()
634 index = nilfs_btree_node_get_nchildren(node) - 1; in nilfs_btree_do_lookup_last()
635 ptr = nilfs_btree_node_get_ptr(node, index, ncmax); in nilfs_btree_do_lookup_last()
640 *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()
758 p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax); in nilfs_btree_lookup_contig()
761 if (p.index >= nilfs_btree_node_get_nchildren(p.node) || in nilfs_btree_lookup_contig()
762 nilfs_btree_node_get_key(p.node, p.index) != key + cnt) in nilfs_btree_lookup_contig()
764 ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax); in nilfs_btree_lookup_contig()
774 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_lookup_contig()
818 struct nilfs_btree_node *node; in nilfs_btree_do_insert() local
822 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_insert()
824 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
831 nilfs_btree_node_get_key(node, in nilfs_btree_do_insert()
834 node = nilfs_btree_get_root(btree); in nilfs_btree_do_insert()
835 nilfs_btree_node_insert(node, path[level].bp_index, in nilfs_btree_do_insert()
845 struct nilfs_btree_node *node, *left; in nilfs_btree_carry_left() local
848 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_left()
850 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_left()
862 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); in nilfs_btree_carry_left()
870 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_carry_left()
891 struct nilfs_btree_node *node, *right; in nilfs_btree_carry_right() local
894 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_carry_right()
896 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_right()
908 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); in nilfs_btree_carry_right()
924 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_carry_right()
938 struct nilfs_btree_node *node, *right; in nilfs_btree_split() local
941 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_split()
943 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_split()
953 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); in nilfs_btree_split()
961 path[level].bp_index -= nilfs_btree_node_get_nchildren(node); in nilfs_btree_split()
1016 struct nilfs_btree_node *node; in nilfs_btree_find_near() local
1025 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1026 return nilfs_btree_node_get_ptr(node, in nilfs_btree_find_near()
1034 node = nilfs_btree_get_node(btree, path, level, &ncmax); in nilfs_btree_find_near()
1035 return nilfs_btree_node_get_ptr(node, path[level].bp_index, in nilfs_btree_find_near()
1068 struct nilfs_btree_node *node, *parent, *sib; in nilfs_btree_prepare_insert() local
1092 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_insert()
1093 if (nilfs_btree_node_get_nchildren(node) < ncblk) { in nilfs_btree_prepare_insert()
1160 node = nilfs_btree_get_root(btree); in nilfs_btree_prepare_insert()
1161 if (nilfs_btree_node_get_nchildren(node) < in nilfs_btree_prepare_insert()
1268 struct nilfs_btree_node *node; in nilfs_btree_do_delete() local
1272 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_do_delete()
1274 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1280 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_do_delete()
1282 node = nilfs_btree_get_root(btree); in nilfs_btree_do_delete()
1283 nilfs_btree_node_delete(node, path[level].bp_index, in nilfs_btree_do_delete()
1293 struct nilfs_btree_node *node, *left; in nilfs_btree_borrow_left() local
1298 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_left()
1300 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_borrow_left()
1306 nilfs_btree_node_move_right(left, node, n, ncblk, ncblk); in nilfs_btree_borrow_left()
1314 nilfs_btree_node_get_key(node, 0)); in nilfs_btree_borrow_left()
1325 struct nilfs_btree_node *node, *right; in nilfs_btree_borrow_right() local
1330 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_borrow_right()
1332 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_borrow_right()
1338 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); in nilfs_btree_borrow_right()
1358 struct nilfs_btree_node *node, *left; in nilfs_btree_concat_left() local
1363 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_left()
1367 n = nilfs_btree_node_get_nchildren(node); in nilfs_btree_concat_left()
1369 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk); in nilfs_btree_concat_left()
1384 struct nilfs_btree_node *node, *right; in nilfs_btree_concat_right() local
1389 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_concat_right()
1395 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); in nilfs_btree_concat_right()
1442 struct nilfs_btree_node *node, *parent, *sib; in nilfs_btree_prepare_delete() local
1454 node = nilfs_btree_get_nonroot_node(path, level); in nilfs_btree_prepare_delete()
1456 nilfs_btree_node_get_ptr(node, dindex, ncblk); in nilfs_btree_prepare_delete()
1462 if (nilfs_btree_node_get_nchildren(node) > ncmin) { in nilfs_btree_prepare_delete()
1523 if (nilfs_btree_node_get_nchildren(node) - 1 <= in nilfs_btree_prepare_delete()
1543 node = nilfs_btree_get_root(btree); in nilfs_btree_prepare_delete()
1545 nilfs_btree_node_get_ptr(node, dindex, in nilfs_btree_prepare_delete()
1656 struct nilfs_btree_node *root, *node; in nilfs_btree_check_delete() local
1665 node = root; in nilfs_btree_check_delete()
1676 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_check_delete()
1682 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_check_delete()
1683 maxkey = nilfs_btree_node_get_key(node, nchildren - 1); in nilfs_btree_check_delete()
1685 nilfs_btree_node_get_key(node, nchildren - 2) : 0; in nilfs_btree_check_delete()
1696 struct nilfs_btree_node *node, *root; in nilfs_btree_gather_data() local
1706 node = root; in nilfs_btree_gather_data()
1717 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_gather_data()
1721 node = NULL; in nilfs_btree_gather_data()
1725 nchildren = nilfs_btree_node_get_nchildren(node); in nilfs_btree_gather_data()
1728 dkeys = nilfs_btree_node_dkeys(node); in nilfs_btree_gather_data()
1729 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()
2075 struct nilfs_btree_node *node; in nilfs_btree_propagate() local
2086 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_propagate()
2087 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_propagate()
2088 level = nilfs_btree_node_get_level(node); in nilfs_btree_propagate()
2126 struct nilfs_btree_node *node, *cnode; in nilfs_btree_add_dirty_buffer() local
2131 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_add_dirty_buffer()
2132 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_add_dirty_buffer()
2133 level = nilfs_btree_node_get_level(node); in nilfs_btree_add_dirty_buffer()
2271 struct nilfs_btree_node *node; in nilfs_btree_assign() local
2280 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign()
2281 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_assign()
2282 level = nilfs_btree_node_get_level(node); in nilfs_btree_assign()
2309 struct nilfs_btree_node *node; in nilfs_btree_assign_gc() local
2319 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign_gc()
2320 key = nilfs_btree_node_get_key(node, 0); in nilfs_btree_assign_gc()