This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: should sync builtins be full optimization barriers?
On Sep 12, 2011, at 19:19, Andrew MacLeod wrote:
> lets say the order of the writes turns out to be 2,4... is it possible for both writes to be travelling around some bus and have thread 4 actually read the second one first, followed by the first one? It would imply a lack of memory coherency in the system wouldn't it? My simple understanding is that the hardware gives us this sort of minimum guarantee on all shared memory. which means we should never see that happen.
According to section 8.2.3.5 "Intra-Processor Forwarding Is Allowed" of "Intel 64 and IA-32 Architectures Software Developer's Manual" volume 3A, December 2009, a processor can see its own store happening before another's, though the example works on two different memory locations. If at least one of the threads reading the values was on the same processor as one of the writing threads, perhaps it could see the locally-issued store first, unless thread-switching is presumed to include a memory fence. Consistency of order is guaranteed *from the point of view of other processors* (8.2.3.7), which is not necessarily the case here. A total order across all processors is imposed for locked instructions (8.2.3.8), but I'm not sure whether their use is assumed here. I'm still reading up on caching protocols, write-back memory, etc. Still not sure either way whether the original example can work...
Ken