Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Atomic ordering: extended total order memory_order_seq_cst for locks
52 views
Skip to first unread message
itaj sherman
May 28, 2012, 2:48:43 PM5/28/12
to
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...@vandevoorde.com ]
[ --- Please see the FAQ before posting. --- ]
[ FAQ: http://www.comeaucomputing.com/csc/faq.html ]
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...@vandevoorde.com ]
[ --- Please see the FAQ before posting. --- ]
[ FAQ: http://www.comeaucomputing.com/csc/faq.html ]
0 new messages