Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
raspberrypi-kernel
提交
cf4ef014
R
raspberrypi-kernel
项目概览
openeuler
/
raspberrypi-kernel
通知
13
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
raspberrypi-kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
cf4ef014
编写于
8月 25, 2005
作者:
P
Paul E. McKenney
提交者:
David S. Miller
8月 29, 2005
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[LIST]: Add docbook header comments for hlist_add_{before,after}_rcu()
Signed-off-by:
N
David S. Miller
<
davem@davemloft.net
>
上级
57bf1451
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
30 addition
and
0 deletion
+30
-0
include/linux/list.h
include/linux/list.h
+30
-0
未找到文件。
include/linux/list.h
浏览文件 @
cf4ef014
...
...
@@ -634,6 +634,21 @@ static inline void hlist_add_after(struct hlist_node *n,
next
->
next
->
pprev
=
&
next
->
next
;
}
/**
* hlist_add_before_rcu - adds the specified element to the specified hlist
* before the specified node while permitting racing traversals.
* @n: the new element to add to the hash list.
* @next: the existing element to add the new element before.
*
* The caller must take whatever precautions are necessary
* (such as holding appropriate locks) to avoid racing
* with another list-mutation primitive, such as hlist_add_head_rcu()
* or hlist_del_rcu(), running on this same list.
* However, it is perfectly legal to run concurrently with
* the _rcu list-traversal primitives, such as
* hlist_for_each_rcu(), used to prevent memory-consistency
* problems on Alpha CPUs.
*/
static
inline
void
hlist_add_before_rcu
(
struct
hlist_node
*
n
,
struct
hlist_node
*
next
)
{
...
...
@@ -644,6 +659,21 @@ static inline void hlist_add_before_rcu(struct hlist_node *n,
*
(
n
->
pprev
)
=
n
;
}
/**
* hlist_add_after_rcu - adds the specified element to the specified hlist
* after the specified node while permitting racing traversals.
* @prev: the existing element to add the new element after.
* @n: the new element to add to the hash list.
*
* The caller must take whatever precautions are necessary
* (such as holding appropriate locks) to avoid racing
* with another list-mutation primitive, such as hlist_add_head_rcu()
* or hlist_del_rcu(), running on this same list.
* However, it is perfectly legal to run concurrently with
* the _rcu list-traversal primitives, such as
* hlist_for_each_rcu(), used to prevent memory-consistency
* problems on Alpha CPUs.
*/
static
inline
void
hlist_add_after_rcu
(
struct
hlist_node
*
prev
,
struct
hlist_node
*
n
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录