2005-06-24 12:01:26 +07:00
|
|
|
/*
|
|
|
|
* include/asm-xtensa/bitops.h
|
|
|
|
*
|
|
|
|
* Atomic operations that C can't guarantee us.Useful for resource counting etc.
|
|
|
|
*
|
|
|
|
* This file is subject to the terms and conditions of the GNU General Public
|
|
|
|
* License. See the file "COPYING" in the main directory of this archive
|
|
|
|
* for more details.
|
|
|
|
*
|
2007-06-01 07:41:14 +07:00
|
|
|
* Copyright (C) 2001 - 2007 Tensilica Inc.
|
2005-06-24 12:01:26 +07:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _XTENSA_BITOPS_H
|
|
|
|
#define _XTENSA_BITOPS_H
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
2007-10-19 13:40:26 +07:00
|
|
|
#ifndef _LINUX_BITOPS_H
|
|
|
|
#error only <linux/bitops.h> can be included directly
|
|
|
|
#endif
|
|
|
|
|
2005-06-24 12:01:26 +07:00
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/byteorder.h>
|
2014-03-14 01:00:35 +07:00
|
|
|
#include <asm/barrier.h>
|
2005-06-24 12:01:26 +07:00
|
|
|
|
[PATCH] bitops: xtensa: use generic bitops
- remove {,test_and_}{set,clear,change}_bit()
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls64()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove generic_hweight{32,16,8}()
- remove sched_find_first_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Chris Zankel <chris@zankel.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 16:39:43 +07:00
|
|
|
#include <asm-generic/bitops/non-atomic.h>
|
2005-06-24 12:01:26 +07:00
|
|
|
|
2005-09-23 11:44:23 +07:00
|
|
|
#if XCHAL_HAVE_NSA
|
2005-06-24 12:01:26 +07:00
|
|
|
|
2007-06-01 07:41:14 +07:00
|
|
|
static inline unsigned long __cntlz (unsigned long x)
|
2005-06-24 12:01:26 +07:00
|
|
|
{
|
|
|
|
int lz;
|
|
|
|
asm ("nsau %0, %1" : "=r" (lz) : "r" (x));
|
2007-06-01 07:41:14 +07:00
|
|
|
return lz;
|
2005-06-24 12:01:26 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ffz: Find first zero in word. Undefined if no zero exists.
|
|
|
|
* bit 0 is the LSB of addr; bit 32 is the LSB of (addr+1).
|
|
|
|
*/
|
|
|
|
|
2007-06-01 07:41:14 +07:00
|
|
|
static inline int ffz(unsigned long x)
|
2005-06-24 12:01:26 +07:00
|
|
|
{
|
2007-06-01 07:41:14 +07:00
|
|
|
return 31 - __cntlz(~x & -~x);
|
2005-06-24 12:01:26 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __ffs: Find first bit set in word. Return 0 for bit 0
|
|
|
|
*/
|
|
|
|
|
2007-06-01 07:41:14 +07:00
|
|
|
static inline int __ffs(unsigned long x)
|
2005-06-24 12:01:26 +07:00
|
|
|
{
|
2007-06-01 07:41:14 +07:00
|
|
|
return 31 - __cntlz(x & -x);
|
2005-06-24 12:01:26 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ffs: Find first bit set in word. This is defined the same way as
|
|
|
|
* the libc and compiler builtin ffs routines, therefore
|
|
|
|
* differs in spirit from the above ffz (man ffs).
|
|
|
|
*/
|
|
|
|
|
2007-06-01 07:41:14 +07:00
|
|
|
static inline int ffs(unsigned long x)
|
2005-06-24 12:01:26 +07:00
|
|
|
{
|
2007-06-01 07:41:14 +07:00
|
|
|
return 32 - __cntlz(x & -x);
|
2005-06-24 12:01:26 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* fls: Find last (most-significant) bit set in word.
|
|
|
|
* Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
|
|
|
|
*/
|
|
|
|
|
2007-06-01 07:41:14 +07:00
|
|
|
static inline int fls (unsigned int x)
|
2005-06-24 12:01:26 +07:00
|
|
|
{
|
2007-06-01 07:41:14 +07:00
|
|
|
return 32 - __cntlz(x);
|
2005-06-24 12:01:26 +07:00
|
|
|
}
|
2007-06-01 07:41:14 +07:00
|
|
|
|
2009-01-03 12:51:08 +07:00
|
|
|
/**
|
|
|
|
* __fls - find last (most-significant) set bit in a long word
|
|
|
|
* @word: the word to search
|
|
|
|
*
|
|
|
|
* Undefined if no set bit exists, so code should check against 0 first.
|
|
|
|
*/
|
|
|
|
static inline unsigned long __fls(unsigned long word)
|
|
|
|
{
|
|
|
|
return 31 - __cntlz(word);
|
|
|
|
}
|
2007-06-01 07:41:14 +07:00
|
|
|
#else
|
|
|
|
|
|
|
|
/* Use the generic implementation if we don't have the nsa/nsau instructions. */
|
|
|
|
|
|
|
|
# include <asm-generic/bitops/ffs.h>
|
|
|
|
# include <asm-generic/bitops/__ffs.h>
|
|
|
|
# include <asm-generic/bitops/ffz.h>
|
|
|
|
# include <asm-generic/bitops/fls.h>
|
2009-01-03 12:51:08 +07:00
|
|
|
# include <asm-generic/bitops/__fls.h>
|
2007-06-01 07:41:14 +07:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|
[PATCH] bitops: xtensa: use generic bitops
- remove {,test_and_}{set,clear,change}_bit()
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls64()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove generic_hweight{32,16,8}()
- remove sched_find_first_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Chris Zankel <chris@zankel.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 16:39:43 +07:00
|
|
|
#include <asm-generic/bitops/fls64.h>
|
2012-11-11 08:47:25 +07:00
|
|
|
|
|
|
|
#if XCHAL_HAVE_S32C1I
|
|
|
|
|
|
|
|
static inline void set_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" or %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void clear_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" and %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (~mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void change_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" xor %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
test_and_set_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" or %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
|
|
|
|
return tmp & mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
test_and_clear_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" and %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (~mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
|
|
|
|
return tmp & mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
test_and_change_bit(unsigned int bit, volatile unsigned long *p)
|
|
|
|
{
|
|
|
|
unsigned long tmp, value;
|
|
|
|
unsigned long mask = 1UL << (bit & 31);
|
|
|
|
|
|
|
|
p += bit >> 5;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: l32i %1, %3, 0\n"
|
|
|
|
" wsr %1, scompare1\n"
|
|
|
|
" xor %0, %1, %2\n"
|
|
|
|
" s32c1i %0, %3, 0\n"
|
|
|
|
" bne %0, %1, 1b\n"
|
|
|
|
: "=&a" (tmp), "=&a" (value)
|
|
|
|
: "a" (mask), "a" (p)
|
|
|
|
: "memory");
|
|
|
|
|
|
|
|
return tmp & mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
#include <asm-generic/bitops/atomic.h>
|
|
|
|
|
|
|
|
#endif /* XCHAL_HAVE_S32C1I */
|
|
|
|
|
[PATCH] bitops: xtensa: use generic bitops
- remove {,test_and_}{set,clear,change}_bit()
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls64()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove generic_hweight{32,16,8}()
- remove sched_find_first_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Chris Zankel <chris@zankel.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 16:39:43 +07:00
|
|
|
#include <asm-generic/bitops/find.h>
|
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 06:42:02 +07:00
|
|
|
#include <asm-generic/bitops/le.h>
|
2005-06-24 12:01:26 +07:00
|
|
|
|
2011-07-27 06:09:04 +07:00
|
|
|
#include <asm-generic/bitops/ext2-atomic-setbit.h>
|
2005-06-24 12:01:26 +07:00
|
|
|
|
[PATCH] bitops: xtensa: use generic bitops
- remove {,test_and_}{set,clear,change}_bit()
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls64()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove generic_hweight{32,16,8}()
- remove sched_find_first_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Chris Zankel <chris@zankel.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 16:39:43 +07:00
|
|
|
#include <asm-generic/bitops/hweight.h>
|
2007-10-18 17:06:39 +07:00
|
|
|
#include <asm-generic/bitops/lock.h>
|
[PATCH] bitops: xtensa: use generic bitops
- remove {,test_and_}{set,clear,change}_bit()
- remove __{,test_and_}{set,clear,change}_bit() and test_bit()
- remove generic_fls64()
- remove find_{next,first}{,_zero}_bit()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove generic_hweight{32,16,8}()
- remove sched_find_first_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: Chris Zankel <chris@zankel.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 16:39:43 +07:00
|
|
|
#include <asm-generic/bitops/sched.h>
|
2005-06-24 12:01:26 +07:00
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
#endif /* _XTENSA_BITOPS_H */
|