函数逻辑报告 |
Source Code:include\linux\seqlock.h |
Create Date:2022-07-27 06:39:23 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:aw_write_seqcount_latch - redirect readers to even/odd copy*@s: pointer to seqcount_t* The latch technique is a multiversion concurrency control method that allows* queries during non-atomic modifications. If you can guarantee queries never
函数原型:static inline void raw_write_seqcount_latch(seqcount_t *s)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
seqcount_t * | s |
365 | smp_wmb() |
366 | sequence自加 |
367 | smp_wmb() |
名称 | 描述 |
---|---|
__set_cyc2ns_scale | |
update_fast_timekeeper | pdate_fast_timekeeper - Update the fast and NMI safe monotonic timekeeper.*@tkr: Timekeeping readout base from which we take the update* We want to use this from any context including NMI and tracing /* instrumenting the timekeeping code itself. |
update_clock_read_data | Updating the data required to read the clock |
latch_tree_insert | latch_tree_insert() - insert @node into the trees @root*@node: nodes to insert*@root: trees to insert @node into*@ops: operators defining the node order* It inserts @node into @root in an ordered fashion such that we can always* observe one complete tree |
latch_tree_erase | latch_tree_erase() - removes @node from the trees @root*@node: nodes to remote*@root: trees to remove @node from*@ops: operators defining the node order* Removes @node from the trees @root in an ordered fashion such that we can |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |