函数逻辑报告 |
Source Code:mm\mempolicy.c |
Create Date:2022-07-27 17:05:53 |
| Last Modify:2020-03-17 22:28:11 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:Do dynamic interleaving for a process
函数原型:static unsigned interleave_nodes(struct mempolicy *policy)
返回类型:unsigned
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct mempolicy * | policy |
| 1846 | next等于Find the next present node in src, starting after node n, wrapping around to* the first node in src if needed. Returns MAX_NUMNODES if src is empty.(il_prev, interleave/bind ) |
| 1847 | 如果next小于MAX_NUMNODES则il_prev等于next |
| 1849 | 返回:next |
| 名称 | 描述 |
|---|---|
| mempolicy_slab_node | Depending on the memory policy provide a node from which to allocate the* next slab entry. |
| interleave_nid | Determine a node number for interleave |
| alloc_pages_current | alloc_pages_current - Allocate pages.*@gfp:* %GFP_USER user allocation,* %GFP_KERNEL kernel allocation,* %GFP_HIGHMEM highmem allocation,* %GFP_FS don't call back into a file system.* %GFP_ATOMIC don't sleep. |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |