Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:radix_tree_free_nodes

Proto:static void radix_tree_free_nodes(struct radix_tree_node *node)

Type:void

Parameter:

TypeParameterName
struct radix_tree_node *node
668  offset = 0
669  child = entry_to_node(node)
671  cycle
672  entry = Dependency order vs. p above. (slots[offset])
673  If Private && shift Then
674  child = entry_to_node(entry)
675  offset = 0
676  Continue
678  offset++
679  When offset == RADIX_TREE_MAP_SIZE cycle
680  old = child
681  offset = offset + 1
682  child = parent
683  WARN_ON_ONCE(!list_empty - tests whether a list is empty*@head: the list to test.)
684  radix_tree_node_free(old)
685  If old == entry_to_node(node) Then Return
Caller
NameDescribe
idr_destroydr_destroy - release all internal memory from an IDR*@idr: idr handle* After this function is called, the IDR is empty, and may be reused or* the data structure containing it may be freed