5
* Copyright 1992, Linus Torvalds.
8
#include <xeno/config.h>
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).
19
#define LOCK_PREFIX "lock ; "
21
#define LOCK_PREFIX ""
24
#define ADDR (*(volatile long *) addr)
27
* set_bit - Atomically set a bit in memory
29
* @addr: the address to start counting from
31
* This function is atomic and may not be reordered. See __set_bit()
32
* if you do not require the atomic guarantees.
33
* Note that @nr may be almost arbitrarily large; this function is not
34
* restricted to acting on a single-word quantity.
36
static __inline__ void set_bit(int nr, volatile void * addr)
38
__asm__ __volatile__( LOCK_PREFIX
45
* __set_bit - Set a bit in memory
47
* @addr: the address to start counting from
49
* Unlike set_bit(), this function is non-atomic and may be reordered.
50
* If it's called on the same region of memory simultaneously, the effect
51
* may be that only one operation succeeds.
53
static __inline__ void __set_bit(int nr, volatile void * addr)
62
* clear_bit - Clears a bit in memory
64
* @addr: Address to start counting from
66
* clear_bit() is atomic and may not be reordered. However, it does
67
* not contain a memory barrier, so if it is used for locking purposes,
68
* you should call smp_mb__before_clear_bit() and/or smp_mb__after_clear_bit()
69
* in order to ensure changes are visible on other processors.
71
static __inline__ void clear_bit(int nr, volatile void * addr)
73
__asm__ __volatile__( LOCK_PREFIX
78
#define smp_mb__before_clear_bit() barrier()
79
#define smp_mb__after_clear_bit() barrier()
82
* __change_bit - Toggle a bit in memory
84
* @addr: the address to start counting from
86
* Unlike change_bit(), this function is non-atomic and may be reordered.
87
* If it's called on the same region of memory simultaneously, the effect
88
* may be that only one operation succeeds.
90
static __inline__ void __change_bit(int nr, volatile void * addr)
99
* change_bit - Toggle a bit in memory
101
* @addr: Address to start counting from
103
* change_bit() is atomic and may not be reordered.
104
* Note that @nr may be almost arbitrarily large; this function is not
105
* restricted to acting on a single-word quantity.
107
static __inline__ void change_bit(int nr, volatile void * addr)
109
__asm__ __volatile__( LOCK_PREFIX
116
* test_and_set_bit - Set a bit and return its old value
118
* @addr: Address to count from
120
* This operation is atomic and cannot be reordered.
121
* It also implies a memory barrier.
123
static __inline__ int test_and_set_bit(int nr, volatile void * addr)
127
__asm__ __volatile__( LOCK_PREFIX
128
"btsl %2,%1\n\tsbbl %0,%0"
129
:"=r" (oldbit),"=m" (ADDR)
130
:"Ir" (nr) : "memory");
135
* __test_and_set_bit - Set a bit and return its old value
137
* @addr: Address to count from
139
* This operation is non-atomic and can be reordered.
140
* If two examples of this operation race, one can appear to succeed
141
* but actually fail. You must protect multiple accesses with a lock.
143
static __inline__ int __test_and_set_bit(int nr, volatile void * addr)
148
"btsl %2,%1\n\tsbbl %0,%0"
149
:"=r" (oldbit),"=m" (ADDR)
155
* test_and_clear_bit - Clear a bit and return its old value
157
* @addr: Address to count from
159
* This operation is atomic and cannot be reordered.
160
* It also implies a memory barrier.
162
static __inline__ int test_and_clear_bit(int nr, volatile void * addr)
166
__asm__ __volatile__( LOCK_PREFIX
167
"btrl %2,%1\n\tsbbl %0,%0"
168
:"=r" (oldbit),"=m" (ADDR)
169
:"Ir" (nr) : "memory");
174
* __test_and_clear_bit - Clear a bit and return its old value
176
* @addr: Address to count from
178
* This operation is non-atomic and can be reordered.
179
* If two examples of this operation race, one can appear to succeed
180
* but actually fail. You must protect multiple accesses with a lock.
182
static __inline__ int __test_and_clear_bit(int nr, volatile void * addr)
187
"btrl %2,%1\n\tsbbl %0,%0"
188
:"=r" (oldbit),"=m" (ADDR)
193
/* WARNING: non atomic and it can be reordered! */
194
static __inline__ int __test_and_change_bit(int nr, volatile void * addr)
198
__asm__ __volatile__(
199
"btcl %2,%1\n\tsbbl %0,%0"
200
:"=r" (oldbit),"=m" (ADDR)
201
:"Ir" (nr) : "memory");
206
* test_and_change_bit - Change a bit and return its new value
208
* @addr: Address to count from
210
* This operation is atomic and cannot be reordered.
211
* It also implies a memory barrier.
213
static __inline__ int test_and_change_bit(int nr, volatile void * addr)
217
__asm__ __volatile__( LOCK_PREFIX
218
"btcl %2,%1\n\tsbbl %0,%0"
219
:"=r" (oldbit),"=m" (ADDR)
220
:"Ir" (nr) : "memory");
225
static __inline__ int constant_test_bit(int nr, const volatile void * addr)
227
return ((1UL << (nr & 31)) & (((const volatile unsigned int *) addr)[nr >> 5])) != 0;
230
static __inline__ int variable_test_bit(int nr, volatile void * addr)
234
__asm__ __volatile__(
235
"btl %2,%1\n\tsbbl %0,%0"
237
:"m" (ADDR),"Ir" (nr));
241
#define test_bit(nr,addr) \
242
(__builtin_constant_p(nr) ? \
243
constant_test_bit((nr),(addr)) : \
244
variable_test_bit((nr),(addr)))
247
* find_first_zero_bit - find the first zero bit in a memory region
248
* @addr: The address to start the search at
249
* @size: The maximum size to search
251
* Returns the bit-number of the first zero bit, not the number of the byte
254
static __inline__ int find_first_zero_bit(void * addr, unsigned size)
261
/* This looks at memory. Mark it volatile to tell gcc not to move it around */
262
__asm__ __volatile__(
264
"xorl %%edx,%%edx\n\t"
267
"xorl -4(%%edi),%%eax\n\t"
270
"1:\tsubl %%ebx,%%edi\n\t"
273
:"=d" (res), "=&c" (d0), "=&D" (d1), "=&a" (d2)
274
:"1" ((size + 31) >> 5), "2" (addr), "b" (addr));
279
* find_next_zero_bit - find the first zero bit in a memory region
280
* @addr: The address to base the search on
281
* @offset: The bitnumber to start searching at
282
* @size: The maximum size to search
284
static __inline__ int find_next_zero_bit (void * addr, int size, int offset)
286
unsigned long * p = ((unsigned long *) addr) + (offset >> 5);
287
int set = 0, bit = offset & 31, res;
291
* Look for zero in first byte
293
__asm__("bsfl %1,%0\n\t"
298
: "r" (~(*p >> bit)));
299
if (set < (32 - bit))
305
* No zero yet, search remaining full bytes for a zero
307
res = find_first_zero_bit (p, size - 32 * (p - (unsigned long *) addr));
308
return (offset + set + res);
312
* ffz - find first zero in word.
313
* @word: The word to search
315
* Undefined if no zero exists, so code should check against ~0UL first.
317
static __inline__ unsigned long ffz(unsigned long word)
326
* ffs - find first bit set
327
* @x: the word to search
329
* This is defined the same way as
330
* the libc and compiler builtin ffs routines, therefore
331
* differs in spirit from the above ffz (man ffs).
333
static __inline__ int ffs(int x)
337
__asm__("bsfl %1,%0\n\t"
340
"1:" : "=r" (r) : "g" (x));
345
* hweightN - returns the hamming weight of a N-bit word
346
* @x: the word to weigh
348
* The Hamming Weight of a number is the total number of bits set in it.
351
#define hweight32(x) generic_hweight32(x)
352
#define hweight16(x) generic_hweight16(x)
353
#define hweight8(x) generic_hweight8(x)
355
#define ext2_set_bit __test_and_set_bit
356
#define ext2_clear_bit __test_and_clear_bit
357
#define ext2_test_bit test_bit
358
#define ext2_find_first_zero_bit find_first_zero_bit
359
#define ext2_find_next_zero_bit find_next_zero_bit
361
/* Bitmap functions for the minix filesystem. */
362
#define minix_test_and_set_bit(nr,addr) __test_and_set_bit(nr,addr)
363
#define minix_set_bit(nr,addr) __set_bit(nr,addr)
364
#define minix_test_and_clear_bit(nr,addr) __test_and_clear_bit(nr,addr)
365
#define minix_test_bit(nr,addr) test_bit(nr,addr)
366
#define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size)
368
#endif /* _I386_BITOPS_H */