Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:This assumes that the caller has performed appropriate preallocation, and* that the caller has pinned this thread of control to the current CPU.

Proto:static struct xa_node *radix_tree_node_alloc(gfp_t gfp_mask, struct xa_node *parent, struct xarray *root, unsigned int shift, unsigned int offset, unsigned int count, unsigned int nr_values)

Type:struct xa_node

Parameter:

TypeParameterName
gfp_tgfp_mask
struct xa_node *parent
struct xarray *root
unsigned intshift
unsigned intoffset
unsigned intcount
unsigned intnr_values
247  struct xa_node * ret = NULL
254  If Not gfpflags_allow_blocking(gfp_mask) && Not in_interrupt() Then
262  ret = kmem_cache_alloc(Radix tree node cache., gfp_mask | DOC: Action modifiers* Action modifiers* ~~~~~~~~~~~~~~~~* %__GFP_NOWARN suppresses allocation failure reports.* %__GFP_COMP address compound page metadata.* %__GFP_ZERO returns a zeroed page on success.)
264  If ret Then Go to out
272  rtp = this_cpu_ptr( & radix_tree_preloads)
273  If nr Then
274  ret = des->parent points to next preallocated node
275  des->parent points to next preallocated node = NULL at top of tree
276  nr--
282  kmemleak_update_trace - update object allocation stack trace*@ptr: pointer to beginning of the object* Override the object allocation stack trace for cases where the actual* allocation place is not always useful.
283  Go to out
285  ret = kmem_cache_alloc(Radix tree node cache., gfp_mask)
286  out :
287  BUG_ON(radix_tree_is_internal_node(ret))
288  If ret Then
289  Bits remaining in each slot = shift
290  Slot offset in parent = offset
291  Total entry count = count
292  Value entry count = nr_values
293  NULL at top of tree = parent
294  The array we belong to = root
296  Return ret
Caller
NameDescribe
radix_tree_extendExtend a radix tree so it can store key @index.
__radix_tree_create
idr_get_free