@scriptc/compiler 0.3.5 → 0.4.0

package/dist/backend/llvm/dense-array-loops.js

@@ -0,0 +1,162 @@
+/* Dense array loops: a versioned copy of an index loop over an array whose
+ * length the loop never changes.
+ *
+ * `for (let i = 0; i < a.length; i++) b[i] = a[i] * 2` reads its bound from
+ * `a`, and every element access at the counter normally tests the index
+ * against the array's hole-free prefix bound (`filled`, see
+ * dense-array-access.ts) before it touches the slot. When the loop provably
+ * never changes `a.length` (ir/array-length-stability.ts) and never moves or
+ * cuts the storage of the arrays it indexes, one test before the loop covers
+ * every pass: if `a.length` is at most each indexed array's `filled` bound,
+ * every counter value the loop can reach (at least 0, below `a.length`)
+ * names a present value in dense storage. The fast copy then reads and
+ * replaces those slots directly, which leaves LLVM a loop without
+ * per-element branches (vectorizable where the body allows it). The same
+ * test bounds `a.length` by 2^31 - 1, so the fast copy's counter is an int32.
+ * Arrays longer than that are sparse in practice (a dense one would need
+ * 16 GB of slots) and take the ordinary copy, as does every array with a
+ * hole, present undefined or sparse storage below `a.length`. */
+import { preservesArrayLength } from "../../ir/array-length-stability.js";
+import { everyExprChild, everyStmtChild } from "../../ir/traverse.js";
+import { SCR_ARR_FIELD } from "./common.js";
+export const INT32_MAX = 2147483647;
+/** The fast copy duplicates the loop; keep the duplicated code small. */
+const MAX_LOOP_NODES = 120;
+/** `length.length - c` (c an integer literal, 0 when absent). */
+function lengthOffset(e) {
+    let offset = 0;
+    if (e.kind === "bin" &&
+        e.op === "-" &&
+        e.right.kind === "numLit" &&
+        Number.isSafeInteger(e.right.value)) {
+        offset = e.right.value;
+        e = e.left;
+    }
+    return e.kind === "arrIntrinsic" &&
+        e.method === "length" &&
+        e.args.length === 0 &&
+        e.receiver.kind === "varRef" &&
+        e.receiver.type.kind === "array"
+        ? { receiver: e.receiver, offset }
+        : null;
+}
+/** The array bounding a counted loop's counter below its length: an
+ * ascending loop compared below `a.length - c`, or a descending one starting
+ * at `a.length - c` (c >= 1). */
+export function countedDenseShape(loop, counted) {
+    if (counted.range.min < 0)
+        return null;
+    if (counted.step > 0) {
+        const bound = lengthOffset(counted.limit);
+        if (!bound || bound.offset < (counted.inclusive ? 1 : 0))
+            return null;
+        return { counter: counted.localId, length: bound.receiver, range: counted.range };
+    }
+    // The start is evaluated once, before the loop; the counter only falls.
+    const start = lengthOffset(counted.start);
+    if (!start || start.offset < 1 || loop.init?.kind !== "varDecl")
+        return null;
+    return { counter: counted.localId, length: start.receiver, range: counted.range };
+}
+/** Match the fast copy of a loop of the given shape. `initialized` holds the
+ * bindings definitely assigned when the loop starts; `unaliased` the local
+ * arrays no other binding holds. */
+export function matchDenseArrayLoop(loop, shape, locals, unaliased, initialized) {
+    const { counter, length } = shape;
+    if (shape.range.min < 0 || !loop.cond)
+        return null;
+    let nodes = 0, nested = false;
+    const candidates = new Map();
+    // Arrays written, resized, or indexed other than at the counter by an
+    // element write.
+    const disturbed = new Set();
+    const access = (arr, index) => {
+        if (arr.kind === "varRef" && index.kind === "varRef" && index.localId === counter)
+            candidates.set(arr.localId, arr);
+    };
+    const expr = (e) => {
+        if (++nodes > MAX_LOOP_NODES)
+            return false;
+        if (e.kind === "assignExpr" || e.kind === "incDec")
+            disturbed.add(e.localId);
+        if (e.kind === "arrayGet")
+            access(e.arr, e.index);
+        if (e.kind === "arrIntrinsic") {
+            if (e.method === "getNumber" && e.args[0])
+                access(e.receiver, e.args[0]);
+            else if (e.method !== "length" && e.receiver.kind === "varRef")
+                disturbed.add(e.receiver.localId);
+        }
+        return everyExprChild(e, expr, stmt);
+    };
+    const stmt = (s) => {
+        if (++nodes > MAX_LOOP_NODES)
+            return false;
+        if (s.kind === "for" || s.kind === "while" || s.kind === "doWhile" || s.kind === "forOf")
+            nested = true;
+        if (s.kind === "assign" || s.kind === "varDecl")
+            disturbed.add(s.localId);
+        if (s.kind === "arraySet") {
+            access(s.arr, s.index);
+            if (s.arr.kind === "varRef" && (s.index.kind !== "varRef" || s.index.localId !== counter))
+                disturbed.add(s.arr.localId);
+        }
+        return everyStmtChild(s, expr, stmt);
+    };
+    if (!loop.body.every(stmt) || !expr(loop.cond) || nested)
+        return null;
+    if (!preservesArrayLength([loop.cond, ...loop.body], { receiver: length.localId, inRange: counter }, locals, unaliased))
+        return null;
+    const arrays = new Map();
+    for (const [id, ref] of candidates) {
+        const local = locals.get(id);
+        if (!local ||
+            local.type.kind !== "array" ||
+            local.boxed ||
+            local.tdz ||
+            disturbed.has(id) ||
+            (id !== length.localId && !initialized.has(id)))
+            continue;
+        arrays.set(id, ref);
+    }
+    if (arrays.size === 0)
+        return null;
+    return {
+        counter,
+        length,
+        arrays,
+        range: { min: shape.range.min, max: Math.min(shape.range.max, INT32_MAX - 1) },
+    };
+}
+/** The fast copy's entry test: the bounding length is at most 2^31 - 1 and
+ * at most every indexed array's hole-free prefix bound. */
+export function emitDenseLoopGuard(host, loop) {
+    const B = host.B;
+    const size = host.sizeType;
+    const header = (array, field) => {
+        const ptr = B.tmp();
+        B.line(`${ptr} = getelementptr inbounds %ScrArr, ptr ${array}, i32 0, i32 ${field}`);
+        host.markMemoryPointer(ptr, "array:header");
+        return ptr;
+    };
+    const receiver = host.emitStableReceiver(loop.length, []);
+    const lenPtr = header(receiver.name, 1), len = B.tmp(), small = B.tmp();
+    B.line(`${len} = load ${size}, ptr ${lenPtr}${host.fieldAliasAttachment(lenPtr)}${host.arrayLengthRange}`);
+    B.line(`${small} = icmp ule ${size} ${len}, ${INT32_MAX}`);
+    let valid = small;
+    for (const [id, ref] of loop.arrays) {
+        const array = id === loop.length.localId ? receiver : host.emitStableReceiver(ref, []);
+        const filledPtr = header(array.name, SCR_ARR_FIELD.filled), filled = B.tmp(), covered = B.tmp(), both = B.tmp();
+        B.line(`${filled} = load i32, ptr ${filledPtr}${host.fieldAliasAttachment(filledPtr)}`);
+        let bound = filled;
+        if (size === "i64") {
+            bound = B.tmp();
+            B.line(`${bound} = zext i32 ${filled} to i64`);
+        }
+        B.line(`${covered} = icmp ule ${size} ${len}, ${bound}`);
+        B.line(`${both} = and i1 ${valid}, ${covered}`);
+        valid = both;
+    }
+    return valid;
+}
+//# sourceMappingURL=dense-array-loops.js.map

