| Function report | 
| Source Code: lib\rbtree.c | Create Date:2022-07-28 06:12:42 | 
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick | 
| home page | Tree | 
| Annotation kernel can get tool activity | Download SCCT | Chinese | 
Name:rb_insert_color
Proto:void rb_insert_color(struct rb_node *node, struct rb_root *root)
Type:void
Parameter:
| Type | Parameter | Name | 
|---|---|---|
| struct rb_node * | node | |
| struct rb_root * | root | 
| 436 | __rb_insert(node, root, dummy_rotate) | 
| Name | Describe | 
|---|---|
| insert | |
| wakelock_lookup_add | |
| insert_stat | |
| cgroup_storage_insert | |
| perf_event_groups_insert | Insert @event into @groups' tree; using {@event->cpu, ++@groups->index} for* key (see perf_event_groups_less). This places it last inside the CPU* subtree. | 
| __insert_uprobe | |
| add_nommu_region | add a region into the global tree | 
| add_vma_to_mm | add a VMA into a process's mm_struct in the appropriate place in the list* and tree and add to the address space's page tree also if not an anonymous* page* - should be called with mm->mmap_sem held writelocked | 
| link_va | |
| add_swap_extent | Add a block range (and the corresponding page range) into this swapdev's* extent tree.* This function rather assumes that it is called in ascending page order. | 
| zswap_rb_insert | In the case that a entry with the same offset is found, a pointer to* the existing entry is stored in dupentry and the function returns -EEXIST | 
| sp_insert | Insert a new shared policy into the list. Caller holds sp->lock for* writing. | 
| stable_tree_search | stable_tree_search - search for page inside the stable tree* This function checks if there is a page inside the stable tree* with identical content to the page that we are scanning right now | 
| stable_tree_insert | stable_tree_insert - insert stable tree node pointing to new ksm page* into the stable tree.* This function returns the stable tree node just allocated on success,* NULL otherwise. | 
| unstable_tree_search_insert | stable_tree_search_insert - search for identical page,* else insert rmap_item into the unstable tree.* This function searches for a page in the unstable tree identical to the* page currently being scanned; and if no identical page is found in the | 
| __mem_cgroup_insert_exceeded | |
| create_object | Create the metadata (struct kmemleak_object) corresponding to an allocated* memory block and add it to the object_list and object_tree_root. | 
| bfq_pos_tree_add_move | The following function is not marked as __cold because it is* actually cold, but for the same performance goal described in the* comments on the likely() at the beginning of* bfq_setup_cooperator() | 
| bfq_insert | q_insert - generic tree insertion.*@root: tree root.*@entity: entity to insert.* This is used for the idle and the active tree, since they are both* ordered by finish time. | 
| key_alloc_serial | Allocate a serial number for a key. These are assigned randomly to avoid* security issues through covert channel problems. | 
| key_init | Initialise the key management state. | 
| __label_insert | __label_insert - attempt to insert @l into a label set*@ls: set of labels to insert @l into (NOT NULL)*@label: new label to insert (NOT NULL)*@replace: whether insertion should replace existing entry that is not stale* Requires: @ls->lock* caller to hold | 
| integrity_inode_get | grity_inode_get - find or allocate an iint associated with an inode*@inode: pointer to the inode*@return: allocated iint* Caller must lock i_mutex | 
| Source code conversion tool public plug-in interface | X | 
|---|---|
| Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |