fs/nilfs2/btree.c

189 	int lnchildren, rnchildren;
197 	rnchildren = nilfs_btree_node_get_nchildren(right);
201 	memmove(rdkeys, rdkeys + n, (rnchildren - n) * sizeof(*rdkeys));
202 	memmove(rdptrs, rdptrs + n, (rnchildren - n) * sizeof(*rdptrs));
205 	rnchildren -= n;
207 	nilfs_btree_node_set_nchildren(right, rnchildren);
217 	int lnchildren, rnchildren;
225 	rnchildren = nilfs_btree_node_get_nchildren(right);
227 	memmove(rdkeys + n, rdkeys, rnchildren * sizeof(*rdkeys));
228 	memmove(rdptrs + n, rdptrs, rnchildren * sizeof(*rdptrs));
233 	rnchildren += n;
235 	nilfs_btree_node_set_nchildren(right, rnchildren);
891 	int nchildren, rnchildren, n, move, ncblk;
896 	rnchildren = nilfs_btree_node_get_nchildren(right);
900 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;
1325 	int nchildren, rnchildren, n, ncblk;
1332 	rnchildren = nilfs_btree_node_get_nchildren(right);
1335 	n = (nchildren + rnchildren) / 2 - nchildren;