mirror of
https://github.com/torvalds/linux.git
synced 2024-12-21 02:21:36 +00:00
23e1a358e8
To match the Linux kernel source code structure from where this code came from. Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Borislav Petkov <bp@suse.de> Cc: David Ahern <dsahern@gmail.com> Cc: Don Zickus <dzickus@redhat.com> Cc: Frederic Weisbecker <fweisbec@gmail.com> Cc: Jiri Olsa <jolsa@redhat.com> Cc: Mike Galbraith <efault@gmx.de> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Paul Mackerras <paulus@samba.org> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Stephane Eranian <eranian@google.com> Link: http://lkml.kernel.org/n/tip-fkbma1h04ki0zzdmp0dpgfyy@git.kernel.org Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
34 lines
965 B
C
34 lines
965 B
C
#ifndef _TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_
|
|
#define _TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_
|
|
|
|
#ifndef find_next_bit
|
|
/**
|
|
* find_next_bit - find the next set bit in a memory region
|
|
* @addr: The address to base the search on
|
|
* @offset: The bitnumber to start searching at
|
|
* @size: The bitmap size in bits
|
|
*
|
|
* Returns the bit number for the next set bit
|
|
* If no bits are set, returns @size.
|
|
*/
|
|
extern unsigned long find_next_bit(const unsigned long *addr, unsigned long
|
|
size, unsigned long 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.
|
|
*/
|
|
extern unsigned long find_first_bit(const unsigned long *addr,
|
|
unsigned long size);
|
|
|
|
#endif /* find_first_bit */
|
|
|
|
#endif /*_TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_ */
|