函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：__anon_vma_interval_tree_iter_next

函数原型：static inline struct anon_vma_chain *__anon_vma_interval_tree_iter_next(struct anon_vma_chain *node, unsigned long start, unsigned long last)

返回类型：struct anon_vma_chain

参数：

类型参数名称
struct anon_vma_chain *node
unsigned longstart
unsigned longlast
73  rb等于rb_right
73  当(true)循环
73  如果rb则
73  struct anon_vma_chain * right = ({
73  __mptr等于rb
73  循环
73  当0循环
73  __mptr减__builtin_offsetof(structanon_vma_chain, rb)
73  })
73  如果start小于等于rb_subtree_last则返回:__anon_vma_interval_tree_subtree_search(right, start, last)
73  循环
73  rb等于__rb_parent_color按位与3的反
73  如果非rb则返回:NULL
73  prev等于locked by anon_vma->rwsem
73  node = ({
73  __mptr等于rb
73  循环
73  当0循环
73  __mptr减__builtin_offsetof(structanon_vma_chain, rb)
73  })
73  rb等于rb_right
73  当prev恒等于rb循环
73  如果last小于avc_start_pgoff(node)则返回:NULL
73  否则如果start小于等于avc_last_pgoff(node)则返回:node
调用者
名称描述
anon_vma_interval_tree_iter_next