[PATCH vfs-2.6 1/6] vfs: replace parent == dentry->d_parent by IS_ROOT()
Signed-off-by: OGAWA Hirofumi <hirofumi@mail.parknet.co.jp>
This commit is contained in:
parent
9fbb76ce0f
commit
871c0067d5
21
fs/dcache.c
21
fs/dcache.c
|
@ -174,9 +174,12 @@ static struct dentry *d_kill(struct dentry *dentry)
|
||||||
dentry_stat.nr_dentry--; /* For d_free, below */
|
dentry_stat.nr_dentry--; /* For d_free, below */
|
||||||
/*drops the locks, at that point nobody can reach this dentry */
|
/*drops the locks, at that point nobody can reach this dentry */
|
||||||
dentry_iput(dentry);
|
dentry_iput(dentry);
|
||||||
parent = dentry->d_parent;
|
if (IS_ROOT(dentry))
|
||||||
|
parent = NULL;
|
||||||
|
else
|
||||||
|
parent = dentry->d_parent;
|
||||||
d_free(dentry);
|
d_free(dentry);
|
||||||
return dentry == parent ? NULL : parent;
|
return parent;
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
@ -666,11 +669,12 @@ static void shrink_dcache_for_umount_subtree(struct dentry *dentry)
|
||||||
BUG();
|
BUG();
|
||||||
}
|
}
|
||||||
|
|
||||||
parent = dentry->d_parent;
|
if (IS_ROOT(dentry))
|
||||||
if (parent == dentry)
|
|
||||||
parent = NULL;
|
parent = NULL;
|
||||||
else
|
else {
|
||||||
|
parent = dentry->d_parent;
|
||||||
atomic_dec(&parent->d_count);
|
atomic_dec(&parent->d_count);
|
||||||
|
}
|
||||||
|
|
||||||
list_del(&dentry->d_u.d_child);
|
list_del(&dentry->d_u.d_child);
|
||||||
detached++;
|
detached++;
|
||||||
|
@ -1723,7 +1727,7 @@ static int d_isparent(struct dentry *p1, struct dentry *p2)
|
||||||
{
|
{
|
||||||
struct dentry *p;
|
struct dentry *p;
|
||||||
|
|
||||||
for (p = p2; p->d_parent != p; p = p->d_parent) {
|
for (p = p2; !IS_ROOT(p); p = p->d_parent) {
|
||||||
if (p->d_parent == p1)
|
if (p->d_parent == p1)
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
@ -2168,10 +2172,9 @@ int is_subdir(struct dentry * new_dentry, struct dentry * old_dentry)
|
||||||
seq = read_seqbegin(&rename_lock);
|
seq = read_seqbegin(&rename_lock);
|
||||||
for (;;) {
|
for (;;) {
|
||||||
if (new_dentry != old_dentry) {
|
if (new_dentry != old_dentry) {
|
||||||
struct dentry * parent = new_dentry->d_parent;
|
if (IS_ROOT(new_dentry))
|
||||||
if (parent == new_dentry)
|
|
||||||
break;
|
break;
|
||||||
new_dentry = parent;
|
new_dentry = new_dentry->d_parent;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
result = 1;
|
result = 1;
|
||||||
|
|
|
@ -1454,7 +1454,7 @@ struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
|
||||||
|
|
||||||
mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
|
mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex);
|
||||||
|
|
||||||
for (p = p1; p->d_parent != p; p = p->d_parent) {
|
for (p = p1; !IS_ROOT(p); p = p->d_parent) {
|
||||||
if (p->d_parent == p2) {
|
if (p->d_parent == p2) {
|
||||||
mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
|
mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT);
|
||||||
mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
|
mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD);
|
||||||
|
@ -1462,7 +1462,7 @@ struct dentry *lock_rename(struct dentry *p1, struct dentry *p2)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for (p = p2; p->d_parent != p; p = p->d_parent) {
|
for (p = p2; !IS_ROOT(p); p = p->d_parent) {
|
||||||
if (p->d_parent == p1) {
|
if (p->d_parent == p1) {
|
||||||
mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
|
mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT);
|
||||||
mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
|
mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD);
|
||||||
|
|
Loading…
Reference in New Issue