函数逻辑报告 |
Source Code:mm\ksm.c |
Create Date:2022-07-27 17:14:25 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:stable_node_dup
函数原型:static struct page *stable_node_dup(struct stable_node **_stable_node_dup, struct stable_node **_stable_node, struct rb_root *root, bool prune_stale_stable_nodes)
返回类型:struct page
参数:
类型 | 参数 | 名称 |
---|---|---|
struct stable_node ** | _stable_node_dup | |
struct stable_node ** | _stable_node | |
struct rb_root * | root | |
bool | prune_stale_stable_nodes |
1359 | found等于NULL, stable_node等于_stable_node |
1361 | struct page * _tree_page, * tree_page = NULL |
1362 | nr等于0 |
1370 | 否则chain_prune_time等于jiffies |
1375 | cond_resched() |
1387 | 如果非_tree_page则继续下一循环 |
1389 | nr加等于1 |
1390 | 如果is_page_sharing_candidate(dup)则 |
1391 | 如果非found或rmap_hlist_len大于found_rmap_hlist_len则 |
1408 | 如果found则 |
1415 | 如果prune_stale_stable_nodes且nr恒等于1则 |
1428 | rb_replace_node( & when node of stable tree , & when node of stable tree , root) |
1430 | free_stable_node(stable_node) |
1431 | The number of stable_node chains 自减 |
1438 | _stable_node等于found |
1445 | stable_node = NULL |
1446 | 否则如果first不等于hlist_dup且__is_page_sharing_candidate(found, 1)则 |
1464 | hlist_add_head( & hlist_dup, & hlist) |
1469 | _stable_node_dup等于found |
1470 | 返回:tree_page |
名称 | 描述 |
---|---|
__stable_node_chain | Like for get_ksm_page, this function can free the *_stable_node and* *_stable_node_dup if the returned tree_page is NULL |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |