107 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)  in nilfs_btree_node_set_nchildren()  argument
109 	node->bn_nchildren = cpu_to_le16(nchildren);  in nilfs_btree_node_set_nchildren()
163 				  int level, int nchildren, int ncmax,  in nilfs_btree_node_init()  argument
172 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_init()
176 	for (i = 0; i < nchildren; i++) {  in nilfs_btree_node_init()
244 	int nchildren;  in nilfs_btree_node_insert()  local
248 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_insert()
249 	if (index < nchildren) {  in nilfs_btree_node_insert()
251 			(nchildren - index) * sizeof(*dkeys));  in nilfs_btree_node_insert()
253 			(nchildren - index) * sizeof(*dptrs));  in nilfs_btree_node_insert()
257 	nchildren++;  in nilfs_btree_node_insert()
258 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_insert()
269 	int nchildren;  in nilfs_btree_node_delete()  local
275 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_delete()
281 	if (index < nchildren - 1) {  in nilfs_btree_node_delete()
283 			(nchildren - index - 1) * sizeof(*dkeys));  in nilfs_btree_node_delete()
285 			(nchildren - index - 1) * sizeof(*dptrs));  in nilfs_btree_node_delete()
287 	nchildren--;  in nilfs_btree_node_delete()
288 	nilfs_btree_node_set_nchildren(node, nchildren);  in nilfs_btree_node_delete()
343 	int level, flags, nchildren;  in nilfs_btree_node_broken()  local
348 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_node_broken()
353 		     nchildren < 0 ||  in nilfs_btree_node_broken()
354 		     nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {  in nilfs_btree_node_broken()
358 			   flags, nchildren);  in nilfs_btree_node_broken()
374 	int level, flags, nchildren;  in nilfs_btree_root_broken()  local
379 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_root_broken()
383 		     nchildren < 0 ||  in nilfs_btree_root_broken()
384 		     nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) {  in nilfs_btree_root_broken()
387 			   inode->i_ino, level, flags, nchildren);  in nilfs_btree_root_broken()
832 	int nchildren, lnchildren, n, move, ncblk;  in nilfs_btree_carry_left()  local
836 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_left()
841 	n = (nchildren + lnchildren + 1) / 2 - lnchildren;  in nilfs_btree_carry_left()
878 	int nchildren, rnchildren, n, move, ncblk;  in nilfs_btree_carry_right()  local
882 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_carry_right()
887 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;  in nilfs_btree_carry_right()
888 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_carry_right()
925 	int nchildren, n, move, ncblk;  in nilfs_btree_split()  local
929 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_split()
933 	n = (nchildren + 1) / 2;  in nilfs_btree_split()
934 	if (n > nchildren - path[level].bp_index) {  in nilfs_btree_split()
1280 	int nchildren, lnchildren, n, ncblk;  in nilfs_btree_borrow_left()  local
1286 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_left()
1290 	n = (nchildren + lnchildren) / 2 - nchildren;  in nilfs_btree_borrow_left()
1312 	int nchildren, rnchildren, n, ncblk;  in nilfs_btree_borrow_right()  local
1318 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_borrow_right()
1322 	n = (nchildren + rnchildren) / 2 - nchildren;  in nilfs_btree_borrow_right()
1645 	int nchildren, ret;  in nilfs_btree_check_delete()  local
1654 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_check_delete()
1655 		if (nchildren > 1)  in nilfs_btree_check_delete()
1657 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_check_delete()
1668 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_check_delete()
1669 	maxkey = nilfs_btree_node_get_key(node, nchildren - 1);  in nilfs_btree_check_delete()
1670 	nextmaxkey = (nchildren > 1) ?  in nilfs_btree_check_delete()
1671 		nilfs_btree_node_get_key(node, nchildren - 2) : 0;  in nilfs_btree_check_delete()
1686 	int nchildren, ncmax, i, ret;  in nilfs_btree_gather_data()  local
1696 		nchildren = nilfs_btree_node_get_nchildren(root);  in nilfs_btree_gather_data()
1697 		WARN_ON(nchildren > 1);  in nilfs_btree_gather_data()
1698 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,  in nilfs_btree_gather_data()
1711 	nchildren = nilfs_btree_node_get_nchildren(node);  in nilfs_btree_gather_data()
1712 	if (nchildren < nitems)  in nilfs_btree_gather_data()
1713 		nitems = nchildren;  in nilfs_btree_gather_data()