[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <87a4xy9ecs.ffs@tglx>
Date: Wed, 28 Jan 2026 12:16:35 +0100
From: Thomas Gleixner <tglx@...nel.org>
To: Zhan Xusheng <zhanxusheng1024@...il.com>
Cc: linux-kernel@...r.kernel.org, linux-irq@...r.kernel.org, Zhan Xusheng
<zhanxusheng@...omi.com>
Subject: Re: [PATCH v3 2/2] genirq/matrix: Avoid implicit tie-breaking by
CPU iteration order
On Wed, Jan 28 2026 at 11:14, Zhan Xusheng wrote:
> matrix_find_best_cpu_managed() updates best_cpu even when two CPUs
> have the same managed_allocated count. As a result, the final
> selection implicitly depends on CPU iteration order.
And?
> Update the comparison to replace the current best CPU only when a
> CPU has a strictly smaller managed_allocated value. This removes
> the iteration-order-based tie-breaking for equal cases.
And replaces it by a different iteration order based decision, no?
What are you actually trying to solve here and why does it matter at
all? If it solves nothing then what's the point?
> This patch intentionally changes the selection behavior.
1) # git grep 'This patch' Documentation/process/
2) It's already clear from the above that this changes the behaviour, so
no point in repeating the obvious.
The phrase "No functional change intended" is very different because
it tells the reviewer that this is a pure code refactoring.
Thanks,
tglx
Powered by blists - more mailing lists