mirror of https://github.com/Qortal/Brooklyn
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
128 lines
2.8 KiB
128 lines
2.8 KiB
/* SPDX-License-Identifier: GPL-2.0 */ |
|
#ifndef _ASM_GENERIC_BITOPS_LE_H_ |
|
#define _ASM_GENERIC_BITOPS_LE_H_ |
|
|
|
#include <asm-generic/bitops/find.h> |
|
#include <asm/types.h> |
|
#include <asm/byteorder.h> |
|
#include <linux/swab.h> |
|
|
|
#if defined(__LITTLE_ENDIAN) |
|
|
|
#define BITOP_LE_SWIZZLE 0 |
|
|
|
static inline unsigned long find_next_zero_bit_le(const void *addr, |
|
unsigned long size, unsigned long offset) |
|
{ |
|
return find_next_zero_bit(addr, size, offset); |
|
} |
|
|
|
static inline unsigned long find_next_bit_le(const void *addr, |
|
unsigned long size, unsigned long offset) |
|
{ |
|
return find_next_bit(addr, size, offset); |
|
} |
|
|
|
static inline unsigned long find_first_zero_bit_le(const void *addr, |
|
unsigned long size) |
|
{ |
|
return find_first_zero_bit(addr, size); |
|
} |
|
|
|
#elif defined(__BIG_ENDIAN) |
|
|
|
#define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7) |
|
|
|
#ifndef find_next_zero_bit_le |
|
static inline |
|
unsigned long find_next_zero_bit_le(const void *addr, unsigned |
|
long size, unsigned long offset) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val = *(const unsigned long *)addr; |
|
|
|
if (unlikely(offset >= size)) |
|
return size; |
|
|
|
val = swab(val) | ~GENMASK(size - 1, offset); |
|
return val == ~0UL ? size : ffz(val); |
|
} |
|
|
|
return _find_next_bit(addr, NULL, size, offset, ~0UL, 1); |
|
} |
|
#endif |
|
|
|
#ifndef find_next_bit_le |
|
static inline |
|
unsigned long find_next_bit_le(const void *addr, unsigned |
|
long size, unsigned long offset) |
|
{ |
|
if (small_const_nbits(size)) { |
|
unsigned long val = *(const unsigned long *)addr; |
|
|
|
if (unlikely(offset >= size)) |
|
return size; |
|
|
|
val = swab(val) & GENMASK(size - 1, offset); |
|
return val ? __ffs(val) : size; |
|
} |
|
|
|
return _find_next_bit(addr, NULL, size, offset, 0UL, 1); |
|
} |
|
#endif |
|
|
|
#ifndef find_first_zero_bit_le |
|
#define find_first_zero_bit_le(addr, size) \ |
|
find_next_zero_bit_le((addr), (size), 0) |
|
#endif |
|
|
|
#else |
|
#error "Please fix <asm/byteorder.h>" |
|
#endif |
|
|
|
static inline int test_bit_le(int nr, const void *addr) |
|
{ |
|
return test_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline void set_bit_le(int nr, void *addr) |
|
{ |
|
set_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline void clear_bit_le(int nr, void *addr) |
|
{ |
|
clear_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline void __set_bit_le(int nr, void *addr) |
|
{ |
|
__set_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline void __clear_bit_le(int nr, void *addr) |
|
{ |
|
__clear_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline int test_and_set_bit_le(int nr, void *addr) |
|
{ |
|
return test_and_set_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline int test_and_clear_bit_le(int nr, void *addr) |
|
{ |
|
return test_and_clear_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline int __test_and_set_bit_le(int nr, void *addr) |
|
{ |
|
return __test_and_set_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
static inline int __test_and_clear_bit_le(int nr, void *addr) |
|
{ |
|
return __test_and_clear_bit(nr ^ BITOP_LE_SWIZZLE, addr); |
|
} |
|
|
|
#endif /* _ASM_GENERIC_BITOPS_LE_H_ */
|
|
|