函数逻辑报告 |
Source Code:include\linux\cpuset.h |
Create Date:2022-07-27 06:48:22 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:cpuset_zone_allowed
函数原型:static inline bool cpuset_zone_allowed(struct zone *z, gfp_t gfp_mask)
返回类型:bool
参数:
类型 | 参数 | 名称 |
---|---|---|
struct zone * | z | |
gfp_t | gfp_mask |
219 | 返回:true |
名称 | 描述 |
---|---|
constrained_alloc | Determine the type of allocation constraint. |
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 |
wakeup_kswapd | A zone is low on free memory or too fragmented for high-order memory |
dequeue_huge_page_nodemask | |
fallback_alloc | Fallback function if there was no memory available and no objects on a* certain node and fall back is permitted. First we scan all the* available node for available objects. If that fails then we* perform an allocation without specifying a node |
get_any_partial | Get a page from somewhere. Search in increasing NUMA distances. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |