函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\interval_tree.c Create Date:2022-07-27 15:56:49
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：Insert node immediately after prev in the interval tree

函数原型：void vma_interval_tree_insert_after(struct vm_area_struct *node, struct vm_area_struct *prev, struct rb_root_cached *root)

返回类型：void

参数：

类型参数名称
struct vm_area_struct *node
struct vm_area_struct *prev
struct rb_root_cached *root
34  last等于vma_last_pgoff(node)
36  VM_BUG_ON_VMA(vma_start_pgoff(node) != vma_start_pgoff(prev), node)
38  如果非rb_right则
39  parent等于prev
40  link等于rb_right
41  否则
42  parent等于rb_entry(rb_right, structvm_area_struct, rb)
44  如果rb_subtree_last小于last则rb_subtree_last等于last
46  当rb_left循环
47  parent等于rb_entry(rb_left, structvm_area_struct, rb)
49  如果rb_subtree_last小于last则rb_subtree_last等于last
52  link等于rb_left
55  rb_subtree_last等于last
56  rb_link_node( & rb, & rb, link)
57  Fixup the rbtree and update the augmented information when rebalancing.* On insertion, the user must update the augmented information on the path* leading to the inserted node, then call rb_link_node() as usual and
调用者
名称描述
dup_mmap