@scriptc/compiler 0.4.4 → 0.4.5

package/dist/backend/llvm/record-union-keys.test.js

@@ -0,0 +1,161 @@
+import { mkdtemp, readFile, rm, writeFile } from "node:fs/promises";
+import { tmpdir } from "node:os";
+import { join } from "node:path";
+import { expect, test } from "vitest";
+import { compile, deserializeModule } from "../../index.js";
+import { BOOL, F64, VOID } from "../../ir/ir.js";
+import { validateModule } from "../../ir/validate.js";
+import { emitLlvmModule } from "./emitter.js";
+const loc = { file: "record-union-keys.ts", start: 0, end: 0 };
+async function llvmFor(source) {
+    const dir = await mkdtemp(join(tmpdir(), "scriptc-record-union-keys-"));
+    try {
+        const entry = join(dir, "main.ts"), output = join(dir, "main.ir.json");
+        await writeFile(entry, source);
+        const result = await compile(entry, {
+            outDir: dir,
+            outPath: output,
+            outputKind: "ir",
+        });
+        if (!result.ok)
+            throw new Error(result.diagnostics.map((item) => `${item.code}: ${item.message}`).join("\n"));
+        const module = deserializeModule(await readFile(output, "utf8"));
+        expect(validateModule(module)).toEqual([]);
+        return emitLlvmModule(module);
+    }
+    finally {
+        await rm(dir, { recursive: true, force: true });
+    }
+}
+function body(ir, name) {
+    const found = new RegExp(`^define internal [^\\n]*@${name}(?:\\.i32)?\\([^]*?^}`, "m").exec(ir);
+    expect(found, name).not.toBeNull();
+    return found[0];
+}
+test("Sets and Maps of record unions key the record pointer", async () => {
+    const ir = await llvmFor(`
+type Num = { kind: "num"; value: number };
+type Neg = { kind: "neg"; operand: Node };
+type Add = { kind: "add"; left: Node; right: Node };
+type Node = Num | Neg | Add;
+const one: Node = { kind: "num", value: 1 };
+const nodes: Node[] = [one, { kind: "neg", operand: one }, { kind: "add", left: one, right: one }];
+const seen = new Set<Node>();
+const depth = new Map<Node, number>();
+for (const node of nodes) {
+  seen.add(node);
+  depth.set(node, node.kind === "num" ? 0 : 1);
+}
+console.log(seen.size, depth.get(nodes[1]!), seen.has({ kind: "num", value: 1 }));
+`);
+    // SCR_MAP_KEY_REF (2), never SCR_MAP_KEY_UNION_REF (3), and no union box.
+    expect(ir).toMatch(/call ptr @scr_map_new\(i32 2,/);
+    expect(ir).not.toMatch(/call ptr @scr_map_new\(i32 3,/);
+    expect(ir).not.toMatch(/call ptr @scr_union_new_ref/);
+});
+const recordType = (shapeId) => ({ kind: "record", shapeId });
+const wide = { kind: "union", unionId: "wide" };
+/** `pick(u)` answers whether `u` holds arm 0, 2 or 3 of a five-record union
+ * through an `||` chain of tag tests; `same` is a second union over the same
+ * records in another order. */
+function tagChainModule() {
+    const u = { kind: "varRef", localId: "u", type: wide, loc };
+    const isTag = (tag) => ({
+        kind: "unionIsTag",
+        unionId: "wide",
+        tag,
+        negated: false,
+        value: u,
+        type: BOOL,
+        loc,
+    });
+    const or = (left, right) => ({
+        kind: "logical",
+        op: "||",
+        left,
+        right,
+        type: BOOL,
+        loc,
+    });
+    const shapes = ["a", "b", "c", "d", "e"];
+    return {
+        irVersion: 17,
+        sourceFile: loc.file,
+        entry: "main",
+        records: shapes.map((id) => ({ id, fields: [{ name: id, type: F64 }] })),
+        unions: [
+            { id: "wide", arms: shapes.map(recordType) },
+            { id: "same", arms: [...shapes].reverse().map(recordType) },
+        ],
+        functions: [
+            {
+                name: "main",
+                params: [],
+                returnType: VOID,
+                locals: [],
+                body: [],
+                loc,
+            },
+            {
+                name: "pick",
+                params: [{ localId: "u", name: "u", type: wide }],
+                returnType: BOOL,
+                locals: [{ id: "u", name: "u", type: wide, mutable: false }],
+                body: [{ kind: "return", value: or(or(isTag(0), isTag(2)), isTag(3)), loc }],
+                loc,
+            },
+            {
+                name: "keep",
+                params: [{ localId: "s", name: "s", type: { kind: "union", unionId: "same" } }],
+                returnType: VOID,
+                locals: [
+                    {
+                        id: "s",
+                        name: "s",
+                        type: { kind: "union", unionId: "same" },
+                        mutable: false,
+                    },
+                ],
+                body: [],
+                loc,
+            },
+        ],
+    };
+}
+test("an || chain of tag tests is one switch on the shape word", () => {
+    const mod = tagChainModule();
+    expect(validateModule(mod)).toEqual([]);
+    const ir = emitLlvmModule(mod, { pointerBits: 64 });
+    const pick = body(ir, "sc_bf_pick");
+    const switches = pick.match(/switch i32 [^\n]*/g) ?? [];
+    expect(switches).toHaveLength(1);
+    expect(switches[0].match(/label %tags\.y/g)).toHaveLength(3);
+    expect(pick).not.toMatch(/@sc_stag\./);
+});
+test("unions over the same records share one release", () => {
+    const ir = emitLlvmModule(tagChainModule(), { pointerBits: 64 });
+    expect(ir.match(/^define internal void @sc_srelease\.[^\n]*noinline/gm)).toHaveLength(1);
+    expect(ir).toMatch(/^define internal void @sc_srelease\.wide\(/m);
+    expect(ir).not.toMatch(/^define internal void @sc_srelease\.same\(/m);
+});
+test("a union with a freezable arm compares its count without the frozen bit", async () => {
+    const ir = await llvmFor(`
+type Name = { kind: "name"; text: string };
+type Count = { kind: "count"; value: number };
+type Key = Name | Count;
+function name(text: string): Key {
+  const built: Name = { kind: "name", text };
+  return Object.freeze(built);
+}
+const seen = new Set<Key>();
+seen.add(name("a"));
+seen.add({ kind: "count", value: 1 });
+console.log(seen.size);
+`);
+    const release = /^define internal void @sc_srelease\.[^\n]*\n[^]*?^}/m.exec(ir);
+    expect(release).not.toBeNull();
+    // SCR_RC_FROZEN is bit 62: a frozen record's last reference has count 1.
+    expect(release[0]).toContain("and i64 %rc, -4611686018427387905");
+    expect(release[0]).toContain("icmp ult i64 %rcm2, -4611686018427387907");
+});
+//# sourceMappingURL=record-union-keys.test.js.map

package/dist/backend/llvm/record-union-keys.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"record-union-keys.test.js","sourceRoot":"","sources":["../../../src/backend/llvm/record-union-keys.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACpE,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAA2C,MAAM,gBAAgB,CAAC;AAC1F,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9C,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAE/D,KAAK,UAAU,OAAO,CAAC,MAAc;IACnC,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,4BAA4B,CAAC,CAAC,CAAC;IACxE,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,EAChC,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;QACrC,MAAM,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE;YAClC,MAAM,EAAE,GAAG;YACX,OAAO,EAAE,MAAM;YACf,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,IAAI,CAAC,MAAM,CAAC,EAAE;YACZ,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAChG,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3C,OAAO,cAAc,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;YAAS,CAAC;QACT,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;AACH,CAAC;AAED,SAAS,IAAI,CAAC,EAAU,EAAE,IAAY;IACpC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,4BAA4B,IAAI,uBAAuB,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChG,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACnC,OAAO,KAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,IAAI,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;IACvE,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC;;;;;;;;;;;;;;CAc1B,CAAC,CAAC;IACD,0EAA0E;IAC1E,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,+BAA+B,CAAC,CAAC;IACpD,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,+BAA+B,CAAC,CAAC;IACxD,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,6BAA6B,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,CAAC,OAAe,EAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;AAC9E,MAAM,IAAI,GAAW,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAExD;;+BAE+B;AAC/B,SAAS,cAAc;IACrB,MAAM,CAAC,GAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IACpE,MAAM,KAAK,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,CAAC;QACtC,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,MAAM;QACf,GAAG;QACH,OAAO,EAAE,KAAK;QACd,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,IAAI;QACV,GAAG;KACJ,CAAC,CAAC;IACH,MAAM,EAAE,GAAG,CAAC,IAAY,EAAE,KAAa,EAAU,EAAE,CAAC,CAAC;QACnD,IAAI,EAAE,SAAS;QACf,EAAE,EAAE,IAAI;QACR,IAAI;QACJ,KAAK;QACL,IAAI,EAAE,IAAI;QACV,GAAG;KACJ,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACzC,OAAO;QACL,SAAS,EAAE,EAAE;QACb,UAAU,EAAE,GAAG,CAAC,IAAI;QACpB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACxE,MAAM,EAAE;YACN,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;YAC5C,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;SAC5D;QACD,SAAS,EAAE;YACT;gBACE,IAAI,EAAE,MAAM;gBACZ,MAAM,EAAE,EAAE;gBACV,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,EAAE;gBACV,IAAI,EAAE,EAAE;gBACR,GAAG;aACJ;YACD;gBACE,IAAI,EAAE,MAAM;gBACZ,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;gBACjD,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;gBAC5D,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;gBAC5E,GAAG;aACJ;YACD;gBACE,IAAI,EAAE,MAAM;gBACZ,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;gBAC/E,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE;oBACN;wBACE,EAAE,EAAE,GAAG;wBACP,IAAI,EAAE,GAAG;wBACT,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;wBACxC,OAAO,EAAE,KAAK;qBACf;iBACF;gBACD,IAAI,EAAE,EAAE;gBACR,GAAG;aACJ;SACF;KACF,CAAC;AACJ,CAAC;AAED,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;IACpE,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC;IAC7B,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,EAAE,CAAC;IACxD,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;AACzC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;IAC1D,MAAM,EAAE,GAAG,cAAc,CAAC,cAAc,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;IACjE,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,sDAAsD,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACzF,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;IAClE,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;AACxE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;IACxF,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC;;;;;;;;;;;;CAY1B,CAAC,CAAC;IACD,MAAM,OAAO,GAAG,sDAAsD,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,yEAAyE;IACzE,MAAM,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,mCAAmC,CAAC,CAAC;IACnE,MAAM,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,0CAA0C,CAAC,CAAC;AAC5E,CAAC,CAAC,CAAC"}

package/dist/backend/llvm/serialized-ir-emission.test.js

@@ -39,6 +39,8 @@ test("sort-heavy programs emit equal LLVM from memory and from serialized IR", a
                     pointerBits: 64,
                     wasi: false,
                     runtimeAbiMarker: false,
+                    // compile() emits Linux textual LLVM with the unwinding ABI.
+                    unwindAbi: process.platform === "linux",
                     objectAudit: sanitize,
                     ...inlineRcOption(options.optimization, sanitize),
                 });

package/dist/backend/llvm/serialized-ir-emission.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"serialized-ir-emission.test.js","sourceRoot":"","sources":["../../../src/backend/llvm/serialized-ir-emission.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAEpD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;AAEzD,6EAA6E;AAC7E,2EAA2E;AAC3E,8EAA8E;AAC9E,4EAA4E;AAC5E,+DAA+D;AAC/D,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;IACxF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC;QACH,KAAK,MAAM,QAAQ,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI;gBACjB,oBAAoB;gBACpB,4BAA4B;gBAC5B,2BAA2B;aAC5B,EAAE,CAAC;gBACF,MAAM,KAAK,GAAG,GAAG,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;gBAC/C,MAAM,OAAO,GAAG;oBACd,MAAM,EAAE,SAAS;oBACjB,OAAO,EAAE,MAAe;oBACxB,YAAY,EAAE,SAAkB;oBAChC,QAAQ;iBACT,CAAC;gBACF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;gBAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,UAAU,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;gBACzF,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClC,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnF,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChC,MAAM,OAAO,GAAG,oBAAoB,CAAC,iBAAiB,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE;oBACpF,YAAY,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;oBACjD,WAAW,EAAE,EAAE;oBACf,IAAI,EAAE,KAAK;oBACX,gBAAgB,EAAE,KAAK;oBACvB,WAAW,EAAE,QAAQ;oBACrB,GAAG,cAAc,CAAC,OAAO,CAAC,YAAY,EAAE,QAAQ,CAAC;iBAClD,CAAC,CAAC;gBACH,MAAM,IAAI,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtE,MAAM,CAAC,IAAI,KAAK,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,MAAM,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC,EAAE,OAAO,CAAC,CAAC"}
+{"version":3,"file":"serialized-ir-emission.test.js","sourceRoot":"","sources":["../../../src/backend/llvm/serialized-ir-emission.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAEpD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;AAEzD,6EAA6E;AAC7E,2EAA2E;AAC3E,8EAA8E;AAC9E,4EAA4E;AAC5E,+DAA+D;AAC/D,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;IACxF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC;QACH,KAAK,MAAM,QAAQ,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI;gBACjB,oBAAoB;gBACpB,4BAA4B;gBAC5B,2BAA2B;aAC5B,EAAE,CAAC;gBACF,MAAM,KAAK,GAAG,GAAG,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;gBAC/C,MAAM,OAAO,GAAG;oBACd,MAAM,EAAE,SAAS;oBACjB,OAAO,EAAE,MAAe;oBACxB,YAAY,EAAE,SAAkB;oBAChC,QAAQ;iBACT,CAAC;gBACF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;gBAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,UAAU,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;gBACzF,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClC,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnF,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChC,MAAM,OAAO,GAAG,oBAAoB,CAAC,iBAAiB,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE;oBACpF,YAAY,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;oBACjD,WAAW,EAAE,EAAE;oBACf,IAAI,EAAE,KAAK;oBACX,gBAAgB,EAAE,KAAK;oBACvB,6DAA6D;oBAC7D,SAAS,EAAE,OAAO,CAAC,QAAQ,KAAK,OAAO;oBACvC,WAAW,EAAE,QAAQ;oBACrB,GAAG,cAAc,CAAC,OAAO,CAAC,YAAY,EAAE,QAAQ,CAAC;iBAClD,CAAC,CAAC;gBACH,MAAM,IAAI,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtE,MAAM,CAAC,IAAI,KAAK,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,MAAM,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC,EAAE,OAAO,CAAC,CAAC"}

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

@@ -165,11 +165,10 @@ interface InlineRcFamily {
  * scr_dyn_release_survivor for kinds whose candidacy is per value,
  * including arrays and objects of intact documents (ScrDynRegion).
  *
- * Releases stay plain calls for:
- * - arr: array releases are the most numerous release sites and the
- *   least hot (at most 1% self time across the benchmark suite), and
- *   inlining them roughly doubled the code growth for no measured speedup.
- *   Array retains are inlined. */
+ * The array release inlines the decrement of an array that stays alive
+ * and is not headered (`a->cyc`): those are most array releases in
+ * type-checker workloads, where scr_arr_release's own prologue and checks
+ * took about half of its time. */
 export declare const INLINE_RC_FAMILIES: Readonly<Record<string, InlineRcFamily>>;
 type RcOp = "retain" | "release";
 /** The mirrored family for an RC operation on a runtime stem (`scr_str`),

package/dist/backend/llvm/shapes.js

@@ -83,7 +83,7 @@ export { computeTraced } from "../cycle-analysis.js";
 export function vAdapters(host, t) {
     const nullable = host.nullableUnions.of(t);
     if (nullable?.repr === "shapes")
-        return shapeUnionRc(nullable);
+        return shapeUnionRc(host, nullable);
     if (nullable) {
         const arm = vAdapters(host, nullable.arm);
         return { retain: nullableRetainSym(host, nullable.arm), release: arm.release };
@@ -140,7 +140,7 @@ export function retainSym(host, t) {
         return jsvalRcSym(host, "retain");
     const nullable = host.nullableUnions.of(t);
     if (nullable?.repr === "shapes")
-        return shapeUnionRc(nullable).retain;
+        return shapeUnionRc(host, nullable).retain;
     if (nullable)
         return nullableRetainSym(host, nullable.arm);
     const stem = runtimeRcStem(t);
@@ -156,10 +156,10 @@ export function retainSym(host, t) {
 /** A shape union's RC entry points: every record retain is the same
  * NULL- and immortal-skipping increment (the null sentinel is immortal),
  * so the first arm's serves; release dispatches on the arm. */
-function shapeUnionRc(union) {
+function shapeUnionRc(host, union) {
     return {
         retain: `@${mangleRecordRetain(union.arms[0].shapeId)}`,
-        release: shapeReleaseFn(union.unionId),
+        release: shapeReleaseFn(host.nullableUnions.helperOwner(union.unionId)),
     };
 }
 /** The tag, release and trace helpers of every shape union
@@ -179,19 +179,55 @@ export function emitShapeUnionHelpers(host) {
         if (union.nullTag >= 0)
             out.push(`  %isnullarm = icmp eq ptr %u, ${NULLABLE_NULL}`, `  br i1 %isnullarm, label %nullarm, label %rec`, `nullarm:`, `  ret i32 ${union.nullTag}`, `rec:`);
         out.push(`  %wp = getelementptr inbounds ${header}, ptr %u, i32 0, i32 ${SHAPE_WORD_INDEX}`, `  %w = load i32, ptr %wp`, `  switch i32 %w, label %bad [ ${cases} ]`, ...union.arms.flatMap((arm) => [`a${arm.tag}:`, `  ret i32 ${arm.tag}`]), `bad:`, `  ret i32 -1`, `}`, ``);
-        // release: unit encodings are NULL or immortal; each arm releases
-        // through its own (NULL- and immortal-tolerant) helper.
-        out.push(`define internal void ${shapeReleaseFn(union.unionId)}(ptr %u) ${FN_ATTRS} { ; shape union release`, `entry:`, `  %t = call i32 ${tagFn}(ptr %u)`, `  switch i32 %t, label %done [ ${union.arms.map((arm) => `i32 ${arm.tag}, label %a${arm.tag}`).join(" ")} ]`, ...union.arms.flatMap((arm) => [
-            `a${arm.tag}:`,
-            `  call void @${mangleRecordRelease(arm.shapeId)}(ptr %u)`,
-            `  br label %done`,
-        ]), `done:`, `  ret void`, `}`, ``);
+        // Release and trace: one definition for the unions over the same
+        // record arms (helperOwner). Unit encodings are NULL or the immortal
+        // null sentinel; the shape word picks the arm.
+        if (host.nullableUnions.helperOwner(union.unionId) !== union.unionId)
+            continue;
+        const units = [
+            `  %isnull = icmp eq ptr %o, null`,
+            `  br i1 %isnull, label %done, label %${host.nullableUnions.usesNullSentinel ? "notnull" : "rec"}`,
+            ...(host.nullableUnions.usesNullSentinel
+                ? [
+                    `notnull:`,
+                    `  %isnullarm = icmp eq ptr %o, ${NULLABLE_NULL}`,
+                    `  br i1 %isnullarm, label %done, label %rec`,
+                ]
+                : []),
+            `rec:`,
+        ];
+        const armSwitch = (call) => [
+            `  %wp = getelementptr inbounds ${header}, ptr %o, i32 0, i32 ${SHAPE_WORD_INDEX}`,
+            `  %w = load i32, ptr %wp`,
+            `  switch i32 %w, label %done [ ${union.arms.map((arm) => `i32 ${host.nullableUnions.shapeNumber(arm.shapeId)}, label %a${arm.tag}`).join(" ")} ]`,
+            ...union.arms.flatMap((arm) => [`a${arm.tag}:`, call(arm.shapeId), `  br label %done`]),
+            `done:`,
+            `  ret void`,
+            `}`,
+            ``,
+        ];
+        // Every record arm shares the release fast path (the count at the same
+        // offset, one collector header choice for the whole union), so only a
+        // release that may free dispatches on the arm. The release stays a call:
+        // inlined at every release site, it grows code more than it saves.
+        const traced = union.arms.map((arm) => host.tracedShapes.has(`record:${arm.shapeId}`));
+        // A freezable arm's count is the word without its frozen bit, as in
+        // releaseFastPath: a frozen record's last reference takes the slow path.
+        const frozen = union.arms.some((arm) => host.recordsById.get(arm.shapeId)?.freezable === true);
+        const notFrozen = ~recordFrozenBit(S);
+        const release = shapeReleaseFn(union.unionId);
+        if (traced.every((t) => t === traced[0]))
+            out.push(`define internal void ${release}(ptr %o) noinline ${FN_ATTRS} { ; shape union release`, `entry:`, ...units, `  %rc = load ${S}, ptr %o`, ...(frozen
+                ? [
+                    `  %refs = and ${S} %rc, ${sizeLiteral(S, notFrozen)}`,
+                    `  %rcm2 = sub ${S} %refs, 2`,
+                    `  %shared = icmp ult ${S} %rcm2, ${sizeLiteral(S, notFrozen - 2n)}`,
+                ]
+                : [`  %rcm2 = sub ${S} %rc, 2`, `  %shared = icmp ult ${S} %rcm2, -3`]), `  br i1 %shared, label %dec, label %slow`, `dec:`, `  %n = sub ${S} %rc, 1`, `  store ${S} %n, ptr %o`, ...(traced[0] ? cycleRootLines(host, "done") : [`  br label %done`]), `slow:`, `  %imm = icmp eq ${S} %rc, -1`, `  br i1 %imm, label %done, label %free`, `free:`, ...armSwitch((shapeId) => `  call void @${mangleRecordRelease(shapeId)}_slow(ptr %o)`));
+        else
+            out.push(`define internal void ${release}(ptr %o) ${FN_ATTRS} { ; shape union release`, `entry:`, ...units, ...armSwitch((shapeId) => `  call void @${mangleRecordRelease(shapeId)}(ptr %o)`));
         if (shapeUnionTraced(host, union))
-            out.push(`define internal void ${shapeTraceFn(union.unionId)}(ptr %u, ptr %visit, ptr %ctx) ${FN_ATTRS} { ; shape union trace`, `entry:`, `  %t = call i32 ${tagFn}(ptr %u)`, `  switch i32 %t, label %done [ ${union.arms.map((arm) => `i32 ${arm.tag}, label %a${arm.tag}`).join(" ")} ]`, ...union.arms.flatMap((arm) => [
-                `a${arm.tag}:`,
-                `  call void @${mangleRecordTrace(arm.shapeId)}(ptr %u, ptr %visit, ptr %ctx)`,
-                `  br label %done`,
-            ]), `done:`, `  ret void`, `}`, ``);
+            out.push(`define internal void ${shapeTraceFn(union.unionId)}(ptr %o, ptr %visit, ptr %ctx) ${FN_ATTRS} { ; shape union trace`, `entry:`, ...units, ...armSwitch((shapeId) => `  call void @${mangleRecordTrace(shapeId)}(ptr %o, ptr %visit, ptr %ctx)`));
     }
     return out;
 }
@@ -229,7 +265,7 @@ export function releaseSym(host, t) {
         return jsvalRcSym(host, "release");
     const nullable = host.nullableUnions.of(t);
     if (nullable?.repr === "shapes")
-        return shapeUnionRc(nullable).release;
+        return shapeUnionRc(host, nullable).release;
     if (nullable)
         return releaseSym(host, nullable.arm);
     const stem = runtimeRcStem(t);
@@ -326,17 +362,16 @@ function jsvalRcHelper(host, op, attrs) {
  * scr_dyn_release_survivor for kinds whose candidacy is per value,
  * including arrays and objects of intact documents (ScrDynRegion).
  *
- * Releases stay plain calls for:
- * - arr: array releases are the most numerous release sites and the
- *   least hot (at most 1% self time across the benchmark suite), and
- *   inlining them roughly doubled the code growth for no measured speedup.
- *   Array retains are inlined. */
+ * The array release inlines the decrement of an array that stays alive
+ * and is not headered (`a->cyc`): those are most array releases in
+ * type-checker workloads, where scr_arr_release's own prologue and checks
+ * took about half of its time. */
 export const INLINE_RC_FAMILIES = {
     str: { cycle: "none", retainNull: false, release: "scr_str_release" },
     bytes: { cycle: "none", retainNull: false, release: "scr_bytes_release" },
     regex: { cycle: "none", retainNull: false, release: "scr_regex_release" },
     bigint: { cycle: "none", retainNull: true, release: "scr_bigint_release" },
-    arr: { cycle: "arr", retainNull: false, release: null },
+    arr: { cycle: "arr", retainNull: false, release: "scr_arr_release" },
     map: { cycle: "map", retainNull: false, release: "scr_map_release" },
     union: { cycle: "always", retainNull: false, release: "scr_union_release" },
     closure: { cycle: "always", retainNull: false, release: "scr_closure_release" },
@@ -442,25 +477,27 @@ export const INLINE_STR_RELEASES_PER_FUNCTION = 8;
  * module, given as parts joined by newlines. A function can span parts
  * (main's lines) and a part can hold several functions. */
 export function limitInlineReleases(parts, mode) {
-    const dyn = limitInlineReleaseFamily(parts, "dyn", INLINE_DYN_RELEASES_PER_FUNCTION);
-    return mode === "release"
-        ? limitInlineReleaseFamily(dyn, "str", INLINE_STR_RELEASES_PER_FUNCTION)
-        : dyn;
-}
-function limitInlineReleaseFamily(parts, family, max) {
-    const call = `call void @${inlineRcName(family, "release")}(`;
-    const runtime = `call void @${INLINE_RC_FAMILIES[family].release}(`;
+    const families = mode === "release" ? ["dyn", "str"] : ["dyn"];
+    const limits = families.map((family) => family === "dyn" ? INLINE_DYN_RELEASES_PER_FUNCTION : INLINE_STR_RELEASES_PER_FUNCTION);
+    const calls = families.map((family) => `${inlineRcName(family, "release")}(`);
+    const runtimes = families.map((family) => `call void @${INLINE_RC_FAMILIES[family].release}(`);
+    const head = "call void @";
+    const prefix = `${head}${inlineRcName("", "release")}`;
     // The function each release site belongs to: the last `define` line
-    // before it, counted over the joined text.
+    // before it, counted over the joined text. One walk over each part finds
+    // the sites of every family.
     const sites = (part, each, first) => {
         let fn = first;
         let define = part.startsWith("define ") ? 0 : part.indexOf("\ndefine ");
-        for (let at = part.indexOf(call); at >= 0; at = part.indexOf(call, at + call.length)) {
+        for (let at = part.indexOf(prefix); at >= 0; at = part.indexOf(prefix, at + prefix.length)) {
+            const family = calls.findIndex((call) => part.startsWith(call, at + head.length));
+            if (family < 0)
+                continue;
             while (define >= 0 && define < at) {
                 fn++;
                 define = part.indexOf("\ndefine ", define + 1);
             }
-            each(at, fn);
+            each(at, family, fn);
         }
         while (define >= 0) {
             fn++;
@@ -468,29 +505,43 @@ function limitInlineReleaseFamily(parts, family, max) {
         }
         return fn;
     };
-    const counts = new Map();
+    const counts = families.map(() => new Map());
+    // The functions each part's sites can belong to.
+    const spans = [];
     let fn = 0;
-    for (const part of parts)
-        fn = sites(part, (_, f) => counts.set(f, (counts.get(f) ?? 0) + 1), fn);
-    const over = new Set([...counts].filter(([, n]) => n > max).map(([f]) => f));
-    if (over.size === 0)
+    for (const part of parts) {
+        spans.push(fn);
+        fn = sites(part, (_, family, f) => counts[family].set(f, (counts[family].get(f) ?? 0) + 1), fn);
+        spans.push(fn);
+    }
+    const over = counts.map((count, family) => new Set([...count].filter(([, n]) => n > limits[family]).map(([f]) => f)));
+    if (over.every((set) => set.size === 0))
         return [...parts];
-    fn = 0;
-    return parts.map((part) => {
+    const anyOver = new Set(over.flatMap((set) => [...set]));
+    const touches = (from, to) => {
+        for (let f = from; f <= to; f++)
+            if (anyOver.has(f))
+                return true;
+        return false;
+    };
+    return parts.map((part, index) => {
+        const from = spans[2 * index];
+        if (!touches(from, spans[2 * index + 1]))
+            return part;
         const cuts = [];
-        fn = sites(part, (at, f) => {
-            if (over.has(f))
-                cuts.push(at);
-        }, fn);
+        sites(part, (at, family, f) => {
+            if (over[family].has(f))
+                cuts.push({ at, family });
+        }, from);
         if (cuts.length === 0)
             return part;
         let out = "";
-        let from = 0;
-        for (const at of cuts) {
-            out += part.slice(from, at) + runtime;
-            from = at + call.length;
+        let next = 0;
+        for (const cut of cuts) {
+            out += part.slice(next, cut.at) + runtimes[cut.family];
+            next = cut.at + head.length + calls[cut.family].length;
         }
-        return out + part.slice(from);
+        return out + part.slice(next);
     });
 }
 function rcHelperDecls(family, op) {
@@ -706,7 +757,9 @@ export function traceAdapter(host, t) {
         case "union": {
             const nullable = host.nullableUnions.get(t.unionId);
             if (nullable?.repr === "shapes")
-                return shapeUnionTraced(host, nullable) ? shapeTraceFn(nullable.unionId) : null;
+                return shapeUnionTraced(host, nullable)
+                    ? shapeTraceFn(host.nullableUnions.helperOwner(nullable.unionId))
+                    : null;
             if (nullable)
                 return traceAdapter(host, nullable.arm);
             if (!host.tracedUnions.has(t.unionId))