radix_tree_is_internal

Type	Parameter	Name
void *	ptr

**Caller**
Name	Describe
radix_tree_node_alloc	This assumes that the caller has performed appropriate preallocation, and* that the caller has pinned this thread of control to the current CPU.
radix_tree_load_root
radix_tree_extend	Extend a radix tree so it can store key @index.
radix_tree_shrink	adix_tree_shrink - shrink radix tree to minimum height*@root radix tree root
__radix_tree_create
radix_tree_insert	__radix_tree_insert - insert into a radix tree@root: radix tree root@index: index key@item: item to insert Insert an item into the radix tree at position @index.
__radix_tree_lookup
radix_tree_tag_set	adix_tree_tag_set - set a tag on a radix tree node@root: radix tree root@index: index key@tag: tag index Set the search tag (which must be < RADIX_TREE_MAX_TAGS)* corresponding to @index in the radix tree. From
radix_tree_tag_clear	adix_tree_tag_clear - clear a tag on a radix tree node@root: radix tree root@index: index key@tag: tag index Clear the search tag (which must be < RADIX_TREE_MAX_TAGS)* corresponding to @index in the radix tree
radix_tree_tag_get	adix_tree_tag_get - get a tag on a radix tree node@root: radix tree root@index: index key@tag: tag index (< RADIX_TREE_MAX_TAGS) Return values:* 0: tag not present or not set* 1: tag set* Note that the return value of this function may not be relied
radix_tree_next_chunk	adix_tree_next_chunk - find next chunk of slots for iteration@root: radix tree root@iter: iterator state@flags: RADIX_TREE_ITER_ flags and tag index* Returns: pointer to chunk first slot, or NULL if iteration is over
radix_tree_gang_lookup	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
radix_tree_gang_lookup_tag	adix_tree_gang_lookup_tag - perform multiple lookup on a radix tree* based on a tag@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
idr_get_free
idr_destroy	dr_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

Function report