函数逻辑报告 |
Source Code:mm\vmalloc.c |
Create Date:2022-07-27 16:28:11 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:This function populates subtree_max_size from bottom to upper* levels starting from VA point
函数原型:static __always_inline void augment_tree_propagate_from(struct vmap_area *va)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct vmap_area * | va |
627 | node等于 address sorted rbtree |
640 | 如果 in "free" tree 恒等于new_va_sub_max_size则退出 |
644 | node等于rb_parent( & address sorted rbtree ) |
名称 | 描述 |
---|---|
insert_vmap_area_augment | |
merge_or_add_vmap_area | Merge de-allocated chunk of VA memory with previous* and next free blocks. If coalesce is not done a new* free area is inserted. If VA has been merged, it is* freed. |
adjust_va_to_fit_type |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |