linux内存管理--慢速分配内存页 __alloc_pages_slowpath

最新推荐文章于 2024-02-02 19:52:22 发布

庾志辉

最新推荐文章于 2024-02-02 19:52:22 发布

阅读量4.2k

点赞数

分类专栏： Linux驱动文章标签： Linux驱动 linux kernel 内存管理

本文链接：https://blog.csdn.net/YuZhiHui_No1/article/details/50776832

版权

本文详细探讨了Linux内核中的内存管理机制，特别是`__alloc_pages_slowpath`函数在慢速分配内存页时的角色。通过解析这一过程，读者将了解Linux如何在系统资源紧张时有效地进行内存分配，确保系统的稳定运行。

摘要由CSDN通过智能技术生成

        page = __alloc_pages_slowpath(gfp_mask, order,
                zonelist, high_zoneidx, nodemask,
                preferred_zone, migratetype);

static inline struct page *
__alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
    struct zonelist *zonelist, enum zone_type high_zoneidx,
    nodemask_t *nodemask, struct zone *preferred_zone,
    int migratetype)
{
    const gfp_t wait = gfp_mask & __GFP_WAIT;
    struct page *page = NULL;
    int alloc_flags;
    unsigned long pages_reclaimed = 0;
    unsigned long did_some_progress;
    bool sync_migration = false;
    bool deferred_compaction = false;
    bool contended_compaction = false;

    /*
     * In the slowpath, we sanity check order to avoid ever trying to
     * reclaim >= MAX_ORDER areas which will never succeed. Callers may
     * be using allocators in order of preference for an area that is
     * too large.
     */
    if (order >= MAX_ORDER) {//健康检查
        WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
        return NULL;
    }

    /*
     * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
     * __GFP_NOWARN set) should not cause reclaim since the subsystem
     * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
     * using a larger set of nodes after it has established that the
     * allowed per node queues are empty and that nodes are
     * over allocated.
     */
    if (IS_ENABLED(CONFIG_NUMA) &&
            (gfp_mask & GFP_THISNODE) == GFP_THISNODE)//不能重试
        goto nopage;

restart:
    if (!(gfp_mask & __GFP_NO_KSWAPD))//唤醒负责换出内存页的kswapd守护进程
        wake_all_kswapd(order, zonelist, high_zoneidx,
                        zone_idx(preferred_zone));

    /*
     * OK, we're below the kswapd watermark and have kicked background
     * reclaim. Now things get more complex, so set up alloc_flags according
     * to how we want to proceed.
     */
    alloc_flags = gfp_to_alloc_flags(gfp_mask);//集合下所有分配内存标识

    /*
     * Find the true preferred zone if the allocation is unconstrained by
     * cpusets.
     *///找到一个最合适的zone，但这是在不考虑cpu集的情况下
    if (!(alloc_flags & ALLOC_CPUSET) && !nodemask)
        first_zones_zonelist(zonelist, high_zoneidx,