Lines Matching defs:nchildren

107 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)
109 	node->bn_nchildren = cpu_to_le16(nchildren);
163 				  int level, int nchildren, int ncmax,
172 	nilfs_btree_node_set_nchildren(node, nchildren);
176 	for (i = 0; i < nchildren; i++) {
244 	int nchildren;
248 	nchildren = nilfs_btree_node_get_nchildren(node);
249 	if (index < nchildren) {
251 			(nchildren - index) * sizeof(*dkeys));
253 			(nchildren - index) * sizeof(*dptrs));
257 	nchildren++;
258 	nilfs_btree_node_set_nchildren(node, nchildren);
269 	int nchildren;
275 	nchildren = nilfs_btree_node_get_nchildren(node);
281 	if (index < nchildren - 1) {
283 			(nchildren - index - 1) * sizeof(*dkeys));
285 			(nchildren - index - 1) * sizeof(*dptrs));
287 	nchildren--;
288 	nilfs_btree_node_set_nchildren(node, nchildren);
343 	int level, flags, nchildren;
348 	nchildren = nilfs_btree_node_get_nchildren(node);
353 		     nchildren <= 0 ||
354 		     nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {
356 			   "bad btree node (ino=%lu, blocknr=%llu): level = %d, flags = 0x%x, nchildren = %d",
358 			   flags, nchildren);
374 	int level, flags, nchildren;
379 	nchildren = nilfs_btree_node_get_nchildren(node);
383 		     nchildren < 0 ||
384 		     nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX ||
385 		     (nchildren == 0 && level > NILFS_BTREE_LEVEL_NODE_MIN))) {
387 			   "bad btree root (ino=%lu): level = %d, flags = 0x%x, nchildren = %d",
388 			   inode->i_ino, level, flags, nchildren);
845 	int nchildren, lnchildren, n, move, ncblk;
849 	nchildren = nilfs_btree_node_get_nchildren(node);
854 	n = (nchildren + lnchildren + 1) / 2 - lnchildren;
891 	int nchildren, rnchildren, n, move, ncblk;
895 	nchildren = nilfs_btree_node_get_nchildren(node);
900 	n = (nchildren + rnchildren + 1) / 2 - rnchildren;
901 	if (n > nchildren - path[level].bp_index) {
938 	int nchildren, n, move, ncblk;
942 	nchildren = nilfs_btree_node_get_nchildren(node);
946 	n = (nchildren + 1) / 2;
947 	if (n > nchildren - path[level].bp_index) {
1293 	int nchildren, lnchildren, n, ncblk;
1299 	nchildren = nilfs_btree_node_get_nchildren(node);
1303 	n = (nchildren + lnchildren) / 2 - nchildren;
1325 	int nchildren, rnchildren, n, ncblk;
1331 	nchildren = nilfs_btree_node_get_nchildren(node);
1335 	n = (nchildren + rnchildren) / 2 - nchildren;
1658 	int nchildren, ret;
1661 	nchildren = nilfs_btree_node_get_nchildren(root);
1662 	if (unlikely(nchildren == 0))
1671 		if (nchildren > 1)
1673 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1679 		nchildren = nilfs_btree_node_get_nchildren(node);
1685 	maxkey = nilfs_btree_node_get_key(node, nchildren - 1);
1686 	nextmaxkey = (nchildren > 1) ?
1687 		nilfs_btree_node_get_key(node, nchildren - 2) : 0;
1701 	int nchildren, ncmax, i, ret;
1711 		nchildren = nilfs_btree_node_get_nchildren(root);
1712 		WARN_ON(nchildren > 1);
1713 		ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1726 	nchildren = nilfs_btree_node_get_nchildren(node);
1727 	if (nchildren < nitems)
1728 		nitems = nchildren;