函数逻辑报告 |
Source Code:mm\slub.c |
Create Date:2022-07-27 17:23:42 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:设置高速缓存
函数原型:void __init kmem_cache_init(void)
返回类型:void
参数:无
4226 | static __initdata struct kmem_cache boot_kmem_cache, boot_kmem_cache_node |
4229 | 如果debug_guardpage_minorder()则slub_max_order等于0 |
4232 | kmem_cache_node = & boot_kmem_cache_node |
4233 | kmem_cache = & boot_kmem_cache |
4235 | create_boot_cache(kmem_cache_node, "kmem_cache_node", kmem_cache_node的长度, Align objs on cache lines , 0, 0) |
4243 | create_boot_cache(kmem_cache, "kmem_cache", offsetof(structkmem_cache, node) + nr_node_ids * sizeof(structkmem_cache_node * ), Align objs on cache lines , 0, 0) |
4253 | create_kmalloc_caches(0) |
4256 | init_freelist_randomization() |
4261 | 打印信息("SLUB: HWalign=%d, Order=%u-%u, MinObjects=%u, CPUs=%u, Nodes=%u\n", cache_line_size(), Mininum / Maximum order of slab pages. This influences locking overhead* and slab fragmentation. A higher order reduces the number of partial slabs* and increases the number of allocations possible without having to* take the list_lock., slub_max_order, slub_min_objects, CPU数量, nr_node_ids) |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |