函数逻辑报告 |
Source Code:mm\filemap.c |
Create Date:2022-07-27 15:24:53 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:d_get_pages_contig - gang contiguous pagecache lookup*@mapping: The address_space to search*@index: The starting page index*@nr_pages: The maximum number of pages*@pages: Where the resulting pages are placed* find_get_pages_contig() works exactly like
函数原型:unsigned find_get_pages_contig(struct address_space *mapping, unsigned long index, unsigned int nr_pages, struct page **pages)
返回类型:unsigned
参数:
类型 | 参数 | 名称 |
---|---|---|
struct address_space * | mapping | |
unsigned long | index | |
unsigned int | nr_pages | |
struct page ** | pages |
1862 | ret等于0 |
1864 | 如果此条件成立可能性小(为编译器优化)(!nr_pages)则返回:0 |
1875 | 如果xa_is_value() - Determine if an entry is a value.*@entry: XArray entry.* Context: Any context.* Return: True if the entry is a value, false if it is a pointer.则退出 |
1878 | 如果非page_cache_get_speculative(page)则转到:retry |
1885 | pages[ret]等于find_subpage(page, xa_index) |
1888 | 继续下一循环 |
1889 | put_page : |
1891 | retry : |
1895 | 返回:ret |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |