Lines Matching refs:a
13 Write a message to memory and have another processor read it on
14 hardware that does not have a sequentially consistent memory model.
24 concurrently act on a memory location, or are using reads and writes
29 Modern hardware and compilers can reorder memory operations in a way
30 that preserves the order of a thread's operation from its viewpoint,
32 write a message and mark it as ready to ready as shown in the
68 order to the receiver (thus breaking condition a) or the receiver's
112 A write to a ``std::atomic`` value has *release* semantics, which
129 normally implemented such that acquisition of a lock has *acquire*
130 semantics and release of a lock has *release* semantics. Thus a
131 thread that acquires a lock on a mutex always sees any memory writes
132 done by another thread before it released a lock on that mutex.
147 keyword forces a write to happen immediately, it generally has no
158 Similarly, it is a mistake to assume that a processor cannot read the
159 target of a pointer before reading the pointer. A modern processor
161 lines. The target of a pointer may be in a cache line that has