函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\rhashtable.c Create Date:2022-07-27 07:22:23
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称:__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
782  tbl等于tbl
783  list等于list
784  ht等于ht
785  p等于p
786  rhlist等于rhlist
788  如果非tbl则返回:NULL
791 slot小于size循环
792  skip等于skip
795  如果rhlist
798  循环
803 list循环
805  继续下一循环
807  如果非skip退出
809  skip自减
812  :
813  如果非rht_is_a_nulls(p)则
814  skip自加
815  p等于p
816  list等于list
817  返回:rht_obj(ht, rhlist ? & rhead : p)
820  skip等于0
823  p = NULL
826  smp_rmb()
828  tbl等于rht_dereference_rcu(future_tbl, ht)
829  如果tbl
830  slot等于0
831  skip等于0
832  返回:错误号
833  否则
834  end_of_table = true
837  返回:NULL
调用者
名称描述
rhashtable_walk_nexthashtable_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_peekhashtable_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