Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:kernel\power\snapshot.c Create Date:2022-07-28 10:00:42
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:ree_next_node - Jump to the next leaf node.* Set the position to the beginning of the next node in the* memory bitmap. This is either the next node in the current* zone's radix tree or the first node in the radix tree of the* next zone.

Proto:static bool rtree_next_node(struct memory_bitmap *bm)

Type:bool

Parameter:

TypeParameterName
struct memory_bitmap *bm
847  If Not list_is_last - tests whether @list is the last entry in list @head*@list: the entry to test*@head: the head of the list Then
848  node = list_entry - get the struct for this entry*@ptr: the &struct list_head pointer.*@type: the type of the struct this is embedded in.*@member: the name of the list_head within the struct.(next, structrtree_node, list)
850  node_pfn += BM_BITS_PER_BLOCK
851  node_bit = 0
852  touch_softlockup_watchdog()
853  Return true
857  If Not list_is_last - tests whether @list is the last entry in list @head*@list: the entry to test*@head: the head of the list Then
858  zone = list_entry - get the struct for this entry*@ptr: the &struct list_head pointer.*@type: the type of the struct this is embedded in.*@member: the name of the list_head within the struct.(next, structmem_zone_bm_rtree, list)
860  node = list_entry - get the struct for this entry*@ptr: the &struct list_head pointer.*@type: the type of the struct this is embedded in.*@member: the name of the list_head within the struct.(next, structrtree_node, list)
862  node_pfn = 0
863  node_bit = 0
864  Return true
868  Return false
Caller
NameDescribe
memory_bm_next_pfnmemory_bm_rtree_next_pfn - Find the next set bit in a memory bitmap.*@bm: Memory bitmap.* Starting from the last returned position this function searches for the next* set bit in @bm and returns the PFN represented by it. If no more bits are