On Fri, 21 Nov 2025 01:23:17 GMT, David Holmes <[email protected]> wrote:
> > we follow the classic Dekker pattern for the required synchronization. > > My understanding is that Dekker requires a "full fence" between the accesses, > not just ordering memory barriers. The two variables involved must be > published to all readers for the algorithm to work. > No need to argue too much about this one because `StoreLoad` is implemented as a full fence so we can easily change it, but from reading the definitions in `OrderAccess` my understanding was that technically it should be enough. The `StoreStore` comment clarifies the meaning of word `completes` (used later in `StoreLoad`) as `the effect on memory of Store1 is made visible to other processors`. ------------- PR Comment: https://git.openjdk.org/jdk/pull/28361#issuecomment-3577347289
