2005-04-16 16:20:36 -06:00
|
|
|
/* bitops.h: bit operations for the Fujitsu FR-V CPUs
|
|
|
|
*
|
|
|
|
* For an explanation of how atomic ops work in this arch, see:
|
|
|
|
* Documentation/fujitsu/frv/atomic-ops.txt
|
|
|
|
*
|
|
|
|
* Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
|
|
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
#ifndef _ASM_BITOPS_H
|
|
|
|
#define _ASM_BITOPS_H
|
|
|
|
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include <asm/byteorder.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/atomic.h>
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
2007-10-19 00:40:26 -06:00
|
|
|
#ifndef _LINUX_BITOPS_H
|
|
|
|
#error only <linux/bitops.h> can be included directly
|
|
|
|
#endif
|
|
|
|
|
[PATCH] bitops: frv: use generic bitops
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove generic_ffs()
- remove __ffs()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:22 -07:00
|
|
|
#include <asm-generic/bitops/ffz.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* clear_bit() doesn't provide any barrier for the compiler.
|
|
|
|
*/
|
|
|
|
#define smp_mb__before_clear_bit() barrier()
|
|
|
|
#define smp_mb__after_clear_bit() barrier()
|
|
|
|
|
|
|
|
static inline int test_and_clear_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *ptr = addr;
|
|
|
|
unsigned long mask = 1UL << (nr & 31);
|
|
|
|
ptr += nr >> 5;
|
|
|
|
return (atomic_test_and_ANDNOT_mask(mask, ptr) & mask) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int test_and_set_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *ptr = addr;
|
|
|
|
unsigned long mask = 1UL << (nr & 31);
|
|
|
|
ptr += nr >> 5;
|
|
|
|
return (atomic_test_and_OR_mask(mask, ptr) & mask) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int test_and_change_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *ptr = addr;
|
|
|
|
unsigned long mask = 1UL << (nr & 31);
|
|
|
|
ptr += nr >> 5;
|
|
|
|
return (atomic_test_and_XOR_mask(mask, ptr) & mask) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void clear_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
test_and_clear_bit(nr, addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void set_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
test_and_set_bit(nr, addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void change_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
test_and_change_bit(nr, addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void __clear_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
*a &= ~mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void __set_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
*a |= mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void __change_bit(int nr, volatile void *addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
*a ^= mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int __test_and_clear_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask, retval;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
retval = (mask & *a) != 0;
|
|
|
|
*a &= ~mask;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int __test_and_set_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask, retval;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
retval = (mask & *a) != 0;
|
|
|
|
*a |= mask;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int __test_and_change_bit(int nr, volatile void * addr)
|
|
|
|
{
|
|
|
|
volatile unsigned long *a = addr;
|
|
|
|
int mask, retval;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 31);
|
|
|
|
retval = (mask & *a) != 0;
|
|
|
|
*a ^= mask;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine doesn't need to be atomic.
|
|
|
|
*/
|
|
|
|
static inline int __constant_test_bit(int nr, const volatile void * addr)
|
|
|
|
{
|
|
|
|
return ((1UL << (nr & 31)) & (((const volatile unsigned int *) addr)[nr >> 5])) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int __test_bit(int nr, const volatile void * addr)
|
|
|
|
{
|
|
|
|
int * a = (int *) addr;
|
|
|
|
int mask;
|
|
|
|
|
|
|
|
a += nr >> 5;
|
|
|
|
mask = 1 << (nr & 0x1f);
|
|
|
|
return ((mask & *a) != 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define test_bit(nr,addr) \
|
|
|
|
(__builtin_constant_p(nr) ? \
|
|
|
|
__constant_test_bit((nr),(addr)) : \
|
|
|
|
__test_bit((nr),(addr)))
|
|
|
|
|
[PATCH] bitops: frv: use generic bitops
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove generic_ffs()
- remove __ffs()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:22 -07:00
|
|
|
#include <asm-generic/bitops/find.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-09-26 00:32:07 -06:00
|
|
|
/**
|
|
|
|
* fls - find last bit set
|
|
|
|
* @x: the word to search
|
|
|
|
*
|
|
|
|
* This is defined the same way as ffs:
|
|
|
|
* - return 32..1 to indicate bit 31..0 most significant bit set
|
|
|
|
* - return 0 to indicate no bits set
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
#define fls(x) \
|
|
|
|
({ \
|
|
|
|
int bit; \
|
|
|
|
\
|
2006-09-26 00:32:07 -06:00
|
|
|
asm(" subcc %1,gr0,gr0,icc0 \n" \
|
|
|
|
" ckne icc0,cc4 \n" \
|
|
|
|
" cscan.p %1,gr0,%0 ,cc4,#1 \n" \
|
|
|
|
" csub %0,%0,%0 ,cc4,#0 \n" \
|
|
|
|
" csub %2,%0,%0 ,cc4,#1 \n" \
|
|
|
|
: "=&r"(bit) \
|
|
|
|
: "r"(x), "r"(32) \
|
|
|
|
: "icc0", "cc4" \
|
|
|
|
); \
|
2005-04-16 16:20:36 -06:00
|
|
|
\
|
2006-09-26 00:32:07 -06:00
|
|
|
bit; \
|
2005-04-16 16:20:36 -06:00
|
|
|
})
|
|
|
|
|
2006-09-26 00:32:08 -06:00
|
|
|
/**
|
|
|
|
* fls64 - find last bit set in a 64-bit value
|
|
|
|
* @n: the value to search
|
|
|
|
*
|
|
|
|
* This is defined the same way as ffs:
|
|
|
|
* - return 64..1 to indicate bit 63..0 most significant bit set
|
|
|
|
* - return 0 to indicate no bits set
|
|
|
|
*/
|
|
|
|
static inline __attribute__((const))
|
|
|
|
int fls64(u64 n)
|
|
|
|
{
|
|
|
|
union {
|
|
|
|
u64 ll;
|
|
|
|
struct { u32 h, l; };
|
|
|
|
} _;
|
|
|
|
int bit, x, y;
|
|
|
|
|
|
|
|
_.ll = n;
|
|
|
|
|
|
|
|
asm(" subcc.p %3,gr0,gr0,icc0 \n"
|
|
|
|
" subcc %4,gr0,gr0,icc1 \n"
|
|
|
|
" ckne icc0,cc4 \n"
|
|
|
|
" ckne icc1,cc5 \n"
|
|
|
|
" norcr cc4,cc5,cc6 \n"
|
|
|
|
" csub.p %0,%0,%0 ,cc6,1 \n"
|
|
|
|
" orcr cc5,cc4,cc4 \n"
|
|
|
|
" andcr cc4,cc5,cc4 \n"
|
|
|
|
" cscan.p %3,gr0,%0 ,cc4,0 \n"
|
|
|
|
" setlos #64,%1 \n"
|
|
|
|
" cscan.p %4,gr0,%0 ,cc4,1 \n"
|
|
|
|
" setlos #32,%2 \n"
|
|
|
|
" csub.p %1,%0,%0 ,cc4,0 \n"
|
|
|
|
" csub %2,%0,%0 ,cc4,1 \n"
|
|
|
|
: "=&r"(bit), "=r"(x), "=r"(y)
|
|
|
|
: "0r"(_.h), "r"(_.l)
|
|
|
|
: "icc0", "icc1", "cc4", "cc5", "cc6"
|
|
|
|
);
|
|
|
|
return bit;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2006-09-26 00:32:09 -06:00
|
|
|
/**
|
|
|
|
* ffs - find first bit set
|
|
|
|
* @x: the word to search
|
|
|
|
*
|
|
|
|
* - return 32..1 to indicate bit 31..0 most least significant bit set
|
|
|
|
* - return 0 to indicate no bits set
|
|
|
|
*/
|
|
|
|
static inline __attribute__((const))
|
|
|
|
int ffs(int x)
|
|
|
|
{
|
|
|
|
/* Note: (x & -x) gives us a mask that is the least significant
|
|
|
|
* (rightmost) 1-bit of the value in x.
|
|
|
|
*/
|
|
|
|
return fls(x & -x);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __ffs - find first bit set
|
|
|
|
* @x: the word to search
|
|
|
|
*
|
|
|
|
* - return 31..0 to indicate bit 31..0 most least significant bit set
|
|
|
|
* - if no bits are set in x, the result is undefined
|
|
|
|
*/
|
|
|
|
static inline __attribute__((const))
|
|
|
|
int __ffs(unsigned long x)
|
|
|
|
{
|
|
|
|
int bit;
|
|
|
|
asm("scan %1,gr0,%0" : "=r"(bit) : "r"(x & -x));
|
|
|
|
return 31 - bit;
|
|
|
|
}
|
|
|
|
|
2006-12-08 03:37:49 -07:00
|
|
|
/*
|
|
|
|
* special slimline version of fls() for calculating ilog2_u32()
|
|
|
|
* - note: no protection against n == 0
|
|
|
|
*/
|
|
|
|
#define ARCH_HAS_ILOG2_U32
|
|
|
|
static inline __attribute__((const))
|
|
|
|
int __ilog2_u32(u32 n)
|
|
|
|
{
|
|
|
|
int bit;
|
|
|
|
asm("scan %1,gr0,%0" : "=r"(bit) : "r"(n));
|
|
|
|
return 31 - bit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* special slimline version of fls64() for calculating ilog2_u64()
|
|
|
|
* - note: no protection against n == 0
|
|
|
|
*/
|
|
|
|
#define ARCH_HAS_ILOG2_U64
|
|
|
|
static inline __attribute__((const))
|
|
|
|
int __ilog2_u64(u64 n)
|
|
|
|
{
|
|
|
|
union {
|
|
|
|
u64 ll;
|
|
|
|
struct { u32 h, l; };
|
|
|
|
} _;
|
|
|
|
int bit, x, y;
|
|
|
|
|
|
|
|
_.ll = n;
|
|
|
|
|
|
|
|
asm(" subcc %3,gr0,gr0,icc0 \n"
|
|
|
|
" ckeq icc0,cc4 \n"
|
|
|
|
" cscan.p %3,gr0,%0 ,cc4,0 \n"
|
|
|
|
" setlos #63,%1 \n"
|
|
|
|
" cscan.p %4,gr0,%0 ,cc4,1 \n"
|
|
|
|
" setlos #31,%2 \n"
|
|
|
|
" csub.p %1,%0,%0 ,cc4,0 \n"
|
|
|
|
" csub %2,%0,%0 ,cc4,1 \n"
|
|
|
|
: "=&r"(bit), "=r"(x), "=r"(y)
|
|
|
|
: "0r"(_.h), "r"(_.l)
|
|
|
|
: "icc0", "cc4"
|
|
|
|
);
|
|
|
|
return bit;
|
|
|
|
}
|
|
|
|
|
[PATCH] bitops: frv: use generic bitops
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove generic_ffs()
- remove __ffs()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:22 -07:00
|
|
|
#include <asm-generic/bitops/sched.h>
|
|
|
|
#include <asm-generic/bitops/hweight.h>
|
2007-10-18 04:06:39 -06:00
|
|
|
#include <asm-generic/bitops/lock.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
[PATCH] bitops: frv: use generic bitops
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove generic_ffs()
- remove __ffs()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:22 -07:00
|
|
|
#include <asm-generic/bitops/ext2-non-atomic.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
[PATCH] bitops: use non atomic operations for minix_*_bit() and ext2_*_bit()
Bitmap functions for the minix filesystem and the ext2 filesystem except
ext2_set_bit_atomic() and ext2_clear_bit_atomic() do not require the atomic
guarantees.
But these are defined by using atomic bit operations on several architectures.
(cris, frv, h8300, ia64, m32r, m68k, m68knommu, mips, s390, sh, sh64, sparc,
sparc64, v850, and xtensa)
This patch switches to non atomic bit operation.
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:05 -07:00
|
|
|
#define ext2_set_bit_atomic(lock,nr,addr) test_and_set_bit ((nr) ^ 0x18, (addr))
|
|
|
|
#define ext2_clear_bit_atomic(lock,nr,addr) test_and_clear_bit((nr) ^ 0x18, (addr))
|
2005-04-16 16:20:36 -06:00
|
|
|
|
[PATCH] bitops: frv: use generic bitops
- remove ffz()
- remove find_{next,first}{,_zero}_bit()
- remove generic_ffs()
- remove __ffs()
- remove generic_fls64()
- remove sched_find_first_bit()
- remove generic_hweight{32,16,8}()
- remove ext2_{set,clear,test,find_first_zero,find_next_zero}_bit()
- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Cc: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-26 02:39:22 -07:00
|
|
|
#include <asm-generic/bitops/minix-le.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
#endif /* _ASM_BITOPS_H */
|