@adobe/ecs 0.0.0-stage → 0.1.0

package/dist/implementation/compiler/plugin.js

@@ -0,0 +1,225 @@
+/// <reference types="node" />
+import { readFileSync } from 'node:fs';
+import { readFile } from 'node:fs/promises';
+import { isAbsolute } from 'node:path';
+import { estreeOf } from './estree.js';
+import { describeFailure } from './failure.js';
+import { identify as identifyModule, moduleIdOf } from './identify.js';
+import { buildId, kernelHash, parseKernelId, serveUrl } from './kernel-id.js';
+import { createLinker } from './link.js';
+import { isNamespaceModule, isSystemModule, packageIndex } from './paths.js';
+import { locateThroughMap } from './source-map.js';
+import { transformKernels } from './transform.js';
+const scripts = /\.[cm]?[jt]sx?$/;
+const packageName = "@adobe/ecs";
+const loaders = { ts: "ts", mts: "ts", cts: "ts", tsx: "tsx", jsx: "jsx" };
+/** A file's code as JavaScript, with types stripped and lines mapped back to the source. */
+const loadFile = async (file) => {
+    const code = await readFile(file, "utf8");
+    const loader = loaders[file.slice(file.lastIndexOf(".") + 1)];
+    if (loader === undefined)
+        return { code };
+    const { transformWithOxc } = await import("vite");
+    const result = await transformWithOxc(code, file, { lang: loader, sourcemap: true });
+    return { code: result.code, locate: result.map === undefined ? undefined : locateThroughMap(result.code, result.map.mappings) };
+};
+/** The name each directory's package.json gives, read once per directory. */
+const packageNames = () => {
+    const names = new Map();
+    return directory => {
+        if (names.has(directory))
+            return names.get(directory);
+        let name;
+        try {
+            const json = JSON.parse(readFileSync(`${directory}/package.json`, "utf8"));
+            const named = typeof json === "object" && json !== null ? Reflect.get(json, "name") : undefined;
+            name = typeof named === "string" && named !== "" ? named : null;
+        }
+        catch {
+            // No package.json here, or none that parses.
+            name = undefined;
+        }
+        names.set(directory, name);
+        return name;
+    };
+};
+/** Resolves imports through the build, from whichever transform runs. */
+const buildHost = (resolver) => ({
+    resolve: async (specifier, importer) => {
+        const resolved = await resolver().resolve(specifier, importer, { skipSelf: true });
+        if (resolved === null)
+            return { error: `${specifier} can't be resolved from ${importer}` };
+        if (resolved.external) {
+            return specifier === packageName ? packageIndex : { error: `${specifier} is external to the build, so kernels can't inline from it`, unreadable: true };
+        }
+        const id = resolved.id.split("?")[0] ?? resolved.id;
+        return id.includes("\0") || !isAbsolute(id) ? { error: `${specifier} isn't a file` } : id;
+    },
+    load: loadFile,
+});
+/**
+ * Compiles kernel systems (`kernel: "cpu"` or `"gpu"`). Runs after TypeScript is stripped and before minification, so it sees plain JS
+ * with source names. Each kernel's `create` becomes its own module at `description.url`: served from a
+ * root-absolute url in dev, and emitted as a chunk in a build.
+ *
+ * Functions and constants kernels import are read from their files, with types stripped, and inlined (`link.ts`).
+ * The application's build compiles every kernel, its dependencies' too: a library ships its kernels uncompiled.
+ *
+ * Also gives each top-level `Symbol(...)` declaration an id, its package's name, its module's path in the package and
+ * its binding, by which the registry knows the symbol a module evaluated again makes as the same key, and in the same
+ * way the declaration of each top-level binding's system, rule or finalizer, as the same item (`identify.ts`).
+ *
+ * Dev dep pre-bundling bypasses plugins and breaks the runtime's worker url, so `@adobe/ecs` is excluded from it.
+ * Consumers must also add to `optimizeDeps.exclude` any dependency that defines kernels or keys, imports
+ * `@adobe/ecs`, or has functions kernels import; otherwise its kernels reach the runtime uncompiled, which fails
+ * at registration, its keys have no ids, or its functions can't be read.
+ *
+ * The plugin adds itself to worker bundles; an instance after the first in one bundle does nothing.
+ */
+/** Where a served kernel's url goes in node's code, until its module is compiled. */
+const inlinePlaceholder = (index, hash) => `@ecs-kernel-inline/${index}/${hash}`;
+/** Code with each kernel's placeholder replaced by its module as a `data:` url, which node imports on any thread. */
+const inlineKernels = (code, kernels, hashes) => kernels.reduce((inlined, source, index) => inlined.replaceAll(JSON.stringify(inlinePlaceholder(index, hashes[index] ?? "")), JSON.stringify(`data:text/javascript;base64,${Buffer.from(source).toString("base64")}`)), code);
+export const kernelPlugin = () => {
+    let serve = true;
+    let root = process.cwd();
+    /** Whether an earlier instance of the plugin is in the same bundle. */
+    let repeated = false;
+    let server;
+    const packageNameOf = packageNames();
+    /**
+     * A linker per environment, since client and SSR builds resolve imports under different conditions. Each resolves
+     * through its environment's latest transform.
+     */
+    const contexts = new Map();
+    const linkers = new Map();
+    const linkerFor = (ssr, context) => {
+        contexts.set(ssr, context);
+        const existing = linkers.get(ssr);
+        if (existing !== undefined)
+            return existing;
+        const linker = createLinker(buildHost(() => contexts.get(ssr) ?? context), input => estreeOf((contexts.get(ssr) ?? context).parse(input)));
+        linkers.set(ssr, linker);
+        return linker;
+    };
+    /** Modules whose kernels inline each file, and the files each module's kernels inline. */
+    const dependents = new Map();
+    const dependencies = new Map();
+    const depend = (parent, files) => {
+        for (const file of dependencies.get(parent) ?? [])
+            dependents.get(file)?.delete(parent);
+        dependencies.set(parent, files);
+        for (const file of files) {
+            const parents = dependents.get(file) ?? new Set();
+            parents.add(parent);
+            dependents.set(file, parents);
+        }
+    };
+    /** Kernel modules by parent module id, kept current as parents are transformed. */
+    const kernels = new Map();
+    /** Reference ids of the kernel chunks a build emitted. */
+    const chunks = new Set();
+    /**
+     * The bundler gives chunks emitted under one name one reference, so each kernel's name carries its hash. Its
+     * `create` is imported at run time, which the bundle can't see, so the chunk keeps its exports even where the
+     * build drops entries' signatures, as an application's does.
+     */
+    const emitChunk = (context, id, hash) => {
+        const referenceId = context.emitFile({ type: "chunk", id, name: `kernel-${hash}`, preserveSignature: "exports-only" });
+        chunks.add(referenceId);
+        return referenceId;
+    };
+    const plugin = {
+        name: `${packageName}/kernel`,
+        enforce: "post",
+        // Dep pre-bundling breaks the runtime's `new Worker(new URL("./worker.js", import.meta.url))`.
+        config: () => ({ optimizeDeps: { exclude: [packageName] }, worker: { plugins: () => [kernelPlugin()] } }),
+        configResolved: config => {
+            serve = config.command === "serve";
+            root = config.root;
+            repeated = config.plugins.find(other => other.name === plugin.name) !== plugin;
+        },
+        configureServer: devServer => {
+            server = devServer;
+        },
+        // A kernel chunk's url is relative to the chunk that references it, as Rollup resolves it, rather than to `base`
+        // as Vite resolves other files, so a build's kernels load wherever it's served from or run.
+        resolveFileUrl: {
+            order: "pre",
+            handler: ({ referenceId, relativePath }) => chunks.has(referenceId) ? `new URL(${JSON.stringify(relativePath)}, import.meta.url).href` : null,
+        },
+        resolveId: id => repeated || parseKernelId(id) === undefined ? null : id,
+        async load(id) {
+            if (repeated)
+                return null;
+            const kernel = parseKernelId(id);
+            if (kernel === undefined)
+                return null;
+            // Transforming the parent fills the cache: for a kernel requested first, or after a restart.
+            // In dev, `this.load` doesn't read files from disk, so the server's own pipeline does it.
+            if (!kernels.has(kernel.parent)) {
+                if (server)
+                    await server.transformRequest(kernel.parent);
+                else
+                    await this.load({ id: kernel.parent });
+            }
+            const cached = kernels.get(kernel.parent)?.[kernel.index];
+            if (cached === undefined)
+                return this.error(`no kernel ${kernel.index} in ${kernel.parent}`);
+            // A different version would pair the description's columns with another kernel's code.
+            if (kernel.hash !== undefined && kernel.hash !== cached.hash) {
+                return this.error(`kernel ${kernel.index} in ${kernel.parent} changed since its description was compiled; reload`);
+            }
+            return cached.source;
+        },
+        // Vite only soft-invalidates importers of a changed file, which doesn't transform them again, so kernels that
+        // inline from it are invalidated here.
+        watchChange(id, change) {
+            for (const linker of linkers.values())
+                linker.forget(id, change.event !== "update");
+            for (const parent of dependents.get(id) ?? []) {
+                for (const module of server?.moduleGraph.getModulesByFile(parent) ?? [])
+                    server?.moduleGraph.invalidateModule(module);
+            }
+        },
+        async transform(code, id, options) {
+            if (repeated || id.includes("\0") || !scripts.test(id.split("?")[0] ?? id))
+                return null;
+            const parse = (input) => estreeOf(this.parse(input));
+            const identify = (input) => identifyModule(input, moduleIdOf(id, root, packageNameOf), parse, async (source, namespace) => {
+                const resolved = await this.resolve(source, id);
+                return resolved !== null && (resolved.external ? source === packageName : isNamespaceModule(resolved.id, namespace));
+            });
+            const ssr = options?.ssr === true;
+            const linker = linkerFor(ssr, this);
+            const hashes = [];
+            const transformed = await transformKernels(code, id, parse, async (source) => {
+                const resolved = await this.resolve(source, id);
+                return resolved !== null && isSystemModule(resolved.id);
+            }, (index, identity) => {
+                const hash = kernelHash(identity);
+                hashes[index] = hash;
+                if (!serve)
+                    return `import.meta.ROLLUP_FILE_URL_${emitChunk(this, buildId(id, index), hash)}`;
+                // Served to node, a kernel's module is its url, so a pool's workers, which import it outside the server, read it too.
+                return JSON.stringify(ssr ? inlinePlaceholder(index, hash) : serveUrl(id, index, hash));
+            }, linker);
+            const result = ssr && transformed !== null && !("failure" in transformed) ? { ...transformed, code: inlineKernels(transformed.code, transformed.kernels, hashes) } : transformed;
+            const parent = id.split("?")[0] ?? id;
+            if (result === null) {
+                kernels.delete(id);
+                depend(parent, []);
+                return await identify(code);
+            }
+            for (const dependency of result.dependencies)
+                this.addWatchFile(dependency);
+            depend(parent, result.dependencies);
+            if ("failure" in result)
+                return this.error(describeFailure(result.failure), result.failure.position);
+            kernels.set(id, result.kernels.map((source, index) => ({ source, hash: hashes[index] ?? "" })));
+            return await identify(result.code) ?? { code: result.code, map: null };
+        },
+    };
+    return plugin;
+};
+//# sourceMappingURL=plugin.js.map

package/dist/implementation/compiler/plugin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin.js","sourceRoot":"","sources":["../../../src/implementation/compiler/plugin.ts"],"names":[],"mappings":"AAAA,8BAA8B;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEvC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,QAAQ,IAAI,cAAc,EAAE,UAAU,EAAsB,MAAM,eAAe,CAAC;AAC3F,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC9E,OAAO,EAAE,YAAY,EAA8B,MAAM,WAAW,CAAC;AACrE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAElD,MAAM,OAAO,GAAG,iBAAiB,CAAC;AAClC,MAAM,WAAW,GAAG,YAAY,CAAC;AAIjC,MAAM,OAAO,GAA2D,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AAEnI,4FAA4F;AAC5F,MAAM,QAAQ,GAAG,KAAK,EAAE,IAAY,EAA6F,EAAE;IAC/H,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1C,MAAM,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACrF,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AACpI,CAAC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,YAAY,GAAG,GAAkB,EAAE;IACrC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqC,CAAC;IAC3D,OAAO,SAAS,CAAC,EAAE;QACf,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACtD,IAAI,IAA+B,CAAC;QACpC,IAAI,CAAC;YACD,MAAM,IAAI,GAAY,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,SAAS,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC;YACpF,MAAM,KAAK,GAAY,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACzG,IAAI,GAAG,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QACpE,CAAC;QACD,MAAM,CAAC;YACH,6CAA6C;YAC7C,IAAI,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;AACN,CAAC,CAAC;AAEF,yEAAyE;AACzE,MAAM,SAAS,GAAG,CAAC,QAAoC,EAAY,EAAE,CAAC,CAAC;IACnE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE;QACnC,MAAM,QAAQ,GAAG,MAAM,QAAQ,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,EAAE,KAAK,EAAE,GAAG,SAAS,2BAA2B,QAAQ,EAAE,EAAE,CAAC;QAC3F,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACpB,OAAO,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,SAAS,4DAA4D,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC5J,CAAC;QACD,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;QACpD,OAAO,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,SAAS,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9F,CAAC;IACD,IAAI,EAAE,QAAQ;CACjB,CAAC,CAAC;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AACH,qFAAqF;AACrF,MAAM,iBAAiB,GAAG,CAAC,KAAa,EAAE,IAAY,EAAU,EAAE,CAAC,sBAAsB,KAAK,IAAI,IAAI,EAAE,CAAC;AAEzG,qHAAqH;AACrH,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,OAA0B,EAAE,MAAyB,EAAU,EAAE,CAClG,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CACzD,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,EAC7D,IAAI,CAAC,SAAS,CAAC,+BAA+B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC1F,EAAE,IAAI,CAAC,CAAC;AAEb,MAAM,CAAC,MAAM,YAAY,GAAG,GAAW,EAAE;IACrC,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;IACzB,uEAAuE;IACvE,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,MAAiC,CAAC;IACtC,MAAM,aAAa,GAAG,YAAY,EAAE,CAAC;IACrC;;;OAGG;IACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,MAAM,SAAS,GAAG,CAAC,GAAY,EAAE,OAA6B,EAAU,EAAE;QACtE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC5C,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3I,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACzB,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IACF,0FAA0F;IAC1F,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAA6B,CAAC;IAC1D,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,KAAwB,EAAQ,EAAE;QAC9D,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxF,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC1D,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAClC,CAAC;IACL,CAAC,CAAC;IACF,mFAAmF;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC3D,0DAA0D;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC;;;;OAIG;IACH,MAAM,SAAS,GAAG,CAAC,OAA6B,EAAE,EAAU,EAAE,IAAY,EAAU,EAAE;QAClF,MAAM,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,IAAI,EAAE,EAAE,iBAAiB,EAAE,cAAc,EAAE,CAAC,CAAC;QACvH,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACxB,OAAO,WAAW,CAAC;IACvB,CAAC,CAAC;IACF,MAAM,MAAM,GAAW;QACnB,IAAI,EAAE,GAAG,WAAW,SAAS;QAC7B,OAAO,EAAE,MAAM;QACf,+FAA+F;QAC/F,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,OAAO,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QACzG,cAAc,EAAE,MAAM,CAAC,EAAE;YACrB,KAAK,GAAG,MAAM,CAAC,OAAO,KAAK,OAAO,CAAC;YACnC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;QACnF,CAAC;QACD,eAAe,EAAE,SAAS,CAAC,EAAE;YACzB,MAAM,GAAG,SAAS,CAAC;QACvB,CAAC;QACD,iHAAiH;QACjH,4FAA4F;QAC5F,cAAc,EAAE;YACZ,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,yBAAyB,CAAC,CAAC,CAAC,IAAI;SAChJ;QACD,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,IAAI,aAAa,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;QACxE,KAAK,CAAC,IAAI,CAAC,EAAE;YACT,IAAI,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YACtC,6FAA6F;YAC7F,0FAA0F;YAC1F,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,IAAI,MAAM;oBAAE,MAAM,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;;oBACpD,MAAM,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAChD,CAAC;YACD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAC7F,uFAAuF;YACvF,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC3D,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,MAAM,qDAAqD,CAAC,CAAC;YACvH,CAAC;YACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACzB,CAAC;QACD,8GAA8G;QAC9G,uCAAuC;QACvC,WAAW,CAAC,EAAE,EAAE,MAAM;YAClB,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC;YACpF,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,WAAW,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE;oBAAE,MAAM,EAAE,WAAW,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAC1H,CAAC;QACL,CAAC;QACD,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO;YAC7B,IAAI,QAAQ,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACxF,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7D,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE;gBAC9H,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBAChD,OAAO,QAAQ,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;YACzH,CAAC,CAAC,CAAC;YACH,MAAM,GAAG,GAAG,OAAO,EAAE,GAAG,KAAK,IAAI,CAAC;YAClC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACpC,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,MAAM,WAAW,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAC,MAAM,EAAC,EAAE;gBACvE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBAChD,OAAO,QAAQ,KAAK,IAAI,IAAI,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC5D,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE;gBACnB,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBACrB,IAAI,CAAC,KAAK;oBAAE,OAAO,+BAA+B,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9F,sHAAsH;gBACtH,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YAC5F,CAAC,EAAE,MAAM,CAAC,CAAC;YACX,MAAM,MAAM,GAAG,GAAG,IAAI,WAAW,KAAK,IAAI,IAAI,CAAC,CAAC,SAAS,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;YACjL,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnB,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBACnB,OAAO,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;YACD,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,YAAY;gBAAE,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YAC5E,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC;YACpC,IAAI,SAAS,IAAI,MAAM;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACrG,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAChG,OAAO,MAAM,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC3E,CAAC;KACJ,CAAC;IACF,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC"}

