nchildren 125 drivers/mfd/retu-mfd.c int nchildren; nchildren 132 drivers/mfd/retu-mfd.c .nchildren = ARRAY_SIZE(retu_devs), nchildren 139 drivers/mfd/retu-mfd.c .nchildren = ARRAY_SIZE(tahvo_devs), nchildren 274 drivers/mfd/retu-mfd.c ret = mfd_add_devices(rdev->dev, -1, rdat->children, rdat->nchildren, nchildren 106 fs/nilfs2/btree.c nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren) nchildren 108 fs/nilfs2/btree.c node->bn_nchildren = cpu_to_le16(nchildren); nchildren 162 fs/nilfs2/btree.c int level, int nchildren, int ncmax, nchildren 171 fs/nilfs2/btree.c nilfs_btree_node_set_nchildren(node, nchildren); nchildren 175 fs/nilfs2/btree.c for (i = 0; i < nchildren; i++) { nchildren 243 fs/nilfs2/btree.c int nchildren; nchildren 247 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 248 fs/nilfs2/btree.c if (index < nchildren) { nchildren 250 fs/nilfs2/btree.c (nchildren - index) * sizeof(*dkeys)); nchildren 252 fs/nilfs2/btree.c (nchildren - index) * sizeof(*dptrs)); nchildren 256 fs/nilfs2/btree.c nchildren++; nchildren 257 fs/nilfs2/btree.c nilfs_btree_node_set_nchildren(node, nchildren); nchildren 268 fs/nilfs2/btree.c int nchildren; nchildren 274 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 280 fs/nilfs2/btree.c if (index < nchildren - 1) { nchildren 282 fs/nilfs2/btree.c (nchildren - index - 1) * sizeof(*dkeys)); nchildren 284 fs/nilfs2/btree.c (nchildren - index - 1) * sizeof(*dptrs)); nchildren 286 fs/nilfs2/btree.c nchildren--; nchildren 287 fs/nilfs2/btree.c nilfs_btree_node_set_nchildren(node, nchildren); nchildren 342 fs/nilfs2/btree.c int level, flags, nchildren; nchildren 347 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 352 fs/nilfs2/btree.c nchildren < 0 || nchildren 353 fs/nilfs2/btree.c nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) { nchildren 357 fs/nilfs2/btree.c flags, nchildren); nchildren 373 fs/nilfs2/btree.c int level, flags, nchildren; nchildren 378 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 382 fs/nilfs2/btree.c nchildren < 0 || nchildren 383 fs/nilfs2/btree.c nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) { nchildren 386 fs/nilfs2/btree.c inode->i_ino, level, flags, nchildren); nchildren 830 fs/nilfs2/btree.c int nchildren, lnchildren, n, move, ncblk; nchildren 834 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 839 fs/nilfs2/btree.c n = (nchildren + lnchildren + 1) / 2 - lnchildren; nchildren 876 fs/nilfs2/btree.c int nchildren, rnchildren, n, move, ncblk; nchildren 880 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 885 fs/nilfs2/btree.c n = (nchildren + rnchildren + 1) / 2 - rnchildren; nchildren 886 fs/nilfs2/btree.c if (n > nchildren - path[level].bp_index) { nchildren 923 fs/nilfs2/btree.c int nchildren, n, move, ncblk; nchildren 927 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 931 fs/nilfs2/btree.c n = (nchildren + 1) / 2; nchildren 932 fs/nilfs2/btree.c if (n > nchildren - path[level].bp_index) { nchildren 1278 fs/nilfs2/btree.c int nchildren, lnchildren, n, ncblk; nchildren 1284 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 1288 fs/nilfs2/btree.c n = (nchildren + lnchildren) / 2 - nchildren; nchildren 1310 fs/nilfs2/btree.c int nchildren, rnchildren, n, ncblk; nchildren 1316 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 1320 fs/nilfs2/btree.c n = (nchildren + rnchildren) / 2 - nchildren; nchildren 1643 fs/nilfs2/btree.c int nchildren, ret; nchildren 1652 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(root); nchildren 1653 fs/nilfs2/btree.c if (nchildren > 1) nchildren 1655 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, nchildren 1666 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 1667 fs/nilfs2/btree.c maxkey = nilfs_btree_node_get_key(node, nchildren - 1); nchildren 1668 fs/nilfs2/btree.c nextmaxkey = (nchildren > 1) ? nchildren 1669 fs/nilfs2/btree.c nilfs_btree_node_get_key(node, nchildren - 2) : 0; nchildren 1684 fs/nilfs2/btree.c int nchildren, ncmax, i, ret; nchildren 1694 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(root); nchildren 1695 fs/nilfs2/btree.c WARN_ON(nchildren > 1); nchildren 1696 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(root, nchildren - 1, nchildren 1709 fs/nilfs2/btree.c nchildren = nilfs_btree_node_get_nchildren(node); nchildren 1710 fs/nilfs2/btree.c if (nchildren < nitems) nchildren 1711 fs/nilfs2/btree.c nitems = nchildren;