Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\rhashtable.c Create Date:2022-07-28 06:25:10
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:__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.

Proto:static void *__rhashtable_walk_find_next(struct rhashtable_iter *iter)

Type:void

Parameter:

TypeParameterName
struct rhashtable_iter *iter
782  tbl = tbl
783  list = list
784  ht = ht
785  p = p
786  rhlist = rhlist
788  If Not tbl Then Return NULL
791  When slot < size cycle
792  skip = skip
795  If rhlist Then
798  Do
799  If Not skip Then Go to next
801  skip--
803  When list cycle
805  Continue
807  If Not skip Then Break
809  skip--
812  :
813  If Not rht_is_a_nulls(p) Then
814  skip++
815  p = p
816  list = list
817  Return rht_obj(ht, rhlist ? & rhead : p)
820  skip = 0
823  p = NULL
826  smp_rmb()
828  tbl = rht_dereference_rcu(future_tbl, ht)
829  If tbl Then
830  slot = 0
831  skip = 0
832  Return ERR_PTR( - EAGAIN)
833  Else
834  end_of_table = true
837  Return NULL
Caller
NameDescribe
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