From nobody Tue Feb 10 14:31:59 2026 Received: from out-188.mta0.migadu.com (out-188.mta0.migadu.com [91.218.175.188]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by smtp.subspace.kernel.org (Postfix) with ESMTPS id DFFB2395DA5 for ; Wed, 14 Jan 2026 11:36:07 +0000 (UTC) Authentication-Results: smtp.subspace.kernel.org; arc=none smtp.client-ip=91.218.175.188 ARC-Seal: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1768390569; cv=none; b=JfahVsjTQk1zuDgj49vplDqlsL1aYZ2PQYu0GAXZ5NVuKNAoMmvoWvZ+AJj+vcAerdgdEwenHIRNVXbMlknCUoSimb6SD9sHTIPF8OcOIj9uWVRFx9nahHBDVKNJz7vr2JbMbKU2cIOSahRZRSuJjmhI+n7wvMHosps2m4U9IKs= ARC-Message-Signature: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1768390569; c=relaxed/simple; bh=6Uks93qRA/Ms92XW52iCrfwxR1rNT9qGN2utUVcr2T8=; h=From:To:Cc:Subject:Date:Message-ID:In-Reply-To:References: MIME-Version; b=gxk8uFyLWuWQPkVoJ50a8Wub8Hcxvb+c1vxUhO8Tbdk4lsKX6Pz1DFrISq/12W9F+tP8oYr6n+hkmHhgo2tNi8+s9lGHHzere9eain+bTJAsacRhh/C/nQWd1GWNeUr5b5cuMTNuHUmORU5bDotyD5Rr4+WU/kGjpNwgYkIcZQs= ARC-Authentication-Results: i=1; smtp.subspace.kernel.org; dmarc=pass (p=none dis=none) header.from=linux.dev; spf=pass smtp.mailfrom=linux.dev; dkim=pass (1024-bit key) header.d=linux.dev header.i=@linux.dev header.b=l/feb+QI; arc=none smtp.client-ip=91.218.175.188 Authentication-Results: smtp.subspace.kernel.org; dmarc=pass (p=none dis=none) header.from=linux.dev Authentication-Results: smtp.subspace.kernel.org; spf=pass smtp.mailfrom=linux.dev Authentication-Results: smtp.subspace.kernel.org; dkim=pass (1024-bit key) header.d=linux.dev header.i=@linux.dev header.b="l/feb+QI" X-Report-Abuse: Please report any abuse attempt to abuse@migadu.com and include these headers. DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=linux.dev; s=key1; t=1768390566; h=from:from:reply-to:subject:subject:date:date:message-id:message-id: to:to:cc:cc:mime-version:mime-version: content-transfer-encoding:content-transfer-encoding: in-reply-to:in-reply-to:references:references; bh=V5F7weIJyVWOfAymBhEuvJdsz1rWCiKztrti0doCXvs=; b=l/feb+QIbnQdM2saFNcUdHzsCCJp8f3CeH4MzKCDo+k73oxunsGWd2V5xM8U3NUbkXDQ7o 2DSPnAE00J8c0sPnzrLo9oUP1V88SabVZkJb9gNM0ooVn9fjd4/pyqPWuhSeq5bfV3spgE EDTfN14Et2OO0wPccp9+Xfv0YMSxq0Q= From: Qi Zheng To: hannes@cmpxchg.org, hughd@google.com, mhocko@suse.com, roman.gushchin@linux.dev, shakeel.butt@linux.dev, muchun.song@linux.dev, david@kernel.org, lorenzo.stoakes@oracle.com, ziy@nvidia.com, harry.yoo@oracle.com, yosry.ahmed@linux.dev, imran.f.khan@oracle.com, kamalesh.babulal@oracle.com, axelrasmussen@google.com, yuanchu@google.com, weixugc@google.com, chenridong@huaweicloud.com, mkoutny@suse.com, akpm@linux-foundation.org, hamzamahfooz@linux.microsoft.com, apais@linux.microsoft.com, lance.yang@linux.dev Cc: linux-mm@kvack.org, linux-kernel@vger.kernel.org, cgroups@vger.kernel.org, Qi Zheng Subject: [PATCH v3 26/30] mm: vmscan: prepare for reparenting MGLRU folios Date: Wed, 14 Jan 2026 19:32:53 +0800 Message-ID: <92e0728fed3d68855173352416cf8077670610f0.1768389889.git.zhengqi.arch@bytedance.com> In-Reply-To: References: Precedence: bulk X-Mailing-List: linux-kernel@vger.kernel.org List-Id: List-Subscribe: List-Unsubscribe: MIME-Version: 1.0 Content-Transfer-Encoding: quoted-printable X-Migadu-Flow: FLOW_OUT Content-Type: text/plain; charset="utf-8" From: Qi Zheng Similar to traditional LRU folios, in order to solve the dying memcg problem, we also need to reparenting MGLRU folios to the parent memcg when memcg offline. However, there are the following challenges: 1. Each lruvec has between MIN_NR_GENS and MAX_NR_GENS generations, the number of generations of the parent and child memcg may be different, so we cannot simply transfer MGLRU folios in the child memcg to the parent memcg as we did for traditional LRU folios. 2. The generation information is stored in folio->flags, but we cannot traverse these folios while holding the lru lock, otherwise it may cause softlockup. 3. In walk_update_folio(), the gen of folio and corresponding lru size may be updated, but the folio is not immediately moved to the corresponding lru list. Therefore, there may be folios of different generations on an LRU list. 4. In lru_gen_del_folio(), the generation to which the folio belongs is found based on the generation information in folio->flags, and the corresponding LRU size will be updated. Therefore, we need to update the lru size correctly during reparenting, otherwise the lru size may be updated incorrectly in lru_gen_del_folio(). Finally, this patch chose a compromise method, which is to splice the lru list in the child memcg to the lru list of the same generation in the parent memcg during reparenting. And in order to ensure that the parent memcg has the same generation, we need to increase the generations in the parent memcg to the MAX_NR_GENS before reparenting. Of course, the same generation has different meanings in the parent and child memcg, this will cause confusion in the hot and cold information of folios. But other than that, this method is simple enough, the lru size is correct, and there is no need to consider some concurrency issues (such as lru_gen_del_folio()). To prepare for the above work, this commit implements the specific functions, which will be used during reparenting. Suggested-by: Harry Yoo Suggested-by: Imran Khan Signed-off-by: Qi Zheng --- include/linux/mmzone.h | 16 +++++ mm/vmscan.c | 144 +++++++++++++++++++++++++++++++++++++++++ 2 files changed, 160 insertions(+) diff --git a/include/linux/mmzone.h b/include/linux/mmzone.h index 1014b5a93c09c..a41f4f0ae5eb7 100644 --- a/include/linux/mmzone.h +++ b/include/linux/mmzone.h @@ -628,6 +628,9 @@ void lru_gen_online_memcg(struct mem_cgroup *memcg); void lru_gen_offline_memcg(struct mem_cgroup *memcg); void lru_gen_release_memcg(struct mem_cgroup *memcg); void lru_gen_soft_reclaim(struct mem_cgroup *memcg, int nid); +void max_lru_gen_memcg(struct mem_cgroup *memcg); +bool recheck_lru_gen_max_memcg(struct mem_cgroup *memcg); +void lru_gen_reparent_memcg(struct mem_cgroup *memcg, struct mem_cgroup *p= arent); =20 #else /* !CONFIG_LRU_GEN */ =20 @@ -668,6 +671,19 @@ static inline void lru_gen_soft_reclaim(struct mem_cgr= oup *memcg, int nid) { } =20 +static inline void max_lru_gen_memcg(struct mem_cgroup *memcg) +{ +} + +static inline bool recheck_lru_gen_max_memcg(struct mem_cgroup *memcg) +{ + return true; +} + +static inline void lru_gen_reparent_memcg(struct mem_cgroup *memcg, struct= mem_cgroup *parent) +{ +} + #endif /* CONFIG_LRU_GEN */ =20 struct lruvec { diff --git a/mm/vmscan.c b/mm/vmscan.c index e738082874878..6bc8047b7aec5 100644 --- a/mm/vmscan.c +++ b/mm/vmscan.c @@ -4445,6 +4445,150 @@ void lru_gen_soft_reclaim(struct mem_cgroup *memcg,= int nid) lru_gen_rotate_memcg(lruvec, MEMCG_LRU_HEAD); } =20 +bool recheck_lru_gen_max_memcg(struct mem_cgroup *memcg) +{ + int nid; + + for_each_node(nid) { + struct lruvec *lruvec =3D get_lruvec(memcg, nid); + int type; + + for (type =3D 0; type < ANON_AND_FILE; type++) { + if (get_nr_gens(lruvec, type) !=3D MAX_NR_GENS) + return false; + } + } + + return true; +} + +static void try_to_inc_max_seq_nowalk(struct mem_cgroup *memcg, + struct lruvec *lruvec) +{ + struct lru_gen_mm_list *mm_list =3D get_mm_list(memcg); + struct lru_gen_mm_state *mm_state =3D get_mm_state(lruvec); + int swappiness =3D mem_cgroup_swappiness(memcg); + DEFINE_MAX_SEQ(lruvec); + bool success =3D false; + + /* + * We are not iterating the mm_list here, updating mm_state->seq is just + * to make mm walkers work properly. + */ + if (mm_state) { + spin_lock(&mm_list->lock); + VM_WARN_ON_ONCE(mm_state->seq + 1 < max_seq); + if (max_seq > mm_state->seq) { + WRITE_ONCE(mm_state->seq, mm_state->seq + 1); + success =3D true; + } + spin_unlock(&mm_list->lock); + } else { + success =3D true; + } + + if (success) + inc_max_seq(lruvec, max_seq, swappiness); +} + +/* + * We need to ensure that the folios of child memcg can be reparented to t= he + * same gen of the parent memcg, so the gens of the parent memcg needed be + * incremented to the MAX_NR_GENS before reparenting. + */ +void max_lru_gen_memcg(struct mem_cgroup *memcg) +{ + int nid; + + for_each_node(nid) { + struct lruvec *lruvec =3D get_lruvec(memcg, nid); + int type; + + for (type =3D 0; type < ANON_AND_FILE; type++) { + while (get_nr_gens(lruvec, type) < MAX_NR_GENS) { + try_to_inc_max_seq_nowalk(memcg, lruvec); + cond_resched(); + } + } + } +} + +/* + * Compared to traditional LRU, MGLRU faces the following challenges: + * + * 1. Each lruvec has between MIN_NR_GENS and MAX_NR_GENS generations, the + * number of generations of the parent and child memcg may be different, + * so we cannot simply transfer MGLRU folios in the child memcg to the + * parent memcg as we did for traditional LRU folios. + * 2. The generation information is stored in folio->flags, but we cannot + * traverse these folios while holding the lru lock, otherwise it may + * cause softlockup. + * 3. In walk_update_folio(), the gen of folio and corresponding lru size + * may be updated, but the folio is not immediately moved to the + * corresponding lru list. Therefore, there may be folios of different + * generations on an LRU list. + * 4. In lru_gen_del_folio(), the generation to which the folio belongs is + * found based on the generation information in folio->flags, and the + * corresponding LRU size will be updated. Therefore, we need to update + * the lru size correctly during reparenting, otherwise the lru size may + * be updated incorrectly in lru_gen_del_folio(). + * + * Finally, we choose a compromise method, which is to splice the lru list= in + * the child memcg to the lru list of the same generation in the parent me= mcg + * during reparenting. + * + * The same generation has different meanings in the parent and child memc= g, + * so this compromise method will cause the LRU inversion problem. But as = the + * system runs, this problem will be fixed automatically. + */ +static void __lru_gen_reparent_memcg(struct lruvec *child_lruvec, struct l= ruvec *parent_lruvec, + int zone, int type) +{ + struct lru_gen_folio *child_lrugen, *parent_lrugen; + enum lru_list lru =3D type * LRU_INACTIVE_FILE; + int i; + + child_lrugen =3D &child_lruvec->lrugen; + parent_lrugen =3D &parent_lruvec->lrugen; + + for (i =3D 0; i < get_nr_gens(child_lruvec, type); i++) { + int gen =3D lru_gen_from_seq(child_lrugen->max_seq - i); + long nr_pages =3D child_lrugen->nr_pages[gen][type][zone]; + int dst_lru_active =3D lru_gen_is_active(parent_lruvec, gen) ? LRU_ACTIV= E : 0; + + /* Assuming that child pages are colder than parent pages */ + list_splice_init(&child_lrugen->folios[gen][type][zone], + &parent_lrugen->folios[gen][type][zone]); + + WRITE_ONCE(child_lrugen->nr_pages[gen][type][zone], 0); + WRITE_ONCE(parent_lrugen->nr_pages[gen][type][zone], + parent_lrugen->nr_pages[gen][type][zone] + nr_pages); + + update_lru_size(parent_lruvec, lru + dst_lru_active, zone, nr_pages); + } +} + +void lru_gen_reparent_memcg(struct mem_cgroup *memcg, struct mem_cgroup *p= arent) +{ + int nid; + + for_each_node(nid) { + struct lruvec *child_lruvec, *parent_lruvec; + int type, zid; + struct zone *zone; + + child_lruvec =3D get_lruvec(memcg, nid); + parent_lruvec =3D get_lruvec(parent, nid); + + for_each_managed_zone_pgdat(zone, NODE_DATA(nid), zid, MAX_NR_ZONES - 1)= { + for (type =3D 0; type < ANON_AND_FILE; type++) + __lru_gen_reparent_memcg(child_lruvec, parent_lruvec, zid, type); + mem_cgroup_update_lru_size(parent_lruvec, LRU_UNEVICTABLE, zid, + mem_cgroup_get_zone_lru_size(child_lruvec, LRU_UNEVICTABLE, zid)); + } + } +} + #endif /* CONFIG_MEMCG */ =20 /*************************************************************************= ***** --=20 2.20.1