OSDN Git Service

find: micro-optimize for_each_{set,clear}_bit()
authorYury Norov <yury.norov@gmail.com>
Sat, 14 Aug 2021 21:17:07 +0000 (14:17 -0700)
committerYury Norov <yury.norov@gmail.com>
Sat, 15 Jan 2022 16:47:31 +0000 (08:47 -0800)
commit7516be9931b8bc8bcaac8531f490b42ab11ded1e
tree7437188f8ff4a29f05075c3932641aeec0b6d12f
parentbc9d6635c293a2ac30c6319f7cfd08860ab7948a
find: micro-optimize for_each_{set,clear}_bit()

The macros iterate thru all set/clear bits in a bitmap. They search a
first bit using find_first_bit(), and the rest bits using find_next_bit().

Since find_next_bit() is called shortly after find_first_bit(), we can
save few lines of I-cache by not using find_first_bit().

Signed-off-by: Yury Norov <yury.norov@gmail.com>
Tested-by: Wolfram Sang <wsa+renesas@sang-engineering.com>
include/linux/find.h