diff options
| author |   Yury Norov <yury.norov@gmail.com> | 2021-08-14 14:17:07 -0700 |
|---|---|---|
| committer | Yury Norov <yury.norov@gmail.com> | 2022-01-15 08:47:31 -0800 |
| commit | 7516be9931b8bc8bcaac8531f490b42ab11ded1e (patch) | |
| tree | 7437188f8ff4a29f05075c3932641aeec0b6d12f /scripts/bpf_doc.py | |
| parent | include/linux: move for_each_bit() macros from bitops.h to find.h (diff) | |
| download | linux-dev-7516be9931b8bc8bcaac8531f490b42ab11ded1e.tar.xz linux-dev-7516be9931b8bc8bcaac8531f490b42ab11ded1e.zip | |
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>
Diffstat (limited to 'scripts/bpf_doc.py')
0 files changed, 0 insertions, 0 deletions