package/dist/backend/llvm/dense-array-loops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dense-array-loops.js","sourceRoot":"","sources":["../../../src/backend/llvm/dense-array-loops.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;iEAiBiE;AAIjE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtE,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,MAAM,CAAC,MAAM,SAAS,GAAG,UAAU,CAAC;AAcpC,yEAAyE;AACzE,MAAM,cAAc,GAAG,GAAG,CAAC;AAW3B,iEAAiE;AACjE,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IACE,CAAC,CAAC,IAAI,KAAK,KAAK;QAChB,CAAC,CAAC,EAAE,KAAK,GAAG;QACZ,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ;QACzB,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;QACvB,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;IACb,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,KAAK,cAAc;QAC9B,CAAC,CAAC,MAAM,KAAK,QAAQ;QACrB,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QACnB,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;QAC5B,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO;QAChC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE;QAClC,CAAC,CAAC,IAAI,CAAC;AACX,CAAC;AAED;;iCAEiC;AACjC,MAAM,UAAU,iBAAiB,CAC/B,IAA8B,EAC9B,OAOC;IAED,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACtE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;IACpF,CAAC;IACD,wEAAwE;IACxE,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC7E,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;AACpF,CAAC;AAED;;oCAEoC;AACpC,MAAM,UAAU,mBAAmB,CACjC,IAA8B,EAC9B,KAAqB,EACrB,MAAoC,EACpC,SAA8B,EAC9B,WAAgC;IAEhC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAClC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,KAAK,GAAG,CAAC,EACX,MAAM,GAAG,KAAK,CAAC;IACjB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuC,CAAC;IAClE,sEAAsE;IACtE,iBAAiB;IACjB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,KAAa,EAAQ,EAAE;QAClD,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO;YAC/E,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,IAAI,EAAE,KAAK,GAAG,cAAc;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC7E,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;iBACpE,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;gBAC5D,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,IAAI,EAAE,KAAK,GAAG,cAAc;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YACtF,MAAM,GAAG,IAAI,CAAC;QAChB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC1E,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,OAAO,CAAC;gBACvF,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM;QAAE,OAAO,IAAI,CAAC;IACtE,IACE,CAAC,oBAAoB,CACnB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EACzB,EAAE,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,EAC9C,MAAM,EACN,SAAS,CACV;QAED,OAAO,IAAI,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC9D,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IACE,CAAC,KAAK;YACN,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO;YAC3B,KAAK,CAAC,KAAK;YACX,KAAK,CAAC,GAAG;YACT,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACjB,CAAC,EAAE,KAAK,MAAM,CAAC,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAE/C,SAAS;QACX,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO;QACL,OAAO;QACP,MAAM;QACN,MAAM;QACN,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED;2DAC2D;AAC3D,MAAM,UAAU,kBAAkB,CAAC,IAAwB,EAAE,IAAoB;IAC/E,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACjB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,KAAa,EAAU,EAAE;QACtD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,0CAA0C,KAAK,gBAAgB,KAAK,EAAE,CAAC,CAAC;QACrF,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;QAC5C,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EACrC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,EACb,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClB,CAAC,CAAC,IAAI,CACJ,GAAG,GAAG,WAAW,IAAI,SAAS,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,gBAAgB,EAAE,CACnG,CAAC;IACF,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,eAAe,IAAI,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC,CAAC;IAC3D,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACvF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,EACxD,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,EAChB,OAAO,GAAG,CAAC,CAAC,GAAG,EAAE,EACjB,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACjB,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,oBAAoB,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,KAAK,GAAG,MAAM,CAAC;QACnB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACnB,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAChB,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,eAAe,MAAM,SAAS,CAAC,CAAC;QACjD,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,eAAe,IAAI,IAAI,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC;QACzD,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,aAAa,KAAK,KAAK,OAAO,EAAE,CAAC,CAAC;QAChD,KAAK,GAAG,IAAI,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/backend/llvm/dense-array-loops.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/backend/llvm/dense-array-loops.test.js

