@tinypoly/gpu-renderer 0.0.0-stage → 0.0.0

package/dist/denoise.js

@@ -0,0 +1,455 @@
+import { createShaderModule } from "./shaderModule.js";
+export const DEFAULT_DENOISER = Object.freeze({
+    strength: 1,
+    passes: 3,
+    edge: 2,
+    onlyNoisy: true,
+    antiFirefly: true,
+});
+/** The settings with `input` applied, each field kept in range. */
+export function mergeDenoiser(base, input = {}) {
+    const merged = { ...base, ...Object.fromEntries(Object.entries(input).filter(([, value]) => value !== undefined)) };
+    return {
+        strength: Math.min(1, Math.max(0, Number(merged.strength) || 0)),
+        passes: Math.min(5, Math.max(1, Math.round(Number(merged.passes) || 1))),
+        edge: Math.max(0.01, Number(merged.edge) || DEFAULT_DENOISER.edge),
+        onlyNoisy: Boolean(merged.onlyNoisy),
+        antiFirefly: Boolean(merged.antiFirefly),
+    };
+}
+/** The error a pixel counts as converged under, the one adaptive sampling stops at. */
+export const CONVERGED_ERROR = 0.004;
+/**
+ * The denoiser: the spatial half of SVGF (Schied and others, 2017), with the diffuse and the specular light filtered
+ * apart, as NVIDIA's RELAX and REBLUR do.
+ *
+ * The path tracer splits every path at its first scatter, by the lobe it took, so each pixel holds a diffuse and a
+ * specular signal, each with its own variance. Each is divided by its own albedo (the diffuse colour, and the GGX
+ * lobe's directional albedo), so the filter sees light and never blurs a texture or a colour; both are multiplied back
+ * at the end. A pixel brighter than all of its neighbours is first clamped to the brightest of them.
+ *
+ * Then a few passes of an edge-avoiding a-trous wavelet, its taps twice as far apart each pass. The diffuse light is
+ * weighed by the agreement of normals and depths and by its luminance against the pixel's own variance. The specular
+ * light also by roughness, by normals more sharply the smoother the surface, and within the footprint its lobe leaves on
+ * the screen: the lobe's angle times the distance to what it reflects, seen from the camera. A sharp reflection of
+ * something near is left almost alone; a rough reflection of something far is smoothed across a wide area.
+ *
+ * The weights are normalized, which keeps every flat area at exactly its mean, and each signal is mixed with what was
+ * traced by how noisy it still is, so what has converged keeps exactly its traced value.
+ */
+export const DENOISE_WGSL = /* wgsl */ `
+struct Params {
+  size: vec2<u32>,
+  step: u32,
+  count: u32,
+  edge: f32,
+  strength: f32,
+  onlyNoisy: u32,
+  converged: f32,
+  pixelScale: f32,
+  orthographic: u32,
+  padding: vec2<u32>,
+};
+
+@group(0) @binding(0) var<uniform> params: Params;
+@group(0) @binding(1) var<storage, read> accumulation: array<vec4<f32>>;
+@group(0) @binding(2) var<storage, read> diffuseIn: array<vec4<f32>>;
+@group(0) @binding(3) var<storage, read> specularIn: array<vec4<f32>>;
+@group(0) @binding(4) var<storage, read_write> diffuseOut: array<vec4<f32>>;
+@group(0) @binding(5) var<storage, read_write> specularOut: array<vec4<f32>>;
+
+fn luminance(color: vec3<f32>) -> f32 {
+  return dot(color, vec3<f32>(0.2126, 0.7152, 0.0722));
+}
+
+fn samples(index: u32) -> f32 {
+  return max(accumulation[index].w, 1.0);
+}
+
+/** Each signal's mean radiance: the diffuse one stored apart, the specular one the rest. */
+fn diffuseMean(index: u32) -> vec3<f32> {
+  return accumulation[4u * params.count + index].rgb / samples(index);
+}
+
+fn specularMean(index: u32) -> vec3<f32> {
+  return accumulation[index].rgb / samples(index) - diffuseMean(index);
+}
+
+/** The albedos the light is divided by, kept off zero so the division never explodes. */
+fn diffuseAlbedo(index: u32) -> vec3<f32> {
+  return max(accumulation[2u * params.count + index].rgb / samples(index), vec3<f32>(0.01));
+}
+
+fn specularAlbedo(index: u32) -> vec3<f32> {
+  return max(accumulation[5u * params.count + index].rgb / samples(index), vec3<f32>(0.01));
+}
+
+fn guideNormal(index: u32) -> vec3<f32> {
+  let sum = accumulation[3u * params.count + index].xyz;
+  let size = length(sum);
+
+  return select(vec3<f32>(0.0), sum / size, size > 1e-6);
+}
+
+fn guideDepth(index: u32) -> f32 {
+  return accumulation[3u * params.count + index].w / samples(index);
+}
+
+fn guideRoughness(index: u32) -> f32 {
+  return accumulation[2u * params.count + index].w / samples(index);
+}
+
+fn specularDistance(index: u32) -> f32 {
+  return accumulation[4u * params.count + index].w / samples(index);
+}
+
+/** The variance of a signal's mean, in the space of its demodulated light. */
+fn variance(mean: vec3<f32>, square: f32, count: f32, albedo: vec3<f32>) -> f32 {
+  let m = luminance(mean);
+  let a = max(luminance(albedo), 0.01);
+
+  return max(square / count - m * m, 0.0) / count / (a * a);
+}
+
+/** Both signals, divided by their albedos, with the variance of their means. */
+@compute @workgroup_size(8, 8, 1)
+fn prepare(@builtin(global_invocation_id) id: vec3<u32>) {
+  if (id.x >= params.size.x || id.y >= params.size.y) {
+    return;
+  }
+
+  let index = id.y * params.size.x + id.x;
+  let count = accumulation[index].w;
+
+  if (count <= 0.0) {
+    diffuseOut[index] = vec4<f32>(0.0);
+    specularOut[index] = vec4<f32>(0.0);
+
+    return;
+  }
+
+  let squares = accumulation[params.count + index];
+  let diffuse = diffuseMean(index);
+  let specular = specularMean(index);
+
+  diffuseOut[index] = vec4<f32>(diffuse / diffuseAlbedo(index), variance(diffuse, squares.z, count, diffuseAlbedo(index)));
+  specularOut[index] = vec4<f32>(
+    specular / specularAlbedo(index), variance(specular, squares.w, count, specularAlbedo(index)));
+}
+
+fn inside(q: vec2<i32>) -> bool {
+  return q.x >= 0 && q.y >= 0 && q.x < i32(params.size.x) && q.y < i32(params.size.y);
+}
+
+/** A value brighter than every neighbour, scaled down to the brightest of them: a firefly, not a feature. */
+fn clampFirefly(value: vec4<f32>, brightest: f32) -> vec4<f32> {
+  let own = luminance(value.rgb);
+
+  if (own <= brightest || own <= 0.0) {
+    return value;
+  }
+
+  return vec4<f32>(value.rgb * (brightest / own), value.w);
+}
+
+@compute @workgroup_size(8, 8, 1)
+fn antiFirefly(@builtin(global_invocation_id) id: vec3<u32>) {
+  if (id.x >= params.size.x || id.y >= params.size.y) {
+    return;
+  }
+
+  let pixel = vec2<i32>(id.xy);
+  let index = id.y * params.size.x + id.x;
+  var diffuse = 0.0;
+  var specular = 0.0;
+
+  for (var dy = -1; dy <= 1; dy = dy + 1) {
+    for (var dx = -1; dx <= 1; dx = dx + 1) {
+      let q = pixel + vec2<i32>(dx, dy);
+
+      if ((dx == 0 && dy == 0) || !inside(q)) {
+        continue;
+      }
+
+      let other = u32(q.y) * params.size.x + u32(q.x);
+      diffuse = max(diffuse, luminance(diffuseIn[other].rgb));
+      specular = max(specular, luminance(specularIn[other].rgb));
+    }
+  }
+
+  diffuseOut[index] = clampFirefly(diffuseIn[index], diffuse);
+  specularOut[index] = clampFirefly(specularIn[index], specular);
+}
+
+const KERNEL = array<f32, 5>(0.0625, 0.25, 0.375, 0.25, 0.0625);
+
+/** The variance around a pixel, blurred over 3 x 3, which steadies the luminance test on a few samples. */
+fn localVariance(pixel: vec2<i32>, specular: bool) -> f32 {
+  var sum = 0.0;
+  var weight = 0.0;
+
+  for (var dy = -1; dy <= 1; dy = dy + 1) {
+    for (var dx = -1; dx <= 1; dx = dx + 1) {
+      let q = pixel + vec2<i32>(dx, dy);
+
+      if (!inside(q)) {
+        continue;
+      }
+
+      let other = u32(q.y) * params.size.x + u32(q.x);
+      let w = select(0.5, 1.0, dx == 0) * select(0.5, 1.0, dy == 0);
+      sum = sum + select(diffuseIn[other].w, specularIn[other].w, specular) * w;
+      weight = weight + w;
+    }
+  }
+
+  return sum / max(weight, 1e-6);
+}
+
+/**
+ * How many pixels the specular lobe's footprint covers: the lobe's angle times the distance to what it reflects, seen
+ * from the camera across the distance to the surface plus that.
+ */
+fn specularRadius(index: u32, depth: f32) -> f32 {
+  let alpha = guideRoughness(index) * guideRoughness(index);
+  let reflected = specularDistance(index);
+
+  if (params.orthographic != 0u) {
+    return min(alpha * reflected / params.pixelScale, 64.0);
+  }
+
+  return min(alpha * reflected / max(depth + reflected, 1e-6) / params.pixelScale, 64.0);
+}
+
+/** One a-trous pass over both signals, its taps params.step pixels apart. */
+@compute @workgroup_size(8, 8, 1)
+fn atrous(@builtin(global_invocation_id) id: vec3<u32>) {
+  if (id.x >= params.size.x || id.y >= params.size.y) {
+    return;
+  }
+
+  let pixel = vec2<i32>(id.xy);
+  let index = id.y * params.size.x + id.x;
+  let diffuseCenter = diffuseIn[index];
+  let specularCenter = specularIn[index];
+
+  if (accumulation[index].w <= 0.0) {
+    diffuseOut[index] = diffuseCenter;
+    specularOut[index] = specularCenter;
+
+    return;
+  }
+
+  let normal = guideNormal(index);
+  let depth = guideDepth(index);
+  let roughness = guideRoughness(index);
+  let diffuseSigma = params.edge * sqrt(max(localVariance(pixel, false), 0.0)) + 1e-6;
+  let specularSigma = params.edge * sqrt(max(localVariance(pixel, true), 0.0)) + 1e-6;
+  let radius = specularRadius(index, depth);
+  // A smoother surface's reflection turns faster with its normal: the normal test sharpens with it.
+  let specularPower = min(128.0 / max(roughness * roughness, 0.03), 4096.0);
+  let step = i32(params.step);
+  var diffuse = vec4<f32>(0.0);
+  var specular = vec4<f32>(0.0);
+  var diffuseTotal = 0.0;
+  var specularTotal = 0.0;
+
+  for (var dy = -2; dy <= 2; dy = dy + 1) {
+    for (var dx = -2; dx <= 2; dx = dx + 1) {
+      let q = pixel + vec2<i32>(dx, dy) * step;
+
+      if (!inside(q)) {
+        continue;
+      }
+
+      let other = u32(q.y) * params.size.x + u32(q.x);
+      let d = diffuseIn[other];
+      let s = specularIn[other];
+      let base = KERNEL[dx + 2] * KERNEL[dy + 2];
+      var wd = base;
+      var ws = base;
+
+      if (dx != 0 || dy != 0) {
+        if (accumulation[other].w <= 0.0) {
+          continue;
+        }
+
+        let offset = length(vec2<f32>(f32(dx * step), f32(dy * step)));
+        let alignment = max(dot(normal, guideNormal(other)), 0.0);
+        let depthWeight = exp(-abs(depth - guideDepth(other)) / (0.02 * depth * offset + 1e-3));
+
+        wd = wd * pow(alignment, 128.0) * depthWeight
+          * exp(-abs(luminance(d.rgb) - luminance(diffuseCenter.rgb)) / diffuseSigma);
+
+        ws = ws * pow(alignment, specularPower) * depthWeight
+          * exp(-abs(guideRoughness(other) - roughness) * 10.0)
+          * exp(-abs(luminance(s.rgb) - luminance(specularCenter.rgb)) / specularSigma)
+          * select(0.0, exp(-offset * offset / (radius * radius)), radius >= 0.5);
+      }
+
+      diffuse = diffuse + vec4<f32>(d.rgb * wd, d.w * wd * wd);
+      specular = specular + vec4<f32>(s.rgb * ws, s.w * ws * ws);
+      diffuseTotal = diffuseTotal + wd;
+      specularTotal = specularTotal + ws;
+    }
+  }
+
+  diffuseOut[index] = vec4<f32>(diffuse.rgb / diffuseTotal, diffuse.w / (diffuseTotal * diffuseTotal));
+  specularOut[index] = vec4<f32>(specular.rgb / specularTotal, specular.w / (specularTotal * specularTotal));
+}
+
+/** How much of the filtered signal replaces the traced one: by how noisy the signal still is, when asked. */
+fn amount(mean: vec3<f32>, square: f32, count: f32) -> f32 {
+  if (params.onlyNoisy == 0u || count <= 1.0) {
+    return params.strength;
+  }
+
+  let m = luminance(mean);
+  let error = sqrt(max(square / count - m * m, 0.0) / count) / sqrt(max(m, 0.0) + 1e-3);
+
+  return params.strength * smoothstep(params.converged, 4.0 * params.converged, error);
+}
+
+/** Both filtered signals, times the albedos they were divided by, each mixed with what was traced. */
+@compute @workgroup_size(8, 8, 1)
+fn finish(@builtin(global_invocation_id) id: vec3<u32>) {
+  if (id.x >= params.size.x || id.y >= params.size.y) {
+    return;
+  }
+
+  let index = id.y * params.size.x + id.x;
+  let count = accumulation[index].w;
+
+  if (count <= 0.0) {
+    diffuseOut[index] = vec4<f32>(0.0, 0.0, 0.0, 1.0);
+
+    return;
+  }
+
+  let squares = accumulation[params.count + index];
+  let diffuse = diffuseMean(index);
+  let specular = specularMean(index);
+  let filteredDiffuse = diffuseIn[index].rgb * diffuseAlbedo(index);
+  let filteredSpecular = specularIn[index].rgb * specularAlbedo(index);
+
+  diffuseOut[index] = vec4<f32>(
+    mix(diffuse, filteredDiffuse, amount(diffuse, squares.z, count))
+    + mix(specular, filteredSpecular, amount(specular, squares.w, count)), 1.0);
+}
+`;
+/** The a-trous passes, their taps 1, 2, 4, 8 and 16 pixels apart. */
+const STEPS = [1, 2, 4, 8, 16];
+/** Uniforms: prepare, anti-firefly, one per a-trous pass, finish. */
+const STAGES = STEPS.length + 3;
+export class DenoisePass {
+    device;
+    layout;
+    prepare;
+    antiFirefly;
+    atrous;
+    finish;
+    /** One uniform per stage, so a whole denoise is a single submit. */
+    params;
+    /** Two ping-pong pairs, diffuse and specular, and the output. */
+    buffers = [];
+    width = 0;
+    height = 0;
+    /** The denoised radiance, one vec4 per pixel, once `encode` has run. */
+    output = null;
+    constructor(device) {
+        this.device = device;
+        const module = createShaderModule(device, "denoise", DENOISE_WGSL);
+        const storage = (type) => ({ type });
+        const visibility = GPUShaderStage.COMPUTE;
+        this.layout = device.createBindGroupLayout({
+            entries: [
+                { binding: 0, visibility, buffer: { type: "uniform" } },
+                { binding: 1, visibility, buffer: storage("read-only-storage") },
+                { binding: 2, visibility, buffer: storage("read-only-storage") },
+                { binding: 3, visibility, buffer: storage("read-only-storage") },
+                { binding: 4, visibility, buffer: storage("storage") },
+                { binding: 5, visibility, buffer: storage("storage") },
+            ],
+        });
+        const layout = device.createPipelineLayout({ bindGroupLayouts: [this.layout] });
+        const pipeline = (entryPoint) => device.createComputePipeline({ layout, compute: { module, entryPoint } });
+        this.prepare = pipeline("prepare");
+        this.antiFirefly = pipeline("antiFirefly");
+        this.atrous = pipeline("atrous");
+        this.finish = pipeline("finish");
+        this.params = Array.from({ length: STAGES }, () => device.createBuffer({ size: 48, usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST }));
+    }
+    resize(width, height) {
+        if (width === this.width && height === this.height && this.buffers.length)
+            return;
+        for (const buffer of this.buffers)
+            buffer.destroy();
+        const size = Math.max(16, width * height * 16);
+        this.buffers = Array.from({ length: 5 }, () => this.device.createBuffer({ size, usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC }));
+        this.output = this.buffers[4];
+        this.width = width;
+        this.height = height;
+    }
+    writeParams(width, height, settings, view) {
+        const steps = [1, 1, ...STEPS, 1];
+        steps.forEach((step, k) => {
+            const values = new ArrayBuffer(48);
+            const words = new Uint32Array(values);
+            const floats = new Float32Array(values);
+            words.set([width, height, step, width * height]);
+            floats[4] = settings.edge;
+            floats[5] = settings.strength;
+            words[6] = settings.onlyNoisy ? 1 : 0;
+            floats[7] = CONVERGED_ERROR;
+            floats[8] = view.pixelScale;
+            words[9] = view.orthographic ? 1 : 0;
+            this.device.queue.writeBuffer(this.params[k], 0, values);
+        });
+    }
+    /** Denoises what `accumulation` holds into `output`. */
+    encode(encoder, accumulation, width, height, settings = DEFAULT_DENOISER, view = { pixelScale: 1 / height, orthographic: false }) {
+        this.resize(width, height);
+        this.writeParams(width, height, settings, view);
+        const [diffuseA, diffuseB, specularA, specularB, output] = this.buffers;
+        const groups = [Math.ceil(width / 8), Math.ceil(height / 8)];
+        const run = (pipeline, params, sources, targets) => {
+            const group = this.device.createBindGroup({
+                layout: this.layout,
+                entries: [
+                    { binding: 0, resource: { buffer: params } },
+                    { binding: 1, resource: { buffer: accumulation } },
+                    { binding: 2, resource: { buffer: sources[0] } },
+                    { binding: 3, resource: { buffer: sources[1] } },
+                    { binding: 4, resource: { buffer: targets[0] } },
+                    { binding: 5, resource: { buffer: targets[1] } },
+                ],
+            });
+            const pass = encoder.beginComputePass({ label: "denoise" });
+            pass.setPipeline(pipeline);
+            pass.setBindGroup(0, group);
+            pass.dispatchWorkgroups(groups[0], groups[1]);
+            pass.end();
+        };
+        // prepare reads nothing from its sources; the B buffers stand in so the bindings are valid.
+        run(this.prepare, this.params[0], [diffuseB, specularB], [diffuseA, specularA]);
+        let from = [diffuseA, specularA];
+        let to = [diffuseB, specularB];
+        if (settings.antiFirefly) {
+            run(this.antiFirefly, this.params[1], from, to);
+            [from, to] = [to, from];
+        }
+        STEPS.slice(0, settings.passes).forEach((_, k) => {
+            run(this.atrous, this.params[k + 2], from, to);
+            [from, to] = [to, from];
+        });
+        // finish writes the result to the output; the free specular buffer fills the second, unused, target.
+        run(this.finish, this.params[STAGES - 1], from, [output, to[1]]);
+    }
+    destroy() {
+        for (const buffer of [...this.buffers, ...this.params])
+            buffer.destroy();
+        this.buffers = [];
+        this.output = null;
+    }
+}
+//# sourceMappingURL=denoise.js.map

