1
/* MN10300 bit operations
3
* Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
4
* Written by David Howells (dhowells@redhat.com)
6
* This program is free software; you can redistribute it and/or
7
* modify it under the terms of the GNU General Public Licence
8
* as published by the Free Software Foundation; either version
9
* 2 of the Licence, or (at your option) any later version.
11
* These have to be done with inline assembly: that way the bit-setting
12
* is guaranteed to be atomic. All bit operations return 0 if the bit
13
* was cleared before the operation and != 0 if it was not.
15
* bit 0 is the LSB of addr; bit 32 is the LSB of (addr+1).
17
#ifndef __ASM_BITOPS_H
18
#define __ASM_BITOPS_H
20
#include <asm/cpu-regs.h>
22
#define smp_mb__before_clear_bit() barrier()
23
#define smp_mb__after_clear_bit() barrier()
28
#define __set_bit(nr, addr) \
30
volatile unsigned char *_a = (unsigned char *)(addr); \
31
const unsigned shift = (nr) & 7; \
34
asm volatile("bset %2,(%1) # set_bit reg" \
36
: "a"(_a), "d"(1 << shift), "m"(*_a) \
40
#define set_bit(nr, addr) __set_bit((nr), (addr))
45
#define ___clear_bit(nr, addr) \
47
volatile unsigned char *_a = (unsigned char *)(addr); \
48
const unsigned shift = (nr) & 7; \
51
asm volatile("bclr %2,(%1) # clear_bit reg" \
53
: "a"(_a), "d"(1 << shift), "m"(*_a) \
57
#define clear_bit(nr, addr) ___clear_bit((nr), (addr))
60
static inline void __clear_bit(unsigned long nr, volatile void *addr)
62
unsigned int *a = (unsigned int *) addr;
66
mask = 1 << (nr & 0x1f);
73
static inline int test_bit(unsigned long nr, const volatile void *addr)
75
return 1UL & (((const volatile unsigned int *) addr)[nr >> 5] >> (nr & 31));
81
static inline void __change_bit(unsigned long nr, volatile void *addr)
84
unsigned int *a = (unsigned int *) addr;
87
mask = 1 << (nr & 0x1f);
91
extern void change_bit(unsigned long nr, volatile void *addr);
96
#define __test_and_set_bit(nr,addr) \
98
volatile unsigned char *_a = (unsigned char *)(addr); \
99
const unsigned shift = (nr) & 7; \
103
asm volatile("bset %3,(%2) # test_set_bit reg\n" \
105
: "=m"(*_a), "=d"(epsw) \
106
: "a"(_a), "d"(1 << shift), "m"(*_a) \
109
!(epsw & EPSW_FLAG_Z); \
112
#define test_and_set_bit(nr, addr) __test_and_set_bit((nr), (addr))
117
#define __test_and_clear_bit(nr, addr) \
119
volatile unsigned char *_a = (unsigned char *)(addr); \
120
const unsigned shift = (nr) & 7; \
124
asm volatile("bclr %3,(%2) # test_clear_bit reg\n" \
126
: "=m"(*_a), "=d"(epsw) \
127
: "a"(_a), "d"(1 << shift), "m"(*_a) \
130
!(epsw & EPSW_FLAG_Z); \
133
#define test_and_clear_bit(nr, addr) __test_and_clear_bit((nr), (addr))
136
* test and change bit
138
static inline int __test_and_change_bit(unsigned long nr, volatile void *addr)
141
unsigned int *a = (unsigned int *)addr;
144
mask = 1 << (nr & 0x1f);
145
retval = (mask & *a) != 0;
151
extern int test_and_change_bit(unsigned long nr, volatile void *addr);
153
#include <asm-generic/bitops/lock.h>
158
* __ffs - find first bit set
159
* @x: the word to search
161
* - return 31..0 to indicate bit 31..0 most least significant bit set
162
* - if no bits are set in x, the result is undefined
164
static inline __attribute__((const))
165
unsigned long __ffs(unsigned long x)
168
asm("bsch %2,%0" : "=r"(bit) : "0"(0), "r"(x & -x) : "cc");
173
* special slimline version of fls() for calculating ilog2_u32()
174
* - note: no protection against n == 0
176
static inline __attribute__((const))
177
int __ilog2_u32(u32 n)
180
asm("bsch %2,%0" : "=r"(bit) : "0"(0), "r"(n) : "cc");
185
* fls - find last bit set
186
* @x: the word to search
188
* This is defined the same way as ffs:
189
* - return 32..1 to indicate bit 31..0 most significant bit set
190
* - return 0 to indicate no bits set
192
static inline __attribute__((const))
195
return (x != 0) ? __ilog2_u32(x) + 1 : 0;
199
* __fls - find last (most-significant) set bit in a long word
200
* @word: the word to search
202
* Undefined if no set bit exists, so code should check against 0 first.
204
static inline unsigned long __fls(unsigned long word)
206
return __ilog2_u32(word);
210
* ffs - find first bit set
211
* @x: the word to search
213
* - return 32..1 to indicate bit 31..0 most least significant bit set
214
* - return 0 to indicate no bits set
216
static inline __attribute__((const))
219
/* Note: (x & -x) gives us a mask that is the least significant
220
* (rightmost) 1-bit of the value in x.
225
#include <asm-generic/bitops/ffz.h>
226
#include <asm-generic/bitops/fls64.h>
227
#include <asm-generic/bitops/find.h>
228
#include <asm-generic/bitops/sched.h>
229
#include <asm-generic/bitops/hweight.h>
230
#include <asm-generic/bitops/ext2-atomic-setbit.h>
231
#include <asm-generic/bitops/le.h>
233
#endif /* __KERNEL__ */
234
#endif /* __ASM_BITOPS_H */