NILFS_BTREE_NODE_NCHILDREN_MAX  353 fs/nilfs2/btree.c 		     nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {
NILFS_BTREE_NODE_NCHILDREN_MAX 1863 fs/nilfs2/btree.c 	} else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX(
NILFS_BTREE_NODE_NCHILDREN_MAX 2391 fs/nilfs2/btree.c 		NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap));
NILFS_BTREE_NODE_NCHILDREN_MAX 2409 fs/nilfs2/btree.c 		NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap));
NILFS_BTREE_NODE_NCHILDREN_MAX   51 fs/nilfs2/btree.h 	((NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) - 1) / 2 + 1)