函数逻辑报告 |
Source Code:mm\shuffle.c |
Create Date:2022-07-27 16:39:11 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:For two pages to be swapped in the shuffle, they must be free (on a* 'free_area' lru), have the same order, and have the same migratetype.
函数原型:static struct page *__meminit shuffle_valid_page(unsigned long pfn, int order)
返回类型:struct page
参数:
类型 | 参数 | 名称 |
---|---|---|
unsigned long | pfn | |
int | order |
71 | 如果非pfn_valid_within(pfn)则返回:NULL |
75 | 如果非pfn_present(pfn)则返回:NULL |
79 | page等于pfn_to_page(pfn) |
80 | 如果非PageBuddy() indicates that the page is free and in the buddy system* (see mm/page_alloc.c).则返回:NULL |
87 | 如果page_order(page)不等于order则返回:NULL |
90 | 返回:page |
名称 | 描述 |
---|---|
__shuffle_zone |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |