Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\kasan\init.c Create Date:2022-07-28 15:51:51
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:zero_p4d_populate

Proto:static int __ref zero_p4d_populate(pgd_t *pgd, unsigned long addr, unsigned long end)

Type:int

Parameter:

TypeParameterName
pgd_t *pgd
unsigned longaddr
unsigned longend
186  p4d = p4d_offset(pgd, addr)
189  Do
190  next = p4d_addr_end(addr, end)
191  If IS_ALIGNED(addr, P4D_SIZE) && end - addr >= P4D_SIZE Then
195  p4d_populate( & For dynamically allocated mm_structs, there is a dynamically sized cpumask* at the end of the structure, the size of which depends on the maximum CPU* number the system can see, p4d, lm_alias(kasan_early_shadow_pud))
197  pud = pud_offset(p4d, addr)
198  pud_populate( & For dynamically allocated mm_structs, there is a dynamically sized cpumask* at the end of the structure, the size of which depends on the maximum CPU* number the system can see, pud, lm_alias(kasan_early_shadow_pmd))
200  pmd = pmd_offset(pud, addr)
201  pmd_populate_kernel( & For dynamically allocated mm_structs, there is a dynamically sized cpumask* at the end of the structure, the size of which depends on the maximum CPU* number the system can see, pmd, lm_alias(kasan_early_shadow_pte))
203  Continue
206  If The "p4d_xxx()" functions here are trivial for a folded two-level* setup: the pud is never bad, and a pud always exists (as it's folded* into the p4d entry) Then
209  If slab_is_available() Then
213  Else
218  zero_pud_populate(p4d, addr, next)
219  When p4d++, addr = next , addr != end cycle
221  Return 0
Caller
NameDescribe
kasan_populate_early_shadowkasan_populate_early_shadow - populate shadow memory region with* kasan_early_shadow_page*@shadow_start - start of the memory range to populate*@shadow_end - end of the memory range to populate