[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <CABAhCORLzrKc6urUp_UOL-OybdbHUs+y62DTp2XxR9LobOqEig@mail.gmail.com>
Date: Tue, 15 Jul 2025 17:01:04 +0800
From: Xiao Liang <shaw.leon@...il.com>
To: Steffen Klassert <steffen.klassert@...unet.com>,
Daniel Jordan <daniel.m.jordan@...cle.com>, Herbert Xu <herbert@...dor.apana.org.au>
Cc: linux-crypto@...r.kernel.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH] padata: Reset next CPU when reorder sequence wraps around
> diff --git a/kernel/padata.c b/kernel/padata.c
> index 7eee94166357..ebb52c6db637 100644
> --- a/kernel/padata.c
> +++ b/kernel/padata.c
> @@ -290,7 +290,11 @@ static struct padata_priv *padata_find_next(struct parallel_data *pd,
> if (remove_object) {
> list_del_init(&padata->list);
> ++pd->processed;
> - pd->cpu = cpumask_next_wrap(cpu, pd->cpumask.pcpu);
> + /* When sequence wraps around, reset to the first CPU. */
> + if (unlikely(pd->processed == 0))
> + pd->cpu = cpumask_first(pd->cpumask.pcpu);
> + else
> + pd->cpu = cpumask_next_wrap(cpu, pd->cpumask.pcpu);
> }
>
> spin_unlock(&reorder->lock);
> --
> 2.50.0
>
Another question:
Do we even need a per-CPU reorder_list? It's always used
with a remote CPU id and spin-lock. Would a plain array of
struct padata_list be sufficient?
Powered by blists - more mailing lists