imagescript 3.3.0 → 3.4.0

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.
Files changed (59) hide show
  1. package/README.md +28 -8
  2. package/THIRD_PARTY_NOTICES.md +167 -2
  3. package/dist/animation.d.ts +18 -8
  4. package/dist/animation.js +23 -2
  5. package/dist/codecs/av1/cdef.js +197 -0
  6. package/dist/codecs/av1/data.js +141 -0
  7. package/dist/codecs/av1/decode.js +1769 -0
  8. package/dist/codecs/av1/filmgrain.js +219 -0
  9. package/dist/codecs/av1/frame.js +114 -0
  10. package/dist/codecs/av1/ipred.js +491 -0
  11. package/dist/codecs/av1/itx.js +950 -0
  12. package/dist/codecs/av1/loopfilter.js +149 -0
  13. package/dist/codecs/av1/msac.js +161 -0
  14. package/dist/codecs/av1/obu.js +516 -0
  15. package/dist/codecs/av1/postfilter.js +28 -0
  16. package/dist/codecs/av1/restoration.js +193 -0
  17. package/dist/codecs/av1/tables.js +160 -0
  18. package/dist/codecs/avif.js +581 -0
  19. package/dist/codecs/bmp.js +317 -0
  20. package/dist/codecs/hdr.d.ts +25 -0
  21. package/dist/codecs/hdr.js +201 -0
  22. package/dist/codecs/ico.js +48 -0
  23. package/dist/codecs/jpeg.js +2 -1
  24. package/dist/codecs/jxl/bits.js +126 -0
  25. package/dist/codecs/jxl/blend.js +117 -0
  26. package/dist/codecs/jxl/color.js +116 -0
  27. package/dist/codecs/jxl/dct.js +404 -0
  28. package/dist/codecs/jxl/entropy.js +556 -0
  29. package/dist/codecs/jxl/features.js +325 -0
  30. package/dist/codecs/jxl/filters.js +119 -0
  31. package/dist/codecs/jxl/frame-header.js +195 -0
  32. package/dist/codecs/jxl/frame.js +319 -0
  33. package/dist/codecs/jxl/headers.js +249 -0
  34. package/dist/codecs/jxl/idct.js +484 -0
  35. package/dist/codecs/jxl/modular.js +688 -0
  36. package/dist/codecs/jxl/quant.js +219 -0
  37. package/dist/codecs/jxl/upsample.js +52 -0
  38. package/dist/codecs/jxl/vardct.js +472 -0
  39. package/dist/codecs/jxl.js +89 -0
  40. package/dist/codecs/netpbm.js +239 -0
  41. package/dist/codecs/qoi.js +150 -0
  42. package/dist/codecs/vp8-enc-dsp.js +932 -0
  43. package/dist/codecs/vp8-enc-tables.js +78 -0
  44. package/dist/codecs/vp8-enc.js +1930 -0
  45. package/dist/codecs/webp.js +36 -2
  46. package/dist/image-type.d.ts +15 -1
  47. package/dist/image-type.js +45 -2
  48. package/dist/image.d.ts +47 -6
  49. package/dist/image.js +49 -3
  50. package/dist/index.d.ts +3 -2
  51. package/dist/index.js +2 -2
  52. package/dist/render/hinting.js +26 -18
  53. package/dist/render/layout.js +1 -1
  54. package/dist/render/svg.js +1 -1
  55. package/dist/render/unicode.js +1 -9
  56. package/dist/util/bytes.js +9 -0
  57. package/dist/util/resample.js +4 -2
  58. package/dist/version.js +1 -1
  59. package/package.json +25 -2
@@ -0,0 +1,1930 @@
1
+ /*!
2
+ * Lossy WebP (VP8) encoding, ported from libwebp's encoder (src/enc: analysis_enc.c, quant_enc.c, frame_enc.c,
3
+ * iterator_enc.c, cost_enc.c, token_enc.c, tree_enc.c, syntax_enc.c, filter_enc.c, alpha_enc.c; src/utils:
4
+ * bit_writer_utils.c, filters_utils.c) with its default settings and any method (effort: 0-2 decide modes by
5
+ * distortion, 3-6 by rate and distortion, 5-6 with trellis quantization), so the output is the same as cwebp's.
6
+ * Copyright (c) 2010 Google Inc., BSD-3-Clause License (see THIRD_PARTY_NOTICES.md)
7
+ */
8
+ import { BPS, Y_OFF, U_OFF, V_OFF, YUV_SIZE, PRED_SIZE, I16_MODE_OFFSETS, UV_MODE_OFFSETS, I4_MODE_OFFSETS, I4TMP, SCAN, SCAN_UV, newMatrix, predLuma16, predChroma8, predLuma4, fTransform, iTransform, fTransformWHT, iTransformWHT, sse4x4, sse16, predictionSSEs, tTransform, tDisto4x4, tDisto16x16, isFlat, isFlatSource16, quantizeBlock, histogramAlpha, mean16x4, ZIGZAG, MAX_LEVEL } from "./vp8-enc-dsp.js";
9
+ import { ENTROPY_COST, LEVEL_FIXED_COSTS, LEVEL_CODES, FIXED_COSTS_I4, BMODES_PROBA, AC_TABLE2, LEVELS_FROM_DELTA } from "./vp8-enc-tables.js";
10
+ import { DEFAULT_COEFF_PROBS, COEFF_UPDATE_PROBS, DC_QLOOKUP, AC_QLOOKUP } from "./vp8-tables.js";
11
+ import { base64 } from "../util/bytes.js";
12
+ import * as vp8l from "./vp8l.js";
13
+ const NUM_MB_SEGMENTS = 4, NUM_PROBAS = 11, NUM_CTX = 3, NUM_BANDS = 8, NUM_TYPES = 4;
14
+ const MAX_VARIABLE_LEVEL = 67;
15
+ const MAX_COST = 2 ** 55;
16
+ const RD_DISTO_MULT = 256;
17
+ const RD_OPT_NONE = 0, RD_OPT_BASIC = 1, RD_OPT_TRELLIS = 2, RD_OPT_TRELLIS_ALL = 3;
18
+ const WEIGHT_TRELLIS = [30, 27, 19, 11, 27, 24, 17, 10, 19, 17, 12, 8, 11, 10, 8, 6];
19
+ const BANDS = [0, 1, 2, 3, 6, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 0];
20
+ const FIXED_COSTS_UV = [302, 984, 439, 642], FIXED_COSTS_I16 = [663, 919, 872, 919];
21
+ const WEIGHT_Y = Int32Array.of(38, 32, 20, 9, 32, 28, 17, 7, 20, 17, 10, 4, 9, 7, 4, 2);
22
+ const BIAS_MATRICES = [[96, 110], [96, 108], [110, 115]];
23
+ const FREQ_SHARPENING = [0, 30, 60, 90, 30, 60, 90, 90, 60, 90, 90, 90, 90, 90, 90, 90];
24
+ const CAT3 = [173, 148, 140], CAT4 = [176, 155, 140, 135], CAT5 = [180, 157, 141, 134, 130];
25
+ const CAT6 = [254, 254, 243, 230, 196, 177, 153, 140, 133, 130, 129];
26
+ const SNS_STRENGTH = 50, FILTER_STRENGTH = 60, FILTER_SHARPNESS = 0, SEGMENTS = 4;
27
+ const MID_ALPHA = 64, MIN_ALPHA = 30, MAX_ALPHA = 100;
28
+ const MAX_DQ_UV = 6, MIN_DQ_UV = -4;
29
+ const FLATNESS_LIMIT_I16 = 0, FLATNESS_LIMIT_I4 = 3, FLATNESS_LIMIT_UV = 2, FLATNESS_PENALTY = 140;
30
+ const ERROR_DIFFUSION_QUALITY = 98;
31
+ const words = (text) => {
32
+ const b = base64(text), w = new Uint16Array(b.length >> 1);
33
+ for (let i = 0; i < w.length; i++)
34
+ w[i] = b[i * 2] | b[i * 2 + 1] << 8;
35
+ return w;
36
+ };
37
+ let levelFixedCosts = null, fixedCostsI4 = null;
38
+ const bitCost = (bit, p) => bit ? ENTROPY_COST[255 - p] : ENTROPY_COST[p];
39
+ const clip = (v, m, M) => v < m ? m : v > M ? M : v;
40
+ class BitWriter {
41
+ range = 254;
42
+ value = 0;
43
+ run = 0;
44
+ nbBits = -8;
45
+ pos = 0;
46
+ buf = new Uint8Array(1024);
47
+ flush() {
48
+ const s = 8 + this.nbBits;
49
+ const bits = this.value >> s;
50
+ this.value -= bits << s;
51
+ this.nbBits -= 8;
52
+ if ((bits & 0xff) !== 0xff) {
53
+ let pos = this.pos;
54
+ if (pos + this.run + 1 > this.buf.length) {
55
+ const bigger = new Uint8Array(Math.max(2 * this.buf.length, pos + this.run + 1));
56
+ bigger.set(this.buf);
57
+ this.buf = bigger;
58
+ }
59
+ if (bits & 0x100 && pos > 0)
60
+ this.buf[pos - 1]++;
61
+ for (; this.run > 0; this.run--)
62
+ this.buf[pos++] = bits & 0x100 ? 0 : 0xff;
63
+ this.buf[pos++] = bits & 0xff;
64
+ this.pos = pos;
65
+ }
66
+ else
67
+ this.run++;
68
+ }
69
+ putBit(bit, prob) {
70
+ const split = (this.range * prob) >> 8;
71
+ if (bit) {
72
+ this.value += split + 1;
73
+ this.range -= split + 1;
74
+ }
75
+ else
76
+ this.range = split;
77
+ if (this.range < 127) {
78
+ const shift = 7 - (31 - Math.clz32(this.range + 1));
79
+ this.range = ((this.range + 1) << shift) - 1;
80
+ this.value <<= shift;
81
+ this.nbBits += shift;
82
+ if (this.nbBits > 0)
83
+ this.flush();
84
+ }
85
+ return !!bit;
86
+ }
87
+ putBitUniform(bit) {
88
+ return this.putBit(bit, 128);
89
+ }
90
+ putBits(value, n) {
91
+ for (let mask = 1 << (n - 1); mask; mask >>>= 1)
92
+ this.putBitUniform(value & mask);
93
+ }
94
+ putSignedBits(value, n) {
95
+ if (!this.putBitUniform(value !== 0))
96
+ return;
97
+ this.putBits(value < 0 ? (-value << 1) | 1 : value << 1, n + 1);
98
+ }
99
+ finish() {
100
+ this.putBits(0, 9 - this.nbBits);
101
+ this.nbBits = 0;
102
+ this.flush();
103
+ return this.buf.subarray(0, this.pos);
104
+ }
105
+ }
106
+ const probaIndex = (t, b, c) => ((t * NUM_BANDS + b) * NUM_CTX + c) * NUM_PROBAS;
107
+ class Probas {
108
+ segments = new Uint8Array([255, 255, 255]);
109
+ skipProba = 255;
110
+ useSkipProba = false;
111
+ nbSkip = 0;
112
+ coeffs = Uint8Array.from(DEFAULT_COEFF_PROBS);
113
+ stats = new Uint32Array(NUM_TYPES * NUM_BANDS * NUM_CTX * NUM_PROBAS);
114
+ levelCost = new Uint16Array(NUM_TYPES * NUM_BANDS * NUM_CTX * (MAX_VARIABLE_LEVEL + 1));
115
+ remapped = new Int32Array(NUM_TYPES * 16 * NUM_CTX);
116
+ dirty = true;
117
+ calculateLevelCosts() {
118
+ if (!this.dirty)
119
+ return;
120
+ for (let t = 0; t < NUM_TYPES; t++) {
121
+ for (let b = 0; b < NUM_BANDS; b++) {
122
+ for (let c = 0; c < NUM_CTX; c++) {
123
+ const p = probaIndex(t, b, c), table = ((t * NUM_BANDS + b) * NUM_CTX + c) * (MAX_VARIABLE_LEVEL + 1);
124
+ const cost0 = c > 0 ? bitCost(1, this.coeffs[p]) : 0;
125
+ const costBase = bitCost(1, this.coeffs[p + 1]) + cost0;
126
+ this.levelCost[table] = bitCost(0, this.coeffs[p + 1]) + cost0;
127
+ for (let v = 1; v <= MAX_VARIABLE_LEVEL; v++) {
128
+ let pattern = LEVEL_CODES[(v - 1) * 2], bits = LEVEL_CODES[(v - 1) * 2 + 1], cost = 0;
129
+ for (let i = 2; pattern; i++, bits >>= 1, pattern >>= 1)
130
+ if (pattern & 1)
131
+ cost += bitCost(bits & 1, this.coeffs[p + i]);
132
+ this.levelCost[table + v] = costBase + cost;
133
+ }
134
+ }
135
+ }
136
+ for (let n = 0; n < 16; n++) {
137
+ for (let c = 0; c < NUM_CTX; c++)
138
+ this.remapped[(t * 16 + n) * NUM_CTX + c] = ((t * NUM_BANDS + BANDS[n]) * NUM_CTX + c) * (MAX_VARIABLE_LEVEL + 1);
139
+ }
140
+ }
141
+ this.dirty = false;
142
+ }
143
+ finalizeTokenProbas() {
144
+ let changed = false, size = 0;
145
+ for (let i = 0; i < this.coeffs.length; i++) {
146
+ const stats = this.stats[i];
147
+ const nb = stats & 0xffff, total = stats >>> 16;
148
+ const update = COEFF_UPDATE_PROBS[i], oldP = DEFAULT_COEFF_PROBS[i];
149
+ const newP = nb ? 255 - Math.trunc(nb * 255 / total) : 255;
150
+ const oldCost = branchCost(nb, total, oldP) + bitCost(0, update);
151
+ const newCost = branchCost(nb, total, newP) + bitCost(1, update) + 8 * 256;
152
+ const useNew = oldCost > newCost;
153
+ size += bitCost(useNew, update);
154
+ if (useNew) {
155
+ this.coeffs[i] = newP;
156
+ changed ||= newP !== oldP;
157
+ size += 8 * 256;
158
+ }
159
+ else
160
+ this.coeffs[i] = oldP;
161
+ }
162
+ this.dirty = changed;
163
+ return size;
164
+ }
165
+ }
166
+ const branchCost = (nb, total, p) => nb * bitCost(1, p) + (total - nb) * bitCost(0, p);
167
+ function recordStats(bit, stats, i) {
168
+ let p = stats[i];
169
+ if (p >= 0xfffe0000)
170
+ p = ((p + 1) >>> 1) & 0x7fff7fff;
171
+ stats[i] = p + 0x10000 + (bit ? 1 : 0);
172
+ return !!bit;
173
+ }
174
+ function setResidualCoeffs(res, coeffs, offset, nonZero = 1) {
175
+ res.last = -1;
176
+ for (let n = nonZero ? 15 : -1; n >= 0; n--) {
177
+ if (coeffs[offset + n]) {
178
+ res.last = n;
179
+ break;
180
+ }
181
+ }
182
+ res.coeffs = coeffs;
183
+ res.offset = offset;
184
+ }
185
+ const levelCost = (costs, table, level) => levelFixedCosts[level] + costs[table + (level > MAX_VARIABLE_LEVEL ? MAX_VARIABLE_LEVEL : level)];
186
+ function residualCost(probas, ctx0, res) {
187
+ let n = res.first;
188
+ const p0 = probas.coeffs[probaIndex(res.type, n, ctx0)];
189
+ const costs = probas.levelCost, remap = probas.remapped, base = res.type * 16;
190
+ let t = remap[(base + n) * NUM_CTX + ctx0];
191
+ let cost = ctx0 === 0 ? bitCost(1, p0) : 0;
192
+ if (res.last < 0)
193
+ return bitCost(0, p0);
194
+ for (; n < res.last; n++) {
195
+ const v = Math.abs(res.coeffs[res.offset + n]);
196
+ cost += levelCost(costs, t, v);
197
+ t = remap[(base + n + 1) * NUM_CTX + (v >= 2 ? 2 : v)];
198
+ }
199
+ const v = Math.abs(res.coeffs[res.offset + n]);
200
+ cost += levelCost(costs, t, v);
201
+ if (n < 15)
202
+ cost += bitCost(0, probas.coeffs[probaIndex(res.type, BANDS[n + 1], v === 1 ? 1 : 2)]);
203
+ return cost;
204
+ }
205
+ const FIXED_PROBA_BIT = 1 << 14;
206
+ class Tokens {
207
+ data = new Uint16Array(1 << 16);
208
+ length = 0;
209
+ add(bit, probaIndex, stats, statsIndex) {
210
+ this.push((bit ? 1 << 15 : 0) | probaIndex);
211
+ return recordStats(bit, stats, statsIndex);
212
+ }
213
+ addConstant(bit, proba) {
214
+ this.push((bit ? 1 << 15 : 0) | FIXED_PROBA_BIT | proba);
215
+ }
216
+ push(token) {
217
+ if (this.length === this.data.length) {
218
+ const bigger = new Uint16Array(this.data.length * 2);
219
+ bigger.set(this.data);
220
+ this.data = bigger;
221
+ }
222
+ this.data[this.length++] = token;
223
+ }
224
+ record(ctx, res, stats, cat56 = 9) {
225
+ const { coeffs, offset, type, last } = res;
226
+ let n = res.first;
227
+ let base = probaIndex(type, n, ctx);
228
+ if (!this.add(last >= 0, base, stats, base))
229
+ return false;
230
+ while (n < 16) {
231
+ const c = coeffs[offset + n++];
232
+ const sign = c < 0, v = sign ? -c : c;
233
+ if (!this.add(v !== 0, base + 1, stats, base + 1)) {
234
+ base = probaIndex(type, BANDS[n], 0);
235
+ continue;
236
+ }
237
+ if (!this.add(v > 1, base + 2, stats, base + 2))
238
+ base = probaIndex(type, BANDS[n], 1);
239
+ else {
240
+ if (!this.add(v > 4, base + 3, stats, base + 3)) {
241
+ if (this.add(v !== 2, base + 4, stats, base + 4))
242
+ this.add(v === 4, base + 5, stats, base + 5);
243
+ }
244
+ else if (!this.add(v > 10, base + 6, stats, base + 6)) {
245
+ if (!this.add(v > 6, base + 7, stats, base + 7))
246
+ this.addConstant(v === 6, 159);
247
+ else {
248
+ this.addConstant(v >= 9, 165);
249
+ this.addConstant(!(v & 1), 145);
250
+ }
251
+ }
252
+ else {
253
+ let mask, tab, residue = v - 3;
254
+ if (residue < 8 << 1) {
255
+ this.add(0, base + 8, stats, base + 8);
256
+ this.add(0, base + 9, stats, base + 9);
257
+ residue -= 8;
258
+ mask = 1 << 2;
259
+ tab = CAT3;
260
+ }
261
+ else if (residue < 8 << 2) {
262
+ this.add(0, base + 8, stats, base + 8);
263
+ this.add(1, base + 9, stats, base + 9);
264
+ residue -= 8 << 1;
265
+ mask = 1 << 3;
266
+ tab = CAT4;
267
+ }
268
+ else if (residue < 8 << 3) {
269
+ this.add(1, base + 8, stats, base + 8);
270
+ this.add(0, base + 10, stats, base + cat56);
271
+ residue -= 8 << 2;
272
+ mask = 1 << 4;
273
+ tab = CAT5;
274
+ }
275
+ else {
276
+ this.add(1, base + 8, stats, base + 8);
277
+ this.add(1, base + 10, stats, base + cat56);
278
+ residue -= 8 << 3;
279
+ mask = 1 << 10;
280
+ tab = CAT6;
281
+ }
282
+ for (let k = 0; mask; mask >>= 1, k++)
283
+ this.addConstant(residue & mask, tab[k]);
284
+ }
285
+ base = probaIndex(type, BANDS[n], 2);
286
+ }
287
+ this.addConstant(sign, 128);
288
+ if (n === 16 || !this.add(n <= last, base, stats, base))
289
+ return true;
290
+ }
291
+ return true;
292
+ }
293
+ emit(bw, probas, start = 0, end = this.length) {
294
+ for (let i = start; i < end; i++) {
295
+ const token = this.data[i];
296
+ bw.putBit(token >> 15 & 1, token & FIXED_PROBA_BIT ? token & 0xff : probas[token & 0x3fff]);
297
+ }
298
+ }
299
+ }
300
+ const newSegment = () => ({
301
+ y1: newMatrix(), y2: newMatrix(), uv: newMatrix(), alpha: 0, beta: 0, quant: 0, fstrength: 0, maxEdge: 0, minDisto: 0,
302
+ lambdaI16: 0, lambdaI4: 0, lambdaUv: 0, lambdaMode: 0, tlambda: 0, lambdaTrellisI16: 0, lambdaTrellisI4: 0, i4Penalty: 0
303
+ });
304
+ function copySegment(dst, src) {
305
+ for (const key of ['y1', 'y2', 'uv']) {
306
+ for (const field of ['q', 'iq', 'bias', 'zthresh', 'sharpen'])
307
+ dst[key][field].set(src[key][field]);
308
+ }
309
+ dst.alpha = src.alpha;
310
+ dst.beta = src.beta;
311
+ dst.quant = src.quant;
312
+ dst.fstrength = src.fstrength;
313
+ dst.maxEdge = src.maxEdge;
314
+ dst.minDisto = src.minDisto;
315
+ dst.lambdaI16 = src.lambdaI16;
316
+ dst.lambdaI4 = src.lambdaI4;
317
+ dst.lambdaUv = src.lambdaUv;
318
+ dst.lambdaMode = src.lambdaMode;
319
+ dst.tlambda = src.tlambda;
320
+ dst.lambdaTrellisI16 = src.lambdaTrellisI16;
321
+ dst.lambdaTrellisI4 = src.lambdaTrellisI4;
322
+ dst.i4Penalty = src.i4Penalty;
323
+ }
324
+ class ModeScore {
325
+ D = 0;
326
+ SD = 0;
327
+ H = 0;
328
+ R = 0;
329
+ score = MAX_COST;
330
+ yDcLevels = new Int16Array(16);
331
+ yAcLevels = new Int16Array(16 * 16);
332
+ uvLevels = new Int16Array(8 * 16);
333
+ modeI16 = 0;
334
+ modesI4 = new Uint8Array(16);
335
+ modeUv = 0;
336
+ nz = 0;
337
+ derr = new Int8Array(6);
338
+ init() {
339
+ this.D = this.SD = this.H = this.R = this.nz = 0;
340
+ this.score = MAX_COST;
341
+ }
342
+ copyScore(src) {
343
+ this.D = src.D;
344
+ this.SD = src.SD;
345
+ this.H = src.H;
346
+ this.R = src.R;
347
+ this.nz = src.nz;
348
+ this.score = src.score;
349
+ }
350
+ addScore(src) {
351
+ this.D += src.D;
352
+ this.SD += src.SD;
353
+ this.H += src.H;
354
+ this.R += src.R;
355
+ this.nz |= src.nz;
356
+ this.score += src.score;
357
+ }
358
+ copyAll(src) {
359
+ this.copyScore(src);
360
+ this.yDcLevels.set(src.yDcLevels);
361
+ this.yAcLevels.set(src.yAcLevels);
362
+ this.uvLevels.set(src.uvLevels);
363
+ this.modeI16 = src.modeI16;
364
+ this.modesI4.set(src.modesI4);
365
+ this.modeUv = src.modeUv;
366
+ this.derr.set(src.derr);
367
+ }
368
+ setRDScore(lambda) {
369
+ this.score = (this.R + this.H) * lambda + RD_DISTO_MULT * (this.D + this.SD);
370
+ }
371
+ }
372
+ class Encoder {
373
+ pic;
374
+ quality;
375
+ method;
376
+ mbW;
377
+ mbH;
378
+ predsW;
379
+ mbType;
380
+ mbUvMode;
381
+ mbSkip;
382
+ mbSegment;
383
+ mbAlpha;
384
+ preds;
385
+ nz;
386
+ yTop;
387
+ uvTop;
388
+ topDerr;
389
+ dqm = Array.from({ length: NUM_MB_SEGMENTS }, newSegment);
390
+ proba = new Probas();
391
+ tokens = new Tokens();
392
+ parts = new BitWriter();
393
+ numSegments = SEGMENTS;
394
+ updateMap = true;
395
+ segmentSize = 0;
396
+ filterSimple = true;
397
+ filterLevel = 0;
398
+ filterSharpness = 0;
399
+ baseQuant = 0;
400
+ alpha = 0;
401
+ uvAlpha = 0;
402
+ dqUvDc = 0;
403
+ dqUvAc = 0;
404
+ maxI4HeaderBits;
405
+ mbHeaderLimit;
406
+ rdOpt;
407
+ constructor(pic, quality, method) {
408
+ this.pic = pic;
409
+ this.quality = quality;
410
+ this.method = method;
411
+ this.mbW = (pic.width + 15) >> 4;
412
+ this.mbH = (pic.height + 15) >> 4;
413
+ this.predsW = 4 * this.mbW + 1;
414
+ const count = this.mbW * this.mbH;
415
+ this.mbType = new Uint8Array(count).fill(1);
416
+ this.mbUvMode = new Uint8Array(count);
417
+ this.mbSkip = new Uint8Array(count);
418
+ this.mbSegment = new Uint8Array(count);
419
+ this.mbAlpha = new Uint8Array(count);
420
+ this.preds = new Uint8Array(this.predsW * (4 * this.mbH + 1));
421
+ this.nz = new Uint32Array(this.mbW + 1);
422
+ this.yTop = new Uint8Array(this.mbW * 16);
423
+ this.uvTop = new Uint8Array(this.mbW * 16);
424
+ this.topDerr = quality <= ERROR_DIFFUSION_QUALITY ? new Int8Array(this.mbW * 4) : null;
425
+ this.maxI4HeaderBits = 256 * 16 * 16;
426
+ this.mbHeaderLimit = Math.trunc(256 * 510 * 8 * 1024 / count);
427
+ this.rdOpt = method >= 6 ? RD_OPT_TRELLIS_ALL : method >= 5 ? RD_OPT_TRELLIS : method >= 3 ? RD_OPT_BASIC : RD_OPT_NONE;
428
+ }
429
+ }
430
+ class Iterator {
431
+ enc;
432
+ x = 0;
433
+ y = 0;
434
+ yuvIn = new Uint8Array(YUV_SIZE);
435
+ inWords = new Uint32Array(this.yuvIn.buffer);
436
+ yWords = null;
437
+ uWords = null;
438
+ vWords = null;
439
+ yuvOut = new Uint8Array(YUV_SIZE);
440
+ yuvOut2 = new Uint8Array(YUV_SIZE);
441
+ yuvP = new Uint8Array(PRED_SIZE);
442
+ mb = 0;
443
+ preds = 0;
444
+ nzIndex = 1;
445
+ yLeft = new Uint8Array(17);
446
+ uLeft = new Uint8Array(9);
447
+ vLeft = new Uint8Array(9);
448
+ yTop;
449
+ yTopOffset = 0;
450
+ uvTop;
451
+ uvTopOffset = 0;
452
+ tmp32 = new Uint8Array(32);
453
+ i4 = 0;
454
+ i4Boundary = new Uint8Array(37);
455
+ i4Top = 0;
456
+ topNz = new Int32Array(9);
457
+ leftNz = new Int32Array(9);
458
+ leftDerr = new Int8Array(4);
459
+ countDown = 0;
460
+ doTrellis = false;
461
+ constructor(enc) {
462
+ this.enc = enc;
463
+ const pic = enc.pic, words = (plane) => new Uint32Array(plane.buffer, plane.byteOffset, plane.length >> 2);
464
+ if (pic.width % 4 === 0 && pic.y.byteOffset % 4 === 0)
465
+ this.yWords = words(pic.y);
466
+ if (pic.uvStride % 4 === 0 && pic.u.byteOffset % 4 === 0 && pic.v.byteOffset % 4 === 0) {
467
+ this.uWords = words(pic.u);
468
+ this.vWords = words(pic.v);
469
+ }
470
+ this.yTop = enc.yTop;
471
+ this.uvTop = enc.uvTop;
472
+ this.setRow(0);
473
+ this.countDown = enc.mbW * enc.mbH;
474
+ enc.yTop.fill(127);
475
+ enc.uvTop.fill(127);
476
+ enc.nz.fill(0);
477
+ enc.topDerr?.fill(0);
478
+ }
479
+ initLeft() {
480
+ this.yLeft[0] = this.uLeft[0] = this.vLeft[0] = this.y > 0 ? 129 : 127;
481
+ this.yLeft.fill(129, 1);
482
+ this.uLeft.fill(129, 1);
483
+ this.vLeft.fill(129, 1);
484
+ this.leftNz[8] = 0;
485
+ this.leftDerr.fill(0);
486
+ }
487
+ setRow(y) {
488
+ const enc = this.enc;
489
+ this.x = 0;
490
+ this.y = y;
491
+ this.preds = enc.predsW + 1 + y * 4 * enc.predsW;
492
+ this.nzIndex = 1;
493
+ this.mb = y * enc.mbW;
494
+ this.yTop = enc.yTop;
495
+ this.yTopOffset = 0;
496
+ this.uvTop = enc.uvTop;
497
+ this.uvTopOffset = 0;
498
+ this.initLeft();
499
+ }
500
+ next() {
501
+ if (++this.x === this.enc.mbW)
502
+ this.setRow(++this.y);
503
+ else {
504
+ this.preds += 4;
505
+ this.mb++;
506
+ this.nzIndex++;
507
+ this.yTopOffset += 16;
508
+ this.uvTopOffset += 16;
509
+ }
510
+ return --this.countDown > 0;
511
+ }
512
+ import(boundary) {
513
+ const { x, y } = this;
514
+ const pic = this.enc.pic, stride = pic.width, uvStride = pic.uvStride;
515
+ const ys = y * 16 * stride + x * 16, us = y * 8 * uvStride + x * 8;
516
+ const w = Math.min(pic.width - x * 16, 16), h = Math.min(pic.height - y * 16, 16);
517
+ const uvW = (w + 1) >> 1, uvH = (h + 1) >> 1;
518
+ if (this.yWords && w === 16 && h === 16)
519
+ copyWords(this.yWords, ys >> 2, stride >> 2, this.inWords, Y_OFF >> 2, 16, 4);
520
+ else
521
+ importBlock(pic.y, ys, stride, this.yuvIn, Y_OFF, w, h, 16);
522
+ if (this.uWords && this.vWords && uvW === 8 && uvH === 8) {
523
+ copyWords(this.uWords, us >> 2, uvStride >> 2, this.inWords, U_OFF >> 2, 8, 2);
524
+ copyWords(this.vWords, us >> 2, uvStride >> 2, this.inWords, V_OFF >> 2, 8, 2);
525
+ }
526
+ else {
527
+ importBlock(pic.u, us, uvStride, this.yuvIn, U_OFF, uvW, uvH, 8);
528
+ importBlock(pic.v, us, uvStride, this.yuvIn, V_OFF, uvW, uvH, 8);
529
+ }
530
+ if (!boundary)
531
+ return;
532
+ if (x === 0)
533
+ this.initLeft();
534
+ else {
535
+ if (y === 0)
536
+ this.yLeft[0] = this.uLeft[0] = this.vLeft[0] = 127;
537
+ else {
538
+ this.yLeft[0] = pic.y[ys - 1 - stride];
539
+ this.uLeft[0] = pic.u[us - 1 - uvStride];
540
+ this.vLeft[0] = pic.v[us - 1 - uvStride];
541
+ }
542
+ importLine(pic.y, ys - 1, stride, this.yLeft, 1, h, 16);
543
+ importLine(pic.u, us - 1, uvStride, this.uLeft, 1, uvH, 8);
544
+ importLine(pic.v, us - 1, uvStride, this.vLeft, 1, uvH, 8);
545
+ }
546
+ const tmp = this.tmp32;
547
+ this.yTop = this.uvTop = tmp;
548
+ this.yTopOffset = 0;
549
+ this.uvTopOffset = 16;
550
+ if (y === 0)
551
+ tmp.fill(127);
552
+ else {
553
+ importLine(pic.y, ys - stride, 1, tmp, 0, w, 16);
554
+ importLine(pic.u, us - uvStride, 1, tmp, 16, uvW, 8);
555
+ importLine(pic.v, us - uvStride, 1, tmp, 24, uvW, 8);
556
+ }
557
+ }
558
+ nzToBytes() {
559
+ const tnz = this.enc.nz[this.nzIndex], lnz = this.enc.nz[this.nzIndex - 1];
560
+ const bit = (nz, n) => nz >>> n & 1;
561
+ const t = this.topNz, l = this.leftNz;
562
+ t[0] = bit(tnz, 12);
563
+ t[1] = bit(tnz, 13);
564
+ t[2] = bit(tnz, 14);
565
+ t[3] = bit(tnz, 15);
566
+ t[4] = bit(tnz, 18);
567
+ t[5] = bit(tnz, 19);
568
+ t[6] = bit(tnz, 22);
569
+ t[7] = bit(tnz, 23);
570
+ t[8] = bit(tnz, 24);
571
+ l[0] = bit(lnz, 3);
572
+ l[1] = bit(lnz, 7);
573
+ l[2] = bit(lnz, 11);
574
+ l[3] = bit(lnz, 15);
575
+ l[4] = bit(lnz, 17);
576
+ l[5] = bit(lnz, 19);
577
+ l[6] = bit(lnz, 21);
578
+ l[7] = bit(lnz, 23);
579
+ }
580
+ bytesToNz() {
581
+ const t = this.topNz, l = this.leftNz;
582
+ this.enc.nz[this.nzIndex] = (t[0] << 12 | t[1] << 13 | t[2] << 14 | t[3] << 15 | t[4] << 18 | t[5] << 19 | t[6] << 22 | t[7] << 23 |
583
+ t[8] << 24 | l[0] << 3 | l[1] << 7 | l[2] << 11 | l[4] << 17 | l[6] << 21) >>> 0;
584
+ }
585
+ saveBoundary() {
586
+ const enc = this.enc, out = this.yuvOut;
587
+ if (this.x < enc.mbW - 1) {
588
+ for (let i = 0; i < 16; i++)
589
+ this.yLeft[1 + i] = out[Y_OFF + 15 + i * BPS];
590
+ for (let i = 0; i < 8; i++) {
591
+ this.uLeft[1 + i] = out[U_OFF + 7 + i * BPS];
592
+ this.vLeft[1 + i] = out[U_OFF + 15 + i * BPS];
593
+ }
594
+ this.yLeft[0] = this.yTop[this.yTopOffset + 15];
595
+ this.uLeft[0] = this.uvTop[this.uvTopOffset + 7];
596
+ this.vLeft[0] = this.uvTop[this.uvTopOffset + 15];
597
+ }
598
+ if (this.y < enc.mbH - 1) {
599
+ for (let i = 0; i < 16; i++) {
600
+ this.yTop[this.yTopOffset + i] = out[Y_OFF + 15 * BPS + i];
601
+ this.uvTop[this.uvTopOffset + i] = out[U_OFF + 7 * BPS + i];
602
+ }
603
+ }
604
+ }
605
+ startI4() {
606
+ this.i4 = 0;
607
+ this.i4Top = TOP_LEFT_I4[0];
608
+ const b = this.i4Boundary;
609
+ for (let i = 0; i < 17; i++)
610
+ b[i] = this.yLeft[16 - i];
611
+ for (let i = 0; i < 16; i++)
612
+ b[17 + i] = this.yTop[this.yTopOffset + i];
613
+ for (let i = 16; i < 20; i++)
614
+ b[17 + i] = this.x < this.enc.mbW - 1 ? this.yTop[this.yTopOffset + i] : b[17 + 15];
615
+ this.nzToBytes();
616
+ }
617
+ rotateI4(out, o) {
618
+ const blk = o + SCAN[this.i4], b = this.i4Boundary, top = this.i4Top;
619
+ for (let i = 0; i <= 3; i++)
620
+ b[top - 4 + i] = out[blk + i + 3 * BPS];
621
+ if ((this.i4 & 3) !== 3)
622
+ for (let i = 0; i <= 2; i++)
623
+ b[top + i] = out[blk + 3 + (2 - i) * BPS];
624
+ else
625
+ for (let i = 0; i <= 3; i++)
626
+ b[top + i] = b[top + i + 4];
627
+ if (++this.i4 === 16)
628
+ return false;
629
+ this.i4Top = TOP_LEFT_I4[this.i4];
630
+ return true;
631
+ }
632
+ setIntra16Mode(mode) {
633
+ const p = this.enc.preds, w = this.enc.predsW;
634
+ for (let y = 0, o = this.preds; y < 4; y++, o += w)
635
+ p[o] = p[o + 1] = p[o + 2] = p[o + 3] = mode;
636
+ this.enc.mbType[this.mb] = 1;
637
+ }
638
+ setIntra4Mode(modes) {
639
+ const p = this.enc.preds, w = this.enc.predsW;
640
+ for (let y = 0, o = this.preds; y < 4; y++, o += w) {
641
+ p[o] = modes[y * 4];
642
+ p[o + 1] = modes[y * 4 + 1];
643
+ p[o + 2] = modes[y * 4 + 2];
644
+ p[o + 3] = modes[y * 4 + 3];
645
+ }
646
+ this.enc.mbType[this.mb] = 0;
647
+ }
648
+ swapOut() {
649
+ [this.yuvOut, this.yuvOut2] = [this.yuvOut2, this.yuvOut];
650
+ }
651
+ makeLuma16Preds(modes = 15) {
652
+ predLuma16(this.yuvP, this.x ? this.yLeft : null, 1, this.y ? this.yTop : null, this.yTopOffset, modes);
653
+ }
654
+ makeChroma8Preds(modes = 15) {
655
+ predChroma8(this.yuvP, this.x ? this.uLeft : null, 1, this.x ? this.vLeft : null, 1, this.y ? this.uvTop : null, this.uvTopOffset, modes);
656
+ }
657
+ luma16SSEs(out) {
658
+ predictionSSEs(this.yuvIn, Y_OFF, 16, 1, this.x ? this.yLeft : null, null, 1, this.y ? this.yTop : null, this.yTopOffset, out);
659
+ }
660
+ chroma8SSEs(out) {
661
+ predictionSSEs(this.yuvIn, U_OFF, 8, 2, this.x ? this.uLeft : null, this.x ? this.vLeft : null, 1, this.y ? this.uvTop : null, this.uvTopOffset, out);
662
+ }
663
+ }
664
+ const TOP_LEFT_I4 = [17, 21, 25, 29, 13, 17, 21, 25, 9, 13, 17, 21, 5, 9, 13, 17];
665
+ function importBlock(src, s, stride, dst, d, w, h, size) {
666
+ if (w === size && h === size) {
667
+ if (size === 16) {
668
+ for (let i = 0; i < 16; i++, s += stride, d += BPS) {
669
+ dst[d] = src[s];
670
+ dst[d + 1] = src[s + 1];
671
+ dst[d + 2] = src[s + 2];
672
+ dst[d + 3] = src[s + 3];
673
+ dst[d + 4] = src[s + 4];
674
+ dst[d + 5] = src[s + 5];
675
+ dst[d + 6] = src[s + 6];
676
+ dst[d + 7] = src[s + 7];
677
+ dst[d + 8] = src[s + 8];
678
+ dst[d + 9] = src[s + 9];
679
+ dst[d + 10] = src[s + 10];
680
+ dst[d + 11] = src[s + 11];
681
+ dst[d + 12] = src[s + 12];
682
+ dst[d + 13] = src[s + 13];
683
+ dst[d + 14] = src[s + 14];
684
+ dst[d + 15] = src[s + 15];
685
+ }
686
+ }
687
+ else {
688
+ for (let i = 0; i < size; i++, s += stride, d += BPS) {
689
+ dst[d] = src[s];
690
+ dst[d + 1] = src[s + 1];
691
+ dst[d + 2] = src[s + 2];
692
+ dst[d + 3] = src[s + 3];
693
+ dst[d + 4] = src[s + 4];
694
+ dst[d + 5] = src[s + 5];
695
+ dst[d + 6] = src[s + 6];
696
+ dst[d + 7] = src[s + 7];
697
+ }
698
+ }
699
+ return;
700
+ }
701
+ for (let i = 0; i < h; i++, s += stride, d += BPS) {
702
+ for (let x = 0; x < w; x++)
703
+ dst[d + x] = src[s + x];
704
+ const last = dst[d + w - 1];
705
+ for (let x = w; x < size; x++)
706
+ dst[d + x] = last;
707
+ }
708
+ for (let i = h; i < size; i++, d += BPS)
709
+ for (let x = 0; x < size; x++)
710
+ dst[d + x] = dst[d - BPS + x];
711
+ }
712
+ function copyWords(src, s, stride, dst, d, rows, words) {
713
+ const step = BPS >> 2;
714
+ if (words === 4) {
715
+ for (let i = 0; i < rows; i++, s += stride, d += step) {
716
+ dst[d] = src[s];
717
+ dst[d + 1] = src[s + 1];
718
+ dst[d + 2] = src[s + 2];
719
+ dst[d + 3] = src[s + 3];
720
+ }
721
+ }
722
+ else {
723
+ for (let i = 0; i < rows; i++, s += stride, d += step) {
724
+ dst[d] = src[s];
725
+ dst[d + 1] = src[s + 1];
726
+ }
727
+ }
728
+ }
729
+ function importLine(src, s, step, dst, d, len, total) {
730
+ let i = 0;
731
+ for (; i < len; i++, s += step)
732
+ dst[d + i] = src[s];
733
+ for (; i < total; i++)
734
+ dst[d + i] = dst[d + len - 1];
735
+ }
736
+ const dcs = new Uint32Array(16), zeroModes = new Uint8Array(16);
737
+ function analyze(enc) {
738
+ const alphas = new Int32Array(256);
739
+ let alpha = 0, uvAlpha = 0;
740
+ const it = new Iterator(enc);
741
+ do {
742
+ it.import(true);
743
+ enc.mbType[it.mb] = 1;
744
+ it.setIntra16Mode(0);
745
+ enc.mbSkip[it.mb] = 0;
746
+ enc.mbSegment[it.mb] = 0;
747
+ let bestAlpha = -1;
748
+ if (enc.method <= 1) {
749
+ bestAlpha = 0;
750
+ const threshold = 8 + Math.trunc((17 - 8) * Math.trunc(enc.quality) / 100);
751
+ for (let k = 0; k < 16; k += 4)
752
+ mean16x4(it.yuvIn, Y_OFF + k * BPS, dcs, k);
753
+ let m = 0, m2 = 0;
754
+ for (let k = 0; k < 16; k++) {
755
+ m += dcs[k];
756
+ m2 += dcs[k] * dcs[k];
757
+ }
758
+ if (threshold * m2 < m * m)
759
+ it.setIntra16Mode(0);
760
+ else
761
+ it.setIntra4Mode(zeroModes);
762
+ }
763
+ else {
764
+ it.makeLuma16Preds(3);
765
+ let bestMode = 0;
766
+ for (let mode = 0; mode < 2; mode++) {
767
+ const a = histogramAlpha(it.yuvIn, Y_OFF, it.yuvP, I16_MODE_OFFSETS[mode], 0, 16);
768
+ if (a > bestAlpha) {
769
+ bestAlpha = a;
770
+ bestMode = mode;
771
+ }
772
+ }
773
+ it.setIntra16Mode(bestMode);
774
+ }
775
+ it.makeChroma8Preds(3);
776
+ let bestUvAlpha = -1, smallest = 0, bestUvMode = 0;
777
+ for (let mode = 0; mode < 2; mode++) {
778
+ const a = histogramAlpha(it.yuvIn, U_OFF, it.yuvP, UV_MODE_OFFSETS[mode], 16, 24);
779
+ if (a > bestUvAlpha)
780
+ bestUvAlpha = a;
781
+ if (mode === 0 || a < smallest) {
782
+ smallest = a;
783
+ bestUvMode = mode;
784
+ }
785
+ }
786
+ enc.mbUvMode[it.mb] = bestUvMode;
787
+ const mixed = clip(255 - ((3 * bestAlpha + bestUvAlpha + 2) >> 2), 0, 255);
788
+ alphas[mixed]++;
789
+ enc.mbAlpha[it.mb] = mixed;
790
+ alpha += mixed;
791
+ uvAlpha += bestUvAlpha;
792
+ } while (it.next());
793
+ const total = enc.mbW * enc.mbH;
794
+ enc.alpha = Math.trunc(alpha / total);
795
+ enc.uvAlpha = Math.trunc(uvAlpha / total);
796
+ assignSegments(enc, alphas);
797
+ }
798
+ function assignSegments(enc, alphas) {
799
+ const nb = Math.min(enc.numSegments, NUM_MB_SEGMENTS);
800
+ const centers = new Int32Array(NUM_MB_SEGMENTS), map = new Int32Array(256);
801
+ const accum = new Int32Array(NUM_MB_SEGMENTS), distAccum = new Int32Array(NUM_MB_SEGMENTS);
802
+ let minA = 0, maxA = 255;
803
+ while (minA <= 255 && alphas[minA] === 0)
804
+ minA++;
805
+ while (maxA > minA && alphas[maxA] === 0)
806
+ maxA--;
807
+ const range = maxA - minA;
808
+ for (let k = 0, n = 1; k < nb; k++, n += 2)
809
+ centers[k] = minA + Math.trunc(n * range / (2 * nb));
810
+ let weightedAverage = 0;
811
+ for (let k = 0; k < 6; k++) {
812
+ accum.fill(0);
813
+ distAccum.fill(0);
814
+ let n = 0;
815
+ for (let a = minA; a <= maxA; a++) {
816
+ if (alphas[a]) {
817
+ while (n + 1 < nb && Math.abs(a - centers[n + 1]) < Math.abs(a - centers[n]))
818
+ n++;
819
+ map[a] = n;
820
+ distAccum[n] += a * alphas[a];
821
+ accum[n] += alphas[a];
822
+ }
823
+ }
824
+ let displaced = 0, totalWeight = 0;
825
+ weightedAverage = 0;
826
+ for (let i = 0; i < nb; i++) {
827
+ if (accum[i]) {
828
+ const center = Math.trunc((distAccum[i] + Math.trunc(accum[i] / 2)) / accum[i]);
829
+ displaced += Math.abs(centers[i] - center);
830
+ centers[i] = center;
831
+ weightedAverage += center * accum[i];
832
+ totalWeight += accum[i];
833
+ }
834
+ }
835
+ weightedAverage = Math.trunc((weightedAverage + Math.trunc(totalWeight / 2)) / totalWeight);
836
+ if (displaced < 5)
837
+ break;
838
+ }
839
+ for (let i = 0; i < enc.mbW * enc.mbH; i++) {
840
+ const a = enc.mbAlpha[i];
841
+ enc.mbSegment[i] = map[a];
842
+ enc.mbAlpha[i] = centers[map[a]];
843
+ }
844
+ let min = centers[0], max = centers[0];
845
+ if (nb > 1) {
846
+ for (let n = 0; n < nb; n++) {
847
+ if (min > centers[n])
848
+ min = centers[n];
849
+ if (max < centers[n])
850
+ max = centers[n];
851
+ }
852
+ }
853
+ if (max === min)
854
+ max = min + 1;
855
+ for (let n = 0; n < nb; n++) {
856
+ enc.dqm[n].alpha = clip(Math.trunc(255 * (centers[n] - weightedAverage) / (max - min)), -127, 127);
857
+ enc.dqm[n].beta = clip(Math.trunc(255 * (centers[n] - min) / (max - min)), 0, 255);
858
+ }
859
+ }
860
+ function filterStrengthFromDelta(sharpness, delta) {
861
+ return LEVELS_FROM_DELTA[sharpness * 64 + (delta < 64 ? delta : 63)];
862
+ }
863
+ function expandMatrix(m, type) {
864
+ for (let i = 0; i < 2; i++) {
865
+ m.iq[i] = Math.trunc((1 << 17) / m.q[i]);
866
+ m.bias[i] = BIAS_MATRICES[type][i > 0 ? 1 : 0] << 9;
867
+ m.zthresh[i] = Math.trunc(((1 << 17) - 1 - m.bias[i]) / m.iq[i]);
868
+ }
869
+ for (let i = 2; i < 16; i++) {
870
+ m.q[i] = m.q[1];
871
+ m.iq[i] = m.iq[1];
872
+ m.bias[i] = m.bias[1];
873
+ m.zthresh[i] = m.zthresh[1];
874
+ }
875
+ let sum = 0;
876
+ for (let i = 0; i < 16; i++) {
877
+ m.sharpen[i] = type === 0 ? (FREQ_SHARPENING[i] * m.q[i]) >> 11 : 0;
878
+ sum += m.q[i];
879
+ }
880
+ return (sum + 8) >> 4;
881
+ }
882
+ function setupMatrices(enc) {
883
+ for (let i = 0; i < enc.numSegments; i++) {
884
+ const m = enc.dqm[i], q = m.quant;
885
+ m.y1.q[0] = DC_QLOOKUP[clip(q, 0, 127)];
886
+ m.y1.q[1] = AC_QLOOKUP[clip(q, 0, 127)];
887
+ m.y2.q[0] = DC_QLOOKUP[clip(q, 0, 127)] * 2;
888
+ m.y2.q[1] = AC_TABLE2[clip(q, 0, 127)];
889
+ m.uv.q[0] = DC_QLOOKUP[clip(q + enc.dqUvDc, 0, 117)];
890
+ m.uv.q[1] = AC_QLOOKUP[clip(q + enc.dqUvAc, 0, 127)];
891
+ const qI4 = expandMatrix(m.y1, 0), qI16 = expandMatrix(m.y2, 1), qUv = expandMatrix(m.uv, 2);
892
+ m.lambdaI4 = Math.max(1, (3 * qI4 * qI4) >> 7);
893
+ m.lambdaI16 = Math.max(1, 3 * qI16 * qI16);
894
+ m.lambdaUv = Math.max(1, (3 * qUv * qUv) >> 6);
895
+ m.lambdaMode = Math.max(1, (qI4 * qI4) >> 7);
896
+ m.tlambda = Math.max(1, ((enc.method >= 4 ? SNS_STRENGTH : 0) * qI4) >> 5);
897
+ m.lambdaTrellisI4 = Math.max(1, (7 * qI4 * qI4) >> 3);
898
+ m.lambdaTrellisI16 = Math.max(1, (qI16 * qI16) >> 2);
899
+ m.minDisto = 20 * m.y1.q[0];
900
+ m.maxEdge = 0;
901
+ m.i4Penalty = 1000 * qI4 * qI4;
902
+ }
903
+ }
904
+ function setSegmentParams(enc, quality) {
905
+ const amp = 0.9 * SNS_STRENGTH / 100 / 128;
906
+ const c = quality / 100;
907
+ const cBase = Math.pow(c < 0.75 ? c * (2 / 3) : 2 * c - 1, 1 / 3);
908
+ for (let i = 0; i < enc.numSegments; i++) {
909
+ const expn = 1 - amp * enc.dqm[i].alpha;
910
+ enc.dqm[i].quant = clip(Math.trunc(127 * (1 - Math.pow(cBase, expn))), 0, 127);
911
+ }
912
+ enc.baseQuant = enc.dqm[0].quant;
913
+ for (let i = enc.numSegments; i < NUM_MB_SEGMENTS; i++)
914
+ enc.dqm[i].quant = enc.baseQuant;
915
+ let dqUvAc = Math.trunc((enc.uvAlpha - MID_ALPHA) * (MAX_DQ_UV - MIN_DQ_UV) / (MAX_ALPHA - MIN_ALPHA));
916
+ dqUvAc = Math.trunc(dqUvAc * SNS_STRENGTH / 100);
917
+ enc.dqUvAc = clip(dqUvAc, MIN_DQ_UV, MAX_DQ_UV);
918
+ enc.dqUvDc = clip(Math.trunc(-4 * SNS_STRENGTH / 100), -15, 15);
919
+ const level0 = 5 * FILTER_STRENGTH;
920
+ for (let i = 0; i < NUM_MB_SEGMENTS; i++) {
921
+ const m = enc.dqm[i];
922
+ const qstep = AC_QLOOKUP[clip(m.quant, 0, 127)] >> 2;
923
+ const f = Math.trunc(filterStrengthFromDelta(enc.filterSharpness, qstep) * level0 / (256 + m.beta));
924
+ m.fstrength = f < 2 ? 0 : f > 63 ? 63 : f;
925
+ }
926
+ enc.filterLevel = enc.dqm[0].fstrength;
927
+ enc.filterSimple = false;
928
+ enc.filterSharpness = FILTER_SHARPNESS;
929
+ if (enc.numSegments > 1)
930
+ simplifySegments(enc);
931
+ setupMatrices(enc);
932
+ }
933
+ function simplifySegments(enc) {
934
+ const map = [0, 1, 2, 3];
935
+ const num = Math.min(enc.numSegments, NUM_MB_SEGMENTS);
936
+ let final = 1;
937
+ for (let s1 = 1; s1 < num; s1++) {
938
+ const S1 = enc.dqm[s1];
939
+ let s2 = 0, found = false;
940
+ for (; s2 < final; s2++) {
941
+ const S2 = enc.dqm[s2];
942
+ if (S1.quant === S2.quant && S1.fstrength === S2.fstrength) {
943
+ found = true;
944
+ break;
945
+ }
946
+ }
947
+ map[s1] = s2;
948
+ if (!found) {
949
+ if (final !== s1)
950
+ copySegment(enc.dqm[final], enc.dqm[s1]);
951
+ final++;
952
+ }
953
+ }
954
+ if (final < num) {
955
+ for (let i = 0; i < enc.mbW * enc.mbH; i++)
956
+ enc.mbSegment[i] = map[enc.mbSegment[i]];
957
+ enc.numSegments = final;
958
+ for (let i = final; i < num; i++)
959
+ copySegment(enc.dqm[i], enc.dqm[final - 1]);
960
+ }
961
+ }
962
+ function setSegmentProbas(enc) {
963
+ const p = [0, 0, 0, 0];
964
+ for (let i = 0; i < enc.mbW * enc.mbH; i++)
965
+ p[enc.mbSegment[i]]++;
966
+ if (enc.numSegments > 1) {
967
+ const getProba = (a, b) => a + b === 0 ? 255 : Math.trunc((255 * a + Math.trunc((a + b) / 2)) / (a + b));
968
+ const probas = enc.proba.segments;
969
+ probas[0] = getProba(p[0] + p[1], p[2] + p[3]);
970
+ probas[1] = getProba(p[0], p[1]);
971
+ probas[2] = getProba(p[2], p[3]);
972
+ enc.updateMap = probas[0] !== 255 || probas[1] !== 255 || probas[2] !== 255;
973
+ if (!enc.updateMap)
974
+ enc.mbSegment.fill(0);
975
+ enc.segmentSize = p[0] * (bitCost(0, probas[0]) + bitCost(0, probas[1])) + p[1] * (bitCost(0, probas[0]) + bitCost(1, probas[1])) +
976
+ p[2] * (bitCost(1, probas[0]) + bitCost(0, probas[2])) + p[3] * (bitCost(1, probas[0]) + bitCost(1, probas[2]));
977
+ }
978
+ else {
979
+ enc.updateMap = false;
980
+ enc.segmentSize = 0;
981
+ }
982
+ }
983
+ const tmpLevels = new Int16Array(16), tmp16 = new Int16Array(16 * 16), dcTmp = new Int16Array(16), tmpUv = new Int16Array(8 * 16);
984
+ const residual = { first: 0, last: -1, coeffs: tmpLevels, offset: 0, type: 0 };
985
+ function costLuma16(it, rd) {
986
+ const proba = it.enc.proba;
987
+ it.nzToBytes();
988
+ let R = 0;
989
+ residual.first = 0;
990
+ residual.type = 1;
991
+ setResidualCoeffs(residual, rd.yDcLevels, 0);
992
+ R += residualCost(proba, it.topNz[8] + it.leftNz[8], residual);
993
+ residual.first = 1;
994
+ residual.type = 0;
995
+ for (let y = 0; y < 4; y++) {
996
+ for (let x = 0; x < 4; x++) {
997
+ setResidualCoeffs(residual, rd.yAcLevels, (x + y * 4) * 16);
998
+ R += residualCost(proba, it.topNz[x] + it.leftNz[y], residual);
999
+ it.topNz[x] = it.leftNz[y] = residual.last >= 0 ? 1 : 0;
1000
+ }
1001
+ }
1002
+ return R;
1003
+ }
1004
+ function costLuma4(it, levels) {
1005
+ residual.first = 0;
1006
+ residual.type = 3;
1007
+ setResidualCoeffs(residual, levels, 0);
1008
+ return residualCost(it.enc.proba, it.topNz[it.i4 & 3] + it.leftNz[it.i4 >> 2], residual);
1009
+ }
1010
+ function costUv(it, rd) {
1011
+ it.nzToBytes();
1012
+ let R = 0;
1013
+ residual.first = 0;
1014
+ residual.type = 2;
1015
+ for (let ch = 0; ch <= 2; ch += 2) {
1016
+ for (let y = 0; y < 2; y++) {
1017
+ for (let x = 0; x < 2; x++) {
1018
+ setResidualCoeffs(residual, rd.uvLevels, (ch * 2 + x + y * 2) * 16);
1019
+ R += residualCost(it.enc.proba, it.topNz[4 + ch + x] + it.leftNz[4 + ch + y], residual);
1020
+ it.topNz[4 + ch + x] = it.leftNz[4 + ch + y] = residual.last >= 0 ? 1 : 0;
1021
+ }
1022
+ }
1023
+ }
1024
+ return R;
1025
+ }
1026
+ const TYPE_I16_AC = 0, TYPE_I4_AC = 3;
1027
+ const nodePrev = new Int8Array(32), nodeSign = new Uint8Array(32), nodeLevel = new Int16Array(32);
1028
+ const ssScore = new Float64Array(4), ssCosts = new Int32Array(4);
1029
+ function trellisQuantize(enc, input, i, out, o, ctx0, type, m, lambda) {
1030
+ const proba = enc.proba, costs = proba.levelCost, remap = proba.remapped, base = type * 16;
1031
+ const first = type === TYPE_I16_AC ? 1 : 0;
1032
+ const costsAt = (n, ctx) => remap[(base + Math.min(n, 15)) * NUM_CTX + ctx];
1033
+ let cur = 0, prev = 2;
1034
+ const best = [-1, -1, -1];
1035
+ let last = first - 1;
1036
+ const thresh = Math.trunc(m.q[1] * m.q[1] / 4);
1037
+ const lastProba = proba.coeffs[probaIndex(type, BANDS[first], ctx0)];
1038
+ for (let n = 15; n >= first; n--) {
1039
+ const j = ZIGZAG[n];
1040
+ if (input[i + j] * input[i + j] > thresh) {
1041
+ last = n;
1042
+ break;
1043
+ }
1044
+ }
1045
+ if (last < 15)
1046
+ last++;
1047
+ let bestScore = bitCost(0, lastProba) * lambda;
1048
+ for (let k = 0; k < 2; k++) {
1049
+ ssScore[cur + k] = (ctx0 === 0 ? bitCost(1, lastProba) : 0) * lambda;
1050
+ ssCosts[cur + k] = costsAt(first, ctx0);
1051
+ }
1052
+ for (let n = first; n <= last; n++) {
1053
+ const j = ZIGZAG[n];
1054
+ const Q = m.q[j], iQ = m.iq[j];
1055
+ const sign = input[i + j] < 0 ? 1 : 0;
1056
+ const coeff0 = (sign ? -input[i + j] : input[i + j]) + m.sharpen[j];
1057
+ let level0 = (coeff0 * iQ) >>> 17;
1058
+ let threshLevel = (coeff0 * iQ + (0x80 << 9)) >>> 17;
1059
+ if (threshLevel > MAX_LEVEL)
1060
+ threshLevel = MAX_LEVEL;
1061
+ if (level0 > MAX_LEVEL)
1062
+ level0 = MAX_LEVEL;
1063
+ [cur, prev] = [prev, cur];
1064
+ for (let k = 0; k < 2; k++) {
1065
+ const level = level0 + k;
1066
+ const ctx = level > 2 ? 2 : level;
1067
+ const band = BANDS[n + 1];
1068
+ ssCosts[cur + k] = costsAt(n + 1, ctx);
1069
+ if (level < 0 || level > threshLevel) {
1070
+ ssScore[cur + k] = MAX_COST;
1071
+ continue;
1072
+ }
1073
+ const newError = coeff0 - level * Q;
1074
+ const baseScore = RD_DISTO_MULT * WEIGHT_TRELLIS[j] * (newError * newError - coeff0 * coeff0);
1075
+ let bestCur = ssScore[prev] + levelCost(costs, ssCosts[prev], level) * lambda, bestPrev = 0;
1076
+ const score1 = ssScore[prev + 1] + levelCost(costs, ssCosts[prev + 1], level) * lambda;
1077
+ if (score1 < bestCur) {
1078
+ bestCur = score1;
1079
+ bestPrev = 1;
1080
+ }
1081
+ bestCur += baseScore;
1082
+ const node = n * 2 + k;
1083
+ nodeSign[node] = sign;
1084
+ nodeLevel[node] = level;
1085
+ nodePrev[node] = bestPrev;
1086
+ ssScore[cur + k] = bestCur;
1087
+ if (level !== 0 && bestCur < bestScore) {
1088
+ const score = bestCur + (n < 15 ? bitCost(0, proba.coeffs[probaIndex(type, band, ctx)]) : 0) * lambda;
1089
+ if (score < bestScore) {
1090
+ bestScore = score;
1091
+ best[0] = n;
1092
+ best[1] = k;
1093
+ best[2] = bestPrev;
1094
+ }
1095
+ }
1096
+ }
1097
+ }
1098
+ input.fill(0, i + first, i + 16);
1099
+ out.fill(0, o + first, o + 16);
1100
+ if (best[0] === -1)
1101
+ return 0;
1102
+ let nz = 0, node = best[1];
1103
+ nodePrev[best[0] * 2 + node] = best[2];
1104
+ for (let n = best[0]; n >= first; n--) {
1105
+ const index = n * 2 + node, j = ZIGZAG[n];
1106
+ out[o + n] = nodeSign[index] ? -nodeLevel[index] : nodeLevel[index];
1107
+ nz |= nodeLevel[index];
1108
+ input[i + j] = out[o + n] * m.q[j];
1109
+ node = nodePrev[index];
1110
+ }
1111
+ return nz !== 0 ? 1 : 0;
1112
+ }
1113
+ function reconstructIntra16(it, rd, out, o, mode) {
1114
+ const dqm = it.enc.dqm[it.enc.mbSegment[it.mb]];
1115
+ const ref = it.yuvP, r = I16_MODE_OFFSETS[mode], src = it.yuvIn;
1116
+ let nz = 0;
1117
+ for (let n = 0; n < 16; n++)
1118
+ fTransform(src, Y_OFF + SCAN[n], ref, r + SCAN[n], tmp16, n * 16);
1119
+ fTransformWHT(tmp16, dcTmp);
1120
+ nz |= (quantizeBlock(dcTmp, 0, rd.yDcLevels, 0, dqm.y2) ? 1 : 0) << 24;
1121
+ if (it.doTrellis) {
1122
+ it.nzToBytes();
1123
+ for (let y = 0, n = 0; y < 4; y++) {
1124
+ for (let x = 0; x < 4; x++, n++) {
1125
+ const nonZero = trellisQuantize(it.enc, tmp16, n * 16, rd.yAcLevels, n * 16, it.topNz[x] + it.leftNz[y], TYPE_I16_AC, dqm.y1, dqm.lambdaTrellisI16);
1126
+ it.topNz[x] = it.leftNz[y] = nonZero;
1127
+ rd.yAcLevels[n * 16] = 0;
1128
+ nz |= nonZero << n;
1129
+ }
1130
+ }
1131
+ }
1132
+ else {
1133
+ for (let n = 0; n < 16; n++) {
1134
+ tmp16[n * 16] = 0;
1135
+ nz |= (quantizeBlock(tmp16, n * 16, rd.yAcLevels, n * 16, dqm.y1) ? 1 : 0) << n;
1136
+ }
1137
+ }
1138
+ iTransformWHT(dcTmp, tmp16);
1139
+ for (let n = 0; n < 16; n += 2)
1140
+ iTransform(ref, r + SCAN[n], tmp16, n * 16, out, o + SCAN[n], true);
1141
+ return nz;
1142
+ }
1143
+ function reconstructIntra4(it, levels, lo, src, s, out, o, mode) {
1144
+ const dqm = it.enc.dqm[it.enc.mbSegment[it.mb]];
1145
+ const r = I4_MODE_OFFSETS[mode];
1146
+ fTransform(src, s, it.yuvP, r, tmpLevels, 0);
1147
+ const nz = it.doTrellis ? trellisQuantize(it.enc, tmpLevels, 0, levels, lo, it.topNz[it.i4 & 3] + it.leftNz[it.i4 >> 2], TYPE_I4_AC, dqm.y1, dqm.lambdaTrellisI4)
1148
+ : quantizeBlock(tmpLevels, 0, levels, lo, dqm.y1) ? 1 : 0;
1149
+ iTransform(it.yuvP, r, tmpLevels, 0, out, o, false);
1150
+ return nz;
1151
+ }
1152
+ function quantizeSingle(v, i, m) {
1153
+ let V = v[i];
1154
+ const sign = V < 0;
1155
+ if (sign)
1156
+ V = -V;
1157
+ if (V > m.zthresh[0]) {
1158
+ const qV = ((V * m.iq[0] + m.bias[0]) >>> 17) * m.q[0];
1159
+ const err = V - qV;
1160
+ v[i] = sign ? -qV : qV;
1161
+ return (sign ? -err : err) >> 1;
1162
+ }
1163
+ v[i] = 0;
1164
+ return (sign ? -V : V) >> 1;
1165
+ }
1166
+ function correctDcValues(it, m, tmp, rd) {
1167
+ const top = it.enc.topDerr, t = it.x * 4, left = it.leftDerr;
1168
+ for (let ch = 0; ch <= 1; ch++) {
1169
+ const c = ch * 4 * 16;
1170
+ tmp[c] += (7 * top[t + ch * 2] + 8 * left[ch * 2]) >> 3;
1171
+ const err0 = quantizeSingle(tmp, c, m);
1172
+ tmp[c + 16] += (7 * top[t + ch * 2 + 1] + 8 * err0) >> 3;
1173
+ const err1 = quantizeSingle(tmp, c + 16, m);
1174
+ tmp[c + 32] += (7 * err0 + 8 * left[ch * 2 + 1]) >> 3;
1175
+ const err2 = quantizeSingle(tmp, c + 32, m);
1176
+ tmp[c + 48] += (7 * err1 + 8 * err2) >> 3;
1177
+ const err3 = quantizeSingle(tmp, c + 48, m);
1178
+ rd.derr[ch * 3] = err1;
1179
+ rd.derr[ch * 3 + 1] = err2;
1180
+ rd.derr[ch * 3 + 2] = err3;
1181
+ }
1182
+ }
1183
+ function storeDiffusionErrors(it, rd) {
1184
+ const top = it.enc.topDerr, t = it.x * 4, left = it.leftDerr;
1185
+ for (let ch = 0; ch <= 1; ch++) {
1186
+ left[ch * 2] = rd.derr[ch * 3];
1187
+ left[ch * 2 + 1] = (3 * rd.derr[ch * 3 + 2]) >> 2;
1188
+ top[t + ch * 2] = rd.derr[ch * 3 + 1];
1189
+ top[t + ch * 2 + 1] = rd.derr[ch * 3 + 2] - left[ch * 2 + 1];
1190
+ }
1191
+ }
1192
+ function reconstructUv(it, rd, out, o, mode) {
1193
+ const dqm = it.enc.dqm[it.enc.mbSegment[it.mb]];
1194
+ const r = UV_MODE_OFFSETS[mode];
1195
+ let nz = 0;
1196
+ for (let n = 0; n < 8; n++)
1197
+ fTransform(it.yuvIn, U_OFF + SCAN_UV[n], it.yuvP, r + SCAN_UV[n], tmpUv, n * 16);
1198
+ if (it.enc.topDerr)
1199
+ correctDcValues(it, dqm.uv, tmpUv, rd);
1200
+ for (let n = 0; n < 8; n++)
1201
+ nz |= (quantizeBlock(tmpUv, n * 16, rd.uvLevels, n * 16, dqm.uv) ? 1 : 0) << n;
1202
+ for (let n = 0; n < 8; n += 2)
1203
+ iTransform(it.yuvP, r + SCAN_UV[n], tmpUv, n * 16, out, o + SCAN_UV[n], true);
1204
+ return nz << 16;
1205
+ }
1206
+ const rdTmp = new ModeScore();
1207
+ const sourceSpectra = new Int32Array(16);
1208
+ function pickBestIntra16(it, rd) {
1209
+ const enc = it.enc, dqm = enc.dqm[enc.mbSegment[it.mb]];
1210
+ const lambda = dqm.lambdaI16, tlambda = dqm.tlambda;
1211
+ let rdCur = rdTmp, rdBest = rd;
1212
+ let flat = isFlatSource16(it.yuvIn, Y_OFF);
1213
+ if (tlambda)
1214
+ for (let n = 0; n < 16; n++)
1215
+ sourceSpectra[n] = tTransform(it.yuvIn, Y_OFF + SCAN[n], WEIGHT_Y);
1216
+ rd.modeI16 = -1;
1217
+ for (let mode = 0; mode < 4; mode++) {
1218
+ const dst = it.yuvOut2;
1219
+ rdCur.modeI16 = mode;
1220
+ rdCur.nz = reconstructIntra16(it, rdCur, dst, Y_OFF, mode);
1221
+ rdCur.D = sse16(it.yuvIn, Y_OFF, dst, Y_OFF, 16);
1222
+ rdCur.SD = tlambda ? (tlambda * tDisto16x16(sourceSpectra, dst, Y_OFF, WEIGHT_Y) + 128) >> 8 : 0;
1223
+ rdCur.H = FIXED_COSTS_I16[mode];
1224
+ rdCur.R = costLuma16(it, rdCur);
1225
+ if (flat) {
1226
+ flat = isFlat(rdCur.yAcLevels, 0, 16, FLATNESS_LIMIT_I16);
1227
+ if (flat) {
1228
+ rdCur.D *= 2;
1229
+ rdCur.SD *= 2;
1230
+ }
1231
+ }
1232
+ rdCur.setRDScore(lambda);
1233
+ if (mode === 0 || rdCur.score < rdBest.score) {
1234
+ const swap = rdCur;
1235
+ rdCur = rdBest;
1236
+ rdBest = swap;
1237
+ it.swapOut();
1238
+ }
1239
+ }
1240
+ if (rdBest !== rd)
1241
+ rd.copyAll(rdBest);
1242
+ rd.setRDScore(dqm.lambdaMode);
1243
+ it.setIntra16Mode(rd.modeI16);
1244
+ if ((rd.nz & 0x100ffff) === 0x1000000 && rd.D > dqm.minDisto) {
1245
+ const max = Math.max(Math.abs(rd.yDcLevels[1]), Math.abs(rd.yDcLevels[2]), Math.abs(rd.yDcLevels[4]));
1246
+ if (max > dqm.maxEdge)
1247
+ dqm.maxEdge = max;
1248
+ }
1249
+ }
1250
+ const rdI4 = new ModeScore(), rdTmpI4 = new ModeScore(), rdBestI4 = new ModeScore();
1251
+ function costModesI4(it, modes) {
1252
+ const enc = it.enc, x = it.i4 & 3, y = it.i4 >> 2;
1253
+ const left = x === 0 ? enc.preds[it.preds + y * enc.predsW - 1] : modes[it.i4 - 1];
1254
+ const top = y === 0 ? enc.preds[it.preds - enc.predsW + x] : modes[it.i4 - 4];
1255
+ return (top * 10 + left) * 10;
1256
+ }
1257
+ function pickBestIntra4(it, rd) {
1258
+ const enc = it.enc, dqm = enc.dqm[enc.mbSegment[it.mb]];
1259
+ const lambda = dqm.lambdaI4, tlambda = dqm.tlambda;
1260
+ const costs = fixedCostsI4;
1261
+ let totalHeaderBits = 0;
1262
+ if (enc.maxI4HeaderBits === 0)
1263
+ return false;
1264
+ const best = rdBestI4;
1265
+ best.init();
1266
+ best.H = 211;
1267
+ best.setRDScore(dqm.lambdaMode);
1268
+ it.startI4();
1269
+ do {
1270
+ const src = Y_OFF + SCAN[it.i4];
1271
+ const modeCosts = costModesI4(it, rd.modesI4);
1272
+ let bestMode = -1;
1273
+ let bestBlock = it.yuvOut2, bb = Y_OFF + SCAN[it.i4];
1274
+ let tmpDst = it.yuvP, td = I4TMP;
1275
+ rdI4.init();
1276
+ predLuma4(it.yuvP, it.i4Boundary, it.i4Top);
1277
+ const spectrum = tlambda ? tTransform(it.yuvIn, src, WEIGHT_Y) : 0;
1278
+ for (let mode = 0; mode < 10; mode++) {
1279
+ const r = rdTmpI4;
1280
+ r.nz = reconstructIntra4(it, tmpLevels2, 0, it.yuvIn, src, tmpDst, td, mode) << it.i4;
1281
+ r.D = sse4x4(it.yuvIn, src, tmpDst, td);
1282
+ r.SD = tlambda ? (tlambda * tDisto4x4(spectrum, tmpDst, td, WEIGHT_Y) + 128) >> 8 : 0;
1283
+ r.H = costs[modeCosts + mode];
1284
+ r.R = mode > 0 && isFlat(tmpLevels2, 0, 1, FLATNESS_LIMIT_I4) ? FLATNESS_PENALTY : 0;
1285
+ r.setRDScore(lambda);
1286
+ if (bestMode >= 0 && r.score >= rdI4.score)
1287
+ continue;
1288
+ r.R += costLuma4(it, tmpLevels2);
1289
+ r.setRDScore(lambda);
1290
+ if (bestMode < 0 || r.score < rdI4.score) {
1291
+ rdI4.copyScore(r);
1292
+ bestMode = mode;
1293
+ const swap = tmpDst, swapOffset = td;
1294
+ tmpDst = bestBlock;
1295
+ td = bb;
1296
+ bestBlock = swap;
1297
+ bb = swapOffset;
1298
+ best.yAcLevels.set(tmpLevels2, it.i4 * 16);
1299
+ }
1300
+ }
1301
+ rdI4.setRDScore(dqm.lambdaMode);
1302
+ best.addScore(rdI4);
1303
+ if (best.score >= rd.score)
1304
+ return false;
1305
+ totalHeaderBits += rdI4.H;
1306
+ if (totalHeaderBits > enc.maxI4HeaderBits)
1307
+ return false;
1308
+ const target = Y_OFF + SCAN[it.i4];
1309
+ if (bestBlock !== it.yuvOut2 || bb !== target) {
1310
+ const out2 = it.yuvOut2;
1311
+ for (let y = 0; y < 4; y++) {
1312
+ for (let x = 0; x < 4; x++)
1313
+ out2[target + y * BPS + x] = bestBlock[bb + y * BPS + x];
1314
+ }
1315
+ }
1316
+ rd.modesI4[it.i4] = bestMode;
1317
+ it.topNz[it.i4 & 3] = it.leftNz[it.i4 >> 2] = rdI4.nz ? 1 : 0;
1318
+ } while (it.rotateI4(it.yuvOut2, Y_OFF));
1319
+ rd.copyScore(best);
1320
+ it.setIntra4Mode(rd.modesI4);
1321
+ it.swapOut();
1322
+ rd.yAcLevels.set(best.yAcLevels);
1323
+ return true;
1324
+ }
1325
+ const tmpLevels2 = new Int16Array(16);
1326
+ const rdUv = new ModeScore(), rdBestUv = new ModeScore();
1327
+ function pickBestUv(it, rd) {
1328
+ const enc = it.enc, dqm = enc.dqm[enc.mbSegment[it.mb]];
1329
+ const lambda = dqm.lambdaUv;
1330
+ const dst0 = it.yuvOut;
1331
+ let tmpDst = it.yuvOut2, dst = dst0;
1332
+ rd.modeUv = -1;
1333
+ rdBestUv.init();
1334
+ for (let mode = 0; mode < 4; mode++) {
1335
+ const r = rdUv;
1336
+ r.nz = reconstructUv(it, r, tmpDst, U_OFF, mode);
1337
+ r.D = sse16(it.yuvIn, U_OFF, tmpDst, U_OFF, 8);
1338
+ r.SD = 0;
1339
+ r.H = FIXED_COSTS_UV[mode];
1340
+ r.R = costUv(it, r);
1341
+ if (mode > 0 && isFlat(r.uvLevels, 0, 8, FLATNESS_LIMIT_UV))
1342
+ r.R += FLATNESS_PENALTY * 8;
1343
+ r.setRDScore(lambda);
1344
+ if (mode === 0 || r.score < rdBestUv.score) {
1345
+ rdBestUv.copyScore(r);
1346
+ rd.modeUv = mode;
1347
+ rd.uvLevels.set(r.uvLevels);
1348
+ if (enc.topDerr)
1349
+ rd.derr.set(r.derr);
1350
+ const swap = dst;
1351
+ dst = tmpDst;
1352
+ tmpDst = swap;
1353
+ }
1354
+ }
1355
+ enc.mbUvMode[it.mb] = rd.modeUv;
1356
+ rd.addScore(rdBestUv);
1357
+ if (dst !== dst0)
1358
+ for (let y = 0; y < 8; y++)
1359
+ dst0.set(dst.subarray(U_OFF + y * BPS, U_OFF + y * BPS + 16), U_OFF + y * BPS);
1360
+ if (enc.topDerr)
1361
+ storeDiffusionErrors(it, rd);
1362
+ }
1363
+ function simpleQuantize(it, rd) {
1364
+ const enc = it.enc;
1365
+ let nz = 0;
1366
+ if (enc.mbType[it.mb] === 1)
1367
+ nz = reconstructIntra16(it, rd, it.yuvOut, Y_OFF, enc.preds[it.preds]);
1368
+ else {
1369
+ it.startI4();
1370
+ do {
1371
+ const mode = enc.preds[it.preds + (it.i4 & 3) + (it.i4 >> 2) * enc.predsW];
1372
+ const o = Y_OFF + SCAN[it.i4];
1373
+ predLuma4(it.yuvP, it.i4Boundary, it.i4Top);
1374
+ nz |= reconstructIntra4(it, rd.yAcLevels, it.i4 * 16, it.yuvIn, o, it.yuvOut, o, mode) << it.i4;
1375
+ } while (it.rotateI4(it.yuvOut, Y_OFF));
1376
+ }
1377
+ nz |= reconstructUv(it, rd, it.yuvOut, U_OFF, enc.mbUvMode[it.mb]);
1378
+ rd.nz = nz;
1379
+ }
1380
+ const modeSSEs = new Float64Array(4);
1381
+ function refineUsingDistortion(it, tryBoth, refineUv, rd) {
1382
+ const enc = it.enc, dqm = enc.dqm[enc.mbSegment[it.mb]];
1383
+ const costs = fixedCostsI4;
1384
+ let bestScore = MAX_COST, nz = 0;
1385
+ let i16 = tryBoth || enc.mbType[it.mb] === 1;
1386
+ let scoreI4 = dqm.i4Penalty, i4Bits = 0;
1387
+ const bitLimit = tryBoth ? enc.mbHeaderLimit : MAX_COST;
1388
+ if (i16) {
1389
+ let bestMode = -1;
1390
+ it.luma16SSEs(modeSSEs);
1391
+ for (let mode = 0; mode < 4; mode++) {
1392
+ if (mode > 0 && FIXED_COSTS_I16[mode] > bitLimit)
1393
+ continue;
1394
+ const score = modeSSEs[mode] * RD_DISTO_MULT + FIXED_COSTS_I16[mode] * 106;
1395
+ if (score < bestScore) {
1396
+ bestMode = mode;
1397
+ bestScore = score;
1398
+ }
1399
+ }
1400
+ if ((it.x === 0 || it.y === 0) && isFlatSource16(it.yuvIn, Y_OFF)) {
1401
+ bestMode = it.x === 0 ? 0 : 2;
1402
+ tryBoth = false;
1403
+ }
1404
+ it.setIntra16Mode(bestMode);
1405
+ }
1406
+ if (tryBoth || !i16) {
1407
+ i16 = false;
1408
+ it.startI4();
1409
+ do {
1410
+ let bestI4Mode = -1, bestI4Score = MAX_COST;
1411
+ const src = Y_OFF + SCAN[it.i4];
1412
+ const modeCosts = costModesI4(it, rd.modesI4);
1413
+ predLuma4(it.yuvP, it.i4Boundary, it.i4Top);
1414
+ for (let mode = 0; mode < 10; mode++) {
1415
+ const score = sse4x4(it.yuvIn, src, it.yuvP, I4_MODE_OFFSETS[mode]) * RD_DISTO_MULT + costs[modeCosts + mode] * 11;
1416
+ if (score < bestI4Score) {
1417
+ bestI4Mode = mode;
1418
+ bestI4Score = score;
1419
+ }
1420
+ }
1421
+ i4Bits += costs[modeCosts + bestI4Mode];
1422
+ rd.modesI4[it.i4] = bestI4Mode;
1423
+ scoreI4 += bestI4Score;
1424
+ if (scoreI4 >= bestScore || i4Bits > bitLimit) {
1425
+ i16 = true;
1426
+ break;
1427
+ }
1428
+ nz |= reconstructIntra4(it, rd.yAcLevels, it.i4 * 16, it.yuvIn, src, it.yuvOut2, src, bestI4Mode) << it.i4;
1429
+ } while (it.rotateI4(it.yuvOut2, Y_OFF));
1430
+ }
1431
+ if (!i16) {
1432
+ it.setIntra4Mode(rd.modesI4);
1433
+ it.swapOut();
1434
+ bestScore = scoreI4;
1435
+ }
1436
+ else {
1437
+ it.makeLuma16Preds(1 << enc.preds[it.preds]);
1438
+ nz = reconstructIntra16(it, rd, it.yuvOut, Y_OFF, enc.preds[it.preds]);
1439
+ }
1440
+ if (refineUv) {
1441
+ let bestMode = -1, bestUvScore = MAX_COST;
1442
+ it.chroma8SSEs(modeSSEs);
1443
+ for (let mode = 0; mode < 4; mode++) {
1444
+ const score = modeSSEs[mode] * RD_DISTO_MULT + FIXED_COSTS_UV[mode] * 120;
1445
+ if (score < bestUvScore) {
1446
+ bestMode = mode;
1447
+ bestUvScore = score;
1448
+ }
1449
+ }
1450
+ enc.mbUvMode[it.mb] = bestMode;
1451
+ }
1452
+ it.makeChroma8Preds(1 << enc.mbUvMode[it.mb]);
1453
+ nz |= reconstructUv(it, rd, it.yuvOut, U_OFF, enc.mbUvMode[it.mb]);
1454
+ rd.nz = nz;
1455
+ rd.score = bestScore;
1456
+ }
1457
+ function decimate(it, rd, rdOpt) {
1458
+ const method = it.enc.method;
1459
+ rd.init();
1460
+ if (rdOpt > RD_OPT_NONE) {
1461
+ it.makeLuma16Preds();
1462
+ it.makeChroma8Preds();
1463
+ it.doTrellis = rdOpt >= RD_OPT_TRELLIS_ALL;
1464
+ pickBestIntra16(it, rd);
1465
+ if (method >= 2)
1466
+ pickBestIntra4(it, rd);
1467
+ pickBestUv(it, rd);
1468
+ if (rdOpt === RD_OPT_TRELLIS) {
1469
+ it.doTrellis = true;
1470
+ simpleQuantize(it, rd);
1471
+ }
1472
+ }
1473
+ else {
1474
+ refineUsingDistortion(it, method >= 2, method >= 1, rd);
1475
+ }
1476
+ const skipped = rd.nz === 0;
1477
+ it.enc.mbSkip[it.mb] = skipped ? 1 : 0;
1478
+ return skipped;
1479
+ }
1480
+ function recordTokens(it, rd) {
1481
+ const enc = it.enc, stats = enc.proba.stats, tokens = enc.tokens;
1482
+ it.nzToBytes();
1483
+ if (enc.mbType[it.mb] === 1) {
1484
+ residual.first = 0;
1485
+ residual.type = 1;
1486
+ setResidualCoeffs(residual, rd.yDcLevels, 0);
1487
+ it.topNz[8] = it.leftNz[8] = tokens.record(it.topNz[8] + it.leftNz[8], residual, stats) && residual.last >= 0 ? 1 : 0;
1488
+ residual.first = 1;
1489
+ residual.type = 0;
1490
+ }
1491
+ else {
1492
+ residual.first = 0;
1493
+ residual.type = 3;
1494
+ }
1495
+ for (let y = 0; y < 4; y++) {
1496
+ for (let x = 0; x < 4; x++) {
1497
+ setResidualCoeffs(residual, rd.yAcLevels, (x + y * 4) * 16);
1498
+ it.topNz[x] = it.leftNz[y] = tokens.record(it.topNz[x] + it.leftNz[y], residual, stats) && residual.last >= 0 ? 1 : 0;
1499
+ }
1500
+ }
1501
+ residual.first = 0;
1502
+ residual.type = 2;
1503
+ for (let ch = 0; ch <= 2; ch += 2) {
1504
+ for (let y = 0; y < 2; y++) {
1505
+ for (let x = 0; x < 2; x++) {
1506
+ setResidualCoeffs(residual, rd.uvLevels, (ch * 2 + x + y * 2) * 16);
1507
+ it.topNz[4 + ch + x] = it.leftNz[4 + ch + y] =
1508
+ tokens.record(it.topNz[4 + ch + x] + it.leftNz[4 + ch + y], residual, stats) && residual.last >= 0 ? 1 : 0;
1509
+ }
1510
+ }
1511
+ }
1512
+ it.bytesToNz();
1513
+ }
1514
+ const PARTITION0_SIZE_LIMIT = ((1 << 19) - 2048) * 2048;
1515
+ function tokenLoop(enc) {
1516
+ const maxCount = Math.max((enc.mbW * enc.mbH) >> 3, 96);
1517
+ const quality = Math.fround(enc.quality);
1518
+ for (;;) {
1519
+ let sizeP0 = 0, cnt = maxCount;
1520
+ const it = new Iterator(enc);
1521
+ setSegmentParams(enc, quality);
1522
+ setSegmentProbas(enc);
1523
+ enc.proba.calculateLevelCosts();
1524
+ enc.proba.nbSkip = 0;
1525
+ enc.proba.stats.fill(0);
1526
+ enc.tokens.length = 0;
1527
+ const rd = new ModeScore();
1528
+ do {
1529
+ it.import(false);
1530
+ if (--cnt < 0) {
1531
+ enc.proba.finalizeTokenProbas();
1532
+ enc.proba.calculateLevelCosts();
1533
+ cnt = maxCount;
1534
+ }
1535
+ decimate(it, rd, enc.rdOpt);
1536
+ recordTokens(it, rd);
1537
+ sizeP0 += rd.H;
1538
+ it.saveBoundary();
1539
+ } while (it.next());
1540
+ sizeP0 += enc.segmentSize;
1541
+ if (enc.maxI4HeaderBits > 0 && sizeP0 > PARTITION0_SIZE_LIMIT) {
1542
+ enc.maxI4HeaderBits >>= 1;
1543
+ continue;
1544
+ }
1545
+ break;
1546
+ }
1547
+ enc.proba.finalizeTokenProbas();
1548
+ enc.tokens.emit(enc.parts, enc.proba.coeffs);
1549
+ adjustFilterStrength(enc);
1550
+ }
1551
+ function putCoeffs(bw, probas, ctx, res) {
1552
+ let n = res.first;
1553
+ let p = probaIndex(res.type, n, ctx);
1554
+ if (!bw.putBit(res.last >= 0, probas[p]))
1555
+ return 0;
1556
+ while (n < 16) {
1557
+ const c = res.coeffs[res.offset + n++];
1558
+ const sign = c < 0;
1559
+ let v = sign ? -c : c;
1560
+ if (!bw.putBit(v !== 0, probas[p + 1])) {
1561
+ p = probaIndex(res.type, BANDS[n], 0);
1562
+ continue;
1563
+ }
1564
+ if (!bw.putBit(v > 1, probas[p + 2]))
1565
+ p = probaIndex(res.type, BANDS[n], 1);
1566
+ else {
1567
+ if (!bw.putBit(v > 4, probas[p + 3])) {
1568
+ if (bw.putBit(v !== 2, probas[p + 4]))
1569
+ bw.putBit(v === 4, probas[p + 5]);
1570
+ }
1571
+ else if (!bw.putBit(v > 10, probas[p + 6])) {
1572
+ if (!bw.putBit(v > 6, probas[p + 7]))
1573
+ bw.putBit(v === 6, 159);
1574
+ else {
1575
+ bw.putBit(v >= 9, 165);
1576
+ bw.putBit(!(v & 1), 145);
1577
+ }
1578
+ }
1579
+ else {
1580
+ let mask, tab;
1581
+ if (v < 3 + (8 << 1)) {
1582
+ bw.putBit(0, probas[p + 8]);
1583
+ bw.putBit(0, probas[p + 9]);
1584
+ v -= 3 + 8;
1585
+ mask = 1 << 2;
1586
+ tab = CAT3;
1587
+ }
1588
+ else if (v < 3 + (8 << 2)) {
1589
+ bw.putBit(0, probas[p + 8]);
1590
+ bw.putBit(1, probas[p + 9]);
1591
+ v -= 3 + (8 << 1);
1592
+ mask = 1 << 3;
1593
+ tab = CAT4;
1594
+ }
1595
+ else if (v < 3 + (8 << 3)) {
1596
+ bw.putBit(1, probas[p + 8]);
1597
+ bw.putBit(0, probas[p + 10]);
1598
+ v -= 3 + (8 << 2);
1599
+ mask = 1 << 4;
1600
+ tab = CAT5;
1601
+ }
1602
+ else {
1603
+ bw.putBit(1, probas[p + 8]);
1604
+ bw.putBit(1, probas[p + 10]);
1605
+ v -= 3 + (8 << 3);
1606
+ mask = 1 << 10;
1607
+ tab = CAT6;
1608
+ }
1609
+ for (let k = 0; mask; mask >>= 1, k++)
1610
+ bw.putBit(v & mask, tab[k]);
1611
+ }
1612
+ p = probaIndex(res.type, BANDS[n], 2);
1613
+ }
1614
+ bw.putBitUniform(sign);
1615
+ if (n === 16 || !bw.putBit(n <= res.last, probas[p]))
1616
+ return 1;
1617
+ }
1618
+ return 1;
1619
+ }
1620
+ function residuals(it, rd, code) {
1621
+ const enc = it.enc, nz = rd.nz;
1622
+ it.nzToBytes();
1623
+ if (enc.mbType[it.mb] === 1) {
1624
+ residual.first = 0;
1625
+ residual.type = 1;
1626
+ setResidualCoeffs(residual, rd.yDcLevels, 0, nz >> 24 & 1);
1627
+ it.topNz[8] = it.leftNz[8] = code(it.topNz[8] + it.leftNz[8], residual);
1628
+ residual.first = 1;
1629
+ residual.type = 0;
1630
+ }
1631
+ else {
1632
+ residual.first = 0;
1633
+ residual.type = 3;
1634
+ }
1635
+ for (let y = 0; y < 4; y++) {
1636
+ for (let x = 0; x < 4; x++) {
1637
+ setResidualCoeffs(residual, rd.yAcLevels, (x + y * 4) * 16, nz >> (x + y * 4) & 1);
1638
+ it.topNz[x] = it.leftNz[y] = code(it.topNz[x] + it.leftNz[y], residual);
1639
+ }
1640
+ }
1641
+ residual.first = 0;
1642
+ residual.type = 2;
1643
+ for (let ch = 0; ch <= 2; ch += 2) {
1644
+ for (let y = 0; y < 2; y++) {
1645
+ for (let x = 0; x < 2; x++) {
1646
+ setResidualCoeffs(residual, rd.uvLevels, (ch * 2 + x + y * 2) * 16, nz >> (16 + ch * 2 + x + y * 2) & 1);
1647
+ it.topNz[4 + ch + x] = it.leftNz[4 + ch + y] = code(it.topNz[4 + ch + x] + it.leftNz[4 + ch + y], residual);
1648
+ }
1649
+ }
1650
+ }
1651
+ it.bytesToNz();
1652
+ }
1653
+ function finalizeSkipProba(enc) {
1654
+ const proba = enc.proba, total = enc.mbW * enc.mbH;
1655
+ proba.skipProba = Math.trunc((total - proba.nbSkip) * 255 / total);
1656
+ proba.useSkipProba = proba.skipProba < 250;
1657
+ }
1658
+ function encodeLoop(enc) {
1659
+ const quality = Math.fround(enc.quality);
1660
+ const rd = new ModeScore();
1661
+ const stats = enc.proba.stats, tokens = enc.tokens, total = enc.mbW * enc.mbH;
1662
+ const starts = new Uint32Array(total + 1);
1663
+ const record = (ctx, res) => tokens.record(ctx, res, stats, 10) ? 1 : 0;
1664
+ stats.fill(0);
1665
+ let collected = true, it, recorded, more;
1666
+ for (;;) {
1667
+ let count = total;
1668
+ if (enc.method === 0)
1669
+ count = count > 200 ? count >> 2 : 50;
1670
+ it = new Iterator(enc);
1671
+ setSegmentParams(enc, quality);
1672
+ setSegmentProbas(enc);
1673
+ enc.proba.nbSkip = 0;
1674
+ tokens.length = 0;
1675
+ recorded = 0;
1676
+ let sizeP0 = 0;
1677
+ do {
1678
+ it.import(false);
1679
+ if (decimate(it, rd, RD_OPT_NONE))
1680
+ enc.proba.nbSkip++;
1681
+ starts[recorded++] = tokens.length;
1682
+ residuals(it, rd, record);
1683
+ sizeP0 += rd.H;
1684
+ it.saveBoundary();
1685
+ } while ((more = it.next()) && --count > 0);
1686
+ starts[recorded] = tokens.length;
1687
+ sizeP0 += enc.segmentSize;
1688
+ if (sizeP0 === 0) {
1689
+ collected = false;
1690
+ break;
1691
+ }
1692
+ if (enc.maxI4HeaderBits > 0 && sizeP0 > PARTITION0_SIZE_LIMIT) {
1693
+ enc.maxI4HeaderBits >>= 1;
1694
+ continue;
1695
+ }
1696
+ break;
1697
+ }
1698
+ if (collected) {
1699
+ finalizeSkipProba(enc);
1700
+ enc.proba.finalizeTokenProbas();
1701
+ }
1702
+ const bw = enc.parts, probas = enc.proba.coeffs, skip = enc.proba.useSkipProba;
1703
+ for (let mb = 0; mb < recorded; mb++)
1704
+ if (!skip || !enc.mbSkip[mb])
1705
+ tokens.emit(bw, probas, starts[mb], starts[mb + 1]);
1706
+ tokens.length = 0;
1707
+ const code = (ctx, res) => putCoeffs(bw, probas, ctx, res);
1708
+ if (more) {
1709
+ do {
1710
+ it.import(false);
1711
+ if (!decimate(it, rd, enc.rdOpt) || !skip)
1712
+ residuals(it, rd, code);
1713
+ else if (enc.mbType[it.mb] === 1) {
1714
+ enc.nz[it.nzIndex] = 0;
1715
+ it.leftNz[8] = 0;
1716
+ }
1717
+ else
1718
+ enc.nz[it.nzIndex] &= 1 << 24;
1719
+ it.saveBoundary();
1720
+ } while (it.next());
1721
+ }
1722
+ adjustFilterStrength(enc);
1723
+ }
1724
+ function adjustFilterStrength(enc) {
1725
+ let maxLevel = 0;
1726
+ for (let s = 0; s < NUM_MB_SEGMENTS; s++) {
1727
+ const m = enc.dqm[s];
1728
+ const level = filterStrengthFromDelta(enc.filterSharpness, (m.maxEdge * m.y2.q[1]) >> 3);
1729
+ if (level > m.fstrength)
1730
+ m.fstrength = level;
1731
+ if (maxLevel < m.fstrength)
1732
+ maxLevel = m.fstrength;
1733
+ }
1734
+ enc.filterLevel = maxLevel;
1735
+ }
1736
+ const B_TM_PRED = 1, B_VE_PRED = 2, B_HE_PRED = 3, B_RD_PRED = 4, B_LD_PRED = 6, B_VL_PRED = 7, B_HD_PRED = 8;
1737
+ const TM_PRED = 1, V_PRED = 2, H_PRED = 3;
1738
+ function putI4Mode(bw, mode, p) {
1739
+ const prob = BMODES_PROBA;
1740
+ if (bw.putBit(mode !== 0, prob[p])) {
1741
+ if (bw.putBit(mode !== B_TM_PRED, prob[p + 1])) {
1742
+ if (bw.putBit(mode !== B_VE_PRED, prob[p + 2])) {
1743
+ if (!bw.putBit(mode >= B_LD_PRED, prob[p + 3])) {
1744
+ if (bw.putBit(mode !== B_HE_PRED, prob[p + 4]))
1745
+ bw.putBit(mode !== B_RD_PRED, prob[p + 5]);
1746
+ }
1747
+ else if (bw.putBit(mode !== B_LD_PRED, prob[p + 6])) {
1748
+ if (bw.putBit(mode !== B_VL_PRED, prob[p + 7]))
1749
+ bw.putBit(mode !== B_HD_PRED, prob[p + 8]);
1750
+ }
1751
+ }
1752
+ }
1753
+ }
1754
+ }
1755
+ function codeIntraModes(enc, bw) {
1756
+ const w = enc.predsW;
1757
+ for (let my = 0; my < enc.mbH; my++) {
1758
+ for (let mx = 0; mx < enc.mbW; mx++) {
1759
+ const mb = my * enc.mbW + mx, preds = w + 1 + my * 4 * w + mx * 4;
1760
+ if (enc.updateMap) {
1761
+ const s = enc.mbSegment[mb], p = enc.proba.segments;
1762
+ bw.putBit(s & 1, p[bw.putBit(s >= 2, p[0]) ? 2 : 1]);
1763
+ }
1764
+ if (enc.proba.useSkipProba)
1765
+ bw.putBit(enc.mbSkip[mb], enc.proba.skipProba);
1766
+ if (bw.putBit(enc.mbType[mb] !== 0, 145)) {
1767
+ const mode = enc.preds[preds];
1768
+ if (bw.putBit(mode === TM_PRED || mode === H_PRED, 156))
1769
+ bw.putBit(mode === TM_PRED, 128);
1770
+ else
1771
+ bw.putBit(mode === V_PRED, 163);
1772
+ }
1773
+ else {
1774
+ for (let y = 0; y < 4; y++) {
1775
+ let left = enc.preds[preds + y * w - 1];
1776
+ for (let x = 0; x < 4; x++) {
1777
+ const top = enc.preds[preds + (y - 1) * w + x], mode = enc.preds[preds + y * w + x];
1778
+ putI4Mode(bw, mode, (top * 10 + left) * 9);
1779
+ left = mode;
1780
+ }
1781
+ }
1782
+ }
1783
+ const uv = enc.mbUvMode[mb];
1784
+ if (bw.putBit(uv !== 0, 142)) {
1785
+ if (bw.putBit(uv !== V_PRED, 114))
1786
+ bw.putBit(uv !== H_PRED, 183);
1787
+ }
1788
+ }
1789
+ }
1790
+ }
1791
+ function partition0(enc) {
1792
+ const bw = new BitWriter();
1793
+ bw.putBitUniform(0);
1794
+ bw.putBitUniform(0);
1795
+ if (bw.putBitUniform(enc.numSegments > 1)) {
1796
+ bw.putBitUniform(enc.updateMap);
1797
+ bw.putBitUniform(1);
1798
+ bw.putBitUniform(1);
1799
+ for (let s = 0; s < NUM_MB_SEGMENTS; s++)
1800
+ bw.putSignedBits(enc.dqm[s].quant, 7);
1801
+ for (let s = 0; s < NUM_MB_SEGMENTS; s++)
1802
+ bw.putSignedBits(enc.dqm[s].fstrength, 6);
1803
+ if (enc.updateMap) {
1804
+ for (let s = 0; s < 3; s++)
1805
+ if (bw.putBitUniform(enc.proba.segments[s] !== 255))
1806
+ bw.putBits(enc.proba.segments[s], 8);
1807
+ }
1808
+ }
1809
+ bw.putBitUniform(enc.filterSimple);
1810
+ bw.putBits(enc.filterLevel, 6);
1811
+ bw.putBits(enc.filterSharpness, 3);
1812
+ bw.putBitUniform(0);
1813
+ bw.putBits(0, 2);
1814
+ bw.putBits(enc.baseQuant, 7);
1815
+ bw.putSignedBits(0, 4);
1816
+ bw.putSignedBits(0, 4);
1817
+ bw.putSignedBits(0, 4);
1818
+ bw.putSignedBits(enc.dqUvDc, 4);
1819
+ bw.putSignedBits(enc.dqUvAc, 4);
1820
+ bw.putBitUniform(0);
1821
+ for (let i = 0; i < enc.proba.coeffs.length; i++) {
1822
+ const p = enc.proba.coeffs[i];
1823
+ if (bw.putBit(p !== DEFAULT_COEFF_PROBS[i], COEFF_UPDATE_PROBS[i]))
1824
+ bw.putBits(p, 8);
1825
+ }
1826
+ if (bw.putBitUniform(enc.proba.useSkipProba))
1827
+ bw.putBits(enc.proba.skipProba, 8);
1828
+ codeIntraModes(enc, bw);
1829
+ return bw.finish();
1830
+ }
1831
+ function filterAlpha(a, width, height, filter) {
1832
+ const out = new Uint8Array(a.length);
1833
+ for (let y = 0; y < height; y++) {
1834
+ for (let x = 0; x < width; x++) {
1835
+ const i = y * width + x;
1836
+ let pred;
1837
+ if (x === 0 && y === 0)
1838
+ pred = 0;
1839
+ else if (y === 0)
1840
+ pred = a[i - 1];
1841
+ else if (x === 0)
1842
+ pred = a[i - width];
1843
+ else if (filter === 1)
1844
+ pred = a[i - 1];
1845
+ else if (filter === 2)
1846
+ pred = a[i - width];
1847
+ else
1848
+ pred = clip(a[i - 1] + a[i - width] - a[i - width - 1], 0, 255);
1849
+ out[i] = (a[i] - pred) & 255;
1850
+ }
1851
+ }
1852
+ return out;
1853
+ }
1854
+ function estimateBestFilter(a, width, height) {
1855
+ const bins = [new Uint8Array(16), new Uint8Array(16), new Uint8Array(16), new Uint8Array(16)];
1856
+ for (let j = 2; j < height - 1; j += 2) {
1857
+ const p = j * width;
1858
+ let mean = a[p];
1859
+ for (let i = 2; i < width - 1; i += 2) {
1860
+ const v = a[p + i];
1861
+ bins[0][Math.abs(v - mean) >> 4] = 1;
1862
+ bins[1][Math.abs(v - a[p + i - 1]) >> 4] = 1;
1863
+ bins[2][Math.abs(v - a[p + i - width]) >> 4] = 1;
1864
+ bins[3][Math.abs(v - clip(a[p + i - 1] + a[p + i - width] - a[p + i - width - 1], 0, 255)) >> 4] = 1;
1865
+ mean = (3 * mean + v + 2) >> 2;
1866
+ }
1867
+ }
1868
+ let best = 0, bestScore = 0x7fffffff;
1869
+ for (let f = 0; f < 4; f++) {
1870
+ let score = 0;
1871
+ for (let i = 0; i < 16; i++)
1872
+ if (bins[f][i])
1873
+ score += i;
1874
+ if (score < bestScore) {
1875
+ bestScore = score;
1876
+ best = f;
1877
+ }
1878
+ }
1879
+ return best;
1880
+ }
1881
+ export function encodeAlpha(a, width, height, method = 4) {
1882
+ let colors = 0;
1883
+ const seen = new Uint8Array(256);
1884
+ for (let i = 0; i < a.length; i++)
1885
+ if (!seen[a[i]]) {
1886
+ seen[a[i]] = 1;
1887
+ colors++;
1888
+ }
1889
+ const filters = new Set([colors <= 16 ? 0 : estimateBestFilter(a, width, height)]);
1890
+ if (method > 3 || colors > 192)
1891
+ filters.add(0);
1892
+ let best = null;
1893
+ for (const filter of [...filters].sort()) {
1894
+ const data = filter ? filterAlpha(a, width, height, filter) : a;
1895
+ const argb = new Uint32Array(a.length);
1896
+ for (let i = 0; i < a.length; i++)
1897
+ argb[i] = data[i] << 8;
1898
+ let stream = vp8l.encode(argb, width, height).subarray(5), method = 1;
1899
+ if (stream.length > a.length) {
1900
+ stream = data;
1901
+ method = 0;
1902
+ }
1903
+ const out = new Uint8Array(1 + stream.length);
1904
+ out[0] = method | filter << 2;
1905
+ out.set(stream, 1);
1906
+ if (!best || out.length < best.length)
1907
+ best = out;
1908
+ }
1909
+ return best;
1910
+ }
1911
+ export function encodeVP8(pic, quality, method = 4) {
1912
+ levelFixedCosts ??= words(LEVEL_FIXED_COSTS);
1913
+ fixedCostsI4 ??= words(FIXED_COSTS_I4);
1914
+ const enc = new Encoder(pic, quality, method);
1915
+ analyze(enc);
1916
+ if (enc.rdOpt >= RD_OPT_BASIC)
1917
+ tokenLoop(enc);
1918
+ else
1919
+ encodeLoop(enc);
1920
+ const p0 = partition0(enc), tokens = enc.parts.finish();
1921
+ const out = new Uint8Array(10 + p0.length + tokens.length);
1922
+ const bits = 0 | 0 << 1 | 1 << 4 | p0.length << 5;
1923
+ out[0] = bits & 255;
1924
+ out[1] = bits >> 8 & 255;
1925
+ out[2] = bits >> 16 & 255;
1926
+ out.set([0x9d, 0x01, 0x2a, pic.width & 255, pic.width >> 8, pic.height & 255, pic.height >> 8], 3);
1927
+ out.set(p0, 10);
1928
+ out.set(tokens, 10 + p0.length);
1929
+ return out;
1930
+ }