函数逻辑报告 |
Source Code:mm\mempolicy.c |
Create Date:2022-07-27 17:05:58 |
Last Modify:2020-03-17 22:28:11 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Do static interleaving for a VMA with known offset @n. Returns the n'th* node in pol->v.nodes (starting from n=0), wrapping around if n exceeds the* number of present nodes.
函数原型:static unsigned offset_il_node(struct mempolicy *pol, unsigned long n)
返回类型:unsigned
参数:
类型 | 参数 | 名称 |
---|---|---|
struct mempolicy * | pol | |
unsigned long | n |
1905 | nnodes等于nodes_weight( interleave/bind ) |
1910 | 如果非nnodes则返回:Returns the number of the current Node. |
1913 | nid等于FIXME: better would be to fix all architectures to never return> MAX_NUMNODES, then the silly min_ts could be dropped. ( interleave/bind ) |
1916 | 返回:nid |
名称 | 描述 |
---|---|
interleave_nid | Determine a node number for interleave |
mpol_misplaced | mpol_misplaced - check whether current page node is valid in policy*@page: page to be checked*@vma: vm area where page mapped*@addr: virtual address where page mapped* Lookup current policy node id for vma,addr and "compare to" page's* node id |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |