@woosh/meep-engine 3.68.0 → 3.70.0

package/src/engine/graphics/trail/tube/tube_attributes_spec.js

@@ -1,70 +0,0 @@
-import { EndianType } from "../../../../core/binary/EndianType.js";
-import { BinaryDataType } from "../../../../core/binary/type/BinaryDataType.js";
-import { RowFirstTableSpec } from "../../../../core/collection/table/RowFirstTableSpec.js";
-
-/**
- * Per-vertex attribute layout for a {@link TubeX}.
- *
- * Unlike {@link RibbonX} (which extrudes in screen space and therefore stores
- * the neighbouring positions to derive a 2D normal), the tube extrudes in WORLD
- * space inside the vertex shader using a per-knot tangent frame. Every vertex of
- * a knot's ring shares the same centre/frame/colour/etc and differs only by `off`
- * (its angular position around the ring), so the heavy per-frame work is just
- * writing the knot centre + frame to the ring's `radial+1` rows.
- *
- * Layout is floats-first then a float16 colour triple, padded to a 4-byte multiple
- * so the interleaved Float32 view (stride = bytesPerRecord >> 2) stays aligned —
- * the same trick {@link ribbon_attributes_spec} relies on. The colour is linear and
- * not limited to 0..1, so a trail can be brighter than white.
- */
-export const tube_attributes_spec = new RowFirstTableSpec([
-    // age (CPU-side bookkeeping for the simulator; NOT a GPU attribute)
-    BinaryDataType.Float32,
-
-    // position (ring centre, world space)
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-
-    // frame normal (ring basis axis 1, world space, unit)
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-
-    // frame binormal (ring basis axis 2, world space, unit)
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-    BinaryDataType.Float32,
-
-    // off (angular position around the ring, 0..1; STATIC per radial index = uv.x)
-    BinaryDataType.Float32,
-
-    // uv_v (position along the tube; DYNAMIC = uv.y)
-    BinaryDataType.Float32,
-
-    // alpha
-    BinaryDataType.Float32,
-
-    // thickness (tube diameter; radius = thickness * 0.5)
-    BinaryDataType.Float32,
-
-    // color (linear, unbounded)
-    BinaryDataType.Float16,
-    BinaryDataType.Float16,
-    BinaryDataType.Float16,
-
-    // padding -> bytesPerRecord = 64 (divisible by 4, keeps the Float32 view aligned)
-    BinaryDataType.Uint16,
-
-], EndianType.LittleEndian);
-
-// Column indices into {@link tube_attributes_spec} for RowFirstTable read/write.
-export const TUBE_ATTRIBUTE_ADDRESS_AGE = 0;
-export const TUBE_ATTRIBUTE_ADDRESS_POSITION = 1;
-export const TUBE_ATTRIBUTE_ADDRESS_NORMAL = 4;
-export const TUBE_ATTRIBUTE_ADDRESS_BINORMAL = 7;
-export const TUBE_ATTRIBUTE_ADDRESS_OFF = 10;
-export const TUBE_ATTRIBUTE_ADDRESS_UV_V = 11;
-export const TUBE_ATTRIBUTE_ADDRESS_ALPHA = 12;
-export const TUBE_ATTRIBUTE_ADDRESS_THICKNESS = 13;
-export const TUBE_ATTRIBUTE_ADDRESS_COLOR = 14;

package/src/engine/graphics3/trail/trail_tube_write_geometry.d.ts

@@ -1,38 +0,0 @@
-/**
- * Extrude a {@link TubeX}'s knots into the geometry a {@link DynamicMesh} is already holding.
- *
- * **The ring is built here rather than in a shader, and that is what the path costs.** The legacy
- * renderer draws a tube through a material of its own, so its vertex stage can hold the knot's
- * frame and expand a ring from it; the dynamic path has one pipeline and one vertex layout —
- * position and colour (D11) — so the same expansion happens on the CPU, once per knot ring per
- * frame the trail moves. Widening the layout to carry a frame would mean a second pipeline for
- * every dynamic mesh in the engine, which is the trade D5/D11 already refused.
- *
- * The arithmetic is `TubeMaterialX`'s, exactly: a ring vertex sits at its knot's centre displaced
- * by `cos(angle) * normal + sin(angle) * binormal`, half a thickness out, at `angle = off * 2π`.
- *
- * **Written into rather than replaced.** GPU residency on the dynamic path is keyed on the geometry
- * and survives leaving the batch, so a trail that produced a fresh geometry each frame would strand
- * a vertex buffer per frame.
- *
- * Colour rides the vertices because that is what fades a trail along its length: the knot's own
- * half-float colour as is, unclamped so HDR survives, with its alpha — the simulator's age fade, already scaled by the trail's
- * base opacity — as the fourth channel. A knot that has aged out is written transparent rather than
- * dropped, which is what the index buffer expects, and blending takes it out of the picture.
- *
- * **A knot's alpha is the opacity of the tube as seen, not of one face of it.** The tube is a closed
- * hull drawn from both sides, so a line of sight through it crosses two faces, and the transparency
- * pipeline composes their transmittances: written as is, an alpha of 0.5 would cover 0.75, and a
- * linear fade would hold near solid for most of the trail's life and collapse at its tail. Each face
- * therefore takes half the optical depth, `1 - √(1 - α)`, and the two together cover exactly `α`.
- * This is the one place that knows the hull is crossed twice, so it is the one place that splits it;
- * a ray through a bend crosses the tube twice over, and that overlap is real and reads denser. The
- * alpha is clamped to `0..1` first, the range an opacity has — an authored fade curve may overshoot
- * it, and the square root has no answer above one.
- *
- * @param {Geometry} geometry
- * @param {TubeX} tube
- * @returns {void}
- */
-export function trail_tube_write_geometry(geometry: Geometry, tube: TubeX): void;
-//# sourceMappingURL=trail_tube_write_geometry.d.ts.map

package/src/engine/graphics3/trail/trail_tube_write_geometry.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"trail_tube_write_geometry.d.ts","sourceRoot":"","sources":["../../../../../src/engine/graphics3/trail/trail_tube_write_geometry.js"],"names":[],"mappings":"AAmBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,4EAFa,IAAI,CAiEhB"}

package/src/engine/graphics3/trail/trail_tube_write_geometry.js

@@ -1,119 +0,0 @@
-import { assert } from "../../../core/assert.js";
-import { clamp01 } from "../../../core/math/clamp01.js";
-import {
-    geometry_obtain_attribute,
-    geometry_obtain_index
-} from "../../../shade/renderer/geometry/geometry_obtain_attribute.js";
-import { StandardAttributes } from "../../../shade/renderer/geometry/StandardAttributes.js";
-import {
-    TUBE_ATTRIBUTE_ADDRESS_ALPHA,
-    TUBE_ATTRIBUTE_ADDRESS_BINORMAL,
-    TUBE_ATTRIBUTE_ADDRESS_COLOR,
-    TUBE_ATTRIBUTE_ADDRESS_NORMAL,
-    TUBE_ATTRIBUTE_ADDRESS_OFF,
-    TUBE_ATTRIBUTE_ADDRESS_POSITION,
-    TUBE_ATTRIBUTE_ADDRESS_THICKNESS
-} from "../../graphics/trail/tube/tube_attributes_spec.js";
-
-const TWO_PI = Math.PI * 2;
-
-/**
- * Extrude a {@link TubeX}'s knots into the geometry a {@link DynamicMesh} is already holding.
- *
- * **The ring is built here rather than in a shader, and that is what the path costs.** The legacy
- * renderer draws a tube through a material of its own, so its vertex stage can hold the knot's
- * frame and expand a ring from it; the dynamic path has one pipeline and one vertex layout —
- * position and colour (D11) — so the same expansion happens on the CPU, once per knot ring per
- * frame the trail moves. Widening the layout to carry a frame would mean a second pipeline for
- * every dynamic mesh in the engine, which is the trade D5/D11 already refused.
- *
- * The arithmetic is `TubeMaterialX`'s, exactly: a ring vertex sits at its knot's centre displaced
- * by `cos(angle) * normal + sin(angle) * binormal`, half a thickness out, at `angle = off * 2π`.
- *
- * **Written into rather than replaced.** GPU residency on the dynamic path is keyed on the geometry
- * and survives leaving the batch, so a trail that produced a fresh geometry each frame would strand
- * a vertex buffer per frame.
- *
- * Colour rides the vertices because that is what fades a trail along its length: the knot's own
- * half-float colour as is, unclamped so HDR survives, with its alpha — the simulator's age fade, already scaled by the trail's
- * base opacity — as the fourth channel. A knot that has aged out is written transparent rather than
- * dropped, which is what the index buffer expects, and blending takes it out of the picture.
- *
- * **A knot's alpha is the opacity of the tube as seen, not of one face of it.** The tube is a closed
- * hull drawn from both sides, so a line of sight through it crosses two faces, and the transparency
- * pipeline composes their transmittances: written as is, an alpha of 0.5 would cover 0.75, and a
- * linear fade would hold near solid for most of the trail's life and collapse at its tail. Each face
- * therefore takes half the optical depth, `1 - √(1 - α)`, and the two together cover exactly `α`.
- * This is the one place that knows the hull is crossed twice, so it is the one place that splits it;
- * a ray through a bend crosses the tube twice over, and that overlap is real and reads denser. The
- * alpha is clamped to `0..1` first, the range an opacity has — an authored fade curve may overshoot
- * it, and the square root has no answer above one.
- *
- * @param {Geometry} geometry
- * @param {TubeX} tube
- * @returns {void}
- */
-export function trail_tube_write_geometry(geometry, tube) {
-    assert.defined(geometry, 'geometry');
-    assert.defined(tube, 'tube');
-
-    const vertex_count = tube.vertex_count;
-
-    const positions = geometry_obtain_attribute(geometry, StandardAttributes.Position, 3, vertex_count);
-    const colors = geometry_obtain_attribute(geometry, StandardAttributes.Color, 4, vertex_count);
-
-    const table = tube.table;
-
-    // Views over the knot rows, not a copy of them. Every attribute up to the colour is a float, so
-    // a column index is also its offset in the float view; the colour is three half floats at the
-    // column that follows them.
-    const floats = new Float32Array(table.data);
-    const halves = new Float16Array(table.data);
-
-    const float_stride = tube.bytes_per_vertex >> 2;
-    const half_stride = tube.bytes_per_vertex >> 1;
-
-    const color_offset = TUBE_ATTRIBUTE_ADDRESS_COLOR * 2;
-
-    for (let i = 0; i < vertex_count; i++) {
-        const f = i * float_stride;
-
-        const angle = floats[f + TUBE_ATTRIBUTE_ADDRESS_OFF] * TWO_PI;
-
-        const c = Math.cos(angle);
-        const s = Math.sin(angle);
-
-        const radius = floats[f + TUBE_ATTRIBUTE_ADDRESS_THICKNESS] * 0.5;
-
-        const nx = floats[f + TUBE_ATTRIBUTE_ADDRESS_NORMAL];
-        const ny = floats[f + TUBE_ATTRIBUTE_ADDRESS_NORMAL + 1];
-        const nz = floats[f + TUBE_ATTRIBUTE_ADDRESS_NORMAL + 2];
-
-        const bx = floats[f + TUBE_ATTRIBUTE_ADDRESS_BINORMAL];
-        const by = floats[f + TUBE_ATTRIBUTE_ADDRESS_BINORMAL + 1];
-        const bz = floats[f + TUBE_ATTRIBUTE_ADDRESS_BINORMAL + 2];
-
-        const p = i * 3;
-
-        positions[p] = floats[f + TUBE_ATTRIBUTE_ADDRESS_POSITION] + (c * nx + s * bx) * radius;
-        positions[p + 1] = floats[f + TUBE_ATTRIBUTE_ADDRESS_POSITION + 1] + (c * ny + s * by) * radius;
-        positions[p + 2] = floats[f + TUBE_ATTRIBUTE_ADDRESS_POSITION + 2] + (c * nz + s * bz) * radius;
-
-        const h = i * half_stride + color_offset;
-        const o = i * 4;
-
-        colors[o] = halves[h];
-        colors[o + 1] = halves[h + 1];
-        colors[o + 2] = halves[h + 2];
-        // half the optical depth: the face behind this one carries the other half
-        colors[o + 3] = 1 - Math.sqrt(1 - clamp01(floats[f + TUBE_ATTRIBUTE_ADDRESS_ALPHA]));
-    }
-
-    const source_indices = tube.indices;
-
-    const indices = geometry_obtain_index(geometry, source_indices.length);
-
-    indices.set(source_indices);
-
-    geometry.needsUpdate = true;
-}

package/src/shade/renderer/geometry/bvh/BLAS_REFIT_TARGET_STRUCT.d.ts

@@ -1,18 +0,0 @@
-/**
- * One tree in a batched refit: where it lives, and where its arrival counters live.
- *
- * The first five fields are what {@link GPUGeometryBVHManager#get_refit_target} answers, copied
- * out at the frame the batch's tables are built. The other two are the batch's own: a tree's
- * counters sit at `counters_offset` in one buffer that holds the counters of every tree in the
- * batch — a prefix sum of node counts — and `geometry_index` is the row whose meshlets the leaf
- * payloads index, which for a skinned clone is the clone's own row, the one skinning deformed.
- *
- * Read by {@link shader_blas_refit_batch} and {@link shader_blas_refit_batch_seed} once per
- * workgroup, through their workgroup lookups;
- * written by {@link GPUBLASRefitBatch} when the set of trees or their residency changes.
- *
- * @type {WebGPUStruct}
- */
-export const BLAS_REFIT_TARGET_STRUCT: WebGPUStruct;
-import { WebGPUStruct } from "../../shader/type/WebGPUStruct.js";
-//# sourceMappingURL=BLAS_REFIT_TARGET_STRUCT.d.ts.map

package/src/shade/renderer/geometry/bvh/BLAS_REFIT_TARGET_STRUCT.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"BLAS_REFIT_TARGET_STRUCT.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/geometry/bvh/BLAS_REFIT_TARGET_STRUCT.js"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;GAcG;AACH,uCAFU,YAAY,CAiCA;6BAhDO,mCAAmC"}

package/src/shade/renderer/geometry/bvh/BLAS_REFIT_TARGET_STRUCT.js

@@ -1,50 +0,0 @@
-import { u32 } from "../../shader/type/WEBGPU_WGSL_PRIMITIVE_TYPES.js";
-import { WebGPUStruct } from "../../shader/type/WebGPUStruct.js";
-
-/**
- * One tree in a batched refit: where it lives, and where its arrival counters live.
- *
- * The first five fields are what {@link GPUGeometryBVHManager#get_refit_target} answers, copied
- * out at the frame the batch's tables are built. The other two are the batch's own: a tree's
- * counters sit at `counters_offset` in one buffer that holds the counters of every tree in the
- * batch — a prefix sum of node counts — and `geometry_index` is the row whose meshlets the leaf
- * payloads index, which for a skinned clone is the clone's own row, the one skinning deformed.
- *
- * Read by {@link shader_blas_refit_batch} and {@link shader_blas_refit_batch_seed} once per
- * workgroup, through their workgroup lookups;
- * written by {@link GPUBLASRefitBatch} when the set of trees or their residency changes.
- *
- * @type {WebGPUStruct}
- */
-export const BLAS_REFIT_TARGET_STRUCT = WebGPUStruct.from({
-    /**
-     * u32 word this tree's node 0 starts at in the node arena.
-     */
-    node_word_offset: u32,
-    /**
-     * Where this tree's parents start in the parents arena.
-     */
-    parents_offset: u32,
-    /**
-     * Where this tree's leaf list starts in the leaf-node arena.
-     */
-    leaf_nodes_offset: u32,
-    /**
-     * Leaves in this tree — one triangle each, so also its triangle count.
-     */
-    leaf_count: u32,
-    /**
-     * Node slots the tree spans from `node_word_offset`, holes included — what the seeding pass
-     * covers before every refit.
-     */
-    node_count: u32,
-    /**
-     * Where this tree's arrival counters start in the batch's counters buffer, one word per node
-     * slot of the tree.
-     */
-    counters_offset: u32,
-    /**
-     * Row in the geometry table whose meshlets the leaf payloads index into.
-     */
-    geometry_index: u32,
-}, "BlasRefitTarget");

package/src/shade/renderer/geometry/bvh/bvh2_derive_topology.d.ts

@@ -1,23 +0,0 @@
-/**
- * The two things a refit needs to know about a tree it did not build: who each node's parent is, and
- * which nodes are the leaves.
- *
- * Read straight off the compressed node bytes — the same bytes that go to the GPU — rather than off
- * the `BVH` object they came from. That is deliberate: the arena holds `node_capacity` slots and a
- * `BVH` allocates from a free list, so the buffer contains holes that were never part of any tree
- * and whose child words are whatever the last occupant left. Walking from the root visits exactly
- * the tree, so a hole is never mistaken for a leaf and never gets a parent.
- *
- * Topology, not geometry. Every per-instance copy of a geometry has the same answer, so this is
- * derived once per source and shared — only bounds are per-instance.
- *
- * @param {ArrayBuffer} nodes compressed BVH2 nodes, 32 bytes each, root at node 0
- * @returns {{parents: Uint32Array, leaf_nodes: Uint32Array}} `parents` is indexed by node and holds
- * `BVH_NULL_NODE` for the root and for every slot the tree does not reach; `leaf_nodes` lists the
- * leaves in pre-order, which is the ordinal the refit dispatches one thread per.
- */
-export function bvh2_derive_topology(nodes: ArrayBuffer): {
-    parents: Uint32Array;
-    leaf_nodes: Uint32Array;
-};
-//# sourceMappingURL=bvh2_derive_topology.d.ts.map

package/src/shade/renderer/geometry/bvh/bvh2_derive_topology.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bvh2_derive_topology.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/geometry/bvh/bvh2_derive_topology.js"],"names":[],"mappings":"AAYA;;;;;;;;;;;;;;;;;GAiBG;AACH,4CALW,WAAW,GACT;IAAC,OAAO,EAAE,WAAW,CAAC;IAAC,UAAU,EAAE,WAAW,CAAA;CAAC,CA4D3D"}

package/src/shade/renderer/geometry/bvh/bvh2_derive_topology.js

@@ -1,87 +0,0 @@
-import { assert } from "../../../../core/assert.js";
-import {
-    BVH_NODE_CHILD_1_WORD,
-    BVH_NODE_CHILD_2_WORD,
-    BVH_NODE_STRIDE_WORDS
-} from "../../gpu_primitive/bvh/BVH_BUFFER_LAYOUT.js";
-
-/**
- * @type {number}
- */
-const BVH_NULL_NODE = 0xffffffff;
-
-/**
- * The two things a refit needs to know about a tree it did not build: who each node's parent is, and
- * which nodes are the leaves.
- *
- * Read straight off the compressed node bytes — the same bytes that go to the GPU — rather than off
- * the `BVH` object they came from. That is deliberate: the arena holds `node_capacity` slots and a
- * `BVH` allocates from a free list, so the buffer contains holes that were never part of any tree
- * and whose child words are whatever the last occupant left. Walking from the root visits exactly
- * the tree, so a hole is never mistaken for a leaf and never gets a parent.
- *
- * Topology, not geometry. Every per-instance copy of a geometry has the same answer, so this is
- * derived once per source and shared — only bounds are per-instance.
- *
- * @param {ArrayBuffer} nodes compressed BVH2 nodes, 32 bytes each, root at node 0
- * @returns {{parents: Uint32Array, leaf_nodes: Uint32Array}} `parents` is indexed by node and holds
- * `BVH_NULL_NODE` for the root and for every slot the tree does not reach; `leaf_nodes` lists the
- * leaves in pre-order, which is the ordinal the refit dispatches one thread per.
- */
-export function bvh2_derive_topology(nodes) {
-    assert.defined(nodes, 'nodes');
-
-    const words = new Uint32Array(nodes);
-
-    const node_count = Math.floor(words.length / BVH_NODE_STRIDE_WORDS);
-
-    assert.greaterThan(node_count, 0, 'node_count');
-
-    const parents = new Uint32Array(node_count).fill(BVH_NULL_NODE);
-
-    const leaf_nodes = [];
-
-    const stack = [0];
-
-    let visited = 0;
-
-    while (stack.length > 0) {
-        const node = stack.pop();
-
-        visited += 1;
-
-        assert.lessThanOrEqual(visited, node_count, 'walk visited more nodes than the buffer holds — the tree is not a tree');
-
-        const base = node * BVH_NODE_STRIDE_WORDS;
-
-        const child_1 = words[base + BVH_NODE_CHILD_1_WORD];
-
-        if (child_1 === BVH_NULL_NODE) {
-            leaf_nodes.push(node);
-
-            continue;
-        }
-
-        const child_2 = words[base + BVH_NODE_CHILD_2_WORD];
-
-        assert.greaterThan(child_1, 0, 'child_1 must be a non-root node');
-        assert.greaterThan(child_2, 0, 'child_2 must be a non-root node');
-        assert.lessThan(child_1, node_count, 'child_1 out of range');
-        assert.lessThan(child_2, node_count, 'child_2 out of range');
-        assert.notEqual(child_1, child_2, 'internal node children must be distinct');
-        assert.equal(parents[child_1], BVH_NULL_NODE, 'child_1 already has a parent');
-        assert.equal(parents[child_2], BVH_NULL_NODE, 'child_2 already has a parent');
-
-        parents[child_1] = node;
-        parents[child_2] = node;
-
-        // child_1 first out, so the leaf order is a pre-order walk rather than an artefact of
-        // which way the stack happens to run
-        stack.push(child_2, child_1);
-    }
-
-    return {
-        parents,
-        leaf_nodes: Uint32Array.from(leaf_nodes),
-    };
-}

package/src/shade/renderer/geometry/bvh/shader_blas_refit_batch.d.ts

@@ -1,42 +0,0 @@
-/**
- * Leaves per workgroup. A workgroup serves one tree and one aligned run of this many of its leaves,
- * which is what the lookup's `leaf_base` counts in.
- *
- * @type {number}
- */
-export const BLAS_REFIT_BATCH_WORKGROUP_SIZE: number;
-/**
- * Refit every tree in a batch, from one dispatch.
- *
- * One lane per leaf, across every tree the batch lists: the lane finds its tree and its leaf through
- * the workgroup lookup, rewrites that leaf's box from the triangle it names as the vertex buffer
- * holds it *now*, and climbs — {@link chunk_bvh_refit_climb}, the same arrival-counter climb the
- * LBVH build ends with, at this tree's positions in the shared arenas. Topology is untouched:
- * nothing is sorted, nothing is emitted, no node's children change.
- *
- * Batched rather than per tree because a refit's cost is not the refit. A tree's climb is a chain
- * of dependent atomics as long as the tree is deep, with half the live lanes exiting at every
- * level; on its own it is a long tail of a nearly idle GPU, and a dispatch per tree serialises
- * `N` such tails behind `2N` pass boundaries. In one dispatch a small tree's climb overlaps the
- * next tree's, and the command count is the same for one skinned mesh as for three hundred.
- *
- * Fused rather than two passes: the leaf box is stored through the same atomic words the climb
- * reads, before the lane's first arrival, so the second arrival at its parent reads it exactly as
- * it reads an internal node's — including when it has not arrived yet. Arriving second does not
- * order the sibling's stores (R1 in GPU_BVH_BUILD_PLAN.md), so every bound word is seeded with
- * {@link BVH_UNFITTED} a dispatch earlier ({@link shader_blas_refit_batch_seed}), the climb defers
- * the nodes it cannot see whole to the list in `refit_deferred`, and
- * {@link shader_bvh_refit_repair} grows them a dispatch later — the build's own repair, over every
- * tree in the batch at once.
- *
- * For a skinned mesh this runs against the per-instance clone, after the skinning pass has deformed
- * its vertex region; `geometry_index` on the row is the clone's, and reading the source instead
- * would produce the rest pose.
- *
- * Recorded by {@link GPUBLASRefitBatch}, which builds the tables and paginates the dispatch.
- *
- * @type {ComputeShader}
- */
-export const shader_blas_refit_batch: ComputeShader;
-import { ComputeShader } from "../../shader/ComputeShader.js";
-//# sourceMappingURL=shader_blas_refit_batch.d.ts.map

package/src/shade/renderer/geometry/bvh/shader_blas_refit_batch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"shader_blas_refit_batch.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/geometry/bvh/shader_blas_refit_batch.js"],"names":[],"mappings":"AAeA;;;;;GAKG;AACH,8CAFU,MAAM,CAEkC;AAmFlD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,sCAFU,aAAa,CAMpB;8BAzI2B,+BAA+B"}

package/src/shade/renderer/geometry/bvh/shader_blas_refit_batch.js

@@ -1,141 +0,0 @@
-import { atomic_u32, u32 } from "../../shader/type/WEBGPU_WGSL_PRIMITIVE_TYPES.js";
-import { WebGPUArray } from "../../shader/type/WebGPUArray.js";
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-import { ComputeShader } from "../../shader/ComputeShader.js";
-import { ShaderResourceSetDescriptor } from "../../shader/resource/ShaderResourceSetDescriptor.js";
-import { BVH_NODE_LAYOUT_DEFINITION } from "../../gpu_primitive/bvh/BVH_NODE_LAYOUT_DEFINITION.js";
-import { chunk_bvh_refit_climb } from "../../gpu_primitive/bvh/chunk_bvh_refit_climb.js";
-import {
-    chunk_geometry_read_triangle_bounds
-} from "../../shader/chunk/geometry/format/chunk_geometry_read_triangle_bounds.js";
-import { GEOMETRY_ATTRIBUTE_DATA_TYPE } from "../GEOMETRY_ATTRIBUTE_DATA_TYPE.js";
-import { GEOMETRY_METADATA_STRUCT } from "../GEOMETRY_METADATA_STRUCT.js";
-import { MESHLET_METADATA_STRUCT } from "../meshlet/encoding/MESHLET_METADATA_STRUCT.js";
-import { BLAS_REFIT_TARGET_STRUCT } from "./BLAS_REFIT_TARGET_STRUCT.js";
-
-/**
- * Leaves per workgroup. A workgroup serves one tree and one aligned run of this many of its leaves,
- * which is what the lookup's `leaf_base` counts in.
- *
- * @type {number}
- */
-export const BLAS_REFIT_BATCH_WORKGROUP_SIZE = 64;
-
-const resources = new ShaderResourceSetDescriptor();
-
-// Workgroups already covered by earlier sub-dispatches of the same batch, for a batch larger than
-// the device's per-dimension cap. Four bytes, per dispatch: immediate data.
-resources.setImmediate("dispatch_offset", u32);
-
-resources.createGroup()
-    // one row per tree in the batch — where it lives, and where its counters live
-    .addStorageBuffer("targets", WebGPUArray.from(BLAS_REFIT_TARGET_STRUCT), false)
-    // `(target_index, leaf_base)` per workgroup, flat
-    .addStorageBuffer("lookup", WebGPUArray.from(u32), false)
-    // node index of each leaf ordinal, per tree, at the tree's `leaf_nodes_offset`
-    .addStorageBuffer("leaf_nodes", WebGPUArray.from(u32), false)
-    // parent of every node, per tree, at the tree's `parents_offset`
-    .addStorageBuffer("parents", WebGPUArray.from(u32), false)
-    // one arrival counter per node slot of every tree, at each tree's `counters_offset`; zero at
-    // the start of every batch
-    .addStorageBuffer("counters", WebGPUArray.from(atomic_u32), true)
-    // The node arena, flat and atomic. Every word this kernel writes is communicated between
-    // invocations — a leaf box to the second arrival at its parent, a node box to the next — so
-    // every access to it is an atomic one. Its bound words arrive seeded by
-    // shader_blas_refit_batch_seed.
-    .addStorageBuffer("nodes", WebGPUArray.from(atomic_u32), true)
-    // the nodes whose children had not all reached their second arrival, every tree's, for the
-    // repair; header zero at the start of every batch
-    .addStorageBuffer("refit_deferred", WebGPUArray.from(atomic_u32), true)
-    .addStorageBuffer("geometries", WebGPUArray.from(GEOMETRY_METADATA_STRUCT), false)
-    .addStorageBuffer("meshlet_metadata", WebGPUArray.from(MESHLET_METADATA_STRUCT), false)
-    .addStorageBuffer("meshlet_data", GEOMETRY_ATTRIBUTE_DATA_TYPE, false);
-
-const body = CodeChunk.from(
-    //language=WGSL
-    `
-@compute @workgroup_size(${BLAS_REFIT_BATCH_WORKGROUP_SIZE}, 1, 1)
-fn main(
-    @builtin(workgroup_id) wg: vec3<u32>,
-    @builtin(local_invocation_id) lid: vec3<u32>,
-) {
-    // Which tree, and which run of its leaves: one lookup pair per workgroup, so the row read below
-    // is uniform across the workgroup and the leaf list read is one contiguous run.
-    let pair = (wg.x + dispatch_offset) * 2u;
-
-    // ("target" is a reserved word in WGSL)
-    let tree = targets[lookup[pair]];
-
-    let leaf = lookup[pair + 1u] + lid.x;
-
-    if (leaf >= tree.leaf_count) {
-        // the tail of a tree's last run; the next workgroup is another tree's
-        return;
-    }
-
-    let leaf_node = leaf_nodes[tree.leaf_nodes_offset + leaf];
-
-    let leaf_word = tree.node_word_offset + leaf_node * BVH_NODE_STRIDE;
-
-    // The leaf already says which triangle it holds — its payload is what the ray query hands to
-    // the triangle test. Reading it back means no side table has to agree with the tree about
-    // which leaf is which.
-    let payload = atomicLoad(&nodes[leaf_word + BVH_NODE_CHILD_2]);
-
-    let box = geometry_read_triangle_bounds(geometries[tree.geometry_index], payload);
-
-    // This leaf's box, then the climb from it. The box is written before this lane's first arrival
-    // at the parent, through the same atomic words the climb reads every other box through, so the
-    // second arrival at the parent finds it exactly as it finds an internal node's.
-    bvh_node_store_bounds(leaf_word, box.min, box.max);
-
-    bvh_refit_climb(
-        tree.node_word_offset,
-        tree.parents_offset,
-        tree.counters_offset,
-        leaf_node
-    );
-}
-`, [
-    BVH_NODE_LAYOUT_DEFINITION,
-    chunk_bvh_refit_climb,
-    chunk_geometry_read_triangle_bounds,
-]);
-
-/**
- * Refit every tree in a batch, from one dispatch.
- *
- * One lane per leaf, across every tree the batch lists: the lane finds its tree and its leaf through
- * the workgroup lookup, rewrites that leaf's box from the triangle it names as the vertex buffer
- * holds it *now*, and climbs — {@link chunk_bvh_refit_climb}, the same arrival-counter climb the
- * LBVH build ends with, at this tree's positions in the shared arenas. Topology is untouched:
- * nothing is sorted, nothing is emitted, no node's children change.
- *
- * Batched rather than per tree because a refit's cost is not the refit. A tree's climb is a chain
- * of dependent atomics as long as the tree is deep, with half the live lanes exiting at every
- * level; on its own it is a long tail of a nearly idle GPU, and a dispatch per tree serialises
- * `N` such tails behind `2N` pass boundaries. In one dispatch a small tree's climb overlaps the
- * next tree's, and the command count is the same for one skinned mesh as for three hundred.
- *
- * Fused rather than two passes: the leaf box is stored through the same atomic words the climb
- * reads, before the lane's first arrival, so the second arrival at its parent reads it exactly as
- * it reads an internal node's — including when it has not arrived yet. Arriving second does not
- * order the sibling's stores (R1 in GPU_BVH_BUILD_PLAN.md), so every bound word is seeded with
- * {@link BVH_UNFITTED} a dispatch earlier ({@link shader_blas_refit_batch_seed}), the climb defers
- * the nodes it cannot see whole to the list in `refit_deferred`, and
- * {@link shader_bvh_refit_repair} grows them a dispatch later — the build's own repair, over every
- * tree in the batch at once.
- *
- * For a skinned mesh this runs against the per-instance clone, after the skinning pass has deformed
- * its vertex region; `geometry_index` on the row is the clone's, and reading the source instead
- * would produce the rest pose.
- *
- * Recorded by {@link GPUBLASRefitBatch}, which builds the tables and paginates the dispatch.
- *
- * @type {ComputeShader}
- */
-export const shader_blas_refit_batch = ComputeShader.from({
-    label: "BLAS/RefitBatch",
-    resources,
-    body,
-});

