Lines Matching defs:ncblk
813 int ncblk;
817 ncblk = nilfs_btree_nchildren_per_block(btree);
819 *keyp, *ptrp, ncblk);
840 int nchildren, lnchildren, n, move, ncblk;
846 ncblk = nilfs_btree_nchildren_per_block(btree);
856 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
886 int nchildren, rnchildren, n, move, ncblk;
892 ncblk = nilfs_btree_nchildren_per_block(btree);
902 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
933 int nchildren, n, move, ncblk;
938 ncblk = nilfs_btree_nchildren_per_block(btree);
947 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
957 *keyp, *ptrp, ncblk);
983 int n, ncblk;
987 ncblk = nilfs_btree_nchildren_per_block(btree);
992 NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
1064 int pindex, level, ncmax, ncblk, ret;
1081 ncblk = nilfs_btree_nchildren_per_block(btree);
1087 if (nilfs_btree_node_get_nchildren(node) < ncblk) {
1104 if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
1122 if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
1148 nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL);
1173 0, level, 0, ncblk, NULL, NULL);
1263 int ncblk;
1267 ncblk = nilfs_btree_nchildren_per_block(btree);
1269 keyp, ptrp, ncblk);
1288 int nchildren, lnchildren, n, ncblk;
1296 ncblk = nilfs_btree_nchildren_per_block(btree);
1300 nilfs_btree_node_move_right(left, node, n, ncblk, ncblk);
1320 int nchildren, rnchildren, n, ncblk;
1328 ncblk = nilfs_btree_nchildren_per_block(btree);
1332 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1353 int n, ncblk;
1359 ncblk = nilfs_btree_nchildren_per_block(btree);
1363 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
1379 int n, ncblk;
1385 ncblk = nilfs_btree_nchildren_per_block(btree);
1389 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1404 int n, ncblk;
1410 ncblk = nilfs_btree_nchildren_per_block(btree);
1417 NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
1438 int pindex, dindex, level, ncmin, ncmax, ncblk, ret;
1443 ncblk = nilfs_btree_nchildren_per_block(btree);
1450 nilfs_btree_node_get_ptr(node, dindex, ncblk);
1802 int ncblk;
1820 ncblk = nilfs_btree_nchildren_per_block(btree);
1821 nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs);
1822 nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk);