rnchildren        188 fs/nilfs2/btree.c 	int lnchildren, rnchildren;
rnchildren        196 fs/nilfs2/btree.c 	rnchildren = nilfs_btree_node_get_nchildren(right);
rnchildren        200 fs/nilfs2/btree.c 	memmove(rdkeys, rdkeys + n, (rnchildren - n) * sizeof(*rdkeys));
rnchildren        201 fs/nilfs2/btree.c 	memmove(rdptrs, rdptrs + n, (rnchildren - n) * sizeof(*rdptrs));
rnchildren        204 fs/nilfs2/btree.c 	rnchildren -= n;
rnchildren        206 fs/nilfs2/btree.c 	nilfs_btree_node_set_nchildren(right, rnchildren);
rnchildren        216 fs/nilfs2/btree.c 	int lnchildren, rnchildren;
rnchildren        224 fs/nilfs2/btree.c 	rnchildren = nilfs_btree_node_get_nchildren(right);
rnchildren        226 fs/nilfs2/btree.c 	memmove(rdkeys + n, rdkeys, rnchildren * sizeof(*rdkeys));
rnchildren        227 fs/nilfs2/btree.c 	memmove(rdptrs + n, rdptrs, rnchildren * sizeof(*rdptrs));
rnchildren        232 fs/nilfs2/btree.c 	rnchildren += n;
rnchildren        234 fs/nilfs2/btree.c 	nilfs_btree_node_set_nchildren(right, rnchildren);
rnchildren        876 fs/nilfs2/btree.c 	int nchildren, rnchildren, n, move, ncblk;
rnchildren        881 fs/nilfs2/btree.c 	rnchildren = nilfs_btree_node_get_nchildren(right);
rnchildren        885 fs/nilfs2/btree.c 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;
rnchildren       1310 fs/nilfs2/btree.c 	int nchildren, rnchildren, n, ncblk;
rnchildren       1317 fs/nilfs2/btree.c 	rnchildren = nilfs_btree_node_get_nchildren(right);
rnchildren       1320 fs/nilfs2/btree.c 	n = (nchildren + rnchildren) / 2 - nchildren;