Prohibiting “out of thin air” results in C

We argued in WG21/N3710 that the current attempt prohibit out-of-thin-air results
in 7.17.3p13 is both insufficient, in that it leaves it largely impossible to reason
about programs with memory_order_relaxed, and seriously harmful, in
that it arguably disallows all reasonable implementations of memory_order_relaxed
on architectures like ARM and POWER. This proposal attempts to address the latter
"seriously harmful" part for C, without addressing the "insufficient" part, possibly
along the lines of N3710.

This proposal thus eliminates some amount of complicated standardese that we actually
want vendors like ARM and IBM to ignore.

There is no consensus in WG21/SG1 for a more extensive proposal, such as that in
N3710, at this time (i.e. in time for C++14).

Proposed wording for 7.17.3

This removes the current badly formulated requirement, and instead promotes the existing
note discouraging "out-of-thin-air" results to normative encouragment.

The core problem here is that we do not know (after 10 years of failed attempts,
originally in a Java context) how to precisely state this requirement without strengthening
it so that it impacts code performance. (See N3710 for details.) Thus it remains
of little use to anyone trying to formulate a precise correctness argument. It is
roughly analogous to our current statements about progress guarantees, which are
also phrased as normative encouragement, in large part because they would be extremely
difficult to make precise while remaining implementable.

Proposed wording

Change 7.17.3p13 as follows:

An atomic store shall only store a value that has been computed from constants
and program input values by a finite sequence of program evaluations, such that
each evaluation observes the values of variables as computed by the last prior assignment
in the sequence.256) The ordering of evaluations in this sequence shall
be such that

If an evaluation B observes a value computed by A in
a different thread, then B does not happen before A.

If an evaluation A is included in the sequence, then all evaluations
that assign to the same variable and happen before A are also included.

Recommended practice

Implementations should ensure that no “out-of-thin-air” values are
computed that circularly depend on their own computation.

Change 7.17.3p14 as follows:

NOTE 3 The second requirement disallows “out-of-thin-air”, or “speculative”
stores of atomics when relaxed atomics are used. Since unordered operations are
involved, evaluations may appear in this sequence out of thread order. For example,
with x and y initially zero,

is not allowed toshould not produce r1 == 42 &&
r2 == 42, since the store of 42 to y is only possible
if the store to x stores 42, which circularly depends on the store
to y storing 42. Note that without this restriction, such an execution
is possible.since there is no sequence of evaluations that results in the
computation of 42. In the absence of “relaxed” operations and read-modify-write
operations with weaker than memory_order_acq_rel ordering, the second
requirement has no impact.

Change 7.17.3p15 as follows:

Recommended practice

The requirements do not forbidrecommendation similarly disallowsr1 == 42 && r2 == 42 in the following example, with x and y
again initially zero: