@meimu/mutracer 0.3.0 → 0.3.1

package/lib/renderer/TileRender.js

@@ -127,7 +127,7 @@ export function makeTileRender(gl) {
         }
     };
 }
-function getPredictResult(width, height, lastTraceTime, expectFrameTime, tilePixels, maxNumTiles) {
+function getPredictResult(width, height, lastTraceTime, expectFrameTime, tilePixels, maxNumTiles, minimumTileSize, minimumPredictionSize) {
     const maxTileSize = [width, height];
     const rawCount = lastTraceTime > 0 ? expectFrameTime / lastTraceTime : 1;
     // GPU cost is not perfectly linear with tile area: tiny probes include fixed
@@ -148,6 +148,11 @@ function getPredictResult(width, height, lastTraceTime, expectFrameTime, tilePix
         samplesPerFrame *= Math.floor(newTileHeight / maxTileSize[1]);
     }
     newTileHeight = Math.min(newTileHeight, maxTileSize[1]);
+    // A compute dispatch still occupies a whole workgroup when fewer lanes
+    // are active. Splitting below that footprint repeats the fixed kernel cost
+    // and can make timestamp feedback progressively slow down a tiny render.
+    newTileWidth = Math.max(newTileWidth, Math.min(width, Math.max(minimumTileSize, minimumPredictionSize[0])));
+    newTileHeight = Math.max(newTileHeight, Math.min(height, Math.max(minimumTileSize, minimumPredictionSize[1])));
     let newColumns = Math.round(width / newTileWidth);
     let newRows = Math.round(height / newTileHeight);
     newTileWidth = Math.ceil(width / newColumns);
@@ -181,7 +186,56 @@ function getInitialProbeSize(width, height) {
         Math.min(height, Math.max(1, Math.round(Math.sqrt(initialProbePixels / aspectRatio))))
     ];
 }
-export function makeTileRenderWithPredict() {
+// Keep repeated kernel/longest-path cost below one fifth of the sample where
+// possible. If that conflicts with responsiveness, prioritize the tile ceiling.
+const maximumFixedCostShare = 0.2;
+// A throughput-oriented ceiling still leaves over 5x margin below a 2s TDR.
+// This is a prediction, not a guarantee for unusually expensive sample paths.
+const maximumUnattainableTileMs = 350;
+const unattainableBudgetTolerance = 1.1;
+// Nearby grids amplify timestamp noise when extrapolating to zero pixels.
+const minimumAffineAreaChange = 0.2;
+function getUnattainableBudgetGrid(width, height, fixedMs, msPerPixel, minimumTileSize, maxNumTiles, samplesPerFrame) {
+    const areaCost = msPerPixel * width * height;
+    const maxColumns = Math.max(1, Math.floor(width / minimumTileSize));
+    const maxRows = Math.max(1, Math.floor(height / minimumTileSize));
+    // If the fixed cost alone exceeds the ceiling, no subdivision can meet it.
+    // Avoid multiplying an unavoidable stall by an ever-growing tile count.
+    const required = fixedMs < maximumUnattainableTileMs
+        ? Math.ceil(areaCost / (maximumUnattainableTileMs - fixedMs)) : 1;
+    const minimumTiles = clamp(required, 1, maxColumns * maxRows);
+    let fewest;
+    let withinBoth;
+    const better = (candidate, best) => !best || candidate.count < best.count ||
+        (candidate.count === best.count &&
+            Math.abs(candidate.columns - candidate.rows) < Math.abs(best.columns - best.rows));
+    for (let columns = 1; columns <= Math.min(maxColumns, minimumTiles); columns++) {
+        const rows = Math.ceil(minimumTiles / columns);
+        if (rows > maxRows)
+            continue;
+        const count = columns * rows, candidate = { columns, rows, count };
+        if (better(candidate, fewest))
+            fewest = candidate;
+        const tileMs = fixedMs + areaCost / count;
+        const fixedShare = count * fixedMs / (count * fixedMs + areaCost);
+        if (tileMs <= maximumUnattainableTileMs && fixedShare <= maximumFixedCostShare &&
+            better(candidate, withinBoth))
+            withinBoth = candidate;
+    }
+    // Fewer tiles also minimize fixed cost. If even the fewest grid that meets
+    // the ceiling exceeds the share limit, no grid can satisfy both constraints.
+    let { columns, rows, count: numTiles } = (withinBoth ?? fewest);
+    if (numTiles > maxNumTiles) {
+        // Preserve the existing rectangular rounding of the public maxTiles cap.
+        numTiles = maxNumTiles;
+        columns = Math.ceil(Math.sqrt(numTiles));
+        rows = Math.ceil(numTiles / columns);
+        numTiles = columns * rows;
+    }
+    return { columns, rows, numTiles, tileWidth: Math.ceil(width / columns),
+        tileHeight: Math.ceil(height / rows), samplesPerFrame };
+}
+export function makeTileRenderWithPredict(minimumTileSize = 1) {
     let numTiles = 1;
     let currentTile = -1;
     let lastTraceTime = -1;
@@ -202,6 +256,18 @@ export function makeTileRenderWithPredict() {
     let columns = 0;
     let rows = 0;
     let maxNumTiles = Infinity;
+    // Validate a refinement against the grid that motivated it. A smaller
+    // dispatch can retain most of the longest path / fixed kernel cost.
+    let refinement;
+    let minimumPredictionSize = [0, 0];
+    let lastMeasurement;
+    let unattainableGrid;
+    function clearPredictionEvidence() {
+        refinement = undefined;
+        minimumPredictionSize = [0, 0];
+        lastMeasurement = undefined;
+        unattainableGrid = undefined;
+    }
     function nextTile() {
         currentTile++;
         const avgTileTime = lastFrameTraceTimeValidCount > 0
@@ -212,7 +278,48 @@ export function makeTileRenderWithPredict() {
         }
         if (currentTile === 0 && timingRevision !== appliedTimingRevision) {
             appliedTimingRevision = timingRevision;
-            const result = getPredictResult(width, height, avgTileTime, expectFrameTime, lastTraceTime >= 0 ? tilePixels : getInitialProbeSize(width, height), maxNumTiles);
+            const measured = lastFrameTraceTimeValidCount > 0;
+            let rollback;
+            if (measured && refinement) {
+                const areaRatio = refinement.grid.numTiles / numTiles;
+                // Require at least half of the area-proportional improvement, unless
+                // the new tile already fits the budget (with 10% timing tolerance).
+                if (avgTileTime > expectFrameTime * 1.1 &&
+                    avgTileTime > refinement.time * (1 - (1 - areaRatio) * 0.5)) {
+                    rollback = refinement;
+                    minimumPredictionSize = [rollback.grid.tileWidth, rollback.grid.tileHeight];
+                }
+                refinement = undefined;
+            }
+            let result = rollback?.grid ?? getPredictResult(width, height, avgTileTime, expectFrameTime, lastTraceTime >= 0 ? tilePixels : getInitialProbeSize(width, height), maxNumTiles, minimumTileSize, minimumPredictionSize);
+            if (measured && columns > 0 && rows > 0 && !unattainableGrid) {
+                // Use nominal covered area, rather than ceil-rounded dispatch bounds:
+                // the interleaved grid covers every pixel exactly once per sample.
+                const point = { area: width * height / numTiles, time: avgTileTime };
+                if (lastMeasurement && Math.abs(point.area - lastMeasurement.area) >=
+                    minimumAffineAreaChange * Math.max(point.area, lastMeasurement.area)) {
+                    const slope = (point.time - lastMeasurement.time) / (point.area - lastMeasurement.area);
+                    const fixed = point.time - slope * point.area;
+                    if (Number.isFinite(slope) && slope > 0 && Number.isFinite(fixed) &&
+                        fixed >= expectFrameTime * unattainableBudgetTolerance) {
+                        unattainableGrid = getUnattainableBudgetGrid(width, height, fixed, slope, minimumTileSize, maxNumTiles, result.samplesPerFrame);
+                    }
+                }
+                lastMeasurement = point;
+            }
+            if (unattainableGrid) {
+                // Retain the decision until explicit invalidation. Re-fitting on its
+                // own probe/target grids can alternate counts as path costs fluctuate.
+                // Keep the original samplesPerFrame calculation independent of this policy.
+                result = { ...unattainableGrid, samplesPerFrame: result.samplesPerFrame };
+                refinement = undefined;
+            }
+            if (!unattainableGrid && !rollback && measured && result.numTiles > numTiles) {
+                refinement = {
+                    grid: { tileWidth, tileHeight, columns, rows, numTiles, samplesPerFrame },
+                    time: avgTileTime
+                };
+            }
             lastFrameTotalTraceTime = 0;
             lastFrameTraceTimeValidCount = 0;
             tileWidth = result.tileWidth;
@@ -246,28 +353,42 @@ export function makeTileRenderWithPredict() {
             currentTile = -1;
         },
         setSize(w, h) {
-            if (width !== w || height !== h)
+            if (width !== w || height !== h) {
                 timingRevision++;
+                clearPredictionEvidence();
+                lastTraceTime = -1;
+                lastFrameTotalTraceTime = 0;
+                lastFrameTraceTimeValidCount = 0;
+            }
             width = w;
             height = h;
         },
         setMaxTiles(maxTiles) {
-            if (maxNumTiles !== maxTiles)
+            if (maxNumTiles !== maxTiles) {
                 timingRevision++;
+                clearPredictionEvidence();
+            }
             maxNumTiles = maxTiles;
         },
         setDesiredMsPerTile(time) {
-            if (expectFrameTime !== time)
+            if (expectFrameTime !== time) {
                 timingRevision++;
+                clearPredictionEvidence();
+            }
             expectFrameTime = time;
         },
         needsUpdatePredicting() {
+            clearPredictionEvidence();
             timingRevision++;
             lastTraceTime = -1;
             lastFrameTotalTraceTime = 0;
             lastFrameTraceTimeValidCount = 0;
         },
-        setLastTraceTime(time) {
+        setLastTraceTime(time, timedColumns = columns, timedRows = rows) {
+            // A timestamp can arrive after the next sample changed the grid. Only
+            // compare measurements of the grid currently being evaluated.
+            if (timedColumns !== columns || timedRows !== rows || !Number.isFinite(time) || time <= 0)
+                return;
             timingRevision++;
             lastTraceTime = time;
             lastFrameTraceTimeValidCount++;

package/lib/renderer/TileRender.js.map

@@ -1 +1 @@
-{"version":3,"file":"TileRender.js","sourceRoot":"","sources":["../../src/renderer/TileRender.ts"],"names":[],"mappings":"AAAA,qDAAqD;AACrD,sDAAsD;AACtD,kFAAkF;AAElF,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAElC,uEAAuE;AAEvE,oDAAoD;AACpD,8EAA8E;AAE9E,mGAAmG;AACnG,oGAAoG;AAEpG,+GAA+G;AAC/G,8GAA8G;AAE9G,MAAM,UAAU,cAAc,CAAC,EAA2B;IACxD,IAAI,gBAAgB,GAAG,EAAE,CAAC;IAC1B,IAAI,WAAW,GAAG,QAAQ,CAAC;IAE3B,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,IAAI,SAAiB,CAAC;IACtB,IAAI,UAAkB,CAAC;IAEvB,IAAI,OAAe,CAAC;IACpB,IAAI,IAAY,CAAC;IAEjB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,6CAA6C;IAC7C,uFAAuF;IACvF,uDAAuD;IACvD,IAAI,aAAa,GAAG,EAAE,CAAC,CAAC,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAE5D,SAAS,KAAK;QACZ,WAAW,GAAG,CAAC,CAAC,CAAC;QACjB,cAAc,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;QACnC,KAAK,GAAG,CAAC,CAAC;QACV,MAAM,GAAG,CAAC,CAAC;QACX,KAAK,EAAE,CAAC;QACR,kBAAkB,EAAE,CAAC;IACvB,CAAC;IAED,SAAS,kBAAkB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,MAAM,WAAW,GAAG,KAAK,GAAG,MAAM,CAAC;QAEnC,6EAA6E;QAC7E,SAAS,GAAG,IAAI,CAAC,IAAI,CACnB,QAAQ;YACN,IAAI,CAAC,GAAG,CACN,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,EAC7D,CAAC,CACF,CACJ,CAAC;QACF,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;QAEhD,IAAI,SAAS,GAAG,KAAK,IAAI,UAAU,GAAG,MAAM,EAAE,CAAC;YAC7C,OAAO,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,CAAC,CAAC;YACT,QAAQ,GAAG,CAAC,CAAC;YAEb,UAAU;gBACR,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,CAAC,CAAC;YAEf,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;YACvC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;YACtC,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;QAC5B,CAAC;QAED,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC3B,uCAAuC;YACvC,QAAQ,GAAG,WAAW,CAAC;YACvB,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;YACrC,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;YAC1B,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;YACvC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,SAAS,mBAAmB;QAC1B,MAAM,SAAS,GAAG,cAAc,GAAG,UAAU,CAAC;QAE9C,MAAM,KAAK,GAAG,gBAAgB,GAAG,SAAS,CAAC;QAE3C,iGAAiG;QACjG,MAAM,QAAQ,GAAG,IAAI,CAAC;QAEtB,iFAAiF;QACjF,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1E,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,SAAS,QAAQ,CAAC,cAAuB;QACvC,uEAAuE;QACvE,yEAAyE;QACzE,IACE,WAAW,IAAI,CAAC,IAAI,cAAc,IAAI,IAAI;YAC1C,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,EACrD,CAAC;YACD,cAAc,IAAI,cAAc,CAAC;YACjC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,WAAW,EAAE,CAAC;QAEd,IAAI,WAAW,GAAG,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjC,IAAI,UAAU,EAAE,CAAC;gBACf,mBAAmB,EAAE,CAAC;gBACtB,kBAAkB,EAAE,CAAC;YACvB,CAAC;YAED,cAAc,GAAG,CAAC,CAAC;YACnB,UAAU,GAAG,CAAC,CAAC;YACf,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,UAAU,GAAG,WAAW,KAAK,QAAQ,GAAG,CAAC,CAAC;QAEhD,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;QAEnD,OAAO;YACL,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,OAAO;YACP,IAAI;YACJ,CAAC,EAAE,CAAC,GAAG,SAAS;YAChB,CAAC,EAAE,CAAC,GAAG,UAAU;YACjB,SAAS;YACT,UAAU;YACV,WAAW,EAAE,WAAW,KAAK,CAAC;YAC9B,UAAU;YACV,eAAe,EAAE,UAAU;SAC5B,CAAC;IACJ,CAAC;IAED,OAAO;QACL,QAAQ;QACR,KAAK;QACL,OAAO;QACP,WAAW,CAAC,QAAgB;YAC1B,WAAW,GAAG,QAAQ,CAAC;QACzB,CAAC;QACD,mBAAmB,CAAC,IAAY;YAC9B,gBAAgB,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,mBAAmB;YACjB,OAAO,gBAAgB,CAAC;QAC1B,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAa,EACb,MAAc,EACd,aAAqB,EACrB,eAAuB,EACvB,UAAoB,EACpB,WAAmB;IAEnB,MAAM,WAAW,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,6EAA6E;IAC7E,yEAAyE;IACzE,6EAA6E;IAC7E,6EAA6E;IAC7E,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAEvC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAE9B,IAAI,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;IAEjD,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;IAC7C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IAE5C,IAAI,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;IAEvC,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;QAC9B,WAAW,GAAG,WAAW,CAAC;QAC1B,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC;QAC9C,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;QACnC,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC7C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO;QACL,SAAS,EAAE,YAAY;QACvB,UAAU,EAAE,aAAa;QACzB,OAAO,EAAE,UAAU;QACnB,IAAI,EAAE,OAAO;QACb,QAAQ,EAAE,WAAW;QACrB,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,2EAA2E;AAC3E,8EAA8E;AAC9E,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAElC,SAAS,mBAAmB,CAAC,KAAa,EAAE,MAAc;IACxD,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO;QACL,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;KACvF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,yBAAyB;IACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;IACvB,0EAA0E;IAC1E,kFAAkF;IAClF,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,qBAAqB,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,uBAAuB,GAAG,CAAC,CAAC;IAChC,IAAI,4BAA4B,GAAG,CAAC,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,aAAa;IACb,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,IAAI,WAAW,GAAG,QAAQ,CAAC;IAE3B,SAAS,QAAQ;QACf,WAAW,EAAE,CAAC;QACd,MAAM,WAAW,GACf,4BAA4B,GAAG,CAAC;YAC9B,CAAC,CAAC,uBAAuB,GAAG,4BAA4B;YACxD,CAAC,CAAC,aAAa,CAAC;QAEpB,IAAI,WAAW,GAAG,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjC,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,IAAI,WAAW,KAAK,CAAC,IAAI,cAAc,KAAK,qBAAqB,EAAE,CAAC;YAClE,qBAAqB,GAAG,cAAc,CAAC;YACvC,MAAM,MAAM,GAAG,gBAAgB,CAC7B,KAAK,EACL,MAAM,EACN,WAAW,EACX,eAAe,EACf,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,EACpE,WAAW,CACZ,CAAC;YAEF,uBAAuB,GAAG,CAAC,CAAC;YAC5B,4BAA4B,GAAG,CAAC,CAAC;YACjC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;YAC7B,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;YAC/B,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;YACzB,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC3B,eAAe,GAAG,MAAM,CAAC,eAAe,CAAC;QAC3C,CAAC;QAED,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;QACnD,MAAM,UAAU,GAAG,WAAW,KAAK,QAAQ,GAAG,CAAC,CAAC;QAEhD,UAAU,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAErC,OAAO;YACL,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,OAAO;YACP,IAAI;YACJ,CAAC,EAAE,CAAC,GAAG,SAAS;YAChB,CAAC,EAAE,CAAC,GAAG,UAAU;YACjB,SAAS;YACT,UAAU;YACV,WAAW,EAAE,WAAW,KAAK,CAAC;YAC9B,UAAU;YACV,eAAe;SAChB,CAAC;IACJ,CAAC;IAED,OAAO;QACL,QAAQ;QACR,KAAK;YACH,WAAW,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,CAAC,CAAS,EAAE,CAAS;YAC1B,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC;gBAAE,cAAc,EAAE,CAAC;YAClD,KAAK,GAAG,CAAC,CAAC;YACV,MAAM,GAAG,CAAC,CAAC;QACb,CAAC;QACD,WAAW,CAAC,QAAgB;YAC1B,IAAI,WAAW,KAAK,QAAQ;gBAAE,cAAc,EAAE,CAAC;YAC/C,WAAW,GAAG,QAAQ,CAAC;QACzB,CAAC;QACD,mBAAmB,CAAC,IAAY;YAC9B,IAAI,eAAe,KAAK,IAAI;gBAAE,cAAc,EAAE,CAAC;YAC/C,eAAe,GAAG,IAAI,CAAC;QACzB,CAAC;QACD,qBAAqB;YACnB,cAAc,EAAE,CAAC;YACjB,aAAa,GAAG,CAAC,CAAC,CAAC;YACnB,uBAAuB,GAAG,CAAC,CAAC;YAC5B,4BAA4B,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,gBAAgB,CAAC,IAAY;YAC3B,cAAc,EAAE,CAAC;YACjB,aAAa,GAAG,IAAI,CAAC;YACrB,4BAA4B,EAAE,CAAC;YAC/B,uBAAuB,IAAI,IAAI,CAAC;QAClC,CAAC;QACD,gBAAgB;YACd,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,mBAAmB;YACjB,OAAO,eAAe,CAAC;QACzB,CAAC;KACF,CAAC;AACJ,CAAC;AAGD,SAAS,qBAAqB,CAAC,EAA0B;IACvD,MAAM,mBAAmB,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC;IAEtE,IAAI,mBAAmB,IAAI,IAAI,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;SAAM,CAAC;QACN,wEAAwE;QACxE,0EAA0E;QAC1E,kDAAkD;QAClD,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC","sourcesContent":["// Portions adapted from ray-tracing-renderer@0.10.15\n// (https://github.com/hoverinc/ray-tracing-renderer).\n// Copyright (c) 2019 HOVER, MIT license; see LICENSES/RayTracingRenderer-MIT.txt.\n\nimport { clamp } from './util.js';\n\n// TileRender is based on the concept of a compute shader's work group.\n\n// Path tracing the scene can be very slow (<1 fps).\n// This overworks the GPU and tends to lock up the OS, making it unresponsive.\n\n// To fix this, we can split the screen into smaller tiles, and sample the scene one tile at a time\n// The tile size is set such that each tile takes approximately a constant amount of time to render.\n\n// Since the render time of a tile is dependent on the device, we find the desired tile dimensions by measuring\n// the time it takes to render an arbitrarily-set tile size and adjusting the size according to the benchmark.\n\nexport function makeTileRender(gl?: WebGL2RenderingContext) {\n  let desiredMsPerTile = 21;\n  let maxNumTiles = Infinity;\n\n  let currentTile = -1;\n  let numTiles = 1;\n  let numSamples = 1;\n\n  let tileWidth: number;\n  let tileHeight: number;\n\n  let columns: number;\n  let rows: number;\n\n  let width = 0;\n  let height = 0;\n\n  let totalElapsedMs = 0;\n  let timedTiles = 0;\n\n  // initial number of pixels per rendered tile\n  // based on correlation between system performance and max supported render buffer size\n  // adjusted dynamically according to system performance\n  let pixelsPerTile = gl ? pixelsPerTileEstimate(gl) : 600000;\n\n  function reset() {\n    currentTile = -1;\n    totalElapsedMs = 0;\n    timedTiles = 0;\n  }\n\n  function setSize(w: number, h: number) {\n    width = w;\n    height = h;\n    reset();\n    calcTileDimensions();\n  }\n\n  function calcTileDimensions() {\n    const maxWidth = 3000;\n    const aspectRatio = width / height;\n\n    // quantize the width of the tile so that it evenly divides the entire window\n    tileWidth = Math.ceil(\n      maxWidth /\n        Math.max(\n          Math.round(maxWidth / Math.sqrt(pixelsPerTile * aspectRatio)),\n          1\n        )\n    );\n    tileHeight = Math.ceil(tileWidth / aspectRatio);\n\n    if (tileWidth > width && tileHeight > height) {\n      columns = 1;\n      rows = 1;\n      numTiles = 1;\n\n      numSamples =\n        Math.round(tileWidth / width) * Math.round(tileHeight / height);\n    } else {\n      numSamples = 1;\n\n      columns = Math.ceil(width / tileWidth);\n      rows = Math.ceil(height / tileHeight);\n      numTiles = columns * rows;\n    }\n\n    if (numTiles > maxNumTiles) {\n      // TODO maxNumTiles is not exact value.\n      numTiles = maxNumTiles;\n      columns = Math.ceil(Math.sqrt(numTiles));\n      rows = Math.ceil(numTiles / columns);\n      numTiles = columns * rows;\n      tileWidth = Math.ceil(width / columns);\n      tileHeight = Math.ceil(height / rows);\n    }\n  }\n\n  function updatePixelsPerTile() {\n    const msPerTile = totalElapsedMs / timedTiles;\n\n    const error = desiredMsPerTile - msPerTile;\n\n    // tweak to find balance. higher = faster convergence, lower = less fluctuations to microstutters\n    const strength = 5000;\n\n    // sqrt prevents massive fluctuations in pixelsPerTile for the occasional stutter\n    pixelsPerTile += strength * Math.sign(error) * Math.sqrt(Math.abs(error));\n    pixelsPerTile = Math.max(pixelsPerTile, 8192);\n  }\n\n  function nextTile(elapsedFrameMs?: number) {\n    // The supplied time belongs to the previous tile. After a reset it may\n    // instead describe scene preparation, compilation, or the previous view.\n    if (\n      currentTile >= 0 && elapsedFrameMs != null &&\n      Number.isFinite(elapsedFrameMs) && elapsedFrameMs > 0\n    ) {\n      totalElapsedMs += elapsedFrameMs;\n      timedTiles++;\n    }\n    currentTile++;\n\n    if (currentTile % numTiles === 0) {\n      if (timedTiles) {\n        updatePixelsPerTile();\n        calcTileDimensions();\n      }\n\n      totalElapsedMs = 0;\n      timedTiles = 0;\n      currentTile = 0;\n    }\n\n    const isLastTile = currentTile === numTiles - 1;\n\n    const x = currentTile % columns;\n    const y = Math.floor(currentTile / columns) % rows;\n\n    return {\n      xIndex: x,\n      yIndex: y,\n      columns,\n      rows,\n      x: x * tileWidth,\n      y: y * tileHeight,\n      tileWidth,\n      tileHeight,\n      isFirstTile: currentTile === 0,\n      isLastTile,\n      samplesPerFrame: numSamples\n    };\n  }\n\n  return {\n    nextTile,\n    reset,\n    setSize,\n    setMaxTiles(maxTiles: number) {\n      maxNumTiles = maxTiles;\n    },\n    setDesiredMsPerTile(time: number) {\n      desiredMsPerTile = time;\n    },\n    getDesiredMsPerTile() {\n      return desiredMsPerTile;\n    }\n  };\n}\n\nfunction getPredictResult(\n  width: number,\n  height: number,\n  lastTraceTime: number,\n  expectFrameTime: number,\n  tilePixels: number[],\n  maxNumTiles: number\n) {\n  const maxTileSize = [width, height];\n  const rawCount = lastTraceTime > 0 ? expectFrameTime / lastTraceTime : 1;\n  // GPU cost is not perfectly linear with tile area: tiny probes include fixed\n  // dispatch overhead, while very large tiles can hit cache and divergence\n  // cliffs. Limit each update to 2x per dimension so prediction converges in a\n  // few samples without jumping from the probe straight to a blocking 4K tile.\n  const count = clamp(rawCount, 0.25, 4);\n\n  const wScale = Math.sqrt(count);\n  const hScale = count / wScale;\n\n  let newTileWidth = Math.ceil(wScale * tilePixels[0]);\n  let newTileHeight = Math.ceil(hScale * tilePixels[1]);\n\n  let samplesPerFrame = 1;\n  if (newTileWidth > maxTileSize[0] * 2) {\n    samplesPerFrame *= Math.floor(newTileWidth / maxTileSize[0]);\n  }\n  newTileWidth = Math.min(newTileWidth, maxTileSize[0]);\n  if (newTileHeight > maxTileSize[1] * 2) {\n    samplesPerFrame *= Math.floor(newTileHeight / maxTileSize[1]);\n  }\n  newTileHeight = Math.min(newTileHeight, maxTileSize[1]);\n\n  let newColumns = Math.round(width / newTileWidth);\n  let newRows = Math.round(height / newTileHeight);\n\n  newTileWidth = Math.ceil(width / newColumns);\n  newTileHeight = Math.ceil(height / newRows);\n\n  let newNumTiles = newRows * newColumns;\n\n  if (newNumTiles > maxNumTiles) {\n    newNumTiles = maxNumTiles;\n    newColumns = Math.ceil(Math.sqrt(newNumTiles));\n    newRows = Math.ceil(newNumTiles / newColumns);\n    newNumTiles = newColumns * newRows;\n    newTileWidth = Math.ceil(width / newColumns);\n    newTileHeight = Math.ceil(height / newRows);\n  }\n\n  return {\n    tileWidth: newTileWidth,\n    tileHeight: newTileHeight,\n    columns: newColumns,\n    rows: newRows,\n    numTiles: newNumTiles,\n    samplesPerFrame\n  };\n}\n\n// A 64x64 probe is dominated by dispatch and timestamp overhead on modern\n// GPUs. At 4K it also leads to an extremely conservative first prediction.\n// Use a still-small but representative amount of work, shaped like the frame.\nconst initialProbePixels = 262144;\n\nfunction getInitialProbeSize(width: number, height: number) {\n  const aspectRatio = width > 0 && height > 0 ? width / height : 1;\n  return [\n    Math.min(width, Math.max(1, Math.round(Math.sqrt(initialProbePixels * aspectRatio)))),\n    Math.min(height, Math.max(1, Math.round(Math.sqrt(initialProbePixels / aspectRatio))))\n  ];\n}\n\nexport function makeTileRenderWithPredict() {\n  let numTiles = 1;\n  let currentTile = -1;\n  let lastTraceTime = -1;\n  // Several offline samples can be submitted before a timing callback runs.\n  // Consume each measurement once so stale feedback cannot repeatedly shrink tiles.\n  let timingRevision = 0;\n  let appliedTimingRevision = -1;\n  let lastFrameTotalTraceTime = 0;\n  let lastFrameTraceTimeValidCount = 0;\n  let tilePixels = [64, 64];\n  let width = 0;\n  let height = 0;\n  let expectFrameTime = 0;\n\n  // Calcualate\n  let tileWidth = 0;\n  let tileHeight = 0;\n  let samplesPerFrame = 1;\n  let columns = 0;\n  let rows = 0;\n\n  let maxNumTiles = Infinity;\n\n  function nextTile() {\n    currentTile++;\n    const avgTileTime =\n      lastFrameTraceTimeValidCount > 0\n        ? lastFrameTotalTraceTime / lastFrameTraceTimeValidCount\n        : lastTraceTime;\n\n    if (currentTile % numTiles === 0) {\n      currentTile = 0;\n    }\n\n    if (currentTile === 0 && timingRevision !== appliedTimingRevision) {\n      appliedTimingRevision = timingRevision;\n      const result = getPredictResult(\n        width,\n        height,\n        avgTileTime,\n        expectFrameTime,\n        lastTraceTime >= 0 ? tilePixels : getInitialProbeSize(width, height),\n        maxNumTiles\n      );\n\n      lastFrameTotalTraceTime = 0;\n      lastFrameTraceTimeValidCount = 0;\n      tileWidth = result.tileWidth;\n      tileHeight = result.tileHeight;\n      columns = result.columns;\n      rows = result.rows;\n      numTiles = result.numTiles;\n      samplesPerFrame = result.samplesPerFrame;\n    }\n\n    const x = currentTile % columns;\n    const y = Math.floor(currentTile / columns) % rows;\n    const isLastTile = currentTile === numTiles - 1;\n\n    tilePixels = [tileWidth, tileHeight];\n\n    return {\n      xIndex: x,\n      yIndex: y,\n      columns,\n      rows,\n      x: x * tileWidth,\n      y: y * tileHeight,\n      tileWidth,\n      tileHeight,\n      isFirstTile: currentTile === 0,\n      isLastTile,\n      samplesPerFrame\n    };\n  }\n\n  return {\n    nextTile,\n    reset() {\n      currentTile = -1;\n    },\n    setSize(w: number, h: number) {\n      if (width !== w || height !== h) timingRevision++;\n      width = w;\n      height = h;\n    },\n    setMaxTiles(maxTiles: number) {\n      if (maxNumTiles !== maxTiles) timingRevision++;\n      maxNumTiles = maxTiles;\n    },\n    setDesiredMsPerTile(time: number) {\n      if (expectFrameTime !== time) timingRevision++;\n      expectFrameTime = time;\n    },\n    needsUpdatePredicting() {\n      timingRevision++;\n      lastTraceTime = -1;\n      lastFrameTotalTraceTime = 0;\n      lastFrameTraceTimeValidCount = 0;\n    },\n    setLastTraceTime(time: number) {\n      timingRevision++;\n      lastTraceTime = time;\n      lastFrameTraceTimeValidCount++;\n      lastFrameTotalTraceTime += time;\n    },\n    getLastTraceTime() {\n      return lastTraceTime;\n    },\n    getDesiredMsPerTile() {\n      return expectFrameTime;\n    }\n  };\n}\n\n\nfunction pixelsPerTileEstimate(gl: WebGL2RenderingContext) {\n  const maxRenderbufferSize = gl.getParameter(gl.MAX_RENDERBUFFER_SIZE);\n\n  if (maxRenderbufferSize <= 8192) {\n    return 200000;\n  } else {\n    // 16K render targets are common on current desktop/integrated GPUs. The\n    // old 400K seed unnecessarily split even 720p into several tiles and took\n    // dozens of samples to grow to a full-frame tile.\n    return 1000000;\n  }\n}\n"]}
+{"version":3,"file":"TileRender.js","sourceRoot":"","sources":["../../src/renderer/TileRender.ts"],"names":[],"mappings":"AAAA,qDAAqD;AACrD,sDAAsD;AACtD,kFAAkF;AAElF,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAElC,uEAAuE;AAEvE,oDAAoD;AACpD,8EAA8E;AAE9E,mGAAmG;AACnG,oGAAoG;AAEpG,+GAA+G;AAC/G,8GAA8G;AAE9G,MAAM,UAAU,cAAc,CAAC,EAA2B;IACxD,IAAI,gBAAgB,GAAG,EAAE,CAAC;IAC1B,IAAI,WAAW,GAAG,QAAQ,CAAC;IAE3B,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,IAAI,SAAiB,CAAC;IACtB,IAAI,UAAkB,CAAC;IAEvB,IAAI,OAAe,CAAC;IACpB,IAAI,IAAY,CAAC;IAEjB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,6CAA6C;IAC7C,uFAAuF;IACvF,uDAAuD;IACvD,IAAI,aAAa,GAAG,EAAE,CAAC,CAAC,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAE5D,SAAS,KAAK;QACZ,WAAW,GAAG,CAAC,CAAC,CAAC;QACjB,cAAc,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;QACnC,KAAK,GAAG,CAAC,CAAC;QACV,MAAM,GAAG,CAAC,CAAC;QACX,KAAK,EAAE,CAAC;QACR,kBAAkB,EAAE,CAAC;IACvB,CAAC;IAED,SAAS,kBAAkB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,MAAM,WAAW,GAAG,KAAK,GAAG,MAAM,CAAC;QAEnC,6EAA6E;QAC7E,SAAS,GAAG,IAAI,CAAC,IAAI,CACnB,QAAQ;YACN,IAAI,CAAC,GAAG,CACN,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,EAC7D,CAAC,CACF,CACJ,CAAC;QACF,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;QAEhD,IAAI,SAAS,GAAG,KAAK,IAAI,UAAU,GAAG,MAAM,EAAE,CAAC;YAC7C,OAAO,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,CAAC,CAAC;YACT,QAAQ,GAAG,CAAC,CAAC;YAEb,UAAU;gBACR,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,CAAC,CAAC;YAEf,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;YACvC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;YACtC,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;QAC5B,CAAC;QAED,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC3B,uCAAuC;YACvC,QAAQ,GAAG,WAAW,CAAC;YACvB,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;YACrC,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;YAC1B,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;YACvC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,SAAS,mBAAmB;QAC1B,MAAM,SAAS,GAAG,cAAc,GAAG,UAAU,CAAC;QAE9C,MAAM,KAAK,GAAG,gBAAgB,GAAG,SAAS,CAAC;QAE3C,iGAAiG;QACjG,MAAM,QAAQ,GAAG,IAAI,CAAC;QAEtB,iFAAiF;QACjF,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1E,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,SAAS,QAAQ,CAAC,cAAuB;QACvC,uEAAuE;QACvE,yEAAyE;QACzE,IACE,WAAW,IAAI,CAAC,IAAI,cAAc,IAAI,IAAI;YAC1C,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,EACrD,CAAC;YACD,cAAc,IAAI,cAAc,CAAC;YACjC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,WAAW,EAAE,CAAC;QAEd,IAAI,WAAW,GAAG,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjC,IAAI,UAAU,EAAE,CAAC;gBACf,mBAAmB,EAAE,CAAC;gBACtB,kBAAkB,EAAE,CAAC;YACvB,CAAC;YAED,cAAc,GAAG,CAAC,CAAC;YACnB,UAAU,GAAG,CAAC,CAAC;YACf,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,UAAU,GAAG,WAAW,KAAK,QAAQ,GAAG,CAAC,CAAC;QAEhD,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;QAEnD,OAAO;YACL,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,OAAO;YACP,IAAI;YACJ,CAAC,EAAE,CAAC,GAAG,SAAS;YAChB,CAAC,EAAE,CAAC,GAAG,UAAU;YACjB,SAAS;YACT,UAAU;YACV,WAAW,EAAE,WAAW,KAAK,CAAC;YAC9B,UAAU;YACV,eAAe,EAAE,UAAU;SAC5B,CAAC;IACJ,CAAC;IAED,OAAO;QACL,QAAQ;QACR,KAAK;QACL,OAAO;QACP,WAAW,CAAC,QAAgB;YAC1B,WAAW,GAAG,QAAQ,CAAC;QACzB,CAAC;QACD,mBAAmB,CAAC,IAAY;YAC9B,gBAAgB,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,mBAAmB;YACjB,OAAO,gBAAgB,CAAC;QAC1B,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAa,EACb,MAAc,EACd,aAAqB,EACrB,eAAuB,EACvB,UAAoB,EACpB,WAAmB,EACnB,eAAuB,EACvB,qBAA+B;IAE/B,MAAM,WAAW,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,6EAA6E;IAC7E,yEAAyE;IACzE,6EAA6E;IAC7E,6EAA6E;IAC7E,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAEvC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAE9B,IAAI,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,uEAAuE;IACvE,2EAA2E;IAC3E,yEAAyE;IACzE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAClC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EACpC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;IAEjD,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;IAC7C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IAE5C,IAAI,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;IAEvC,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;QAC9B,WAAW,GAAG,WAAW,CAAC;QAC1B,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC;QAC9C,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;QACnC,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC7C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO;QACL,SAAS,EAAE,YAAY;QACvB,UAAU,EAAE,aAAa;QACzB,OAAO,EAAE,UAAU;QACnB,IAAI,EAAE,OAAO;QACb,QAAQ,EAAE,WAAW;QACrB,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,2EAA2E;AAC3E,8EAA8E;AAC9E,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAElC,SAAS,mBAAmB,CAAC,KAAa,EAAE,MAAc;IACxD,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO;QACL,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;KACvF,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,gFAAgF;AAChF,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,4EAA4E;AAC5E,8EAA8E;AAC9E,MAAM,yBAAyB,GAAG,GAAG,CAAC;AACtC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AACxC,0EAA0E;AAC1E,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAEpC,SAAS,yBAAyB,CAChC,KAAa,EAAE,MAAc,EAAE,OAAe,EAAE,UAAkB,EAClE,eAAuB,EAAE,WAAmB,EAAE,eAAuB;IAErE,MAAM,QAAQ,GAAG,UAAU,GAAG,KAAK,GAAG,MAAM,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC;IAClE,2EAA2E;IAC3E,wEAAwE;IACxE,MAAM,QAAQ,GAAG,OAAO,GAAG,yBAAyB;QAClD,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,yBAAyB,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,CAAC;IAC9D,IAAI,MAAkE,CAAC;IACvE,IAAI,UAAyB,CAAC;IAC9B,MAAM,MAAM,GAAG,CAAC,SAAqC,EAAE,IAAmB,EAAE,EAAE,CAC5E,CAAC,IAAI,IAAI,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;QACrC,CAAC,SAAS,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK;YAC7B,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACvF,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC;QAC/E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC;QAC/C,IAAI,IAAI,GAAG,OAAO;YAAE,SAAS;QAC7B,MAAM,KAAK,GAAG,OAAO,GAAG,IAAI,EAAE,SAAS,GAAG,EAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAC,CAAC;QACjE,IAAI,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC;YAAE,MAAM,GAAG,SAAS,CAAC;QAClD,MAAM,MAAM,GAAG,OAAO,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC1C,MAAM,UAAU,GAAG,KAAK,GAAG,OAAO,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC;QAClE,IAAI,MAAM,IAAI,yBAAyB,IAAI,UAAU,IAAI,qBAAqB;YAC5E,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC;YAAE,UAAU,GAAG,SAAS,CAAC;IAC1D,CAAC;IACD,2EAA2E;IAC3E,6EAA6E;IAC7E,IAAI,EAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAC,GAAG,CAAC,UAAU,IAAI,MAAM,CAAE,CAAC;IAC/D,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;QAC3B,yEAAyE;QACzE,QAAQ,GAAG,WAAW,CAAC;QACvB,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;QACrC,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;IAC5B,CAAC;IACD,OAAO,EAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACpE,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,eAAe,EAAC,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,yBAAyB,CAAC,eAAe,GAAG,CAAC;IAC3D,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;IACvB,0EAA0E;IAC1E,kFAAkF;IAClF,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,qBAAqB,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,uBAAuB,GAAG,CAAC,CAAC;IAChC,IAAI,4BAA4B,GAAG,CAAC,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,aAAa;IACb,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,sEAAsE;IACtE,oEAAoE;IACpE,IAAI,UAAmF,CAAC;IACxF,IAAI,qBAAqB,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,IAAI,eAAyD,CAAC;IAC9D,IAAI,gBAAiE,CAAC;IAEtE,SAAS,uBAAuB;QAC9B,UAAU,GAAG,SAAS,CAAC;QACvB,qBAAqB,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,eAAe,GAAG,SAAS,CAAC;QAC5B,gBAAgB,GAAG,SAAS,CAAC;IAC/B,CAAC;IAED,SAAS,QAAQ;QACf,WAAW,EAAE,CAAC;QACd,MAAM,WAAW,GACf,4BAA4B,GAAG,CAAC;YAC9B,CAAC,CAAC,uBAAuB,GAAG,4BAA4B;YACxD,CAAC,CAAC,aAAa,CAAC;QAEpB,IAAI,WAAW,GAAG,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjC,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,IAAI,WAAW,KAAK,CAAC,IAAI,cAAc,KAAK,qBAAqB,EAAE,CAAC;YAClE,qBAAqB,GAAG,cAAc,CAAC;YACvC,MAAM,QAAQ,GAAG,4BAA4B,GAAG,CAAC,CAAC;YAClD,IAAI,QAA2B,CAAC;YAChC,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;gBAC3B,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBACtD,qEAAqE;gBACrE,oEAAoE;gBACpE,IAAI,WAAW,GAAG,eAAe,GAAG,GAAG;oBACrC,WAAW,GAAG,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;oBAC9D,QAAQ,GAAG,UAAU,CAAC;oBACtB,qBAAqB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC9E,CAAC;gBACD,UAAU,GAAG,SAAS,CAAC;YACzB,CAAC;YACD,IAAI,MAAM,GAAG,QAAQ,EAAE,IAAI,IAAI,gBAAgB,CAC7C,KAAK,EACL,MAAM,EACN,WAAW,EACX,eAAe,EACf,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,EACpE,WAAW,EACX,eAAe,EACf,qBAAqB,CACtB,CAAC;YACF,IAAI,QAAQ,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC7D,sEAAsE;gBACtE,mEAAmE;gBACnE,MAAM,KAAK,GAAG,EAAC,IAAI,EAAE,KAAK,GAAG,MAAM,GAAG,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAC,CAAC;gBACnE,IAAI,eAAe,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC;oBAChE,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvE,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;oBACxF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;oBAC9C,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;wBAC/D,KAAK,IAAI,eAAe,GAAG,2BAA2B,EAAE,CAAC;wBACzD,gBAAgB,GAAG,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EACtE,eAAe,EAAE,WAAW,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;oBAC1D,CAAC;gBACH,CAAC;gBACD,eAAe,GAAG,KAAK,CAAC;YAC1B,CAAC;YACD,IAAI,gBAAgB,EAAE,CAAC;gBACrB,qEAAqE;gBACrE,uEAAuE;gBACvE,4EAA4E;gBAC5E,MAAM,GAAG,EAAC,GAAG,gBAAgB,EAAE,eAAe,EAAE,MAAM,CAAC,eAAe,EAAC,CAAC;gBACxE,UAAU,GAAG,SAAS,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,gBAAgB,IAAI,CAAC,QAAQ,IAAI,QAAQ,IAAI,MAAM,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC;gBAC7E,UAAU,GAAG;oBACX,IAAI,EAAE,EAAC,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAC;oBACvE,IAAI,EAAE,WAAW;iBAClB,CAAC;YACJ,CAAC;YAED,uBAAuB,GAAG,CAAC,CAAC;YAC5B,4BAA4B,GAAG,CAAC,CAAC;YACjC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;YAC7B,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;YAC/B,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;YACzB,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC3B,eAAe,GAAG,MAAM,CAAC,eAAe,CAAC;QAC3C,CAAC;QAED,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;QACnD,MAAM,UAAU,GAAG,WAAW,KAAK,QAAQ,GAAG,CAAC,CAAC;QAEhD,UAAU,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAErC,OAAO;YACL,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,OAAO;YACP,IAAI;YACJ,CAAC,EAAE,CAAC,GAAG,SAAS;YAChB,CAAC,EAAE,CAAC,GAAG,UAAU;YACjB,SAAS;YACT,UAAU;YACV,WAAW,EAAE,WAAW,KAAK,CAAC;YAC9B,UAAU;YACV,eAAe;SAChB,CAAC;IACJ,CAAC;IAED,OAAO;QACL,QAAQ;QACR,KAAK;YACH,WAAW,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,CAAC,CAAS,EAAE,CAAS;YAC1B,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,cAAc,EAAE,CAAC;gBACjB,uBAAuB,EAAE,CAAC;gBAC1B,aAAa,GAAG,CAAC,CAAC,CAAC;gBACnB,uBAAuB,GAAG,CAAC,CAAC;gBAC5B,4BAA4B,GAAG,CAAC,CAAC;YACnC,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;YACV,MAAM,GAAG,CAAC,CAAC;QACb,CAAC;QACD,WAAW,CAAC,QAAgB;YAC1B,IAAI,WAAW,KAAK,QAAQ,EAAE,CAAC;gBAC7B,cAAc,EAAE,CAAC;gBACjB,uBAAuB,EAAE,CAAC;YAC5B,CAAC;YACD,WAAW,GAAG,QAAQ,CAAC;QACzB,CAAC;QACD,mBAAmB,CAAC,IAAY;YAC9B,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;gBAC7B,cAAc,EAAE,CAAC;gBACjB,uBAAuB,EAAE,CAAC;YAC5B,CAAC;YACD,eAAe,GAAG,IAAI,CAAC;QACzB,CAAC;QACD,qBAAqB;YACnB,uBAAuB,EAAE,CAAC;YAC1B,cAAc,EAAE,CAAC;YACjB,aAAa,GAAG,CAAC,CAAC,CAAC;YACnB,uBAAuB,GAAG,CAAC,CAAC;YAC5B,4BAA4B,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,gBAAgB,CAAC,IAAY,EAAE,YAAY,GAAG,OAAO,EAAE,SAAS,GAAG,IAAI;YACrE,sEAAsE;YACtE,8DAA8D;YAC9D,IAAI,YAAY,KAAK,OAAO,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO;YAClG,cAAc,EAAE,CAAC;YACjB,aAAa,GAAG,IAAI,CAAC;YACrB,4BAA4B,EAAE,CAAC;YAC/B,uBAAuB,IAAI,IAAI,CAAC;QAClC,CAAC;QACD,gBAAgB;YACd,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,mBAAmB;YACjB,OAAO,eAAe,CAAC;QACzB,CAAC;KACF,CAAC;AACJ,CAAC;AAGD,SAAS,qBAAqB,CAAC,EAA0B;IACvD,MAAM,mBAAmB,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC;IAEtE,IAAI,mBAAmB,IAAI,IAAI,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;SAAM,CAAC;QACN,wEAAwE;QACxE,0EAA0E;QAC1E,kDAAkD;QAClD,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC","sourcesContent":["// Portions adapted from ray-tracing-renderer@0.10.15\n// (https://github.com/hoverinc/ray-tracing-renderer).\n// Copyright (c) 2019 HOVER, MIT license; see LICENSES/RayTracingRenderer-MIT.txt.\n\nimport { clamp } from './util.js';\n\n// TileRender is based on the concept of a compute shader's work group.\n\n// Path tracing the scene can be very slow (<1 fps).\n// This overworks the GPU and tends to lock up the OS, making it unresponsive.\n\n// To fix this, we can split the screen into smaller tiles, and sample the scene one tile at a time\n// The tile size is set such that each tile takes approximately a constant amount of time to render.\n\n// Since the render time of a tile is dependent on the device, we find the desired tile dimensions by measuring\n// the time it takes to render an arbitrarily-set tile size and adjusting the size according to the benchmark.\n\nexport function makeTileRender(gl?: WebGL2RenderingContext) {\n  let desiredMsPerTile = 21;\n  let maxNumTiles = Infinity;\n\n  let currentTile = -1;\n  let numTiles = 1;\n  let numSamples = 1;\n\n  let tileWidth: number;\n  let tileHeight: number;\n\n  let columns: number;\n  let rows: number;\n\n  let width = 0;\n  let height = 0;\n\n  let totalElapsedMs = 0;\n  let timedTiles = 0;\n\n  // initial number of pixels per rendered tile\n  // based on correlation between system performance and max supported render buffer size\n  // adjusted dynamically according to system performance\n  let pixelsPerTile = gl ? pixelsPerTileEstimate(gl) : 600000;\n\n  function reset() {\n    currentTile = -1;\n    totalElapsedMs = 0;\n    timedTiles = 0;\n  }\n\n  function setSize(w: number, h: number) {\n    width = w;\n    height = h;\n    reset();\n    calcTileDimensions();\n  }\n\n  function calcTileDimensions() {\n    const maxWidth = 3000;\n    const aspectRatio = width / height;\n\n    // quantize the width of the tile so that it evenly divides the entire window\n    tileWidth = Math.ceil(\n      maxWidth /\n        Math.max(\n          Math.round(maxWidth / Math.sqrt(pixelsPerTile * aspectRatio)),\n          1\n        )\n    );\n    tileHeight = Math.ceil(tileWidth / aspectRatio);\n\n    if (tileWidth > width && tileHeight > height) {\n      columns = 1;\n      rows = 1;\n      numTiles = 1;\n\n      numSamples =\n        Math.round(tileWidth / width) * Math.round(tileHeight / height);\n    } else {\n      numSamples = 1;\n\n      columns = Math.ceil(width / tileWidth);\n      rows = Math.ceil(height / tileHeight);\n      numTiles = columns * rows;\n    }\n\n    if (numTiles > maxNumTiles) {\n      // TODO maxNumTiles is not exact value.\n      numTiles = maxNumTiles;\n      columns = Math.ceil(Math.sqrt(numTiles));\n      rows = Math.ceil(numTiles / columns);\n      numTiles = columns * rows;\n      tileWidth = Math.ceil(width / columns);\n      tileHeight = Math.ceil(height / rows);\n    }\n  }\n\n  function updatePixelsPerTile() {\n    const msPerTile = totalElapsedMs / timedTiles;\n\n    const error = desiredMsPerTile - msPerTile;\n\n    // tweak to find balance. higher = faster convergence, lower = less fluctuations to microstutters\n    const strength = 5000;\n\n    // sqrt prevents massive fluctuations in pixelsPerTile for the occasional stutter\n    pixelsPerTile += strength * Math.sign(error) * Math.sqrt(Math.abs(error));\n    pixelsPerTile = Math.max(pixelsPerTile, 8192);\n  }\n\n  function nextTile(elapsedFrameMs?: number) {\n    // The supplied time belongs to the previous tile. After a reset it may\n    // instead describe scene preparation, compilation, or the previous view.\n    if (\n      currentTile >= 0 && elapsedFrameMs != null &&\n      Number.isFinite(elapsedFrameMs) && elapsedFrameMs > 0\n    ) {\n      totalElapsedMs += elapsedFrameMs;\n      timedTiles++;\n    }\n    currentTile++;\n\n    if (currentTile % numTiles === 0) {\n      if (timedTiles) {\n        updatePixelsPerTile();\n        calcTileDimensions();\n      }\n\n      totalElapsedMs = 0;\n      timedTiles = 0;\n      currentTile = 0;\n    }\n\n    const isLastTile = currentTile === numTiles - 1;\n\n    const x = currentTile % columns;\n    const y = Math.floor(currentTile / columns) % rows;\n\n    return {\n      xIndex: x,\n      yIndex: y,\n      columns,\n      rows,\n      x: x * tileWidth,\n      y: y * tileHeight,\n      tileWidth,\n      tileHeight,\n      isFirstTile: currentTile === 0,\n      isLastTile,\n      samplesPerFrame: numSamples\n    };\n  }\n\n  return {\n    nextTile,\n    reset,\n    setSize,\n    setMaxTiles(maxTiles: number) {\n      maxNumTiles = maxTiles;\n    },\n    setDesiredMsPerTile(time: number) {\n      desiredMsPerTile = time;\n    },\n    getDesiredMsPerTile() {\n      return desiredMsPerTile;\n    }\n  };\n}\n\nfunction getPredictResult(\n  width: number,\n  height: number,\n  lastTraceTime: number,\n  expectFrameTime: number,\n  tilePixels: number[],\n  maxNumTiles: number,\n  minimumTileSize: number,\n  minimumPredictionSize: number[]\n) {\n  const maxTileSize = [width, height];\n  const rawCount = lastTraceTime > 0 ? expectFrameTime / lastTraceTime : 1;\n  // GPU cost is not perfectly linear with tile area: tiny probes include fixed\n  // dispatch overhead, while very large tiles can hit cache and divergence\n  // cliffs. Limit each update to 2x per dimension so prediction converges in a\n  // few samples without jumping from the probe straight to a blocking 4K tile.\n  const count = clamp(rawCount, 0.25, 4);\n\n  const wScale = Math.sqrt(count);\n  const hScale = count / wScale;\n\n  let newTileWidth = Math.ceil(wScale * tilePixels[0]);\n  let newTileHeight = Math.ceil(hScale * tilePixels[1]);\n\n  let samplesPerFrame = 1;\n  if (newTileWidth > maxTileSize[0] * 2) {\n    samplesPerFrame *= Math.floor(newTileWidth / maxTileSize[0]);\n  }\n  newTileWidth = Math.min(newTileWidth, maxTileSize[0]);\n  if (newTileHeight > maxTileSize[1] * 2) {\n    samplesPerFrame *= Math.floor(newTileHeight / maxTileSize[1]);\n  }\n  newTileHeight = Math.min(newTileHeight, maxTileSize[1]);\n\n  // A compute dispatch still occupies a whole workgroup when fewer lanes\n  // are active. Splitting below that footprint repeats the fixed kernel cost\n  // and can make timestamp feedback progressively slow down a tiny render.\n  newTileWidth = Math.max(newTileWidth,\n    Math.min(width, Math.max(minimumTileSize, minimumPredictionSize[0])));\n  newTileHeight = Math.max(newTileHeight,\n    Math.min(height, Math.max(minimumTileSize, minimumPredictionSize[1])));\n\n  let newColumns = Math.round(width / newTileWidth);\n  let newRows = Math.round(height / newTileHeight);\n\n  newTileWidth = Math.ceil(width / newColumns);\n  newTileHeight = Math.ceil(height / newRows);\n\n  let newNumTiles = newRows * newColumns;\n\n  if (newNumTiles > maxNumTiles) {\n    newNumTiles = maxNumTiles;\n    newColumns = Math.ceil(Math.sqrt(newNumTiles));\n    newRows = Math.ceil(newNumTiles / newColumns);\n    newNumTiles = newColumns * newRows;\n    newTileWidth = Math.ceil(width / newColumns);\n    newTileHeight = Math.ceil(height / newRows);\n  }\n\n  return {\n    tileWidth: newTileWidth,\n    tileHeight: newTileHeight,\n    columns: newColumns,\n    rows: newRows,\n    numTiles: newNumTiles,\n    samplesPerFrame\n  };\n}\n\n// A 64x64 probe is dominated by dispatch and timestamp overhead on modern\n// GPUs. At 4K it also leads to an extremely conservative first prediction.\n// Use a still-small but representative amount of work, shaped like the frame.\nconst initialProbePixels = 262144;\n\nfunction getInitialProbeSize(width: number, height: number) {\n  const aspectRatio = width > 0 && height > 0 ? width / height : 1;\n  return [\n    Math.min(width, Math.max(1, Math.round(Math.sqrt(initialProbePixels * aspectRatio)))),\n    Math.min(height, Math.max(1, Math.round(Math.sqrt(initialProbePixels / aspectRatio))))\n  ];\n}\n\n// Keep repeated kernel/longest-path cost below one fifth of the sample where\n// possible. If that conflicts with responsiveness, prioritize the tile ceiling.\nconst maximumFixedCostShare = 0.2;\n// A throughput-oriented ceiling still leaves over 5x margin below a 2s TDR.\n// This is a prediction, not a guarantee for unusually expensive sample paths.\nconst maximumUnattainableTileMs = 350;\nconst unattainableBudgetTolerance = 1.1;\n// Nearby grids amplify timestamp noise when extrapolating to zero pixels.\nconst minimumAffineAreaChange = 0.2;\n\nfunction getUnattainableBudgetGrid(\n  width: number, height: number, fixedMs: number, msPerPixel: number,\n  minimumTileSize: number, maxNumTiles: number, samplesPerFrame: number\n) {\n  const areaCost = msPerPixel * width * height;\n  const maxColumns = Math.max(1, Math.floor(width / minimumTileSize));\n  const maxRows = Math.max(1, Math.floor(height / minimumTileSize));\n  // If the fixed cost alone exceeds the ceiling, no subdivision can meet it.\n  // Avoid multiplying an unavoidable stall by an ever-growing tile count.\n  const required = fixedMs < maximumUnattainableTileMs\n    ? Math.ceil(areaCost / (maximumUnattainableTileMs - fixedMs)) : 1;\n  const minimumTiles = clamp(required, 1, maxColumns * maxRows);\n  let fewest: {columns: number; rows: number; count: number} | undefined;\n  let withinBoth: typeof fewest;\n  const better = (candidate: NonNullable<typeof fewest>, best: typeof fewest) =>\n    !best || candidate.count < best.count ||\n    (candidate.count === best.count &&\n      Math.abs(candidate.columns - candidate.rows) < Math.abs(best.columns - best.rows));\n  for (let columns = 1; columns <= Math.min(maxColumns, minimumTiles); columns++) {\n    const rows = Math.ceil(minimumTiles / columns);\n    if (rows > maxRows) continue;\n    const count = columns * rows, candidate = {columns, rows, count};\n    if (better(candidate, fewest)) fewest = candidate;\n    const tileMs = fixedMs + areaCost / count;\n    const fixedShare = count * fixedMs / (count * fixedMs + areaCost);\n    if (tileMs <= maximumUnattainableTileMs && fixedShare <= maximumFixedCostShare &&\n      better(candidate, withinBoth)) withinBoth = candidate;\n  }\n  // Fewer tiles also minimize fixed cost. If even the fewest grid that meets\n  // the ceiling exceeds the share limit, no grid can satisfy both constraints.\n  let {columns, rows, count: numTiles} = (withinBoth ?? fewest)!;\n  if (numTiles > maxNumTiles) {\n    // Preserve the existing rectangular rounding of the public maxTiles cap.\n    numTiles = maxNumTiles;\n    columns = Math.ceil(Math.sqrt(numTiles));\n    rows = Math.ceil(numTiles / columns);\n    numTiles = columns * rows;\n  }\n  return {columns, rows, numTiles, tileWidth: Math.ceil(width / columns),\n    tileHeight: Math.ceil(height / rows), samplesPerFrame};\n}\n\nexport function makeTileRenderWithPredict(minimumTileSize = 1) {\n  let numTiles = 1;\n  let currentTile = -1;\n  let lastTraceTime = -1;\n  // Several offline samples can be submitted before a timing callback runs.\n  // Consume each measurement once so stale feedback cannot repeatedly shrink tiles.\n  let timingRevision = 0;\n  let appliedTimingRevision = -1;\n  let lastFrameTotalTraceTime = 0;\n  let lastFrameTraceTimeValidCount = 0;\n  let tilePixels = [64, 64];\n  let width = 0;\n  let height = 0;\n  let expectFrameTime = 0;\n\n  // Calcualate\n  let tileWidth = 0;\n  let tileHeight = 0;\n  let samplesPerFrame = 1;\n  let columns = 0;\n  let rows = 0;\n\n  let maxNumTiles = Infinity;\n  // Validate a refinement against the grid that motivated it. A smaller\n  // dispatch can retain most of the longest path / fixed kernel cost.\n  let refinement: { grid: ReturnType<typeof getPredictResult>; time: number } | undefined;\n  let minimumPredictionSize = [0, 0];\n  let lastMeasurement: {area: number; time: number} | undefined;\n  let unattainableGrid: ReturnType<typeof getPredictResult> | undefined;\n\n  function clearPredictionEvidence() {\n    refinement = undefined;\n    minimumPredictionSize = [0, 0];\n    lastMeasurement = undefined;\n    unattainableGrid = undefined;\n  }\n\n  function nextTile() {\n    currentTile++;\n    const avgTileTime =\n      lastFrameTraceTimeValidCount > 0\n        ? lastFrameTotalTraceTime / lastFrameTraceTimeValidCount\n        : lastTraceTime;\n\n    if (currentTile % numTiles === 0) {\n      currentTile = 0;\n    }\n\n    if (currentTile === 0 && timingRevision !== appliedTimingRevision) {\n      appliedTimingRevision = timingRevision;\n      const measured = lastFrameTraceTimeValidCount > 0;\n      let rollback: typeof refinement;\n      if (measured && refinement) {\n        const areaRatio = refinement.grid.numTiles / numTiles;\n        // Require at least half of the area-proportional improvement, unless\n        // the new tile already fits the budget (with 10% timing tolerance).\n        if (avgTileTime > expectFrameTime * 1.1 &&\n          avgTileTime > refinement.time * (1 - (1 - areaRatio) * 0.5)) {\n          rollback = refinement;\n          minimumPredictionSize = [rollback.grid.tileWidth, rollback.grid.tileHeight];\n        }\n        refinement = undefined;\n      }\n      let result = rollback?.grid ?? getPredictResult(\n        width,\n        height,\n        avgTileTime,\n        expectFrameTime,\n        lastTraceTime >= 0 ? tilePixels : getInitialProbeSize(width, height),\n        maxNumTiles,\n        minimumTileSize,\n        minimumPredictionSize\n      );\n      if (measured && columns > 0 && rows > 0 && !unattainableGrid) {\n        // Use nominal covered area, rather than ceil-rounded dispatch bounds:\n        // the interleaved grid covers every pixel exactly once per sample.\n        const point = {area: width * height / numTiles, time: avgTileTime};\n        if (lastMeasurement && Math.abs(point.area - lastMeasurement.area) >=\n          minimumAffineAreaChange * Math.max(point.area, lastMeasurement.area)) {\n          const slope = (point.time - lastMeasurement.time) / (point.area - lastMeasurement.area);\n          const fixed = point.time - slope * point.area;\n          if (Number.isFinite(slope) && slope > 0 && Number.isFinite(fixed) &&\n            fixed >= expectFrameTime * unattainableBudgetTolerance) {\n            unattainableGrid = getUnattainableBudgetGrid(width, height, fixed, slope,\n              minimumTileSize, maxNumTiles, result.samplesPerFrame);\n          }\n        }\n        lastMeasurement = point;\n      }\n      if (unattainableGrid) {\n        // Retain the decision until explicit invalidation. Re-fitting on its\n        // own probe/target grids can alternate counts as path costs fluctuate.\n        // Keep the original samplesPerFrame calculation independent of this policy.\n        result = {...unattainableGrid, samplesPerFrame: result.samplesPerFrame};\n        refinement = undefined;\n      }\n      if (!unattainableGrid && !rollback && measured && result.numTiles > numTiles) {\n        refinement = {\n          grid: {tileWidth, tileHeight, columns, rows, numTiles, samplesPerFrame},\n          time: avgTileTime\n        };\n      }\n\n      lastFrameTotalTraceTime = 0;\n      lastFrameTraceTimeValidCount = 0;\n      tileWidth = result.tileWidth;\n      tileHeight = result.tileHeight;\n      columns = result.columns;\n      rows = result.rows;\n      numTiles = result.numTiles;\n      samplesPerFrame = result.samplesPerFrame;\n    }\n\n    const x = currentTile % columns;\n    const y = Math.floor(currentTile / columns) % rows;\n    const isLastTile = currentTile === numTiles - 1;\n\n    tilePixels = [tileWidth, tileHeight];\n\n    return {\n      xIndex: x,\n      yIndex: y,\n      columns,\n      rows,\n      x: x * tileWidth,\n      y: y * tileHeight,\n      tileWidth,\n      tileHeight,\n      isFirstTile: currentTile === 0,\n      isLastTile,\n      samplesPerFrame\n    };\n  }\n\n  return {\n    nextTile,\n    reset() {\n      currentTile = -1;\n    },\n    setSize(w: number, h: number) {\n      if (width !== w || height !== h) {\n        timingRevision++;\n        clearPredictionEvidence();\n        lastTraceTime = -1;\n        lastFrameTotalTraceTime = 0;\n        lastFrameTraceTimeValidCount = 0;\n      }\n      width = w;\n      height = h;\n    },\n    setMaxTiles(maxTiles: number) {\n      if (maxNumTiles !== maxTiles) {\n        timingRevision++;\n        clearPredictionEvidence();\n      }\n      maxNumTiles = maxTiles;\n    },\n    setDesiredMsPerTile(time: number) {\n      if (expectFrameTime !== time) {\n        timingRevision++;\n        clearPredictionEvidence();\n      }\n      expectFrameTime = time;\n    },\n    needsUpdatePredicting() {\n      clearPredictionEvidence();\n      timingRevision++;\n      lastTraceTime = -1;\n      lastFrameTotalTraceTime = 0;\n      lastFrameTraceTimeValidCount = 0;\n    },\n    setLastTraceTime(time: number, timedColumns = columns, timedRows = rows) {\n      // A timestamp can arrive after the next sample changed the grid. Only\n      // compare measurements of the grid currently being evaluated.\n      if (timedColumns !== columns || timedRows !== rows || !Number.isFinite(time) || time <= 0) return;\n      timingRevision++;\n      lastTraceTime = time;\n      lastFrameTraceTimeValidCount++;\n      lastFrameTotalTraceTime += time;\n    },\n    getLastTraceTime() {\n      return lastTraceTime;\n    },\n    getDesiredMsPerTile() {\n      return expectFrameTime;\n    }\n  };\n}\n\n\nfunction pixelsPerTileEstimate(gl: WebGL2RenderingContext) {\n  const maxRenderbufferSize = gl.getParameter(gl.MAX_RENDERBUFFER_SIZE);\n\n  if (maxRenderbufferSize <= 8192) {\n    return 200000;\n  } else {\n    // 16K render targets are common on current desktop/integrated GPUs. The\n    // old 400K seed unnecessarily split even 720p into several tiles and took\n    // dozens of samples to grow to a full-frame tile.\n    return 1000000;\n  }\n}\n"]}

package/lib/renderer/WGPUAov.d.ts

@@ -8,6 +8,9 @@ export declare class WGPUAov {
     height: number;
     samples: number;
     centerReady: boolean;
+    compact: boolean;
+    private revision;
+    private readonly borrowed;
     accumulation?: GPUBuffer;
     center?: GPUBuffer;
     previousCenter?: GPUBuffer;
@@ -23,13 +26,15 @@ export declare class WGPUAov {
     private readonly snapshotLeases;
     private readonly snapshotBuffers;
     constructor(device: GPUDevice);
+    private resolveCode;
     reset(): void;
-    resize(width: number, height: number): void;
+    resize(width: number, height: number, compact?: boolean): void;
     setScene(words: Uint32Array, primitiveIds?: Uint32Array): void;
     get bytes(): number;
     snapshot(kinds: readonly AovKind[]): Partial<Record<AovKind, GPUBuffer>>;
     releaseSnapshot(buffers: Partial<Record<AovKind, GPUBuffer>>): void;
     visualize(kind: AovKind, options: AovDisplayOptions, linear: boolean): GPUTexture;
+    texture(kind: 'depth' | 'diffuseColor' | 'specularColor'): GPUTexture | undefined;
     read(kind: AovKind): Promise<{
         width: number;
         height: number;

package/lib/renderer/WGPUAov.js

@@ -1,7 +1,12 @@
+import { textureBytes } from './gpuMemory.js';
+import { compactAovResolveCode } from './wgsl/aovCompact.wgsl.js';
+import { aovBorrowDepthShader, aovBorrowReflectanceShader } from './wgsl/aovResolve.wgsl.js';
 import { aovDisplayShader } from './wgsl/aovDisplay.wgsl.js';
 import { packAovDisplay } from './aovDisplay.js';
 import { aovSnapshotShader, aovSnapshotBinding, AOV_SNAPSHOT_BATCH_SIZE } from './wgsl/aovSnapshot.wgsl.js';
-import { AovHistory, AOV_KINDS, AOV_LAYOUT, aovMask } from './aov.js';
+import { AovHistory, AOV_KINDS, AOV_LAYOUT, aovLaneKind, aovMask } from './aov.js';
+/** @internal Content revision of each borrowed AOV texture; changes whenever it is re-resolved. */
+export const borrowedAovRevision = new WeakMap();
 /** One target's optional AOV allocations and accepted frame history. */
 export class WGPUAov {
     device;
@@ -10,6 +15,9 @@ export class WGPUAov {
     height = 0;
     samples = 0;
     centerReady = false;
+    compact = false;
+    revision = 0;
+    borrowed = new Map();
     accumulation;
     center;
     previousCenter;
@@ -27,8 +35,12 @@ export class WGPUAov {
     constructor(device) {
         this.device = device;
     }
+    resolveCode(code) {
+        return this.compact ? compactAovResolveCode(code) : code;
+    }
     reset() {
-        if (this.centerReady && this.center && this.previousCenter) {
+        this.revision++;
+        if (!this.compact && this.centerReady && this.center && this.previousCenter) {
             const encoder = this.device.createCommandEncoder();
             encoder.copyBufferToBuffer(this.center, 0, this.previousCenter, 0, this.center.size);
             this.device.queue.submit([encoder.finish()]);
@@ -37,20 +49,23 @@ export class WGPUAov {
         this.centerReady = false;
         this.frame = undefined;
     }
-    resize(width, height) {
-        if (width === this.width && height === this.height)
+    resize(width, height, compact = false) {
+        if (width === this.width && height === this.height && compact === this.compact)
             return;
-        if (width * height * AOV_LAYOUT.accumulatedBytes > this.device.limits.maxStorageBufferBindingSize || width * height * AOV_LAYOUT.accumulatedBytes > this.device.limits.maxBufferSize)
+        const stride = compact ? 24 : AOV_LAYOUT.accumulatedBytes;
+        if (width * height * stride > this.device.limits.maxStorageBufferBindingSize || width * height * stride > this.device.limits.maxBufferSize)
             throw new RangeError('AOV accumulation exceeds device buffer limits');
         this.dispose();
         this.history.clear();
         this.reset();
         this.width = width;
         this.height = height;
+        this.compact = compact;
+        this.displayPipeline = undefined;
         const usage = GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST | GPUBufferUsage.COPY_SRC;
-        this.accumulation = this.device.createBuffer({ label: 'AOV accumulation', size: width * height * AOV_LAYOUT.accumulatedBytes, usage });
-        this.previousCenter = this.device.createBuffer({ label: 'Previous AOV center', size: width * height * AOV_LAYOUT.centerBytes, usage });
-        this.center = this.device.createBuffer({ label: 'AOV center', size: width * height * AOV_LAYOUT.centerBytes, usage });
+        this.accumulation = this.device.createBuffer({ label: 'AOV accumulation', size: width * height * stride, usage });
+        this.previousCenter = this.device.createBuffer({ label: 'Previous AOV center', size: compact ? 32 : width * height * AOV_LAYOUT.centerBytes, usage });
+        this.center = this.device.createBuffer({ label: 'AOV center', size: compact ? 32 : width * height * AOV_LAYOUT.centerBytes, usage });
     }
     setScene(words, primitiveIds) {
         const bytes = words.byteLength + (primitiveIds?.byteLength ?? 0);
@@ -72,7 +87,7 @@ export class WGPUAov {
         this.scenePrimitives = primitiveIds;
         this.scenePrimitiveOffset = words.byteLength;
     }
-    get bytes() { return (this.accumulation?.size ?? 0) + (this.center?.size ?? 0) + (this.previousCenter?.size ?? 0) + (this.scene?.size ?? 0) + (this.displayTexture ? this.width * this.height * 8 : 0) + [...this.snapshotBuffers].reduce((bytes, buffer) => bytes + buffer.size, 0); }
+    get bytes() { return (this.accumulation?.size ?? 0) + (this.center?.size ?? 0) + (this.previousCenter?.size ?? 0) + (this.scene?.size ?? 0) + (this.displayTexture ? this.width * this.height * 8 : 0) + [...this.borrowed.values()].reduce((bytes, entry) => bytes + textureBytes(entry.image), 0) + [...this.snapshotBuffers].reduce((bytes, buffer) => bytes + buffer.size, 0); }
     snapshot(kinds) {
         if (!this.accumulation || !this.center || !this.samples)
             throw new Error('AOV output is not ready');
@@ -81,11 +96,11 @@ export class WGPUAov {
         const unique = AOV_KINDS.filter(kind => kinds.includes(kind));
         const batches = [];
         for (let offset = 0; offset < unique.length; offset += AOV_SNAPSHOT_BATCH_SIZE) {
-            const batch = unique.slice(offset, offset + AOV_SNAPSHOT_BATCH_SIZE), key = batch.join(',');
+            const batch = unique.slice(offset, offset + AOV_SNAPSHOT_BATCH_SIZE), key = `${this.compact}:${batch.join(',')}`;
             let pipeline = this.resolvePipelines.get(key);
             if (!pipeline) {
                 pipeline = device.createComputePipeline({ label: 'AOV snapshot', layout: 'auto',
-                    compute: { module: device.createShaderModule({ code: aovSnapshotShader(batch) }), entryPoint: 'main' } });
+                    compute: { module: device.createShaderModule({ code: this.resolveCode(aovSnapshotShader(batch)) }), entryPoint: 'main', ...(this.compact ? { constants: { AOV_COMPACT: 1 } } : {}) } });
                 this.resolvePipelines.set(key, pipeline);
             }
             batches.push({ kinds: batch, pipeline });
@@ -160,7 +175,7 @@ export class WGPUAov {
         if (!this.accumulation || !this.center || !this.samples)
             throw new Error('AOV output is not ready');
         const device = this.device;
-        this.displayPipeline ??= device.createComputePipeline({ label: 'AOV visualization', layout: 'auto', compute: { module: device.createShaderModule({ code: aovDisplayShader('rgba16float') }), entryPoint: 'main' } });
+        this.displayPipeline ??= device.createComputePipeline({ label: 'AOV visualization', layout: 'auto', compute: { module: device.createShaderModule({ code: this.resolveCode(aovDisplayShader('rgba16float')) }), entryPoint: 'main', ...(this.compact ? { constants: { AOV_COMPACT: 1 } } : {}) } });
         if (!this.displayTexture || this.displayTexture.width !== this.width || this.displayTexture.height !== this.height) {
             this.displayTexture?.destroy();
             this.displayTexture = device.createTexture({ label: 'AOV display image', size: [this.width, this.height], format: 'rgba16float', usage: GPUTextureUsage.STORAGE_BINDING | GPUTextureUsage.TEXTURE_BINDING | GPUTextureUsage.COPY_SRC });
@@ -179,7 +194,84 @@ export class WGPUAov {
         parameters.destroy();
         return this.displayTexture;
     }
+    texture(kind) {
+        if (!this.samples || !this.accumulation || !this.center)
+            return;
+        const device = this.device;
+        let entry = this.borrowed.get(kind);
+        if (!entry) {
+            // Reflectance in [0,1] is stored sRGB-encoded in 8 bits (decoded on load), halving its memory
+            // with fine steps for dark albedo; depth keeps float32 precision.
+            const depth = kind === 'depth', format = depth ? 'rg32float' : 'rgba8unorm-srgb';
+            const constants = this.compact ? { constants: { AOV_COMPACT: 1 } } : {};
+            let pipeline;
+            if (depth) {
+                pipeline = device.createComputePipeline({ label: `Borrow ${kind}`, layout: 'auto', compute: {
+                        module: device.createShaderModule({ code: this.resolveCode(aovBorrowDepthShader) }), entryPoint: 'main', ...constants
+                    } });
+            }
+            else {
+                const module = device.createShaderModule({ code: this.resolveCode(aovBorrowReflectanceShader) });
+                pipeline = device.createRenderPipeline({ label: `Borrow ${kind}`, layout: 'auto', vertex: { module, entryPoint: 'vertex', ...constants },
+                    fragment: { module, entryPoint: 'fragment', targets: [{ format }], ...constants } });
+            }
+            const image = device.createTexture({ label: `Borrow ${kind}`, size: [this.width, this.height], format,
+                usage: (depth ? GPUTextureUsage.STORAGE_BINDING : GPUTextureUsage.RENDER_ATTACHMENT) | GPUTextureUsage.TEXTURE_BINDING | GPUTextureUsage.COPY_SRC });
+            entry = { image, pipeline, samples: -1, revision: -1 };
+            this.borrowed.set(kind, entry);
+        }
+        if (entry.samples !== this.samples || entry.revision !== this.revision) {
+            const parameters = device.createBuffer({ size: 16, usage: GPUBufferUsage.UNIFORM, mappedAtCreation: true });
+            new Uint32Array(parameters.getMappedRange()).set([this.width, this.height, this.samples, aovLaneKind(kind)]);
+            parameters.unmap();
+            const encoder = device.createCommandEncoder();
+            const entries = [{ binding: 0, resource: { buffer: this.accumulation } }, { binding: 1, resource: { buffer: this.center } }, { binding: 3, resource: { buffer: parameters } }];
+            if (kind === 'depth') {
+                const pipeline = entry.pipeline;
+                const group = device.createBindGroup({ layout: pipeline.getBindGroupLayout(0), entries: [...entries, { binding: 2, resource: entry.image.createView() }] });
+                const pass = encoder.beginComputePass({ label: `Resolve ${kind}` });
+                pass.setPipeline(pipeline);
+                pass.setBindGroup(0, group);
+                pass.dispatchWorkgroups(Math.ceil(this.width / 8), Math.ceil(this.height / 8));
+                pass.end();
+            }
+            else {
+                const pipeline = entry.pipeline;
+                const group = device.createBindGroup({ layout: pipeline.getBindGroupLayout(0), entries });
+                const pass = encoder.beginRenderPass({ label: `Resolve ${kind}`, colorAttachments: [{ view: entry.image.createView(), loadOp: 'clear', storeOp: 'store' }] });
+                pass.setPipeline(pipeline);
+                pass.setBindGroup(0, group);
+                pass.draw(3);
+                pass.end();
+            }
+            device.queue.submit([encoder.finish()]);
+            parameters.destroy();
+            entry.samples = this.samples;
+            entry.revision = this.revision;
+            borrowedAovRevision.set(entry.image, (borrowedAovRevision.get(entry.image) ?? 0) + 1);
+        }
+        return entry.image;
+    }
     async read(kind) {
+        if (this.compact) {
+            const buffers = this.snapshot([kind]), source = buffers[kind];
+            const staging = this.device.createBuffer({ size: source.size, usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST });
+            try {
+                const encoder = this.device.createCommandEncoder();
+                encoder.copyBufferToBuffer(source, 0, staging, 0, source.size);
+                this.device.queue.submit([encoder.finish()]);
+                await staging.mapAsync(GPUMapMode.READ);
+                return { width: this.width, height: this.height, data: new Float32Array(staging.getMappedRange().slice(0)) };
+            }
+            finally {
+                if (staging.mapState === 'mapped')
+                    staging.unmap();
+                staging.destroy();
+                this.snapshotLeases.delete(source);
+                this.snapshotBuffers.delete(source);
+                source.destroy();
+            }
+        }
         const center = kind === 'id' || kind === 'motion';
         const source = center ? this.center : this.accumulation;
         const staging = this.device.createBuffer({ size: source.size, usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST });
@@ -208,7 +300,7 @@ export class WGPUAov {
                         else if (kind === 'roughness')
                             data.set([f[o + 1] * inv, f[o + 2] * inv, f[o + 3] * inv, coverage], target);
                         else {
-                            const offset = kind === 'diffuseAlbedo' ? o + 8 : o + 12, valid = f[offset + 3];
+                            const offset = aovLaneKind(kind) === 3 ? o + 8 : o + 12, valid = f[offset + 3];
                             const scale = valid > 0 ? 1 / valid : 0;
                             data.set([f[offset] * scale, f[offset + 1] * scale, f[offset + 2] * scale, valid / Math.max(1, this.samples)], target);
                         }
@@ -223,6 +315,8 @@ export class WGPUAov {
         }
     }
     dispose() {
+        const borrowed = [...this.borrowed.values()];
+        this.borrowed.clear();
         const texture = this.displayTexture;
         this.displayTexture = undefined;
         this.scenePrimitives = undefined;
@@ -233,7 +327,7 @@ export class WGPUAov {
         pooled.forEach(buffer => this.snapshotBuffers.delete(buffer));
         const buffers = [this.accumulation, this.center, this.scene, this.previousCenter, ...pooled];
         this.accumulation = this.center = this.scene = this.previousCenter = undefined;
-        void this.device.queue.onSubmittedWorkDone().catch(() => undefined).then(() => { texture?.destroy(); buffers.forEach(buffer => buffer?.destroy()); });
+        void this.device.queue.onSubmittedWorkDone().catch(() => undefined).then(() => { borrowed.forEach(entry => entry.image.destroy()); texture?.destroy(); buffers.forEach(buffer => buffer?.destroy()); });
     }
 }
 //# sourceMappingURL=WGPUAov.js.map