summaryrefslogtreecommitdiff
path: root/lib/cpumask.c
diff options
context:
space:
mode:
authorYury Norov <yury.norov@gmail.com>2025-01-28 11:46:36 -0500
committerYury Norov <yury.norov@gmail.com>2025-02-24 16:37:23 -0500
commit566babe82b10b2b02c0ed2cbdefbc05061533d2a (patch)
tree60360729a449dc0ac085a60980fac9c0d04f3901 /lib/cpumask.c
parent3268cb2e49cc2a2d142f210efdc82602639d2047 (diff)
cpumask: use cpumask_next_wrap() where appropriate
Now that cpumask_next{_and}_wrap() is wired to generic find_next_bit_wrap(), we can use it in cpumask_any{_and}_distribute(). This automatically makes the cpumask_*_distribute() functions to use small_cpumask_bits instead of nr_cpumask_bits, which itself is a good optimization. Signed-off-by: Yury Norov <yury.norov@gmail.com>
Diffstat (limited to 'lib/cpumask.c')
-rw-r--r--lib/cpumask.c5
1 files changed, 2 insertions, 3 deletions
diff --git a/lib/cpumask.c b/lib/cpumask.c
index 5ed1dd7e6e33..c9b9a8439775 100644
--- a/lib/cpumask.c
+++ b/lib/cpumask.c
@@ -171,8 +171,7 @@ unsigned int cpumask_any_and_distribute(const struct cpumask *src1p,
/* NOTE: our first selection will skip 0. */
prev = __this_cpu_read(distribute_cpu_mask_prev);
- next = find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p),
- nr_cpumask_bits, prev + 1);
+ next = cpumask_next_and_wrap(prev, src1p, src2p);
if (next < nr_cpu_ids)
__this_cpu_write(distribute_cpu_mask_prev, next);
@@ -192,7 +191,7 @@ unsigned int cpumask_any_distribute(const struct cpumask *srcp)
/* NOTE: our first selection will skip 0. */
prev = __this_cpu_read(distribute_cpu_mask_prev);
- next = find_next_bit_wrap(cpumask_bits(srcp), nr_cpumask_bits, prev + 1);
+ next = cpumask_next_wrap(prev, srcp);
if (next < nr_cpu_ids)
__this_cpu_write(distribute_cpu_mask_prev, next);