mirror of
https://github.com/reactos/reactos.git
synced 2024-08-21 10:53:15 +00:00
204 lines
4.7 KiB
C
204 lines
4.7 KiB
C
![]() |
/*
|
||
|
* ReactOS kernel
|
||
|
*
|
||
|
* 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.
|
||
|
*
|
||
|
* This program is distributed in the hope that it will be useful,
|
||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
* GNU General Public License for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU General Public License
|
||
|
* along with this program; if not, write to the Free Software
|
||
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||
|
*/
|
||
|
/*
|
||
|
* Copyright 1992, Linus Torvalds.
|
||
|
*/
|
||
|
/*
|
||
|
* These have to be done with inline assembly: that way the bit-setting
|
||
|
* is guaranteed to be atomic. All bit operations return 0 if the bit
|
||
|
* was cleared before the operation and != 0 if it was not.
|
||
|
*
|
||
|
* bit 0 is the LSB of addr; bit 32 is the LSB of (addr+1).
|
||
|
*/
|
||
|
|
||
|
#ifdef __SMP__
|
||
|
#define LOCK_PREFIX "lock ; "
|
||
|
#else
|
||
|
#define LOCK_PREFIX ""
|
||
|
#endif
|
||
|
|
||
|
/*
|
||
|
* Function prototypes to keep gcc -Wall happy
|
||
|
*/
|
||
|
extern void set_bit(int nr, volatile void * addr);
|
||
|
extern void clear_bit(int nr, volatile void * addr);
|
||
|
extern void change_bit(int nr, volatile void * addr);
|
||
|
extern int test_and_set_bit(int nr, volatile void * addr);
|
||
|
extern int test_and_clear_bit(int nr, volatile void * addr);
|
||
|
extern int test_and_change_bit(int nr, volatile void * addr);
|
||
|
extern int __constant_test_bit(int nr, const volatile void * addr);
|
||
|
extern int __test_bit(int nr, volatile void * addr);
|
||
|
extern int find_first_zero_bit(void * addr, unsigned size);
|
||
|
extern int find_next_zero_bit (void * addr, int size, int offset);
|
||
|
extern unsigned long ffz(unsigned long word);
|
||
|
|
||
|
/*
|
||
|
* Some hacks to defeat gcc over-optimizations..
|
||
|
*/
|
||
|
struct __dummy { unsigned long a[100]; };
|
||
|
#define ADDR (*(volatile struct __dummy *) addr)
|
||
|
#define CONST_ADDR (*(volatile const struct __dummy *) addr)
|
||
|
|
||
|
void set_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btsl %1,%0"
|
||
|
:"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
}
|
||
|
|
||
|
void clear_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btrl %1,%0"
|
||
|
:"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
}
|
||
|
|
||
|
void change_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btcl %1,%0"
|
||
|
:"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
}
|
||
|
|
||
|
int test_and_set_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
int oldbit;
|
||
|
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btsl %2,%1\n\tsbbl %0,%0"
|
||
|
:"=r" (oldbit),"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
return oldbit;
|
||
|
}
|
||
|
|
||
|
int test_and_clear_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
int oldbit;
|
||
|
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btrl %2,%1\n\tsbbl %0,%0"
|
||
|
:"=r" (oldbit),"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
return oldbit;
|
||
|
}
|
||
|
|
||
|
int test_and_change_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
int oldbit;
|
||
|
|
||
|
__asm__ __volatile__( LOCK_PREFIX
|
||
|
"btcl %2,%1\n\tsbbl %0,%0"
|
||
|
:"=r" (oldbit),"=m" (ADDR)
|
||
|
:"Ir" (nr));
|
||
|
return oldbit;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* This routine doesn't need to be atomic.
|
||
|
*/
|
||
|
int __constant_test_bit(int nr, const volatile void * addr)
|
||
|
{
|
||
|
return ((1UL << (nr & 31)) & (((const volatile unsigned int *) addr)[nr >> 5])) != 0;
|
||
|
}
|
||
|
|
||
|
int test_bit(int nr, volatile void * addr)
|
||
|
{
|
||
|
int oldbit;
|
||
|
|
||
|
__asm__ __volatile__(
|
||
|
"btl %2,%1\n\tsbbl %0,%0"
|
||
|
:"=r" (oldbit)
|
||
|
:"m" (ADDR),"Ir" (nr));
|
||
|
return oldbit;
|
||
|
}
|
||
|
|
||
|
#if 0
|
||
|
#define test_bit(nr,addr) \
|
||
|
(__builtin_constant_p(nr) ? \
|
||
|
__constant_test_bit((nr),(addr)) : \
|
||
|
__test_bit((nr),(addr)))
|
||
|
#endif
|
||
|
|
||
|
/*
|
||
|
* Find-bit routines..
|
||
|
*/
|
||
|
int find_first_zero_bit(void * addr, unsigned size)
|
||
|
{
|
||
|
int d0, d1, d2;
|
||
|
int res;
|
||
|
|
||
|
if (!size)
|
||
|
return 0;
|
||
|
__asm__("cld\n\t"
|
||
|
"movl $-1,%%eax\n\t"
|
||
|
"xorl %%edx,%%edx\n\t"
|
||
|
"repe; scasl\n\t"
|
||
|
"je 1f\n\t"
|
||
|
"xorl -4(%%edi),%%eax\n\t"
|
||
|
"subl $4,%%edi\n\t"
|
||
|
"bsfl %%eax,%%edx\n"
|
||
|
"1:\tsubl %%ebx,%%edi\n\t"
|
||
|
"shll $3,%%edi\n\t"
|
||
|
"addl %%edi,%%edx"
|
||
|
:"=d" (res), "=&c" (d0), "=&D" (d1), "=&a" (d2)
|
||
|
:"1" ((size + 31) >> 5), "2" (addr), "b" (addr));
|
||
|
return res;
|
||
|
}
|
||
|
|
||
|
int find_next_zero_bit (void * addr, int size, int offset)
|
||
|
{
|
||
|
unsigned long * p = ((unsigned long *) addr) + (offset >> 5);
|
||
|
int set = 0, bit = offset & 31, res;
|
||
|
|
||
|
if (bit) {
|
||
|
/*
|
||
|
* Look for zero in first byte
|
||
|
*/
|
||
|
__asm__("bsfl %1,%0\n\t"
|
||
|
"jne 1f\n\t"
|
||
|
"movl $32, %0\n"
|
||
|
"1:"
|
||
|
: "=r" (set)
|
||
|
: "r" (~(*p >> bit)));
|
||
|
if (set < (32 - bit))
|
||
|
return set + offset;
|
||
|
set = 32 - bit;
|
||
|
p++;
|
||
|
}
|
||
|
/*
|
||
|
* No zero yet, search remaining full bytes for a zero
|
||
|
*/
|
||
|
res = find_first_zero_bit (p, size - 32 * (p - (unsigned long *) addr));
|
||
|
return (offset + set + res);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* ffz = Find First Zero in word. Undefined if no zero exists,
|
||
|
* so code should check against ~0UL first..
|
||
|
*/
|
||
|
unsigned long ffz(unsigned long word)
|
||
|
{
|
||
|
__asm__("bsfl %1,%0"
|
||
|
:"=r" (word)
|
||
|
:"r" (~word));
|
||
|
return word;
|
||
|
}
|