Lines Matching refs:NILFS_BTREE_LEVEL_NODE_MIN

318 	if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) {  in nilfs_btree_node_lookup()
350 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_node_broken()
381 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_root_broken()
385 		     (nchildren == 0 && level > NILFS_BTREE_LEVEL_NODE_MIN))) {  in nilfs_btree_root_broken()
572 		if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) {  in nilfs_btree_do_lookup()
594 			WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);  in nilfs_btree_do_lookup()
712 	int level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_contig()
1023 	level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_find_near()
1032 	level = NILFS_BTREE_LEVEL_NODE_MIN + 1;  in nilfs_btree_find_near()
1089 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_prepare_insert()
1225 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_insert()
1246 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);  in nilfs_btree_insert()
1451 	for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;  in nilfs_btree_prepare_delete()
1561 	for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {  in nilfs_btree_prepare_delete()
1576 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_delete()
1598 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);  in nilfs_btree_delete()
1620 	const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_seek_key()
2144 	if (level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_add_dirty_buffer()
2176 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_dirty_buffers()
2197 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_dirty_buffers()