Lines Matching defs:right
182 /* Assume the buffer heads corresponding to left and right are locked. */
184 struct nilfs_btree_node *right,
195 rdkeys = nilfs_btree_node_dkeys(right);
196 rdptrs = nilfs_btree_node_dptrs(right, rncmax);
197 rnchildren = nilfs_btree_node_get_nchildren(right);
207 nilfs_btree_node_set_nchildren(right, rnchildren);
210 /* Assume that the buffer heads corresponding to left and right are locked. */
212 struct nilfs_btree_node *right,
223 rdkeys = nilfs_btree_node_dkeys(right);
224 rdptrs = nilfs_btree_node_dptrs(right, rncmax);
225 rnchildren = nilfs_btree_node_get_nchildren(right);
235 nilfs_btree_node_set_nchildren(right, rnchildren);
757 /* look-up right sibling node */
886 struct nilfs_btree_node *node, *right;
890 right = nilfs_btree_get_sib_node(path, level);
892 rnchildren = nilfs_btree_node_get_nchildren(right);
903 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
912 nilfs_btree_node_get_key(right, 0));
933 struct nilfs_btree_node *node, *right;
937 right = nilfs_btree_get_sib_node(path, level);
948 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
957 nilfs_btree_node_insert(right, path[level].bp_index,
960 *keyp = nilfs_btree_node_get_key(right, 0);
969 *keyp = nilfs_btree_node_get_key(right, 0);
1115 /* right sibling */
1320 struct nilfs_btree_node *node, *right;
1326 right = nilfs_btree_get_sib_node(path, level);
1328 rnchildren = nilfs_btree_node_get_nchildren(right);
1333 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1342 nilfs_btree_node_get_key(right, 0));
1379 struct nilfs_btree_node *node, *right;
1385 right = nilfs_btree_get_sib_node(path, level);
1388 n = nilfs_btree_node_get_nchildren(right);
1390 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1488 /* right sibling */
1505 * When merging right sibling node
1507 * the right sibling node must be