2005-04-17 06:20:36 +08:00
|
|
|
/* asm/bitops.h for Linux/CRIS
|
|
|
|
*
|
|
|
|
* TODO: asm versions if speed is needed
|
|
|
|
*
|
|
|
|
* All bit operations return 0 if the bit was cleared before the
|
|
|
|
* operation and != 0 if it was not.
|
|
|
|
*
|
|
|
|
* bit 0 is the LSB of addr; bit 32 is the LSB of (addr+1).
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _CRIS_BITOPS_H
|
|
|
|
#define _CRIS_BITOPS_H
|
|
|
|
|
|
|
|
/* Currently this is unsuitable for consumption outside the kernel. */
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
2007-10-19 14:40:26 +08:00
|
|
|
#ifndef _LINUX_BITOPS_H
|
|
|
|
#error only <linux/bitops.h> can be included directly
|
|
|
|
#endif
|
|
|
|
|
2008-10-21 23:45:58 +08:00
|
|
|
#include <arch/bitops.h>
|
2011-07-27 07:09:06 +08:00
|
|
|
#include <linux/atomic.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/compiler.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set_bit - Atomically set a bit in memory
|
|
|
|
* @nr: the bit to set
|
|
|
|
* @addr: the address to start counting from
|
|
|
|
*
|
|
|
|
* This function is atomic and may not be reordered. See __set_bit()
|
|
|
|
* if you do not require the atomic guarantees.
|
|
|
|
* Note that @nr may be almost arbitrarily large; this function is not
|
|
|
|
* restricted to acting on a single-word quantity.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define set_bit(nr, addr) (void)test_and_set_bit(nr, addr)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* clear_bit - Clears a bit in memory
|
|
|
|
* @nr: Bit to clear
|
|
|
|
* @addr: Address to start counting from
|
|
|
|
*
|
|
|
|
* clear_bit() is atomic and may not be reordered. However, it does
|
|
|
|
* not contain a memory barrier, so if it is used for locking purposes,
|
|
|
|
* you should call smp_mb__before_clear_bit() and/or smp_mb__after_clear_bit()
|
|
|
|
* in order to ensure changes are visible on other processors.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define clear_bit(nr, addr) (void)test_and_clear_bit(nr, addr)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* change_bit - Toggle a bit in memory
|
|
|
|
* @nr: Bit to change
|
|
|
|
* @addr: Address to start counting from
|
|
|
|
*
|
|
|
|
* change_bit() is atomic and may not be reordered.
|
|
|
|
* Note that @nr may be almost arbitrarily large; this function is not
|
|
|
|
* restricted to acting on a single-word quantity.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define change_bit(nr, addr) (void)test_and_change_bit(nr, addr)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* test_and_set_bit - Set a bit and return its old value
|
|
|
|
* @nr: Bit to set
|
|
|
|
* @addr: Address to count from
|
|
|
|
*
|
|
|
|
* This operation is atomic and cannot be reordered.
|
|
|
|
* It also implies a memory barrier.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 16:58:44 +08:00
|
|
|
static inline int test_and_set_bit(int nr, volatile unsigned long *addr)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned int mask, retval;
|
|
|
|
unsigned long flags;
|
|
|
|
unsigned int *adr = (unsigned int *)addr;
|
|
|
|
|
|
|
|
adr += nr >> 5;
|
|
|
|
mask = 1 << (nr & 0x1f);
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_save(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
retval = (mask & *adr) != 0;
|
|
|
|
*adr |= mask;
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_restore(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* clear_bit() doesn't provide any barrier for the compiler.
|
|
|
|
*/
|
|
|
|
#define smp_mb__before_clear_bit() barrier()
|
|
|
|
#define smp_mb__after_clear_bit() barrier()
|
|
|
|
|
|
|
|
/**
|
|
|
|
* test_and_clear_bit - Clear a bit and return its old value
|
|
|
|
* @nr: Bit to clear
|
|
|
|
* @addr: Address to count from
|
|
|
|
*
|
|
|
|
* This operation is atomic and cannot be reordered.
|
|
|
|
* It also implies a memory barrier.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 16:58:44 +08:00
|
|
|
static inline int test_and_clear_bit(int nr, volatile unsigned long *addr)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned int mask, retval;
|
|
|
|
unsigned long flags;
|
|
|
|
unsigned int *adr = (unsigned int *)addr;
|
|
|
|
|
|
|
|
adr += nr >> 5;
|
|
|
|
mask = 1 << (nr & 0x1f);
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_save(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
retval = (mask & *adr) != 0;
|
|
|
|
*adr &= ~mask;
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_restore(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* test_and_change_bit - Change a bit and return its old value
|
|
|
|
* @nr: Bit to change
|
|
|
|
* @addr: Address to count from
|
|
|
|
*
|
|
|
|
* This operation is atomic and cannot be reordered.
|
|
|
|
* It also implies a memory barrier.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 16:58:44 +08:00
|
|
|
static inline int test_and_change_bit(int nr, volatile unsigned long *addr)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned int mask, retval;
|
|
|
|
unsigned long flags;
|
|
|
|
unsigned int *adr = (unsigned int *)addr;
|
|
|
|
adr += nr >> 5;
|
|
|
|
mask = 1 << (nr & 0x1f);
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_save(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
retval = (mask & *adr) != 0;
|
|
|
|
*adr ^= mask;
|
2005-07-28 02:44:43 +08:00
|
|
|
cris_atomic_restore(addr, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
[PATCH] bitops: cris: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls()
- remove generic_fls64()
- remove generic_hweight{32,16,8}()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
- remove sched_find_first_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Acked-by: Mikael Starvik <starvik@axis.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 17:39:21 +08:00
|
|
|
#include <asm-generic/bitops/non-atomic.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Since we define it "external", it collides with the built-in
|
|
|
|
* definition, which doesn't have the same semantics. We don't want to
|
|
|
|
* use -fno-builtin, so just hide the name ffs.
|
|
|
|
*/
|
|
|
|
#define ffs kernel_ffs
|
|
|
|
|
[PATCH] bitops: cris: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls()
- remove generic_fls64()
- remove generic_hweight{32,16,8}()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
- remove sched_find_first_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Acked-by: Mikael Starvik <starvik@axis.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 17:39:21 +08:00
|
|
|
#include <asm-generic/bitops/fls.h>
|
2009-01-03 13:07:14 +08:00
|
|
|
#include <asm-generic/bitops/__fls.h>
|
[PATCH] bitops: cris: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls()
- remove generic_fls64()
- remove generic_hweight{32,16,8}()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
- remove sched_find_first_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Acked-by: Mikael Starvik <starvik@axis.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 17:39:21 +08:00
|
|
|
#include <asm-generic/bitops/fls64.h>
|
|
|
|
#include <asm-generic/bitops/hweight.h>
|
|
|
|
#include <asm-generic/bitops/find.h>
|
2007-10-18 18:06:39 +08:00
|
|
|
#include <asm-generic/bitops/lock.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
bitops: introduce little-endian bitops for most architectures
Introduce little-endian bit operations to the big-endian architectures
which do not have native little-endian bit operations and the
little-endian architectures. (alpha, avr32, blackfin, cris, frv, h8300,
ia64, m32r, mips, mn10300, parisc, sh, sparc, tile, x86, xtensa)
These architectures can just include generic implementation
(asm-generic/bitops/le.h).
Signed-off-by: Akinobu Mita <akinobu.mita@gmail.com>
Cc: Richard Henderson <rth@twiddle.net>
Cc: Ivan Kokshaysky <ink@jurassic.park.msu.ru>
Cc: Mikael Starvik <starvik@axis.com>
Cc: David Howells <dhowells@redhat.com>
Cc: Yoshinori Sato <ysato@users.sourceforge.jp>
Cc: "Luck, Tony" <tony.luck@intel.com>
Cc: Ralf Baechle <ralf@linux-mips.org>
Cc: Kyle McMartin <kyle@mcmartin.ca>
Cc: Matthew Wilcox <willy@debian.org>
Cc: Grant Grundler <grundler@parisc-linux.org>
Cc: Paul Mundt <lethal@linux-sh.org>
Cc: Kazumoto Kojima <kkojima@rr.iij4u.or.jp>
Cc: Hirokazu Takata <takata@linux-m32r.org>
Cc: "David S. Miller" <davem@davemloft.net>
Cc: Chris Zankel <chris@zankel.net>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Thomas Gleixner <tglx@linutronix.de>
Acked-by: Hans-Christian Egtvedt <hans-christian.egtvedt@atmel.com>
Acked-by: "H. Peter Anvin" <hpa@zytor.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-24 07:42:02 +08:00
|
|
|
#include <asm-generic/bitops/le.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-07-27 07:09:04 +08:00
|
|
|
#include <asm-generic/bitops/ext2-atomic-setbit.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
[PATCH] bitops: cris: use generic bitops
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls()
- remove generic_fls64()
- remove generic_hweight{32,16,8}()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
- remove sched_find_first_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Acked-by: Mikael Starvik <starvik@axis.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 17:39:21 +08:00
|
|
|
#include <asm-generic/bitops/sched.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
#endif /* _CRIS_BITOPS_H */
|