mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-20 05:26:53 +07:00
c042be02d7
Rather than using custom SZLONG_LOG & SZLONG_MASK macros to shift & mask
a bit index to form word & bit offsets respectively, make use of the
standard BIT_WORD() & BITS_PER_LONG macros for the same purpose.
volatile is added to the definition of pointers to the long-sized word
we'll operate on, in order to prevent the compiler complaining that we
cast away the volatile qualifier of the addr argument. This should have
no effect on generated code, which in the LL/SC case is inline asm
anyway & in the non-LLSC case access is constrained by compiler barriers
provided by raw_local_irq_{save,restore}().
Signed-off-by: Paul Burton <paul.burton@mips.com>
Cc: linux-mips@vger.kernel.org
Cc: Huacai Chen <chenhc@lemote.com>
Cc: Jiaxun Yang <jiaxun.yang@flygoat.com>
Cc: linux-kernel@vger.kernel.org
149 lines
3.8 KiB
C
149 lines
3.8 KiB
C
/*
|
|
* This file is subject to the terms and conditions of the GNU General Public
|
|
* License. See the file "COPYING" in the main directory of this archive
|
|
* for more details.
|
|
*
|
|
* Copyright (c) 1994-1997, 99, 2000, 06, 07 Ralf Baechle (ralf@linux-mips.org)
|
|
* Copyright (c) 1999, 2000 Silicon Graphics, Inc.
|
|
*/
|
|
#include <linux/bitops.h>
|
|
#include <linux/bits.h>
|
|
#include <linux/irqflags.h>
|
|
#include <linux/export.h>
|
|
|
|
|
|
/**
|
|
* __mips_set_bit - Atomically set a bit in memory. This is called by
|
|
* set_bit() if it cannot find a faster solution.
|
|
* @nr: the bit to set
|
|
* @addr: the address to start counting from
|
|
*/
|
|
void __mips_set_bit(unsigned long nr, volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
*a |= mask;
|
|
raw_local_irq_restore(flags);
|
|
}
|
|
EXPORT_SYMBOL(__mips_set_bit);
|
|
|
|
|
|
/**
|
|
* __mips_clear_bit - Clears a bit in memory. This is called by clear_bit() if
|
|
* it cannot find a faster solution.
|
|
* @nr: Bit to clear
|
|
* @addr: Address to start counting from
|
|
*/
|
|
void __mips_clear_bit(unsigned long nr, volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
*a &= ~mask;
|
|
raw_local_irq_restore(flags);
|
|
}
|
|
EXPORT_SYMBOL(__mips_clear_bit);
|
|
|
|
|
|
/**
|
|
* __mips_change_bit - Toggle a bit in memory. This is called by change_bit()
|
|
* if it cannot find a faster solution.
|
|
* @nr: Bit to change
|
|
* @addr: Address to start counting from
|
|
*/
|
|
void __mips_change_bit(unsigned long nr, volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
*a ^= mask;
|
|
raw_local_irq_restore(flags);
|
|
}
|
|
EXPORT_SYMBOL(__mips_change_bit);
|
|
|
|
|
|
/**
|
|
* __mips_test_and_set_bit_lock - Set a bit and return its old value. This is
|
|
* called by test_and_set_bit_lock() if it cannot find a faster solution.
|
|
* @nr: Bit to set
|
|
* @addr: Address to count from
|
|
*/
|
|
int __mips_test_and_set_bit_lock(unsigned long nr,
|
|
volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
int res;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
res = (mask & *a) != 0;
|
|
*a |= mask;
|
|
raw_local_irq_restore(flags);
|
|
return res;
|
|
}
|
|
EXPORT_SYMBOL(__mips_test_and_set_bit_lock);
|
|
|
|
|
|
/**
|
|
* __mips_test_and_clear_bit - Clear a bit and return its old value. This is
|
|
* called by test_and_clear_bit() if it cannot find a faster solution.
|
|
* @nr: Bit to clear
|
|
* @addr: Address to count from
|
|
*/
|
|
int __mips_test_and_clear_bit(unsigned long nr, volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
int res;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
res = (mask & *a) != 0;
|
|
*a &= ~mask;
|
|
raw_local_irq_restore(flags);
|
|
return res;
|
|
}
|
|
EXPORT_SYMBOL(__mips_test_and_clear_bit);
|
|
|
|
|
|
/**
|
|
* __mips_test_and_change_bit - Change a bit and return its old value. This is
|
|
* called by test_and_change_bit() if it cannot find a faster solution.
|
|
* @nr: Bit to change
|
|
* @addr: Address to count from
|
|
*/
|
|
int __mips_test_and_change_bit(unsigned long nr, volatile unsigned long *addr)
|
|
{
|
|
volatile unsigned long *a = &addr[BIT_WORD(nr)];
|
|
unsigned int bit = nr % BITS_PER_LONG;
|
|
unsigned long mask;
|
|
unsigned long flags;
|
|
int res;
|
|
|
|
mask = 1UL << bit;
|
|
raw_local_irq_save(flags);
|
|
res = (mask & *a) != 0;
|
|
*a ^= mask;
|
|
raw_local_irq_restore(flags);
|
|
return res;
|
|
}
|
|
EXPORT_SYMBOL(__mips_test_and_change_bit);
|