mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-17 09:43:59 +08:00
alloc_super(): do ->s_umount initialization earlier
... so that failure exits could count on it having been done. Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
This commit is contained in:
parent
4fbd8d194f
commit
ca0168e8a7
37
fs/super.c
37
fs/super.c
@ -191,6 +191,24 @@ static struct super_block *alloc_super(struct file_system_type *type, int flags,
|
|||||||
|
|
||||||
INIT_LIST_HEAD(&s->s_mounts);
|
INIT_LIST_HEAD(&s->s_mounts);
|
||||||
s->s_user_ns = get_user_ns(user_ns);
|
s->s_user_ns = get_user_ns(user_ns);
|
||||||
|
init_rwsem(&s->s_umount);
|
||||||
|
lockdep_set_class(&s->s_umount, &type->s_umount_key);
|
||||||
|
/*
|
||||||
|
* sget() can have s_umount recursion.
|
||||||
|
*
|
||||||
|
* When it cannot find a suitable sb, it allocates a new
|
||||||
|
* one (this one), and tries again to find a suitable old
|
||||||
|
* one.
|
||||||
|
*
|
||||||
|
* In case that succeeds, it will acquire the s_umount
|
||||||
|
* lock of the old one. Since these are clearly distrinct
|
||||||
|
* locks, and this object isn't exposed yet, there's no
|
||||||
|
* risk of deadlocks.
|
||||||
|
*
|
||||||
|
* Annotate this by putting this lock in a different
|
||||||
|
* subclass.
|
||||||
|
*/
|
||||||
|
down_write_nested(&s->s_umount, SINGLE_DEPTH_NESTING);
|
||||||
|
|
||||||
if (security_sb_alloc(s))
|
if (security_sb_alloc(s))
|
||||||
goto fail;
|
goto fail;
|
||||||
@ -218,25 +236,6 @@ static struct super_block *alloc_super(struct file_system_type *type, int flags,
|
|||||||
goto fail;
|
goto fail;
|
||||||
if (list_lru_init_memcg(&s->s_inode_lru))
|
if (list_lru_init_memcg(&s->s_inode_lru))
|
||||||
goto fail;
|
goto fail;
|
||||||
|
|
||||||
init_rwsem(&s->s_umount);
|
|
||||||
lockdep_set_class(&s->s_umount, &type->s_umount_key);
|
|
||||||
/*
|
|
||||||
* sget() can have s_umount recursion.
|
|
||||||
*
|
|
||||||
* When it cannot find a suitable sb, it allocates a new
|
|
||||||
* one (this one), and tries again to find a suitable old
|
|
||||||
* one.
|
|
||||||
*
|
|
||||||
* In case that succeeds, it will acquire the s_umount
|
|
||||||
* lock of the old one. Since these are clearly distrinct
|
|
||||||
* locks, and this object isn't exposed yet, there's no
|
|
||||||
* risk of deadlocks.
|
|
||||||
*
|
|
||||||
* Annotate this by putting this lock in a different
|
|
||||||
* subclass.
|
|
||||||
*/
|
|
||||||
down_write_nested(&s->s_umount, SINGLE_DEPTH_NESTING);
|
|
||||||
s->s_count = 1;
|
s->s_count = 1;
|
||||||
atomic_set(&s->s_active, 1);
|
atomic_set(&s->s_active, 1);
|
||||||
mutex_init(&s->s_vfs_rename_mutex);
|
mutex_init(&s->s_vfs_rename_mutex);
|
||||||
|
Loading…
Reference in New Issue
Block a user