mirror of
https://github.com/adulau/aha.git
synced 2024-12-30 20:56:23 +00:00
1efe4ce3ca
This implements kernel-level atomic rollback built on top of gUSA, as an alternative non-IRQ based atomicity method. This is generally a faster method for platforms that are lacking the LL/SC pairs that SH-4A and later use, and is only supportable on legacy cores. Signed-off-by: Stuart Menefy <stuart.menefy@st.com> Signed-off-by: Paul Mundt <lethal@linux-sh.org>
102 lines
2.3 KiB
C
102 lines
2.3 KiB
C
#ifndef __ASM_SH_BITOPS_H
|
|
#define __ASM_SH_BITOPS_H
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
#ifndef _LINUX_BITOPS_H
|
|
#error only <linux/bitops.h> can be included directly
|
|
#endif
|
|
|
|
#include <asm/system.h>
|
|
/* For __swab32 */
|
|
#include <asm/byteorder.h>
|
|
|
|
#ifdef CONFIG_GUSA_RB
|
|
#include <asm/bitops-grb.h>
|
|
#else
|
|
#include <asm/bitops-irq.h>
|
|
#endif
|
|
|
|
|
|
/*
|
|
* clear_bit() doesn't provide any barrier for the compiler.
|
|
*/
|
|
#define smp_mb__before_clear_bit() barrier()
|
|
#define smp_mb__after_clear_bit() barrier()
|
|
|
|
#include <asm-generic/bitops/non-atomic.h>
|
|
|
|
#ifdef CONFIG_SUPERH32
|
|
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;
|
|
}
|
|
#else
|
|
static inline unsigned long ffz(unsigned long word)
|
|
{
|
|
unsigned long result, __d2, __d3;
|
|
|
|
__asm__("gettr tr0, %2\n\t"
|
|
"pta $+32, tr0\n\t"
|
|
"andi %1, 1, %3\n\t"
|
|
"beq %3, r63, tr0\n\t"
|
|
"pta $+4, tr0\n"
|
|
"0:\n\t"
|
|
"shlri.l %1, 1, %1\n\t"
|
|
"addi %0, 1, %0\n\t"
|
|
"andi %1, 1, %3\n\t"
|
|
"beqi %3, 1, tr0\n"
|
|
"1:\n\t"
|
|
"ptabs %2, tr0\n\t"
|
|
: "=r" (result), "=r" (word), "=r" (__d2), "=r" (__d3)
|
|
: "0" (0L), "1" (word));
|
|
|
|
return result;
|
|
}
|
|
|
|
#include <asm-generic/bitops/__ffs.h>
|
|
#endif
|
|
|
|
#include <asm-generic/bitops/find.h>
|
|
#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-non-atomic.h>
|
|
#include <asm-generic/bitops/ext2-atomic.h>
|
|
#include <asm-generic/bitops/minix.h>
|
|
#include <asm-generic/bitops/fls.h>
|
|
#include <asm-generic/bitops/fls64.h>
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
#endif /* __ASM_SH_BITOPS_H */
|