NILFS_BTREE_LEVEL_NODE_MIN
level = NILFS_BTREE_LEVEL_NODE_MIN;
level = NILFS_BTREE_LEVEL_NODE_MIN + 1;
for (level = NILFS_BTREE_LEVEL_NODE_MIN;
for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
NILFS_BTREE_LEVEL_NODE_MIN, 0);
for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;
for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {
for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
NILFS_BTREE_LEVEL_NODE_MIN, 0);
const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;
if (level < NILFS_BTREE_LEVEL_NODE_MIN ||
for (level = NILFS_BTREE_LEVEL_NODE_MIN;
for (level = NILFS_BTREE_LEVEL_NODE_MIN;
if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) {
if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
(nchildren == 0 && level > NILFS_BTREE_LEVEL_NODE_MIN))) {
if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) {
WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);
int level = NILFS_BTREE_LEVEL_NODE_MIN;