package/dist/implementation/compiler/print.d.ts

@@ -0,0 +1,12 @@
+import type { Expression, Statement } from './ir.js';
+import { type Out } from './out.js';
+import type { Unit } from './unit.js';
+/** A number as JS source that reads back as the same f64. */
+export declare const printNumber: (value: number) => string;
+export declare const localName: (unit: Unit, local: number) => string;
+/** Prints an expression. `observed` converts boolean column reads. */
+export declare const printExpression: (unit: Unit, expression: Expression, observed: boolean) => string;
+type Labels = ReadonlyMap<number, "block" | "loop">;
+/** Prints statements as JS. */
+export declare const printStatements: (unit: Unit, statements: Out | readonly Statement[], labels?: Labels) => string;
+export {};

package/dist/implementation/compiler/print.js

@@ -0,0 +1,96 @@
+import { chunkShift } from '../world/kernel.js';
+import { resolve } from './out.js';
+import { rowLabel } from './statement.js';
+/** A number as JS source that reads back as the same f64. */
+export const printNumber = (value) => Number.isNaN(value) ? "NaN" : value === Infinity ? "Infinity" : Object.is(value, -0) ? "(-0)" : value < 0 ? `(${String(value)})` : String(value);
+const printPath = (path) => path.map(item => `[${JSON.stringify(item)}]`).join("");
+export const localName = (unit, local) => `${unit.names.get(local) ?? "t"}_${local}`;
+/** Prints an expression. `observed` converts boolean column reads. */
+export const printExpression = (unit, expression, observed) => {
+    const print = (item) => printExpression(unit, item, observed);
+    switch (expression.kind) {
+        case "number": return printNumber(expression.value);
+        case "boolean": return String(expression.value);
+        case "column": {
+            const column = expression.column;
+            if (!observed)
+                return `c${column}[x${column}]`;
+            unit.booleans.add(column);
+            return `(b${column} ? c${column}[x${column}] !== 0 : c${column}[x${column}])`;
+        }
+        case "upColumn": {
+            const column = expression.column;
+            const read = `u${column}[p * us${column} + uo${column}]`;
+            if (!observed)
+                return read;
+            unit.upBooleans.add(column);
+            return `(ub${column} ? ${read} !== 0 : ${read})`;
+        }
+        case "resource": return `r${expression.index}${printPath(expression.path)}`;
+        case "args": return `args${printPath(expression.path)}`;
+        case "local": return localName(unit, expression.local);
+        case "unary": return `(${expression.operator}${print(expression.operand)})`;
+        case "binary":
+        case "logical": return `(${print(expression.left)} ${expression.operator} ${print(expression.right)})`;
+        case "conditional": return `(${print(expression.test)} ? ${print(expression.consequent)} : ${print(expression.alternate)})`;
+        case "math": return `Math.${expression.name}(${expression.arguments.map(print).join(", ")})`;
+        case "observe": return printExpression(unit, expression.value, true);
+        case "lane": return print(expression.value);
+        // Lookups through indexes read through their reader, `l${lookup}`, and the handles each site holds.
+        case "listLength": return `l${expression.lookup}.length(${localName(unit, expression.list)})`;
+        case "listChanged": return `l${expression.lookup}.changed(${localName(unit, expression.list)})`;
+        case "rowLeaf": return `l${expression.lookup}.leaf(${localName(unit, expression.row)}, ${expression.leaf})`;
+        case "rowEntity": return `l${expression.lookup}.entity(${localName(unit, expression.row)})`;
+        case "rowFound": return `(${localName(unit, expression.row)}.f === 1 ? true : null)`;
+        case "nullish": return expression.value;
+        case "string": return JSON.stringify(expression.value);
+        case "element": return `${print(expression.object)}${expression.optional ? "?." : ""}[${print(expression.index)}]`;
+        case "array": return `[${expression.items.map(print).join(", ")}]`;
+        case "record": return `{ ${expression.fields.map(([name, item]) => `${JSON.stringify(name)}: ${print(item)}`).join(", ")} }`;
+    }
+};
+const printStatement = (unit, statement, labels) => {
+    const value = (item) => printExpression(unit, item, false);
+    const branch = (label) => `${labels.get(label) === "loop" ? "continue" : "break"} label_${label};`;
+    switch (statement.kind) {
+        case "set": {
+            const declare = statement.declare === undefined ? "" : `${statement.declare} `;
+            return `${declare}${localName(unit, statement.local)} = ${printExpression(unit, statement.value, unit.observed.has(statement.local))};`;
+        }
+        case "declare": return `let ${statement.locals.map(item => localName(unit, item)).join(", ")};`;
+        case "store": return `c${statement.column}[x${statement.column}] = ${value(statement.value)};`;
+        case "stamp": {
+            const row = `c${statement.column}[x${statement.column}] = tick;`;
+            return unit.stampedPerCall.has(statement.chunks) ? row : `${row}\nc${statement.chunks}[i >> ${chunkShift}] = tick;`;
+        }
+        case "if": {
+            const alternate = printStatements(unit, statement.alternate, labels);
+            return `if (${value(statement.test)}) {\n${printStatements(unit, statement.consequent, labels)}\n}${alternate === "" ? "" : ` else {\n${alternate}\n}`}`;
+        }
+        case "block":
+            return `label_${statement.label}: {\n${printStatements(unit, statement.body, new Map([...labels, [statement.label, "block"]]))}\n}`;
+        case "loop": {
+            // `for (;;)` repeats where a WASM loop falls off its end, so a trailing branch back is implicit, and otherwise the loop exits.
+            const body = resolve(statement.body);
+            const last = body[body.length - 1];
+            const repeats = last?.kind === "branch" && last.label === statement.label;
+            const inner = new Map([...labels, [statement.label, "loop"]]);
+            const printed = printStatements(unit, repeats ? body.slice(0, -1) : body, inner);
+            return `label_${statement.label}: for (;;) {\n${printed}${repeats ? "" : `\nbreak label_${statement.label};`}\n}`;
+        }
+        case "branch": return branch(statement.label);
+        case "branchIf": return `if (${value(statement.test)}) ${branch(statement.label)}`;
+        case "next": return `continue ${rowLabel};`;
+        case "intrinsic": return printStatements(unit, statement.body, labels);
+        case "lookup": return `const ${localName(unit, statement.local)} = l${statement.lookup}(${value(statement.entity)});`;
+        case "probe": return `l${statement.lookup}.probe(${[statement.probe, localName(unit, statement.list), localName(unit, statement.first), ...statement.values.map(value)].join(", ")});`;
+        case "listRow": return `l${statement.lookup}.row(${localName(unit, statement.row)}, ${localName(unit, statement.list)}, ${value(statement.index)});`;
+        case "spawn": return `const ${localName(unit, statement.local)} = spawn${statement.list}(${statement.values.map(value).join(", ")});`;
+        case "begin": return `commands.begin(${statement.command}, ${value(statement.entity)});`;
+        case "value": return `commands.value(${statement.key}, ${value(statement.value)});`;
+        case "component": return `commands.component(${statement.key});`;
+    }
+};
+/** Prints statements as JS. */
+export const printStatements = (unit, statements, labels = new Map()) => resolve([...statements]).map(statement => printStatement(unit, statement, labels)).join("\n");
+//# sourceMappingURL=print.js.map

