Function report |
Source Code:mm\slub.c |
Create Date:2022-07-28 15:49:45 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:kmem_cache_init
Proto:void __init kmem_cache_init(void)
Type:void
Parameter:Nothing
| 4226 | static __initdata struct kmem_cache boot_kmem_cache, boot_kmem_cache_node |
| 4229 | If debug_guardpage_minorder() Then 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", size of 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 | pr_info("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, Setup number of possible processor ids , nr_node_ids) |
| Source code conversion tool public plug-in interface | X |
|---|---|
| Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |