mirror of
https://github.com/torvalds/linux.git
synced 2024-11-22 20:22:09 +00:00
ext4: handle corrupted orphan list at mount
If the orphan node list includes valid, untruncatable nodes with nlink > 0 the ext4_orphan_cleanup loop which attempts to delete them will not do so, causing it to loop forever. Fix by checking for such nodes in the ext4_orphan_get function. This patch fixes the second case (image hdb.20000009.softlockup.gz) reported in http://bugzilla.kernel.org/show_bug.cgi?id=10882. Signed-off-by: Duane Griffin <duaneg@dghda.com> Signed-off-by: Theodore Ts'o <tytso@mit.edu>
This commit is contained in:
parent
bce7f793da
commit
91ef4caf80
@ -1039,6 +1039,7 @@ extern void ext4_discard_reservation (struct inode *);
|
|||||||
extern void ext4_dirty_inode(struct inode *);
|
extern void ext4_dirty_inode(struct inode *);
|
||||||
extern int ext4_change_inode_journal_flag(struct inode *, int);
|
extern int ext4_change_inode_journal_flag(struct inode *, int);
|
||||||
extern int ext4_get_inode_loc(struct inode *, struct ext4_iloc *);
|
extern int ext4_get_inode_loc(struct inode *, struct ext4_iloc *);
|
||||||
|
extern int ext4_can_truncate(struct inode *inode);
|
||||||
extern void ext4_truncate (struct inode *);
|
extern void ext4_truncate (struct inode *);
|
||||||
extern void ext4_set_inode_flags(struct inode *);
|
extern void ext4_set_inode_flags(struct inode *);
|
||||||
extern void ext4_get_inode_flags(struct ext4_inode_info *);
|
extern void ext4_get_inode_flags(struct ext4_inode_info *);
|
||||||
|
@ -817,6 +817,14 @@ struct inode *ext4_orphan_get(struct super_block *sb, unsigned long ino)
|
|||||||
if (IS_ERR(inode))
|
if (IS_ERR(inode))
|
||||||
goto iget_failed;
|
goto iget_failed;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If the orphans has i_nlinks > 0 then it should be able to be
|
||||||
|
* truncated, otherwise it won't be removed from the orphan list
|
||||||
|
* during processing and an infinite loop will result.
|
||||||
|
*/
|
||||||
|
if (inode->i_nlink && !ext4_can_truncate(inode))
|
||||||
|
goto bad_orphan;
|
||||||
|
|
||||||
if (NEXT_ORPHAN(inode) > max_ino)
|
if (NEXT_ORPHAN(inode) > max_ino)
|
||||||
goto bad_orphan;
|
goto bad_orphan;
|
||||||
brelse(bitmap_bh);
|
brelse(bitmap_bh);
|
||||||
@ -838,6 +846,7 @@ bad_orphan:
|
|||||||
printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
|
printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
|
||||||
NEXT_ORPHAN(inode));
|
NEXT_ORPHAN(inode));
|
||||||
printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
|
printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
|
||||||
|
printk(KERN_NOTICE "i_nlink=%u\n", inode->i_nlink);
|
||||||
/* Avoid freeing blocks if we got a bad deleted inode */
|
/* Avoid freeing blocks if we got a bad deleted inode */
|
||||||
if (inode->i_nlink == 0)
|
if (inode->i_nlink == 0)
|
||||||
inode->i_blocks = 0;
|
inode->i_blocks = 0;
|
||||||
|
@ -2305,6 +2305,19 @@ static void ext4_free_branches(handle_t *handle, struct inode *inode,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
int ext4_can_truncate(struct inode *inode)
|
||||||
|
{
|
||||||
|
if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
|
||||||
|
return 0;
|
||||||
|
if (S_ISREG(inode->i_mode))
|
||||||
|
return 1;
|
||||||
|
if (S_ISDIR(inode->i_mode))
|
||||||
|
return 1;
|
||||||
|
if (S_ISLNK(inode->i_mode))
|
||||||
|
return !ext4_inode_is_fast_symlink(inode);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* ext4_truncate()
|
* ext4_truncate()
|
||||||
*
|
*
|
||||||
@ -2349,12 +2362,7 @@ void ext4_truncate(struct inode *inode)
|
|||||||
unsigned blocksize = inode->i_sb->s_blocksize;
|
unsigned blocksize = inode->i_sb->s_blocksize;
|
||||||
struct page *page;
|
struct page *page;
|
||||||
|
|
||||||
if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
|
if (!ext4_can_truncate(inode))
|
||||||
S_ISLNK(inode->i_mode)))
|
|
||||||
return;
|
|
||||||
if (ext4_inode_is_fast_symlink(inode))
|
|
||||||
return;
|
|
||||||
if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
|
|
||||||
return;
|
return;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
Loading…
Reference in New Issue
Block a user