119 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)  in nilfs_btree_node_set_nchildren()  argument
121 	node->bn_nchildren = cpu_to_le16(nchildren);  in nilfs_btree_node_set_nchildren()
175 				  int level, int nchildren, int ncmax,  in nilfs_btree_node_init()  argument
184 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_init()
188 	for (i = 0; i < nchildren; i++) {  in nilfs_btree_node_init()
256 	int nchildren;  in nilfs_btree_node_insert()  local
260 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_insert()
261 	if (index < nchildren) {  in nilfs_btree_node_insert()
263 			(nchildren - index) * sizeof(*dkeys));  in nilfs_btree_node_insert()
265 			(nchildren - index) * sizeof(*dptrs));  in nilfs_btree_node_insert()
269 	nchildren++;  in nilfs_btree_node_insert()
270 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_insert()
281 	int nchildren;  in nilfs_btree_node_delete()  local
287 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_delete()
293 	if (index < nchildren - 1) {  in nilfs_btree_node_delete()
295 			(nchildren - index - 1) * sizeof(*dkeys));  in nilfs_btree_node_delete()
297 			(nchildren - index - 1) * sizeof(*dptrs));  in nilfs_btree_node_delete()
299 	nchildren--;  in nilfs_btree_node_delete()
300 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_delete()
353 	int level, flags, nchildren;  in nilfs_btree_node_broken()  local
358 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_broken()
363 		     nchildren < 0 ||  in nilfs_btree_node_broken()
364 		     nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {  in nilfs_btree_node_broken()
367 		       (unsigned long long)blocknr, level, flags, nchildren);  in nilfs_btree_node_broken()
383 	int level, flags, nchildren;  in nilfs_btree_root_broken()  local
388 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_root_broken()
392 		     nchildren < 0 ||  in nilfs_btree_root_broken()
393 		     nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) {  in nilfs_btree_root_broken()
395 			ino, level, flags, nchildren);  in nilfs_btree_root_broken()
829 	int nchildren, lnchildren, n, move, ncblk;  in nilfs_btree_carry_left()  local
833 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_left()
838 	n = (nchildren + lnchildren + 1) / 2 - lnchildren;  in nilfs_btree_carry_left()
875 	int nchildren, rnchildren, n, move, ncblk;  in nilfs_btree_carry_right()  local
879 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_right()
884 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;  in nilfs_btree_carry_right()
885 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_carry_right()
924 	int nchildren, n, move, ncblk;  in nilfs_btree_split()  local
928 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_split()
932 	n = (nchildren + 1) / 2;  in nilfs_btree_split()
933 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_split()
1282 	int nchildren, lnchildren, n, ncblk;  in nilfs_btree_borrow_left()  local
1288 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_left()
1292 	n = (nchildren + lnchildren) / 2 - nchildren;  in nilfs_btree_borrow_left()
1314 	int nchildren, rnchildren, n, ncblk;  in nilfs_btree_borrow_right()  local
1320 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_right()
1324 	n = (nchildren + rnchildren) / 2 - nchildren;  in nilfs_btree_borrow_right()
1647 	int nchildren, ret;  in nilfs_btree_check_delete()  local
1656 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_check_delete()
1657 		if (nchildren > 1)  in nilfs_btree_check_delete()
1659 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_check_delete()
1670 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_check_delete()
1671 	maxkey = nilfs_btree_node_get_key(node, nchildren - 1);  in nilfs_btree_check_delete()
1672 	nextmaxkey = (nchildren > 1) ?  in nilfs_btree_check_delete()
1673 		nilfs_btree_node_get_key(node, nchildren - 2) : 0;  in nilfs_btree_check_delete()
1688 	int nchildren, ncmax, i, ret;  in nilfs_btree_gather_data()  local
1698 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_gather_data()
1699 		WARN_ON(nchildren > 1);  in nilfs_btree_gather_data()
1700 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_gather_data()
1713 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_gather_data()
1714 	if (nchildren < nitems)  in nilfs_btree_gather_data()
1715 		nitems = nchildren;  in nilfs_btree_gather_data()