tjh.dev / kernel
Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux
1
fork

Configure Feed

Select the types of activity you want to include in your feed.

Merge tag 'bitmap-for-6.9' of https://github.com/norov/linux

Pull bitmap updates from Yury Norov:
"A couple of random cleanups plus a step-down patch from Andy"

* tag 'bitmap-for-6.9' of https://github.com/norov/linux:
bitmap: Step down as a reviewer
lib/find: optimize find_*_bit_wrap
lib/find_bit: Fix the code comments about find_next_bit_wrap

Linus Torvalds 879e2886 23956900

+4 -5
-1
MAINTAINERS
··· 3598 3598 3599 3599 BITMAP API 3600 3600 M: Yury Norov <yury.norov@gmail.com> 3601 - R: Andy Shevchenko <andriy.shevchenko@linux.intel.com> 3602 3601 R: Rasmus Villemoes <linux@rasmusvillemoes.dk> 3603 3602 S: Maintained 3604 3603 F: include/linux/bitfield.h
+4 -4
include/linux/find.h
··· 405 405 { 406 406 unsigned long bit = find_next_and_bit(addr1, addr2, size, offset); 407 407 408 - if (bit < size) 408 + if (bit < size || offset == 0) 409 409 return bit; 410 410 411 411 bit = find_first_and_bit(addr1, addr2, offset); ··· 413 413 } 414 414 415 415 /** 416 - * find_next_bit_wrap - find the next set bit in both memory regions 417 - * @addr: The first address to base the search on 416 + * find_next_bit_wrap - find the next set bit in a memory region 417 + * @addr: The address to base the search on 418 418 * @size: The bitmap size in bits 419 419 * @offset: The bitnumber to start searching at 420 420 * ··· 427 427 { 428 428 unsigned long bit = find_next_bit(addr, size, offset); 429 429 430 - if (bit < size) 430 + if (bit < size || offset == 0) 431 431 return bit; 432 432 433 433 bit = find_first_bit(addr, offset);