函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\gfp.h Create Date:2022-07-27 06:40:30
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称:We get the zone list from the current node and the gfp_mask.* This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones.* There are two zonelists per node, one for all zones with memory and

函数原型:static inline struct zonelist *node_zonelist(int nid, gfp_t flags)

返回类型:struct zonelist

参数:

类型参数名称
intnid
gfp_tflags
479  返回:备用结点及其内存域的列表There is only one page-allocator function, and two main namespaces to* it. The alloc_page*() variants return 'struct page *' and as such* can allocate highmem pages, the *get*page*() variants return* virtual kernel addresses to the allocated page(s).
调用者
名称描述
try_to_free_mem_cgroup_pages
prepare_alloc_pages
nr_free_zone_pagesr_free_zone_pages - count number of pages beyond high watermark*@offset: The zone index of the highest zone* nr_free_zone_pages() counts the number of pages which are beyond the* high watermark within all zones at or below a given zone index
dequeue_huge_page_nodemask
mpol_misplacedmpol_misplaced - check whether current page node is valid in policy*@page: page to be checked*@vma: vm area where page mapped*@addr: virtual address where page mapped* Lookup current policy node id for vma,addr and "compare to" page's* node id
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
get_any_partialGet a page from somewhere. Search in increasing NUMA distances.