Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\slab.c Create Date:2022-07-28 15:44:59
Last Modify:2022-05-23 17:02:55 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:cache_grow_end

Proto:static void cache_grow_end(struct kmem_cache *cachep, struct page *page)

Type:void

Parameter:

TypeParameterName
struct kmem_cache *cachep
struct page *page
2699  void * list = NULL
2701  check_irq_off()
2703  If Not page Then Return
2706  Initialization list head
2707  n = get_node(cachep, page_to_nid(page))
2709  spin_lock( & list_lock)
2710  total_slabs++
2711  If Not SLAB Then
2712  list_add_tail - add a new entry*@new: new entry to be added*@head: list head to add it before* Insert a new entry before the specified head.* This is useful for implementing queues.
2713  free_slabs++
2714  Else fixup_slab_list(cachep, n, page, & list)
2717  STATS_INC_GROWN(cachep)
2718  free_objects += num - SLAB
2719  spin_unlock( & list_lock)
2721  fixup_objfreelist_debug(cachep, & list)
Caller
NameDescribe
cache_alloc_refill
fallback_allocFallback function if there was no memory available and no objects on a* certain node and fall back is permitted. First we scan all the* available node for available objects. If that fails then we* perform an allocation without specifying a node
____cache_alloc_nodeA interface to enable slab creation on nodeid