| name | 0.3.2-understand-reordering_freedom_privilege |
| description | [0.3.2] A relaxed atomic operation imposes no constraints on the reordering of memory operations by either the compile |
understand-reordering_freedom_privilege
CALL NUMBER: deep_c11_memory_model.reordering_freedom_privilege : concurrency_synchronization_primitives_and_memor(2)
DEFINITION: A relaxed atomic operation imposes no constraints on the reordering of memory operations by either the compiler or the hardware; the operation may be reordered with any other operation including non-atomic and other atomic operations.
Invoke this skill to understand reordering_freedom_privilege down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP/SWI-Prolog consistency gate): every reference below resolves.
THE RELATIVE ROOT (the import cone, by lib)
from concurrency_synchronization_primitives_and_memor
- acquire_semantics (d1): Memory ordering semantics ensuring all subsequent loads/stores cannot be reordered before the acquire operation; used for lock acquisition, reading a flag after volatile write.
- release_semantics (d1): Memory ordering semantics ensuring all prior loads/stores cannot be reordered after the release operation; used for lock release, writing data before a volatile flag.
Projected from the concurrency synchronization primitives and memory models KB (155 concepts / 137 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.
(leaf — this is an actual skill.)
