fs/nilfs2/btree.c

318 	if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) {
350 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
381 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
571 		if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) {
593 			WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);
711 	int level = NILFS_BTREE_LEVEL_NODE_MIN;
1022 	level = NILFS_BTREE_LEVEL_NODE_MIN;
1031 	level = NILFS_BTREE_LEVEL_NODE_MIN + 1;
1088 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;
1224 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
1245 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);
1450 	for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;
1560 	for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {
1575 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
1597 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);
1619 	const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;
2140 	if (level < NILFS_BTREE_LEVEL_NODE_MIN ||
2172 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;
2193 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;