projects / linux-2.6-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 9269713) | patch
lib/find: optimize find_*_bit_wrap
authorYury Norov <yury.norov@gmail.com>
Sat, 28 Oct 2023 19:05:29 +0000 (12:05 -0700)
committerYury Norov <yury.norov@gmail.com>
Sun, 3 Dec 2023 18:28:17 +0000 (10:28 -0800)
commit27c82f14e6d2bcb9f085bad37fe339227571de60
treeeb381cc01b87c64b93a04df8f9714b0cd4c496e9tree | snapshot
parent92697139b01339b6c0767fa1305a4df9a7c1f37fcommit | diff
lib/find: optimize find_*_bit_wrap

When an offset is 0, there's no need to search a bitmap from the
beginning after the 1st search failed, because each bit has already
been tested.

Signed-off-by: Yury Norov <yury.norov@gmail.com>
include/linux/find.h diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)