package/src/shade/renderer/geometry/bvh/shader_blas_refit_batch_seed.d.ts

@@ -1,21 +0,0 @@
-/**
- * Seed every bound word of every tree in a batch with {@link BVH_UNFITTED}, a dispatch ahead of
- * {@link shader_blas_refit_batch}.
- *
- * The batch refit hands boxes between invocations through relaxed atomics — leaf boxes included,
- * since it writes them in the same dispatch — and a store need not reach the reader before the
- * dispatch ends. What this leaves behind is what such a read returns, so the climb can see a box
- * that has not arrived instead of taking last frame's for it. For a skinned mesh last frame's box
- * is close to this frame's, so taking it would go unnoticed.
- *
- * One lane per node slot, holes included: the arena's trees keep the slots their builder allocated,
- * and seeding a hole costs six stores where telling it apart would cost a walk. The bounds words are
- * all it touches; children and payloads are the tree's topology and stay as they are.
- *
- * Recorded by {@link GPUBLASRefitBatch}, paginated as the refit is.
- *
- * @type {ComputeShader}
- */
-export const shader_blas_refit_batch_seed: ComputeShader;
-import { ComputeShader } from "../../shader/ComputeShader.js";
-//# sourceMappingURL=shader_blas_refit_batch_seed.d.ts.map

package/src/shade/renderer/geometry/bvh/shader_blas_refit_batch_seed.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"shader_blas_refit_batch_seed.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/geometry/bvh/shader_blas_refit_batch_seed.js"],"names":[],"mappings":"AAoDA;;;;;;;;;;;;;;;;;GAiBG;AACH,2CAFU,aAAa,CAMpB;8BAvE2B,+BAA+B"}