Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
Kernel
提交
42177007
K
Kernel
项目概览
openeuler
/
Kernel
1 年多 前同步成功
通知
8
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
K
Kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
提交
42177007
编写于
3月 11, 2018
作者:
A
Al Viro
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fold dentry_lock_for_move() into its sole caller and clean it up
Signed-off-by:
N
Al Viro
<
viro@zeniv.linux.org.uk
>
上级
076515fc
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
23 addition
and
26 deletion
+23
-26
fs/dcache.c
fs/dcache.c
+23
-26
未找到文件。
fs/dcache.c
浏览文件 @
42177007
...
...
@@ -2773,25 +2773,6 @@ static void copy_name(struct dentry *dentry, struct dentry *target)
kfree_rcu
(
old_name
,
u
.
head
);
}
static
void
dentry_lock_for_move
(
struct
dentry
*
dentry
,
struct
dentry
*
target
)
{
if
(
IS_ROOT
(
dentry
)
||
dentry
->
d_parent
==
target
->
d_parent
)
spin_lock
(
&
target
->
d_parent
->
d_lock
);
else
{
if
(
d_ancestor
(
dentry
->
d_parent
,
target
->
d_parent
))
{
spin_lock
(
&
dentry
->
d_parent
->
d_lock
);
spin_lock_nested
(
&
target
->
d_parent
->
d_lock
,
DENTRY_D_LOCK_NESTED
);
}
else
{
spin_lock
(
&
target
->
d_parent
->
d_lock
);
spin_lock_nested
(
&
dentry
->
d_parent
->
d_lock
,
DENTRY_D_LOCK_NESTED
);
}
}
spin_lock_nested
(
&
dentry
->
d_lock
,
2
);
spin_lock_nested
(
&
target
->
d_lock
,
3
);
}
/*
* __d_move - move a dentry
* @dentry: entry to move
...
...
@@ -2806,16 +2787,34 @@ static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
static
void
__d_move
(
struct
dentry
*
dentry
,
struct
dentry
*
target
,
bool
exchange
)
{
struct
dentry
*
old_parent
;
struct
dentry
*
old_parent
,
*
p
;
struct
inode
*
dir
=
NULL
;
unsigned
n
;
if
(
!
dentry
->
d_inode
)
printk
(
KERN_WARNING
"VFS: moving negative dcache entry
\n
"
);
BUG_ON
(
d_ancestor
(
dentry
,
target
));
WARN_ON
(
!
dentry
->
d_inode
);
if
(
WARN_ON
(
dentry
==
target
))
return
;
BUG_ON
(
d_ancestor
(
target
,
dentry
));
old_parent
=
dentry
->
d_parent
;
p
=
d_ancestor
(
old_parent
,
target
);
if
(
IS_ROOT
(
dentry
))
{
BUG_ON
(
p
);
spin_lock
(
&
target
->
d_parent
->
d_lock
);
}
else
if
(
!
p
)
{
/* target is not a descendent of dentry->d_parent */
spin_lock
(
&
target
->
d_parent
->
d_lock
);
spin_lock_nested
(
&
old_parent
->
d_lock
,
DENTRY_D_LOCK_NESTED
);
}
else
{
BUG_ON
(
p
==
dentry
);
spin_lock
(
&
old_parent
->
d_lock
);
if
(
p
!=
target
)
spin_lock_nested
(
&
target
->
d_parent
->
d_lock
,
DENTRY_D_LOCK_NESTED
);
}
spin_lock_nested
(
&
dentry
->
d_lock
,
2
);
spin_lock_nested
(
&
target
->
d_lock
,
3
);
dentry_lock_for_move
(
dentry
,
target
);
if
(
unlikely
(
d_in_lookup
(
target
)))
{
dir
=
target
->
d_parent
->
d_inode
;
n
=
start_dir_add
(
dir
);
...
...
@@ -2825,8 +2824,6 @@ static void __d_move(struct dentry *dentry, struct dentry *target,
write_seqcount_begin
(
&
dentry
->
d_seq
);
write_seqcount_begin_nested
(
&
target
->
d_seq
,
DENTRY_D_LOCK_NESTED
);
old_parent
=
dentry
->
d_parent
;
/* unhash both */
if
(
!
d_unhashed
(
dentry
))
___d_drop
(
dentry
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录