73 lines
2.2 KiB
C
73 lines
2.2 KiB
C
|
/* SPDX-License-Identifier: GPL-2.0 */
|
||
|
|
#ifndef __BARRIER_H
|
||
|
|
#define __BARRIER_H
|
||
|
|
|
||
|
|
#include <asm/compiler.h>
|
||
|
|
|
||
|
|
#define mb() __asm__ __volatile__("mb": : :"memory")
|
||
|
|
#define rmb() __asm__ __volatile__("mb": : :"memory")
|
||
|
|
#define wmb() __asm__ __volatile__("wmb": : :"memory")
|
||
|
|
|
||
|
|
/**
|
||
|
|
* read_barrier_depends - Flush all pending reads that subsequents reads
|
||
|
|
* depend on.
|
||
|
|
*
|
||
|
|
* No data-dependent reads from memory-like regions are ever reordered
|
||
|
|
* over this barrier. All reads preceding this primitive are guaranteed
|
||
|
|
* to access memory (but not necessarily other CPUs' caches) before any
|
||
|
|
* reads following this primitive that depend on the data return by
|
||
|
|
* any of the preceding reads. This primitive is much lighter weight than
|
||
|
|
* rmb() on most CPUs, and is never heavier weight than is
|
||
|
|
* rmb().
|
||
|
|
*
|
||
|
|
* These ordering constraints are respected by both the local CPU
|
||
|
|
* and the compiler.
|
||
|
|
*
|
||
|
|
* Ordering is not guaranteed by anything other than these primitives,
|
||
|
|
* not even by data dependencies. See the documentation for
|
||
|
|
* memory_barrier() for examples and URLs to more information.
|
||
|
|
*
|
||
|
|
* For example, the following code would force ordering (the initial
|
||
|
|
* value of "a" is zero, "b" is one, and "p" is "&a"):
|
||
|
|
*
|
||
|
|
* <programlisting>
|
||
|
|
* CPU 0 CPU 1
|
||
|
|
*
|
||
|
|
* b = 2;
|
||
|
|
* memory_barrier();
|
||
|
|
* p = &b; q = p;
|
||
|
|
* read_barrier_depends();
|
||
|
|
* d = *q;
|
||
|
|
* </programlisting>
|
||
|
|
*
|
||
|
|
* because the read of "*q" depends on the read of "p" and these
|
||
|
|
* two reads are separated by a read_barrier_depends(). However,
|
||
|
|
* the following code, with the same initial values for "a" and "b":
|
||
|
|
*
|
||
|
|
* <programlisting>
|
||
|
|
* CPU 0 CPU 1
|
||
|
|
*
|
||
|
|
* a = 2;
|
||
|
|
* memory_barrier();
|
||
|
|
* b = 3; y = b;
|
||
|
|
* read_barrier_depends();
|
||
|
|
* x = a;
|
||
|
|
* </programlisting>
|
||
|
|
*
|
||
|
|
* does not enforce ordering, since there is no data dependency between
|
||
|
|
* the read of "a" and the read of "b". Therefore, on some CPUs, such
|
||
|
|
* as Alpha, "y" could be set to 3 and "x" to 0. Use rmb()
|
||
|
|
* in cases like this where there are no data dependencies.
|
||
|
|
*/
|
||
|
|
#define read_barrier_depends() __asm__ __volatile__("mb": : :"memory")
|
||
|
|
|
||
|
|
#ifdef CONFIG_SMP
|
||
|
|
#define __ASM_SMP_MB "\tmb\n"
|
||
|
|
#else
|
||
|
|
#define __ASM_SMP_MB
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include <asm-generic/barrier.h>
|
||
|
|
|
||
|
|
#endif /* __BARRIER_H */
|