@carbonenginejs/runtime-trinity 0.6.0 → 0.8.0

package/dist/trinityCore/rawData/TriPoolAllocator.js

@@ -0,0 +1,357 @@
+import { RawDataType, RawData } from './RawData.js';
+import { CjsPerObjectLayouts } from './CjsPerObjectLayouts.js';
+
+// Factory + arena for RawData constant-data payloads.
+//
+// Named for Carbon TriPoolAllocator (TriPoolAllocator.h/.cpp): the same job,
+// lifetime and per-frame Clear. Carbon bump-allocates with placement new and
+// wholesale Clear()s at EndRenderContext (Tr2Renderer.cpp:1072-1081), which is
+// exactly what Alloc/Reset do here. It also carries the struct-layout registry,
+// which C++ gets free from the type system via Allocate<T>().
+//
+// A pool is PER-ENGINE (one CjsLibrary = one live backend). Structs are
+// REGISTERED on the instance - registration resolves each struct's layout right
+// then, so a struct that cannot be laid out fails loud at registration, naming
+// it.
+//
+// TRINITY COMPUTES THE OFFSETS. This once required an engine-injected packer,
+// on the premise that the physical layout is BACKEND-SPECIFIC. That premise is
+// false for these buffers, verified 2026-07-28: every backend declares them as
+// a flat array of vec4 - WGSL `array<vec4<f32>, N>`, GLSL `vec4 cbN[N]`, or a
+// std140 block wrapping `vec4 data[N]` - and std140's stride for an array of
+// vec4 is 16 bytes, identical to tight C++ packing. The std140 rules that DO
+// diverge (vec3 padded to 16, scalar array stride) never engage, because there
+// are no struct members to pad: the translated shader indexes the flat array
+// and reassembles fields itself.
+//
+// Layouts resolve from two sources, in order:
+//
+//   1. CjsPerObjectLayouts, when the struct name is a Carbon struct. Those
+//      offsets are declared, not derived, because Carbon memcpy's the C++
+//      struct (EveSpaceObject2.cpp:1469-1483) and its members sit on float4
+//      boundaries - tight-packing a FLOAT member would drift from it.
+//   2. tight packing of the supplied def, for an ad-hoc struct the catalog
+//      does not carry.
+//
+// Offsets are FLOAT offsets relative to one instance's slot (the same offset
+// indexes the Float32 and Uint32 views).
+//
+// Allocation is an ARENA (bump), not a free-list:
+//   - Alloc(name) bumps a cursor and returns a view ("snip off what you need")
+//     into a RETAINED backing buffer - the buffer is NOT recreated per frame.
+//   - Reset() rewinds the cursor; every slot is freed at once, O(1); the
+//     chunks are kept and reused next frame.
+//   - There is no Unalloc: transient slots live until their batch dispatches,
+//     so Reset is the only free. Permanent per-object data is not Alloc'd - a
+//     static placeable constructs its own RawData and owns it across frames.
+//
+// Maps to Carbon: Alloc == accumulator.Allocate (Tr2Renderer::GetPoolAllocator,
+// reset per frame). No clear-on-Alloc, so an unwritten field shows the previous
+// tenant's bytes - that reproduces Carbon's "unwritten slots = allocator
+// garbage" (declared defaults are re-applied on Alloc; everything else is
+// write-what-you-rely-on).
+//
+// Design: PER-OBJECT-DATA-DESIGN-2026-07-24.md
+
+/** Declared catalog type -> the encoder kind that writes its bytes. */
+const CATALOG_ENCODINGS = {
+  [CjsPerObjectLayouts.Types.MATRIX4]: RawDataType.MATRIX,
+  [CjsPerObjectLayouts.Types.UINT32]: RawDataType.UINT,
+  [CjsPerObjectLayouts.Types.INT32]: RawDataType.INT
+};
+
+/**
+ * A catalog layout as a store field-def array.
+ *
+ * A default on an array field is repeated across every element: the store
+ * applies each default at a single offset, and Carbon's neutral for a slot
+ * (identity for an unused custom mask) applies to every slot, not just the
+ * first.
+ */
+function catalogDef(layout) {
+  const def = [];
+  for (const field of layout.fields.values()) {
+    let value = null;
+    if (field.default) {
+      value = field.count > 1 ? Array.from({
+        length: field.count
+      }, () => [...field.default]).flat() : [...field.default];
+    }
+    def.push({
+      name: field.name,
+      size: field.size,
+      elements: field.count,
+      encoding: CATALOG_ENCODINGS[field.type] ?? RawDataType.VECTOR,
+      default: value
+    });
+  }
+  return def;
+}
+
+/**
+ * Carbon's declared layout for a struct, or null when the catalog omits it.
+ */
+function catalogLayout(structName) {
+  const layout = CjsPerObjectLayouts.Get(structName);
+  if (!layout) {
+    return null;
+  }
+  const fields = {};
+  for (const field of layout.fields.values()) {
+    fields[field.name] = {
+      offset: field.offset,
+      size: field.size,
+      elements: field.count,
+      encoding: CATALOG_ENCODINGS[field.type] ?? RawDataType.VECTOR
+    };
+  }
+  return {
+    fields,
+    stride: layout.stride
+  };
+}
+
+/**
+ * Tight layout for an ad-hoc struct the catalog does not carry: fields in
+ * declared order, no padding.
+ */
+function tightLayout(normalized) {
+  const fields = {};
+  let offset = 0;
+  for (const field of normalized) {
+    fields[field.name] = {
+      offset,
+      size: field.size,
+      elements: field.elements,
+      encoding: field.encoding
+    };
+    offset += field.size * field.elements;
+  }
+  return {
+    fields,
+    stride: offset
+  };
+}
+
+/** Registers constant-data struct shapes and leases packed payloads from a per-engine arena. */
+class TriPoolAllocator {
+  /** Registered layouts: name -> { fields, stride, defaults }. */
+  #layouts = new Map();
+
+  /** Retained arena chunks (Float32) and their Uint32 aliases. */
+  #chunks = [];
+  #chunkAliases = [];
+
+  /** Floats per chunk; also the largest struct a single Alloc may request. */
+  #chunkFloats = 8192;
+  #chunkIndex = 0;
+  #cursor = 0;
+
+  /**
+   * @param {object} [options]
+   * @param {number} [options.chunkFloats] - arena chunk size in floats.
+   */
+  constructor(options = {}) {
+    if (Number.isInteger(options.chunkFloats) && options.chunkFloats > 0) {
+      this.#chunkFloats = options.chunkFloats;
+    }
+    this.#AddChunk();
+  }
+
+  /**
+   * Register several structs at once: { StructName: def, ... }. Each value is a
+   * field-def array (see RegisterStruct) or { def, stages } when the struct
+   * binds anywhere other than the default vertex-stage slot. Returns the store
+   * for chaining.
+   */
+  Register(structs) {
+    for (const name of Object.keys(structs)) {
+      const entry = structs[name];
+      if (Array.isArray(entry)) {
+        this.RegisterStruct(name, entry);
+      } else {
+        this.RegisterStruct(name, entry.def, {
+          stages: entry.stages
+        });
+      }
+    }
+    return this;
+  }
+
+  /**
+   * Register one struct and RESOLVE its layout immediately. `def` is an array
+   * of field defs: { name, encoding, size, elements?, default? }, where `size`
+   * may instead be a defaults ARRAY whose length is the size. Omit `def`
+   * entirely for a Carbon struct and the catalog supplies it. Returns the store
+   * for chaining.
+   *
+   * `options.stages` declares which per-object constant slots the payload binds
+   * (default ["vs"]). This is Carbon-SEMANTIC knowledge - which
+   * FillAndSetConstants calls exist for the struct - so it travels with the def
+   * rather than the layout: ["vs"] a vertex-stage payload, ["ps"] a pixel payload (one
+   * half of a { vs, ps } record), ["vs", "ps"] the SAME bytes bound to both
+   * slots (sphere pin, lensflare). The engine reads it from GetLayout().stages.
+   */
+  RegisterStruct(name, def, options = {}) {
+    if (def === undefined) {
+      // No def supplied: take Carbon's, from the catalog.
+      const layout = CjsPerObjectLayouts.Get(name);
+      if (!layout) {
+        throw new Error(`TriPoolAllocator: struct "${name}" is not in CjsPerObjectLayouts - add it there, or pass a def explicitly`);
+      }
+      def = catalogDef(layout);
+      options = {
+        ...options,
+        stages: options.stages ?? layout.stages
+      };
+    }
+    const normalized = TriPoolAllocator.normalizeDef(def);
+    const stages = TriPoolAllocator.normalizeStages(name, options.stages);
+
+    // Carbon's declared offsets win: its members sit on float4 boundaries, so
+    // tight-packing them would drift the moment a struct carries a FLOAT.
+    const resolved = catalogLayout(name) ?? tightLayout(normalized);
+    if (resolved.stride > this.#chunkFloats) {
+      throw new Error(`TriPoolAllocator: struct "${name}" (${resolved.stride} floats) exceeds the chunk size (${this.#chunkFloats})`);
+    }
+    const defaults = [];
+    for (const field of normalized) {
+      if (field.default) {
+        const entry = resolved.fields[field.name];
+        if (entry) {
+          defaults.push({
+            offset: entry.offset,
+            values: field.default
+          });
+        }
+      }
+    }
+    this.#layouts.set(name, {
+      fields: resolved.fields,
+      stride: resolved.stride,
+      defaults,
+      stages
+    });
+    return this;
+  }
+
+  /** Whether a struct has been registered on this store. */
+  Has(name) {
+    return this.#layouts.has(name);
+  }
+
+  /**
+   * Lease a TRANSIENT payload for a registered struct. Bumps the arena and
+   * returns a RawData view over the next slot, with declared defaults applied.
+   * Valid until the next Reset().
+   */
+  Alloc(name) {
+    const layout = this.#layouts.get(name);
+    if (!layout) {
+      throw new Error(`TriPoolAllocator: struct "${name}" is not registered on this store (call Register/RegisterStruct first)`);
+    }
+    const stride = layout.stride;
+    if (this.#cursor + stride > this.#chunkFloats) {
+      this.#chunkIndex++;
+      this.#cursor = 0;
+      if (this.#chunkIndex >= this.#chunks.length) {
+        this.#AddChunk();
+      }
+    }
+    const start = this.#cursor;
+    this.#cursor += stride;
+    const floats = this.#chunks[this.#chunkIndex].subarray(start, start + stride);
+    const uints = this.#chunkAliases[this.#chunkIndex].subarray(start, start + stride);
+    for (const preset of layout.defaults) {
+      const values = preset.values;
+      for (let index = 0; index < values.length; index++) {
+        floats[preset.offset + index] = values[index];
+      }
+    }
+    return new RawData(layout, floats, uints, name);
+  }
+
+  /**
+   * Free every transient slot at once (frame end). Rewinds the arena cursor;
+   * the backing chunks are RETAINED and reused - nothing is reallocated.
+   */
+  Reset() {
+    this.#chunkIndex = 0;
+    this.#cursor = 0;
+  }
+
+  /**
+   * Appends a fresh arena chunk of chunkFloats floats plus a Uint32 alias view
+   * over the same bytes, so payload fields can be written as floats or raw bits.
+   */
+  #AddChunk() {
+    const chunk = new Float32Array(this.#chunkFloats);
+    this.#chunks.push(chunk);
+    this.#chunkAliases.push(new Uint32Array(chunk.buffer));
+  }
+
+  /** The field encoding kinds (packing directives). */
+  static Type = RawDataType;
+
+  /** The per-object binding slots a struct may declare via options.stages. */
+  static Stages = Object.freeze(["vs", "ps", "gs", "cs", "hs", "ds"]);
+
+  /**
+   * Validate a stages declaration: a non-empty array drawn from
+   * TriPoolAllocator.Stages, no duplicates. Defaults to ["vs"] (Carbon's most
+   * common single-payload binding). Returns a frozen copy.
+   */
+  static normalizeStages(structName, stages) {
+    if (stages === undefined || stages === null) {
+      return TriPoolAllocator.defaultStages;
+    }
+    if (!Array.isArray(stages) || !stages.length) {
+      throw new Error(`TriPoolAllocator: struct "${structName}" stages must be a non-empty array`);
+    }
+    for (const stage of stages) {
+      if (!TriPoolAllocator.Stages.includes(stage)) {
+        throw new Error(`TriPoolAllocator: struct "${structName}" has unknown stage "${stage}" (expected one of: ${TriPoolAllocator.Stages.join(", ")})`);
+      }
+    }
+    if (new Set(stages).size !== stages.length) {
+      throw new Error(`TriPoolAllocator: struct "${structName}" declares a duplicate stage`);
+    }
+    return Object.freeze([...stages]);
+  }
+  static defaultStages = Object.freeze(["vs"]);
+
+  /**
+   * Normalize a raw def: default elements to 1, resolve size-as-defaults-array,
+   * require a name and encoding. Physical offsets are NOT computed here - they
+   * are resolved at registration, from the catalog or by tight packing.
+   */
+  static normalizeDef(def) {
+    return def.map(field => {
+      if (!field.name) {
+        throw new Error("TriPoolAllocator: every struct field needs a name");
+      }
+      if (!field.encoding) {
+        throw new Error(`TriPoolAllocator: field "${field.name}" needs an encoding (TriPoolAllocator.Type.*)`);
+      }
+      let size = field.size;
+      let defaultValue = field.default ?? null;
+      if (Array.isArray(size)) {
+        defaultValue = size;
+        size = size.length;
+      }
+      if (!Number.isInteger(size) || size <= 0) {
+        throw new Error(`TriPoolAllocator: field "${field.name}" needs a positive integer size`);
+      }
+      return {
+        name: field.name,
+        elements: Number.isInteger(field.elements) && field.elements > 0 ? field.elements : 1,
+        size,
+        encoding: field.encoding,
+        default: defaultValue
+      };
+    });
+  }
+}
+
+export { TriPoolAllocator };
+//# sourceMappingURL=TriPoolAllocator.js.map

package/dist/trinityCore/rawData/TriPoolAllocator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TriPoolAllocator.js","sources":["../../../../src/trinityCore/rawData/TriPoolAllocator.js"],"sourcesContent":["// Factory + arena for RawData constant-data payloads.\n//\n// Named for Carbon TriPoolAllocator (TriPoolAllocator.h/.cpp): the same job,\n// lifetime and per-frame Clear. Carbon bump-allocates with placement new and\n// wholesale Clear()s at EndRenderContext (Tr2Renderer.cpp:1072-1081), which is\n// exactly what Alloc/Reset do here. It also carries the struct-layout registry,\n// which C++ gets free from the type system via Allocate<T>().\n//\n// A pool is PER-ENGINE (one CjsLibrary = one live backend). Structs are\n// REGISTERED on the instance - registration resolves each struct's layout right\n// then, so a struct that cannot be laid out fails loud at registration, naming\n// it.\n//\n// TRINITY COMPUTES THE OFFSETS. This once required an engine-injected packer,\n// on the premise that the physical layout is BACKEND-SPECIFIC. That premise is\n// false for these buffers, verified 2026-07-28: every backend declares them as\n// a flat array of vec4 - WGSL `array<vec4<f32>, N>`, GLSL `vec4 cbN[N]`, or a\n// std140 block wrapping `vec4 data[N]` - and std140's stride for an array of\n// vec4 is 16 bytes, identical to tight C++ packing. The std140 rules that DO\n// diverge (vec3 padded to 16, scalar array stride) never engage, because there\n// are no struct members to pad: the translated shader indexes the flat array\n// and reassembles fields itself.\n//\n// Layouts resolve from two sources, in order:\n//\n//   1. CjsPerObjectLayouts, when the struct name is a Carbon struct. Those\n//      offsets are declared, not derived, because Carbon memcpy's the C++\n//      struct (EveSpaceObject2.cpp:1469-1483) and its members sit on float4\n//      boundaries - tight-packing a FLOAT member would drift from it.\n//   2. tight packing of the supplied def, for an ad-hoc struct the catalog\n//      does not carry.\n//\n// Offsets are FLOAT offsets relative to one instance's slot (the same offset\n// indexes the Float32 and Uint32 views).\n//\n// Allocation is an ARENA (bump), not a free-list:\n//   - Alloc(name) bumps a cursor and returns a view (\"snip off what you need\")\n//     into a RETAINED backing buffer - the buffer is NOT recreated per frame.\n//   - Reset() rewinds the cursor; every slot is freed at once, O(1); the\n//     chunks are kept and reused next frame.\n//   - There is no Unalloc: transient slots live until their batch dispatches,\n//     so Reset is the only free. Permanent per-object data is not Alloc'd - a\n//     static placeable constructs its own RawData and owns it across frames.\n//\n// Maps to Carbon: Alloc == accumulator.Allocate (Tr2Renderer::GetPoolAllocator,\n// reset per frame). No clear-on-Alloc, so an unwritten field shows the previous\n// tenant's bytes - that reproduces Carbon's \"unwritten slots = allocator\n// garbage\" (declared defaults are re-applied on Alloc; everything else is\n// write-what-you-rely-on).\n//\n// Design: PER-OBJECT-DATA-DESIGN-2026-07-24.md\nimport { RawData, RawDataType } from \"./RawData.js\";\nimport { CjsPerObjectLayouts } from \"./CjsPerObjectLayouts.js\";\n\n\n/** Declared catalog type -> the encoder kind that writes its bytes. */\nconst CATALOG_ENCODINGS = {\n  [CjsPerObjectLayouts.Types.MATRIX4]: RawDataType.MATRIX,\n  [CjsPerObjectLayouts.Types.UINT32]: RawDataType.UINT,\n  [CjsPerObjectLayouts.Types.INT32]: RawDataType.INT\n};\n\n\n/**\n * A catalog layout as a store field-def array.\n *\n * A default on an array field is repeated across every element: the store\n * applies each default at a single offset, and Carbon's neutral for a slot\n * (identity for an unused custom mask) applies to every slot, not just the\n * first.\n */\nfunction catalogDef(layout)\n{\n  const def = [];\n\n  for (const field of layout.fields.values())\n  {\n    let value = null;\n\n    if (field.default)\n    {\n      value = field.count > 1\n        ? Array.from({ length: field.count }, () => [ ...field.default ]).flat()\n        : [ ...field.default ];\n    }\n\n    def.push({\n      name: field.name,\n      size: field.size,\n      elements: field.count,\n      encoding: CATALOG_ENCODINGS[field.type] ?? RawDataType.VECTOR,\n      default: value\n    });\n  }\n\n  return def;\n}\n\n\n/**\n * Carbon's declared layout for a struct, or null when the catalog omits it.\n */\nfunction catalogLayout(structName)\n{\n  const layout = CjsPerObjectLayouts.Get(structName);\n\n  if (!layout)\n  {\n    return null;\n  }\n\n  const fields = {};\n\n  for (const field of layout.fields.values())\n  {\n    fields[field.name] = {\n      offset: field.offset,\n      size: field.size,\n      elements: field.count,\n      encoding: CATALOG_ENCODINGS[field.type] ?? RawDataType.VECTOR\n    };\n  }\n\n  return { fields, stride: layout.stride };\n}\n\n\n/**\n * Tight layout for an ad-hoc struct the catalog does not carry: fields in\n * declared order, no padding.\n */\nfunction tightLayout(normalized)\n{\n  const fields = {};\n  let offset = 0;\n\n  for (const field of normalized)\n  {\n    fields[field.name] = {\n      offset,\n      size: field.size,\n      elements: field.elements,\n      encoding: field.encoding\n    };\n    offset += field.size * field.elements;\n  }\n\n  return { fields, stride: offset };\n}\n\n\n/** Registers constant-data struct shapes and leases packed payloads from a per-engine arena. */\nexport class TriPoolAllocator\n{\n  /** Registered layouts: name -> { fields, stride, defaults }. */\n  #layouts = new Map();\n\n  /** Retained arena chunks (Float32) and their Uint32 aliases. */\n  #chunks = [];\n\n  #chunkAliases = [];\n\n  /** Floats per chunk; also the largest struct a single Alloc may request. */\n  #chunkFloats = 8192;\n\n  #chunkIndex = 0;\n\n  #cursor = 0;\n\n  /**\n   * @param {object} [options]\n   * @param {number} [options.chunkFloats] - arena chunk size in floats.\n   */\n  constructor(options = {})\n  {\n    if (Number.isInteger(options.chunkFloats) && options.chunkFloats > 0)\n    {\n      this.#chunkFloats = options.chunkFloats;\n    }\n\n    this.#AddChunk();\n  }\n\n  /**\n   * Register several structs at once: { StructName: def, ... }. Each value is a\n   * field-def array (see RegisterStruct) or { def, stages } when the struct\n   * binds anywhere other than the default vertex-stage slot. Returns the store\n   * for chaining.\n   */\n  Register(structs)\n  {\n    for (const name of Object.keys(structs))\n    {\n      const entry = structs[name];\n\n      if (Array.isArray(entry))\n      {\n        this.RegisterStruct(name, entry);\n      }\n      else\n      {\n        this.RegisterStruct(name, entry.def, { stages: entry.stages });\n      }\n    }\n\n    return this;\n  }\n\n  /**\n   * Register one struct and RESOLVE its layout immediately. `def` is an array\n   * of field defs: { name, encoding, size, elements?, default? }, where `size`\n   * may instead be a defaults ARRAY whose length is the size. Omit `def`\n   * entirely for a Carbon struct and the catalog supplies it. Returns the store\n   * for chaining.\n   *\n   * `options.stages` declares which per-object constant slots the payload binds\n   * (default [\"vs\"]). This is Carbon-SEMANTIC knowledge - which\n   * FillAndSetConstants calls exist for the struct - so it travels with the def\n   * rather than the layout: [\"vs\"] a vertex-stage payload, [\"ps\"] a pixel payload (one\n   * half of a { vs, ps } record), [\"vs\", \"ps\"] the SAME bytes bound to both\n   * slots (sphere pin, lensflare). The engine reads it from GetLayout().stages.\n   */\n  RegisterStruct(name, def, options = {})\n  {\n    if (def === undefined)\n    {\n      // No def supplied: take Carbon's, from the catalog.\n      const layout = CjsPerObjectLayouts.Get(name);\n\n      if (!layout)\n      {\n        throw new Error(\n          `TriPoolAllocator: struct \"${name}\" is not in CjsPerObjectLayouts - add it there, or pass a def explicitly`\n        );\n      }\n\n      def = catalogDef(layout);\n      options = { ...options, stages: options.stages ?? layout.stages };\n    }\n\n    const normalized = TriPoolAllocator.normalizeDef(def);\n    const stages = TriPoolAllocator.normalizeStages(name, options.stages);\n\n    // Carbon's declared offsets win: its members sit on float4 boundaries, so\n    // tight-packing them would drift the moment a struct carries a FLOAT.\n    const resolved = catalogLayout(name) ?? tightLayout(normalized);\n\n    if (resolved.stride > this.#chunkFloats)\n    {\n      throw new Error(`TriPoolAllocator: struct \"${name}\" (${resolved.stride} floats) exceeds the chunk size (${this.#chunkFloats})`);\n    }\n\n    const defaults = [];\n\n    for (const field of normalized)\n    {\n      if (field.default)\n      {\n        const entry = resolved.fields[field.name];\n\n        if (entry)\n        {\n          defaults.push({ offset: entry.offset, values: field.default });\n        }\n      }\n    }\n\n    this.#layouts.set(name, { fields: resolved.fields, stride: resolved.stride, defaults, stages });\n\n    return this;\n  }\n\n  /** Whether a struct has been registered on this store. */\n  Has(name)\n  {\n    return this.#layouts.has(name);\n  }\n\n  /**\n   * Lease a TRANSIENT payload for a registered struct. Bumps the arena and\n   * returns a RawData view over the next slot, with declared defaults applied.\n   * Valid until the next Reset().\n   */\n  Alloc(name)\n  {\n    const layout = this.#layouts.get(name);\n\n    if (!layout)\n    {\n      throw new Error(`TriPoolAllocator: struct \"${name}\" is not registered on this store (call Register/RegisterStruct first)`);\n    }\n\n    const stride = layout.stride;\n\n    if (this.#cursor + stride > this.#chunkFloats)\n    {\n      this.#chunkIndex++;\n      this.#cursor = 0;\n\n      if (this.#chunkIndex >= this.#chunks.length)\n      {\n        this.#AddChunk();\n      }\n    }\n\n    const start = this.#cursor;\n    this.#cursor += stride;\n\n    const floats = this.#chunks[this.#chunkIndex].subarray(start, start + stride);\n    const uints = this.#chunkAliases[this.#chunkIndex].subarray(start, start + stride);\n\n    for (const preset of layout.defaults)\n    {\n      const values = preset.values;\n\n      for (let index = 0; index < values.length; index++)\n      {\n        floats[preset.offset + index] = values[index];\n      }\n    }\n\n    return new RawData(layout, floats, uints, name);\n  }\n\n  /**\n   * Free every transient slot at once (frame end). Rewinds the arena cursor;\n   * the backing chunks are RETAINED and reused - nothing is reallocated.\n   */\n  Reset()\n  {\n    this.#chunkIndex = 0;\n    this.#cursor = 0;\n  }\n\n  /**\n   * Appends a fresh arena chunk of chunkFloats floats plus a Uint32 alias view\n   * over the same bytes, so payload fields can be written as floats or raw bits.\n   */\n  #AddChunk()\n  {\n    const chunk = new Float32Array(this.#chunkFloats);\n    this.#chunks.push(chunk);\n    this.#chunkAliases.push(new Uint32Array(chunk.buffer));\n  }\n\n  /** The field encoding kinds (packing directives). */\n  static Type = RawDataType;\n\n  /** The per-object binding slots a struct may declare via options.stages. */\n  static Stages = Object.freeze([\"vs\", \"ps\", \"gs\", \"cs\", \"hs\", \"ds\"]);\n\n  /**\n   * Validate a stages declaration: a non-empty array drawn from\n   * TriPoolAllocator.Stages, no duplicates. Defaults to [\"vs\"] (Carbon's most\n   * common single-payload binding). Returns a frozen copy.\n   */\n  static normalizeStages(structName, stages)\n  {\n    if (stages === undefined || stages === null)\n    {\n      return TriPoolAllocator.defaultStages;\n    }\n\n    if (!Array.isArray(stages) || !stages.length)\n    {\n      throw new Error(`TriPoolAllocator: struct \"${structName}\" stages must be a non-empty array`);\n    }\n\n    for (const stage of stages)\n    {\n      if (!TriPoolAllocator.Stages.includes(stage))\n      {\n        throw new Error(`TriPoolAllocator: struct \"${structName}\" has unknown stage \"${stage}\" (expected one of: ${TriPoolAllocator.Stages.join(\", \")})`);\n      }\n    }\n\n    if (new Set(stages).size !== stages.length)\n    {\n      throw new Error(`TriPoolAllocator: struct \"${structName}\" declares a duplicate stage`);\n    }\n\n    return Object.freeze([...stages]);\n  }\n\n  static defaultStages = Object.freeze([\"vs\"]);\n\n  /**\n   * Normalize a raw def: default elements to 1, resolve size-as-defaults-array,\n   * require a name and encoding. Physical offsets are NOT computed here - they\n   * are resolved at registration, from the catalog or by tight packing.\n   */\n  static normalizeDef(def)\n  {\n    return def.map(field =>\n    {\n      if (!field.name)\n      {\n        throw new Error(\"TriPoolAllocator: every struct field needs a name\");\n      }\n\n      if (!field.encoding)\n      {\n        throw new Error(`TriPoolAllocator: field \"${field.name}\" needs an encoding (TriPoolAllocator.Type.*)`);\n      }\n\n      let size = field.size;\n      let defaultValue = field.default ?? null;\n\n      if (Array.isArray(size))\n      {\n        defaultValue = size;\n        size = size.length;\n      }\n\n      if (!Number.isInteger(size) || size <= 0)\n      {\n        throw new Error(`TriPoolAllocator: field \"${field.name}\" needs a positive integer size`);\n      }\n\n      return {\n        name: field.name,\n        elements: Number.isInteger(field.elements) && field.elements > 0 ? field.elements : 1,\n        size,\n        encoding: field.encoding,\n        default: defaultValue\n      };\n    });\n  }\n\n}\n"],"names":["CATALOG_ENCODINGS","CjsPerObjectLayouts","Types","MATRIX4","RawDataType","MATRIX","UINT32","UINT","INT32","INT","catalogDef","layout","def","field","fields","values","value","default","count","Array","from","length","flat","push","name","size","elements","encoding","type","VECTOR","catalogLayout","structName","Get","offset","stride","tightLayout","normalized","TriPoolAllocator","Map","constructor","options","Number","isInteger","chunkFloats","Register","structs","Object","keys","entry","isArray","RegisterStruct","stages","undefined","Error","normalizeDef","normalizeStages","resolved","defaults","set","Has","has","Alloc","get","start","floats","subarray","uints","preset","index","RawData","Reset","#AddChunk","chunk","Float32Array","Uint32Array","buffer","Type","Stages","freeze","defaultStages","stage","includes","join","Set","map","defaultValue"],"mappings":";;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA;AACA,MAAMA,iBAAiB,GAAG;EACxB,CAACC,mBAAmB,CAACC,KAAK,CAACC,OAAO,GAAGC,WAAW,CAACC,MAAM;EACvD,CAACJ,mBAAmB,CAACC,KAAK,CAACI,MAAM,GAAGF,WAAW,CAACG,IAAI;AACpD,EAAA,CAACN,mBAAmB,CAACC,KAAK,CAACM,KAAK,GAAGJ,WAAW,CAACK;AACjD,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAUA,CAACC,MAAM,EAC1B;EACE,MAAMC,GAAG,GAAG,EAAE;EAEd,KAAK,MAAMC,KAAK,IAAIF,MAAM,CAACG,MAAM,CAACC,MAAM,EAAE,EAC1C;IACE,IAAIC,KAAK,GAAG,IAAI;IAEhB,IAAIH,KAAK,CAACI,OAAO,EACjB;MACED,KAAK,GAAGH,KAAK,CAACK,KAAK,GAAG,CAAC,GACnBC,KAAK,CAACC,IAAI,CAAC;QAAEC,MAAM,EAAER,KAAK,CAACK;AAAM,OAAC,EAAE,MAAM,CAAE,GAAGL,KAAK,CAACI,OAAO,CAAE,CAAC,CAACK,IAAI,EAAE,GACtE,CAAE,GAAGT,KAAK,CAACI,OAAO,CAAE;AAC1B,IAAA;IAEAL,GAAG,CAACW,IAAI,CAAC;MACPC,IAAI,EAAEX,KAAK,CAACW,IAAI;MAChBC,IAAI,EAAEZ,KAAK,CAACY,IAAI;MAChBC,QAAQ,EAAEb,KAAK,CAACK,KAAK;MACrBS,QAAQ,EAAE3B,iBAAiB,CAACa,KAAK,CAACe,IAAI,CAAC,IAAIxB,WAAW,CAACyB,MAAM;AAC7DZ,MAAAA,OAAO,EAAED;AACX,KAAC,CAAC;AACJ,EAAA;AAEA,EAAA,OAAOJ,GAAG;AACZ;;AAGA;AACA;AACA;AACA,SAASkB,aAAaA,CAACC,UAAU,EACjC;AACE,EAAA,MAAMpB,MAAM,GAAGV,mBAAmB,CAAC+B,GAAG,CAACD,UAAU,CAAC;EAElD,IAAI,CAACpB,MAAM,EACX;AACE,IAAA,OAAO,IAAI;AACb,EAAA;EAEA,MAAMG,MAAM,GAAG,EAAE;EAEjB,KAAK,MAAMD,KAAK,IAAIF,MAAM,CAACG,MAAM,CAACC,MAAM,EAAE,EAC1C;AACED,IAAAA,MAAM,CAACD,KAAK,CAACW,IAAI,CAAC,GAAG;MACnBS,MAAM,EAAEpB,KAAK,CAACoB,MAAM;MACpBR,IAAI,EAAEZ,KAAK,CAACY,IAAI;MAChBC,QAAQ,EAAEb,KAAK,CAACK,KAAK;MACrBS,QAAQ,EAAE3B,iBAAiB,CAACa,KAAK,CAACe,IAAI,CAAC,IAAIxB,WAAW,CAACyB;KACxD;AACH,EAAA;EAEA,OAAO;IAAEf,MAAM;IAAEoB,MAAM,EAAEvB,MAAM,CAACuB;GAAQ;AAC1C;;AAGA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAACC,UAAU,EAC/B;EACE,MAAMtB,MAAM,GAAG,EAAE;EACjB,IAAImB,MAAM,GAAG,CAAC;AAEd,EAAA,KAAK,MAAMpB,KAAK,IAAIuB,UAAU,EAC9B;AACEtB,IAAAA,MAAM,CAACD,KAAK,CAACW,IAAI,CAAC,GAAG;MACnBS,MAAM;MACNR,IAAI,EAAEZ,KAAK,CAACY,IAAI;MAChBC,QAAQ,EAAEb,KAAK,CAACa,QAAQ;MACxBC,QAAQ,EAAEd,KAAK,CAACc;KACjB;AACDM,IAAAA,MAAM,IAAIpB,KAAK,CAACY,IAAI,GAAGZ,KAAK,CAACa,QAAQ;AACvC,EAAA;EAEA,OAAO;IAAEZ,MAAM;AAAEoB,IAAAA,MAAM,EAAED;GAAQ;AACnC;;AAGA;AACO,MAAMI,gBAAgB,CAC7B;AACE;AACA,EAAA,QAAQ,GAAG,IAAIC,GAAG,EAAE;;AAEpB;EACA,OAAO,GAAG,EAAE;EAEZ,aAAa,GAAG,EAAE;;AAElB;EACA,YAAY,GAAG,IAAI;EAEnB,WAAW,GAAG,CAAC;EAEf,OAAO,GAAG,CAAC;;AAEX;AACF;AACA;AACA;AACEC,EAAAA,WAAWA,CAACC,OAAO,GAAG,EAAE,EACxB;AACE,IAAA,IAAIC,MAAM,CAACC,SAAS,CAACF,OAAO,CAACG,WAAW,CAAC,IAAIH,OAAO,CAACG,WAAW,GAAG,CAAC,EACpE;AACE,MAAA,IAAI,CAAC,YAAY,GAAGH,OAAO,CAACG,WAAW;AACzC,IAAA;AAEA,IAAA,IAAI,CAAC,SAAS,EAAE;AAClB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEC,QAAQA,CAACC,OAAO,EAChB;IACE,KAAK,MAAMrB,IAAI,IAAIsB,MAAM,CAACC,IAAI,CAACF,OAAO,CAAC,EACvC;AACE,MAAA,MAAMG,KAAK,GAAGH,OAAO,CAACrB,IAAI,CAAC;AAE3B,MAAA,IAAIL,KAAK,CAAC8B,OAAO,CAACD,KAAK,CAAC,EACxB;AACE,QAAA,IAAI,CAACE,cAAc,CAAC1B,IAAI,EAAEwB,KAAK,CAAC;AAClC,MAAA,CAAC,MAED;QACE,IAAI,CAACE,cAAc,CAAC1B,IAAI,EAAEwB,KAAK,CAACpC,GAAG,EAAE;UAAEuC,MAAM,EAAEH,KAAK,CAACG;AAAO,SAAC,CAAC;AAChE,MAAA;AACF,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACED,cAAcA,CAAC1B,IAAI,EAAEZ,GAAG,EAAE4B,OAAO,GAAG,EAAE,EACtC;IACE,IAAI5B,GAAG,KAAKwC,SAAS,EACrB;AACE;AACA,MAAA,MAAMzC,MAAM,GAAGV,mBAAmB,CAAC+B,GAAG,CAACR,IAAI,CAAC;MAE5C,IAAI,CAACb,MAAM,EACX;AACE,QAAA,MAAM,IAAI0C,KAAK,CACb,CAAA,0BAAA,EAA6B7B,IAAI,0EACnC,CAAC;AACH,MAAA;AAEAZ,MAAAA,GAAG,GAAGF,UAAU,CAACC,MAAM,CAAC;AACxB6B,MAAAA,OAAO,GAAG;AAAE,QAAA,GAAGA,OAAO;AAAEW,QAAAA,MAAM,EAAEX,OAAO,CAACW,MAAM,IAAIxC,MAAM,CAACwC;OAAQ;AACnE,IAAA;AAEA,IAAA,MAAMf,UAAU,GAAGC,gBAAgB,CAACiB,YAAY,CAAC1C,GAAG,CAAC;IACrD,MAAMuC,MAAM,GAAGd,gBAAgB,CAACkB,eAAe,CAAC/B,IAAI,EAAEgB,OAAO,CAACW,MAAM,CAAC;;AAErE;AACA;IACA,MAAMK,QAAQ,GAAG1B,aAAa,CAACN,IAAI,CAAC,IAAIW,WAAW,CAACC,UAAU,CAAC;IAE/D,IAAIoB,QAAQ,CAACtB,MAAM,GAAG,IAAI,CAAC,YAAY,EACvC;AACE,MAAA,MAAM,IAAImB,KAAK,CAAC,CAAA,0BAAA,EAA6B7B,IAAI,CAAA,GAAA,EAAMgC,QAAQ,CAACtB,MAAM,oCAAoC,IAAI,CAAC,YAAY,GAAG,CAAC;AACjI,IAAA;IAEA,MAAMuB,QAAQ,GAAG,EAAE;AAEnB,IAAA,KAAK,MAAM5C,KAAK,IAAIuB,UAAU,EAC9B;MACE,IAAIvB,KAAK,CAACI,OAAO,EACjB;QACE,MAAM+B,KAAK,GAAGQ,QAAQ,CAAC1C,MAAM,CAACD,KAAK,CAACW,IAAI,CAAC;AAEzC,QAAA,IAAIwB,KAAK,EACT;UACES,QAAQ,CAAClC,IAAI,CAAC;YAAEU,MAAM,EAAEe,KAAK,CAACf,MAAM;YAAElB,MAAM,EAAEF,KAAK,CAACI;AAAQ,WAAC,CAAC;AAChE,QAAA;AACF,MAAA;AACF,IAAA;AAEA,IAAA,IAAI,CAAC,QAAQ,CAACyC,GAAG,CAAClC,IAAI,EAAE;MAAEV,MAAM,EAAE0C,QAAQ,CAAC1C,MAAM;MAAEoB,MAAM,EAAEsB,QAAQ,CAACtB,MAAM;MAAEuB,QAAQ;AAAEN,MAAAA;AAAO,KAAC,CAAC;AAE/F,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;EACAQ,GAAGA,CAACnC,IAAI,EACR;IACE,OAAO,IAAI,CAAC,QAAQ,CAACoC,GAAG,CAACpC,IAAI,CAAC;AAChC,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACEqC,KAAKA,CAACrC,IAAI,EACV;IACE,MAAMb,MAAM,GAAG,IAAI,CAAC,QAAQ,CAACmD,GAAG,CAACtC,IAAI,CAAC;IAEtC,IAAI,CAACb,MAAM,EACX;AACE,MAAA,MAAM,IAAI0C,KAAK,CAAC,CAAA,0BAAA,EAA6B7B,IAAI,wEAAwE,CAAC;AAC5H,IAAA;AAEA,IAAA,MAAMU,MAAM,GAAGvB,MAAM,CAACuB,MAAM;IAE5B,IAAI,IAAI,CAAC,OAAO,GAAGA,MAAM,GAAG,IAAI,CAAC,YAAY,EAC7C;MACE,IAAI,CAAC,WAAW,EAAE;AAClB,MAAA,IAAI,CAAC,OAAO,GAAG,CAAC;MAEhB,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAACb,MAAM,EAC3C;AACE,QAAA,IAAI,CAAC,SAAS,EAAE;AAClB,MAAA;AACF,IAAA;AAEA,IAAA,MAAM0C,KAAK,GAAG,IAAI,CAAC,OAAO;AAC1B,IAAA,IAAI,CAAC,OAAO,IAAI7B,MAAM;IAEtB,MAAM8B,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAACC,QAAQ,CAACF,KAAK,EAAEA,KAAK,GAAG7B,MAAM,CAAC;IAC7E,MAAMgC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAACD,QAAQ,CAACF,KAAK,EAAEA,KAAK,GAAG7B,MAAM,CAAC;AAElF,IAAA,KAAK,MAAMiC,MAAM,IAAIxD,MAAM,CAAC8C,QAAQ,EACpC;AACE,MAAA,MAAM1C,MAAM,GAAGoD,MAAM,CAACpD,MAAM;AAE5B,MAAA,KAAK,IAAIqD,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGrD,MAAM,CAACM,MAAM,EAAE+C,KAAK,EAAE,EAClD;QACEJ,MAAM,CAACG,MAAM,CAAClC,MAAM,GAAGmC,KAAK,CAAC,GAAGrD,MAAM,CAACqD,KAAK,CAAC;AAC/C,MAAA;AACF,IAAA;IAEA,OAAO,IAAIC,OAAO,CAAC1D,MAAM,EAAEqD,MAAM,EAAEE,KAAK,EAAE1C,IAAI,CAAC;AACjD,EAAA;;AAEA;AACF;AACA;AACA;AACE8C,EAAAA,KAAKA,GACL;AACE,IAAA,IAAI,CAAC,WAAW,GAAG,CAAC;AACpB,IAAA,IAAI,CAAC,OAAO,GAAG,CAAC;AAClB,EAAA;;AAEA;AACF;AACA;AACA;EACE,SAASC,GACT;IACE,MAAMC,KAAK,GAAG,IAAIC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC;AACjD,IAAA,IAAI,CAAC,OAAO,CAAClD,IAAI,CAACiD,KAAK,CAAC;AACxB,IAAA,IAAI,CAAC,aAAa,CAACjD,IAAI,CAAC,IAAImD,WAAW,CAACF,KAAK,CAACG,MAAM,CAAC,CAAC;AACxD,EAAA;;AAEA;EACA,OAAOC,IAAI,GAAGxE,WAAW;;AAEzB;AACA,EAAA,OAAOyE,MAAM,GAAG/B,MAAM,CAACgC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;;AAEnE;AACF;AACA;AACA;AACA;AACE,EAAA,OAAOvB,eAAeA,CAACxB,UAAU,EAAEoB,MAAM,EACzC;AACE,IAAA,IAAIA,MAAM,KAAKC,SAAS,IAAID,MAAM,KAAK,IAAI,EAC3C;MACE,OAAOd,gBAAgB,CAAC0C,aAAa;AACvC,IAAA;AAEA,IAAA,IAAI,CAAC5D,KAAK,CAAC8B,OAAO,CAACE,MAAM,CAAC,IAAI,CAACA,MAAM,CAAC9B,MAAM,EAC5C;AACE,MAAA,MAAM,IAAIgC,KAAK,CAAC,CAAA,0BAAA,EAA6BtB,UAAU,oCAAoC,CAAC;AAC9F,IAAA;AAEA,IAAA,KAAK,MAAMiD,KAAK,IAAI7B,MAAM,EAC1B;MACE,IAAI,CAACd,gBAAgB,CAACwC,MAAM,CAACI,QAAQ,CAACD,KAAK,CAAC,EAC5C;AACE,QAAA,MAAM,IAAI3B,KAAK,CAAC,CAAA,0BAAA,EAA6BtB,UAAU,wBAAwBiD,KAAK,CAAA,oBAAA,EAAuB3C,gBAAgB,CAACwC,MAAM,CAACK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACnJ,MAAA;AACF,IAAA;IAEA,IAAI,IAAIC,GAAG,CAAChC,MAAM,CAAC,CAAC1B,IAAI,KAAK0B,MAAM,CAAC9B,MAAM,EAC1C;AACE,MAAA,MAAM,IAAIgC,KAAK,CAAC,CAAA,0BAAA,EAA6BtB,UAAU,8BAA8B,CAAC;AACxF,IAAA;IAEA,OAAOe,MAAM,CAACgC,MAAM,CAAC,CAAC,GAAG3B,MAAM,CAAC,CAAC;AACnC,EAAA;EAEA,OAAO4B,aAAa,GAAGjC,MAAM,CAACgC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;;AAE5C;AACF;AACA;AACA;AACA;EACE,OAAOxB,YAAYA,CAAC1C,GAAG,EACvB;AACE,IAAA,OAAOA,GAAG,CAACwE,GAAG,CAACvE,KAAK,IACpB;AACE,MAAA,IAAI,CAACA,KAAK,CAACW,IAAI,EACf;AACE,QAAA,MAAM,IAAI6B,KAAK,CAAC,mDAAmD,CAAC;AACtE,MAAA;AAEA,MAAA,IAAI,CAACxC,KAAK,CAACc,QAAQ,EACnB;QACE,MAAM,IAAI0B,KAAK,CAAC,CAAA,yBAAA,EAA4BxC,KAAK,CAACW,IAAI,+CAA+C,CAAC;AACxG,MAAA;AAEA,MAAA,IAAIC,IAAI,GAAGZ,KAAK,CAACY,IAAI;AACrB,MAAA,IAAI4D,YAAY,GAAGxE,KAAK,CAACI,OAAO,IAAI,IAAI;AAExC,MAAA,IAAIE,KAAK,CAAC8B,OAAO,CAACxB,IAAI,CAAC,EACvB;AACE4D,QAAAA,YAAY,GAAG5D,IAAI;QACnBA,IAAI,GAAGA,IAAI,CAACJ,MAAM;AACpB,MAAA;MAEA,IAAI,CAACoB,MAAM,CAACC,SAAS,CAACjB,IAAI,CAAC,IAAIA,IAAI,IAAI,CAAC,EACxC;QACE,MAAM,IAAI4B,KAAK,CAAC,CAAA,yBAAA,EAA4BxC,KAAK,CAACW,IAAI,iCAAiC,CAAC;AAC1F,MAAA;MAEA,OAAO;QACLA,IAAI,EAAEX,KAAK,CAACW,IAAI;QAChBE,QAAQ,EAAEe,MAAM,CAACC,SAAS,CAAC7B,KAAK,CAACa,QAAQ,CAAC,IAAIb,KAAK,CAACa,QAAQ,GAAG,CAAC,GAAGb,KAAK,CAACa,QAAQ,GAAG,CAAC;QACrFD,IAAI;QACJE,QAAQ,EAAEd,KAAK,CAACc,QAAQ;AACxBV,QAAAA,OAAO,EAAEoE;OACV;AACH,IAAA,CAAC,CAAC;AACJ,EAAA;AAEF;;;;"}

package/dist/trinityCore/rawData/constantLayout.js

@@ -0,0 +1,175 @@
+// The shared machinery behind the constant-data catalogs.
+//
+// C++ gets a struct's layout free from the type system, so Carbon never
+// declares one; JavaScript has to. Two catalogs need the same declaration
+// vocabulary and the same resolver - CjsPerObjectLayouts (per draw) and
+// CjsPerFrameLayouts (per frame) - so it lives here rather than being forked.
+//
+// Carbon uploads both kinds by memcpy'ing the C++ struct straight into the
+// constant buffer, so the C++ declaration order IS the byte layout the shader
+// reads. Field ORDER and field SIZE are therefore the entire binding contract:
+// renaming a field is safe, reordering or resizing one silently shifts every
+// field after it.
+
+/**
+ * Declared C++ member types. String values rather than ordinals so a typo
+ * throws at lookup instead of silently packing wrong, and a layout dump reads
+ * `"matrix4"` rather than `3`.
+ */
+const Types = Object.freeze({
+  /** 16 floats. Stored transposed; written with SetAndTranspose. */
+  MATRIX4: "matrix4",
+  /** 4 floats. */
+  QUATERNION: "quaternion",
+  /** 4 floats. */
+  VECTOR4: "vector4",
+  /** 4 floats - Carbon `Color` (BlueVectorTypes.h:46: `float r, g, b, a`). */
+  COLOR: "color",
+  /** 3 floats. */
+  VECTOR3: "vector3",
+  /** 2 floats. */
+  VECTOR2: "vector2",
+  /** 1 float. */
+  FLOAT: "float",
+  /** 1 lane, bit-cast into the buffer's Uint32 view. */
+  UINT32: "uint32",
+  /** 1 lane, two's-complement bit-cast. */
+  INT32: "int32"
+});
+
+/** Float lanes per declared type. */
+const LANES = Object.freeze({
+  [Types.MATRIX4]: 16,
+  [Types.QUATERNION]: 4,
+  [Types.VECTOR4]: 4,
+  [Types.COLOR]: 4,
+  [Types.VECTOR3]: 3,
+  [Types.VECTOR2]: 2,
+  [Types.FLOAT]: 1,
+  [Types.UINT32]: 1,
+  [Types.INT32]: 1
+});
+
+/**
+ * Declared type -> the encoder kind that writes its bytes. These are the string
+ * values of `RawDataType`, written literally rather than imported so this
+ * module stays free of a cycle (RawData imports the catalogs, which import
+ * this). Anything absent encodes as `"vector"`.
+ */
+const ENCODINGS = Object.freeze({
+  [Types.MATRIX4]: "matrix",
+  [Types.UINT32]: "uint",
+  [Types.INT32]: "int"
+});
+
+/** Which stages each buffer key binds to. */
+const STAGES = Object.freeze({
+  vs: Object.freeze(["vs"]),
+  ps: Object.freeze(["ps"]),
+  shared: Object.freeze(["vs", "ps"])
+});
+const ZERO4 = Object.freeze([0, 0, 0, 0]);
+const IDENTITY = Object.freeze([1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
+
+/**
+ * Resolves every group's buffers into flat, offset-bearing layouts, keyed by
+ * struct name. `owner` names the calling catalog so a thrown message points at
+ * the file to fix.
+ */
+function buildLayouts(groups, owner) {
+  const layouts = new Map();
+  for (const [group, buffers] of Object.entries(groups)) {
+    for (const [key, buffer] of Object.entries(buffers)) {
+      if (layouts.has(buffer.struct)) {
+        throw new Error(`${owner}: duplicate struct name "${buffer.struct}"`);
+      }
+      layouts.set(buffer.struct, resolveLayout(group, key, buffer, owner));
+    }
+  }
+  return layouts;
+}
+
+/** Lays out one buffer, asserting Carbon's two register invariants. */
+function resolveLayout(group, key, buffer, owner) {
+  const fields = new Map();
+  let offset = 0;
+  for (const [name, declared] of Object.entries(buffer.fields)) {
+    const lanes = LANES[declared.type];
+    if (lanes === undefined) {
+      throw new Error(`${owner}: ${buffer.struct}.${name} has unknown type "${declared.type}"`);
+    }
+    const count = declared.count ?? 1;
+
+    // Carbon hand-pads these structs so no float4-sized member ever needs
+    // implicit padding. A catalog entry that breaks that is wrong, so it
+    // fails loud rather than silently inserting a gap.
+    if (lanes >= 4 && offset % 4) {
+      throw new Error(`${owner}: ${buffer.struct}.${name} would start at float ${offset}, ` + "which is not a register boundary");
+    }
+    fields.set(name, {
+      name,
+      type: declared.type,
+      offset,
+      size: lanes,
+      count,
+      default: declared.default ?? null,
+      isMatrix: declared.type === Types.MATRIX4,
+      isInteger: declared.type === Types.UINT32 || declared.type === Types.INT32
+    });
+    offset += lanes * count;
+  }
+
+  // Tr2PerObjectData.h:57 - "Size of per-object data must be a multiple of
+  // Vector4". The same holds for a per-frame buffer's registers. Reproduced
+  // so a bad catalog entry fails at build, not on screen.
+  if (offset % 4) {
+    throw new Error(`${owner}: ${buffer.struct} is ${offset} floats, not a multiple of Vector4`);
+  }
+  return Object.freeze({
+    struct: buffer.struct,
+    group,
+    key,
+    stages: STAGES[key] ?? STAGES.vs,
+    fields,
+    stride: offset,
+    registerCount: offset / 4
+  });
+}
+
+/**
+ * A resolved layout in the shape RawData consumes: float offsets keyed by
+ * name, plus the stride, stages, and the defaults to apply on allocation.
+ *
+ * A default on an array field is repeated across every element: the neutral
+ * for a slot - identity for an unused custom mask - applies to every slot, not
+ * just the first.
+ */
+function toRawLayout(layout) {
+  const fields = {};
+  const defaults = [];
+  for (const field of layout.fields.values()) {
+    fields[field.name] = {
+      offset: field.offset,
+      size: field.size,
+      elements: field.count,
+      encoding: ENCODINGS[field.type] ?? "vector"
+    };
+    if (field.default) {
+      defaults.push({
+        offset: field.offset,
+        values: field.count > 1 ? Array.from({
+          length: field.count
+        }, () => [...field.default]).flat() : [...field.default]
+      });
+    }
+  }
+  return {
+    fields,
+    stride: layout.stride,
+    stages: layout.stages,
+    defaults
+  };
+}
+
+export { ENCODINGS, IDENTITY, LANES, STAGES, Types, ZERO4, buildLayouts, resolveLayout, toRawLayout };
+//# sourceMappingURL=constantLayout.js.map

package/dist/trinityCore/rawData/constantLayout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constantLayout.js","sources":["../../../../src/trinityCore/rawData/constantLayout.js"],"sourcesContent":["// The shared machinery behind the constant-data catalogs.\n//\n// C++ gets a struct's layout free from the type system, so Carbon never\n// declares one; JavaScript has to. Two catalogs need the same declaration\n// vocabulary and the same resolver - CjsPerObjectLayouts (per draw) and\n// CjsPerFrameLayouts (per frame) - so it lives here rather than being forked.\n//\n// Carbon uploads both kinds by memcpy'ing the C++ struct straight into the\n// constant buffer, so the C++ declaration order IS the byte layout the shader\n// reads. Field ORDER and field SIZE are therefore the entire binding contract:\n// renaming a field is safe, reordering or resizing one silently shifts every\n// field after it.\n\n\n/**\n * Declared C++ member types. String values rather than ordinals so a typo\n * throws at lookup instead of silently packing wrong, and a layout dump reads\n * `\"matrix4\"` rather than `3`.\n */\nexport const Types = Object.freeze({\n    /** 16 floats. Stored transposed; written with SetAndTranspose. */\n    MATRIX4: \"matrix4\",\n\n    /** 4 floats. */\n    QUATERNION: \"quaternion\",\n\n    /** 4 floats. */\n    VECTOR4: \"vector4\",\n\n    /** 4 floats - Carbon `Color` (BlueVectorTypes.h:46: `float r, g, b, a`). */\n    COLOR: \"color\",\n\n    /** 3 floats. */\n    VECTOR3: \"vector3\",\n\n    /** 2 floats. */\n    VECTOR2: \"vector2\",\n\n    /** 1 float. */\n    FLOAT: \"float\",\n\n    /** 1 lane, bit-cast into the buffer's Uint32 view. */\n    UINT32: \"uint32\",\n\n    /** 1 lane, two's-complement bit-cast. */\n    INT32: \"int32\"\n});\n\n\n/** Float lanes per declared type. */\nexport const LANES = Object.freeze({\n    [Types.MATRIX4]: 16,\n    [Types.QUATERNION]: 4,\n    [Types.VECTOR4]: 4,\n    [Types.COLOR]: 4,\n    [Types.VECTOR3]: 3,\n    [Types.VECTOR2]: 2,\n    [Types.FLOAT]: 1,\n    [Types.UINT32]: 1,\n    [Types.INT32]: 1\n});\n\n\n/**\n * Declared type -> the encoder kind that writes its bytes. These are the string\n * values of `RawDataType`, written literally rather than imported so this\n * module stays free of a cycle (RawData imports the catalogs, which import\n * this). Anything absent encodes as `\"vector\"`.\n */\nexport const ENCODINGS = Object.freeze({\n    [Types.MATRIX4]: \"matrix\",\n    [Types.UINT32]: \"uint\",\n    [Types.INT32]: \"int\"\n});\n\n\n/** Which stages each buffer key binds to. */\nexport const STAGES = Object.freeze({\n    vs: Object.freeze([\"vs\"]),\n    ps: Object.freeze([\"ps\"]),\n    shared: Object.freeze([\"vs\", \"ps\"])\n});\n\n\nexport const ZERO4 = Object.freeze([0, 0, 0, 0]);\n\n\nexport const IDENTITY = Object.freeze([\n    1, 0, 0, 0,\n    0, 1, 0, 0,\n    0, 0, 1, 0,\n    0, 0, 0, 1\n]);\n\n\n/**\n * Resolves every group's buffers into flat, offset-bearing layouts, keyed by\n * struct name. `owner` names the calling catalog so a thrown message points at\n * the file to fix.\n */\nexport function buildLayouts(groups, owner)\n{\n    const layouts = new Map();\n\n    for (const [group, buffers] of Object.entries(groups))\n    {\n        for (const [key, buffer] of Object.entries(buffers))\n        {\n            if (layouts.has(buffer.struct))\n            {\n                throw new Error(`${owner}: duplicate struct name \"${buffer.struct}\"`);\n            }\n\n            layouts.set(buffer.struct, resolveLayout(group, key, buffer, owner));\n        }\n    }\n\n    return layouts;\n}\n\n\n/** Lays out one buffer, asserting Carbon's two register invariants. */\nexport function resolveLayout(group, key, buffer, owner)\n{\n    const fields = new Map();\n    let offset = 0;\n\n    for (const [name, declared] of Object.entries(buffer.fields))\n    {\n        const lanes = LANES[declared.type];\n\n        if (lanes === undefined)\n        {\n            throw new Error(`${owner}: ${buffer.struct}.${name} has unknown type \"${declared.type}\"`);\n        }\n\n        const count = declared.count ?? 1;\n\n        // Carbon hand-pads these structs so no float4-sized member ever needs\n        // implicit padding. A catalog entry that breaks that is wrong, so it\n        // fails loud rather than silently inserting a gap.\n        if (lanes >= 4 && offset % 4)\n        {\n            throw new Error(\n                `${owner}: ${buffer.struct}.${name} would start at float ${offset}, `\n                + \"which is not a register boundary\"\n            );\n        }\n\n        fields.set(name, {\n            name,\n            type: declared.type,\n            offset,\n            size: lanes,\n            count,\n            default: declared.default ?? null,\n            isMatrix: declared.type === Types.MATRIX4,\n            isInteger: declared.type === Types.UINT32 || declared.type === Types.INT32\n        });\n\n        offset += lanes * count;\n    }\n\n    // Tr2PerObjectData.h:57 - \"Size of per-object data must be a multiple of\n    // Vector4\". The same holds for a per-frame buffer's registers. Reproduced\n    // so a bad catalog entry fails at build, not on screen.\n    if (offset % 4)\n    {\n        throw new Error(\n            `${owner}: ${buffer.struct} is ${offset} floats, not a multiple of Vector4`\n        );\n    }\n\n    return Object.freeze({\n        struct: buffer.struct,\n        group,\n        key,\n        stages: STAGES[key] ?? STAGES.vs,\n        fields,\n        stride: offset,\n        registerCount: offset / 4\n    });\n}\n\n\n/**\n * A resolved layout in the shape RawData consumes: float offsets keyed by\n * name, plus the stride, stages, and the defaults to apply on allocation.\n *\n * A default on an array field is repeated across every element: the neutral\n * for a slot - identity for an unused custom mask - applies to every slot, not\n * just the first.\n */\nexport function toRawLayout(layout)\n{\n    const fields = {};\n    const defaults = [];\n\n    for (const field of layout.fields.values())\n    {\n        fields[field.name] = {\n            offset: field.offset,\n            size: field.size,\n            elements: field.count,\n            encoding: ENCODINGS[field.type] ?? \"vector\"\n        };\n\n        if (field.default)\n        {\n            defaults.push({\n                offset: field.offset,\n                values: field.count > 1\n                    ? Array.from({ length: field.count }, () => [ ...field.default ]).flat()\n                    : [ ...field.default ]\n            });\n        }\n    }\n\n    return { fields, stride: layout.stride, stages: layout.stages, defaults };\n}\n"],"names":["Types","Object","freeze","MATRIX4","QUATERNION","VECTOR4","COLOR","VECTOR3","VECTOR2","FLOAT","UINT32","INT32","LANES","ENCODINGS","STAGES","vs","ps","shared","ZERO4","IDENTITY","buildLayouts","groups","owner","layouts","Map","group","buffers","entries","key","buffer","has","struct","Error","set","resolveLayout","fields","offset","name","declared","lanes","type","undefined","count","size","default","isMatrix","isInteger","stages","stride","registerCount","toRawLayout","layout","defaults","field","values","elements","encoding","push","Array","from","length","flat"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA;AACA;AACA;AACA;AACA;MACaA,KAAK,GAAGC,MAAM,CAACC,MAAM,CAAC;AAC/B;AACAC,EAAAA,OAAO,EAAE,SAAS;AAElB;AACAC,EAAAA,UAAU,EAAE,YAAY;AAExB;AACAC,EAAAA,OAAO,EAAE,SAAS;AAElB;AACAC,EAAAA,KAAK,EAAE,OAAO;AAEd;AACAC,EAAAA,OAAO,EAAE,SAAS;AAElB;AACAC,EAAAA,OAAO,EAAE,SAAS;AAElB;AACAC,EAAAA,KAAK,EAAE,OAAO;AAEd;AACAC,EAAAA,MAAM,EAAE,QAAQ;AAEhB;AACAC,EAAAA,KAAK,EAAE;AACX,CAAC;;AAGD;MACaC,KAAK,GAAGX,MAAM,CAACC,MAAM,CAAC;AAC/B,EAAA,CAACF,KAAK,CAACG,OAAO,GAAG,EAAE;AACnB,EAAA,CAACH,KAAK,CAACI,UAAU,GAAG,CAAC;AACrB,EAAA,CAACJ,KAAK,CAACK,OAAO,GAAG,CAAC;AAClB,EAAA,CAACL,KAAK,CAACM,KAAK,GAAG,CAAC;AAChB,EAAA,CAACN,KAAK,CAACO,OAAO,GAAG,CAAC;AAClB,EAAA,CAACP,KAAK,CAACQ,OAAO,GAAG,CAAC;AAClB,EAAA,CAACR,KAAK,CAACS,KAAK,GAAG,CAAC;AAChB,EAAA,CAACT,KAAK,CAACU,MAAM,GAAG,CAAC;EACjB,CAACV,KAAK,CAACW,KAAK,GAAG;AACnB,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;MACaE,SAAS,GAAGZ,MAAM,CAACC,MAAM,CAAC;AACnC,EAAA,CAACF,KAAK,CAACG,OAAO,GAAG,QAAQ;AACzB,EAAA,CAACH,KAAK,CAACU,MAAM,GAAG,MAAM;EACtB,CAACV,KAAK,CAACW,KAAK,GAAG;AACnB,CAAC;;AAGD;MACaG,MAAM,GAAGb,MAAM,CAACC,MAAM,CAAC;EAChCa,EAAE,EAAEd,MAAM,CAACC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;EACzBc,EAAE,EAAEf,MAAM,CAACC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;EACzBe,MAAM,EAAEhB,MAAM,CAACC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;AACtC,CAAC;MAGYgB,KAAK,GAAGjB,MAAM,CAACC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;MAGlCiB,QAAQ,GAAGlB,MAAM,CAACC,MAAM,CAAC,CAClC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACV,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACV,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACV,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CACb;;AAGD;AACA;AACA;AACA;AACA;AACO,SAASkB,YAAYA,CAACC,MAAM,EAAEC,KAAK,EAC1C;AACI,EAAA,MAAMC,OAAO,GAAG,IAAIC,GAAG,EAAE;AAEzB,EAAA,KAAK,MAAM,CAACC,KAAK,EAAEC,OAAO,CAAC,IAAIzB,MAAM,CAAC0B,OAAO,CAACN,MAAM,CAAC,EACrD;AACI,IAAA,KAAK,MAAM,CAACO,GAAG,EAAEC,MAAM,CAAC,IAAI5B,MAAM,CAAC0B,OAAO,CAACD,OAAO,CAAC,EACnD;MACI,IAAIH,OAAO,CAACO,GAAG,CAACD,MAAM,CAACE,MAAM,CAAC,EAC9B;QACI,MAAM,IAAIC,KAAK,CAAC,CAAA,EAAGV,KAAK,4BAA4BO,MAAM,CAACE,MAAM,CAAA,CAAA,CAAG,CAAC;AACzE,MAAA;AAEAR,MAAAA,OAAO,CAACU,GAAG,CAACJ,MAAM,CAACE,MAAM,EAAEG,aAAa,CAACT,KAAK,EAAEG,GAAG,EAAEC,MAAM,EAAEP,KAAK,CAAC,CAAC;AACxE,IAAA;AACJ,EAAA;AAEA,EAAA,OAAOC,OAAO;AAClB;;AAGA;AACO,SAASW,aAAaA,CAACT,KAAK,EAAEG,GAAG,EAAEC,MAAM,EAAEP,KAAK,EACvD;AACI,EAAA,MAAMa,MAAM,GAAG,IAAIX,GAAG,EAAE;EACxB,IAAIY,MAAM,GAAG,CAAC;AAEd,EAAA,KAAK,MAAM,CAACC,IAAI,EAAEC,QAAQ,CAAC,IAAIrC,MAAM,CAAC0B,OAAO,CAACE,MAAM,CAACM,MAAM,CAAC,EAC5D;AACI,IAAA,MAAMI,KAAK,GAAG3B,KAAK,CAAC0B,QAAQ,CAACE,IAAI,CAAC;IAElC,IAAID,KAAK,KAAKE,SAAS,EACvB;AACI,MAAA,MAAM,IAAIT,KAAK,CAAC,CAAA,EAAGV,KAAK,KAAKO,MAAM,CAACE,MAAM,CAAA,CAAA,EAAIM,IAAI,CAAA,mBAAA,EAAsBC,QAAQ,CAACE,IAAI,GAAG,CAAC;AAC7F,IAAA;AAEA,IAAA,MAAME,KAAK,GAAGJ,QAAQ,CAACI,KAAK,IAAI,CAAC;;AAEjC;AACA;AACA;AACA,IAAA,IAAIH,KAAK,IAAI,CAAC,IAAIH,MAAM,GAAG,CAAC,EAC5B;AACI,MAAA,MAAM,IAAIJ,KAAK,CACX,CAAA,EAAGV,KAAK,KAAKO,MAAM,CAACE,MAAM,CAAA,CAAA,EAAIM,IAAI,CAAA,sBAAA,EAAyBD,MAAM,CAAA,EAAA,CAAI,GACnE,kCACN,CAAC;AACL,IAAA;AAEAD,IAAAA,MAAM,CAACF,GAAG,CAACI,IAAI,EAAE;MACbA,IAAI;MACJG,IAAI,EAAEF,QAAQ,CAACE,IAAI;MACnBJ,MAAM;AACNO,MAAAA,IAAI,EAAEJ,KAAK;MACXG,KAAK;AACLE,MAAAA,OAAO,EAAEN,QAAQ,CAACM,OAAO,IAAI,IAAI;AACjCC,MAAAA,QAAQ,EAAEP,QAAQ,CAACE,IAAI,KAAKxC,KAAK,CAACG,OAAO;AACzC2C,MAAAA,SAAS,EAAER,QAAQ,CAACE,IAAI,KAAKxC,KAAK,CAACU,MAAM,IAAI4B,QAAQ,CAACE,IAAI,KAAKxC,KAAK,CAACW;AACzE,KAAC,CAAC;IAEFyB,MAAM,IAAIG,KAAK,GAAGG,KAAK;AAC3B,EAAA;;AAEA;AACA;AACA;EACA,IAAIN,MAAM,GAAG,CAAC,EACd;AACI,IAAA,MAAM,IAAIJ,KAAK,CACX,CAAA,EAAGV,KAAK,CAAA,EAAA,EAAKO,MAAM,CAACE,MAAM,CAAA,IAAA,EAAOK,MAAM,CAAA,kCAAA,CAC3C,CAAC;AACL,EAAA;EAEA,OAAOnC,MAAM,CAACC,MAAM,CAAC;IACjB6B,MAAM,EAAEF,MAAM,CAACE,MAAM;IACrBN,KAAK;IACLG,GAAG;IACHmB,MAAM,EAAEjC,MAAM,CAACc,GAAG,CAAC,IAAId,MAAM,CAACC,EAAE;IAChCoB,MAAM;AACNa,IAAAA,MAAM,EAAEZ,MAAM;IACda,aAAa,EAAEb,MAAM,GAAG;AAC5B,GAAC,CAAC;AACN;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASc,WAAWA,CAACC,MAAM,EAClC;EACI,MAAMhB,MAAM,GAAG,EAAE;EACjB,MAAMiB,QAAQ,GAAG,EAAE;EAEnB,KAAK,MAAMC,KAAK,IAAIF,MAAM,CAAChB,MAAM,CAACmB,MAAM,EAAE,EAC1C;AACInB,IAAAA,MAAM,CAACkB,KAAK,CAAChB,IAAI,CAAC,GAAG;MACjBD,MAAM,EAAEiB,KAAK,CAACjB,MAAM;MACpBO,IAAI,EAAEU,KAAK,CAACV,IAAI;MAChBY,QAAQ,EAAEF,KAAK,CAACX,KAAK;AACrBc,MAAAA,QAAQ,EAAE3C,SAAS,CAACwC,KAAK,CAACb,IAAI,CAAC,IAAI;KACtC;IAED,IAAIa,KAAK,CAACT,OAAO,EACjB;MACIQ,QAAQ,CAACK,IAAI,CAAC;QACVrB,MAAM,EAAEiB,KAAK,CAACjB,MAAM;QACpBkB,MAAM,EAAED,KAAK,CAACX,KAAK,GAAG,CAAC,GACjBgB,KAAK,CAACC,IAAI,CAAC;UAAEC,MAAM,EAAEP,KAAK,CAACX;AAAM,SAAC,EAAE,MAAM,CAAE,GAAGW,KAAK,CAACT,OAAO,CAAE,CAAC,CAACiB,IAAI,EAAE,GACtE,CAAE,GAAGR,KAAK,CAACT,OAAO;AAC5B,OAAC,CAAC;AACN,IAAA;AACJ,EAAA;EAEA,OAAO;IAAET,MAAM;IAAEa,MAAM,EAAEG,MAAM,CAACH,MAAM;IAAED,MAAM,EAAEI,MAAM,CAACJ,MAAM;AAAEK,IAAAA;GAAU;AAC7E;;;;"}