package/dist/denoise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"denoise.js","sourceRoot":"","sources":["../src/denoise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAmBvD,MAAM,CAAC,MAAM,gBAAgB,GAA+B,MAAM,CAAC,MAAM,CAAC;IACxE,QAAQ,EAAE,CAAC;IACX,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,SAAS,EAAE,IAAI;IACf,WAAW,EAAE,IAAI;CAClB,CAAC,CAAC;AAEH,mEAAmE;AACnE,MAAM,UAAU,aAAa,CAAC,IAAsB,EAAE,QAAmC,EAAE;IACzF,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,EAAE,CAAC;IAEpH,OAAO;QACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAClE,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC;QACpC,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC;KACzC,CAAC;AACJ,CAAC;AAED,uFAAuF;AACvF,MAAM,CAAC,MAAM,eAAe,GAAG,KAAK,CAAC;AASrC;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,UAAU,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2StC,CAAC;AAEF,qEAAqE;AACrE,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAE/B,qEAAqE;AACrE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AAEhC,MAAM,OAAO,WAAW;IAgBO;IAfZ,MAAM,CAAqB;IAC3B,OAAO,CAAqB;IAC5B,WAAW,CAAqB;IAChC,MAAM,CAAqB;IAC3B,MAAM,CAAqB;IAC5C,oEAAoE;IACnD,MAAM,CAAc;IACrC,iEAAiE;IACzD,OAAO,GAAgB,EAAE,CAAC;IAC1B,KAAK,GAAG,CAAC,CAAC;IACV,MAAM,GAAG,CAAC,CAAC;IAEnB,wEAAwE;IACxE,MAAM,GAAqB,IAAI,CAAC;IAEhC,YAA6B,MAAiB;QAAjB,WAAM,GAAN,MAAM,CAAW;QAC5C,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,CAAC,IAA0B,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,CAAC;QAE1C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,qBAAqB,CAAC;YACzC,OAAO,EAAE;gBACP,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;gBACvD,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,mBAAmB,CAAC,EAAE;gBAChE,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,mBAAmB,CAAC,EAAE;gBAChE,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,mBAAmB,CAAC,EAAE;gBAChE,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE;gBACtD,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE;aACvD;SACF,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,MAAM,CAAC,oBAAoB,CAAC,EAAE,gBAAgB,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChF,MAAM,QAAQ,GAAG,CAAC,UAAkB,EAAE,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QAEnH,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAChD,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAChG,CAAC;IAEO,MAAM,CAAC,KAAa,EAAE,MAAc;QAC1C,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO;QAElF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,CAAC,OAAO,EAAE,CAAC;QAEpD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC;QAE/C,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAC5C,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/F,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAEO,WAAW,CAAC,KAAa,EAAE,MAAc,EAAE,QAA0B,EAAE,IAAiB;QAC9F,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;QAElC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;YAExC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC;YAC5B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;YAC5B,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,wDAAwD;IACxD,MAAM,CACJ,OAA0B,EAC1B,YAAuB,EACvB,KAAa,EACb,MAAc,EACd,WAA6B,gBAAgB,EAC7C,OAAoB,EAAE,UAAU,EAAE,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;QACnE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAEhD,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACxE,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAU,CAAC;QAEtE,MAAM,GAAG,GAAG,CAAC,QAA4B,EAAE,MAAiB,EAC1D,OAA+B,EAAE,OAA+B,EAAE,EAAE;YACpE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;gBACxC,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,OAAO,EAAE;oBACP,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;oBAC5C,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE;oBAClD,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oBAChD,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oBAChD,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oBAChD,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;iBACjD;aACF,CAAC,CAAC;YAEH,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;YAE5D,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC5B,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,CAAC,GAAG,EAAE,CAAC;QACb,CAAC,CAAC;QAEF,4FAA4F;QAC5F,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QAEhF,IAAI,IAAI,GAA2B,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACzD,IAAI,EAAE,GAA2B,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEvD,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YAChD,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/C,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YAC/C,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,qGAAqG;QACrG,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,OAAO;QACL,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;YAAE,MAAM,CAAC,OAAO,EAAE,CAAC;QAEzE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACrB,CAAC;CACF"}

package/dist/device.d.ts

@@ -0,0 +1,37 @@
+/** Acquiring a device, and the questions a host asks before choosing this renderer at all. */
+/** What the renderer needs from the platform, and what is missing when it cannot run. */
+export interface WebGpuSupport {
+    /** True when an adapter answered. */
+    supported: boolean;
+    /** Why the renderer cannot run here, in one sentence. Empty when `supported`. */
+    reason: string;
+}
+export interface RenderDevice {
+    adapter: GPUAdapter;
+    device: GPUDevice;
+    /** Largest storage buffer this device accepts, which is the ceiling on how big a scene can be. */
+    maxStorageBufferBindingSize: number;
+    maxBufferSize: number;
+}
+export interface RenderDeviceOptions {
+    /** Called when the device is lost. The renderer stops; choosing what to do next is the host's decision. */
+    onLost?: (reason: string) => void;
+}
+/**
+ * Whether this context exposes WebGPU at all. It is a cheap, synchronous check for a fallback decision;
+ * it does not prove that an adapter exists, which only `requestWebGpuSupport` can tell.
+ */
+export declare function isWebGpuAvailable(): boolean;
+/**
+ * Asks the platform for an adapter, which is the only honest answer to "can this machine render?".
+ * A browser can expose `navigator.gpu` and still hand back no adapter (a blocklisted driver, a headless session
+ * without a software fallback), so hosts deciding between renderers should await this one.
+ */
+export declare function requestWebGpuSupport(): Promise<WebGpuSupport>;
+/**
+ * The device the renderer runs on, asking for everything the adapter offers. Scene geometry, the hierarchy and the
+ * accumulation buffer all live in storage buffers, so the default 128 MiB binding size is the first ceiling a real
+ * scene meets, and adapters routinely allow far more.
+ */
+export declare function requestRenderDevice(options?: RenderDeviceOptions): Promise<RenderDevice>;
+//# sourceMappingURL=device.d.ts.map

package/dist/device.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"device.d.ts","sourceRoot":"","sources":["../src/device.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F,yFAAyF;AACzF,MAAM,WAAW,aAAa;IAC5B,qCAAqC;IACrC,SAAS,EAAE,OAAO,CAAC;IACnB,iFAAiF;IACjF,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,UAAU,CAAC;IACpB,MAAM,EAAE,SAAS,CAAC;IAClB,kGAAkG;IAClG,2BAA2B,EAAE,MAAM,CAAC;IACpC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAClC,2GAA2G;IAC3G,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;CACnC;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,IAAI,OAAO,CAE3C;AAED;;;;GAIG;AACH,wBAAsB,oBAAoB,IAAI,OAAO,CAAC,aAAa,CAAC,CAanE;AAED;;;;GAIG;AACH,wBAAsB,mBAAmB,CAAC,OAAO,GAAE,mBAAwB,GAAG,OAAO,CAAC,YAAY,CAAC,CAwBlG"}

package/dist/device.js

@@ -0,0 +1,52 @@
+/** Acquiring a device, and the questions a host asks before choosing this renderer at all. */
+/**
+ * Whether this context exposes WebGPU at all. It is a cheap, synchronous check for a fallback decision;
+ * it does not prove that an adapter exists, which only `requestWebGpuSupport` can tell.
+ */
+export function isWebGpuAvailable() {
+    return typeof navigator !== "undefined" && "gpu" in navigator && navigator.gpu != null;
+}
+/**
+ * Asks the platform for an adapter, which is the only honest answer to "can this machine render?".
+ * A browser can expose `navigator.gpu` and still hand back no adapter (a blocklisted driver, a headless session
+ * without a software fallback), so hosts deciding between renderers should await this one.
+ */
+export async function requestWebGpuSupport() {
+    if (!isWebGpuAvailable())
+        return { supported: false, reason: "This browser does not expose WebGPU." };
+    try {
+        const adapter = await navigator.gpu.requestAdapter();
+        if (!adapter)
+            return { supported: false, reason: "WebGPU is exposed, but no adapter was available." };
+        return { supported: true, reason: "" };
+    }
+    catch (error) {
+        return { supported: false, reason: `Requesting a WebGPU adapter failed: ${error.message}` };
+    }
+}
+/**
+ * The device the renderer runs on, asking for everything the adapter offers. Scene geometry, the hierarchy and the
+ * accumulation buffer all live in storage buffers, so the default 128 MiB binding size is the first ceiling a real
+ * scene meets, and adapters routinely allow far more.
+ */
+export async function requestRenderDevice(options = {}) {
+    if (!isWebGpuAvailable())
+        throw new Error("GPU renderer: this browser does not expose WebGPU.");
+    const adapter = await navigator.gpu.requestAdapter({ powerPreference: "high-performance" });
+    if (!adapter)
+        throw new Error("GPU renderer: no WebGPU adapter was available.");
+    const device = await adapter.requestDevice({
+        requiredLimits: {
+            maxStorageBufferBindingSize: adapter.limits.maxStorageBufferBindingSize,
+            maxBufferSize: adapter.limits.maxBufferSize,
+        },
+    });
+    void device.lost.then(info => options.onLost?.(info.message || String(info.reason)));
+    return {
+        adapter,
+        device,
+        maxStorageBufferBindingSize: device.limits.maxStorageBufferBindingSize,
+        maxBufferSize: device.limits.maxBufferSize,
+    };
+}
+//# sourceMappingURL=device.js.map

