函数逻辑报告 |
Source Code:include\linux\compaction.h |
Create Date:2022-07-27 10:05:58 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:compaction_suitable
函数原型:static inline enum compact_result compaction_suitable(struct zone *zone, int order, int alloc_flags, int classzone_idx)
返回类型:enum compact_result
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct zone * | zone | |
| int | order | |
| int | alloc_flags | |
| int | classzone_idx |
| 195 | 返回:COMPACT_SKIPPED |
| 名称 | 描述 |
|---|---|
| should_continue_reclaim | Reclaim/compaction is used for high-order allocation requests. It reclaims* order-0 pages before compacting the zone. should_continue_reclaim() returns* true if more pages should be reclaimed such that when the page allocator |
| compaction_ready | Returns true if compaction should go ahead for a costly-order request, or* the allocation would already succeed without compaction. Return false if we* should reclaim first. |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |