函数逻辑报告 |
Source Code:mm\page_alloc.c |
Create Date:2022-07-27 16:34:03 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:The order of subdivision here is critical for the IO subsystem
函数原型:static inline void expand(struct zone *zone, struct page *page, int low, int high, struct free_area *area, int migratetype)
返回类型:void
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct zone * | zone | |
| struct page * | page | |
| int | low | |
| int | high | |
| struct free_area * | area | |
| int | migratetype |
| 2023 | area自减 |
| 2024 | high自减 |
| 2025 | size右移等于1位 |
| 2034 | 如果set_page_guard(zone, & page[size], high, migratetype)则继续下一循环 |
| 2038 | set_page_order( & page[size], high) |
| 名称 | 描述 |
|---|---|
| __rmqueue_smallest | Go through the free lists for the given migratetype and remove* the smallest available page from the freelists |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |