From: Hao Jia <jiahao.kernel@gmail.com>
To: akpm@linux-foundation.org
Cc: yuzhao@google.com, yuanchu@google.com, shakeel.butt@linux.dev,
mhocko@kernel.org, lorenzo.stoakes@oracle.com,
kinseyho@google.com, hannes@cmpxchg.org, gthelen@google.com,
david@redhat.com, zhengqi.arch@bytedance.com, linux-mm@kvack.org,
linux-kernel@vger.kernel.org, Hao Jia <jiahao1@lixiang.com>,
Axel Rasmussen <axelrasmussen@google.com>
Subject: Re: [PATCH v2] mm/mglru: Stop try_to_inc_min_seq() if min_seq[type] has not increased
Date: Fri, 11 Jul 2025 13:27:30 +0800 [thread overview]
Message-ID: <e065c6df-f0e2-e9e6-bf20-959b809d2c7e@gmail.com> (raw)
In-Reply-To: <CAJHvVcgoGwnk4TdZxj=Lvhny4sus0eZ=MbuWEVK0m6fACLFRow@mail.gmail.com>
On 2025/7/11 06:49, Axel Rasmussen wrote:
> On Wed, Jul 2, 2025 at 7:40 PM Hao Jia <jiahao.kernel@gmail.com> wrote:
>>
>> From: Hao Jia <jiahao1@lixiang.com>
>>
>> In try_to_inc_min_seq(), if min_seq[type] has not increased. In other
>> words, min_seq[type] == lrugen->min_seq[type]. Then we should return
>> directly to avoid unnecessary overhead later.
>>
>> Corollary: If min_seq[type] of both anonymous and file is not increased,
>> try_to_inc_min_seq() will fail.
>>
>> Proof:
>> It is known that min_seq[type] has not increased, that is, min_seq[type]
>> is equal to lrugen->min_seq[type], then the following:
>>
>> case 1: min_seq[type] has not been reassigned and changed before
>> judgment min_seq[type] <= lrugen->min_seq[type].
>> Then the subsequent min_seq[type] <= lrugen->min_seq[type] judgment
>> will always be true.
>>
>> case 2: min_seq[type] is reassigned to seq, before judgment
>> min_seq[type] <= lrugen->min_seq[type].
>> Then at least the condition of min_seq[type] > seq must be met
>> before min_seq[type] will be reassigned to seq.
>> That is to say, before the reassignment, lrugen->min_seq[type] > seq
>> is met, and then min_seq[type] = seq.
>> Then the following min_seq[type](seq) <= lrugen->min_seq[type] judgment
>> is always true.
>>
>> Therefore, in try_to_inc_min_seq(), If min_seq[type] of both anonymous
>> and file is not increased, we can return false directly to avoid
>> unnecessary overhead.
>>
>> Suggested-by: Yuanchu Xie <yuanchu@google.com>
>> Signed-off-by: Hao Jia <jiahao1@lixiang.com>
>> ---
>> v1 to v2:
>> - Modify commit message to make proof clearer.
>> - Use one bool to detect any increments in min_seq[type], suggested by Yuanchu Xie.
>>
>> Link to v1: https://lore.kernel.org/all/20250630080603.36171-1-jiahao.kernel@gmail.com
>>
>> mm/vmscan.c | 10 ++++++++++
>> 1 file changed, 10 insertions(+)
>>
>> diff --git a/mm/vmscan.c b/mm/vmscan.c
>> index d48e8d365502..d5b6924aeb8f 100644
>> --- a/mm/vmscan.c
>> +++ b/mm/vmscan.c
>> @@ -3919,6 +3919,7 @@ static bool try_to_inc_min_seq(struct lruvec *lruvec, int swappiness)
>> {
>> int gen, type, zone;
>> bool success = false;
>> + bool seq_inc_flag = false;
>> struct lru_gen_folio *lrugen = &lruvec->lrugen;
>> DEFINE_MIN_SEQ(lruvec);
>>
>> @@ -3935,11 +3936,20 @@ static bool try_to_inc_min_seq(struct lruvec *lruvec, int swappiness)
>> }
>>
>> min_seq[type]++;
>> + seq_inc_flag = true;
>> }
>> next:
>> ;
>> }
>>
>> + /*
>> + * If min_seq[type] of both anonymous and file is not increased,
>> + * we can directly return false to avoid unnecessary checking
>> + * overhead later.
>> + */
>
> I think we can make this comment (and probably the commit message) even simpler.
>
> try_to_inc_min_seq (and inc_min_seq) are both called under lru_lock,
> so I don't think there can be any concurrent modifications going on.
> (Note readers don't necessarily take the lock though.) So I think we
> can simply state it like:
>
> "If we didn't change any min_seq, we can return immediately."
>
> This patch had caused me to think we can do even more to make this
> function simpler, but I spent an hour fiddling with it and I don't
> have any concrete suggestions. So, I see no reason to hold up this
> patch, it seems straightforwardly correct to me. Any further
> simplification could just be a follow up patch later.
>
> You can take:
> Reviewed-by: Axel Rasmussen <axelrasmussen@google.com>
>
Hi, Andrew
Could you please replace the V1 version in mm-unstable branch with this
patch v2?
https://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm.git/commit/?h=mm-unstable&id=0163463f9dcc965060c5f51de69727d1b21d2b2b
Patch v2 looks more reasonable.
Thanks,
Hao
>> + if (!seq_inc_flag)
>> + return success;
>> +
>> /* see the comment on lru_gen_folio */
>> if (swappiness && swappiness <= MAX_SWAPPINESS) {
>> unsigned long seq = lrugen->max_seq - MIN_NR_GENS;
>> --
>> 2.34.1
>>
prev parent reply other threads:[~2025-07-11 5:27 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
2025-07-03 2:39 Hao Jia
2025-07-10 22:49 ` Axel Rasmussen
2025-07-11 5:27 ` Hao Jia [this message]
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=e065c6df-f0e2-e9e6-bf20-959b809d2c7e@gmail.com \
--to=jiahao.kernel@gmail.com \
--cc=akpm@linux-foundation.org \
--cc=axelrasmussen@google.com \
--cc=david@redhat.com \
--cc=gthelen@google.com \
--cc=hannes@cmpxchg.org \
--cc=jiahao1@lixiang.com \
--cc=kinseyho@google.com \
--cc=linux-kernel@vger.kernel.org \
--cc=linux-mm@kvack.org \
--cc=lorenzo.stoakes@oracle.com \
--cc=mhocko@kernel.org \
--cc=shakeel.butt@linux.dev \
--cc=yuanchu@google.com \
--cc=yuzhao@google.com \
--cc=zhengqi.arch@bytedance.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox