projects / linux-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 7339233) | patch
bitmap: generalize node_random()
authorYury Norov [NVIDIA] <yury.norov@gmail.com>
Thu, 19 Jun 2025 18:26:23 +0000 (14:26 -0400)
committerYury Norov <yury.norov@gmail.com>
Tue, 8 Jul 2025 23:11:57 +0000 (19:11 -0400)
commitc56f97c5c71f17d781461d44acb777cd21521b81
treeba7b64c3d174d2978426d06e1a3e58eafb61c503tree
parent733923397fd95405a48f165c9b1fbc8c4b0a4681commit | diff
bitmap: generalize node_random()

Generalize node_random() and make it available to general bitmaps and
cpumasks users.

Notice, find_first_bit() is generally faster than find_nth_bit(), and we
employ it when there's a single set bit in the bitmap.

See commit 3e061d924fe9c7b4 ("lib/nodemask: optimize node_random for
nodemask with single NUMA node").

CC: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: "Yury Norov [NVIDIA]" <yury.norov@gmail.com>
include/linux/find.h diff | blob | blame | history
include/linux/nodemask.h diff | blob | blame | history
lib/find_bit.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)