refactor(compiler)!: migrate SDK to minimal storage ISA
Replace retired guards and publication opcodes with SDK checks, neutral TRAP and sequential List/Linked mutations with explicit failure phases. Preserve snapshot cursors and import schema 2 metadata with the delivered provider pin. Include common/source/installed conformance, debug and release evidence, synchronized specs and the consolidated lesson. Runtime checkout remains unchanged.
This commit is contained in:
@@ -204,10 +204,14 @@ The [Program Registry contract](../specs/runtime/02c-program-registry-and-pbx-v0
|
||||
See the [random contract](../specs/runtime/02e-vm-owned-random-core.md) for Random BuiltinId 0x0016, ObjectKind tag 9, intrinsics 0x4000–0x4003, atomic state mutation, bounded 4+8*N costs and rejection-limit trap 0x00000015. Random is managed by the VM heap and existing GC, without host entropy or PBX changes.
|
||||
|
||||
|
||||
## Atomic publication of multiple Struct instances
|
||||
## Typed array range copy
|
||||
|
||||
FIELDS_PUBLISH (0xAB) atomically publishes complete typed fields to multiple
|
||||
source-selected Struct destinations. Its schema is an ordinary Registry Struct;
|
||||
no new category, request object, syscall or safepoint is introduced. Exact nullable
|
||||
destination rules, stack effects, validation, costs and commit semantics are in the
|
||||
[canonical instruction contract](../specs/runtime/02-vm-instruction-set.md#atomic-publication-of-multiple-struct-instances).
|
||||
ARRAY_COPY (0xA9) copies complete groups between exact typed arrays with strict
|
||||
physical ranges and pre-attempt overlap semantics. Preparation reserves scratch
|
||||
before infallible commit; failures preserve operands/destinations and retain
|
||||
charged work. No callbacks, GC or scheduling occur inside the instruction.
|
||||
The [instruction contract](../specs/runtime/02-vm-instruction-set.md#typed-array-range-copy)
|
||||
defines encoding, fault order and early cost selection. ARRAY_LEN remains the
|
||||
physical query; producer algorithms own logical limits and multi-owner invariants.
|
||||
There is no transactional sequence of stores. Encodings 0xA7/0xA8/0xAA/0xAB are
|
||||
unsupported, including in dead code.
|
||||
|
||||
Reference in New Issue
Block a user