mirror of https://github.com/Qortal/Brooklyn
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
177 lines
4.7 KiB
177 lines
4.7 KiB
/* SPDX-License-Identifier: GPL-2.0 */ |
|
#ifndef _TOOLS_LINUX_FIND_H_ |
|
#define _TOOLS_LINUX_FIND_H_ |
|
|
|
#ifndef _TOOLS_LINUX_BITMAP_H |
|
#error tools: only <linux/bitmap.h> can be included directly |
|
#endif |
|
|
|
#include <linux/bitops.h> |
|
|
|
unsigned long _find_next_bit(const unsigned long *addr1, unsigned long nbits, |
|
unsigned long start); |
|
unsigned long _find_next_and_bit(const unsigned long *addr1, const unsigned long *addr2, |
|
unsigned long nbits, unsigned long start); |
|
unsigned long _find_next_zero_bit(const unsigned long *addr, unsigned long nbits, |
|
unsigned long start); |
|
extern unsigned long _find_first_bit(const unsigned long *addr, unsigned long size); |
|
extern unsigned long _find_first_and_bit(const unsigned long *addr1, |
|
const unsigned long *addr2, unsigned long size); |
|
extern unsigned long _find_first_zero_bit(const unsigned long *addr, unsigned long size); |
|
|
|
#ifndef find_next_bit |
|
/** |
|
* find_next_bit - find the next set bit in a memory region |
|
* @addr: The address to base the search on |
|
* @size: The bitmap size in bits |
|
* @offset: The bitnumber to start searching at |
|
* |
|
* Returns the bit number for the next set bit |
|
* If no bits are set, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_next_bit(const unsigned long *addr, unsigned long size, |
|
unsigned long offset) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val; |
|
|
|
if (unlikely(offset >= size)) |
|
return size; |
|
|
|
val = *addr & GENMASK(size - 1, offset); |
|
return val ? __ffs(val) : size; |
|
} |
|
|
|
return _find_next_bit(addr, size, offset); |
|
} |
|
#endif |
|
|
|
#ifndef find_next_and_bit |
|
/** |
|
* find_next_and_bit - find the next set bit in both memory regions |
|
* @addr1: The first address to base the search on |
|
* @addr2: The second address to base the search on |
|
* @size: The bitmap size in bits |
|
* @offset: The bitnumber to start searching at |
|
* |
|
* Returns the bit number for the next set bit |
|
* If no bits are set, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_next_and_bit(const unsigned long *addr1, |
|
const unsigned long *addr2, unsigned long size, |
|
unsigned long offset) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val; |
|
|
|
if (unlikely(offset >= size)) |
|
return size; |
|
|
|
val = *addr1 & *addr2 & GENMASK(size - 1, offset); |
|
return val ? __ffs(val) : size; |
|
} |
|
|
|
return _find_next_and_bit(addr1, addr2, size, offset); |
|
} |
|
#endif |
|
|
|
#ifndef find_next_zero_bit |
|
/** |
|
* find_next_zero_bit - find the next cleared bit in a memory region |
|
* @addr: The address to base the search on |
|
* @size: The bitmap size in bits |
|
* @offset: The bitnumber to start searching at |
|
* |
|
* Returns the bit number of the next zero bit |
|
* If no bits are zero, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size, |
|
unsigned long offset) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val; |
|
|
|
if (unlikely(offset >= size)) |
|
return size; |
|
|
|
val = *addr | ~GENMASK(size - 1, offset); |
|
return val == ~0UL ? size : ffz(val); |
|
} |
|
|
|
return _find_next_zero_bit(addr, size, offset); |
|
} |
|
#endif |
|
|
|
#ifndef find_first_bit |
|
/** |
|
* find_first_bit - find the first set bit in a memory region |
|
* @addr: The address to start the search at |
|
* @size: The maximum number of bits to search |
|
* |
|
* Returns the bit number of the first set bit. |
|
* If no bits are set, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_first_bit(const unsigned long *addr, unsigned long size) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val = *addr & GENMASK(size - 1, 0); |
|
|
|
return val ? __ffs(val) : size; |
|
} |
|
|
|
return _find_first_bit(addr, size); |
|
} |
|
#endif |
|
|
|
#ifndef find_first_and_bit |
|
/** |
|
* find_first_and_bit - find the first set bit in both memory regions |
|
* @addr1: The first address to base the search on |
|
* @addr2: The second address to base the search on |
|
* @size: The bitmap size in bits |
|
* |
|
* Returns the bit number for the next set bit |
|
* If no bits are set, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_first_and_bit(const unsigned long *addr1, |
|
const unsigned long *addr2, |
|
unsigned long size) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val = *addr1 & *addr2 & GENMASK(size - 1, 0); |
|
|
|
return val ? __ffs(val) : size; |
|
} |
|
|
|
return _find_first_and_bit(addr1, addr2, size); |
|
} |
|
#endif |
|
|
|
#ifndef find_first_zero_bit |
|
/** |
|
* find_first_zero_bit - find the first cleared bit in a memory region |
|
* @addr: The address to start the search at |
|
* @size: The maximum number of bits to search |
|
* |
|
* Returns the bit number of the first cleared bit. |
|
* If no bits are zero, returns @size. |
|
*/ |
|
static inline |
|
unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val = *addr | ~GENMASK(size - 1, 0); |
|
|
|
return val == ~0UL ? size : ffz(val); |
|
} |
|
|
|
return _find_first_zero_bit(addr, size); |
|
} |
|
#endif |
|
|
|
#endif /*__LINUX_FIND_H_ */
|
|
|