ncblk             803 fs/nilfs2/btree.c 	int ncblk;
ncblk             807 fs/nilfs2/btree.c 		ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk             809 fs/nilfs2/btree.c 					*keyp, *ptrp, ncblk);
ncblk             830 fs/nilfs2/btree.c 	int nchildren, lnchildren, n, move, ncblk;
ncblk             836 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk             846 fs/nilfs2/btree.c 	nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
ncblk             876 fs/nilfs2/btree.c 	int nchildren, rnchildren, n, move, ncblk;
ncblk             882 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk             892 fs/nilfs2/btree.c 	nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
ncblk             923 fs/nilfs2/btree.c 	int nchildren, n, move, ncblk;
ncblk             928 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk             937 fs/nilfs2/btree.c 	nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
ncblk             947 fs/nilfs2/btree.c 					*keyp, *ptrp, ncblk);
ncblk             973 fs/nilfs2/btree.c 	int n, ncblk;
ncblk             977 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk             982 fs/nilfs2/btree.c 				    NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
ncblk            1054 fs/nilfs2/btree.c 	int pindex, level, ncmax, ncblk, ret;
ncblk            1071 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1077 fs/nilfs2/btree.c 		if (nilfs_btree_node_get_nchildren(node) < ncblk) {
ncblk            1094 fs/nilfs2/btree.c 			if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
ncblk            1112 fs/nilfs2/btree.c 			if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
ncblk            1138 fs/nilfs2/btree.c 		nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL);
ncblk            1163 fs/nilfs2/btree.c 			      0, level, 0, ncblk, NULL, NULL);
ncblk            1253 fs/nilfs2/btree.c 	int ncblk;
ncblk            1257 fs/nilfs2/btree.c 		ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1259 fs/nilfs2/btree.c 					keyp, ptrp, ncblk);
ncblk            1278 fs/nilfs2/btree.c 	int nchildren, lnchildren, n, ncblk;
ncblk            1286 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1290 fs/nilfs2/btree.c 	nilfs_btree_node_move_right(left, node, n, ncblk, ncblk);
ncblk            1310 fs/nilfs2/btree.c 	int nchildren, rnchildren, n, ncblk;
ncblk            1318 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1322 fs/nilfs2/btree.c 	nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
ncblk            1343 fs/nilfs2/btree.c 	int n, ncblk;
ncblk            1349 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1353 fs/nilfs2/btree.c 	nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
ncblk            1369 fs/nilfs2/btree.c 	int n, ncblk;
ncblk            1375 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1379 fs/nilfs2/btree.c 	nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
ncblk            1394 fs/nilfs2/btree.c 	int n, ncblk;
ncblk            1400 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1407 fs/nilfs2/btree.c 				   NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
ncblk            1428 fs/nilfs2/btree.c 	int pindex, dindex, level, ncmin, ncmax, ncblk, ret;
ncblk            1433 fs/nilfs2/btree.c 	ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1440 fs/nilfs2/btree.c 			nilfs_btree_node_get_ptr(node, dindex, ncblk);
ncblk            1790 fs/nilfs2/btree.c 	int ncblk;
ncblk            1808 fs/nilfs2/btree.c 		ncblk = nilfs_btree_nchildren_per_block(btree);
ncblk            1809 fs/nilfs2/btree.c 		nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs);
ncblk            1810 fs/nilfs2/btree.c 		nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk);