函数逻辑报告 |
Source Code:mm\slub.c |
Create Date:2022-07-27 17:21:46 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Get a page from somewhere. Search in increasing NUMA distances.
函数原型:static void *get_any_partial(struct kmem_cache *s, gfp_t flags, struct kmem_cache_cpu *c)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct kmem_cache * | s | |
gfp_t | flags | |
struct kmem_cache_cpu * | c |
1892 | high_zoneidx等于gfp_zone(flags) |
1914 | 如果非Defragmentation by allocating from a remote node.或get_cycles()取模1024大于Defragmentation by allocating from a remote node.则返回:NULL |
1918 | 循环 |
1924 | n等于get_node(s, zone_to_nid(zone)) |
1926 | 如果n且cpuset_zone_allowed(zone, flags)且nr_partial大于min_partial则 |
1943 | 返回:NULL |
名称 | 描述 |
---|---|
get_partial | Get a partial page, lock it and return it. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |