函数逻辑报告 |
Source Code:mm\swapfile.c |
Create Date:2022-07-27 16:48:56 |
Last Modify:2020-03-17 22:19:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Scan swap_map (or frontswap_map if frontswap parameter is true)* from current position to next entry still in use. Return 0* if there are no inuse entries after prev till end of the map.
函数原型:static unsigned int find_next_to_unuse(struct swap_info_struct *si, unsigned int prev, bool frontswap)
返回类型:unsigned int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct swap_info_struct * | si | |
unsigned int | prev | |
bool | frontswap |
2104 | 以i小于xtent of the swap_map 循环 |
2105 | count等于READ_ONCE(vmalloc'ed array of usage counts [i]) |
2106 | 如果count且swap_count(count)不等于Note pageblock is bad, in first swap_map 则如果非frontswap或frontswap_test(si, i)则 |
2108 | 退出 |
2109 | 如果i取模LATENCY_LIMIT恒等于0则cond_resched() |
2113 | 如果i恒等于xtent of the swap_map 则i等于0 |
2116 | 返回:i |
名称 | 描述 |
---|---|
try_to_unuse | If the boolean frontswap is true, only unuse pages_to_unuse pages;* pages_to_unuse==0 means all pages; ignored if frontswap is false |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |