warpo 2.5.0-alpha-2 → 3.0.0

package/asconfig.schema.json

@@ -49,6 +49,19 @@
           "type": "integer",
           "description": "Initial memory size for the WebAssembly module, in WebAssembly pages."
         },
+        "maximumMemory": {
+          "description": "Maximum memory limit with optional unit suffix. If smaller than one WebAssembly page, it is applied as lowMemoryLimit; otherwise it must be an exact multiple of one WebAssembly page and is converted to maximumMemory pages.",
+          "oneOf": [
+            {
+              "type": "integer",
+              "description": "Memory size in bytes."
+            },
+            {
+              "type": "string",
+              "description": "Memory size with unit suffix, e.g. 64KiB, 1MiB, 2MB, 3pages."
+            }
+          ]
+        },
         "stackSize": {
           "type": "integer",
           "description": "Stack size for the WebAssembly module, in bytes."

package/dist/heap_analyzer/src/classResolver.d.ts

@@ -0,0 +1,34 @@
+import type { ClassField, ClassLayout } from "./types.js";
+/**
+ * Resolves class layouts from DWARF debug information embedded in a
+ * WebAssembly binary and provides helper queries for reference scanning.
+ *
+ * Only classes with a runtime ID (`DW_AT_signature`) are included.
+ */
+export declare class ClassResolver {
+    private readonly layoutMap;
+    private constructor();
+    static fromWasm(wasmBinary: Uint8Array | ArrayBuffer): ClassResolver;
+    getLayouts(): ClassLayout[];
+    /** Returns class name, or "Class#<id>" if not found in debug info */
+    getClassName(classId: number): string;
+    /** Returns ClassDef or undefined */
+    getClassDef(classId: number): ClassLayout | undefined;
+    /**
+     * Check if a type has no managed references (no reference fields, no reference elements).
+     * Derived from field layout and elementIsReference rather than flags.
+     */
+    isPointerfree(classId: number): boolean;
+    /**
+     * Returns all reference fields (isReference == true) for this class,
+     * walking the full inheritance chain via base.
+     */
+    getReferenceFields(classId: number): ClassField[];
+}
+/**
+ * Resolve all class layouts from DWARF debug information embedded in a
+ * WebAssembly binary.
+ *
+ * Only classes with a runtime ID (`DW_AT_signature`) are included.
+ */
+export declare function resolveClassLayouts(wasmBinary: Uint8Array | ArrayBuffer): ClassLayout[];

package/dist/heap_analyzer/src/classResolver.js

@@ -0,0 +1,206 @@
+// Copyright (C) 2026 wasm-ecosystem
+// SPDX-License-Identifier: Apache-2.0
+import { DW_AT, DW_TAG, buildOffsetMap, findDIEsByTag, getAttr, parseDwarf } from "./dwarfParser.js";
+/**
+ * Resolves class layouts from DWARF debug information embedded in a
+ * WebAssembly binary and provides helper queries for reference scanning.
+ *
+ * Only classes with a runtime ID (`DW_AT_signature`) are included.
+ */
+export class ClassResolver {
+    layoutMap;
+    constructor(layouts) {
+        this.layoutMap = new Map(layouts.map((l) => [l.rtid, l]));
+    }
+    static fromWasm(wasmBinary) {
+        const dwarf = parseDwarf(wasmBinary);
+        const classes = [];
+        for (const unit of dwarf.compilationUnits) {
+            const resolver = new CompilationUnitResolver(unit.rootDIE);
+            for (const layout of resolver.resolve(unit.rootDIE)) {
+                classes.push(layout);
+            }
+        }
+        flattenInheritedFields(classes);
+        return new ClassResolver(classes);
+    }
+    getLayouts() {
+        return Array.from(this.layoutMap.values());
+    }
+    /** Returns class name, or "Class#<id>" if not found in debug info */
+    getClassName(classId) {
+        const layout = this.layoutMap.get(classId);
+        return layout ? layout.name : `Class#${classId}`;
+    }
+    /** Returns ClassDef or undefined */
+    getClassDef(classId) {
+        return this.layoutMap.get(classId);
+    }
+    /**
+     * Check if a type has no managed references (no reference fields, no reference elements).
+     * Derived from field layout and elementIsReference rather than flags.
+     */
+    isPointerfree(classId) {
+        const layout = this.layoutMap.get(classId);
+        if (!layout) {
+            return false;
+        }
+        if (layout.elementIsReference === true) {
+            return false;
+        }
+        for (const field of layout.fields) {
+            if (field.isReference) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Returns all reference fields (isReference == true) for this class,
+     * walking the full inheritance chain via base.
+     */
+    getReferenceFields(classId) {
+        const layout = this.layoutMap.get(classId);
+        if (!layout) {
+            return [];
+        }
+        return layout.fields.filter((f) => f.isReference);
+    }
+}
+class CompilationUnitResolver {
+    offsetMap;
+    baseTypeNames;
+    constructor(root) {
+        this.offsetMap = buildOffsetMap(root);
+        this.baseTypeNames = new Set();
+        for (const die of findDIEsByTag(root, DW_TAG.base_type)) {
+            const name = getAttr(die, DW_AT.name)?.value;
+            if (name) {
+                this.baseTypeNames.add(name);
+            }
+        }
+    }
+    resolve(root) {
+        const layouts = [];
+        for (const classDie of findDIEsByTag(root, DW_TAG.class_type)) {
+            const layout = this.resolveClassLayout(classDie);
+            if (layout) {
+                layouts.push(layout);
+            }
+        }
+        return layouts;
+    }
+    resolveTypeInfo(typeRef) {
+        const typeDie = this.offsetMap.get(typeRef);
+        if (!typeDie) {
+            return { size: 4, isReference: false };
+        }
+        const name = getAttr(typeDie, DW_AT.name)?.value;
+        const isReference = name === undefined ? false : !this.baseTypeNames.has(name);
+        const byteSize = getAttr(typeDie, DW_AT.byte_size);
+        const size = byteSize === undefined ? 4 : byteSize.value;
+        return { name, size, isReference };
+    }
+    resolveField(memberDie) {
+        const nameAttr = getAttr(memberDie, DW_AT.name);
+        const offsetAttr = getAttr(memberDie, DW_AT.data_member_location);
+        const typeAttr = getAttr(memberDie, DW_AT.type);
+        if (!nameAttr || offsetAttr === undefined || !typeAttr) {
+            return null;
+        }
+        const { size, isReference } = this.resolveTypeInfo(typeAttr.value);
+        return {
+            name: nameAttr.value,
+            offset: offsetAttr.value,
+            size,
+            isReference,
+        };
+    }
+    resolveTemplateType(classDie) {
+        const templateParam = classDie.children.find((c) => c.tag === DW_TAG.template_type_parameter);
+        if (!templateParam) {
+            return undefined;
+        }
+        const typeAttr = getAttr(templateParam, DW_AT.type);
+        if (!typeAttr) {
+            return undefined;
+        }
+        return this.resolveTypeInfo(typeAttr.value).name;
+    }
+    resolveBaseName(classDie) {
+        const inheritanceDie = classDie.children.find((c) => c.tag === DW_TAG.inheritance);
+        if (!inheritanceDie) {
+            return null;
+        }
+        const typeAttr = getAttr(inheritanceDie, DW_AT.type);
+        if (!typeAttr) {
+            return null;
+        }
+        const parentDie = this.offsetMap.get(typeAttr.value);
+        if (!parentDie) {
+            return null;
+        }
+        return getAttr(parentDie, DW_AT.name)?.value ?? null;
+    }
+    resolveClassLayout(classDie) {
+        const nameAttr = getAttr(classDie, DW_AT.name);
+        if (!nameAttr) {
+            return null;
+        }
+        const sigAttr = getAttr(classDie, DW_AT.signature);
+        if (sigAttr === undefined) {
+            return null;
+        }
+        const members = classDie.children.filter((c) => c.tag === DW_TAG.member);
+        const fields = [];
+        for (const member of members) {
+            const field = this.resolveField(member);
+            if (field) {
+                fields.push(field);
+            }
+        }
+        const layout = {
+            rtid: sigAttr.value,
+            name: nameAttr.value,
+            base: this.resolveBaseName(classDie),
+            fields,
+        };
+        const templateType = this.resolveTemplateType(classDie);
+        if (templateType !== undefined) {
+            layout.templateType = templateType;
+        }
+        return layout;
+    }
+}
+/**
+ * Resolve all class layouts from DWARF debug information embedded in a
+ * WebAssembly binary.
+ *
+ * Only classes with a runtime ID (`DW_AT_signature`) are included.
+ */
+export function resolveClassLayouts(wasmBinary) {
+    return ClassResolver.fromWasm(wasmBinary).getLayouts();
+}
+function flattenInheritedFields(classes) {
+    const byName = new Map(classes.map((c) => [c.name, c]));
+    const flattened = new Set();
+    function flatten(cls) {
+        if (flattened.has(cls.name)) {
+            return;
+        }
+        flattened.add(cls.name);
+        if (!cls.base) {
+            return;
+        }
+        const parent = byName.get(cls.base);
+        if (!parent) {
+            return;
+        }
+        flatten(parent);
+        cls.fields = [...parent.fields, ...cls.fields];
+    }
+    for (const cls of classes) {
+        flatten(cls);
+    }
+}
+//# sourceMappingURL=classResolver.js.map

package/dist/heap_analyzer/src/classResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classResolver.js","sourceRoot":"","sources":["../../../tools/heap_analyzer/src/classResolver.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,sCAAsC;AAEtC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,EAAiB,MAAM,kBAAkB,CAAC;AAGpH;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IACP,SAAS,CAA2B;IAErD,YAAoB,OAAsB;QACxC,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,UAAoC;QAClD,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;QACrC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3D,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACpD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAChC,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,UAAU;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,qEAAqE;IACrE,YAAY,CAAC,OAAe;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,OAAO,EAAE,CAAC;IACnD,CAAC;IAED,oCAAoC;IACpC,WAAW,CAAC,OAAe;QACzB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,OAAe;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,MAAM,CAAC,kBAAkB,KAAK,IAAI,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,OAAe;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACpD,CAAC;CACF;AAED,MAAM,uBAAuB;IACV,SAAS,CAAwB;IACjC,aAAa,CAAc;IAE5C,YAAY,IAAc;QACxB,IAAI,CAAC,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QAEtC,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAA2B,CAAC;YACnE,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAc;QACpB,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,eAAe,CAAC,OAAe;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;QACzC,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAA2B,CAAC;QACvE,MAAM,WAAW,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/E,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,QAAQ,CAAC,KAAgB,CAAC;QACrE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IACrC,CAAC;IAEO,YAAY,CAAC,SAAmB;QACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;QAClE,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,QAAQ,IAAI,UAAU,KAAK,SAAS,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAe,CAAC,CAAC;QAC7E,OAAO;YACL,IAAI,EAAE,QAAQ,CAAC,KAAe;YAC9B,MAAM,EAAE,UAAU,CAAC,KAAe;YAClC,IAAI;YACJ,WAAW;SACZ,CAAC;IACJ,CAAC;IAEO,mBAAmB,CAAC,QAAkB;QAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9F,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAe,CAAC,CAAC,IAAI,CAAC;IAC7D,CAAC;IAEO,eAAe,CAAC,QAAkB;QACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,CAAC,WAAW,CAAC,CAAC;QACnF,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAe,CAAC,CAAC;QAC/D,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAQ,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAgB,IAAI,IAAI,CAAC;IACnE,CAAC;IAEO,kBAAkB,CAAC,QAAkB;QAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QACnD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC;QACzE,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAgB;YAC1B,IAAI,EAAE,OAAO,CAAC,KAAe;YAC7B,IAAI,EAAE,QAAQ,CAAC,KAAe;YAC9B,IAAI,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC;YACpC,MAAM;SACP,CAAC;QAEF,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,CAAC,YAAY,GAAG,YAAY,CAAC;QACrC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAAoC;IACtE,OAAO,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,UAAU,EAAE,CAAC;AACzD,CAAC;AAED,SAAS,sBAAsB,CAAC,OAAsB;IACpD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,SAAS,OAAO,CAAC,GAAgB;QAC/B,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAExB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACd,OAAO;QACT,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;QACT,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,CAAC;QAChB,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/heap_analyzer/src/constants.d.ts

@@ -0,0 +1,21 @@
+export declare const AL_BITS = 4;
+export declare const AL_SIZE: number;
+export declare const AL_MASK: number;
+export declare const BLOCK_OVERHEAD = 4;
+export declare const OBJECT_OVERHEAD = 16;
+export declare const TOTAL_OVERHEAD: number;
+export declare const SL_BITS = 4;
+export declare const SB_BITS = 8;
+export declare const FL_BITS = 23;
+export declare const SL_SIZE: number;
+export declare const ROOT_SIZE = 1572;
+export declare const FREE = 1;
+export declare const LEFT_FREE = 2;
+export declare const TAGS_MASK = 3;
+export declare const COLOR_MASK = 3;
+export declare const GC_COLOR_GRAY = 2;
+export declare const GC_COLOR_TRANSPARENT = 3;
+export declare const DUMP_MAGIC = 1145590593;
+export declare const DUMP_MAGIC_BYTES: Uint8Array<ArrayBuffer>;
+export declare const DUMP_VERSION = 1;
+export declare const DUMP_HEADER_SIZE = 24;

package/dist/heap_analyzer/src/constants.js

@@ -0,0 +1,30 @@
+// Copyright (C) 2026 wasm-ecosystem
+// SPDX-License-Identifier: Apache-2.0
+// TLSF Allocator Constants (32-bit)
+export const AL_BITS = 4;
+export const AL_SIZE = 1 << AL_BITS; // 16
+export const AL_MASK = AL_SIZE - 1; // 15
+export const BLOCK_OVERHEAD = 4; // mmInfo only
+export const OBJECT_OVERHEAD = 16; // nextWithColor + prev + rtId + rtSize
+export const TOTAL_OVERHEAD = BLOCK_OVERHEAD + OBJECT_OVERHEAD; // 20
+export const SL_BITS = 4;
+export const SB_BITS = 8;
+export const FL_BITS = 23;
+export const SL_SIZE = 1 << SL_BITS; // 16
+export const ROOT_SIZE = 1572; // TLSF root structure size
+// Block flags (in mmInfo)
+export const FREE = 1;
+export const LEFT_FREE = 2;
+export const TAGS_MASK = 3;
+// GC Color (in nextWithColor & 3)
+export const COLOR_MASK = 3;
+// 0 and 1 are white/black but swap each GC cycle (white ^= 1 in rt/itcms.ts)
+// Only gray (2) and transparent (3) have fixed meaning
+export const GC_COLOR_GRAY = 2;
+export const GC_COLOR_TRANSPARENT = 3; // pinned, always reachable
+// Dump file
+export const DUMP_MAGIC = 0x44485341; // "A S H D" in LE
+export const DUMP_MAGIC_BYTES = new Uint8Array([0x41, 0x53, 0x48, 0x44]); // A, S, H, D
+export const DUMP_VERSION = 1;
+export const DUMP_HEADER_SIZE = 24;
+//# sourceMappingURL=constants.js.map

package/dist/heap_analyzer/src/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../../../tools/heap_analyzer/src/constants.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,sCAAsC;AAEtC,oCAAoC;AACpC,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK;AAC1C,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK;AAEzC,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC,CAAC,cAAc;AAC/C,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,CAAC,CAAC,uCAAuC;AAC1E,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,GAAG,eAAe,CAAC,CAAC,KAAK;AAErE,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC;AAC1B,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK;AAC1C,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,2BAA2B;AAE1D,0BAA0B;AAC1B,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC;AACtB,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC;AAC3B,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC;AAE3B,kCAAkC;AAClC,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAC5B,6EAA6E;AAC7E,uDAAuD;AACvD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,CAAC,2BAA2B;AAElE,YAAY;AACZ,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC,CAAC,kBAAkB;AACxD,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa;AACvF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC"}

package/dist/heap_analyzer/src/dominator.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Dominator tree computation using the Lengauer-Tarjan algorithm.
+ * Computes immediate dominators for all nodes reachable from GC roots.
+ */
+/**
+ * Virtual super-root node ID. Must not collide with any real payloadPtr.
+ * Using -1 (which is 0xFFFFFFFF in unsigned, impossible as a wasm address).
+ */
+export declare const VIRTUAL_ROOT = -1;
+/**
+ * Build dominator tree using the Lengauer-Tarjan algorithm.
+ *
+ * @param graph Adjacency list (node → successors)
+ * @param rootNodes Set of GC root payloadPtrs (deduplicated from RootInfo[])
+ * @returns Map<node, immediate dominator> for all reachable nodes
+ */
+export declare function buildDominatorTree(graph: Map<number, number[]>, rootNodes: Set<number>): Map<number, number>;

package/dist/heap_analyzer/src/dominator.js

@@ -0,0 +1,149 @@
+// Copyright (C) 2026 wasm-ecosystem
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Dominator tree computation using the Lengauer-Tarjan algorithm.
+ * Computes immediate dominators for all nodes reachable from GC roots.
+ */
+/**
+ * Virtual super-root node ID. Must not collide with any real payloadPtr.
+ * Using -1 (which is 0xFFFFFFFF in unsigned, impossible as a wasm address).
+ */
+export const VIRTUAL_ROOT = -1;
+/**
+ * Build dominator tree using the Lengauer-Tarjan algorithm.
+ *
+ * @param graph Adjacency list (node → successors)
+ * @param rootNodes Set of GC root payloadPtrs (deduplicated from RootInfo[])
+ * @returns Map<node, immediate dominator> for all reachable nodes
+ */
+// eslint-disable-next-line sonarjs/cognitive-complexity
+export function buildDominatorTree(graph, rootNodes) {
+    // DFS numbering arrays
+    const semi = []; // semi-dominator DFS number
+    const vertex = []; // DFS number → node
+    const parent = []; // DFS number → parent DFS number
+    const label = []; // used for path compression (EVAL)
+    const ancestor = []; // union-find ancestor
+    const idom = []; // immediate dominator in DFS numbering
+    const bucket = []; // bucket[v] = list of vertices whose sdom is v
+    // Mapping between node IDs and DFS numbers
+    const nodeToNum = new Map();
+    let n = 0; // counter
+    // Build predecessor map (reverse edges) for all nodes
+    const pred = [];
+    const rootSuccessors = Array.from(rootNodes);
+    // Augment graph with virtual root edges
+    const augSuccessors = (node) => {
+        if (node === VIRTUAL_ROOT) {
+            return rootSuccessors;
+        }
+        return graph.get(node) ?? [];
+    };
+    // Step 1: DFS from VIRTUAL_ROOT
+    // Iterative DFS to avoid stack overflow on large graphs
+    const dfsStack = [{ node: VIRTUAL_ROOT, parentNum: -1 }];
+    while (dfsStack.length > 0) {
+        const { node, parentNum } = dfsStack.pop();
+        if (nodeToNum.has(node)) {
+            continue;
+        }
+        const num = n++;
+        nodeToNum.set(node, num);
+        vertex[num] = node;
+        parent[num] = parentNum;
+        semi[num] = num;
+        label[num] = num;
+        ancestor[num] = -1;
+        idom[num] = 0;
+        bucket[num] = [];
+        pred[num] = [];
+        const succs = augSuccessors(node);
+        // Push in reverse so we visit in forward order
+        for (let i = succs.length - 1; i >= 0; i--) {
+            const succ = succs[i];
+            if (!nodeToNum.has(succ)) {
+                // todo: to be optimized, reduce memory allocation
+                dfsStack.push({ node: succ, parentNum: num });
+            }
+        }
+    }
+    if (n === 0) {
+        return new Map();
+    }
+    // Build predecessor lists using DFS numbering
+    for (let u = 0; u < n; u++) {
+        const node = vertex[u];
+        const succs = augSuccessors(node);
+        for (const succ of succs) {
+            const vNum = nodeToNum.get(succ);
+            if (vNum !== undefined) {
+                pred[vNum].push(u);
+            }
+        }
+    }
+    // COMPRESS: path compression on the forest
+    function compress(v) {
+        const stack = [];
+        let cur = v;
+        while (ancestor[ancestor[cur]] !== -1) {
+            stack.push(cur);
+            cur = ancestor[cur];
+        }
+        // Now cur's ancestor is a root (ancestor[ancestor[cur]] === -1)
+        for (let i = stack.length - 1; i >= 0; i--) {
+            const u = stack[i];
+            if (semi[label[ancestor[u]]] < semi[label[u]]) {
+                label[u] = label[ancestor[u]];
+            }
+            ancestor[u] = ancestor[cur];
+        }
+    }
+    // EVAL: return vertex with minimum semi in ancestor chain
+    function evalNode(v) {
+        if (ancestor[v] === -1) {
+            return v;
+        }
+        compress(v);
+        return label[v];
+    }
+    // LINK: set ancestor[w] = v
+    function link(v, w) {
+        ancestor[w] = v;
+    }
+    // Step 2 & 3: Process vertices in reverse DFS order
+    for (let i = n - 1; i >= 1; i--) {
+        const w = i;
+        const p = parent[w];
+        // Step 2: Compute semi-dominator
+        let s = p;
+        for (const v of pred[w]) {
+            const u = evalNode(v);
+            if (semi[u] < s) {
+                s = semi[u];
+            }
+        }
+        semi[w] = s;
+        bucket[s].push(w);
+        link(p, w);
+        // Step 3: Process bucket of parent
+        for (const v of bucket[p]) {
+            const u = evalNode(v);
+            idom[v] = semi[u] < semi[v] ? u : p;
+        }
+        bucket[p].length = 0;
+    }
+    // Step 4: Finalize idom values
+    for (let i = 1; i < n; i++) {
+        if (idom[i] !== semi[i]) {
+            idom[i] = idom[idom[i]];
+        }
+    }
+    idom[0] = -1; // VIRTUAL_ROOT has no dominator
+    // Build result map: node → idom node
+    const result = new Map();
+    for (let i = 1; i < n; i++) {
+        result.set(vertex[i], vertex[idom[i]]);
+    }
+    return result;
+}
+//# sourceMappingURL=dominator.js.map

package/dist/heap_analyzer/src/dominator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator.js","sourceRoot":"","sources":["../../../tools/heap_analyzer/src/dominator.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,sCAAsC;AAEtC;;;GAGG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC,CAAC;AAE/B;;;;;;GAMG;AACH,wDAAwD;AACxD,MAAM,UAAU,kBAAkB,CAAC,KAA4B,EAAE,SAAsB;IACrF,uBAAuB;IACvB,MAAM,IAAI,GAAa,EAAE,CAAC,CAAC,4BAA4B;IACvD,MAAM,MAAM,GAAa,EAAE,CAAC,CAAC,oBAAoB;IACjD,MAAM,MAAM,GAAa,EAAE,CAAC,CAAC,iCAAiC;IAC9D,MAAM,KAAK,GAAa,EAAE,CAAC,CAAC,mCAAmC;IAC/D,MAAM,QAAQ,GAAa,EAAE,CAAC,CAAC,sBAAsB;IACrD,MAAM,IAAI,GAAa,EAAE,CAAC,CAAC,uCAAuC;IAClE,MAAM,MAAM,GAAe,EAAE,CAAC,CAAC,+CAA+C;IAE9E,2CAA2C;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU;IAErB,sDAAsD;IACtD,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE7C,wCAAwC;IACxC,MAAM,aAAa,GAAG,CAAC,IAAY,EAAY,EAAE;QAC/C,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAC1B,OAAO,cAAc,CAAC;QACxB,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC/B,CAAC,CAAC;IAEF,gCAAgC;IAChC,wDAAwD;IACxD,MAAM,QAAQ,GAA+C,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAErG,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;QAE3C,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC;QAChB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACjB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QAEf,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,+CAA+C;QAC/C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzB,kDAAkD;gBAClD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,IAAI,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,8CAA8C;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,SAAS,QAAQ,CAAC,CAAS;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,gEAAgE;QAChE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC;YACD,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,SAAS,QAAQ,CAAC,CAAS;QACzB,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,QAAQ,CAAC,CAAC,CAAC,CAAC;QACZ,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,4BAA4B;IAC5B,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;QAChC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,oDAAoD;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAEpB,iCAAiC;QACjC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChB,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEX,mCAAmC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,gCAAgC;IAE9C,qCAAqC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/heap_analyzer/src/dumpReader.d.ts

@@ -0,0 +1,2 @@
+import { DumpedMemory } from "./types.js";
+export declare function parseDumpFile(buffer: ArrayBuffer): DumpedMemory;

package/dist/heap_analyzer/src/dumpReader.js

@@ -0,0 +1,25 @@
+// Copyright (C) 2026 wasm-ecosystem
+// SPDX-License-Identifier: Apache-2.0
+import { DUMP_MAGIC, DUMP_VERSION, DUMP_HEADER_SIZE } from "./constants.js";
+export function parseDumpFile(buffer) {
+    if (buffer.byteLength < DUMP_HEADER_SIZE) {
+        throw new Error(`Dump file too small: expected at least ${DUMP_HEADER_SIZE} bytes, got ${buffer.byteLength}`);
+    }
+    const view = new DataView(buffer);
+    const magic = view.getUint32(0, true);
+    if (magic !== DUMP_MAGIC) {
+        throw new Error(`Invalid dump magic: expected 0x${DUMP_MAGIC.toString(16).toUpperCase()}, got 0x${magic.toString(16).toUpperCase()}`);
+    }
+    const version = view.getUint32(4, true);
+    if (version !== DUMP_VERSION) {
+        throw new Error(`Unsupported dump version: expected ${DUMP_VERSION}, got ${version}`);
+    }
+    const dataEnd = view.getUint32(8, true);
+    const heapBase = view.getUint32(12, true);
+    const stackPointer = view.getUint32(16, true);
+    return {
+        rtGlobals: { dataEnd, heapBase, stackPointer },
+        memory: new DataView(buffer, DUMP_HEADER_SIZE),
+    };
+}
+//# sourceMappingURL=dumpReader.js.map

package/dist/heap_analyzer/src/dumpReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dumpReader.js","sourceRoot":"","sources":["../../../tools/heap_analyzer/src/dumpReader.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,sCAAsC;AAEtC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAG5E,MAAM,UAAU,aAAa,CAAC,MAAmB;IAC/C,IAAI,MAAM,CAAC,UAAU,GAAG,gBAAgB,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,0CAA0C,gBAAgB,eAAe,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;IAChH,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAElC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CACb,kCAAkC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,WAAW,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,CACrH,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxC,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,sCAAsC,YAAY,SAAS,OAAO,EAAE,CAAC,CAAC;IACxF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAE9C,OAAO;QACL,SAAS,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE;QAC9C,MAAM,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC;KAC/C,CAAC;AACJ,CAAC"}

package/dist/heap_analyzer/src/dwarfParser.d.ts

@@ -0,0 +1,117 @@
+/** DWARF tag values (DW_TAG_*). */
+export declare const DW_TAG: {
+    readonly compile_unit: 17;
+    readonly class_type: 2;
+    readonly inheritance: 28;
+    readonly member: 13;
+    readonly base_type: 36;
+    readonly template_type_parameter: 47;
+    readonly formal_parameter: 5;
+    readonly lexical_block: 11;
+    readonly subprogram: 46;
+    readonly variable: 52;
+};
+/** DWARF attribute names (DW_AT_*). */
+export declare const DW_AT: {
+    readonly name: 3;
+    readonly location: 2;
+    readonly byte_size: 11;
+    readonly producer: 37;
+    readonly type: 73;
+    readonly data_member_location: 56;
+    readonly signature: 105;
+    readonly low_pc: 17;
+    readonly high_pc: 18;
+};
+/** DWARF form values (DW_FORM_*). */
+export declare const DW_FORM: {
+    readonly addr: 1;
+    readonly data4: 6;
+    readonly string: 8;
+    readonly strp: 14;
+    readonly ref4: 19;
+};
+export interface AbbrevAttribute {
+    name: number;
+    form: number;
+}
+export interface AbbrevEntry {
+    code: number;
+    tag: number;
+    hasChildren: boolean;
+    attributes: AbbrevAttribute[];
+}
+export type AbbrevTable = Map<number, AbbrevEntry>;
+export interface DwarfAttributeValue {
+    name: number;
+    form: number;
+    value: string | number;
+}
+export interface DwarfDIE {
+    offset: number;
+    tag: number;
+    attributes: DwarfAttributeValue[];
+    children: DwarfDIE[];
+}
+export interface CompilationUnit {
+    unitLength: number;
+    version: number;
+    abbrevOffset: number;
+    addressSize: number;
+    rootDIE: DwarfDIE;
+}
+export interface DwarfInfo {
+    /** Parsed .debug_str string table (offset → string). */
+    stringTable: Map<number, string>;
+    /** Parsed abbreviation tables. */
+    abbreviations: AbbrevTable;
+    /** All compilation units in .debug_info. */
+    compilationUnits: CompilationUnit[];
+}
+interface CustomSection {
+    name: string;
+    payload: Uint8Array;
+}
+/**
+ * Extract custom sections from a wasm binary using wasmparser's BinaryReader.
+ * The reader validates wasm structure while iterating through sections.
+ */
+export declare function extractCustomSections(wasmBinary: Uint8Array): CustomSection[];
+/**
+ * Parse a .debug_abbrev section into an abbreviation table.
+ */
+export declare function parseAbbrevTable(data: Uint8Array): AbbrevTable;
+/**
+ * Parse all compilation units from a .debug_info section.
+ */
+export declare function parseDebugInfo(infoData: Uint8Array, abbrevTable: AbbrevTable, stringTable: Map<number, string>): CompilationUnit[];
+/**
+ * Parse DWARF debug information from a WebAssembly binary.
+ *
+ * @param wasmBinary The raw wasm file content as a Uint8Array or ArrayBuffer.
+ * @returns Parsed DWARF info including compilation units, abbreviations, and string table.
+ * @throws If required DWARF sections are missing or malformed.
+ *
+ */
+export declare function parseDwarf(wasmBinary: Uint8Array | ArrayBuffer): DwarfInfo;
+/** Human-readable tag name for known DWARF tags. */
+export declare function tagName(tag: number): string;
+/** Human-readable attribute name for known DWARF attributes. */
+export declare function attrName(attr: number): string;
+/**
+ * Get a named attribute value from a DIE, or undefined if not present.
+ */
+export declare function getAttr(die: DwarfDIE, attrId: number): DwarfAttributeValue | undefined;
+/**
+ * Depth-first iterate all DIEs in a tree starting from root.
+ */
+export declare function walkDIEs(root: DwarfDIE): Generator<DwarfDIE>;
+/**
+ * Find all DIEs with a specific tag in the tree (depth-first).
+ */
+export declare function findDIEsByTag(root: DwarfDIE, tag: number): DwarfDIE[];
+/**
+ * Build a map from DIE offset to DIE for resolving DW_FORM_ref4 references.
+ */
+export declare function buildOffsetMap(root: DwarfDIE): Map<number, DwarfDIE>;
+export {};