函数逻辑报告 |
Source Code:mm\memcontrol.c |
Create Date:2022-07-27 17:45:31 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:mem_cgroup_soft_limit_reclaim
函数原型:unsigned long mem_cgroup_soft_limit_reclaim(pg_data_t *pgdat, int order, gfp_t gfp_mask, unsigned long *total_scanned)
返回类型:unsigned long
参数:
类型 | 参数 | 名称 |
---|---|---|
pg_data_t * | pgdat | |
int | order | |
gfp_t | gfp_mask | |
unsigned long * | total_scanned |
3047 | nr_reclaimed等于0 |
3048 | struct mem_cgroup_per_node * mz, * next_mz = NULL |
3050 | loop等于0 |
3055 | 如果order大于0则返回:0 |
3058 | mctz等于soft_limit_tree_node(全局结点ID) |
3065 | 如果非mctz或RB_EMPTY_ROOT( & rb_root)则返回:0 |
3073 | 循环 |
3076 | 否则mz等于mem_cgroup_largest_soft_limit_node(mctz) |
3081 | nr_scanned等于0 |
3084 | nr_reclaimed加等于reclaimed |
3085 | total_scanned加等于nr_scanned |
3086 | spin_lock_irq( & lock) |
3087 | __mem_cgroup_remove_exceeded(mz, mctz) |
3093 | next_mz = NULL |
3107 | __mem_cgroup_insert_exceeded(mz, mctz, excess) |
3108 | spin_unlock_irq( & lock) |
3109 | 设置一个css引用 |
3110 | loop自加 |
3116 | 如果非nr_reclaimed且next_mz恒等于NULL或loop大于MEM_CGROUP_MAX_SOFT_LIMIT_RECLAIM_LOOPS的值则退出 |
3120 | 当非nr_reclaimed循环 |
3123 | 返回:nr_reclaimed |
名称 | 描述 |
---|---|
balance_pgdat | For kswapd, balance_pgdat() will reclaim pages across a node from zones* that are eligible for use by the caller until at least one zone is* balanced.* Returns the order kswapd finished reclaiming at. |
shrink_zones | This is the direct reclaim path, for page-allocating processes. We only* try to reclaim pages from zones which will satisfy the caller's allocation* request.* If a zone is deemed to be full of pinned pages then just give it a light |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |