c++11 atomic ordering: extended total order memory_order_seq_cst for locks

Posted by itaj on Stack Overflow See other posts from Stack Overflow or by itaj
Published on 2012-06-03T09:52:00Z Indexed on 2012/06/03 10:40 UTC
Read the original article Hit count: 212

Filed under:
|
|
|

There's this note in c++11 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.

I had sent this question to comp.std.c++ but got no answers there. http://groups.google.com/group/comp.std.c++/browse_frm/thread/5242fa70d0594d1b#

© Stack Overflow or respective owner

Related posts about c++

Related posts about multithreading