ISO/IEC JTC1 SC22 WG21 P2066R0
Authors: Michael L. Scott
Reply to: Jens Maurer <>
Target audience: SG1, EWG

P2066R0: Suggested draft TS for C++ Extensions for Transaction Memory Light


This paper presents suggested wording for a future Technical Specification on a lighter variant of Transactional Memory. See P1875R0 "Transactional Memory Lite Support in C++" for discussion.


Thanks to Hans Boehm, Victor Luchangco, Michael Spear, and Michael Wong.

Wording changes

In 5.11 [lex.key], add atomic to table 5 [tab:lex:key].

Change in [intro.races] paragraph 6:

Atomic blocks as well as Certain certain library calls may synchronize with other atomic blocks and library calls performed by another thread.
Add a new paragraph after [intro.races] paragraph 20:
The start and the end of each atomic block (8.8 [stmt.tx]) is a full-expression (6.9.1 [intro.execution]). An atomic block that is not dynamically nested within another atomic block is called an outer block. [Note: Due to syntactic constraints, blocks cannot overlap unless one is nested within the other.] There is a global total order of execution for all outer blocks. If, in that total order, a transaction T1 is ordered before a transaction T2,
Two actions are potentially concurrent if ...
Change in [intro.races] paragraph 21:
... [Note: It can be shown that programs that correctly use mutexes, atomic blocks, and memory_order::seq_cst operations to prevent all data races and use no other synchronization operations behave as if the operations executed by their constituent threads were simply interleaved, with each value computation of an object being taken from the last side effect on that object in that interleaving. This is normally referred to as "sequential consistency". ...
Add a new paragraph after [intro.races] paragraph 21:
[ Note: The following holds for a data-race-free program: If the start of an atomic block T is sequenced before an evaluation A, A is sequenced before the end of T, and A strongly happens before some evaluation B, then the end of T strongly happens before B. If an evaluation C strongly happens before that evaluation A, then C strongly happens before the start of T. These properties in turn imply that in any simple interleaved (sequentially consistent) execution, the operations of each atomic block appear to be contiguous in the interleaving. -- end note ]
Add a production to the grammar in 8.1 [expr.pre]:
      attribute-specifier-seqopt expression-statement
      attribute-specifier-seqopt compound-statement
      attribute-specifier-seqopt selection-statement
      attribute-specifier-seqopt iteration-statement
      attribute-specifier-seqopt jump-statement
      attribute-specifier-seqopt try-block
Add a new subclause before 8.8 [stmt.dcl]:
8.8 Atomic statement [stmt.tx]

     atomic compound-statement
An atomic statement is also called an atomic block.

The start of the atomic block is immediately before the opening { of the compound-statement. The end of the atomic block is immediately after the closing } of the compound-statement. [ Note: Thus, variables with automatic storage duration declared in the compound-statement are destroyed prior to reaching the end of the atomic block; see 8.7 [stmt.jump]. -- end note ]

If the execution of an atomic block evaluates any of the following, the behavior is implementation-defined:

[ Note: Locking a mutex, accessing an atomic variable, or performing I/O invokes non-constexpr functions. ] [ Note: The implementation may define that the behavior is undefined in some or all of the cases above. ]

A goto or switch statement shall not be used to transfer control into an atomic block.

[ Example:

int f()
  static int i = 0;
  atomic {
    return i;
Each invocation of f (even when called from several threads simultaneously) retrieves a unique value (ignoring overflow). -- end example ]