diff options
| author | Akinobu Mita <akinobu.mita@gmail.com> | 2011-05-27 01:26:06 +0200 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2011-05-27 02:12:38 +0200 |
| commit | a2812e178321132811a53f7be40fe7e9bbffd9e0 (patch) | |
| tree | 5e1ae6d683d964cce8b4f107d8032522ac69b372 /include/asm-generic/bitops/find.h | |
| parent | m68knommu: fix build error due to the lack of find_next_bit_le() (diff) | |
| download | linux-a2812e178321132811a53f7be40fe7e9bbffd9e0.tar.xz linux-a2812e178321132811a53f7be40fe7e9bbffd9e0.zip | |
arch: add #define for each of optimized find bitops
The style that we normally use in asm-generic is to test the macro itself
for existence, so in asm-generic, do:
#ifndef find_next_zero_bit_le
extern unsigned long find_next_zero_bit_le(const void *addr,
unsigned long size, unsigned long offset);
#endif
and in the architectures, write
static inline unsigned long find_next_zero_bit_le(const void *addr,
unsigned long size, unsigned long offset)
#define find_next_zero_bit_le find_next_zero_bit_le
This adds the #define for each of the optimized find bitops in the
architectures.
Suggested-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Akinobu Mita <akinobu.mita@gmail.com>
Acked-by: Hans-Christian Egtvedt <hans-christian.egtvedt@atmel.com>
Acked-by: Russell King <rmk+kernel@arm.linux.org.uk>
Acked-by: Greg Ungerer <gerg@uclinux.org>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Acked-by: Geert Uytterhoeven <geert@linux-m68k.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'include/asm-generic/bitops/find.h')
0 files changed, 0 insertions, 0 deletions