lnchildren        188 fs/nilfs2/btree.c 	int lnchildren, rnchildren;
lnchildren        192 fs/nilfs2/btree.c 	lnchildren = nilfs_btree_node_get_nchildren(left);
lnchildren        198 fs/nilfs2/btree.c 	memcpy(ldkeys + lnchildren, rdkeys, n * sizeof(*rdkeys));
lnchildren        199 fs/nilfs2/btree.c 	memcpy(ldptrs + lnchildren, rdptrs, n * sizeof(*rdptrs));
lnchildren        203 fs/nilfs2/btree.c 	lnchildren += n;
lnchildren        205 fs/nilfs2/btree.c 	nilfs_btree_node_set_nchildren(left, lnchildren);
lnchildren        216 fs/nilfs2/btree.c 	int lnchildren, rnchildren;
lnchildren        220 fs/nilfs2/btree.c 	lnchildren = nilfs_btree_node_get_nchildren(left);
lnchildren        228 fs/nilfs2/btree.c 	memcpy(rdkeys, ldkeys + lnchildren - n, n * sizeof(*rdkeys));
lnchildren        229 fs/nilfs2/btree.c 	memcpy(rdptrs, ldptrs + lnchildren - n, n * sizeof(*rdptrs));
lnchildren        231 fs/nilfs2/btree.c 	lnchildren -= n;
lnchildren        233 fs/nilfs2/btree.c 	nilfs_btree_node_set_nchildren(left, lnchildren);
lnchildren        830 fs/nilfs2/btree.c 	int nchildren, lnchildren, n, move, ncblk;
lnchildren        835 fs/nilfs2/btree.c 	lnchildren = nilfs_btree_node_get_nchildren(left);
lnchildren        839 fs/nilfs2/btree.c 	n = (nchildren + lnchildren + 1) / 2 - lnchildren;
lnchildren        860 fs/nilfs2/btree.c 		path[level].bp_index += lnchildren;
lnchildren       1278 fs/nilfs2/btree.c 	int nchildren, lnchildren, n, ncblk;
lnchildren       1285 fs/nilfs2/btree.c 	lnchildren = nilfs_btree_node_get_nchildren(left);
lnchildren       1288 fs/nilfs2/btree.c 	n = (nchildren + lnchildren) / 2 - nchildren;