@@ -0,0 +1,128 @@
+import { expect, test } from "vitest";
+import { BOOL, F64, arrayOf } from "../../ir/ir.js";
+import { countedDenseShape, matchDenseArrayLoop, } from "./dense-array-loops.js";
+const loc = { file: "dense-array-loops.ts", start: 0, end: 0 };
+const ARR = arrayOf(F64);
+const num = (value) => ({ kind: "numLit", value, type: F64, loc });
+const ref = (localId) => ({ kind: "varRef", localId, type: F64, loc });
+const arr = (localId) => ({
+    kind: "varRef",
+    localId,
+    type: ARR,
+    loc,
+});
+const method = (receiver, name, args = []) => ({
+    kind: "arrIntrinsic",
+    method: name,
+    receiver: arr(receiver),
+    args,
+    type: F64,
+    loc,
+});
+const read = (receiver, index = ref("i")) => method(receiver, "getNumber", [index]);
+const write = (receiver, value, index = ref("i")) => ({
+    kind: "arraySet",
+    arr: arr(receiver),
+    index,
+    value,
+    loc,
+});
+const locals = new Map([
+    ["i", { id: "i", name: "i", type: F64, mutable: true }],
+    ["a", { id: "a", name: "a", type: ARR, mutable: false }],
+    ["b", { id: "b", name: "b", type: ARR, mutable: true }],
+    ["c", { id: "c", name: "c", type: ARR, mutable: false }],
+]);
+/** for (let i = 0; i < a.length; i++) body */
+function loop(body) {
+    return {
+        kind: "for",
+        loc,
+        init: { kind: "varDecl", localId: "i", init: num(0), loc },
+        cond: { kind: "bin", op: "<", left: ref("i"), right: method("a", "length"), type: BOOL, loc },
+        update: {
+            kind: "assign",
+            localId: "i",
+            value: { kind: "bin", op: "+", left: ref("i"), right: num(1), type: F64, loc },
+            loc,
+        },
+        body,
+    };
+}
+const shape = {
+    counter: "i",
+    length: arr("a"),
+    range: { min: 0, max: 4294967294 },
+};
+const match = (body, initialized = new Set(["a", "b"])) => matchDenseArrayLoop(loop(body), shape, locals, new Set(), initialized);
+test("arrays indexed at the counter of a length-preserving loop get an int32 fast copy", () => {
+    const scale = write("b", {
+        kind: "bin",
+        op: "*",
+        left: read("a"),
+        right: num(2),
+        type: F64,
+        loc,
+    });
+    const dense = match([scale]);
+    expect([...dense.arrays.keys()].sort()).toEqual(["a", "b"]);
+    expect(dense.range).toEqual({ min: 0, max: 2147483646 });
+    // A binding not definitely assigned before the loop is not read by the guard.
+    expect([...match([scale], new Set()).arrays.keys()]).toEqual(["a"]);
+});
+test("loops that may resize, rebind or move storage keep the ordinary copy only", () => {
+    expect(match([{ kind: "exprStmt", expr: method("a", "push", [num(1)]), loc }])).toBeNull();
+    expect(match([write("a", num(0), ref("unknown"))])).toBeNull();
+    expect(match([
+        { kind: "exprStmt", expr: { kind: "call", callee: "f", args: [], type: F64, loc }, loc },
+    ])).toBeNull();
+    // A nested loop would be duplicated too.
+    expect(match([{ kind: "exprStmt", expr: read("a"), loc }, loop([])])).toBeNull();
+    // No access at the counter: nothing to prove.
+    expect(match([{ kind: "exprStmt", expr: read("a", num(0)), loc }])).toBeNull();
+    // Copying the bounding array into another binding lets it escape.
+    expect(match([
+        { kind: "exprStmt", expr: read("a"), loc },
+        { kind: "assign", localId: "b", value: arr("a"), loc },
+    ])).toBeNull();
+    // A rebound array is not covered, but the bounding array still is.
+    const rebound = match([
+        { kind: "exprStmt", expr: read("b"), loc },
+        { kind: "exprStmt", expr: read("a"), loc },
+        { kind: "assign", localId: "b", value: arr("c"), loc },
+    ]);
+    expect([...rebound.arrays.keys()]).toEqual(["a"]);
+});
+test("counted shapes need a non-negative counter strictly below the length", () => {
+    const ascending = (limit, inclusive, min = 0) => countedDenseShape(loop([]), {
+        localId: "i",
+        start: num(min),
+        limit,
+        step: 1,
+        inclusive,
+        range: { min, max: 100 },
+    });
+    const minus = (offset) => ({
+        kind: "bin",
+        op: "-",
+        left: method("a", "length"),
+        right: num(offset),
+        type: F64,
+        loc,
+    });
+    expect(ascending(method("a", "length"), false)?.length.localId).toBe("a");
+    expect(ascending(minus(1), true)?.length.localId).toBe("a");
+    expect(ascending(method("a", "length"), true)).toBeNull();
+    expect(ascending(minus(1), false, -1)).toBeNull();
+    const descending = (offset) => countedDenseShape(loop([]), {
+        localId: "i",
+        start: minus(offset),
+        limit: num(0),
+        step: -1,
+        inclusive: true,
+        range: { min: 0, max: 100 },
+    });
+    expect(descending(1)?.length.localId).toBe("a");
+    expect(descending(0)).toBeNull();
+});
+//# sourceMappingURL=dense-array-loops.test.js.map

