@@ -3997,24 +3997,24 @@ unsafe fn atomic_umin<T: Copy>(dst: *mut T, val: T, order: Ordering) -> T {
3997
3997
///
3998
3998
/// A fence 'A' which has (at least) [`Release`] ordering semantics, synchronizes
3999
3999
/// with a fence 'B' with (at least) [`Acquire`] semantics, if and only if there
4000
- /// exist operations X and Y, both operating on some atomic object 'M ' such
4000
+ /// exist operations X and Y, both operating on some atomic object 'm ' such
4001
4001
/// that A is sequenced before X, Y is sequenced before B and Y observes
4002
- /// the change to M . This provides a happens-before dependence between A and B.
4002
+ /// the change to m . This provides a happens-before dependence between A and B.
4003
4003
///
4004
4004
/// ```text
4005
4005
/// Thread 1 Thread 2
4006
4006
///
4007
4007
/// fence(Release); A --------------
4008
- /// x .store(3, Relaxed); X --------- |
4008
+ /// m .store(3, Relaxed); X --------- |
4009
4009
/// | |
4010
4010
/// | |
4011
- /// -------------> Y if x .load(Relaxed) == 3 {
4011
+ /// -------------> Y if m .load(Relaxed) == 3 {
4012
4012
/// |-------> B fence(Acquire);
4013
4013
/// ...
4014
4014
/// }
4015
4015
/// ```
4016
4016
///
4017
- /// Note that in the example above, it is crucial that the accesses to `x ` are atomic. Fences cannot
4017
+ /// Note that in the example above, it is crucial that the accesses to `m ` are atomic. Fences cannot
4018
4018
/// be used to establish synchronization among non-atomic accesses in different threads. However,
4019
4019
/// thanks to the happens-before relationship between A and B, any non-atomic accesses that
4020
4020
/// happen-before A are now also properly synchronized with any non-atomic accesses that
0 commit comments