Re: [PATCH v2] mm/slab_common: fix shrink budget underflow in kfree_rcu_shrink_scan

[Harry Yoo <harry@kernel.org>]

On Thu, Sep 03, 2026 at 05:13:15PM +0800, Longlong Xia wrote:
> Thanks for the reply.
> 
> 在 2026/8/30 22:22, Harry Yoo 写道:
> > On Wed, Aug 26, 2026 at 03:56:53PM +0800, Longlong Xia wrote:
> > > From: Longlong Xia <xialonglong@kylinos.cn>
> > Hi Longlong, I have a few questions.
> > 
> > > The kfree_rcu shrinker decremented sc->nr_to_scan (unsigned long)
> > > and then tested the result with <= 0. When a single CPU's object
> > > count exceeds the remaining budget, the subtraction wraps to a large
> > > positive value and the <= 0 comparison, which is equivalent to == 0
> > > for an unsigned type, never fires again.
> > Since when (which commit) has it been broken?
> > If it has been undiscovered for a very long time, why is that so?
> 
> Since the shrinker was first added: 9154244c1ab6 ("rcu/tree: Add a
> shrinker to prevent OOM due to kfree_rcu() batching", v5.8);
> 

I see.

> > And how did you discover this?
> 
> While reviewing the kvfree_rcu() batching paths with the help of AI
> tooling (hence the Assisted-by: tag in the patch), which flagged the
> unsigned subtraction feeding a "<= 0" test.

Okay.

> > > The scan loop then iterates
> > > through every possible CPU instead of honouring the reclaim budget.
> > Did you confirm this actually does happen? If so, how often does the
> > kernel end up iterating through every possible CPUs, very rarely or
> > almost always?
> 
> Yes, in two ways.
> 
> Experiment 1 -- deterministic, instrumented loop.  Per-CPU pr_info()
> plus a test entry invoking kfree_rcu_shrink_scan() with a controlled
> budget; 4-CPU QEMU guest, 400 objects queued on CPU0, budget 50:
>   buggy:   cpu=0 count=400 nr_to_scan_after_sub=18446744073709551266
>                 visits all 4 CPUs
>   patched: cpu=0 count=400 nr_to_scan=50 BREAK
> 
>                stops at CPU0
> 
> Experiment 2 -- natural trigger, no kernel modification at all
> (kprobes only).  Setup: 1 GiB QEMU guest, 4 possible CPUs, no swap.
> 
>   1. Observation: three kprobes.  Scan entry/exit record nr_to_scan
>      and the return value; each kfree_rcu_monitor() hit inside a
>      scan is one CPU the loop processed.
> 
>   2. Memory pressure: ~650 MiB of anonymous memory.
> 
>   3. krc backlog: loaded the in-tree test_vmalloc module ,
> 
>      which repeatedly vmalloc()s one page and frees it via kvfree_rcu();
> 
>     10 million iterations over ~70s kept the per-CPU queues populated.
> 
> Result within ~70s: 262 natural invocations, all from kswapd0;
> 171 of the 261 scans that found a backlog (66%) overshot the budget
> (nr_to_scan = 128, freed up to 4479) and visited all 4 possible CPUs.

Thanks for confirming with the experiment.

> > Would this affect the kernel's reclamation behavior in some way?
> 
> The break was meant to cap the scan at the reclaim budget; once
> the subtraction wraps, the cap is gone and one scan processes
> every possible CPU, draining the whole backlog instead of a
> budget-sized slice.

The fix logically makes sense to me. But I'm being cautious to
introduce a functional change even when it was unintentional and
'accidentally' worked. Especially when it has been like this from
the beginning.

IIUC it will almost always end up visiting all CPUs
unless sum of objects exactly matches nr_to_scan at some point.

In most cases it will visit all CPUs because either 1) the counter
overflows or 2) the number of objects was smaller than the budget.

While I agree that the code doesn't work as intended, I don't think
you have enough justification to change the behavior. I'd rather fix
the code to match the current behavior rather than changing the
behavior.

-- 
Cheers,
Harry / Hyeonggon