package/dist/backend/llvm/dense-array-loops.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dense-array-loops.test.js","sourceRoot":"","sources":["../../../src/backend/llvm/dense-array-loops.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAA0C,MAAM,gBAAgB,CAAC;AAC5F,OAAO,EACL,iBAAiB,EACjB,mBAAmB,GAEpB,MAAM,wBAAwB,CAAC;AAEhC,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC/D,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;AACzB,MAAM,GAAG,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AACnF,MAAM,GAAG,GAAG,CAAC,OAAe,EAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AACvF,MAAM,GAAG,GAAG,CAAC,OAAe,EAA+B,EAAE,CAAC,CAAC;IAC7D,IAAI,EAAE,QAAQ;IACd,OAAO;IACP,IAAI,EAAE,GAAG;IACT,GAAG;CACJ,CAAC,CAAC;AACH,MAAM,MAAM,GAAG,CACb,QAAgB,EAChB,IAAyD,EACzD,IAAI,GAAa,EAAE,EACX,EAAE,CAAC,CAAC;IACZ,IAAI,EAAE,cAAc;IACpB,MAAM,EAAE,IAAI;IACZ,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC;IACvB,IAAI;IACJ,IAAI,EAAE,GAAG;IACT,GAAG;CACJ,CAAC,CAAC;AACH,MAAM,IAAI,GAAG,CAAC,QAAgB,EAAE,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AACpG,MAAM,KAAK,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAU,EAAE,CAAC,CAAC;IAC5E,IAAI,EAAE,UAAU;IAChB,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC;IAClB,KAAK;IACL,KAAK;IACL,GAAG;CACJ,CAAC,CAAC;AACH,MAAM,MAAM,GAAG,IAAI,GAAG,CAAkB;IACtC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACvD,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACxD,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACvD,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;CACzD,CAAC,CAAC;AAEH,8CAA8C;AAC9C,SAAS,IAAI,CAAC,IAAc;IAC1B,OAAO;QACL,IAAI,EAAE,KAAK;QACX,GAAG;QACH,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE;QAC1D,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE;QAC7F,MAAM,EAAE;YACN,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,GAAG;YACZ,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;YAC9E,GAAG;SACJ;QACD,IAAI;KACL,CAAC;AACJ,CAAC;AACD,MAAM,KAAK,GAAmB;IAC5B,OAAO,EAAE,GAAG;IACZ,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;IAChB,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE;CACnC,CAAC;AACF,MAAM,KAAK,GAAG,CAAC,IAAc,EAAE,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAClE,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,WAAW,CAAC,CAAC;AAEzE,IAAI,CAAC,kFAAkF,EAAE,GAAG,EAAE;IAC5F,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE;QACvB,IAAI,EAAE,KAAK;QACX,EAAE,EAAE,GAAG;QACP,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;QACf,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACb,IAAI,EAAE,GAAG;QACT,GAAG;KACJ,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,CAAC,GAAG,KAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,CAAC,KAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC;IAC1D,8EAA8E;IAC9E,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,EAAE,CAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACvE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2EAA2E,EAAE,GAAG,EAAE;IACrF,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3F,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC/D,MAAM,CACJ,KAAK,CAAC;QACJ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE;KACzF,CAAC,CACH,CAAC,QAAQ,EAAE,CAAC;IACb,yCAAyC;IACzC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjF,8CAA8C;IAC9C,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC/E,kEAAkE;IAClE,MAAM,CACJ,KAAK,CAAC;QACJ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;QAC1C,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;KACvD,CAAC,CACH,CAAC,QAAQ,EAAE,CAAC;IACb,mEAAmE;IACnE,MAAM,OAAO,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;QAC1C,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;QAC1C,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;KACvD,CAAC,CAAC;IACH,MAAM,CAAC,CAAC,GAAG,OAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;IAChF,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,SAAkB,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,CAC/D,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAC1B,OAAO,EAAE,GAAG;QACZ,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC;QACf,KAAK;QACL,IAAI,EAAE,CAAC;QACP,SAAS;QACT,KAAK,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;KACzB,CAAC,CAAC;IACL,MAAM,KAAK,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,CAAC;QACzC,IAAI,EAAE,KAAK;QACX,EAAE,EAAE,GAAG;QACP,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC;QAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC;QAClB,IAAI,EAAE,GAAG;QACT,GAAG;KACJ,CAAC,CAAC;IACH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC1D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClD,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,EAAE,CACpC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAC1B,OAAO,EAAE,GAAG;QACZ,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC;QACpB,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACb,IAAI,EAAE,CAAC,CAAC;QACR,SAAS,EAAE,IAAI;QACf,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;KAC5B,CAAC,CAAC;IACL,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AACnC,CAAC,CAAC,CAAC"}