package/dist/device.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"device.js","sourceRoot":"","sources":["../src/device.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAuB9F;;;GAGG;AACH,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,SAAS,KAAK,WAAW,IAAI,KAAK,IAAI,SAAS,IAAI,SAAS,CAAC,GAAG,IAAI,IAAI,CAAC;AACzF,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB;IACxC,IAAI,CAAC,iBAAiB,EAAE;QACtB,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,sCAAsC,EAAE,CAAC;IAE9E,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC;QAErD,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,kDAAkD,EAAE,CAAC;QAEtG,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IACzC,CAAC;IAAC,OAAM,KAAK,EAAE,CAAC;QACd,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,uCAAwC,KAAe,CAAC,OAAO,EAAE,EAAE,CAAC;IACzG,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,UAA+B,EAAE;IACzE,IAAI,CAAC,iBAAiB,EAAE;QACtB,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IAExE,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,eAAe,EAAE,kBAAkB,EAAE,CAAC,CAAC;IAE5F,IAAI,CAAC,OAAO;QACV,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IAEpE,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC;QACzC,cAAc,EAAE;YACd,2BAA2B,EAAE,OAAO,CAAC,MAAM,CAAC,2BAA2B;YACvE,aAAa,EAAE,OAAO,CAAC,MAAM,CAAC,aAAa;SAC5C;KACF,CAAC,CAAC;IAEH,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAErF,OAAO;QACL,OAAO;QACP,MAAM;QACN,2BAA2B,EAAE,MAAM,CAAC,MAAM,CAAC,2BAA2B;QACtE,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa;KAC3C,CAAC;AACJ,CAAC"}

package/dist/dispatchScheduler.d.ts

@@ -0,0 +1,43 @@
+/**
+ * How many rows of pixels one submit covers. The system watchdog kills a command that runs too long (around two
+ * seconds on Windows), and a tab that submits the whole image at once stops answering, so the work is cut into bands
+ * and the band grows or shrinks towards a target time per submit.
+ *
+ * The first band of a new scene is deliberately small: nothing is known about the machine yet, and a slow integrated
+ * GPU should discover that on a band it survives.
+ */
+export interface DispatchSchedulerOptions {
+    /** Milliseconds one submit should take. */
+    targetMs?: number;
+    /** Rows the first submit covers, before anything has been measured. */
+    initialRows?: number;
+    /** Rows in the whole image. */
+    maxRows: number;
+}
+export declare class DispatchScheduler {
+    private readonly targetMs;
+    private readonly initialRows;
+    private readonly maxRows;
+    private rows;
+    /** Rows a millisecond, as far as anything has shown. Zero until the first submit says something. */
+    private throughput;
+    constructor(options: DispatchSchedulerOptions);
+    /** Rows the next submit should cover, never more than what is left. */
+    next(remaining: number): number;
+    /**
+     * Feeds back how long the last submit took, which moves the band towards the target time.
+     *
+     * What it estimates is a rate, not a direction. Every submit also costs a fixed round trip to the device, and on a
+     * small or simple image that round trip is most of what the clock sees. A rule that only asked whether the submit
+     * came back late would then read every band as too slow and shrink until each one covered a single row, which is the
+     * worst possible way to spend that round trip and is a hole it could never climb out of. A rate notices instead that
+     * a wider band cost no more, and widens.
+     *
+     * The rate is measured from the rows actually submitted rather than from the current guess, so one band clamped by
+     * what was left of the image does not stop the next one from growing.
+     */
+    record(durationMs: number, rows: number): void;
+    /** Back to the unmeasured band, for a new scene or a new size. */
+    reset(): void;
+}
+//# sourceMappingURL=dispatchScheduler.d.ts.map

