mirror of
https://github.com/Fishwaldo/linux-bl808.git
synced 2025-03-29 10:24:08 +00:00
bb8bc36ef8
m68k and sh include bitmap/{find,le}.h prior to ffs/fls headers. New
fast-path implementation in find.h requires ffs/fls. Reordering the
headers inclusion sequence helps to prevent compile-time implicit function
declaration error.
[yury.norov@gmail.com: h8300: rearrange headers inclusion order in asm/bitops]
Link: https://lkml.kernel.org/r/20210406183625.794227-1-yury.norov@gmail.com
Link: https://lkml.kernel.org/r/20210401003153.97325-5-yury.norov@gmail.com
Signed-off-by: Yury Norov <yury.norov@gmail.com>
Acked-by: Geert Uytterhoeven <geert@linux-m68k.org>
Acked-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>
Reviewed-by: Andy Shevchenko <andriy.shevchenko@linux.intel.com>
Tested-by: Guenter Roeck <linux@roeck-us.net>
Cc: Alexey Klimov <aklimov@redhat.com>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: David Sterba <dsterba@suse.com>
Cc: Dennis Zhou <dennis@kernel.org>
Cc: Jianpeng Ma <jianpeng.ma@intel.com>
Cc: Joe Perches <joe@perches.com>
Cc: John Paul Adrian Glaubitz <glaubitz@physik.fu-berlin.de>
Cc: Josh Poimboeuf <jpoimboe@redhat.com>
Cc: Rich Felker <dalias@libc.org>
Cc: Stefano Brivio <sbrivio@redhat.com>
Cc: Wei Yang <richard.weiyang@linux.alibaba.com>
Cc: Wolfram Sang <wsa+renesas@sang-engineering.com>
Cc: Yoshinori Sato <ysato@users.osdn.me>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
73 lines
1.6 KiB
C
73 lines
1.6 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __ASM_SH_BITOPS_H
|
|
#define __ASM_SH_BITOPS_H
|
|
|
|
#ifndef _LINUX_BITOPS_H
|
|
#error only <linux/bitops.h> can be included directly
|
|
#endif
|
|
|
|
/* For __swab32 */
|
|
#include <asm/byteorder.h>
|
|
#include <asm/barrier.h>
|
|
|
|
#ifdef CONFIG_GUSA_RB
|
|
#include <asm/bitops-grb.h>
|
|
#elif defined(CONFIG_CPU_SH2A)
|
|
#include <asm-generic/bitops/atomic.h>
|
|
#include <asm/bitops-op32.h>
|
|
#elif defined(CONFIG_CPU_SH4A)
|
|
#include <asm/bitops-llsc.h>
|
|
#elif defined(CONFIG_CPU_J2) && defined(CONFIG_SMP)
|
|
#include <asm/bitops-cas.h>
|
|
#else
|
|
#include <asm-generic/bitops/atomic.h>
|
|
#include <asm-generic/bitops/non-atomic.h>
|
|
#endif
|
|
|
|
static inline unsigned long ffz(unsigned long word)
|
|
{
|
|
unsigned long result;
|
|
|
|
__asm__("1:\n\t"
|
|
"shlr %1\n\t"
|
|
"bt/s 1b\n\t"
|
|
" add #1, %0"
|
|
: "=r" (result), "=r" (word)
|
|
: "0" (~0L), "1" (word)
|
|
: "t");
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* __ffs - find first bit in word.
|
|
* @word: The word to search
|
|
*
|
|
* Undefined if no bit exists, so code should check against 0 first.
|
|
*/
|
|
static inline unsigned long __ffs(unsigned long word)
|
|
{
|
|
unsigned long result;
|
|
|
|
__asm__("1:\n\t"
|
|
"shlr %1\n\t"
|
|
"bf/s 1b\n\t"
|
|
" add #1, %0"
|
|
: "=r" (result), "=r" (word)
|
|
: "0" (~0L), "1" (word)
|
|
: "t");
|
|
return result;
|
|
}
|
|
|
|
#include <asm-generic/bitops/ffs.h>
|
|
#include <asm-generic/bitops/hweight.h>
|
|
#include <asm-generic/bitops/lock.h>
|
|
#include <asm-generic/bitops/sched.h>
|
|
#include <asm-generic/bitops/ext2-atomic.h>
|
|
#include <asm-generic/bitops/fls.h>
|
|
#include <asm-generic/bitops/__fls.h>
|
|
#include <asm-generic/bitops/fls64.h>
|
|
|
|
#include <asm-generic/bitops/le.h>
|
|
#include <asm-generic/bitops/find.h>
|
|
|
|
#endif /* __ASM_SH_BITOPS_H */
|