函数逻辑报告 |
Source Code:lib\rhashtable.c |
Create Date:2022-07-27 07:22:23 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:__rhashtable_walk_find_next - Find the next element in a table (or the first* one in case of a new walk).*@iter: Hash table iterator* Returns the found object or NULL when the end of the table is reached.* Returns -EAGAIN if resize event occurred.
函数原型:static void *__rhashtable_walk_find_next(struct rhashtable_iter *iter)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct rhashtable_iter * | iter |
788 | 如果非tbl则返回:NULL |
795 | 如果rhlist则 |
798 | 循环 |
801 | skip自减 |
805 | 继续下一循环 |
809 | skip自减 |
812 | next : |
813 | 如果非rht_is_a_nulls(p)则 |
820 | skip等于0 |
823 | p = NULL |
826 | smp_rmb() |
828 | tbl等于rht_dereference_rcu(future_tbl, ht) |
829 | 如果tbl则 |
833 | 否则 |
834 | end_of_table = true |
837 | 返回:NULL |
名称 | 描述 |
---|---|
rhashtable_walk_next | hashtable_walk_next - Return the next object and advance the iterator*@iter: Hash table iterator* Note that you must call rhashtable_walk_stop when you are finished* with the walk.* Returns the next object or NULL when the end of the table is reached. |
rhashtable_walk_peek | hashtable_walk_peek - Return the next object but don't advance the iterator*@iter: Hash table iterator* Returns the next object or NULL when the end of the table is reached.* Returns -EAGAIN if resize event occurred. Note that the iterator |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |