Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\radix-tree.c Create Date:2022-07-28 06:13:09
Last Modify:2022-05-21 10:04:37 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:adix_tree_gang_lookup - perform multiple lookup on a radix tree*@root: radix tree root*@results: where the results of the lookup are placed*@first_index: start the lookup from this key*@max_items: place up to this many items at *results

Proto:unsigned int radix_tree_gang_lookup(const struct xarray *root, void **results, unsigned long first_index, unsigned int max_items)

Type:unsigned int

Parameter:

TypeParameterName
const struct xarray *root
void **results
unsigned longfirst_index
unsigned intmax_items
1276  __rcu * slot
1277  ret = 0
1279  If Value for the false possibility is greater at compile time(!max_items) Then Return 0
1283  results[ret] = Dependency order vs. p above. ( * slot)
1284  If Not results[ret] Then Continue
1286  If radix_tree_is_internal_node(results[ret]) Then
1287  slot = adix_tree_iter_retry - retry this chunk of the iteration*@iter: iterator state* If we iterate over a tree protected only by the RCU lock, a race* against deletion or creation may result in seeing a slot for which* radix_tree_deref_retry() returns true
1288  Continue
1290  If ++ret == max_items Then Break
1294  Return ret