package/dist/backend/llvm/dyn-handle-tags.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/backend/llvm/dyn-handle-tags.test.js

@@ -0,0 +1,38 @@
+import { readFileSync } from "node:fs";
+import { expect, test } from "vitest";
+import { DYN_HANDLE_KINDS } from "../../ir/ir.js";
+import { DYN_HANDLE_TAG_NUM } from "./dyn.js";
+// SCR_DYNH_TAGS in scr_dyn.h lists the ScrDynHandleTag values by name, each
+// with an explicit value, so changes that add tags edit different lines. The
+// header itself fails to compile on a duplicate or out-of-range value; these
+// checks report the same problems by name and keep the backend's numbers in
+// step.
+const header = readFileSync(new URL("../../../../runtime/src/scr_dyn.h", import.meta.url), "utf8");
+const body = /#define SCR_DYNH_TAGS\(X\) \\\n([\s\S]*?)\n\n/.exec(header)[1];
+const tags = [...body.matchAll(/^\s*X\(([A-Z0-9_]+), (\d+)\)/gm)].map(([, name, value]) => ({
+    name: `SCR_DYNH_${name}`,
+    value: Number(value),
+}));
+const capacity = Number(/#define SCR_DYNH_CAPACITY (\d+)/.exec(header)[1]);
+test("every ScrDynHandleTag has an explicit value, in name order", () => {
+    const lines = body.split("\n").filter((line) => line.trim().startsWith("X("));
+    expect(tags.length).toBe(lines.length);
+    expect(tags.map((tag) => tag.name)).toEqual(tags.map((tag) => tag.name).toSorted());
+});
+test("ScrDynHandleTag values are unique and below SCR_DYNH_CAPACITY", () => {
+    const owners = new Map();
+    for (const { name, value } of tags) {
+        expect(owners.get(value), `${name} = ${value}`).toBeUndefined();
+        owners.set(value, name);
+        expect(value, name).toBeLessThan(capacity);
+    }
+});
+test("the backend's handle tag numbers match scr_dyn.h", () => {
+    const values = new Map(tags.map((tag) => [tag.name, tag.value]));
+    for (const [kind, num] of Object.entries(DYN_HANDLE_TAG_NUM)) {
+        const tag = DYN_HANDLE_KINDS.get(kind)?.tag;
+        expect(tag, kind).toBeDefined();
+        expect(values.get(tag), `${kind} (${tag})`).toBe(num);
+    }
+});
+//# sourceMappingURL=dyn-handle-tags.test.js.map

package/dist/backend/llvm/dyn-handle-tags.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dyn-handle-tags.test.js","sourceRoot":"","sources":["../../../src/backend/llvm/dyn-handle-tags.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAE9C,4EAA4E;AAC5E,6EAA6E;AAC7E,6EAA6E;AAC7E,4EAA4E;AAC5E,QAAQ;AACR,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,GAAG,CAAC,mCAAmC,EAAE,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AACnG,MAAM,IAAI,GAAG,+CAA+C,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC,CAAE,CAAC;AAC/E,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,gCAAgC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1F,IAAI,EAAE,YAAY,IAAK,EAAE;IACzB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC;CACrB,CAAC,CAAC,CAAC;AACJ,MAAM,QAAQ,GAAG,MAAM,CAAC,iCAAiC,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAE5E,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;IACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9E,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;AACtF,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,+DAA+D,EAAE,GAAG,EAAE;IACzE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,MAAM,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAI,CAAC,EAAE,GAAG,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzD,CAAC;AACH,CAAC,CAAC,CAAC"}

package/dist/backend/llvm/dyn.d.ts

@@ -6,6 +6,9 @@ import type { LlStreamTypedRefAdapter } from "./expr-context.js";
  * identity. Every other shape, tuples included, copies its fields into a
  * fresh checked-dynamic value. */
 export declare function recordDynKeepsIdentity(shape: IrRecordShape): boolean;
+/** ScrDynKind values (scr_runtime.h). */
+/** ScrDynHandleTag values (scr_dyn.h's explicit values; dyn-handle-tags.test.ts checks them). */
+export declare const DYN_HANDLE_TAG_NUM: Record<string, number>;
 export declare const DYN_KIND: {
     readonly NULL: 0;
     readonly BOOL: 1;
@@ -38,6 +41,8 @@ export interface DynHost extends WalkerHost {
     /** The shared adapter record: live array capsules read its `arrayOps`, so a
      * narrower return type would hand the native compiler a copy without it. */
     liveDynRefAdapter(t: IrType): LlStreamTypedRefAdapter;
+    /** See moduleUsesDynBuiltinStream. */
+    usesDynBuiltinStream?(): boolean;
     liveDynUnionRefAdapter(t: IrType & {
         kind: "union";
     }): string;
@@ -169,16 +174,35 @@ export declare class LlDyn {
     private readonly jsonSchemas;
     private readonly jsonParsers;
     private readonly recordNameTables;
+    /** Some emitted helper can keep a record's undeclared source: a checked
+     * record builder that notes it, or a JSON schema of a closed record
+     * (alloc.ts RECORD_SOURCES_GATE). */
+    keepsRecordSources: boolean;
     /** Targets the one-pass parser (scr_json_parse_schema) can build
-     * directly: number, boolean and string leaves inside arrays and plain
-     * records (no tuple, index signature, internal '%' slot or `__proto__`
-     * member; 1..64 fields). Everything else keeps the checked-dynamic
-     * route alone. */
+     * directly: number, boolean and string leaves inside arrays and records
+     * (no tuple, internal '%' slot or `__proto__` member; at most 64 declared
+     * fields, and at least one unless an index signature collects the
+     * members), record members typed as unions of those leaves, records and
+     * arrays, null and undefined (optional and nullable members; see
+     * jsonUnionSupported), and index signatures whose value type is not a
+     * union. Everything else keeps the checked-dynamic route alone. */
     private jsonSchemaSupported;
+    /** A union record member the one-pass parser writes directly: every arm
+     * a number, boolean, string, null, undefined, or a supported record or
+     * array, with at most one record and one array arm and no discriminant.
+     * Each JSON value kind then selects at most one arm, so the checked
+     * route's first full match is that arm, and a value that arm rejects
+     * fails every arm. */
+    private jsonUnionSupported;
     /** The ScrJsonSchema constant for t (scr_runtime.h layout). Records list
      * fields in declaration order — the order JSON.stringify writes — so the
      * runtime's next-field guess usually matches without a scan. */
     private jsonSchema;
+    /** The ScrJsonUnion descriptor of a union member (scr_json.h layout):
+     * its slot representation, the arm each JSON value kind selects, and the
+     * values the runtime stores for null and for a missing member. Boxed
+     * unions build their boxes through `<name>_box`. */
+    private jsonUnionSchema;
     /** The declared-name tables scr_record_source_note scans: parallel
      * constant arrays of field-name bytes and byte lengths in declaration
      * order (the order the record serializes), interned per shape. Internal