106 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)  in nilfs_btree_node_set_nchildren()  argument
108 	node->bn_nchildren = cpu_to_le16(nchildren);  in nilfs_btree_node_set_nchildren()
162 				  int level, int nchildren, int ncmax,  in nilfs_btree_node_init()  argument
171 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_init()
175 	for (i = 0; i < nchildren; i++) {  in nilfs_btree_node_init()
243 	int nchildren;  in nilfs_btree_node_insert()  local
247 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_insert()
248 	if (index < nchildren) {  in nilfs_btree_node_insert()
250 			(nchildren - index) * sizeof(*dkeys));  in nilfs_btree_node_insert()
252 			(nchildren - index) * sizeof(*dptrs));  in nilfs_btree_node_insert()
256 	nchildren++;  in nilfs_btree_node_insert()
257 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_insert()
268 	int nchildren;  in nilfs_btree_node_delete()  local
274 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_delete()
280 	if (index < nchildren - 1) {  in nilfs_btree_node_delete()
282 			(nchildren - index - 1) * sizeof(*dkeys));  in nilfs_btree_node_delete()
284 			(nchildren - index - 1) * sizeof(*dptrs));  in nilfs_btree_node_delete()
286 	nchildren--;  in nilfs_btree_node_delete()
287 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_delete()
342 	int level, flags, nchildren;  in nilfs_btree_node_broken()  local
347 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_broken()
352 		     nchildren < 0 ||  in nilfs_btree_node_broken()
353 		     nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {  in nilfs_btree_node_broken()
357 			  flags, nchildren);  in nilfs_btree_node_broken()
373 	int level, flags, nchildren;  in nilfs_btree_root_broken()  local
378 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_root_broken()
382 		     nchildren < 0 ||  in nilfs_btree_root_broken()
383 		     nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) {  in nilfs_btree_root_broken()
386 			  inode->i_ino, level, flags, nchildren);  in nilfs_btree_root_broken()
830 	int nchildren, lnchildren, n, move, ncblk;  in nilfs_btree_carry_left()  local
834 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_left()
839 	n = (nchildren + lnchildren + 1) / 2 - lnchildren;  in nilfs_btree_carry_left()
876 	int nchildren, rnchildren, n, move, ncblk;  in nilfs_btree_carry_right()  local
880 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_right()
885 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;  in nilfs_btree_carry_right()
886 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_carry_right()
923 	int nchildren, n, move, ncblk;  in nilfs_btree_split()  local
927 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_split()
931 	n = (nchildren + 1) / 2;  in nilfs_btree_split()
932 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_split()
1278 	int nchildren, lnchildren, n, ncblk;  in nilfs_btree_borrow_left()  local
1284 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_left()
1288 	n = (nchildren + lnchildren) / 2 - nchildren;  in nilfs_btree_borrow_left()
1310 	int nchildren, rnchildren, n, ncblk;  in nilfs_btree_borrow_right()  local
1316 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_right()
1320 	n = (nchildren + rnchildren) / 2 - nchildren;  in nilfs_btree_borrow_right()
1643 	int nchildren, ret;  in nilfs_btree_check_delete()  local
1652 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_check_delete()
1653 		if (nchildren > 1)  in nilfs_btree_check_delete()
1655 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_check_delete()
1666 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_check_delete()
1667 	maxkey = nilfs_btree_node_get_key(node, nchildren - 1);  in nilfs_btree_check_delete()
1668 	nextmaxkey = (nchildren > 1) ?  in nilfs_btree_check_delete()
1669 		nilfs_btree_node_get_key(node, nchildren - 2) : 0;  in nilfs_btree_check_delete()
1684 	int nchildren, ncmax, i, ret;  in nilfs_btree_gather_data()  local
1694 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_gather_data()
1695 		WARN_ON(nchildren > 1);  in nilfs_btree_gather_data()
1696 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_gather_data()
1709 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_gather_data()
1710 	if (nchildren < nitems)  in nilfs_btree_gather_data()
1711 		nitems = nchildren;  in nilfs_btree_gather_data()