函数逻辑报告 |
Source Code:mm\vmalloc.c |
Create Date:2022-07-27 16:28:23 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:Find the first free block(lowest start address) in the tree,* that will accomplish the request corresponding to passing* parameters.
函数原型:static __always_inline struct vmap_area *find_vmap_lowest_match(unsigned long size, unsigned long align, unsigned long vstart)
返回类型:struct vmap_area
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| unsigned long | size | |
| unsigned long | align | |
| unsigned long | vstart |
| 810 | 如果get_subtree_max_size(rb_left)大于等于length且vstart小于va_start则 |
| 813 | 否则 |
| 822 | 如果get_subtree_max_size(rb_right)大于等于length则 |
| 846 | 返回:NULL |
| 名称 | 描述 |
|---|---|
| __alloc_vmap_area | Returns a start address of the newly allocated area, if success.* Otherwise a vend is returned that indicates failure. |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |