函数逻辑报告 |
Source Code:mm\filemap.c |
Create Date:2022-07-27 15:24:34 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:page_cache_next_miss() - Find the next gap in the page cache.*@mapping: Mapping.*@index: Index.*@max_scan: Maximum range to search.* Search the range [index, min(index + max_scan - 1, ULONG_MAX)] for the* gap with the lowest index.
函数原型:unsigned long page_cache_next_miss(struct address_space *mapping, unsigned long index, unsigned long max_scan)
返回类型:unsigned long
参数:
类型 | 参数 | 名称 |
---|---|---|
struct address_space * | mapping | |
unsigned long | index | |
unsigned long | max_scan |
1472 | 返回:xa_index |
名称 | 描述 |
---|---|
ondemand_readahead | A minimal readahead algorithm for trivial sequential/random reads. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |