Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
gsplhtlxg
clone-Linux
提交
5c47e6d0
C
clone-Linux
项目概览
gsplhtlxg
/
clone-Linux
通知
2
Star
0
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
clone-Linux
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
5c47e6d0
编写于
4月 29, 2014
作者:
A
Al Viro
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fold try_prune_one_dentry()
Signed-off-by:
N
Al Viro
<
viro@zeniv.linux.org.uk
>
上级
03b3b889
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
25 addition
and
50 deletion
+25
-50
fs/dcache.c
fs/dcache.c
+25
-50
未找到文件。
fs/dcache.c
浏览文件 @
5c47e6d0
...
...
@@ -787,47 +787,9 @@ void d_prune_aliases(struct inode *inode)
}
EXPORT_SYMBOL
(
d_prune_aliases
);
/*
* Try to throw away a dentry - free the inode, dput the parent.
* Requires dentry->d_lock is held, and dentry->d_count == 0.
* Releases dentry->d_lock.
*
* This may fail if locks cannot be acquired no problem, just try again.
*/
static
struct
dentry
*
try_prune_one_dentry
(
struct
dentry
*
dentry
)
__releases
(
dentry
->
d_lock
)
{
struct
dentry
*
parent
;
parent
=
dentry_kill
(
dentry
,
0
);
/*
* If dentry_kill returns NULL, we have nothing more to do.
* if it returns the same dentry, trylocks failed. In either
* case, just loop again.
*
* Otherwise, we need to prune ancestors too. This is necessary
* to prevent quadratic behavior of shrink_dcache_parent(), but
* is also expected to be beneficial in reducing dentry cache
* fragmentation.
*/
if
(
!
parent
)
return
NULL
;
if
(
parent
==
dentry
)
return
dentry
;
/* Prune ancestors. */
dentry
=
parent
;
while
(
dentry
)
{
if
(
lockref_put_or_lock
(
&
dentry
->
d_lockref
))
return
NULL
;
dentry
=
dentry_kill
(
dentry
,
1
);
}
return
NULL
;
}
static
void
shrink_dentry_list
(
struct
list_head
*
list
)
{
struct
dentry
*
dentry
;
struct
dentry
*
dentry
,
*
parent
;
rcu_read_lock
();
for
(;;)
{
...
...
@@ -863,22 +825,35 @@ static void shrink_dentry_list(struct list_head *list)
}
rcu_read_unlock
();
parent
=
dentry_kill
(
dentry
,
0
);
/*
* If 'try_to_prune()' returns a dentry, it will
* be the same one we passed in, and d_lock will
* have been held the whole time, so it will not
* have been added to any other lists. We failed
* to get the inode lock.
*
* We just add it back to the shrink list.
* If dentry_kill returns NULL, we have nothing more to do.
*/
dentry
=
try_prune_one_dentry
(
dentry
);
rcu_read_lock
();
if
(
dentry
)
{
if
(
!
parent
)
{
rcu_read_lock
();
continue
;
}
if
(
unlikely
(
parent
==
dentry
))
{
/*
* trylocks have failed and d_lock has been held the
* whole time, so it could not have been added to any
* other lists. Just add it back to the shrink list.
*/
rcu_read_lock
();
d_shrink_add
(
dentry
,
list
);
spin_unlock
(
&
dentry
->
d_lock
);
continue
;
}
/*
* We need to prune ancestors too. This is necessary to prevent
* quadratic behavior of shrink_dcache_parent(), but is also
* expected to be beneficial in reducing dentry cache
* fragmentation.
*/
dentry
=
parent
;
while
(
dentry
&&
!
lockref_put_or_lock
(
&
dentry
->
d_lockref
))
dentry
=
dentry_kill
(
dentry
,
1
);
rcu_read_lock
();
}
rcu_read_unlock
();
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录