package/dist/implementation/compiler/print.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"print.js","sourceRoot":"","sources":["../../../src/implementation/compiler/print.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAa,MAAM,oBAAoB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAY,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C,6DAA6D;AAC7D,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAU,EAAE,CACjD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAErJ,MAAM,SAAS,GAAG,CAAC,IAAU,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAEjG,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAU,EAAE,KAAa,EAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC;AAE3G,sEAAsE;AACtE,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,IAAU,EAAE,UAAsB,EAAE,QAAiB,EAAU,EAAE;IAC7F,MAAM,KAAK,GAAG,CAAC,IAAgB,EAAU,EAAE,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IAClF,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,QAAQ,CAAC,CAAC,OAAO,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpD,KAAK,SAAS,CAAC,CAAC,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;YACjC,IAAI,CAAC,QAAQ;gBAAE,OAAO,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO,KAAK,MAAM,OAAO,MAAM,KAAK,MAAM,cAAc,MAAM,KAAK,MAAM,IAAI,CAAC;QAClF,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,MAAM,UAAU,MAAM,QAAQ,MAAM,GAAG,CAAC;YACzD,IAAI,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,OAAO,MAAM,MAAM,MAAM,IAAI,YAAY,IAAI,GAAG,CAAC;QACrD,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,KAAK,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5E,KAAK,MAAM,CAAC,CAAC,OAAO,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACxD,KAAK,OAAO,CAAC,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACvD,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC;QAC5E,KAAK,QAAQ,CAAC;QAAC,KAAK,SAAS,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC;QACtH,KAAK,aAAa,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC;QAC5H,KAAK,MAAM,CAAC,CAAC,OAAO,QAAQ,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAC7F,KAAK,SAAS,CAAC,CAAC,OAAO,eAAe,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACrE,KAAK,MAAM,CAAC,CAAC,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5C,oGAAoG;QACpG,KAAK,YAAY,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,MAAM,WAAW,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC;QAC9F,KAAK,aAAa,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,MAAM,YAAY,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC;QAChG,KAAK,SAAS,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,MAAM,SAAS,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC;QAC5G,KAAK,WAAW,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,MAAM,WAAW,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;QAC5F,KAAK,UAAU,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,yBAAyB,CAAC;QACrF,KAAK,SAAS,CAAC,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC;QACxC,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvD,KAAK,SAAS,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC;QACnH,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACnE,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACjI,CAAC;AACL,CAAC,CAAC;AAIF,MAAM,cAAc,GAAG,CAAC,IAAU,EAAE,SAAoB,EAAE,MAAc,EAAU,EAAE;IAChF,MAAM,KAAK,GAAG,CAAC,IAAgB,EAAU,EAAE,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,UAAU,KAAK,GAAG,CAAC;IACnH,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,GAAG,CAAC;YAC/E,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;QAC5I,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,OAAO,OAAO,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAChG,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC;QAC/F,KAAK,OAAO,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,WAAW,CAAC;YACjE,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,SAAS,CAAC,MAAM,SAAS,UAAU,WAAW,CAAC;QACxH,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACR,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACrE,OAAO,OAAO,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,SAAS,KAAK,EAAE,CAAC;QAC7J,CAAC;QACD,KAAK,OAAO;YACR,OAAO,SAAS,SAAS,CAAC,KAAK,QAAQ,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxI,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,+HAA+H;YAC/H,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,EAAE,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,CAAC;YAC1E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,MAAe,CAAC,CAAC,CAAC,CAAC;YACvE,MAAM,OAAO,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjF,OAAO,SAAS,SAAS,CAAC,KAAK,iBAAiB,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACtH,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9C,KAAK,UAAU,CAAC,CAAC,OAAO,OAAO,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACnF,KAAK,MAAM,CAAC,CAAC,OAAO,YAAY,QAAQ,GAAG,CAAC;QAC5C,KAAK,WAAW,CAAC,CAAC,OAAO,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvE,KAAK,QAAQ,CAAC,CAAC,OAAO,SAAS,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;QACtH,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,MAAM,UAAU,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QACvL,KAAK,SAAS,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,MAAM,QAAQ,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;QACrJ,KAAK,OAAO,CAAC,CAAC,OAAO,SAAS,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,WAAW,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QACtI,KAAK,OAAO,CAAC,CAAC,OAAO,kBAAkB,SAAS,CAAC,OAAO,KAAK,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;QACzF,KAAK,OAAO,CAAC,CAAC,OAAO,kBAAkB,SAAS,CAAC,GAAG,KAAK,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;QACpF,KAAK,WAAW,CAAC,CAAC,OAAO,sBAAsB,SAAS,CAAC,GAAG,IAAI,CAAC;IACrE,CAAC;AACL,CAAC,CAAC;AAEF,+BAA+B;AAC/B,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,IAAU,EAAE,UAAsC,EAAE,SAAiB,IAAI,GAAG,EAAE,EAAU,EAAE,CACtH,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC"}