package/dist/dispatchScheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dispatchScheduler.d.ts","sourceRoot":"","sources":["../src/dispatchScheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,WAAW,wBAAwB;IACvC,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uEAAuE;IACvE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,+BAA+B;IAC/B,OAAO,EAAE,MAAM,CAAC;CACjB;AAOD,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,IAAI,CAAS;IACrB,oGAAoG;IACpG,OAAO,CAAC,UAAU,CAAK;gBAEX,OAAO,EAAE,wBAAwB;IAO7C,uEAAuE;IACvE,IAAI,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAI/B;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAWvC,kEAAkE;IAClE,KAAK;CAIN"}

package/dist/dispatchScheduler.js

@@ -0,0 +1,49 @@
+/** The most one measurement may widen the band, so an unmeasured machine meets the watchdog gradually. */
+const GROW = 4;
+/** How quickly the estimate gives ground when submits come back slower than they used to. */
+const DECAY = 0.8;
+export class DispatchScheduler {
+    targetMs;
+    initialRows;
+    maxRows;
+    rows;
+    /** Rows a millisecond, as far as anything has shown. Zero until the first submit says something. */
+    throughput = 0;
+    constructor(options) {
+        this.targetMs = options.targetMs ?? 12;
+        this.maxRows = Math.max(1, Math.floor(options.maxRows));
+        this.initialRows = Math.max(1, Math.min(this.maxRows, Math.floor(options.initialRows ?? 16)));
+        this.rows = this.initialRows;
+    }
+    /** Rows the next submit should cover, never more than what is left. */
+    next(remaining) {
+        return Math.max(1, Math.min(Math.floor(this.rows), Math.floor(remaining)));
+    }
+    /**
+     * Feeds back how long the last submit took, which moves the band towards the target time.
+     *
+     * What it estimates is a rate, not a direction. Every submit also costs a fixed round trip to the device, and on a
+     * small or simple image that round trip is most of what the clock sees. A rule that only asked whether the submit
+     * came back late would then read every band as too slow and shrink until each one covered a single row, which is the
+     * worst possible way to spend that round trip and is a hole it could never climb out of. A rate notices instead that
+     * a wider band cost no more, and widens.
+     *
+     * The rate is measured from the rows actually submitted rather than from the current guess, so one band clamped by
+     * what was left of the image does not stop the next one from growing.
+     */
+    record(durationMs, rows) {
+        if (!Number.isFinite(durationMs) || durationMs <= 0 || rows <= 0)
+            return;
+        const observed = rows / durationMs;
+        // Good news is believed at once, since it can only mean the band was cheaper than the clock suggested. Bad news
+        // is taken gradually, so one submit that happened to land behind something else does not collapse the band.
+        this.throughput = observed > this.throughput ? observed : this.throughput * DECAY + observed * (1 - DECAY);
+        this.rows = Math.max(1, Math.min(this.maxRows, rows * GROW, this.targetMs * this.throughput));
+    }
+    /** Back to the unmeasured band, for a new scene or a new size. */
+    reset() {
+        this.rows = this.initialRows;
+        this.throughput = 0;
+    }
+}
+//# sourceMappingURL=dispatchScheduler.js.map

package/dist/dispatchScheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dispatchScheduler.js","sourceRoot":"","sources":["../src/dispatchScheduler.ts"],"names":[],"mappings":"AAiBA,0GAA0G;AAC1G,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,6FAA6F;AAC7F,MAAM,KAAK,GAAG,GAAG,CAAC;AAElB,MAAM,OAAO,iBAAiB;IACX,QAAQ,CAAS;IACjB,WAAW,CAAS;IACpB,OAAO,CAAS;IACzB,IAAI,CAAS;IACrB,oGAAoG;IAC5F,UAAU,GAAG,CAAC,CAAC;IAEvB,YAAY,OAAiC;QAC3C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;QACvC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9F,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;IAC/B,CAAC;IAED,uEAAuE;IACvE,IAAI,CAAC,SAAiB;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,UAAkB,EAAE,IAAY;QACrC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;YAAE,OAAO;QAEzE,MAAM,QAAQ,GAAG,IAAI,GAAG,UAAU,CAAC;QAEnC,gHAAgH;QAChH,4GAA4G;QAC5G,IAAI,CAAC,UAAU,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3G,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,kEAAkE;IAClE,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;CACF"}