License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 21:07:57 +07:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2012-03-29 00:30:02 +07:00
|
|
|
#ifndef _ASM_POWERPC_CMPXCHG_H_
|
|
|
|
#define _ASM_POWERPC_CMPXCHG_H_
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include <asm/synch.h>
|
2016-02-23 18:05:01 +07:00
|
|
|
#include <linux/bug.h>
|
2018-07-05 23:24:55 +07:00
|
|
|
#include <asm/asm-405.h>
|
2012-03-29 00:30:02 +07:00
|
|
|
|
2016-04-27 16:16:45 +07:00
|
|
|
#ifdef __BIG_ENDIAN
|
|
|
|
#define BITOFF_CAL(size, off) ((sizeof(u32) - size - off) * BITS_PER_BYTE)
|
|
|
|
#else
|
|
|
|
#define BITOFF_CAL(size, off) (off * BITS_PER_BYTE)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define XCHG_GEN(type, sfx, cl) \
|
2016-11-24 13:08:11 +07:00
|
|
|
static inline u32 __xchg_##type##sfx(volatile void *p, u32 val) \
|
2016-04-27 16:16:45 +07:00
|
|
|
{ \
|
|
|
|
unsigned int prev, prev_mask, tmp, bitoff, off; \
|
|
|
|
\
|
|
|
|
off = (unsigned long)p % sizeof(u32); \
|
|
|
|
bitoff = BITOFF_CAL(sizeof(type), off); \
|
|
|
|
p -= off; \
|
|
|
|
val <<= bitoff; \
|
|
|
|
prev_mask = (u32)(type)-1 << bitoff; \
|
|
|
|
\
|
|
|
|
__asm__ __volatile__( \
|
|
|
|
"1: lwarx %0,0,%3\n" \
|
|
|
|
" andc %1,%0,%5\n" \
|
|
|
|
" or %1,%1,%4\n" \
|
|
|
|
PPC405_ERR77(0,%3) \
|
|
|
|
" stwcx. %1,0,%3\n" \
|
|
|
|
" bne- 1b\n" \
|
|
|
|
: "=&r" (prev), "=&r" (tmp), "+m" (*(u32*)p) \
|
|
|
|
: "r" (p), "r" (val), "r" (prev_mask) \
|
|
|
|
: "cc", cl); \
|
|
|
|
\
|
|
|
|
return prev >> bitoff; \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define CMPXCHG_GEN(type, sfx, br, br2, cl) \
|
|
|
|
static inline \
|
2016-11-24 13:08:11 +07:00
|
|
|
u32 __cmpxchg_##type##sfx(volatile void *p, u32 old, u32 new) \
|
2016-04-27 16:16:45 +07:00
|
|
|
{ \
|
|
|
|
unsigned int prev, prev_mask, tmp, bitoff, off; \
|
|
|
|
\
|
|
|
|
off = (unsigned long)p % sizeof(u32); \
|
|
|
|
bitoff = BITOFF_CAL(sizeof(type), off); \
|
|
|
|
p -= off; \
|
|
|
|
old <<= bitoff; \
|
|
|
|
new <<= bitoff; \
|
|
|
|
prev_mask = (u32)(type)-1 << bitoff; \
|
|
|
|
\
|
|
|
|
__asm__ __volatile__( \
|
|
|
|
br \
|
|
|
|
"1: lwarx %0,0,%3\n" \
|
|
|
|
" and %1,%0,%6\n" \
|
|
|
|
" cmpw 0,%1,%4\n" \
|
|
|
|
" bne- 2f\n" \
|
|
|
|
" andc %1,%0,%6\n" \
|
|
|
|
" or %1,%1,%5\n" \
|
|
|
|
PPC405_ERR77(0,%3) \
|
|
|
|
" stwcx. %1,0,%3\n" \
|
|
|
|
" bne- 1b\n" \
|
|
|
|
br2 \
|
|
|
|
"\n" \
|
|
|
|
"2:" \
|
|
|
|
: "=&r" (prev), "=&r" (tmp), "+m" (*(u32*)p) \
|
|
|
|
: "r" (p), "r" (old), "r" (new), "r" (prev_mask) \
|
|
|
|
: "cc", cl); \
|
|
|
|
\
|
|
|
|
return prev >> bitoff; \
|
|
|
|
}
|
|
|
|
|
2012-03-29 00:30:02 +07:00
|
|
|
/*
|
|
|
|
* Atomic exchange
|
|
|
|
*
|
2015-12-15 21:24:16 +07:00
|
|
|
* Changes the memory location '*p' to be val and returns
|
2012-03-29 00:30:02 +07:00
|
|
|
* the previous value stored there.
|
|
|
|
*/
|
2015-12-15 21:24:16 +07:00
|
|
|
|
2016-04-27 16:16:45 +07:00
|
|
|
XCHG_GEN(u8, _local, "memory");
|
|
|
|
XCHG_GEN(u8, _relaxed, "cc");
|
|
|
|
XCHG_GEN(u16, _local, "memory");
|
|
|
|
XCHG_GEN(u16, _relaxed, "cc");
|
|
|
|
|
2012-03-29 00:30:02 +07:00
|
|
|
static __always_inline unsigned long
|
2015-12-15 21:24:16 +07:00
|
|
|
__xchg_u32_local(volatile void *p, unsigned long val)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: lwarx %0,0,%2 \n"
|
|
|
|
PPC405_ERR77(0,%2)
|
|
|
|
" stwcx. %3,0,%2 \n\
|
|
|
|
bne- 1b"
|
|
|
|
: "=&r" (prev), "+m" (*(volatile unsigned int *)p)
|
|
|
|
: "r" (p), "r" (val)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2015-12-15 21:24:16 +07:00
|
|
|
__xchg_u32_relaxed(u32 *p, unsigned long val)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
2015-12-15 21:24:16 +07:00
|
|
|
"1: lwarx %0,0,%2\n"
|
|
|
|
PPC405_ERR77(0, %2)
|
|
|
|
" stwcx. %3,0,%2\n"
|
|
|
|
" bne- 1b"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
2012-03-29 00:30:02 +07:00
|
|
|
: "r" (p), "r" (val)
|
2015-12-15 21:24:16 +07:00
|
|
|
: "cc");
|
2012-03-29 00:30:02 +07:00
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
static __always_inline unsigned long
|
2015-12-15 21:24:16 +07:00
|
|
|
__xchg_u64_local(volatile void *p, unsigned long val)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
|
|
|
"1: ldarx %0,0,%2 \n"
|
|
|
|
PPC405_ERR77(0,%2)
|
|
|
|
" stdcx. %3,0,%2 \n\
|
|
|
|
bne- 1b"
|
|
|
|
: "=&r" (prev), "+m" (*(volatile unsigned long *)p)
|
|
|
|
: "r" (p), "r" (val)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2015-12-15 21:24:16 +07:00
|
|
|
__xchg_u64_relaxed(u64 *p, unsigned long val)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__(
|
2015-12-15 21:24:16 +07:00
|
|
|
"1: ldarx %0,0,%2\n"
|
|
|
|
PPC405_ERR77(0, %2)
|
|
|
|
" stdcx. %3,0,%2\n"
|
|
|
|
" bne- 1b"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
2012-03-29 00:30:02 +07:00
|
|
|
: "r" (p), "r" (val)
|
2015-12-15 21:24:16 +07:00
|
|
|
: "cc");
|
2012-03-29 00:30:02 +07:00
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2016-04-27 16:16:45 +07:00
|
|
|
__xchg_local(void *ptr, unsigned long x, unsigned int size)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __xchg_u8_local(ptr, x);
|
|
|
|
case 2:
|
|
|
|
return __xchg_u16_local(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
case 4:
|
2015-12-15 21:24:16 +07:00
|
|
|
return __xchg_u32_local(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
2015-12-15 21:24:16 +07:00
|
|
|
return __xchg_u64_local(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __xchg");
|
2012-03-29 00:30:02 +07:00
|
|
|
return x;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2015-12-15 21:24:16 +07:00
|
|
|
__xchg_relaxed(void *ptr, unsigned long x, unsigned int size)
|
2012-03-29 00:30:02 +07:00
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __xchg_u8_relaxed(ptr, x);
|
|
|
|
case 2:
|
|
|
|
return __xchg_u16_relaxed(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
case 4:
|
2015-12-15 21:24:16 +07:00
|
|
|
return __xchg_u32_relaxed(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
2015-12-15 21:24:16 +07:00
|
|
|
return __xchg_u64_relaxed(ptr, x);
|
2012-03-29 00:30:02 +07:00
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __xchg_local");
|
2012-03-29 00:30:02 +07:00
|
|
|
return x;
|
|
|
|
}
|
|
|
|
#define xchg_local(ptr,x) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _x_ = (x); \
|
|
|
|
(__typeof__(*(ptr))) __xchg_local((ptr), \
|
|
|
|
(unsigned long)_x_, sizeof(*(ptr))); \
|
|
|
|
})
|
|
|
|
|
2015-12-15 21:24:16 +07:00
|
|
|
#define xchg_relaxed(ptr, x) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _x_ = (x); \
|
|
|
|
(__typeof__(*(ptr))) __xchg_relaxed((ptr), \
|
|
|
|
(unsigned long)_x_, sizeof(*(ptr))); \
|
|
|
|
})
|
2012-03-29 00:30:02 +07:00
|
|
|
/*
|
|
|
|
* Compare and exchange - if *p == old, set it to new,
|
|
|
|
* and return the old value of *p.
|
|
|
|
*/
|
|
|
|
|
2016-04-27 16:16:45 +07:00
|
|
|
CMPXCHG_GEN(u8, , PPC_ATOMIC_ENTRY_BARRIER, PPC_ATOMIC_EXIT_BARRIER, "memory");
|
|
|
|
CMPXCHG_GEN(u8, _local, , , "memory");
|
|
|
|
CMPXCHG_GEN(u8, _acquire, , PPC_ACQUIRE_BARRIER, "memory");
|
|
|
|
CMPXCHG_GEN(u8, _relaxed, , , "cc");
|
|
|
|
CMPXCHG_GEN(u16, , PPC_ATOMIC_ENTRY_BARRIER, PPC_ATOMIC_EXIT_BARRIER, "memory");
|
|
|
|
CMPXCHG_GEN(u16, _local, , , "memory");
|
|
|
|
CMPXCHG_GEN(u16, _acquire, , PPC_ACQUIRE_BARRIER, "memory");
|
|
|
|
CMPXCHG_GEN(u16, _relaxed, , , "cc");
|
|
|
|
|
2012-03-29 00:30:02 +07:00
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u32(volatile unsigned int *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned int prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
powerpc: Make {cmp}xchg* and their atomic_ versions fully ordered
According to memory-barriers.txt, xchg*, cmpxchg* and their atomic_
versions all need to be fully ordered, however they are now just
RELEASE+ACQUIRE, which are not fully ordered.
So also replace PPC_RELEASE_BARRIER and PPC_ACQUIRE_BARRIER with
PPC_ATOMIC_ENTRY_BARRIER and PPC_ATOMIC_EXIT_BARRIER in
__{cmp,}xchg_{u32,u64} respectively to guarantee fully ordered semantics
of atomic{,64}_{cmp,}xchg() and {cmp,}xchg(), as a complement of commit
b97021f85517 ("powerpc: Fix atomic_xxx_return barrier semantics")
This patch depends on patch "powerpc: Make value-returning atomics fully
ordered" for PPC_ATOMIC_ENTRY_BARRIER definition.
Cc: stable@vger.kernel.org # 3.2+
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Reviewed-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-11-02 08:30:32 +07:00
|
|
|
PPC_ATOMIC_ENTRY_BARRIER
|
2012-03-29 00:30:02 +07:00
|
|
|
"1: lwarx %0,0,%2 # __cmpxchg_u32\n\
|
|
|
|
cmpw 0,%0,%3\n\
|
|
|
|
bne- 2f\n"
|
|
|
|
PPC405_ERR77(0,%2)
|
|
|
|
" stwcx. %4,0,%2\n\
|
|
|
|
bne- 1b"
|
powerpc: Make {cmp}xchg* and their atomic_ versions fully ordered
According to memory-barriers.txt, xchg*, cmpxchg* and their atomic_
versions all need to be fully ordered, however they are now just
RELEASE+ACQUIRE, which are not fully ordered.
So also replace PPC_RELEASE_BARRIER and PPC_ACQUIRE_BARRIER with
PPC_ATOMIC_ENTRY_BARRIER and PPC_ATOMIC_EXIT_BARRIER in
__{cmp,}xchg_{u32,u64} respectively to guarantee fully ordered semantics
of atomic{,64}_{cmp,}xchg() and {cmp,}xchg(), as a complement of commit
b97021f85517 ("powerpc: Fix atomic_xxx_return barrier semantics")
This patch depends on patch "powerpc: Make value-returning atomics fully
ordered" for PPC_ATOMIC_ENTRY_BARRIER definition.
Cc: stable@vger.kernel.org # 3.2+
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Reviewed-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-11-02 08:30:32 +07:00
|
|
|
PPC_ATOMIC_EXIT_BARRIER
|
2012-03-29 00:30:02 +07:00
|
|
|
"\n\
|
|
|
|
2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u32_local(volatile unsigned int *p, unsigned long old,
|
|
|
|
unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned int prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: lwarx %0,0,%2 # __cmpxchg_u32\n\
|
|
|
|
cmpw 0,%0,%3\n\
|
|
|
|
bne- 2f\n"
|
|
|
|
PPC405_ERR77(0,%2)
|
|
|
|
" stwcx. %4,0,%2\n\
|
|
|
|
bne- 1b"
|
|
|
|
"\n\
|
|
|
|
2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u32_relaxed(u32 *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: lwarx %0,0,%2 # __cmpxchg_u32_relaxed\n"
|
|
|
|
" cmpw 0,%0,%3\n"
|
|
|
|
" bne- 2f\n"
|
|
|
|
PPC405_ERR77(0, %2)
|
|
|
|
" stwcx. %4,0,%2\n"
|
|
|
|
" bne- 1b\n"
|
|
|
|
"2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* cmpxchg family don't have order guarantee if cmp part fails, therefore we
|
|
|
|
* can avoid superfluous barriers if we use assembly code to implement
|
|
|
|
* cmpxchg() and cmpxchg_acquire(), however we don't do the similar for
|
|
|
|
* cmpxchg_release() because that will result in putting a barrier in the
|
|
|
|
* middle of a ll/sc loop, which is probably a bad idea. For example, this
|
|
|
|
* might cause the conditional store more likely to fail.
|
|
|
|
*/
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u32_acquire(u32 *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: lwarx %0,0,%2 # __cmpxchg_u32_acquire\n"
|
|
|
|
" cmpw 0,%0,%3\n"
|
|
|
|
" bne- 2f\n"
|
|
|
|
PPC405_ERR77(0, %2)
|
|
|
|
" stwcx. %4,0,%2\n"
|
|
|
|
" bne- 1b\n"
|
|
|
|
PPC_ACQUIRE_BARRIER
|
|
|
|
"\n"
|
|
|
|
"2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
2012-03-29 00:30:02 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u64(volatile unsigned long *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
powerpc: Make {cmp}xchg* and their atomic_ versions fully ordered
According to memory-barriers.txt, xchg*, cmpxchg* and their atomic_
versions all need to be fully ordered, however they are now just
RELEASE+ACQUIRE, which are not fully ordered.
So also replace PPC_RELEASE_BARRIER and PPC_ACQUIRE_BARRIER with
PPC_ATOMIC_ENTRY_BARRIER and PPC_ATOMIC_EXIT_BARRIER in
__{cmp,}xchg_{u32,u64} respectively to guarantee fully ordered semantics
of atomic{,64}_{cmp,}xchg() and {cmp,}xchg(), as a complement of commit
b97021f85517 ("powerpc: Fix atomic_xxx_return barrier semantics")
This patch depends on patch "powerpc: Make value-returning atomics fully
ordered" for PPC_ATOMIC_ENTRY_BARRIER definition.
Cc: stable@vger.kernel.org # 3.2+
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Reviewed-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-11-02 08:30:32 +07:00
|
|
|
PPC_ATOMIC_ENTRY_BARRIER
|
2012-03-29 00:30:02 +07:00
|
|
|
"1: ldarx %0,0,%2 # __cmpxchg_u64\n\
|
|
|
|
cmpd 0,%0,%3\n\
|
|
|
|
bne- 2f\n\
|
|
|
|
stdcx. %4,0,%2\n\
|
|
|
|
bne- 1b"
|
powerpc: Make {cmp}xchg* and their atomic_ versions fully ordered
According to memory-barriers.txt, xchg*, cmpxchg* and their atomic_
versions all need to be fully ordered, however they are now just
RELEASE+ACQUIRE, which are not fully ordered.
So also replace PPC_RELEASE_BARRIER and PPC_ACQUIRE_BARRIER with
PPC_ATOMIC_ENTRY_BARRIER and PPC_ATOMIC_EXIT_BARRIER in
__{cmp,}xchg_{u32,u64} respectively to guarantee fully ordered semantics
of atomic{,64}_{cmp,}xchg() and {cmp,}xchg(), as a complement of commit
b97021f85517 ("powerpc: Fix atomic_xxx_return barrier semantics")
This patch depends on patch "powerpc: Make value-returning atomics fully
ordered" for PPC_ATOMIC_ENTRY_BARRIER definition.
Cc: stable@vger.kernel.org # 3.2+
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Reviewed-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-11-02 08:30:32 +07:00
|
|
|
PPC_ATOMIC_EXIT_BARRIER
|
2012-03-29 00:30:02 +07:00
|
|
|
"\n\
|
|
|
|
2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u64_local(volatile unsigned long *p, unsigned long old,
|
|
|
|
unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: ldarx %0,0,%2 # __cmpxchg_u64\n\
|
|
|
|
cmpd 0,%0,%3\n\
|
|
|
|
bne- 2f\n\
|
|
|
|
stdcx. %4,0,%2\n\
|
|
|
|
bne- 1b"
|
|
|
|
"\n\
|
|
|
|
2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u64_relaxed(u64 *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: ldarx %0,0,%2 # __cmpxchg_u64_relaxed\n"
|
|
|
|
" cmpd 0,%0,%3\n"
|
|
|
|
" bne- 2f\n"
|
|
|
|
" stdcx. %4,0,%2\n"
|
|
|
|
" bne- 1b\n"
|
|
|
|
"2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_u64_acquire(u64 *p, unsigned long old, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long prev;
|
|
|
|
|
|
|
|
__asm__ __volatile__ (
|
|
|
|
"1: ldarx %0,0,%2 # __cmpxchg_u64_acquire\n"
|
|
|
|
" cmpd 0,%0,%3\n"
|
|
|
|
" bne- 2f\n"
|
|
|
|
" stdcx. %4,0,%2\n"
|
|
|
|
" bne- 1b\n"
|
|
|
|
PPC_ACQUIRE_BARRIER
|
|
|
|
"\n"
|
|
|
|
"2:"
|
|
|
|
: "=&r" (prev), "+m" (*p)
|
|
|
|
: "r" (p), "r" (old), "r" (new)
|
|
|
|
: "cc", "memory");
|
|
|
|
|
|
|
|
return prev;
|
|
|
|
}
|
2012-03-29 00:30:02 +07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2016-11-24 13:08:11 +07:00
|
|
|
__cmpxchg(volatile void *ptr, unsigned long old, unsigned long new,
|
2012-03-29 00:30:02 +07:00
|
|
|
unsigned int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __cmpxchg_u8(ptr, old, new);
|
|
|
|
case 2:
|
|
|
|
return __cmpxchg_u16(ptr, old, new);
|
2012-03-29 00:30:02 +07:00
|
|
|
case 4:
|
|
|
|
return __cmpxchg_u32(ptr, old, new);
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
|
|
|
return __cmpxchg_u64(ptr, old, new);
|
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __cmpxchg");
|
2012-03-29 00:30:02 +07:00
|
|
|
return old;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2016-04-27 16:16:45 +07:00
|
|
|
__cmpxchg_local(void *ptr, unsigned long old, unsigned long new,
|
2012-03-29 00:30:02 +07:00
|
|
|
unsigned int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __cmpxchg_u8_local(ptr, old, new);
|
|
|
|
case 2:
|
|
|
|
return __cmpxchg_u16_local(ptr, old, new);
|
2012-03-29 00:30:02 +07:00
|
|
|
case 4:
|
|
|
|
return __cmpxchg_u32_local(ptr, old, new);
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
|
|
|
return __cmpxchg_u64_local(ptr, old, new);
|
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __cmpxchg_local");
|
2012-03-29 00:30:02 +07:00
|
|
|
return old;
|
|
|
|
}
|
|
|
|
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_relaxed(void *ptr, unsigned long old, unsigned long new,
|
|
|
|
unsigned int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __cmpxchg_u8_relaxed(ptr, old, new);
|
|
|
|
case 2:
|
|
|
|
return __cmpxchg_u16_relaxed(ptr, old, new);
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
case 4:
|
|
|
|
return __cmpxchg_u32_relaxed(ptr, old, new);
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
|
|
|
return __cmpxchg_u64_relaxed(ptr, old, new);
|
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __cmpxchg_relaxed");
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
return old;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
|
|
|
__cmpxchg_acquire(void *ptr, unsigned long old, unsigned long new,
|
|
|
|
unsigned int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2016-04-27 16:16:45 +07:00
|
|
|
case 1:
|
|
|
|
return __cmpxchg_u8_acquire(ptr, old, new);
|
|
|
|
case 2:
|
|
|
|
return __cmpxchg_u16_acquire(ptr, old, new);
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
case 4:
|
|
|
|
return __cmpxchg_u32_acquire(ptr, old, new);
|
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
case 8:
|
|
|
|
return __cmpxchg_u64_acquire(ptr, old, new);
|
|
|
|
#endif
|
|
|
|
}
|
2016-02-23 18:05:01 +07:00
|
|
|
BUILD_BUG_ON_MSG(1, "Unsupported size for __cmpxchg_acquire");
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
return old;
|
|
|
|
}
|
2012-03-29 00:30:02 +07:00
|
|
|
#define cmpxchg(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _o_ = (o); \
|
|
|
|
__typeof__(*(ptr)) _n_ = (n); \
|
|
|
|
(__typeof__(*(ptr))) __cmpxchg((ptr), (unsigned long)_o_, \
|
|
|
|
(unsigned long)_n_, sizeof(*(ptr))); \
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
|
|
#define cmpxchg_local(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _o_ = (o); \
|
|
|
|
__typeof__(*(ptr)) _n_ = (n); \
|
|
|
|
(__typeof__(*(ptr))) __cmpxchg_local((ptr), (unsigned long)_o_, \
|
|
|
|
(unsigned long)_n_, sizeof(*(ptr))); \
|
|
|
|
})
|
|
|
|
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
#define cmpxchg_relaxed(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _o_ = (o); \
|
|
|
|
__typeof__(*(ptr)) _n_ = (n); \
|
|
|
|
(__typeof__(*(ptr))) __cmpxchg_relaxed((ptr), \
|
|
|
|
(unsigned long)_o_, (unsigned long)_n_, \
|
|
|
|
sizeof(*(ptr))); \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define cmpxchg_acquire(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
__typeof__(*(ptr)) _o_ = (o); \
|
|
|
|
__typeof__(*(ptr)) _n_ = (n); \
|
|
|
|
(__typeof__(*(ptr))) __cmpxchg_acquire((ptr), \
|
|
|
|
(unsigned long)_o_, (unsigned long)_n_, \
|
|
|
|
sizeof(*(ptr))); \
|
|
|
|
})
|
2012-03-29 00:30:02 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
#define cmpxchg64(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
BUILD_BUG_ON(sizeof(*(ptr)) != 8); \
|
|
|
|
cmpxchg((ptr), (o), (n)); \
|
|
|
|
})
|
|
|
|
#define cmpxchg64_local(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
BUILD_BUG_ON(sizeof(*(ptr)) != 8); \
|
|
|
|
cmpxchg_local((ptr), (o), (n)); \
|
|
|
|
})
|
powerpc: atomic: Implement acquire/release/relaxed variants for cmpxchg
Implement cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed, based on
which _release variants can be built.
To avoid superfluous barriers in _acquire variants, we implement these
operations with assembly code rather use __atomic_op_acquire() to build
them automatically.
For the same reason, we keep the assembly implementation of fully
ordered cmpxchg operations.
However, we don't do the similar for _release, because that will require
putting barriers in the middle of ll/sc loops, which is probably a bad
idea.
Note cmpxchg{,64}_relaxed and atomic{,64}_cmpxchg_relaxed are not
compiler barriers.
Signed-off-by: Boqun Feng <boqun.feng@gmail.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2015-12-15 21:24:17 +07:00
|
|
|
#define cmpxchg64_relaxed(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
BUILD_BUG_ON(sizeof(*(ptr)) != 8); \
|
|
|
|
cmpxchg_relaxed((ptr), (o), (n)); \
|
|
|
|
})
|
|
|
|
#define cmpxchg64_acquire(ptr, o, n) \
|
|
|
|
({ \
|
|
|
|
BUILD_BUG_ON(sizeof(*(ptr)) != 8); \
|
|
|
|
cmpxchg_acquire((ptr), (o), (n)); \
|
|
|
|
})
|
2012-03-29 00:30:02 +07:00
|
|
|
#else
|
|
|
|
#include <asm-generic/cmpxchg-local.h>
|
|
|
|
#define cmpxchg64_local(ptr, o, n) __cmpxchg64_local_generic((ptr), (o), (n))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
#endif /* _ASM_POWERPC_CMPXCHG_H_ */
|