package/dist/implementation/compiler/program.d.ts

@@ -0,0 +1,10 @@
+import type { Program } from '../world/kernel.js';
+import type { Statement } from './ir.js';
+/**
+ * Derives a `Program` from the lowered body, or null if it uses what WASM kernels don't support. Locals are renumbered
+ * densely, branch labels become depths counting enclosing blocks and loops, and each lookup call site gets a handle.
+ * A lookup result may only be null-tested or read by a static leaf access; a non-optional access must be under a
+ * guard proving the lookup found its entity, since JS would throw where WASM reads NaN. With `nameOf`, the program
+ * carries each local's name.
+ */
+export declare const toProgram: (statements: readonly Statement[], nameOf?: (local: number) => string, accumulators?: readonly number[], upLocal?: number | null, listed?: boolean) => Program | null;

package/dist/implementation/compiler/program.js

@@ -0,0 +1,255 @@
+import { resolve } from './out.js';
+const all = (items, map) => {
+    const result = [];
+    for (const item of items) {
+        const mapped = map(item);
+        if (mapped === undefined)
+            return undefined;
+        result.push(mapped);
+    }
+    return result;
+};
+const unwrap = (node) => node.kind === "observe" ? unwrap(node.value) : node;
+const union = (a, b) => new Set([...a, ...b]);
+const none = new Set();
+/** The handle standing for `up`, which isn't looked up. */
+const upHandle = -1;
+/**
+ * Derives a `Program` from the lowered body, or null if it uses what WASM kernels don't support. Locals are renumbered
+ * densely, branch labels become depths counting enclosing blocks and loops, and each lookup call site gets a handle.
+ * A lookup result may only be null-tested or read by a static leaf access; a non-optional access must be under a
+ * guard proving the lookup found its entity, since JS would throw where WASM reads NaN. With `nameOf`, the program
+ * carries each local's name.
+ */
+export const toProgram = (statements, nameOf, accumulators = [], upLocal = null, listed = upLocal !== null) => {
+    const locals = new Map();
+    const localIndex = (local) => {
+        const existing = locals.get(local);
+        if (existing !== undefined)
+            return existing;
+        locals.set(local, locals.size);
+        return locals.size - 1;
+    };
+    /** Handles by the local holding a lookup result. */
+    const handles = new Map();
+    const handleOf = (node) => {
+        const inner = unwrap(node);
+        // A row a lookup through an index gave tests as found, as a lookup's result does.
+        if (inner.kind === "rowFound")
+            return handleFor(inner.row);
+        return inner.kind !== "local" ? undefined : inner.local === upLocal ? upHandle : handles.get(inner.local);
+    };
+    /** The handle of a local holding a lookup through an index's list or row, made at its first use. */
+    const handleFor = (local) => {
+        const existing = handles.get(local);
+        if (existing !== undefined)
+            return existing;
+        handles.set(local, handles.size);
+        return handles.size - 1;
+    };
+    /** Whether `handle` found its entity, or for `up`, whether the call's rows have a parent. */
+    const found = (handle) => handle === upHandle ? { kind: "upFound" } : { kind: "found", handle };
+    const isNull = (node) => {
+        const inner = unwrap(node);
+        return inner.kind === "nullish" && inner.value === "null";
+    };
+    /** `handle` and whether the test means "found", for `other !== null` and its variants. */
+    const nullTest = (node) => {
+        if (node.kind !== "binary" || !["===", "!==", "==", "!="].includes(node.operator))
+            return undefined;
+        const handle = isNull(node.right) ? handleOf(node.left) : isNull(node.left) ? handleOf(node.right) : undefined;
+        return handle === undefined ? undefined : { handle, found: node.operator === "!==" || node.operator === "!=" };
+    };
+    /** Handles a test proves found when it is `truthy`. */
+    const proves = (node, truthy) => {
+        const inner = unwrap(node);
+        const handle = handleOf(inner);
+        if (handle !== undefined)
+            return truthy ? new Set([handle]) : none;
+        const test = nullTest(inner);
+        if (test !== undefined)
+            return test.found === truthy ? new Set([test.handle]) : none;
+        if (inner.kind === "unary" && inner.operator === "!")
+            return proves(inner.operand, !truthy);
+        if (inner.kind === "logical" && inner.operator === (truthy ? "&&" : "||"))
+            return union(proves(inner.left, truthy), proves(inner.right, truthy));
+        return none;
+    };
+    /** A static leaf access into a lookup result, or undefined if `node` isn't one. */
+    const leaf = (node, guards) => {
+        const keys = [];
+        let first = node;
+        let optional = false;
+        while (first.kind === "element") {
+            keys.unshift(first.index);
+            optional = first.optional;
+            first = first.object;
+        }
+        const handle = handleOf(first);
+        if (handle === undefined)
+            return undefined;
+        if (handle === upHandle)
+            return null;
+        const [read, ...rest] = keys;
+        if (read?.kind !== "number" || (!optional && !guards.has(handle)))
+            return null;
+        const path = [];
+        for (const key of rest) {
+            if (key.kind !== "number" && key.kind !== "string")
+                return null;
+            path.push(key.value);
+        }
+        const leafPath = path;
+        return { kind: "lookupLeaf", handle, read: read.value, path: leafPath };
+    };
+    /** `test` is set where only truthiness matters, so a lookup result may stand for `found`. */
+    const expression = (node, guards, test) => {
+        const handle = handleOf(node);
+        if (handle !== undefined)
+            return test ? found(handle) : undefined;
+        const check = nullTest(node);
+        if (check !== undefined) {
+            const tested = found(check.handle);
+            return check.found ? tested : { kind: "unary", operator: "!", operand: tested };
+        }
+        switch (node.kind) {
+            case "number":
+            case "boolean":
+            case "column":
+            case "resource":
+            case "args":
+                return node;
+            // JS throws reading a parent that isn't there, so WASM reads one only where a test proves it is.
+            case "upColumn": return guards.has(upHandle) ? { kind: "upLeaf", column: node.column } : undefined;
+            case "local": return { kind: "local", local: localIndex(node.local) };
+            case "unary": {
+                const operand = expression(node.operand, guards, node.operator === "!");
+                return operand && { kind: "unary", operator: node.operator, operand };
+            }
+            case "binary": {
+                const left = expression(node.left, guards, false);
+                const right = expression(node.right, guards, false);
+                return left && right && { kind: "binary", operator: node.operator, left, right };
+            }
+            case "logical": {
+                if (node.operator === "??")
+                    return undefined;
+                const left = expression(node.left, guards, test);
+                const right = expression(node.right, node.operator === "&&" ? union(guards, proves(node.left, true)) : union(guards, proves(node.left, false)), test);
+                return left && right && { kind: "logical", operator: node.operator, left, right };
+            }
+            case "conditional": {
+                const condition = expression(node.test, guards, true);
+                const consequent = expression(node.consequent, union(guards, proves(node.test, true)), test);
+                const alternate = expression(node.alternate, union(guards, proves(node.test, false)), test);
+                return condition && consequent && alternate && { kind: "conditional", test: condition, consequent, alternate };
+            }
+            case "math": {
+                const items = all(node.arguments, item => expression(item, guards, false));
+                return items && { kind: "math", name: node.name, arguments: items };
+            }
+            case "observe": return expression(node.value, guards, test);
+            case "lane": {
+                const value = expression(node.value, guards, false);
+                return value && { kind: "lane", intrinsic: node.intrinsic, lane: node.lane, value };
+            }
+            case "element": return leaf(node, guards) ?? undefined;
+            // A row's leaves read NaN where there's no row, in JS kernels as in WASM, so they need no guard.
+            case "listLength": return { kind: "listLength", handle: handleFor(node.list) };
+            case "listChanged": return { kind: "listChanged", handle: handleFor(node.list) };
+            case "rowLeaf": return { kind: "rowLeaf", handle: handleFor(node.row), leaf: node.leaf };
+            case "rowEntity": return { kind: "rowEntity", handle: handleFor(node.row) };
+            default: return undefined;
+        }
+    };
+    let intrinsics = 0;
+    const exits = (body) => body[body.length - 1]?.kind === "next";
+    const block = (body, labels, outer) => {
+        let guards = outer;
+        const result = [];
+        for (const item of body) {
+            const converted = statement(item, labels, guards);
+            if (converted === undefined)
+                return undefined;
+            result.push(...converted);
+            // `if (other === null) return;` guards the rest of the block.
+            if (item.kind === "if") {
+                if (exits(resolve(item.consequent)))
+                    guards = union(guards, proves(item.test, false));
+                if (exits(resolve(item.alternate)))
+                    guards = union(guards, proves(item.test, true));
+            }
+        }
+        return result;
+    };
+    const depth = (label, labels) => labels.length - 1 - labels.lastIndexOf(label);
+    const statement = (node, labels, guards) => {
+        switch (node.kind) {
+            case "set": {
+                const value = expression(node.value, guards, false);
+                return value && [{ kind: "set", local: localIndex(node.local), value }];
+            }
+            case "declare":
+                for (const item of node.locals)
+                    localIndex(item);
+                return [];
+            case "store": {
+                const value = expression(node.value, guards, false);
+                return value && [{ kind: "store", column: node.column, value }];
+            }
+            case "stamp":
+            case "next":
+                return [node];
+            case "if": {
+                const test = expression(node.test, guards, true);
+                const consequent = block(resolve(node.consequent), labels, union(guards, proves(node.test, true)));
+                const alternate = block(resolve(node.alternate), labels, union(guards, proves(node.test, false)));
+                return test && consequent && alternate && [{ kind: "if", test, consequent, alternate }];
+            }
+            case "block":
+            case "loop": {
+                const body = block(resolve(node.body), [...labels, node.label], guards);
+                return body && [{ kind: node.kind, body }];
+            }
+            case "branch": return [{ kind: "branch", depth: depth(node.label, labels) }];
+            case "intrinsic": {
+                const operands = all(node.operands, lanes => all(lanes, lane => expression(lane, guards, false)));
+                const body = block(resolve(node.body), labels, guards);
+                intrinsics = Math.max(intrinsics, node.id + 1);
+                return operands && body && [{ kind: "intrinsic", id: node.id, name: node.name, intrinsic: node.intrinsic, operands, body }];
+            }
+            case "branchIf": {
+                const test = expression(node.test, guards, true);
+                return test && [{ kind: "branchIf", depth: depth(node.label, labels), test }];
+            }
+            case "probe": {
+                const values = all(node.values, item => expression(item, guards, false));
+                return values && [{ kind: "probe", list: handleFor(node.list), first: handleFor(node.first), probe: node.probe, values }];
+            }
+            case "listRow": {
+                const index = expression(node.index, guards, false);
+                return index && [{ kind: "listRow", row: handleFor(node.row), list: handleFor(node.list), index }];
+            }
+            case "lookup": {
+                const entity = expression(node.entity, guards, false);
+                const handle = handles.get(node.local) ?? handles.size;
+                handles.set(node.local, handle);
+                return entity && [{ kind: "find", handle, lookup: node.lookup, entity }];
+            }
+            default: return undefined;
+        }
+    };
+    const body = block(statements, [], none);
+    if (body === undefined)
+        return null;
+    const counted = { ...intrinsics === 0 ? {} : { intrinsics }, ...accumulators.length === 0 ? {} : { reductions: accumulators.map(localIndex) } };
+    if (listed)
+        Object.assign(counted, { up: true });
+    if (nameOf === undefined)
+        return { locals: locals.size, handles: handles.size, ...counted, body };
+    const names = [];
+    for (const [original, dense] of locals)
+        names[dense] = nameOf(original);
+    return { locals: locals.size, handles: handles.size, names, ...counted, body };
+};
+//# sourceMappingURL=program.js.map