radix tree test suite: Remove duplicate bitops code
By adding __set_bit and __clear_bit to the tools include directory, we can share the bitops code. This reveals an include loop between kernel.h, log2.h, bitmap.h and bitops.h. Break it the same way as the kernel does; by moving the kernel.h include from bitops.h to bitmap.h. Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com>
This commit is contained in:
Matthew Wilcox
parent
35534c869c
commit
c68a2aab33
|
|
@ -20,4 +20,7 @@ static __always_inline int test_bit(unsigned int nr, const unsigned long *addr)
|
||||||
(((unsigned long *)addr)[nr / __BITS_PER_LONG])) != 0;
|
(((unsigned long *)addr)[nr / __BITS_PER_LONG])) != 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#define __set_bit(nr, addr) set_bit(nr, addr)
|
||||||
|
#define __clear_bit(nr, addr) clear_bit(nr, addr)
|
||||||
|
|
||||||
#endif /* _TOOLS_LINUX_ASM_GENERIC_BITOPS_ATOMIC_H_ */
|
#endif /* _TOOLS_LINUX_ASM_GENERIC_BITOPS_ATOMIC_H_ */
|
||||||
|
|
|
||||||
|
|
@ -4,6 +4,7 @@
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <linux/bitops.h>
|
#include <linux/bitops.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
#include <linux/kernel.h>
|
||||||
|
|
||||||
#define DECLARE_BITMAP(name,bits) \
|
#define DECLARE_BITMAP(name,bits) \
|
||||||
unsigned long name[BITS_TO_LONGS(bits)]
|
unsigned long name[BITS_TO_LONGS(bits)]
|
||||||
|
|
|
||||||
|
|
@ -2,7 +2,6 @@
|
||||||
#define _TOOLS_LINUX_BITOPS_H_
|
#define _TOOLS_LINUX_BITOPS_H_
|
||||||
|
|
||||||
#include <asm/types.h>
|
#include <asm/types.h>
|
||||||
#include <linux/kernel.h>
|
|
||||||
#include <linux/compiler.h>
|
#include <linux/compiler.h>
|
||||||
|
|
||||||
#ifndef __WORDSIZE
|
#ifndef __WORDSIZE
|
||||||
|
|
|
||||||
|
|
@ -1,160 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_NON_ATOMIC_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_NON_ATOMIC_H_
|
|
||||||
|
|
||||||
#include <linux/types.h>
|
|
||||||
#include <linux/bitops/find.h>
|
|
||||||
#include <linux/bitops/hweight.h>
|
|
||||||
#include <linux/kernel.h>
|
|
||||||
|
|
||||||
#define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
|
|
||||||
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
|
|
||||||
#define BITS_PER_BYTE 8
|
|
||||||
#define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __set_bit - Set a bit in memory
|
|
||||||
* @nr: the bit to set
|
|
||||||
* @addr: the address to start counting from
|
|
||||||
*
|
|
||||||
* Unlike set_bit(), this function is non-atomic and may be reordered.
|
|
||||||
* If it's called on the same region of memory simultaneously, the effect
|
|
||||||
* may be that only one operation succeeds.
|
|
||||||
*/
|
|
||||||
static inline void __set_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
|
|
||||||
*p |= mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void __clear_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
|
|
||||||
*p &= ~mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __change_bit - Toggle a bit in memory
|
|
||||||
* @nr: the bit to change
|
|
||||||
* @addr: the address to start counting from
|
|
||||||
*
|
|
||||||
* Unlike change_bit(), this function is non-atomic and may be reordered.
|
|
||||||
* If it's called on the same region of memory simultaneously, the effect
|
|
||||||
* may be that only one operation succeeds.
|
|
||||||
*/
|
|
||||||
static inline void __change_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
|
|
||||||
*p ^= mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __test_and_set_bit - Set a bit and return its old value
|
|
||||||
* @nr: Bit to set
|
|
||||||
* @addr: Address to count from
|
|
||||||
*
|
|
||||||
* This operation is non-atomic and can be reordered.
|
|
||||||
* If two examples of this operation race, one can appear to succeed
|
|
||||||
* but actually fail. You must protect multiple accesses with a lock.
|
|
||||||
*/
|
|
||||||
static inline int __test_and_set_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old | mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __test_and_clear_bit - Clear a bit and return its old value
|
|
||||||
* @nr: Bit to clear
|
|
||||||
* @addr: Address to count from
|
|
||||||
*
|
|
||||||
* This operation is non-atomic and can be reordered.
|
|
||||||
* If two examples of this operation race, one can appear to succeed
|
|
||||||
* but actually fail. You must protect multiple accesses with a lock.
|
|
||||||
*/
|
|
||||||
static inline int __test_and_clear_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old & ~mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* WARNING: non atomic and it can be reordered! */
|
|
||||||
static inline int __test_and_change_bit(int nr,
|
|
||||||
volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BIT_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old ^ mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* test_bit - Determine whether a bit is set
|
|
||||||
* @nr: bit number to test
|
|
||||||
* @addr: Address to start counting from
|
|
||||||
*/
|
|
||||||
static inline int test_bit(int nr, const volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
return 1UL & (addr[BIT_WORD(nr)] >> (nr & (BITS_PER_LONG-1)));
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __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)
|
|
||||||
{
|
|
||||||
int num = 0;
|
|
||||||
|
|
||||||
if ((word & 0xffffffff) == 0) {
|
|
||||||
num += 32;
|
|
||||||
word >>= 32;
|
|
||||||
}
|
|
||||||
if ((word & 0xffff) == 0) {
|
|
||||||
num += 16;
|
|
||||||
word >>= 16;
|
|
||||||
}
|
|
||||||
if ((word & 0xff) == 0) {
|
|
||||||
num += 8;
|
|
||||||
word >>= 8;
|
|
||||||
}
|
|
||||||
if ((word & 0xf) == 0) {
|
|
||||||
num += 4;
|
|
||||||
word >>= 4;
|
|
||||||
}
|
|
||||||
if ((word & 0x3) == 0) {
|
|
||||||
num += 2;
|
|
||||||
word >>= 2;
|
|
||||||
}
|
|
||||||
if ((word & 0x1) == 0)
|
|
||||||
num += 1;
|
|
||||||
return num;
|
|
||||||
}
|
|
||||||
|
|
||||||
unsigned long find_next_bit(const unsigned long *addr,
|
|
||||||
unsigned long size,
|
|
||||||
unsigned long offset);
|
|
||||||
|
|
||||||
static inline unsigned long hweight_long(unsigned long w)
|
|
||||||
{
|
|
||||||
return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_NON_ATOMIC_H_ */
|
|
||||||
|
|
@ -1,43 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS___FFS_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS___FFS_H_
|
|
||||||
|
|
||||||
#include <asm/types.h>
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __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)
|
|
||||||
{
|
|
||||||
int num = 0;
|
|
||||||
|
|
||||||
#if BITS_PER_LONG == 64
|
|
||||||
if ((word & 0xffffffff) == 0) {
|
|
||||||
num += 32;
|
|
||||||
word >>= 32;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
if ((word & 0xffff) == 0) {
|
|
||||||
num += 16;
|
|
||||||
word >>= 16;
|
|
||||||
}
|
|
||||||
if ((word & 0xff) == 0) {
|
|
||||||
num += 8;
|
|
||||||
word >>= 8;
|
|
||||||
}
|
|
||||||
if ((word & 0xf) == 0) {
|
|
||||||
num += 4;
|
|
||||||
word >>= 4;
|
|
||||||
}
|
|
||||||
if ((word & 0x3) == 0) {
|
|
||||||
num += 2;
|
|
||||||
word >>= 2;
|
|
||||||
}
|
|
||||||
if ((word & 0x1) == 0)
|
|
||||||
num += 1;
|
|
||||||
return num;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS___FFS_H_ */
|
|
||||||
|
|
@ -1,41 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_FFS_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_FFS_H_
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ffs - find first bit set
|
|
||||||
* @x: the word to search
|
|
||||||
*
|
|
||||||
* This is defined the same way as
|
|
||||||
* the libc and compiler builtin ffs routines, therefore
|
|
||||||
* differs in spirit from the above ffz (man ffs).
|
|
||||||
*/
|
|
||||||
static inline int ffs(int x)
|
|
||||||
{
|
|
||||||
int r = 1;
|
|
||||||
|
|
||||||
if (!x)
|
|
||||||
return 0;
|
|
||||||
if (!(x & 0xffff)) {
|
|
||||||
x >>= 16;
|
|
||||||
r += 16;
|
|
||||||
}
|
|
||||||
if (!(x & 0xff)) {
|
|
||||||
x >>= 8;
|
|
||||||
r += 8;
|
|
||||||
}
|
|
||||||
if (!(x & 0xf)) {
|
|
||||||
x >>= 4;
|
|
||||||
r += 4;
|
|
||||||
}
|
|
||||||
if (!(x & 3)) {
|
|
||||||
x >>= 2;
|
|
||||||
r += 2;
|
|
||||||
}
|
|
||||||
if (!(x & 1)) {
|
|
||||||
x >>= 1;
|
|
||||||
r += 1;
|
|
||||||
}
|
|
||||||
return r;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_FFS_H_ */
|
|
||||||
|
|
@ -1,12 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_FFZ_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_FFZ_H_
|
|
||||||
|
|
||||||
/*
|
|
||||||
* ffz - find first zero in word.
|
|
||||||
* @word: The word to search
|
|
||||||
*
|
|
||||||
* Undefined if no zero exists, so code should check against ~0UL first.
|
|
||||||
*/
|
|
||||||
#define ffz(x) __ffs(~(x))
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_FFZ_H_ */
|
|
||||||
|
|
@ -1,13 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_FIND_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_FIND_H_
|
|
||||||
|
|
||||||
extern unsigned long find_next_bit(const unsigned long *addr, unsigned long
|
|
||||||
size, unsigned long offset);
|
|
||||||
|
|
||||||
extern unsigned long find_next_zero_bit(const unsigned long *addr, unsigned
|
|
||||||
long size, unsigned long offset);
|
|
||||||
|
|
||||||
#define find_first_bit(addr, size) find_next_bit((addr), (size), 0)
|
|
||||||
#define find_first_zero_bit(addr, size) find_next_zero_bit((addr), (size), 0)
|
|
||||||
|
|
||||||
#endif /*_ASM_GENERIC_BITOPS_FIND_H_ */
|
|
||||||
|
|
@ -1,41 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_FLS_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_FLS_H_
|
|
||||||
|
|
||||||
/**
|
|
||||||
* fls - find last (most-significant) bit set
|
|
||||||
* @x: the word to search
|
|
||||||
*
|
|
||||||
* This is defined the same way as ffs.
|
|
||||||
* Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
|
|
||||||
*/
|
|
||||||
|
|
||||||
static inline int fls(int x)
|
|
||||||
{
|
|
||||||
int r = 32;
|
|
||||||
|
|
||||||
if (!x)
|
|
||||||
return 0;
|
|
||||||
if (!(x & 0xffff0000u)) {
|
|
||||||
x <<= 16;
|
|
||||||
r -= 16;
|
|
||||||
}
|
|
||||||
if (!(x & 0xff000000u)) {
|
|
||||||
x <<= 8;
|
|
||||||
r -= 8;
|
|
||||||
}
|
|
||||||
if (!(x & 0xf0000000u)) {
|
|
||||||
x <<= 4;
|
|
||||||
r -= 4;
|
|
||||||
}
|
|
||||||
if (!(x & 0xc0000000u)) {
|
|
||||||
x <<= 2;
|
|
||||||
r -= 2;
|
|
||||||
}
|
|
||||||
if (!(x & 0x80000000u)) {
|
|
||||||
x <<= 1;
|
|
||||||
r -= 1;
|
|
||||||
}
|
|
||||||
return r;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_FLS_H_ */
|
|
||||||
|
|
@ -1,14 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_FLS64_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_FLS64_H_
|
|
||||||
|
|
||||||
#include <asm/types.h>
|
|
||||||
|
|
||||||
static inline int fls64(__u64 x)
|
|
||||||
{
|
|
||||||
__u32 h = x >> 32;
|
|
||||||
if (h)
|
|
||||||
return fls(h) + 32;
|
|
||||||
return fls(x);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_FLS64_H_ */
|
|
||||||
|
|
@ -1,11 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_HWEIGHT_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_HWEIGHT_H_
|
|
||||||
|
|
||||||
#include <asm/types.h>
|
|
||||||
|
|
||||||
extern unsigned int hweight32(unsigned int w);
|
|
||||||
extern unsigned int hweight16(unsigned int w);
|
|
||||||
extern unsigned int hweight8(unsigned int w);
|
|
||||||
extern unsigned long hweight64(__u64 w);
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_HWEIGHT_H_ */
|
|
||||||
|
|
@ -1,53 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_LE_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_LE_H_
|
|
||||||
|
|
||||||
#include <asm/types.h>
|
|
||||||
#include <asm/byteorder.h>
|
|
||||||
|
|
||||||
#define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
|
|
||||||
#define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7)
|
|
||||||
|
|
||||||
#if defined(__LITTLE_ENDIAN)
|
|
||||||
|
|
||||||
#define generic_test_le_bit(nr, addr) test_bit(nr, addr)
|
|
||||||
#define generic___set_le_bit(nr, addr) __set_bit(nr, addr)
|
|
||||||
#define generic___clear_le_bit(nr, addr) __clear_bit(nr, addr)
|
|
||||||
|
|
||||||
#define generic_test_and_set_le_bit(nr, addr) test_and_set_bit(nr, addr)
|
|
||||||
#define generic_test_and_clear_le_bit(nr, addr) test_and_clear_bit(nr, addr)
|
|
||||||
|
|
||||||
#define generic___test_and_set_le_bit(nr, addr) __test_and_set_bit(nr, addr)
|
|
||||||
#define generic___test_and_clear_le_bit(nr, addr) __test_and_clear_bit(nr, addr)
|
|
||||||
|
|
||||||
#define generic_find_next_zero_le_bit(addr, size, offset) find_next_zero_bit(addr, size, offset)
|
|
||||||
|
|
||||||
#elif defined(__BIG_ENDIAN)
|
|
||||||
|
|
||||||
#define generic_test_le_bit(nr, addr) \
|
|
||||||
test_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
#define generic___set_le_bit(nr, addr) \
|
|
||||||
__set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
#define generic___clear_le_bit(nr, addr) \
|
|
||||||
__clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
|
|
||||||
#define generic_test_and_set_le_bit(nr, addr) \
|
|
||||||
test_and_set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
#define generic_test_and_clear_le_bit(nr, addr) \
|
|
||||||
test_and_clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
|
|
||||||
#define generic___test_and_set_le_bit(nr, addr) \
|
|
||||||
__test_and_set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
#define generic___test_and_clear_le_bit(nr, addr) \
|
|
||||||
__test_and_clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
||||||
|
|
||||||
extern unsigned long generic_find_next_zero_le_bit(const unsigned long *addr,
|
|
||||||
unsigned long size, unsigned long offset);
|
|
||||||
|
|
||||||
#else
|
|
||||||
#error "Please fix <asm/byteorder.h>"
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#define generic_find_first_zero_le_bit(addr, size) \
|
|
||||||
generic_find_next_zero_le_bit((addr), (size), 0)
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_LE_H_ */
|
|
||||||
|
|
@ -1,110 +0,0 @@
|
||||||
#ifndef _ASM_GENERIC_BITOPS_NON_ATOMIC_H_
|
|
||||||
#define _ASM_GENERIC_BITOPS_NON_ATOMIC_H_
|
|
||||||
|
|
||||||
#include <asm/types.h>
|
|
||||||
|
|
||||||
#define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __set_bit - Set a bit in memory
|
|
||||||
* @nr: the bit to set
|
|
||||||
* @addr: the address to start counting from
|
|
||||||
*
|
|
||||||
* Unlike set_bit(), this function is non-atomic and may be reordered.
|
|
||||||
* If it's called on the same region of memory simultaneously, the effect
|
|
||||||
* may be that only one operation succeeds.
|
|
||||||
*/
|
|
||||||
static inline void __set_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
|
|
||||||
*p |= mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void __clear_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
|
|
||||||
*p &= ~mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __change_bit - Toggle a bit in memory
|
|
||||||
* @nr: the bit to change
|
|
||||||
* @addr: the address to start counting from
|
|
||||||
*
|
|
||||||
* Unlike change_bit(), this function is non-atomic and may be reordered.
|
|
||||||
* If it's called on the same region of memory simultaneously, the effect
|
|
||||||
* may be that only one operation succeeds.
|
|
||||||
*/
|
|
||||||
static inline void __change_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
|
|
||||||
*p ^= mask;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __test_and_set_bit - Set a bit and return its old value
|
|
||||||
* @nr: Bit to set
|
|
||||||
* @addr: Address to count from
|
|
||||||
*
|
|
||||||
* This operation is non-atomic and can be reordered.
|
|
||||||
* If two examples of this operation race, one can appear to succeed
|
|
||||||
* but actually fail. You must protect multiple accesses with a lock.
|
|
||||||
*/
|
|
||||||
static inline int __test_and_set_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old | mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* __test_and_clear_bit - Clear a bit and return its old value
|
|
||||||
* @nr: Bit to clear
|
|
||||||
* @addr: Address to count from
|
|
||||||
*
|
|
||||||
* This operation is non-atomic and can be reordered.
|
|
||||||
* If two examples of this operation race, one can appear to succeed
|
|
||||||
* but actually fail. You must protect multiple accesses with a lock.
|
|
||||||
*/
|
|
||||||
static inline int __test_and_clear_bit(int nr, volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old & ~mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* WARNING: non atomic and it can be reordered! */
|
|
||||||
static inline int __test_and_change_bit(int nr,
|
|
||||||
volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
unsigned long mask = BIT_MASK(nr);
|
|
||||||
unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
|
|
||||||
unsigned long old = *p;
|
|
||||||
|
|
||||||
*p = old ^ mask;
|
|
||||||
return (old & mask) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* test_bit - Determine whether a bit is set
|
|
||||||
* @nr: bit number to test
|
|
||||||
* @addr: Address to start counting from
|
|
||||||
*/
|
|
||||||
static inline int test_bit(int nr, const volatile unsigned long *addr)
|
|
||||||
{
|
|
||||||
return 1UL & (addr[BITOP_WORD(nr)] >> (nr & (BITS_PER_LONG-1)));
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif /* _ASM_GENERIC_BITOPS_NON_ATOMIC_H_ */
|
|
||||||
|
|
@ -7,8 +7,10 @@
|
||||||
#include <stddef.h>
|
#include <stddef.h>
|
||||||
#include <limits.h>
|
#include <limits.h>
|
||||||
|
|
||||||
#include "../../include/linux/compiler.h"
|
#include <linux/compiler.h>
|
||||||
#include "../../include/linux/err.h"
|
#include <linux/err.h>
|
||||||
|
#include <linux/bitops.h>
|
||||||
|
#include <linux/log2.h>
|
||||||
#include "../../../include/linux/kconfig.h"
|
#include "../../../include/linux/kconfig.h"
|
||||||
|
|
||||||
#ifdef BENCHMARK
|
#ifdef BENCHMARK
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue