Topic: Atomic ordering: extended total order memory_order_seq_cst for locks
Author: itaj sherman <itajsherman@gmail.com>
Date: Mon, 28 May 2012 11:48:43 -0700 (PDT)
Raw View
There's this note in 29.3-p3: [ Note: Although it is not explicitly
required that S include locks, it can always be extended to an order
that does include lock and unlock operations, since the ordering
between those is already included in the "happens before" ordering. -
end note ]
What does it mean by "always"?
I can understand that any certain implementation can be designed to
support such an extended S. But in some general implementation that
wasn't designed for it, I don't see that S can be extended so.
thanks
itaj
--
[ comp.std.c++ is moderated. To submit articles, try posting with your ]
[ newsreader. If that fails, use mailto:std-cpp-submit@vandevoorde.com ]
[ --- Please see the FAQ before posting. --- ]
[ FAQ: http://www.comeaucomputing.com/csc/faq.html ]