conformtools 0.5.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +92 -0
- package/dist/arriraw-Y5VXHXNX.js +525 -0
- package/dist/browser/timeline_core_bg.wasm +0 -0
- package/dist/chunk-35U7WGES.js +3 -0
- package/dist/chunk-3XTUTEKJ.js +102 -0
- package/dist/chunk-7D7H6VFW.js +3 -0
- package/dist/chunk-AACY2V3L.js +3 -0
- package/dist/chunk-AHNDJFQR.js +3 -0
- package/dist/chunk-C2ESM27Z.js +3 -0
- package/dist/chunk-DKGGJM6Z.js +3 -0
- package/dist/chunk-DRHOPOC7.js +3 -0
- package/dist/chunk-HJXRLQOI.js +3 -0
- package/dist/chunk-IDDQR56R.js +7 -0
- package/dist/chunk-JEMLKBH2.js +3 -0
- package/dist/chunk-NYB4ISL3.js +3 -0
- package/dist/chunk-P7OVDUA5.js +3 -0
- package/dist/chunk-PSANHDZM.js +3 -0
- package/dist/chunk-QDWB7QU7.js +3 -0
- package/dist/chunk-RXHNBSER.js +3 -0
- package/dist/chunk-SP5RGDAM.js +3 -0
- package/dist/chunk-TK55FA56.js +3 -0
- package/dist/chunk-UCMNH6Q6.js +3 -0
- package/dist/chunk-UUMHVA7R.js +3 -0
- package/dist/chunk-WWGQFOB2.js +64 -0
- package/dist/chunk-YPRTUS5W.js +3 -0
- package/dist/cli.js +11 -0
- package/dist/clip-state-B6JOX3JE.js +3 -0
- package/dist/cr3-wasm-X6Q4YMUU.js +3 -0
- package/dist/dng-wasm-EAB24KDN.js +3 -0
- package/dist/dpx-wasm-OX2D24ZB.js +3 -0
- package/dist/esm-SFFBP7PS.js +3 -0
- package/dist/exr-wasm-Z6BBPJSN.js +3 -0
- package/dist/h264-JHQCJTWP.js +3 -0
- package/dist/h264-mxf-4M63NBQK.js +3 -0
- package/dist/http.js +4 -0
- package/dist/inspect-6OM4FTVW.js +46 -0
- package/dist/isobmff-XL33CVJR.js +3 -0
- package/dist/mcp.js +13 -0
- package/dist/media_core-VSTO6CS4.js +9 -0
- package/dist/media_core_bg-BKXQLNFA.js +3 -0
- package/dist/media_core_bg-XIM7Y4R3.js +3 -0
- package/dist/mxf-VIANACTI.js +3 -0
- package/dist/onnxruntime-web-stub-PKJ2NZBF.js +3 -0
- package/dist/ops-7HVBBXUQ.js +3 -0
- package/dist/prores-TQEZ3KFH.js +526 -0
- package/dist/r3d-2QCFX7UX.js +3 -0
- package/dist/r3d-AT6NNIY3.js +1025 -0
- package/dist/source-BDJAUQVR.js +3 -0
- package/dist/sscd-sweep-IXM4OD7O.js +3 -0
- package/dist/still-E4HLCCST.js +3 -0
- package/dist/tiff-wasm-XYTQNL2F.js +3 -0
- package/dist/timeline_core-VK2ZWPCO.js +3 -0
- package/dist/timeline_core_bg-QEOVAIWP.js +3 -0
- package/dist/udf_bg-UTQ6BVXX.js +3 -0
- package/dist/wasm/media_core_bg.wasm +0 -0
- package/dist/wasm/udf_bg.wasm +0 -0
- package/dist/wasm-threads/media_core_bg.wasm +0 -0
- package/dist/wav-DXF73Y56.js +3 -0
- package/dist/zod-IPSV75LP.js +3 -0
- package/package.json +41 -0
package/README.md
ADDED
|
@@ -0,0 +1,92 @@
|
|
|
1
|
+
# conformtools (beta)
|
|
2
|
+
|
|
3
|
+
The [conform.tools](https://conform.tools) engine on your own machine: read an edit from one
|
|
4
|
+
host and write it for another, relink media, trim and consolidate sources, deliver packages
|
|
5
|
+
and auto conform a reference render. Use it from Claude (or any MCP client) in plain
|
|
6
|
+
language, or from a terminal.
|
|
7
|
+
|
|
8
|
+
> **Beta.** Things may change between versions. Tell us what breaks: support@conform.tools
|
|
9
|
+
|
|
10
|
+
## What you need
|
|
11
|
+
|
|
12
|
+
- [Node.js](https://nodejs.org) 20 or newer
|
|
13
|
+
- a conform.tools account with an active trial or subscription ([start a trial](https://conform.tools/pricing))
|
|
14
|
+
|
|
15
|
+
## 1. Sign in
|
|
16
|
+
|
|
17
|
+
```sh
|
|
18
|
+
npx -y conformtools login # opens your browser: sign in with the Google account you use on conform.tools
|
|
19
|
+
npx -y conformtools whoami # shows the account and plan it found
|
|
20
|
+
```
|
|
21
|
+
|
|
22
|
+
## 2a. Use it from Claude
|
|
23
|
+
|
|
24
|
+
**Claude Code**
|
|
25
|
+
|
|
26
|
+
```sh
|
|
27
|
+
claude mcp add -s user conformtools -- npx -y conformtools mcp
|
|
28
|
+
```
|
|
29
|
+
|
|
30
|
+
**Claude Desktop** — Settings → Developer → Edit Config, then add:
|
|
31
|
+
|
|
32
|
+
```json
|
|
33
|
+
{
|
|
34
|
+
"mcpServers": {
|
|
35
|
+
"conformtools": { "command": "npx", "args": ["-y", "conformtools", "mcp"] }
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
```
|
|
39
|
+
|
|
40
|
+
Cursor, Codex and other MCP clients take the same command: `npx -y conformtools mcp`.
|
|
41
|
+
|
|
42
|
+
Then just ask:
|
|
43
|
+
|
|
44
|
+
- "Read ~/Desktop/cut.aaf and tell me what's offline."
|
|
45
|
+
- "Write that as a Resolve timeline next to the source."
|
|
46
|
+
- "Relink this cut to the media in /Volumes/OCF."
|
|
47
|
+
- "Trim A001C003.mov from 01:00:10:00 to 01:00:14:12 with 12 frames of handles."
|
|
48
|
+
- "Consolidate the media for this cut into ~/Deliver with 24 frame handles."
|
|
49
|
+
|
|
50
|
+
## 2b. Or use it from a terminal
|
|
51
|
+
|
|
52
|
+
```sh
|
|
53
|
+
npm i -g conformtools
|
|
54
|
+
conformtools --list # every tool, with a one-line description
|
|
55
|
+
conformtools timeline_read '{"path":"~/Desktop/cut.aaf"}'
|
|
56
|
+
conformtools timeline_write '{"session_id":"…","target":"drt"}'
|
|
57
|
+
```
|
|
58
|
+
|
|
59
|
+
## 2c. Or call it from your own code (local HTTP API)
|
|
60
|
+
|
|
61
|
+
```sh
|
|
62
|
+
conformtools http # serves every tool on http://127.0.0.1:7791 (this machine only)
|
|
63
|
+
```
|
|
64
|
+
|
|
65
|
+
```sh
|
|
66
|
+
curl -s localhost:7791/verbs # every tool, with its JSON input schema
|
|
67
|
+
curl -s localhost:7791/verbs/timeline_read -H 'content-type: application/json' -d '{"path":"/Users/me/Desktop/cut.aaf"}'
|
|
68
|
+
curl -s localhost:7791/verbs/timeline_write -H 'content-type: application/json' -d '{"session_id":"…","target":"drt"}'
|
|
69
|
+
curl -s localhost:7791/jobs/<id> # long jobs (auto conform, deliver): status and progress
|
|
70
|
+
```
|
|
71
|
+
|
|
72
|
+
Any language that speaks HTTP works: Python, a pipeline tool, an asset manager. It listens on
|
|
73
|
+
this machine only; set `CONFORM_HTTP_TOKEN` to require `Authorization: Bearer <token>`, and
|
|
74
|
+
`CONFORM_HTTP_PORT` to change the port.
|
|
75
|
+
|
|
76
|
+
## Your files stay on your machine
|
|
77
|
+
|
|
78
|
+
Your timeline files and media are never uploaded. Media work (probing, trimming,
|
|
79
|
+
consolidating, relinking, auto conform) runs entirely on your machine. Reading and
|
|
80
|
+
writing timelines use conform.tools, exactly as the website does: the engine sends the
|
|
81
|
+
edit's structure and gets the finished timeline back. Tools that do this are marked
|
|
82
|
+
"(on conform.tools)" in `conformtools --list`, and need an internet connection.
|
|
83
|
+
|
|
84
|
+
## Account
|
|
85
|
+
|
|
86
|
+
Every tool except sign-in needs a signed-in account with an active trial or subscription. If you go
|
|
87
|
+
offline, the engine keeps working for 72 hours from its last check. `conformtools logout`
|
|
88
|
+
signs out.
|
|
89
|
+
|
|
90
|
+
---
|
|
91
|
+
|
|
92
|
+
© TBD Post. All rights reserved. Use is subject to the [conform.tools terms](https://conform.tools/terms).
|
|
@@ -0,0 +1,525 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
import { createRequire as __conformRequire } from 'node:module'; const require = __conformRequire(import.meta.url);
|
|
3
|
+
import{a as F}from"./chunk-7D7H6VFW.js";import"./chunk-PSANHDZM.js";var k={MAP_READ:1,COPY_SRC:4,COPY_DST:8,UNIFORM:64,STORAGE:128},O={READ:1};var K=`// Stage 1: 13-bit reverse-packed (LSB-first) unpack \u2014 the elementwise read_sample form
|
|
4
|
+
// (arriraw.rs read_sample), one thread per sample. Reads two aligned u32 words instead of
|
|
5
|
+
// four bytes; bit-identical. \`packed\` is padded with one extra zero word so word+1 is
|
|
6
|
+
// always in bounds.
|
|
7
|
+
struct U {
|
|
8
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
9
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
10
|
+
cp: vec4<f32>,
|
|
11
|
+
gains: vec4<u32>,
|
|
12
|
+
};
|
|
13
|
+
@group(0) @binding(0) var<storage, read> packed: array<u32>;
|
|
14
|
+
@group(0) @binding(1) var<storage, read_write> mosaic: array<u32>;
|
|
15
|
+
@group(0) @binding(2) var<uniform> u: U;
|
|
16
|
+
|
|
17
|
+
@compute @workgroup_size(8, 8)
|
|
18
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
19
|
+
if (gid.x >= u.w || gid.y >= u.h) { return; }
|
|
20
|
+
let i = gid.y * u.w + gid.x;
|
|
21
|
+
let bit = i * 13u;
|
|
22
|
+
let word = bit >> 5u;
|
|
23
|
+
let sh = bit & 31u;
|
|
24
|
+
var v = packed[word] >> sh;
|
|
25
|
+
if (sh > 19u) {
|
|
26
|
+
v |= packed[word + 1u] << (32u - sh);
|
|
27
|
+
}
|
|
28
|
+
mosaic[i] = v & 0x1fffu;
|
|
29
|
+
}
|
|
30
|
+
`;var W=`// Stage 2: prep (arriraw_prep::prep_sample) \u2014 decompand (f32 LUT, fcvtzs truncate) \u2192
|
|
31
|
+
// white balance in 8.24 fixed point \u2192 recompand (u16 LUT, stored one code per u32).
|
|
32
|
+
//
|
|
33
|
+
// The Rust does \`(v as i64 * gain + (1<<23)) >> 24\`. WGSL has no i64, so the 64-bit
|
|
34
|
+
// product is built from u32 halves (schoolbook 16x16 partials, modular u32 adds) with a
|
|
35
|
+
// two's-complement sign adjust \u2014 validated bit-exact vs the exact-integer form over the
|
|
36
|
+
// whole reachable domain in ref_check_full.mjs (gates A/B/D2). Gains must fit u32
|
|
37
|
+
// (asserted by the dump example).
|
|
38
|
+
struct U {
|
|
39
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
40
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
41
|
+
cp: vec4<f32>,
|
|
42
|
+
gains: vec4<u32>,
|
|
43
|
+
};
|
|
44
|
+
@group(0) @binding(0) var<storage, read> mosaic: array<u32>;
|
|
45
|
+
@group(0) @binding(1) var<storage, read> dec: array<f32>; // 65536
|
|
46
|
+
@group(0) @binding(2) var<storage, read> rc: array<u32>; // 262016 (u16 widened)
|
|
47
|
+
@group(0) @binding(3) var<storage, read_write> prepped: array<u32>;
|
|
48
|
+
@group(0) @binding(4) var<uniform> u: U;
|
|
49
|
+
|
|
50
|
+
const BLACK: i32 = 256;
|
|
51
|
+
const WHITE: i32 = 262015;
|
|
52
|
+
|
|
53
|
+
@compute @workgroup_size(8, 8)
|
|
54
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
55
|
+
if (gid.x >= u.w || gid.y >= u.h) { return; }
|
|
56
|
+
let i = gid.y * u.w + gid.x;
|
|
57
|
+
let gain = u.gains[(gid.y & 1u) * 2u + (gid.x & 1u)];
|
|
58
|
+
|
|
59
|
+
let raw = mosaic[i];
|
|
60
|
+
let lin0 = i32(dec[raw]); // fcvtzs: truncate toward zero
|
|
61
|
+
let v = lin0 - BLACK; // i32, >= -256 on the reachable domain
|
|
62
|
+
|
|
63
|
+
// 64-bit u32-pair product of two's-complement u32(v) and gain.
|
|
64
|
+
let a = bitcast<u32>(v);
|
|
65
|
+
let b = gain;
|
|
66
|
+
let a0 = a & 0xffffu; let a1 = a >> 16u;
|
|
67
|
+
let b0 = b & 0xffffu; let b1 = b >> 16u;
|
|
68
|
+
let ll = a0 * b0;
|
|
69
|
+
let lh = a0 * b1;
|
|
70
|
+
let hl = a1 * b0;
|
|
71
|
+
let hh = a1 * b1;
|
|
72
|
+
let cross = (ll >> 16u) + (lh & 0xffffu) + (hl & 0xffffu);
|
|
73
|
+
var lo = (ll & 0xffffu) | (cross << 16u);
|
|
74
|
+
var hi = hh + (lh >> 16u) + (hl >> 16u) + (cross >> 16u);
|
|
75
|
+
if (v < 0) { hi = hi - b; } // u32(v) = v + 2^32 \u2192 subtract b<<32
|
|
76
|
+
|
|
77
|
+
// + 2^23 with carry, then >> 24 (result fits i32 on the reachable domain)
|
|
78
|
+
let lo2 = lo + 0x800000u;
|
|
79
|
+
if (lo2 < lo) { hi = hi + 1u; }
|
|
80
|
+
let res = bitcast<i32>((lo2 >> 24u) | (hi << 8u)); // two's-complement reinterpret
|
|
81
|
+
|
|
82
|
+
var vi = res + BLACK;
|
|
83
|
+
vi = clamp(vi, 0, WHITE);
|
|
84
|
+
prepped[i] = rc[u32(vi)];
|
|
85
|
+
}
|
|
86
|
+
`;var $=`// Stage 3: ADA-7 fill green plane (arriraw_fill::green_plane) over [-1,h+1)x[-1,w+1),
|
|
87
|
+
// one thread per green node. The CPU pads the mosaic by 4 with reflect-101; here the
|
|
88
|
+
// reflect is computed in-shader (never materialized) \u2014 identical samples.
|
|
89
|
+
//
|
|
90
|
+
// green_at_rb is integer except the direction blend, which is f32 with a correctly-
|
|
91
|
+
// rounded divide (Rust \`/\`), then the SDK's fcvtas round-half-up done as
|
|
92
|
+
// \`((g as f64)+0.5).floor()\`. No f64 here: g+0.5 can be inexact in f32
|
|
93
|
+
// (25-bit span), so the round is decomposed exactly: fl=floor(g), frac=g-fl (exact by
|
|
94
|
+
// Sterbenz-range subtraction), +1 iff frac>=0.5 \u2014 bit-identical to the f64 form because
|
|
95
|
+
// f64(g)+0.5 is exact for g < 2^18. Determinism recipe from arriraw/kernel.wgsl:
|
|
96
|
+
// mulr/subr block contraction+reassociation, recip_cr+Markstein gives the CR divide.
|
|
97
|
+
struct U {
|
|
98
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
99
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
100
|
+
cp: vec4<f32>,
|
|
101
|
+
gains: vec4<u32>,
|
|
102
|
+
};
|
|
103
|
+
@group(0) @binding(0) var<storage, read> prepped: array<u32>;
|
|
104
|
+
@group(0) @binding(1) var<storage, read_write> green: array<i32>; // (h+2)*(w+2)
|
|
105
|
+
@group(0) @binding(2) var<uniform> u: U;
|
|
106
|
+
|
|
107
|
+
const CL: i32 = 65407;
|
|
108
|
+
|
|
109
|
+
fn mulr(a: f32, b: f32) -> f32 { return fma(a, b, u.zero); } // MARKER-MULR
|
|
110
|
+
fn subr(a: f32, b: f32) -> f32 { return fma(-b, u.one, a); } // MARKER-SUBR
|
|
111
|
+
fn recip_cr(s: f32) -> f32 { // MARKER-RECIP
|
|
112
|
+
let y0 = 1.0 / s;
|
|
113
|
+
let e0 = fma(-s, y0, 1.0);
|
|
114
|
+
let y1 = fma(e0, y0, y0);
|
|
115
|
+
let e1 = fma(-s, y1, 1.0);
|
|
116
|
+
return fma(e1, y1, y1);
|
|
117
|
+
}
|
|
118
|
+
// Correctly-rounded f32 divide: CR reciprocal + one Markstein step.
|
|
119
|
+
fn divr(a: f32, b: f32) -> f32 { // MARKER-DIVR
|
|
120
|
+
let y = recip_cr(b);
|
|
121
|
+
let q0 = mulr(a, y);
|
|
122
|
+
let r = fma(-b, q0, a);
|
|
123
|
+
return fma(r, y, q0);
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
fn refl(i: i32, n: i32) -> i32 {
|
|
127
|
+
var x = i;
|
|
128
|
+
if (x < 0) { x = -x; }
|
|
129
|
+
if (x >= n) { x = 2 * (n - 1) - x; }
|
|
130
|
+
return x;
|
|
131
|
+
}
|
|
132
|
+
fn mosv(r: i32, c: i32) -> i32 {
|
|
133
|
+
let v = i32(prepped[u32(refl(r, i32(u.h))) * u.w + u32(refl(c, i32(u.w)))]);
|
|
134
|
+
return min(v, CL);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
fn rsh(x: i32, s: u32) -> i32 {
|
|
138
|
+
var v = x;
|
|
139
|
+
if (v < 0) { v = v - 1; }
|
|
140
|
+
return (v + (1 << (s - 1u))) >> s;
|
|
141
|
+
}
|
|
142
|
+
fn clampcap(v: i32) -> i32 { return clamp(v, 0, CL); }
|
|
143
|
+
|
|
144
|
+
fn gest(g_l: i32, g_r: i32, c: i32, c2l: i32, c2r: i32) -> i32 {
|
|
145
|
+
let gavg = (g_l + g_r + 1) >> 1u;
|
|
146
|
+
var corr = rsh(2 * c - c2l - c2r, 3u);
|
|
147
|
+
if (g_l + g_r <= 0x7fe) { corr = rsh(corr * gavg, 10u); }
|
|
148
|
+
return clampcap(corr + gavg);
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
fn green_at_rb(r: i32, c: i32) -> i32 {
|
|
152
|
+
let gh = gest(mosv(r, c - 1), mosv(r, c + 1), mosv(r, c), mosv(r, c - 2), mosv(r, c + 2));
|
|
153
|
+
let gv = gest(mosv(r - 1, c), mosv(r + 1, c), mosv(r, c), mosv(r - 2, c), mosv(r + 2, c));
|
|
154
|
+
let ha = abs(mosv(r - 2, c - 1) - mosv(r - 2, c + 1))
|
|
155
|
+
+ abs(mosv(r - 1, c - 2) - mosv(r - 1, c))
|
|
156
|
+
+ abs(mosv(r - 1, c) - mosv(r - 1, c + 2))
|
|
157
|
+
+ 2 * abs(mosv(r, c - 1) - mosv(r, c + 1))
|
|
158
|
+
+ abs(mosv(r + 1, c - 2) - mosv(r + 1, c))
|
|
159
|
+
+ abs(mosv(r + 1, c) - mosv(r + 1, c + 2))
|
|
160
|
+
+ abs(mosv(r + 2, c - 1) - mosv(r + 2, c + 1));
|
|
161
|
+
let va = abs(mosv(r - 1, c - 2) - mosv(r + 1, c - 2))
|
|
162
|
+
+ abs(mosv(r - 2, c - 1) - mosv(r, c - 1))
|
|
163
|
+
+ abs(mosv(r, c - 1) - mosv(r + 2, c - 1))
|
|
164
|
+
+ 2 * abs(mosv(r - 1, c) - mosv(r + 1, c))
|
|
165
|
+
+ abs(mosv(r - 2, c + 1) - mosv(r, c + 1))
|
|
166
|
+
+ abs(mosv(r, c + 1) - mosv(r + 2, c + 1))
|
|
167
|
+
+ abs(mosv(r - 1, c + 2) - mosv(r + 1, c + 2));
|
|
168
|
+
let s1 = f32((ha + 4) / 8 + 1);
|
|
169
|
+
let s2 = f32((va + 4) / 8 + 1);
|
|
170
|
+
// cubes: final mul pinned (mulr) \u2014 it feeds the add/divide below and must round alone.
|
|
171
|
+
let s1c = mulr(s1 * s1, s1);
|
|
172
|
+
let s2c = mulr(s2 * s2, s2);
|
|
173
|
+
let w = divr(s2c, s1c + s2c);
|
|
174
|
+
let t1 = mulr(f32(gh), w);
|
|
175
|
+
let t3 = mulr(f32(gv), subr(1.0, w));
|
|
176
|
+
let g = t1 + t3;
|
|
177
|
+
// round-half-up (== ((f64(g))+0.5).floor() for this domain)
|
|
178
|
+
let fl = floor(g);
|
|
179
|
+
let frac = subr(g, fl);
|
|
180
|
+
var res = i32(fl);
|
|
181
|
+
if (frac >= 0.5) { res = res + 1; }
|
|
182
|
+
return res;
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
@compute @workgroup_size(8, 8)
|
|
186
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
187
|
+
if (gid.x >= u.w + 2u || gid.y >= u.h + 2u) { return; }
|
|
188
|
+
let r = i32(gid.y) - 1;
|
|
189
|
+
let c = i32(gid.x) - 1;
|
|
190
|
+
var g: i32;
|
|
191
|
+
if (((r + c) & 1) == 1) {
|
|
192
|
+
g = mosv(r, c);
|
|
193
|
+
} else {
|
|
194
|
+
g = green_at_rb(r, c);
|
|
195
|
+
}
|
|
196
|
+
green[gid.y * (u.w + 2u) + gid.x] = g;
|
|
197
|
+
}
|
|
198
|
+
`;var I=`// Stage 4: ADA-7 fill / reconstruct_pixel (arriraw_fill) \u2014 full RGB triple per pixel from
|
|
199
|
+
// the prepped mosaic + green plane. Pure integer. Writes three u32 planes.
|
|
200
|
+
struct U {
|
|
201
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
202
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
203
|
+
cp: vec4<f32>,
|
|
204
|
+
gains: vec4<u32>,
|
|
205
|
+
};
|
|
206
|
+
@group(0) @binding(0) var<storage, read> prepped: array<u32>;
|
|
207
|
+
@group(0) @binding(1) var<storage, read> green: array<i32>; // (h+2)*(w+2)
|
|
208
|
+
@group(0) @binding(2) var<storage, read_write> outR: array<u32>;
|
|
209
|
+
@group(0) @binding(3) var<storage, read_write> outG: array<u32>;
|
|
210
|
+
@group(0) @binding(4) var<storage, read_write> outB: array<u32>;
|
|
211
|
+
@group(0) @binding(5) var<uniform> u: U;
|
|
212
|
+
|
|
213
|
+
const CL: i32 = 65407;
|
|
214
|
+
|
|
215
|
+
fn refl(i: i32, n: i32) -> i32 {
|
|
216
|
+
var x = i;
|
|
217
|
+
if (x < 0) { x = -x; }
|
|
218
|
+
if (x >= n) { x = 2 * (n - 1) - x; }
|
|
219
|
+
return x;
|
|
220
|
+
}
|
|
221
|
+
fn mosv(r: i32, c: i32) -> i32 {
|
|
222
|
+
let v = i32(prepped[u32(refl(r, i32(u.h))) * u.w + u32(refl(c, i32(u.w)))]);
|
|
223
|
+
return min(v, CL);
|
|
224
|
+
}
|
|
225
|
+
fn gr(r: i32, c: i32) -> i32 {
|
|
226
|
+
return green[u32(r + 1) * (u.w + 2u) + u32(c + 1)];
|
|
227
|
+
}
|
|
228
|
+
fn rsh(x: i32, s: u32) -> i32 {
|
|
229
|
+
var v = x;
|
|
230
|
+
if (v < 0) { v = v - 1; }
|
|
231
|
+
return (v + (1 << (s - 1u))) >> s;
|
|
232
|
+
}
|
|
233
|
+
fn clampcap(v: i32) -> i32 { return clamp(v, 0, CL); }
|
|
234
|
+
|
|
235
|
+
fn chroma_at_green(n1: i32, n2: i32, g1: i32, g2: i32, g_here: i32, gated: bool) -> i32 {
|
|
236
|
+
let avg = (n1 + n2 + 1) >> 1u;
|
|
237
|
+
let base = rsh(2 * g_here - g1 - g2, 2u);
|
|
238
|
+
var corr = base;
|
|
239
|
+
if (gated) {
|
|
240
|
+
let w21 = abs(n1 - g1) + abs(n2 - g2);
|
|
241
|
+
if (w21 <= 0xff) {
|
|
242
|
+
corr = base << 1u;
|
|
243
|
+
} else if (w21 <= 0x1ff) {
|
|
244
|
+
corr = rsh((0x300 - w21) * base, 8u);
|
|
245
|
+
} else {
|
|
246
|
+
corr = base;
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
if (n1 + n2 <= 0x7fe) { corr = rsh(corr * avg, 10u); }
|
|
250
|
+
return clampcap(avg + corr);
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
fn native_chroma(r: i32, c: i32, white: i32, gated: bool) -> i32 {
|
|
254
|
+
let gc = gr(r, c);
|
|
255
|
+
let x_ul = mosv(r - 1, c - 1); let x_ur = mosv(r - 1, c + 1);
|
|
256
|
+
let x_ll = mosv(r + 1, c - 1); let x_lr = mosv(r + 1, c + 1);
|
|
257
|
+
let g_ul = gr(r - 1, c - 1); let g_ur = gr(r - 1, c + 1);
|
|
258
|
+
let g_ll = gr(r + 1, c - 1); let g_lr = gr(r + 1, c + 1);
|
|
259
|
+
let det_bs = 2 * gc - (g_ul + g_lr);
|
|
260
|
+
let det_sl = 2 * gc - (g_ur + g_ll);
|
|
261
|
+
let grad_bs = abs(x_ul - x_lr) + abs(det_bs);
|
|
262
|
+
let grad_sl = abs(x_ur - x_ll) + abs(det_sl);
|
|
263
|
+
var avg: i32;
|
|
264
|
+
var corr: i32;
|
|
265
|
+
if (grad_sl < grad_bs) {
|
|
266
|
+
avg = (x_ur + x_ll + 1) >> 1u;
|
|
267
|
+
corr = rsh(det_sl, 1u);
|
|
268
|
+
} else if (grad_sl > grad_bs) {
|
|
269
|
+
avg = (x_ul + x_lr + 1) >> 1u;
|
|
270
|
+
corr = rsh(det_bs, 1u);
|
|
271
|
+
} else {
|
|
272
|
+
avg = (x_ul + x_lr + x_ur + x_ll + 2) >> 2u;
|
|
273
|
+
corr = rsh(4 * gc - (g_ul + g_lr + g_ur + g_ll), 3u);
|
|
274
|
+
}
|
|
275
|
+
if (gated) {
|
|
276
|
+
let w20 = abs(x_ul - g_ul) + abs(x_ur - g_ur) + abs(x_ll - g_ll) + abs(x_lr - g_lr);
|
|
277
|
+
if (w20 <= 0x1ff) {
|
|
278
|
+
corr = corr << 1u;
|
|
279
|
+
} else if (w20 <= 0x3ff) {
|
|
280
|
+
corr = rsh((0x300 - (w20 >> 1u)) * corr, 8u);
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
if (avg <= 0x3ff) { corr = rsh(corr * avg, 10u); }
|
|
284
|
+
return clamp(corr + avg, 0, white);
|
|
285
|
+
}
|
|
286
|
+
|
|
287
|
+
@compute @workgroup_size(8, 8)
|
|
288
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
289
|
+
if (gid.x >= u.w || gid.y >= u.h) { return; }
|
|
290
|
+
let r = i32(gid.y);
|
|
291
|
+
let c = i32(gid.x);
|
|
292
|
+
let gc = gr(r, c);
|
|
293
|
+
var rr: i32; var gg: i32; var bb: i32;
|
|
294
|
+
let re = r & 1;
|
|
295
|
+
let ce = c & 1;
|
|
296
|
+
if (re == 0 && ce == 0) {
|
|
297
|
+
rr = mosv(r, c); gg = gc; bb = native_chroma(r, c, CL, false);
|
|
298
|
+
} else if (re == 1 && ce == 1) {
|
|
299
|
+
rr = native_chroma(r, c, CL, true); gg = gc; bb = mosv(r, c);
|
|
300
|
+
} else if (re == 0) {
|
|
301
|
+
let gh = mosv(r, c);
|
|
302
|
+
rr = chroma_at_green(mosv(r, c - 1), mosv(r, c + 1), gr(r, c - 1), gr(r, c + 1), gh, true);
|
|
303
|
+
gg = gh;
|
|
304
|
+
bb = chroma_at_green(mosv(r - 1, c), mosv(r + 1, c), gr(r - 1, c), gr(r + 1, c), gh, false);
|
|
305
|
+
} else {
|
|
306
|
+
let gh = mosv(r, c);
|
|
307
|
+
rr = chroma_at_green(mosv(r - 1, c), mosv(r + 1, c), gr(r - 1, c), gr(r + 1, c), gh, true);
|
|
308
|
+
gg = gh;
|
|
309
|
+
bb = chroma_at_green(mosv(r, c - 1), mosv(r, c + 1), gr(r, c - 1), gr(r, c + 1), gh, false);
|
|
310
|
+
}
|
|
311
|
+
let i = gid.y * u.w + gid.x;
|
|
312
|
+
outR[i] = u32(rr);
|
|
313
|
+
outG[i] = u32(gg);
|
|
314
|
+
outB[i] = u32(bb);
|
|
315
|
+
}
|
|
316
|
+
`;var q=`// Stages 5/6: ADA-7 green-guided refine (arriraw_ada7::refine_pass / refine_pixel).
|
|
317
|
+
// SNAPSHOT semantics: reads src planes, writes dst planes (ping-pong) \u2014 never in place.
|
|
318
|
+
// u.dir: 0 = horizontal (left/right), 1 = vertical (up/down). Green never changes, so a
|
|
319
|
+
// single G plane serves both passes. Border neighbour is reflect-101 (x==0 \u2192 1,
|
|
320
|
+
// x==w-1 \u2192 w-2), exactly the Rust mirror.
|
|
321
|
+
struct U {
|
|
322
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
323
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
324
|
+
cp: vec4<f32>,
|
|
325
|
+
gains: vec4<u32>,
|
|
326
|
+
};
|
|
327
|
+
@group(0) @binding(0) var<storage, read> srcR: array<u32>;
|
|
328
|
+
@group(0) @binding(1) var<storage, read> srcG: array<u32>;
|
|
329
|
+
@group(0) @binding(2) var<storage, read> srcB: array<u32>;
|
|
330
|
+
@group(0) @binding(3) var<storage, read_write> dstR: array<u32>;
|
|
331
|
+
@group(0) @binding(4) var<storage, read_write> dstB: array<u32>;
|
|
332
|
+
@group(0) @binding(5) var<uniform> u: U;
|
|
333
|
+
|
|
334
|
+
const CL: i32 = 65407;
|
|
335
|
+
|
|
336
|
+
@compute @workgroup_size(8, 8)
|
|
337
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
338
|
+
if (gid.x >= u.w || gid.y >= u.h) { return; }
|
|
339
|
+
let x = gid.x;
|
|
340
|
+
let y = gid.y;
|
|
341
|
+
var lx: u32; var ly: u32; var rx: u32; var ry: u32;
|
|
342
|
+
if (u.dir == 0u) {
|
|
343
|
+
lx = select(x - 1u, 1u, x == 0u); ly = y;
|
|
344
|
+
rx = select(u.w - 2u, x + 1u, x + 1u < u.w); ry = y;
|
|
345
|
+
} else {
|
|
346
|
+
lx = x; ly = select(y - 1u, 1u, y == 0u);
|
|
347
|
+
rx = x; ry = select(u.h - 2u, y + 1u, y + 1u < u.h);
|
|
348
|
+
}
|
|
349
|
+
let l = ly * u.w + lx;
|
|
350
|
+
let c = y * u.w + x;
|
|
351
|
+
let r = ry * u.w + rx;
|
|
352
|
+
let lr = i32(srcR[l]); let lg = i32(srcG[l]); let lb = i32(srcB[l]);
|
|
353
|
+
let cr = i32(srcR[c]); let cg = i32(srcG[c]); let cb = i32(srcB[c]);
|
|
354
|
+
let rr = i32(srcR[r]); let rg = i32(srcG[r]); let rb = i32(srcB[r]);
|
|
355
|
+
|
|
356
|
+
let lowpass_r = (lr + 2 * cr + rr + 2) >> 2u;
|
|
357
|
+
let lowpass_b = (lb + 2 * cb + rb + 2) >> 2u;
|
|
358
|
+
let gsum = lg + 2 * cg + rg;
|
|
359
|
+
let green_detail = cg - ((gsum + 2) >> 2u);
|
|
360
|
+
let rsum = lr + 2 * cr + rr;
|
|
361
|
+
let bsum = lb + 2 * cb + rb;
|
|
362
|
+
|
|
363
|
+
let grad_r = abs(abs(lr - lg) - abs(cr - cg)) + abs(abs(rr - rg) - abs(cr - cg));
|
|
364
|
+
let grad_b = abs(abs(lb - lg) - abs(cb - cg)) + abs(abs(rb - rg) - abs(cb - cg));
|
|
365
|
+
|
|
366
|
+
var wr: i32 = -1;
|
|
367
|
+
if (rsum < 2046) { wr = -4; } else if (rsum < 4094) { wr = -2; }
|
|
368
|
+
var wb: i32 = -1;
|
|
369
|
+
if (bsum < 2046) { wb = -4; } else if (bsum < 4094) { wb = -2; }
|
|
370
|
+
let conf_r = clamp(grad_r * wr, -512, -256) + 512;
|
|
371
|
+
let conf_b = clamp(grad_b * wb, -512, -256) + 512;
|
|
372
|
+
|
|
373
|
+
let tr = conf_r * green_detail;
|
|
374
|
+
let tb = conf_b * green_detail;
|
|
375
|
+
let new_r = lowpass_r + ((tr + (tr >> 31u) + 0x80) >> 8u);
|
|
376
|
+
let new_b = lowpass_b + ((tb + (tb >> 31u) + 0x100) >> 9u);
|
|
377
|
+
|
|
378
|
+
dstR[c] = u32(clamp(new_r, 0, CL));
|
|
379
|
+
dstB[c] = u32(clamp(new_b, 0, CL));
|
|
380
|
+
}
|
|
381
|
+
`;var H=`// Stage 7: colour kernel (kernel_recompand_f32_codes) + LogC4 normalize \u2014 the bit-exact
|
|
382
|
+
// port from ../arriraw/kernel.wgsl, unchanged math, re-plumbed for the full frame:
|
|
383
|
+
// * planar u32 code planes in, planar f32 planes out (per-binding < 128 MiB);
|
|
384
|
+
// * the four per-clip tables live in ONE concatenated storage buffer
|
|
385
|
+
// (rptab[0,8192) | grid_a[8192,12417) | grid_b[12417,16642) | final_lut[16642,278786))
|
|
386
|
+
// to stay within maxStorageBuffersPerShaderStage = 8;
|
|
387
|
+
// * the final \`/65535\` (Rust \`c / 65535.0f32\`, correctly rounded) is fused in as
|
|
388
|
+
// divr(code, 65535): recip_cr + one Markstein fma step.
|
|
389
|
+
// Determinism recipe (arriraw/NOTES.md): recip_cr, mulr = fma(a,b,zeroUniform),
|
|
390
|
+
// subr = fma(-b, oneUniform, a). All operation-order rules from the SDK disassembly kept.
|
|
391
|
+
struct U {
|
|
392
|
+
w: u32, h: u32, dir: u32, pad0: u32,
|
|
393
|
+
k2: f32, zero: f32, one: f32, pad1: f32,
|
|
394
|
+
cp: vec4<f32>,
|
|
395
|
+
gains: vec4<u32>,
|
|
396
|
+
};
|
|
397
|
+
@group(0) @binding(0) var<storage, read> luts: array<f32>; // 278786
|
|
398
|
+
@group(0) @binding(1) var<storage, read> inR: array<u32>;
|
|
399
|
+
@group(0) @binding(2) var<storage, read> inG: array<u32>;
|
|
400
|
+
@group(0) @binding(3) var<storage, read> inB: array<u32>;
|
|
401
|
+
@group(0) @binding(4) var<storage, read_write> outR: array<f32>;
|
|
402
|
+
@group(0) @binding(5) var<storage, read_write> outG: array<f32>;
|
|
403
|
+
@group(0) @binding(6) var<storage, read_write> outB: array<f32>;
|
|
404
|
+
@group(0) @binding(7) var<uniform> params: U;
|
|
405
|
+
|
|
406
|
+
const GA_OFF: u32 = 8192u;
|
|
407
|
+
const GB_OFF: u32 = 12417u;
|
|
408
|
+
const LUT_OFF: u32 = 16642u;
|
|
409
|
+
|
|
410
|
+
fn mulr(a: f32, b: f32) -> f32 { return fma(a, b, params.zero); } // MARKER-MULR
|
|
411
|
+
fn subr(a: f32, b: f32) -> f32 { return fma(-b, params.one, a); } // MARKER-SUBR
|
|
412
|
+
fn recip_cr(s: f32) -> f32 { // MARKER-RECIP
|
|
413
|
+
let y0 = 1.0 / s;
|
|
414
|
+
let e0 = fma(-s, y0, 1.0);
|
|
415
|
+
let y1 = fma(e0, y0, y0);
|
|
416
|
+
let e1 = fma(-s, y1, 1.0);
|
|
417
|
+
return fma(e1, y1, y1);
|
|
418
|
+
}
|
|
419
|
+
fn divr(a: f32, b: f32) -> f32 { // MARKER-DIVR
|
|
420
|
+
let y = recip_cr(b);
|
|
421
|
+
let q0 = mulr(a, y);
|
|
422
|
+
let r = fma(-b, q0, a);
|
|
423
|
+
return fma(r, y, q0);
|
|
424
|
+
}
|
|
425
|
+
|
|
426
|
+
fn rp_of(c: f32) -> f32 {
|
|
427
|
+
let idx = u32(clamp(c, 0.0, 8191.0));
|
|
428
|
+
let v = luts[idx];
|
|
429
|
+
return max((v - 256.0) + params.k2, 0.0);
|
|
430
|
+
}
|
|
431
|
+
|
|
432
|
+
fn lut_lerp(idx_in: f32) -> f32 {
|
|
433
|
+
let idx = clamp(idx_in, 0.0, 262143.0);
|
|
434
|
+
let i0 = u32(idx);
|
|
435
|
+
let i1 = min(i0 + 1u, 262143u);
|
|
436
|
+
let frac = idx - f32(i0);
|
|
437
|
+
let a = fma(frac, -luts[LUT_OFF + i0], luts[LUT_OFF + i0]); // fmsub
|
|
438
|
+
return fma(frac, luts[LUT_OFF + i1], a); // fmadd
|
|
439
|
+
}
|
|
440
|
+
|
|
441
|
+
fn cubic_w(t: f32) -> f32 {
|
|
442
|
+
let ad = abs(t);
|
|
443
|
+
let d2 = t * t;
|
|
444
|
+
let d3 = mulr(d2, ad);
|
|
445
|
+
var w: f32;
|
|
446
|
+
if (ad < 1.0) {
|
|
447
|
+
w = fma(d3, 3.0, fma(d2, -6.0, 4.0));
|
|
448
|
+
} else if (ad <= 2.0) {
|
|
449
|
+
w = fma(d2, 6.0, fma(ad, -12.0, 8.0)) - d3;
|
|
450
|
+
} else {
|
|
451
|
+
return 0.0;
|
|
452
|
+
}
|
|
453
|
+
return w * 0.16666667163372040;
|
|
454
|
+
}
|
|
455
|
+
|
|
456
|
+
fn node(sel: u32, i: u32) -> f32 {
|
|
457
|
+
if (sel == 0u) { return luts[GA_OFF + i]; }
|
|
458
|
+
return luts[GB_OFF + i];
|
|
459
|
+
}
|
|
460
|
+
|
|
461
|
+
fn bicubic(sel: u32, xi: f32, yi: f32) -> f32 {
|
|
462
|
+
let x0 = clamp(i32(xi), 0, 63);
|
|
463
|
+
let y0 = clamp(i32(yi), 0, 63);
|
|
464
|
+
var wx: array<f32, 4>;
|
|
465
|
+
var xs: array<u32, 4>;
|
|
466
|
+
var wy: array<f32, 4>;
|
|
467
|
+
var ys: array<u32, 4>;
|
|
468
|
+
for (var k = 0; k < 4; k++) {
|
|
469
|
+
let dk = k - 1;
|
|
470
|
+
wx[k] = cubic_w(xi - f32(x0 + dk));
|
|
471
|
+
xs[k] = u32(clamp(x0 + dk, 0, 64));
|
|
472
|
+
wy[k] = cubic_w(yi - f32(y0 + dk));
|
|
473
|
+
ys[k] = u32(clamp(y0 + dk, 0, 64));
|
|
474
|
+
}
|
|
475
|
+
var cols: array<f32, 4>;
|
|
476
|
+
for (var k = 0u; k < 4u; k++) {
|
|
477
|
+
let xx = xs[k];
|
|
478
|
+
var a = wy[3] * node(sel, ys[3] * 65u + xx);
|
|
479
|
+
a = fma(wy[2], node(sel, ys[2] * 65u + xx), a);
|
|
480
|
+
a = fma(wy[1], node(sel, ys[1] * 65u + xx), a);
|
|
481
|
+
a = fma(wy[0], node(sel, ys[0] * 65u + xx), a);
|
|
482
|
+
cols[k] = a;
|
|
483
|
+
}
|
|
484
|
+
var acc = wx[3] * cols[3];
|
|
485
|
+
acc = fma(wx[2], cols[2], acc);
|
|
486
|
+
acc = fma(wx[1], cols[1], acc);
|
|
487
|
+
acc = fma(wx[0], cols[0], acc);
|
|
488
|
+
return acc;
|
|
489
|
+
}
|
|
490
|
+
|
|
491
|
+
@compute @workgroup_size(8, 8)
|
|
492
|
+
fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
|
|
493
|
+
if (gid.x >= params.w || gid.y >= params.h) { return; }
|
|
494
|
+
let i = gid.y * params.w + gid.x;
|
|
495
|
+
let rp0 = rp_of(f32(inR[i]));
|
|
496
|
+
let rp1 = rp_of(f32(inG[i]));
|
|
497
|
+
let rp2 = rp_of(f32(inB[i]));
|
|
498
|
+
let s = rp2 + (rp0 + rp1);
|
|
499
|
+
if (s <= 0.0) {
|
|
500
|
+
let z = divr(lut_lerp(256.0), 65535.0);
|
|
501
|
+
outR[i] = z;
|
|
502
|
+
outG[i] = z;
|
|
503
|
+
outB[i] = z;
|
|
504
|
+
return;
|
|
505
|
+
}
|
|
506
|
+
let inv = recip_cr(s);
|
|
507
|
+
let r = rp0 * inv;
|
|
508
|
+
let g = rp1 * inv;
|
|
509
|
+
let rg = r * g;
|
|
510
|
+
let p = fma(params.cp.x, r, fma(params.cp.y, g, fma(params.cp.z, rg, params.cp.w)));
|
|
511
|
+
var c: f32;
|
|
512
|
+
if (p < 0.5) { c = 0.5; } else { c = min(p, 2.0); }
|
|
513
|
+
let xi = mulr(64.0, r);
|
|
514
|
+
let yi = mulr(64.0, g);
|
|
515
|
+
let r_raw = bicubic(0u, xi, yi);
|
|
516
|
+
let g_raw = bicubic(1u, xi, yi);
|
|
517
|
+
let b_out = max(min(subr(subr(1.0, r_raw), g_raw), 1.0), 0.0);
|
|
518
|
+
let r_out = max(min(r_raw, 1.0), 0.0);
|
|
519
|
+
let g_out = max(min(g_raw, 1.0), 0.0);
|
|
520
|
+
let scale = (s - 3.0 * params.k2) * c;
|
|
521
|
+
outR[i] = divr(lut_lerp(mulr(scale, r_out) + 256.0), 65535.0);
|
|
522
|
+
outG[i] = divr(lut_lerp(mulr(scale, g_out) + 256.0), 65535.0);
|
|
523
|
+
outB[i] = divr(lut_lerp(mulr(scale, b_out) + 256.0), 65535.0);
|
|
524
|
+
}
|
|
525
|
+
`;var g={prepDecompand:65536,prepRecompand:262016,rptab:8192,gridA:4225,gridB:4225,finalLut:262144},ir=g.rptab+g.gridA+g.gridB+g.finalLut,D=k.STORAGE,z=k.COPY_DST,tr=k.COPY_SRC,N=["unpack13","prep","green","fill","refineH","refineV","color"],M=new WeakMap,S=new WeakMap,V=Promise.resolve(),Y=!1;function C(e,r){Y||(Y=!0,console.warn(`[media/gpu/arriraw] ${e} \u2014 falling back to the WASM lane`,r??""))}async function kr(){return await F()!==null}function ur(e){let r=M.get(e);if(!r){let a=u=>e.createComputePipelineAsync({layout:"auto",compute:{module:e.createShaderModule({code:u}),entryPoint:"main"}});r=Promise.all([a(K),a(W),a($),a(I),a(q),a(H)]).then(([u,t,n,i,o,s])=>({unpack13:u,prep:t,green:n,fill:i,refine:o,color:s})),M.set(e,r),r.catch(()=>M.delete(e))}return r}function or(e){let{width:r,height:a}=e;if(!Number.isInteger(r)||!Number.isInteger(a)||r<16||a<16)return`raster ${r}x${a} out of range`;if(r%2!==0||a%2!==0)return`raster ${r}x${a} is not even (Bayer phase)`;if(e.gains8_24.length!==4)return"gains8_24 must have 4 entries";for(let[u,t]of Object.entries(g)){let n=e[u];if(n.length!==t)return`${u} must have ${t} entries (got ${n.length})`}return e.cp.length!==4?"cp must have 4 entries":null}function sr(e,r,a){let u=(r+2)*(a+2)*4,t=e.limits;if(u>t.maxStorageBufferBindingSize||u>t.maxBufferSize)return`raster ${r}x${a} exceeds device buffer limits`;let n=Math.ceil((r+2)/8),i=Math.ceil((a+2)/8);return n>t.maxComputeWorkgroupsPerDimension||i>t.maxComputeWorkgroupsPerDimension?`raster ${r}x${a} exceeds dispatch limits`:null}function Z(e,r,a){let u=new ArrayBuffer(64),t=new Uint32Array(u),n=new Float32Array(u);t[0]=r.width,t[1]=r.height,t[2]=a,t[3]=0,n[4]=r.k2,n[5]=0,n[6]=1,n[7]=0,n.set(r.cp,8),t.set(r.gains8_24,12);let i=e.createBuffer({size:64,usage:k.UNIFORM|z});return e.queue.writeBuffer(i,0,u),i}function j(e,r,a,u){let t=a.width,n=a.height,i=t*n,o=(G,B=D|tr)=>e.createBuffer({size:G,usage:B}),s=G=>{let B=e.createBuffer({size:G.byteLength,usage:D|z});return e.queue.writeBuffer(B,0,G),B},c=(Math.ceil(u/4)+1)*4,l=e.createBuffer({size:c,usage:D|z}),w=s(a.prepDecompand),m=s(Uint32Array.from(a.prepRecompand)),f=new Float32Array(ir);f.set(a.rptab,0),f.set(a.gridA,g.rptab),f.set(a.gridB,g.rptab+g.gridA),f.set(a.finalLut,g.rptab+g.gridA+g.gridB);let h=s(f),y=o(i*4),v=o(i*4),A=o((t+2)*(n+2)*4),p=o(i*4),b=o(i*4),R=o(i*4),P=o(i*4),U=o(i*4),_=Z(e,a,0),T=Z(e,a,1),x=(G,B)=>e.createBindGroup({layout:G.getBindGroupLayout(0),entries:B.map((nr,ar)=>({binding:ar,resource:{buffer:nr}}))}),er={unpack13:x(r.unpack13,[l,y,_]),prep:x(r.prep,[y,w,m,v,_]),green:x(r.green,[v,A,_]),fill:x(r.fill,[v,A,p,b,R,_]),refineH:x(r.refine,[p,b,R,P,U,_]),refineV:x(r.refine,[P,b,U,p,R,T]),color:x(r.color,[h,p,b,R,P,A,U,_])};return{device:e,w:t,h:n,packedCapacity:c,packed:l,dec:w,rc:m,luts:h,u0:_,u1:T,mosaic:y,prepped:v,green:A,r0:p,g0:b,b0:R,r1:P,b1:U,groups:er}}function cr(e){for(let r of[e.packed,e.dec,e.rc,e.luts,e.u0,e.u1,e.mosaic,e.prepped,e.green,e.r0,e.g0,e.b0,e.r1,e.b1])r.destroy()}function lr(e,r){return r==="refineH"||r==="refineV"?e.refine:e[r]}function J(e,r,a,u){let t=Math.ceil(a.w/8),n=Math.ceil(a.h/8),i=Math.ceil((a.w+2)/8),o=Math.ceil((a.h+2)/8),s=e.createCommandEncoder();for(let c of u){let l=s.beginComputePass();l.setPipeline(lr(r,c)),l.setBindGroup(0,a.groups[c]),c==="green"?l.dispatchWorkgroups(i,o):l.dispatchWorkgroups(t,n),l.end()}e.queue.submit([s.finish()])}async function d(e,r,a){let u=e.createBuffer({size:a,usage:z|k.MAP_READ}),t=e.createCommandEncoder();t.copyBufferToBuffer(r,0,u,0,a),e.queue.submit([t.finish()]),await u.mapAsync(O.READ);let n=u.getMappedRange().slice(0);return u.unmap(),u.destroy(),n}async function X(e,r){let a=or(r);if(a)return C(`invalid clip state: ${a}`),null;let u=r.width*r.height*13>>3;if(e.length<u)return C(`essence ${e.length} B < ${u} B required for ${r.width}x${r.height}`),null;let t=await F();if(!t)return null;let n=sr(t,r.width,r.height);if(n)return C(n),null;let i=await ur(t),o=S.get(r);o&&o.device!==t&&(S.delete(r),o=void 0),o||(o=j(t,i,r,u),S.set(r,o)),o.packedCapacity<(Math.ceil(u/4)+1)*4&&(cr(o),S.delete(r),o=j(t,i,r,u),S.set(r,o));let s=e.subarray(e.length-u),c=new Uint8Array(o.packedCapacity);return c.set(s),t.queue.writeBuffer(o.packed,0,c),{device:t,lane:i,res:o}}function L(e,r,a){let u=e.length,t=new Uint16Array(u*3);for(let n=0;n<u;n++)t[3*n]=e[n],t[3*n+1]=r[n],t[3*n+2]=a[n];return t}function Q(e){for(let r of e)for(let a=0;a<r.length;a++)if(r[a]!==0)return!1;return!0}async function rr(e,r,a){let u=await X(e,r);if(!u)return null;let{device:t,lane:n,res:i}=u,o=i.w*i.h,s=a?N.slice(0,6):N;if(J(t,n,i,s),a){let[m,f,h]=await Promise.all([d(t,i.r0,o*4),d(t,i.g0,o*4),d(t,i.b0,o*4)]).then(y=>y.map(v=>new Uint32Array(v)));return Q([m,f,h])?(C("codes output came back all-zero (killed dispatch?)"),null):{width:i.w,height:i.h,codes:L(m,f,h)}}let[c,l,w]=await Promise.all([d(t,i.r1,o*4),d(t,i.green,o*4),d(t,i.b1,o*4)]).then(m=>m.map(f=>new Float32Array(f)));return Q([c,l,w])?(C("frame output came back all-zero (killed dispatch?)"),null):{width:i.w,height:i.h,r:c,g:l,b:w}}function E(e){let r=V.then(e,e).catch(a=>(C("GPU decode failed",a),null));return V=r,r}function Cr(e,r){return E(()=>rr(e,r,!1))}function Rr(e,r){return E(()=>rr(e,r,!0))}function Sr(e,r){return E(async()=>{let a=await X(e,r);if(!a)return null;let{device:u,lane:t,res:n}=a,i=n.w*n.h,o=p=>J(u,t,n,[p]),s=async(p,b)=>new Uint32Array(await d(u,p,b*4));o("unpack13");let c=Uint16Array.from(await s(n.mosaic,i));o("prep");let l=Uint16Array.from(await s(n.prepped,i));o("green");let w=new Int32Array(await d(u,n.green,(n.w+2)*(n.h+2)*4));o("fill");let m=L(await s(n.r0,i),await s(n.g0,i),await s(n.b0,i));o("refineH");let f=L(await s(n.r1,i),await s(n.g0,i),await s(n.b1,i));o("refineV");let h=L(await s(n.r0,i),await s(n.g0,i),await s(n.b0,i));o("color");let[y,v,A]=await Promise.all([d(u,n.r1,i*4),d(u,n.green,i*4),d(u,n.b1,i*4)]).then(p=>p.map(b=>new Float32Array(b)));return{unpacked:c,prepped:l,green:w,fill:m,refineH:f,codes:h,final:{width:n.w,height:n.h,r:y,g:v,b:A}}})}export{kr as arrirawGpuAvailable,Rr as decodeArrirawCodesGpu,Cr as decodeArrirawFrameGpu,Sr as decodeArrirawFrameGpuStaged};
|
|
Binary file
|
|
@@ -0,0 +1,3 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
import { createRequire as __conformRequire } from 'node:module'; const require = __conformRequire(import.meta.url);
|
|
3
|
+
import{c as m,d as w}from"./chunk-P7OVDUA5.js";import{i as b}from"./chunk-YPRTUS5W.js";import{G as g,S as _}from"./chunk-C2ESM27Z.js";var f={prproj:"prproj","resolve-drt":"drt",aaf:"aaf",avb:"avb",otio:"otio","flame-archive":"flame","resolve-fcpxml":"fcpxml","fcp-xml":"xmeml","premiere-xml":"xmeml","resolve-xml":"xmeml"};function S(e){return e in f}var p=null;function l(){return p||(p=E()),p}async function E(){let e=await import("./timeline_core-VK2ZWPCO.js"),r=(await import("./timeline_core_bg-QEOVAIWP.js")).default;return await e.default({module_or_path:r}),e}async function A(e,r){let o=f[r];if(!o)throw new Error(`timelineInspect: no Rust engine for format '${r}'`);let t=await l(),i=e.name.replace(/\.[^.]+$/,""),n=(R,...M)=>t[R](...M),s;switch(o){case"prproj":s=n("inspect_prproj_json",await a(e));break;case"aaf":s=n("inspect_aaf_json",await a(e));break;case"avb":s=n("inspect_avb_json",await a(e));break;case"flame":s=n("inspect_flame_json",await a(e),i);break;case"drt":s=n("inspect_drt_json",await y(e));break;case"otio":s=n("inspect_otio_json",await e.text(),i);break;case"fcpxml":s=n("inspect_fcpxml_json",await e.text(),i);break;case"xmeml":s=n("inspect_xmeml_json",await e.text(),i);break}return I(s)}var x=12*1024*1024,d=!1;function j(e){d=e}var h=null,k=8e3;async function F(){!h||d||await Promise.race([h,new Promise(e=>setTimeout(e,k))])}function c(e,r,o){if(d||e.length<=x)return e;let t=(e.length/1048576).toFixed(0),i=o?.length??0;throw i===1?new Error(`This ${r.toUpperCase()} timeline extracts to ${t} MB, past what our conversion server can hold in one pass (the ceiling is ours, not your file \u2014 a single long timeline can exceed it on its own). Get in touch and we will convert it for you while we lift the limit.`):new Error(`This ${r.toUpperCase()} selection${i?` (${i} sequences)`:""} extracts to ${t} MB, past what our conversion server can hold in one pass. Convert a few sequences at a time \u2014 one long timeline is usually about ${(x/1048576).toFixed(0)} MB. If a single timeline still will not go through, get in touch and we will convert it for you.`)}async function T(e,r,o){let t=f[r];if(!t)throw new Error(`timelineExtract: no Rust engine for format '${r}'`);switch(await F(),t){case"otio":case"fcpxml":case"xmeml":return{fmt:t,extract:await e.text()};case"drt":{let n=(await l()).extract_drt_json(await y(e));return{fmt:t,extract:c(n,t,o)}}case"prproj":{let i=await l(),n=JSON.stringify(o??[]),s=i.extract_prproj_json(await a(e),n);return{fmt:t,extract:c(s,t,o)}}case"avb":{let i=await l(),n=JSON.stringify(o??[]),s=i.extract_avb_json(await a(e),n);return{fmt:t,extract:c(s,t,o)}}case"aaf":case"flame":{let n=(await l())[`extract_${t}_json`](await a(e));return{fmt:t,extract:c(n,t,o)}}}}async function a(e){return new Uint8Array(await e.arrayBuffer())}async function y(e){let r=_(await a(e)),o={};for(let[t,i]of Object.entries(r))t.toLowerCase().endsWith(".xml")&&(o[t]=g(i));return JSON.stringify(o)}function I(e){let r=JSON.parse(e),o=Array.isArray(r)?r:r?.timelines??r?.sequences??[],t=o.filter(n=>typeof n=="object"&&n!==null),i=o.map(n=>{if(typeof n=="string")return n;let s=n;return s?.name??s?.title??s?.id??""}).filter(n=>!!n);return{names:Array.from(new Set(i)),timelines:t}}var P=/^(.+)_(\d{3})\.R3D$/i;function u(e){let o=(e.split(/[/\\]/).pop()??e).match(P);return o?{clipBase:o[1],partNumber:parseInt(o[2],10)}:null}function C(e){return u(e)!==null}function U(e,r){let o=u(e);if(!o)return[];let t=[];for(let i of r){let n=u(i);n&&n.clipBase===o.clipBase&&t.push({name:i,n:n.partNumber})}return t.sort((i,n)=>i.n-n.n),t.map(i=>i.name)}async function L(e){if(!m(e.name))return null;try{return await b(w(e),{verb:"inspect"})}catch(r){return console.warn(`[probeMedia] ${e.name} probe failed:`,r),null}}var z={reelName:!1,fileName:!0,fileNameMode:"loose",fileExtensions:"",totalDuration:!1,resolution:!1,bitDepth:!1,fileFormat:!1,codec:!1,mediaUmid:!1};var Y="X-Write-Issues";function Q(e){if(!e)return[];try{let r=JSON.parse(decodeURIComponent(e));return Array.isArray(r)?r:[]}catch{return[]}}export{u as a,C as b,U as c,z as d,S as e,A as f,j as g,T as h,Y as i,Q as j,L as k};
|