Lines Matching defs:ncblk
814 int ncblk;
818 ncblk = nilfs_btree_nchildren_per_block(btree);
820 *keyp, *ptrp, ncblk);
841 int nchildren, lnchildren, n, move, ncblk;
847 ncblk = nilfs_btree_nchildren_per_block(btree);
857 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
887 int nchildren, rnchildren, n, move, ncblk;
893 ncblk = nilfs_btree_nchildren_per_block(btree);
903 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
934 int nchildren, n, move, ncblk;
939 ncblk = nilfs_btree_nchildren_per_block(btree);
948 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
958 *keyp, *ptrp, ncblk);
984 int n, ncblk;
988 ncblk = nilfs_btree_nchildren_per_block(btree);
993 NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
1065 int pindex, level, ncmax, ncblk, ret;
1082 ncblk = nilfs_btree_nchildren_per_block(btree);
1088 if (nilfs_btree_node_get_nchildren(node) < ncblk) {
1105 if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
1123 if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
1149 nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL);
1174 0, level, 0, ncblk, NULL, NULL);
1264 int ncblk;
1268 ncblk = nilfs_btree_nchildren_per_block(btree);
1270 keyp, ptrp, ncblk);
1289 int nchildren, lnchildren, n, ncblk;
1297 ncblk = nilfs_btree_nchildren_per_block(btree);
1301 nilfs_btree_node_move_right(left, node, n, ncblk, ncblk);
1321 int nchildren, rnchildren, n, ncblk;
1329 ncblk = nilfs_btree_nchildren_per_block(btree);
1333 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1354 int n, ncblk;
1360 ncblk = nilfs_btree_nchildren_per_block(btree);
1364 nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
1380 int n, ncblk;
1386 ncblk = nilfs_btree_nchildren_per_block(btree);
1390 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
1405 int n, ncblk;
1411 ncblk = nilfs_btree_nchildren_per_block(btree);
1418 NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
1439 int pindex, dindex, level, ncmin, ncmax, ncblk, ret;
1444 ncblk = nilfs_btree_nchildren_per_block(btree);
1451 nilfs_btree_node_get_ptr(node, dindex, ncblk);
1805 int ncblk;
1823 ncblk = nilfs_btree_nchildren_per_block(btree);
1824 nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs);
1825 nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk);