@torrent-tv/proxy 2.89.3 → 2.89.4
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/AGENTS.md +338 -336
- package/CHANGELOG.md +12 -0
- package/docs/encode-architecture.md +55 -19
- package/docs/playback-start-forecast.md +13 -5
- package/docs/storage-architecture.md +6 -0
- package/package.json +1 -1
- package/routes/stream/get.js +38 -2
- package/server.js +748 -745
- package/services/encode/EncodeOrchestrator.js +24 -49
- package/services/encode/EncodePlan.js +5 -3
- package/services/encode/EncodeRun.js +80 -17
- package/services/encode/EncodeRuns.js +1339 -1239
- package/services/encode/Renditions.js +2 -1
- package/services/encode/RunClock.js +87 -0
- package/services/encode/RunProgress.js +1 -6
- package/services/encode/encoder-readings.js +26 -28
- package/services/encode/piece-completeness.js +46 -0
- package/services/encode/quality/EncodeCost.js +1043 -1167
- package/services/encode/quality/OutputQualityState.js +1 -5
- package/services/encode/quality/QualityController.js +213 -390
- package/services/encode/quality/link-budget.js +5 -17
- package/services/encode/run-inputs.js +13 -2
- package/services/server/SegmentServing.js +3 -1
- package/services/server/ViewerRequests.js +2 -7
- package/services/server/wire-outputs.js +12 -7
- package/services/storage/segment-store/SegmentStore.js +46 -29
- package/services/torrent/supply-margin.js +7 -5
- package/test/auto-quality-step.test.js +75 -29
- package/test/decode-cost.test.js +1 -1
- package/test/encode-cost.test.js +31 -39
- package/test/encode-orchestrator.test.js +15 -8
- package/test/encode-plan-viewers.test.js +34 -27
- package/test/encode-run.test.js +34 -6
- package/test/encoder-readings.test.js +48 -26
- package/test/helpers/encode-run.js +113 -9
- package/test/link-budget.test.js +4 -5
- package/test/manager-surface.test.js +1 -2
- package/test/orchestrator-wired.test.js +5 -4
- package/test/output-speed.test.js +0 -1
- package/test/piece-completeness.test.js +42 -0
- package/test/quality-offer.test.js +1 -3
- package/test/quality-variants.test.js +1 -1
- package/test/run-progress.test.js +2 -3
- package/test/same-height-switch.test.js +1 -2
- package/test/segment-store.test.js +15 -15
- package/test/stream-route.test.js +28 -0
- package/test/supply-margin.test.js +13 -0
- package/test/two-viewers-one-picture.test.js +1 -1
- package/test/viewer-outputs.test.js +1 -1
|
@@ -1,1167 +1,1043 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @file What encoding this file costs THIS machine, and which heights follow.
|
|
3
|
-
*
|
|
4
|
-
* One subject: seconds of work per second of video. Everything here is that
|
|
5
|
-
* question asked about something — a picture being re-encoded, a soundtrack, a
|
|
6
|
-
* copy, everything running beside the rung being judged — and the last method
|
|
7
|
-
* turns the answers into the list of heights the machine can hold.
|
|
8
|
-
*
|
|
9
|
-
* It decides what a viewer is offered, so being wrong in either direction costs
|
|
10
|
-
* them: too generous and they are given a rung that runs below realtime, which
|
|
11
|
-
* is a slideshow; too mean and they are refused quality the host could hold.
|
|
12
|
-
*
|
|
13
|
-
* Nothing here is chosen. Every figure is a measurement — the startup
|
|
14
|
-
* benchmarks, what an encoder has since been seen doing on this very file, what
|
|
15
|
-
* a second job costs on this host, what share of the machine is free — and where
|
|
16
|
-
* a term has not been measured it contributes nothing rather than a guess.
|
|
17
|
-
*
|
|
18
|
-
* What it is given, and why each is passed rather than reached for: which
|
|
19
|
-
* sessions belong to one file (`outputs`), the host's own readings, how many
|
|
20
|
-
* encoders are running, what the file costs merely by being fetched, and whether
|
|
21
|
-
* a slow run is short of the machine or short of the swarm. The learned costs it
|
|
22
|
-
* holds itself: they are what an encoder taught it, and it is their only writer
|
|
23
|
-
* and their only reader.
|
|
24
|
-
*
|
|
25
|
-
* **Learning them lives here too, and it did not until 2026-09-15.** The three
|
|
26
|
-
* methods that turn a reading off a running encoder into a price were methods of
|
|
27
|
-
* the session manager, writing into these maps from outside — so a fact had one
|
|
28
|
-
* keeper and a different author, and the maps had to be public for it. They are
|
|
29
|
-
* private now, and what leaves this class is an answer rather than a store.
|
|
30
|
-
*/
|
|
31
|
-
|
|
32
|
-
/**
|
|
33
|
-
* Which cost a speed reading from this session is a measurement OF.
|
|
34
|
-
*
|
|
35
|
-
* Three encodes share one reading path and price three different things: a
|
|
36
|
-
* soundtrack published on its own, a picture being re-encoded (whose reading
|
|
37
|
-
* prices this source's DECODING, the encode half being known from the startup
|
|
38
|
-
* benchmark), and a picture being copied (which prices copying).
|
|
39
|
-
*
|
|
40
|
-
* Exported because the routing is where the fault was: a rendition was refused
|
|
41
|
-
* a reading by one guard while the call that would have priced it sat behind
|
|
42
|
-
* another, so the soundtrack was charged at nothing no matter how long it ran.
|
|
43
|
-
* A pure function makes that a test rather than a field session.
|
|
44
|
-
*
|
|
45
|
-
* @param {{ audioOnly?: boolean, transcodeVideo?: boolean }} session
|
|
46
|
-
* @returns {"audio" | "decode" | "copy"}
|
|
47
|
-
*/
|
|
48
|
-
export function costKindForSession(session) {
|
|
49
|
-
if (session?.spec?.carries === "audio-only") {
|
|
50
|
-
return "audio";
|
|
51
|
-
}
|
|
52
|
-
return session?.spec?.transcodesVideo === true ? "decode" : "copy";
|
|
53
|
-
}
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
import {
|
|
59
|
-
import {
|
|
60
|
-
import {
|
|
61
|
-
import {
|
|
62
|
-
import {
|
|
63
|
-
import {
|
|
64
|
-
import {
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
#
|
|
102
|
-
|
|
103
|
-
#
|
|
104
|
-
#
|
|
105
|
-
#
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
*
|
|
115
|
-
*
|
|
116
|
-
*
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
this.#
|
|
134
|
-
this.#
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
*
|
|
162
|
-
*
|
|
163
|
-
*
|
|
164
|
-
*
|
|
165
|
-
*
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
*
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
*
|
|
198
|
-
*
|
|
199
|
-
*
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
*
|
|
207
|
-
*
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
const
|
|
230
|
-
|
|
231
|
-
|
|
232
|
-
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
*
|
|
262
|
-
*
|
|
263
|
-
*
|
|
264
|
-
*
|
|
265
|
-
*
|
|
266
|
-
*
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
273
|
-
|
|
274
|
-
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
*
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
322
|
-
|
|
323
|
-
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
*
|
|
328
|
-
*
|
|
329
|
-
*
|
|
330
|
-
*
|
|
331
|
-
*
|
|
332
|
-
*
|
|
333
|
-
* @param {
|
|
334
|
-
* @returns {{ costSec: number | null, fileKey: string, fileCostSec: number } | null}
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
|
|
352
|
-
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
363
|
-
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
}
|
|
368
|
-
|
|
369
|
-
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
|
|
373
|
-
|
|
374
|
-
|
|
375
|
-
|
|
376
|
-
|
|
377
|
-
|
|
378
|
-
return { costSec: 1 /
|
|
379
|
-
}
|
|
380
|
-
|
|
381
|
-
|
|
382
|
-
|
|
383
|
-
|
|
384
|
-
|
|
385
|
-
|
|
386
|
-
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
|
|
392
|
-
|
|
393
|
-
|
|
394
|
-
|
|
395
|
-
|
|
396
|
-
|
|
397
|
-
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
|
|
405
|
-
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
423
|
-
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
)
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
//
|
|
524
|
-
//
|
|
525
|
-
//
|
|
526
|
-
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
|
|
535
|
-
|
|
536
|
-
|
|
537
|
-
|
|
538
|
-
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
543
|
-
|
|
544
|
-
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
*
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
|
|
573
|
-
|
|
574
|
-
|
|
575
|
-
|
|
576
|
-
|
|
577
|
-
|
|
578
|
-
|
|
579
|
-
|
|
580
|
-
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
587
|
-
|
|
588
|
-
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
|
|
592
|
-
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
|
|
599
|
-
|
|
600
|
-
|
|
601
|
-
|
|
602
|
-
|
|
603
|
-
|
|
604
|
-
|
|
605
|
-
|
|
606
|
-
|
|
607
|
-
//
|
|
608
|
-
//
|
|
609
|
-
|
|
610
|
-
|
|
611
|
-
sourceHeight
|
|
612
|
-
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
|
|
619
|
-
|
|
620
|
-
|
|
621
|
-
|
|
622
|
-
|
|
623
|
-
|
|
624
|
-
|
|
625
|
-
|
|
626
|
-
|
|
627
|
-
|
|
628
|
-
|
|
629
|
-
|
|
630
|
-
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
|
|
638
|
-
|
|
639
|
-
|
|
640
|
-
|
|
641
|
-
|
|
642
|
-
|
|
643
|
-
|
|
644
|
-
|
|
645
|
-
|
|
646
|
-
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
|
|
660
|
-
|
|
661
|
-
|
|
662
|
-
|
|
663
|
-
|
|
664
|
-
|
|
665
|
-
|
|
666
|
-
|
|
667
|
-
//
|
|
668
|
-
//
|
|
669
|
-
//
|
|
670
|
-
|
|
671
|
-
|
|
672
|
-
|
|
673
|
-
|
|
674
|
-
|
|
675
|
-
|
|
676
|
-
|
|
677
|
-
|
|
678
|
-
|
|
679
|
-
|
|
680
|
-
|
|
681
|
-
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
685
|
-
|
|
686
|
-
//
|
|
687
|
-
//
|
|
688
|
-
//
|
|
689
|
-
|
|
690
|
-
|
|
691
|
-
|
|
692
|
-
|
|
693
|
-
|
|
694
|
-
|
|
695
|
-
|
|
696
|
-
|
|
697
|
-
|
|
698
|
-
|
|
699
|
-
//
|
|
700
|
-
//
|
|
701
|
-
//
|
|
702
|
-
//
|
|
703
|
-
//
|
|
704
|
-
//
|
|
705
|
-
//
|
|
706
|
-
|
|
707
|
-
|
|
708
|
-
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
|
|
712
|
-
(
|
|
713
|
-
|
|
714
|
-
|
|
715
|
-
|
|
716
|
-
|
|
717
|
-
|
|
718
|
-
|
|
719
|
-
//
|
|
720
|
-
//
|
|
721
|
-
//
|
|
722
|
-
//
|
|
723
|
-
//
|
|
724
|
-
//
|
|
725
|
-
|
|
726
|
-
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
736
|
-
|
|
737
|
-
|
|
738
|
-
|
|
739
|
-
//
|
|
740
|
-
//
|
|
741
|
-
//
|
|
742
|
-
//
|
|
743
|
-
|
|
744
|
-
|
|
745
|
-
|
|
746
|
-
|
|
747
|
-
|
|
748
|
-
|
|
749
|
-
|
|
750
|
-
|
|
751
|
-
|
|
752
|
-
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
|
|
760
|
-
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
|
|
765
|
-
|
|
766
|
-
|
|
767
|
-
|
|
768
|
-
|
|
769
|
-
|
|
770
|
-
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
|
|
790
|
-
|
|
791
|
-
|
|
792
|
-
|
|
793
|
-
|
|
794
|
-
|
|
795
|
-
|
|
796
|
-
|
|
797
|
-
|
|
798
|
-
|
|
799
|
-
|
|
800
|
-
|
|
801
|
-
|
|
802
|
-
|
|
803
|
-
|
|
804
|
-
|
|
805
|
-
|
|
806
|
-
|
|
807
|
-
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
811
|
-
|
|
812
|
-
|
|
813
|
-
|
|
814
|
-
|
|
815
|
-
|
|
816
|
-
|
|
817
|
-
|
|
818
|
-
|
|
819
|
-
|
|
820
|
-
|
|
821
|
-
|
|
822
|
-
|
|
823
|
-
|
|
824
|
-
|
|
825
|
-
|
|
826
|
-
|
|
827
|
-
|
|
828
|
-
|
|
829
|
-
//
|
|
830
|
-
//
|
|
831
|
-
//
|
|
832
|
-
|
|
833
|
-
|
|
834
|
-
|
|
835
|
-
|
|
836
|
-
|
|
837
|
-
|
|
838
|
-
|
|
839
|
-
|
|
840
|
-
|
|
841
|
-
|
|
842
|
-
|
|
843
|
-
|
|
844
|
-
|
|
845
|
-
|
|
846
|
-
|
|
847
|
-
//
|
|
848
|
-
|
|
849
|
-
//
|
|
850
|
-
//
|
|
851
|
-
// the
|
|
852
|
-
//
|
|
853
|
-
//
|
|
854
|
-
//
|
|
855
|
-
//
|
|
856
|
-
state.
|
|
857
|
-
|
|
858
|
-
|
|
859
|
-
|
|
860
|
-
|
|
861
|
-
|
|
862
|
-
|
|
863
|
-
|
|
864
|
-
|
|
865
|
-
|
|
866
|
-
|
|
867
|
-
|
|
868
|
-
|
|
869
|
-
|
|
870
|
-
|
|
871
|
-
|
|
872
|
-
|
|
873
|
-
|
|
874
|
-
|
|
875
|
-
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
}
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
905
|
-
|
|
906
|
-
|
|
907
|
-
|
|
908
|
-
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
912
|
-
|
|
913
|
-
|
|
914
|
-
|
|
915
|
-
|
|
916
|
-
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
921
|
-
|
|
922
|
-
|
|
923
|
-
|
|
924
|
-
|
|
925
|
-
|
|
926
|
-
|
|
927
|
-
|
|
928
|
-
|
|
929
|
-
|
|
930
|
-
|
|
931
|
-
|
|
932
|
-
|
|
933
|
-
|
|
934
|
-
|
|
935
|
-
|
|
936
|
-
|
|
937
|
-
|
|
938
|
-
|
|
939
|
-
//
|
|
940
|
-
|
|
941
|
-
|
|
942
|
-
|
|
943
|
-
|
|
944
|
-
|
|
945
|
-
|
|
946
|
-
|
|
947
|
-
|
|
948
|
-
|
|
949
|
-
|
|
950
|
-
|
|
951
|
-
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
|
|
955
|
-
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
963
|
-
|
|
964
|
-
|
|
965
|
-
|
|
966
|
-
const
|
|
967
|
-
|
|
968
|
-
|
|
969
|
-
|
|
970
|
-
|
|
971
|
-
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
|
|
976
|
-
|
|
977
|
-
}
|
|
978
|
-
|
|
979
|
-
|
|
980
|
-
|
|
981
|
-
`
|
|
982
|
-
);
|
|
983
|
-
}
|
|
984
|
-
|
|
985
|
-
|
|
986
|
-
|
|
987
|
-
|
|
988
|
-
|
|
989
|
-
|
|
990
|
-
|
|
991
|
-
|
|
992
|
-
|
|
993
|
-
|
|
994
|
-
|
|
995
|
-
|
|
996
|
-
const
|
|
997
|
-
|
|
998
|
-
|
|
999
|
-
|
|
1000
|
-
|
|
1001
|
-
|
|
1002
|
-
|
|
1003
|
-
|
|
1004
|
-
|
|
1005
|
-
|
|
1006
|
-
|
|
1007
|
-
|
|
1008
|
-
|
|
1009
|
-
|
|
1010
|
-
|
|
1011
|
-
|
|
1012
|
-
|
|
1013
|
-
|
|
1014
|
-
|
|
1015
|
-
|
|
1016
|
-
|
|
1017
|
-
|
|
1018
|
-
|
|
1019
|
-
|
|
1020
|
-
|
|
1021
|
-
|
|
1022
|
-
|
|
1023
|
-
|
|
1024
|
-
|
|
1025
|
-
|
|
1026
|
-
|
|
1027
|
-
|
|
1028
|
-
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
const
|
|
1033
|
-
|
|
1034
|
-
|
|
1035
|
-
|
|
1036
|
-
|
|
1037
|
-
|
|
1038
|
-
|
|
1039
|
-
|
|
1040
|
-
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
if (!(decodeCostSec > 0)) {
|
|
1045
|
-
// The encode half already accounts for everything measured. Nothing is
|
|
1046
|
-
// left to attribute to decoding, and a zero or negative cost would say
|
|
1047
|
-
// decoding is free, which is a claim this reading cannot support.
|
|
1048
|
-
return;
|
|
1049
|
-
}
|
|
1050
|
-
const key = session.file.key;
|
|
1051
|
-
const known = this.#decodeCost.get(key);
|
|
1052
|
-
const readings = [...(known?.readings ?? []), decodeCostSec].slice(-READINGS_KEPT);
|
|
1053
|
-
const costSec = medianOf(readings);
|
|
1054
|
-
if (!movedBeyondScatter(known?.costSec ?? null, costSec, readings)) {
|
|
1055
|
-
// The same answer as before, by the readings' own scatter. Storing it
|
|
1056
|
-
// would bump the version and make every session recompute its offer,
|
|
1057
|
-
// which is asked for on the path that serves every playlist, init and
|
|
1058
|
-
// segment.
|
|
1059
|
-
this.#decodeCost.set(key, { ...known, readings });
|
|
1060
|
-
return;
|
|
1061
|
-
}
|
|
1062
|
-
this.#decodeCost.set(key, { costSec, readings, version: (known?.version ?? 0) + 1 });
|
|
1063
|
-
logger.info(
|
|
1064
|
-
`transcode: ${session.file.name} decodes at ${(1 / costSec).toFixed(2)}x on this host ` +
|
|
1065
|
-
`(median of ${readings.length}, latest ${(1 / decodeCostSec).toFixed(2)}x from ${height}p ` +
|
|
1066
|
-
`at ${speed.toFixed(2)}x, preset ${session.output.softwarePreset})`
|
|
1067
|
-
);
|
|
1068
|
-
}
|
|
1069
|
-
|
|
1070
|
-
/**
|
|
1071
|
-
* The speed this run is making RIGHT NOW, or null when nothing recent enough
|
|
1072
|
-
* says.
|
|
1073
|
-
*
|
|
1074
|
-
* Read as the slope between two progress reports, never as ffmpeg's own
|
|
1075
|
-
* `speed=`. That figure is cumulative — output time over wall time since the
|
|
1076
|
-
* run began — so a run starved of torrent data early carries the average of
|
|
1077
|
-
* that starvation for the rest of its life. Measured 2026-08-21: a run whose
|
|
1078
|
-
* progress lines showed 1.30x at that moment (13 s of video in 10.02 s of
|
|
1079
|
-
* clock) still reported a cumulative 0.39x from four minutes on a ~100 KB/s
|
|
1080
|
-
* swarm, and the budget stepped the picture down on it. The same mistake was
|
|
1081
|
-
* found and solved once already — the startup decode benchmark reads the
|
|
1082
|
-
* slope between two progress reports for exactly this reason.
|
|
1083
|
-
*
|
|
1084
|
-
* @param {HlsSession} session
|
|
1085
|
-
* @param {number} now
|
|
1086
|
-
* @returns {number | null}
|
|
1087
|
-
*/
|
|
1088
|
-
recentSpeedOf(session, now, withinMs) {
|
|
1089
|
-
return this.recentSpeedReadingOf(session, now, withinMs)?.speed ?? null;
|
|
1090
|
-
}
|
|
1091
|
-
|
|
1092
|
-
/**
|
|
1093
|
-
* The newest measured speed from the output's current or most recent run.
|
|
1094
|
-
* Its measurement time lets the playback model project the observed trend
|
|
1095
|
-
* without imposing a separate freshness window.
|
|
1096
|
-
*
|
|
1097
|
-
* @param {HlsSession} session
|
|
1098
|
-
* @returns {{ speed: number, at: number } | null}
|
|
1099
|
-
*/
|
|
1100
|
-
latestSpeedReadingOf(session) {
|
|
1101
|
-
const reading = qualityStateOf(session).recentSpeed;
|
|
1102
|
-
if (!reading || !this.#runsFor(session).includes(reading.run)) {
|
|
1103
|
-
return null;
|
|
1104
|
-
}
|
|
1105
|
-
return { speed: reading.speed, at: reading.at };
|
|
1106
|
-
}
|
|
1107
|
-
|
|
1108
|
-
/**
|
|
1109
|
-
* The current output's measured production speed, with the time it was
|
|
1110
|
-
* measured. The caller can use the same observation in a trend without
|
|
1111
|
-
* treating repeated progress polls as new samples.
|
|
1112
|
-
*
|
|
1113
|
-
* @param {HlsSession} session
|
|
1114
|
-
* @param {number} now
|
|
1115
|
-
* @param {number} withinMs
|
|
1116
|
-
* @returns {{ speed: number, at: number } | null}
|
|
1117
|
-
*/
|
|
1118
|
-
recentSpeedReadingOf(session, now, withinMs) {
|
|
1119
|
-
const reading = this.latestSpeedReadingOf(session);
|
|
1120
|
-
// Stale by whatever the asker calls stale — two of its own ticks, for the
|
|
1121
|
-
// budget loop, which takes a fresh reading every pass anyway. A reading
|
|
1122
|
-
// older than that is not about the machine as it stands.
|
|
1123
|
-
if (!reading || now - reading.at > withinMs) {
|
|
1124
|
-
return null;
|
|
1125
|
-
}
|
|
1126
|
-
return reading;
|
|
1127
|
-
}
|
|
1128
|
-
|
|
1129
|
-
/**
|
|
1130
|
-
* Realtime budget (software encoder only): choose the output resolution AND
|
|
1131
|
-
* libx264 preset this host can encode faster than realtime, from the startup
|
|
1132
|
-
* benchmark. The ceiling is the client-requested box capped to the source
|
|
1133
|
-
* (never upscaled); the budget picks the highest resolution rung at or below
|
|
1134
|
-
* that ceiling that clears realtime × margin, then the best preset at that
|
|
1135
|
-
* resolution. On a weak host this downscales below the client target instead
|
|
1136
|
-
* of dropping into sub-realtime playback. Returns null when not applicable
|
|
1137
|
-
* (no video transcode, hardware encoder, or missing benchmark/source size) —
|
|
1138
|
-
* the encode then keeps the ceiling resolution and the default preset.
|
|
1139
|
-
*
|
|
1140
|
-
* @param {{ transcodeVideo: boolean, targetWidth: number, targetHeight: number, sourceWidth: number | null, sourceHeight: number | null, outputFps: number, source?: { megapixelsPerSecond: number, megabitsPerSecond: number } | null }} params
|
|
1141
|
-
* @returns {{ width: number, height: number, preset: string } | null}
|
|
1142
|
-
*/
|
|
1143
|
-
chooseEncodeBudget({
|
|
1144
|
-
transcodeVideo,
|
|
1145
|
-
targetWidth,
|
|
1146
|
-
targetHeight,
|
|
1147
|
-
sourceWidth,
|
|
1148
|
-
sourceHeight,
|
|
1149
|
-
outputFps,
|
|
1150
|
-
source = null,
|
|
1151
|
-
requiredSpeed = null
|
|
1152
|
-
}) {
|
|
1153
|
-
if (!transcodeVideo || this.#host().encoderKind !== "software" || !this.#host().benchmark) {
|
|
1154
|
-
return null;
|
|
1155
|
-
}
|
|
1156
|
-
const ceiling = computeOutputDimensions(targetWidth, targetHeight, sourceWidth, sourceHeight);
|
|
1157
|
-
if (!ceiling) {
|
|
1158
|
-
return null;
|
|
1159
|
-
}
|
|
1160
|
-
return chooseSoftwareEncodeSettings(
|
|
1161
|
-
this.#host().benchmark,
|
|
1162
|
-
{ width: ceiling.w, height: ceiling.h },
|
|
1163
|
-
outputFps,
|
|
1164
|
-
{ decodeModel: this.#host().decodeModel, source, requiredSpeed }
|
|
1165
|
-
);
|
|
1166
|
-
}
|
|
1167
|
-
}
|
|
1
|
+
/**
|
|
2
|
+
* @file What encoding this file costs THIS machine, and which heights follow.
|
|
3
|
+
*
|
|
4
|
+
* One subject: seconds of work per second of video. Everything here is that
|
|
5
|
+
* question asked about something — a picture being re-encoded, a soundtrack, a
|
|
6
|
+
* copy, everything running beside the rung being judged — and the last method
|
|
7
|
+
* turns the answers into the list of heights the machine can hold.
|
|
8
|
+
*
|
|
9
|
+
* It decides what a viewer is offered, so being wrong in either direction costs
|
|
10
|
+
* them: too generous and they are given a rung that runs below realtime, which
|
|
11
|
+
* is a slideshow; too mean and they are refused quality the host could hold.
|
|
12
|
+
*
|
|
13
|
+
* Nothing here is chosen. Every figure is a measurement — the startup
|
|
14
|
+
* benchmarks, what an encoder has since been seen doing on this very file, what
|
|
15
|
+
* a second job costs on this host, what share of the machine is free — and where
|
|
16
|
+
* a term has not been measured it contributes nothing rather than a guess.
|
|
17
|
+
*
|
|
18
|
+
* What it is given, and why each is passed rather than reached for: which
|
|
19
|
+
* sessions belong to one file (`outputs`), the host's own readings, how many
|
|
20
|
+
* encoders are running, what the file costs merely by being fetched, and whether
|
|
21
|
+
* a slow run is short of the machine or short of the swarm. The learned costs it
|
|
22
|
+
* holds itself: they are what an encoder taught it, and it is their only writer
|
|
23
|
+
* and their only reader.
|
|
24
|
+
*
|
|
25
|
+
* **Learning them lives here too, and it did not until 2026-09-15.** The three
|
|
26
|
+
* methods that turn a reading off a running encoder into a price were methods of
|
|
27
|
+
* the session manager, writing into these maps from outside — so a fact had one
|
|
28
|
+
* keeper and a different author, and the maps had to be public for it. They are
|
|
29
|
+
* private now, and what leaves this class is an answer rather than a store.
|
|
30
|
+
*/
|
|
31
|
+
|
|
32
|
+
/**
|
|
33
|
+
* Which cost a speed reading from this session is a measurement OF.
|
|
34
|
+
*
|
|
35
|
+
* Three encodes share one reading path and price three different things: a
|
|
36
|
+
* soundtrack published on its own, a picture being re-encoded (whose reading
|
|
37
|
+
* prices this source's DECODING, the encode half being known from the startup
|
|
38
|
+
* benchmark), and a picture being copied (which prices copying).
|
|
39
|
+
*
|
|
40
|
+
* Exported because the routing is where the fault was: a rendition was refused
|
|
41
|
+
* a reading by one guard while the call that would have priced it sat behind
|
|
42
|
+
* another, so the soundtrack was charged at nothing no matter how long it ran.
|
|
43
|
+
* A pure function makes that a test rather than a field session.
|
|
44
|
+
*
|
|
45
|
+
* @param {{ audioOnly?: boolean, transcodeVideo?: boolean }} session
|
|
46
|
+
* @returns {"audio" | "decode" | "copy"}
|
|
47
|
+
*/
|
|
48
|
+
export function costKindForSession(session) {
|
|
49
|
+
if (session?.spec?.carries === "audio-only") {
|
|
50
|
+
return "audio";
|
|
51
|
+
}
|
|
52
|
+
return session?.spec?.transcodesVideo === true ? "decode" : "copy";
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
import { correctForAvailability } from "../available-share.js";
|
|
56
|
+
import { medianOf, movedBeyondScatter, READINGS_KEPT } from "../learned-median.js";
|
|
57
|
+
import { contentionPenalty } from "../contention.js";
|
|
58
|
+
import { ENCODE_RUN_STATE, liveRunsOf, processCanBeSignalled } from "../encode-run-state.js";
|
|
59
|
+
import { canSustainOutput, chooseSoftwareEncodeSettings, speedBar } from "../hwaccel.js";
|
|
60
|
+
import { throughputAt } from "../throughput.js";
|
|
61
|
+
import { computeOutputDimensions, TRANSCODE_FPS } from "../args.js";
|
|
62
|
+
import { logger } from "../../../utils/logger.js";
|
|
63
|
+
import { qualityStateOf } from "./OutputQualityState.js";
|
|
64
|
+
import { audioReadingFor } from "../audio-work-rate.js";
|
|
65
|
+
|
|
66
|
+
export class EncodeCost {
|
|
67
|
+
/**
|
|
68
|
+
* What a soundtrack encoder has been seen to cost, by the key naming that
|
|
69
|
+
* track. Written and read here and nowhere else.
|
|
70
|
+
*
|
|
71
|
+
* @type {Map<string, { costSec: number, readings: number[], version: number }>}
|
|
72
|
+
*/
|
|
73
|
+
#audioCost = new Map();
|
|
74
|
+
|
|
75
|
+
/** What copying a file's picture has been seen to cost. @type {Map<string, { costSec: number, readings: number[], version: number }>} */
|
|
76
|
+
#copyCost = new Map();
|
|
77
|
+
|
|
78
|
+
/** What decoding a file has been seen to cost. @type {Map<string, { costSec: number, readings: number[], version: number }>} */
|
|
79
|
+
#decodeCost = new Map();
|
|
80
|
+
|
|
81
|
+
/**
|
|
82
|
+
* What each height was last predicted to do, kept so a session started at
|
|
83
|
+
* that height can be compared against the prediction once it runs.
|
|
84
|
+
*
|
|
85
|
+
* @type {Map<number, number | null> | null}
|
|
86
|
+
*/
|
|
87
|
+
lastPredictedByHeight = null;
|
|
88
|
+
|
|
89
|
+
notePredictionFor(session, height) {
|
|
90
|
+
qualityStateOf(session).predictedSpeedWhenOffered = this.lastPredictedByHeight?.get(height) ?? null;
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
// The last refusal printed. The offer is recomputed on the path that serves
|
|
94
|
+
// every playlist, init and segment, and the figures behind it move every few
|
|
95
|
+
// seconds — so the line is written when the ANSWER changes, not when it is
|
|
96
|
+
// asked again.
|
|
97
|
+
#lastOfferLine = "";
|
|
98
|
+
|
|
99
|
+
#outputs;
|
|
100
|
+
#host;
|
|
101
|
+
#runningEncoders;
|
|
102
|
+
#encodersRunningNow;
|
|
103
|
+
#torrentCostSecFor;
|
|
104
|
+
#runsFor;
|
|
105
|
+
#stateFor;
|
|
106
|
+
|
|
107
|
+
/**
|
|
108
|
+
* @param {{
|
|
109
|
+
* outputs: import("../output/OutputCatalog.js").OutputCatalog,
|
|
110
|
+
* host: () => { benchmark: object[] | null, decodeModel: object | null, contentionPenalties: object | null, copySpeedX: number | null, availability: { known: boolean, share: number } | null, encoderKind: string | null },
|
|
111
|
+
* runningEncoders: () => number,
|
|
112
|
+
* encodersRunningNow: () => number,
|
|
113
|
+
* torrentCostSecFor: (session: object) => number,
|
|
114
|
+
* runsFor: (output: object) => object[],
|
|
115
|
+
* stateFor: (output: object) => string
|
|
116
|
+
* }} deps
|
|
117
|
+
*/
|
|
118
|
+
constructor({ outputs, host, runningEncoders, encodersRunningNow, torrentCostSecFor, runsFor, stateFor }) {
|
|
119
|
+
this.#outputs = outputs;
|
|
120
|
+
// Asked at the moment of the question, not copied: the share of the machine
|
|
121
|
+
// that is free is re-read every few seconds, and a copy taken when this was
|
|
122
|
+
// built would price every later rung against a machine that has gone.
|
|
123
|
+
this.#host = host;
|
|
124
|
+
this.#runningEncoders = runningEncoders;
|
|
125
|
+
this.#encodersRunningNow = encodersRunningNow;
|
|
126
|
+
this.#torrentCostSecFor = torrentCostSecFor;
|
|
127
|
+
if (typeof runsFor !== "function") {
|
|
128
|
+
throw new TypeError("EncodeCost requires runsFor");
|
|
129
|
+
}
|
|
130
|
+
if (typeof stateFor !== "function") {
|
|
131
|
+
throw new TypeError("EncodeCost requires stateFor");
|
|
132
|
+
}
|
|
133
|
+
this.#runsFor = runsFor;
|
|
134
|
+
this.#stateFor = stateFor;
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
/**
|
|
138
|
+
* The key naming one soundtrack of one file.
|
|
139
|
+
*
|
|
140
|
+
* Static because it is the NAME of a thing this class stores, not a reading
|
|
141
|
+
* about the machine — and because the offer's cache key needs it too, so a
|
|
142
|
+
* caller that has a session can ask without holding an instance.
|
|
143
|
+
*
|
|
144
|
+
* Named by everything that changes what producing it costs: the file the
|
|
145
|
+
* sound is read from, the track inside that file, and whether it is copied
|
|
146
|
+
* or re-encoded. One track may be copied for one viewer and re-encoded for
|
|
147
|
+
* another, and a copy's speed priced an encode it says nothing about; and a
|
|
148
|
+
* soundtrack shipped as its own file is track 0 of THAT file, which without
|
|
149
|
+
* the file in the name shared a price with the picture's own track 0.
|
|
150
|
+
*
|
|
151
|
+
* @param {{ file: { key: string }, spec?: { audioFileIndex?: number, audioSourceTrackIndex?: number, transcodesAudio?: boolean } }} session
|
|
152
|
+
* @returns {string}
|
|
153
|
+
*/
|
|
154
|
+
static audioKeyOf(session) {
|
|
155
|
+
const spec = session.spec ?? {};
|
|
156
|
+
return `${session.file.key}:a${spec.audioFileIndex ?? ""}:${spec.audioSourceTrackIndex ?? 0}:` +
|
|
157
|
+
`${spec.transcodesAudio === true ? "aac" : "copy"}`;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
/**
|
|
161
|
+
* What decoding this file has been measured to cost, and how many times that
|
|
162
|
+
* answer has changed.
|
|
163
|
+
*
|
|
164
|
+
* @param {string} fileKey
|
|
165
|
+
* @returns {{ costSec: number, version: number } | null}
|
|
166
|
+
*/
|
|
167
|
+
decodeCostFor(fileKey) {
|
|
168
|
+
const entry = this.#decodeCost.get(fileKey);
|
|
169
|
+
return entry ? { costSec: entry.costSec, version: entry.version } : null;
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
/**
|
|
173
|
+
* How many times the price of COPYING this file has changed.
|
|
174
|
+
*
|
|
175
|
+
* Asked by the offer's cache key: everything the answer is derived from has
|
|
176
|
+
* to be in what identifies it, or the menu keeps an answer computed before
|
|
177
|
+
* anything was measured.
|
|
178
|
+
*
|
|
179
|
+
* @param {string} fileKey
|
|
180
|
+
* @returns {number}
|
|
181
|
+
*/
|
|
182
|
+
copyVersionFor(fileKey) {
|
|
183
|
+
return this.#copyCost.get(fileKey)?.version ?? 0;
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
/**
|
|
187
|
+
* How many times the price of this session's soundtrack has changed.
|
|
188
|
+
*
|
|
189
|
+
* @param {object} session
|
|
190
|
+
* @returns {number}
|
|
191
|
+
*/
|
|
192
|
+
audioVersionFor(session) {
|
|
193
|
+
return this.#audioCost.get(EncodeCost.audioKeyOf(session))?.version ?? 0;
|
|
194
|
+
}
|
|
195
|
+
|
|
196
|
+
/**
|
|
197
|
+
* What a running re-encode of the picture costs, in seconds of work per
|
|
198
|
+
* second of video.
|
|
199
|
+
*
|
|
200
|
+
* Measured first: `lastAloneSpeed` is what this very rung did with the
|
|
201
|
+
* machine to itself. Failing that, the encode model that decides every rung —
|
|
202
|
+
* the same benchmark, the same decode term — applied to this rung's own pixel
|
|
203
|
+
* rate. There is no third answer: a rung whose cost cannot be derived at all
|
|
204
|
+
* contributes nothing rather than a number somebody invented.
|
|
205
|
+
*
|
|
206
|
+
* @param {HlsSession} session
|
|
207
|
+
* @returns {number}
|
|
208
|
+
*/
|
|
209
|
+
#pictureCostOf(session) {
|
|
210
|
+
const state = qualityStateOf(session);
|
|
211
|
+
if (Number.isFinite(state.lastAloneSpeed) && state.lastAloneSpeed > 0) {
|
|
212
|
+
return 1 / state.lastAloneSpeed;
|
|
213
|
+
}
|
|
214
|
+
// WHAT AN ENCODE OF THIS MODE WAS SEEN DOING HERE BEFORE, alone, on
|
|
215
|
+
// material no easier than this (roadmap item 97, step 14): the slowest
|
|
216
|
+
// such reading, on this configuration only. It refines the startup
|
|
217
|
+
// prediction; with nothing seen, the prediction stands.
|
|
218
|
+
const seen = Number(this.#host().observedAloneSpeed?.(session));
|
|
219
|
+
if (Number.isFinite(seen) && seen > 0) {
|
|
220
|
+
return 1 / seen;
|
|
221
|
+
}
|
|
222
|
+
const benchmark = this.#host().benchmark;
|
|
223
|
+
const width = Number(session.output.encodeWidth) || 0;
|
|
224
|
+
const height = Number(session.output.encodeHeight) || 0;
|
|
225
|
+
const fps = Number(session.output.outputFps) || TRANSCODE_FPS;
|
|
226
|
+
if (!Array.isArray(benchmark) || benchmark.length === 0 || width <= 0 || height <= 0) {
|
|
227
|
+
return 0;
|
|
228
|
+
}
|
|
229
|
+
const { speed } = canSustainOutput({
|
|
230
|
+
benchmark,
|
|
231
|
+
decodeModel: this.#host().decodeModel,
|
|
232
|
+
source: session.file.decode ?? null,
|
|
233
|
+
outputPixelsPerSec: width * height * fps,
|
|
234
|
+
observedDecodeCostSec: null,
|
|
235
|
+
concurrentCostSec: 0,
|
|
236
|
+
frame: { width, height }
|
|
237
|
+
});
|
|
238
|
+
return Number.isFinite(speed) && speed > 0 ? 1 / speed : 0;
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
/**
|
|
242
|
+
* How fast this machine produces ONE output, in seconds of film per second.
|
|
243
|
+
*
|
|
244
|
+
* THERE IS ALWAYS AN ANSWER, and that is the point of this method. Every
|
|
245
|
+
* decision in the encoding layer is made from arrivals — when would this
|
|
246
|
+
* encoder reach that piece — and an arrival cannot be computed without a
|
|
247
|
+
* speed. A speed that is missing is therefore not a smaller answer, it is no
|
|
248
|
+
* answer at all: the plan then cannot tell a viewer who will be served from
|
|
249
|
+
* one who will be left waiting, and the moment it happens is the cold start,
|
|
250
|
+
* which is when the question matters most.
|
|
251
|
+
*
|
|
252
|
+
* Three sources, most specific first, and every one of them measured:
|
|
253
|
+
*
|
|
254
|
+
* 1. what a run on THIS output has been seen doing. It is this machine, this
|
|
255
|
+
* material and these settings, so nothing beats it;
|
|
256
|
+
* 2. the startup benchmark, for an output whose picture is re-encoded: the
|
|
257
|
+
* preset readings and the decode model, applied to this output's own pixel
|
|
258
|
+
* rate. It exists before any viewer;
|
|
259
|
+
* 3. the startup copy measurement, for an output whose picture is copied.
|
|
260
|
+
* Copying neither decodes nor encodes, so neither of the above describes
|
|
261
|
+
* it, and until it was measured this branch had no figure at all.
|
|
262
|
+
*
|
|
263
|
+
* @param {string} address - The output, as the encoding layer names it.
|
|
264
|
+
* @returns {number} Seconds of film per second. Zero only where the host
|
|
265
|
+
* measured nothing at all, which is a broken startup rather than a state to
|
|
266
|
+
* plan around.
|
|
267
|
+
*/
|
|
268
|
+
speedForOutput(address) {
|
|
269
|
+
const outputs = this.#outputs.outputsOn(address);
|
|
270
|
+
let measured = 0;
|
|
271
|
+
for (const session of outputs) {
|
|
272
|
+
const speed = Number(qualityStateOf(session).lastAloneSpeed);
|
|
273
|
+
if (Number.isFinite(speed) && speed > measured) {
|
|
274
|
+
measured = speed;
|
|
275
|
+
}
|
|
276
|
+
}
|
|
277
|
+
if (measured > 0) {
|
|
278
|
+
return measured;
|
|
279
|
+
}
|
|
280
|
+
for (const session of outputs) {
|
|
281
|
+
if (session.spec.transcodesVideo) {
|
|
282
|
+
const cost = this.#pictureCostOf(session);
|
|
283
|
+
if (cost > 0) {
|
|
284
|
+
return 1 / cost;
|
|
285
|
+
}
|
|
286
|
+
continue;
|
|
287
|
+
}
|
|
288
|
+
const copying = Number(this.#host().copySpeedX);
|
|
289
|
+
if (Number.isFinite(copying) && copying > 0) {
|
|
290
|
+
return copying;
|
|
291
|
+
}
|
|
292
|
+
}
|
|
293
|
+
return 0;
|
|
294
|
+
}
|
|
295
|
+
|
|
296
|
+
/**
|
|
297
|
+
* What one encoder on this output costs the machine, in seconds of work per
|
|
298
|
+
* second of film, and what its file costs simply by being fetched.
|
|
299
|
+
*
|
|
300
|
+
* The unit the quality offer already judges every step in, so that "may one
|
|
301
|
+
* more encoder run" and "may this height be offered" are the same arithmetic
|
|
302
|
+
* and cannot disagree. Three kinds, priced from what each was seen doing:
|
|
303
|
+
*
|
|
304
|
+
* 1. a soundtrack, from its own measured speed;
|
|
305
|
+
* 2. a copied picture, from its own measured speed, and otherwise from the
|
|
306
|
+
* startup copy measurement;
|
|
307
|
+
* 3. a re-encoded picture, from what it did alone, and otherwise from the
|
|
308
|
+
* encode model applied to its own pixel rate.
|
|
309
|
+
*
|
|
310
|
+
* NULL WHEN NOTHING HAS PRICED IT, and never a guess: a soundtrack nobody has
|
|
311
|
+
* measured yet contributes nothing, as it does to the offer. The caller says
|
|
312
|
+
* so rather than inventing a figure.
|
|
313
|
+
*
|
|
314
|
+
* @param {string} address - The output, as the encoding layer names it.
|
|
315
|
+
* @returns {{ costSec: number | null, fileKey: string, fileCostSec: number } | null}
|
|
316
|
+
* Null when no output of that address is here.
|
|
317
|
+
*/
|
|
318
|
+
loadOfOutput(address) {
|
|
319
|
+
const session = this.#outputs.outputsOn(address)[0] ?? null;
|
|
320
|
+
if (!session) {
|
|
321
|
+
return null;
|
|
322
|
+
}
|
|
323
|
+
return this.#loadOfSession(session);
|
|
324
|
+
}
|
|
325
|
+
|
|
326
|
+
/**
|
|
327
|
+
* What a not-yet-opened output would cost, priced by the same readings and
|
|
328
|
+
* rules as an output already in the catalogue. This lets the machine-wide
|
|
329
|
+
* admission answer before the format is committed, so AUTO can select a
|
|
330
|
+
* lower rung that the whole host can sustain.
|
|
331
|
+
*
|
|
332
|
+
* @param {object} spec
|
|
333
|
+
* @param {object} file
|
|
334
|
+
* @returns {{ costSec: number | null, fileKey: string, fileCostSec: number } | null}
|
|
335
|
+
*/
|
|
336
|
+
loadForCandidate(spec, file) {
|
|
337
|
+
if (!spec || !file) {
|
|
338
|
+
return null;
|
|
339
|
+
}
|
|
340
|
+
const encode = spec.video?.encode ?? null;
|
|
341
|
+
const candidate = {
|
|
342
|
+
spec,
|
|
343
|
+
file,
|
|
344
|
+
output: {
|
|
345
|
+
encodeWidth: Number(encode?.width) || 0,
|
|
346
|
+
encodeHeight: Number(encode?.height) || 0,
|
|
347
|
+
outputFps: Number(encode?.fps) || TRANSCODE_FPS
|
|
348
|
+
}
|
|
349
|
+
};
|
|
350
|
+
return this.#loadOfSession(candidate);
|
|
351
|
+
}
|
|
352
|
+
|
|
353
|
+
#loadOfSession(session) {
|
|
354
|
+
const fileKey = session.file?.key ?? "";
|
|
355
|
+
const fileCost = Number(this.#torrentCostSecFor(session));
|
|
356
|
+
const fileCostSec = Number.isFinite(fileCost) && fileCost > 0 ? fileCost : 0;
|
|
357
|
+
const measured = Number(qualityStateOf(session).lastAloneSpeed);
|
|
358
|
+
if (Number.isFinite(measured) && measured > 0) {
|
|
359
|
+
return { costSec: 1 / measured, fileKey, fileCostSec };
|
|
360
|
+
}
|
|
361
|
+
if (session.spec.carries === "audio-only") {
|
|
362
|
+
const audio = this.#audioCost.get(EncodeCost.audioKeyOf(session));
|
|
363
|
+
const initial = audioReadingFor(this.#host().audioCalibration, {
|
|
364
|
+
...this.#host().audioDescriptionOf?.(session),
|
|
365
|
+
codec: this.#host().audioDescriptionOf?.(session)?.codec ?? session.file.media?.audioCodec,
|
|
366
|
+
transcode: session.spec.audio?.transcode === true
|
|
367
|
+
});
|
|
368
|
+
const initialSpeed = initial?.speed;
|
|
369
|
+
return { costSec: audio && audio.costSec > 0 ? audio.costSec :
|
|
370
|
+
initialSpeed > 0 ? 1 / initialSpeed : null, fileKey, fileCostSec };
|
|
371
|
+
}
|
|
372
|
+
if (!session.spec.transcodesVideo) {
|
|
373
|
+
const copy = this.#copyCost.get(session.file.key);
|
|
374
|
+
if (copy && copy.costSec > 0) {
|
|
375
|
+
return { costSec: copy.costSec, fileKey, fileCostSec };
|
|
376
|
+
}
|
|
377
|
+
const copying = Number(this.#host().copySpeedX);
|
|
378
|
+
return { costSec: Number.isFinite(copying) && copying > 0 ? 1 / copying : null, fileKey, fileCostSec };
|
|
379
|
+
}
|
|
380
|
+
const picture = this.#pictureCostOf(session);
|
|
381
|
+
return { costSec: picture > 0 ? picture : null, fileKey, fileCostSec };
|
|
382
|
+
}
|
|
383
|
+
|
|
384
|
+
/** A prediction for this operation, using its measured cost and actual contention. */
|
|
385
|
+
projectedSpeedOf(session) {
|
|
386
|
+
const load = this.#loadOfSession(session);
|
|
387
|
+
const others = Math.max(0, this.#runningEncoders() - this.#runsFor(session).length);
|
|
388
|
+
const { penalty } = contentionPenalty(others, this.#host().contentionPenalties);
|
|
389
|
+
return load.costSec > 0 ? correctForAvailability(1 / (load.costSec * penalty),
|
|
390
|
+
this.#host().availability) : null;
|
|
391
|
+
}
|
|
392
|
+
|
|
393
|
+
/**
|
|
394
|
+
* What everything OTHER than this session is costing right now, or null when
|
|
395
|
+
* any of it is unpriced.
|
|
396
|
+
*
|
|
397
|
+
* Used to recover a soundtrack's own share from a reading taken beside the
|
|
398
|
+
* picture — the only kind of reading a rendition ever gives, since it runs
|
|
399
|
+
* exactly as long as the picture does. Refusing to answer when something
|
|
400
|
+
* running has no price is the point: unpriced work would otherwise be
|
|
401
|
+
* attributed to the soundtrack, and an overpriced soundtrack refuses quality
|
|
402
|
+
* steps the host could actually hold.
|
|
403
|
+
*
|
|
404
|
+
* @param {HlsSession} session
|
|
405
|
+
* @returns {number | null}
|
|
406
|
+
*/
|
|
407
|
+
pricedConcurrentCost(session) {
|
|
408
|
+
let cost = 0;
|
|
409
|
+
for (const member of this.#outputs.familyOf(session)) {
|
|
410
|
+
if (member === session || !processCanBeSignalled(this.#stateFor(member))) {
|
|
411
|
+
continue;
|
|
412
|
+
}
|
|
413
|
+
if (member.spec.carries === "audio-only") {
|
|
414
|
+
const audio = this.#audioCost.get(EncodeCost.audioKeyOf(member));
|
|
415
|
+
if (!audio || !(audio.costSec > 0)) {
|
|
416
|
+
return null;
|
|
417
|
+
}
|
|
418
|
+
cost += audio.costSec;
|
|
419
|
+
continue;
|
|
420
|
+
}
|
|
421
|
+
if (!member.spec.transcodesVideo) {
|
|
422
|
+
const copy = this.#copyCost.get(member.file.key);
|
|
423
|
+
if (!copy || !(copy.costSec > 0)) {
|
|
424
|
+
return null;
|
|
425
|
+
}
|
|
426
|
+
cost += copy.costSec;
|
|
427
|
+
continue;
|
|
428
|
+
}
|
|
429
|
+
const picture = this.#pictureCostOf(member);
|
|
430
|
+
if (!(picture > 0)) {
|
|
431
|
+
return null;
|
|
432
|
+
}
|
|
433
|
+
cost += picture;
|
|
434
|
+
}
|
|
435
|
+
// Encoders outside this family are counted by number only — there is no
|
|
436
|
+
// price to look up for another film's session — so a reading taken while
|
|
437
|
+
// one is running cannot be attributed either.
|
|
438
|
+
return this.#runningEncoders() > this.#outputs.familyOf(session).filter(
|
|
439
|
+
(member) => processCanBeSignalled(this.#stateFor(member))
|
|
440
|
+
).length
|
|
441
|
+
? null
|
|
442
|
+
: cost;
|
|
443
|
+
}
|
|
444
|
+
|
|
445
|
+
/**
|
|
446
|
+
* What each height of this family is costing RIGHT NOW, for the heights an
|
|
447
|
+
* encoder is actually running at.
|
|
448
|
+
*
|
|
449
|
+
* Exists so a height can be judged against what the machine spends on
|
|
450
|
+
* everything else — a step being warmed is running while it is judged, and
|
|
451
|
+
* charged its own cost it refuses itself.
|
|
452
|
+
*
|
|
453
|
+
* @param {HlsSession} session
|
|
454
|
+
* @returns {Map<number, number>}
|
|
455
|
+
*/
|
|
456
|
+
runningCostByHeight(session) {
|
|
457
|
+
/** @type {Map<number, number>} */
|
|
458
|
+
const byHeight = new Map();
|
|
459
|
+
for (const member of this.#outputs.familyOf(session)) {
|
|
460
|
+
if (member.spec.carries === "audio-only" || !member.spec.transcodesVideo) {
|
|
461
|
+
continue;
|
|
462
|
+
}
|
|
463
|
+
if (!processCanBeSignalled(this.#stateFor(member))) {
|
|
464
|
+
continue;
|
|
465
|
+
}
|
|
466
|
+
const height = this.#outputs.variantHeightOf(member);
|
|
467
|
+
if (height > 0) {
|
|
468
|
+
byHeight.set(height, (byHeight.get(height) ?? 0) + this.#pictureCostOf(member));
|
|
469
|
+
}
|
|
470
|
+
}
|
|
471
|
+
return byHeight;
|
|
472
|
+
}
|
|
473
|
+
|
|
474
|
+
/**
|
|
475
|
+
* Seconds of work per second of video this family is ALREADY committed to,
|
|
476
|
+
* beside any rung being considered.
|
|
477
|
+
*
|
|
478
|
+
* Every encoder of the family that is actually running: the picture, whether
|
|
479
|
+
* it is copied or re-encoded, and each audio rendition. The rung the viewer
|
|
480
|
+
* is watching and the source's own copied height are never withdrawn by the
|
|
481
|
+
* caller, so charging for the encoder that serves them cannot strand anyone —
|
|
482
|
+
* what it does is stop the NEXT rung being offered as though the machine were
|
|
483
|
+
* idle, which is what the field disproved on 2026-08-15.
|
|
484
|
+
*
|
|
485
|
+
* Anything whose cost is neither measured nor derivable contributes nothing.
|
|
486
|
+
* A guess here would refuse rungs on arithmetic nobody performed.
|
|
487
|
+
*
|
|
488
|
+
* @param {HlsSession} session
|
|
489
|
+
* @returns {number}
|
|
490
|
+
*/
|
|
491
|
+
committedCostOf(session) {
|
|
492
|
+
let cost = 0;
|
|
493
|
+
for (const member of this.#outputs.familyOf(session)) {
|
|
494
|
+
// Only what still HAS an encoder. A quality step the viewer left keeps
|
|
495
|
+
// its session and its segments but not a process, and it produces nothing
|
|
496
|
+
// for anybody — charging the machine for it would refuse steps on work
|
|
497
|
+
// nobody is doing.
|
|
498
|
+
//
|
|
499
|
+
// A SUSPENDED encoder is charged, deliberately, and this is not the same
|
|
500
|
+
// question. The unit here is seconds of work per second of VIDEO, not per
|
|
501
|
+
// second of wall clock: a copy running at 8x costs 0.125 s/s whether it
|
|
502
|
+
// is producing right now or parked by the look-ahead cap, because over an
|
|
503
|
+
// hour of watching it still produces an hour of video. Suspension is how
|
|
504
|
+
// that cost is spread, not a discount on it — and pricing a parked
|
|
505
|
+
// encoder at zero would offer a step on the strength of a pause that ends
|
|
506
|
+
// the moment the viewer catches up.
|
|
507
|
+
if (!processCanBeSignalled(this.#stateFor(member))) {
|
|
508
|
+
continue;
|
|
509
|
+
}
|
|
510
|
+
if (member.spec.carries === "audio-only") {
|
|
511
|
+
// A soundtrack encoder, priced from its own measured speed. Nothing is
|
|
512
|
+
// charged for a track nobody has measured: a guess here refuses rungs
|
|
513
|
+
// on arithmetic no one performed.
|
|
514
|
+
const audio = this.#audioCost.get(EncodeCost.audioKeyOf(member));
|
|
515
|
+
cost += audio && audio.costSec > 0 ? audio.costSec : 0;
|
|
516
|
+
continue;
|
|
517
|
+
}
|
|
518
|
+
if (!member.spec.transcodesVideo) {
|
|
519
|
+
const observed = this.#copyCost.get(member.file.key);
|
|
520
|
+
cost += observed && observed.costSec > 0 ? observed.costSec : 0;
|
|
521
|
+
continue;
|
|
522
|
+
}
|
|
523
|
+
// A picture being RE-ENCODED beside the rung being judged — the warm-up
|
|
524
|
+
// that makes a quality switch seamless is two encoders by design, and
|
|
525
|
+
// that overlap is exactly where the field measured 0.504x on a rung
|
|
526
|
+
// predicted at 1.58x (2026-08-15). Priced by what it has been SEEN doing
|
|
527
|
+
// when it had the machine to itself, and otherwise by the same model that
|
|
528
|
+
// judges every rung — which is a prediction, not a guess.
|
|
529
|
+
cost += this.#pictureCostOf(member);
|
|
530
|
+
}
|
|
531
|
+
// And what the FILE costs simply by being fetched and delivered while it is
|
|
532
|
+
// watched: a viewer consumes it at its own byte rate, and every one of
|
|
533
|
+
// those bytes is downloaded, verified and pushed by this process. Priced
|
|
534
|
+
// per megabyte from readings taken while nothing was encoding, so the two
|
|
535
|
+
// measurements do not contain each other.
|
|
536
|
+
cost += this.#torrentCostSecFor(session);
|
|
537
|
+
return cost;
|
|
538
|
+
}
|
|
539
|
+
|
|
540
|
+
/**
|
|
541
|
+
* The speed each rung of this family was last seen running at, when it was
|
|
542
|
+
* running alone.
|
|
543
|
+
*
|
|
544
|
+
* A rung that has been watched failing is refused on that evidence; a rung
|
|
545
|
+
* nobody has run says nothing about itself and is judged by the startup
|
|
546
|
+
* measurement like any other.
|
|
547
|
+
*
|
|
548
|
+
* @param {HlsSession} base
|
|
549
|
+
* @returns {Map<number, number>}
|
|
550
|
+
*/
|
|
551
|
+
measuredRungSpeeds(base) {
|
|
552
|
+
/** @type {Map<number, number>} */
|
|
553
|
+
const speeds = new Map();
|
|
554
|
+
for (const session of this.#outputs.familyOf(base)) {
|
|
555
|
+
const speed = qualityStateOf(session).lastAloneSpeed;
|
|
556
|
+
if (!session.spec.transcodesVideo || !Number.isFinite(speed)) {
|
|
557
|
+
continue;
|
|
558
|
+
}
|
|
559
|
+
const height = this.#outputs.variantHeightOf(session);
|
|
560
|
+
if (height > 0) {
|
|
561
|
+
speeds.set(height, speed);
|
|
562
|
+
}
|
|
563
|
+
}
|
|
564
|
+
return speeds;
|
|
565
|
+
}
|
|
566
|
+
|
|
567
|
+
/**
|
|
568
|
+
* Drop the rungs this host cannot hold at realtime.
|
|
569
|
+
*
|
|
570
|
+
* Every rung below the source height is a full re-encode — decode the whole
|
|
571
|
+
* source, encode a smaller picture — and on a weak host that is dearer than
|
|
572
|
+
* the copy it replaces. Measured 2026-08-14: 1080p was copied at 7.8-8.9x
|
|
573
|
+
* while the offered 240p rung ran at 0.388-0.947x, its first segment took
|
|
574
|
+
* 30 s and later ones were held 22 s, so choosing a LOWER quality is what
|
|
575
|
+
* broke playback. A rung that cannot be produced faster than it is watched
|
|
576
|
+
* must not be offered at all.
|
|
577
|
+
*
|
|
578
|
+
* The session's OWN height always stays: an encoder is already producing it,
|
|
579
|
+
* and removing it would point the player at a rung nobody is encoding.
|
|
580
|
+
*
|
|
581
|
+
* @param {{ heights: number[], ownHeight: number, sourceWidth: number, sourceHeight: number, fps: number, source: { megapixelsPerSecond: number, megabitsPerSecond: number } | null, transcodeVideo: boolean }} params
|
|
582
|
+
* @returns {number[]}
|
|
583
|
+
*/
|
|
584
|
+
sustainableHeights({
|
|
585
|
+
heights,
|
|
586
|
+
ownHeight,
|
|
587
|
+
// Every height a viewer has on screen, not one: two viewers of one picture
|
|
588
|
+
// can be on two rungs, and a rung is never withdrawn while somebody is
|
|
589
|
+
// watching it — their next segment would 404 on a stream that is playing.
|
|
590
|
+
playingHeights = new Set(),
|
|
591
|
+
sourceWidth,
|
|
592
|
+
sourceHeight,
|
|
593
|
+
fps,
|
|
594
|
+
source,
|
|
595
|
+
transcodeVideo,
|
|
596
|
+
observedDecodeCostSec = null,
|
|
597
|
+
concurrentCostSec = 0,
|
|
598
|
+
runningCostByHeight = null,
|
|
599
|
+
measuredHeights = null,
|
|
600
|
+
requiredSpeed = null
|
|
601
|
+
}) {
|
|
602
|
+
// What this file's own supply demands, measured by its reader — and
|
|
603
|
+
// realtime while it has not been measured. Read once here so the line that
|
|
604
|
+
// reports a refusal names the figure it refused against.
|
|
605
|
+
const bar = speedBar(requiredSpeed);
|
|
606
|
+
const benchmark = this.#host().benchmark;
|
|
607
|
+
// CALIBRATED WITH NOTHING QUALIFIED is not the same as not calibrated at
|
|
608
|
+
// all (roadmap item 97, step 14): with no mode of this encoder shown to
|
|
609
|
+
// work, nothing re-encoded is offered.
|
|
610
|
+
const nothingQualified = Array.isArray(benchmark) && benchmark.length === 0;
|
|
611
|
+
if (!Array.isArray(benchmark) || benchmark.length === 0 || sourceHeight <= 0 || sourceWidth <= 0) {
|
|
612
|
+
// Nothing to predict WITH, so nothing is predicted. What has been SEEN
|
|
613
|
+
// still counts: a rung measured running below realtime is withdrawn here
|
|
614
|
+
// too, because the evidence for it does not come from the benchmark. This
|
|
615
|
+
// return used to hand back every height including one measured at 0.4x —
|
|
616
|
+
// found by a check written when this moved out of the session manager,
|
|
617
|
+
// 2026-09-05.
|
|
618
|
+
// The rung on screen is not exempt, for the same reason it is not exempt
|
|
619
|
+
// below: keeping one measured at 0.007x stalls the viewer with no path to
|
|
620
|
+
// a faster rung, which is what the field showed on 2026-08-31.
|
|
621
|
+
//
|
|
622
|
+
// What nothing has priced is not offered either (roadmap item 97, step
|
|
623
|
+
// 14): with no mode of this encoder qualified at startup, only a height
|
|
624
|
+
// that needs no encoder — the copied source — or one an encoder is
|
|
625
|
+
// already seen holding stays.
|
|
626
|
+
return heights.filter((height) => {
|
|
627
|
+
const measured = measuredHeights?.get(height) ?? null;
|
|
628
|
+
if (measured !== null) {
|
|
629
|
+
return measured >= 1;
|
|
630
|
+
}
|
|
631
|
+
return !nothingQualified || (!transcodeVideo && (height === sourceHeight || height === ownHeight));
|
|
632
|
+
});
|
|
633
|
+
}
|
|
634
|
+
/** @type {number[]} */
|
|
635
|
+
const kept = [];
|
|
636
|
+
/** @type {string[]} */
|
|
637
|
+
const dropped = [];
|
|
638
|
+
// What each height was predicted to do on THIS machine, kept so a session
|
|
639
|
+
// started at that height can be compared against it once it runs. The
|
|
640
|
+
// manager holds the last answer, because the offer is computed on the path
|
|
641
|
+
// that serves every request while a session is created elsewhere.
|
|
642
|
+
/** @type {Map<number, number | null>} */
|
|
643
|
+
const predictedByHeight = new Map();
|
|
644
|
+
for (const height of heights) {
|
|
645
|
+
// A rung this session has actually been seen running below realtime is
|
|
646
|
+
// withdrawn on that evidence, whatever the prediction says. This is the
|
|
647
|
+
// one thing a live reading is authority on: itself. It is asked before
|
|
648
|
+
// any exemption so a rung measured failing while on screen does not stay
|
|
649
|
+
// offered because it was on screen when measured — otherwise a step
|
|
650
|
+
// would ask for the one rung this machine has been measured failing at,
|
|
651
|
+
// then fail again, then step down, for ever. A copied source height
|
|
652
|
+
// cannot reach this: `#measuredRungSpeeds` records only sessions that
|
|
653
|
+
// re-encode, so a copy has no reading to be withdrawn on, which is right
|
|
654
|
+
// — it costs no encoder.
|
|
655
|
+
const measured = measuredHeights?.get(height) ?? null;
|
|
656
|
+
if (measured !== null && measured < 1) {
|
|
657
|
+
// Even the rung on screen is withdrawn on measured failure: keeping it
|
|
658
|
+
// would 404 the next segment, but keeping a rung measured at 0.007x
|
|
659
|
+
// (field 2026-08-31, 4K HEVC on CM4) stalls the viewer for minutes with
|
|
660
|
+
// 0.04s buffered and no way to downgrade because every other rung is
|
|
661
|
+
// also dropped. Withdrawing it lets the offer become empty, which the
|
|
662
|
+
// caller turns into an error the viewer can act on (try another proxy
|
|
663
|
+
// or a lower source) instead of an endless spinner.
|
|
664
|
+
dropped.push(`${height}p=${measured.toFixed(2)}x measured`);
|
|
665
|
+
continue;
|
|
666
|
+
}
|
|
667
|
+
// The rung ON SCREEN is kept only when it has not been measured failing
|
|
668
|
+
// above. Keeping a rung measured at 0.007x would stall the viewer with
|
|
669
|
+
// no path to a faster rung, which is what the field showed.
|
|
670
|
+
if (playingHeights.has(height)) {
|
|
671
|
+
kept.push(height);
|
|
672
|
+
continue;
|
|
673
|
+
}
|
|
674
|
+
// The height an encoder is ALREADY producing, and the source's own height
|
|
675
|
+
// when the FAMILY serves it by copy — neither has to be predicted,
|
|
676
|
+
// because it is happening. A copied rung costs no encoder at all, so no
|
|
677
|
+
// measurement of this host can ever be a reason to withdraw it, and the
|
|
678
|
+
// whole point of it is that it is where a viewer on a rung the machine
|
|
679
|
+
// cannot hold goes back to. `transcodeVideo` here is the base's, not the
|
|
680
|
+
// asking session's: a 240p rung re-encodes, and reading its own flag is
|
|
681
|
+
// what withdrew a copied 1080p in the field on 2026-08-15.
|
|
682
|
+
//
|
|
683
|
+
// A source height that would have to be RE-ENCODED is a prediction like
|
|
684
|
+
// any other: on a session whose budget stepped down to 480p, the source's
|
|
685
|
+
// 1080p is neither copied nor being produced, and keeping it unpriced
|
|
686
|
+
// would offer exactly the kind of rung this refuses. Likewise, a rung
|
|
687
|
+
// this session is already producing at 0.007x (field 2026-08-31, 4K HEVC
|
|
688
|
+
// on CM4, 0.1x at 23:45 and 0.007x at 06:57) is not sustainable just
|
|
689
|
+
// because it is running — keeping it offered no path to a faster rung
|
|
690
|
+
// and left the viewer at 0.04s buffered with no downgrade.
|
|
691
|
+
if (
|
|
692
|
+
(height === ownHeight && !transcodeVideo) ||
|
|
693
|
+
(height === sourceHeight && !transcodeVideo)
|
|
694
|
+
) {
|
|
695
|
+
kept.push(height);
|
|
696
|
+
continue;
|
|
697
|
+
}
|
|
698
|
+
const width = Math.round(((sourceWidth / sourceHeight) * height) / 2) * 2;
|
|
699
|
+
// What the machine is spending on everything EXCEPT this height. A step
|
|
700
|
+
// being warmed for a switch is already running while it is judged, so its
|
|
701
|
+
// own cost is inside the committed total — and charged against itself it
|
|
702
|
+
// is counted twice. Measured against the field figures of 2026-08-15
|
|
703
|
+
// that is 1.83x against 1.03x: below the margin, so the step the viewer
|
|
704
|
+
// had just asked for was dropped from the offer by the act of warming it,
|
|
705
|
+
// and its next segment answered 404 on a stream that was playing.
|
|
706
|
+
const concurrentBesideThis = Math.max(
|
|
707
|
+
0,
|
|
708
|
+
concurrentCostSec - (runningCostByHeight?.get(height) ?? 0)
|
|
709
|
+
);
|
|
710
|
+
const { speed } = canSustainOutput({
|
|
711
|
+
benchmark,
|
|
712
|
+
decodeModel: this.#host().decodeModel,
|
|
713
|
+
source,
|
|
714
|
+
outputPixelsPerSec: width * height * fps,
|
|
715
|
+
observedDecodeCostSec,
|
|
716
|
+
concurrentCostSec: concurrentBesideThis,
|
|
717
|
+
frame: { width, height }
|
|
718
|
+
});
|
|
719
|
+
// The benchmark behind that figure was taken on a QUIET host — one
|
|
720
|
+
// ffmpeg and nothing else. The machine a step will actually run on is
|
|
721
|
+
// also running the kernel, the container and whatever else its owner
|
|
722
|
+
// does, and on the addon host that was measured at 99 % busy with a
|
|
723
|
+
// quarter of it unattributed. Only the unattributed part is charged
|
|
724
|
+
// here: our own encoders are already in `concurrentBesideThis` and the
|
|
725
|
+
// proxy's own work is already priced per megabyte moved.
|
|
726
|
+
// Two corrections, and they are different facts about the machine. The
|
|
727
|
+
// availability share removes work nobody has been charged for; the
|
|
728
|
+
// contention penalty says what OUR OWN second job costs, because the
|
|
729
|
+
// budget adds independent prices and this host does not behave that way
|
|
730
|
+
// — the same work measured 2.6× dearer beside one encoder and 3.7×
|
|
731
|
+
// beside two (2026-08-18). `concurrentBesideThis` already counts what is
|
|
732
|
+
// committed; this multiplies by how badly running at all together goes.
|
|
733
|
+
const othersRunning = concurrentBesideThis > 0 ? this.#encodersRunningNow() : 0;
|
|
734
|
+
const { penalty } = contentionPenalty(othersRunning, this.#host().contentionPenalties);
|
|
735
|
+
const onThisMachine = correctForAvailability(
|
|
736
|
+
speed === null ? null : speed / penalty,
|
|
737
|
+
this.#host().availability
|
|
738
|
+
);
|
|
739
|
+
// Kept against the step's own session, so that when it runs the field
|
|
740
|
+
// says what the prediction was worth. Without this the only comparison
|
|
741
|
+
// available is between two figures written minutes apart in different
|
|
742
|
+
// lines of the log.
|
|
743
|
+
predictedByHeight.set(height, onThisMachine);
|
|
744
|
+
if (onThisMachine !== null && onThisMachine >= bar) {
|
|
745
|
+
kept.push(height);
|
|
746
|
+
continue;
|
|
747
|
+
}
|
|
748
|
+
dropped.push(`${height}p=${onThisMachine === null ? "n/a" : `${onThisMachine.toFixed(2)}x`}`);
|
|
749
|
+
}
|
|
750
|
+
// Written when the ANSWER changes, not when the answer is recomputed. This
|
|
751
|
+
// is asked on the path that serves every playlist, init and segment, and
|
|
752
|
+
// the figures behind it move every five seconds — so an unconditional line
|
|
753
|
+
// here is roughly seven hundred identical lines an hour into a forwarder
|
|
754
|
+
// that holds five hundred, which buries whatever is worth reading.
|
|
755
|
+
if (dropped.length > 0) {
|
|
756
|
+
const line =
|
|
757
|
+
`transcode: not offering ${dropped.join(" ")} — below ${bar.toFixed(2)}x ` +
|
|
758
|
+
(Number.isFinite(requiredSpeed) && requiredSpeed > 1
|
|
759
|
+
? "(the speed this file's own interruptions demand) "
|
|
760
|
+
: "(realtime, this file's supply not measured yet) ") +
|
|
761
|
+
// Said with the figures, because a step refused on a busy machine and
|
|
762
|
+
// one refused on an idle machine are different facts about the host.
|
|
763
|
+
(this.#host().availability?.known
|
|
764
|
+
? `on a machine with ${Math.round(this.#host().availability.share * 100)}% to spare `
|
|
765
|
+
: "") +
|
|
766
|
+
`(offering ${kept.map((height) => `${height}p`).join(" ")})`;
|
|
767
|
+
if (line !== this.#lastOfferLine) {
|
|
768
|
+
this.#lastOfferLine = line;
|
|
769
|
+
logger.info(line);
|
|
770
|
+
}
|
|
771
|
+
this.lastPredictedByHeight = predictedByHeight;
|
|
772
|
+
} else {
|
|
773
|
+
this.lastPredictedByHeight = predictedByHeight;
|
|
774
|
+
this.#lastOfferLine = "";
|
|
775
|
+
}
|
|
776
|
+
return kept;
|
|
777
|
+
}
|
|
778
|
+
|
|
779
|
+
/**
|
|
780
|
+
* Take one reading off an encoder that is running, and file it as the price of
|
|
781
|
+
* whatever that encoder is doing.
|
|
782
|
+
*
|
|
783
|
+
* Separate from the realtime budget, which asks a different question — should
|
|
784
|
+
* the quality step down — and answers it only where it CAN step down. Most of
|
|
785
|
+
* what is worth measuring is excluded by that: a rung at the foot of its
|
|
786
|
+
* ladder, a step whose ladder is one rung long, a picture that is copied.
|
|
787
|
+
* Measuring has no such preconditions.
|
|
788
|
+
*
|
|
789
|
+
* The reading is the run's own (`EncodeRun.speedReading`), told once, when
|
|
790
|
+
* the run has measured it: film made between two closed pieces over the
|
|
791
|
+
* run's own working time (`RunClock`), so neither the time it was stopped
|
|
792
|
+
* nor the time its input waited for the swarm enters it.
|
|
793
|
+
*
|
|
794
|
+
* @param {HlsSession} session
|
|
795
|
+
* @param {import("../EncodeRun.js").EncodeRun} run - The run that measured it.
|
|
796
|
+
* @returns {Promise<void>}
|
|
797
|
+
*/
|
|
798
|
+
async learnFrom(session, run) {
|
|
799
|
+
if (!session) {
|
|
800
|
+
return;
|
|
801
|
+
}
|
|
802
|
+
if (
|
|
803
|
+
this.#stateFor(session) === ENCODE_RUN_STATE.ENDED_FAILED ||
|
|
804
|
+
liveRunsOf(this.#runsFor(session)).length === 0 ||
|
|
805
|
+
this.#stateFor(session) === ENCODE_RUN_STATE.SUSPENDED
|
|
806
|
+
) {
|
|
807
|
+
return;
|
|
808
|
+
}
|
|
809
|
+
const speed = run?.speedReading?.speed ?? null;
|
|
810
|
+
if (speed === null) {
|
|
811
|
+
return;
|
|
812
|
+
}
|
|
813
|
+
const state = qualityStateOf(session);
|
|
814
|
+
const kind = costKindForSession(session);
|
|
815
|
+
// A reading taken beside another encoder contains that other encoder's
|
|
816
|
+
// work, and the budget ADDS the same work again when it predicts — so filed
|
|
817
|
+
// as it stands the price is counted twice and grows with every reading.
|
|
818
|
+
// Measured 2026-08-15 in the field: copying, whose truth is 7.9x, was
|
|
819
|
+
// learned as 2.03x, and decoding, whose clips say 2.6x, as 0.87x. Every
|
|
820
|
+
// step was then refused, the offer collapsed to the one copied height, and
|
|
821
|
+
// the viewer lost the quality menu altogether.
|
|
822
|
+
//
|
|
823
|
+
// For a picture the answer is to wait for a moment alone, which comes often
|
|
824
|
+
// enough. For a SOUNDTRACK it never comes: a rendition runs for exactly as
|
|
825
|
+
// long as the picture it accompanies, so "alone" is a state it is never in,
|
|
826
|
+
// and the price stayed unmeasured for ever — the hole this was meant to
|
|
827
|
+
// close. Its share is instead recovered by subtracting what the machine is
|
|
828
|
+
// already known to be spending, which is the same arithmetic that recovers
|
|
829
|
+
// this source's decoding from a running encoder, and it is only done when
|
|
830
|
+
// every other running encode HAS a price. Otherwise the unpriced work would
|
|
831
|
+
// land in the soundtrack's account and refuse steps on it.
|
|
832
|
+
let othersCostSec = 0;
|
|
833
|
+
if (this.#runningEncoders() > 1) {
|
|
834
|
+
if (kind !== "audio") {
|
|
835
|
+
return;
|
|
836
|
+
}
|
|
837
|
+
const others = this.pricedConcurrentCost(session);
|
|
838
|
+
if (others === null) {
|
|
839
|
+
return; // something running has no price; nothing can be attributed
|
|
840
|
+
}
|
|
841
|
+
othersCostSec = others;
|
|
842
|
+
}
|
|
843
|
+
// What this encode did with the machine to itself — the one figure a live
|
|
844
|
+
// reading is authority on, and what withdraws a quality step that has been
|
|
845
|
+
// seen failing without letting it speak for steps nobody has run. The time
|
|
846
|
+
// the input waited for the swarm is not in it, so a starved run no longer
|
|
847
|
+
// reads as a slow machine.
|
|
848
|
+
state.lastAloneSpeed = speed;
|
|
849
|
+
// What the offer predicted for this very step, against what it then did
|
|
850
|
+
// with the machine to itself. The prediction is corrected for the share of
|
|
851
|
+
// the machine that was free at the time, so this ratio is the error that
|
|
852
|
+
// remains AFTER that correction — which is the only way to tell whether a
|
|
853
|
+
// stage of roadmap item 3 moved anything. Written when it changes by more
|
|
854
|
+
// than a tenth, so a steady step says it once rather than every five
|
|
855
|
+
// seconds.
|
|
856
|
+
if (Number.isFinite(state.predictedSpeedWhenOffered) && state.predictedSpeedWhenOffered > 0) {
|
|
857
|
+
const ratio = speed / state.predictedSpeedWhenOffered;
|
|
858
|
+
const lastSaid = state.lastPredictionRatio;
|
|
859
|
+
if (!Number.isFinite(lastSaid) || Math.abs(ratio - lastSaid) > 0.1) {
|
|
860
|
+
state.lastPredictionRatio = ratio;
|
|
861
|
+
logger.info(
|
|
862
|
+
`prediction ${session.id.slice(0, 8)} ${session.output.encodeHeight || "source"}p: ` +
|
|
863
|
+
`predicted ${state.predictedSpeedWhenOffered.toFixed(2)}x, measured ${speed.toFixed(2)}x ` +
|
|
864
|
+
`(ratio ${ratio.toFixed(2)}; 1.00 would mean the arithmetic describes this machine)`
|
|
865
|
+
);
|
|
866
|
+
}
|
|
867
|
+
}
|
|
868
|
+
if (kind === "audio") {
|
|
869
|
+
// What is left after the work that was already accounted for. `null` when
|
|
870
|
+
// the subtraction leaves nothing positive, which means the reading says
|
|
871
|
+
// less than the noise in it.
|
|
872
|
+
const ownCostSec = 1 / speed - othersCostSec;
|
|
873
|
+
if (!(ownCostSec > 0) || !Number.isFinite(ownCostSec)) {
|
|
874
|
+
return;
|
|
875
|
+
}
|
|
876
|
+
await this.#learnAudioCost(session, 1 / ownCostSec);
|
|
877
|
+
return;
|
|
878
|
+
}
|
|
879
|
+
if (kind === "decode") {
|
|
880
|
+
this.#learnDecodeCost(session, speed);
|
|
881
|
+
return;
|
|
882
|
+
}
|
|
883
|
+
await this.#learnCopyCost(session, speed);
|
|
884
|
+
}
|
|
885
|
+
|
|
886
|
+
async #learnCopyCost(session, speed) {
|
|
887
|
+
const costSec = 1 / speed;
|
|
888
|
+
if (!(costSec > 0) || !Number.isFinite(costSec)) {
|
|
889
|
+
return;
|
|
890
|
+
}
|
|
891
|
+
const key = session.file.key;
|
|
892
|
+
const known = this.#copyCost.get(key);
|
|
893
|
+
const readings = [...(known?.readings ?? []), costSec].slice(-READINGS_KEPT);
|
|
894
|
+
const median = medianOf(readings);
|
|
895
|
+
if (!movedBeyondScatter(known?.costSec ?? null, median, readings)) {
|
|
896
|
+
this.#copyCost.set(key, { ...known, readings });
|
|
897
|
+
return;
|
|
898
|
+
}
|
|
899
|
+
this.#copyCost.set(key, { costSec: median, readings, version: (known?.version ?? 0) + 1 });
|
|
900
|
+
logger.info(
|
|
901
|
+
`transcode: ${session.file.name} copies at ${(1 / median).toFixed(2)}x on this host ` +
|
|
902
|
+
`(median of ${readings.length}, latest ${speed.toFixed(2)}x)`
|
|
903
|
+
);
|
|
904
|
+
}
|
|
905
|
+
|
|
906
|
+
async #learnAudioCost(session, speed) {
|
|
907
|
+
const costSec = 1 / speed;
|
|
908
|
+
if (!(costSec > 0) || !Number.isFinite(costSec)) {
|
|
909
|
+
return;
|
|
910
|
+
}
|
|
911
|
+
const key = EncodeCost.audioKeyOf(session);
|
|
912
|
+
const known = this.#audioCost.get(key);
|
|
913
|
+
const readings = [...(known?.readings ?? []), costSec].slice(-READINGS_KEPT);
|
|
914
|
+
const median = medianOf(readings);
|
|
915
|
+
if (!movedBeyondScatter(known?.costSec ?? null, median, readings)) {
|
|
916
|
+
this.#audioCost.set(key, { ...known, readings });
|
|
917
|
+
return;
|
|
918
|
+
}
|
|
919
|
+
this.#audioCost.set(key, { costSec: median, readings, version: (known?.version ?? 0) + 1 });
|
|
920
|
+
logger.info(
|
|
921
|
+
`transcode: ${session.file.name} encodes audio track ${session.spec.audioSourceTrackIndex} at ` +
|
|
922
|
+
`${(1 / median).toFixed(2)}x on this host (median of ${readings.length}, latest ${speed.toFixed(2)}x)`
|
|
923
|
+
);
|
|
924
|
+
}
|
|
925
|
+
|
|
926
|
+
#learnDecodeCost(session, speed) {
|
|
927
|
+
if (!(speed > 0)) {
|
|
928
|
+
return;
|
|
929
|
+
}
|
|
930
|
+
if (!session.spec.transcodesVideo) {
|
|
931
|
+
// Nothing to learn about decoding here, and nothing else either: the
|
|
932
|
+
// caller routes a copy to #learnCopyCost and a rendition to
|
|
933
|
+
// #learnAudioCost before this is ever reached. Routing them from here as
|
|
934
|
+
// well put both calls behind a guard the caller had already made
|
|
935
|
+
// (`transcodeVideo === true`), so neither could run.
|
|
936
|
+
return;
|
|
937
|
+
}
|
|
938
|
+
if (this.#host().encoderKind !== "software") {
|
|
939
|
+
return; // the benchmark that prices the encode half is libx264 only
|
|
940
|
+
}
|
|
941
|
+
const benchmark = this.#host().benchmark;
|
|
942
|
+
if (!Array.isArray(benchmark) || benchmark.length === 0) {
|
|
943
|
+
return;
|
|
944
|
+
}
|
|
945
|
+
const entry = benchmark.find((item) => item.preset === session.output.softwarePreset);
|
|
946
|
+
const height = Number(session.output.encodeHeight) || 0;
|
|
947
|
+
const width = Number(session.output.encodeWidth) || 0;
|
|
948
|
+
const fps = Number(session.output.outputFps) || TRANSCODE_FPS;
|
|
949
|
+
if (!entry || height <= 0 || width <= 0) {
|
|
950
|
+
return;
|
|
951
|
+
}
|
|
952
|
+
// The preset's throughput AT THIS SIZE, as the startup calibration read it.
|
|
953
|
+
const pixelsPerSec = throughputAt(entry, { width, height });
|
|
954
|
+
if (!(pixelsPerSec > 0)) {
|
|
955
|
+
return;
|
|
956
|
+
}
|
|
957
|
+
const encodeCostSec = (width * height * fps) / pixelsPerSec;
|
|
958
|
+
const decodeCostSec = 1 / speed - encodeCostSec;
|
|
959
|
+
if (!(decodeCostSec > 0)) {
|
|
960
|
+
// The encode half already accounts for everything measured. Nothing is
|
|
961
|
+
// left to attribute to decoding, and a zero or negative cost would say
|
|
962
|
+
// decoding is free, which is a claim this reading cannot support.
|
|
963
|
+
return;
|
|
964
|
+
}
|
|
965
|
+
const key = session.file.key;
|
|
966
|
+
const known = this.#decodeCost.get(key);
|
|
967
|
+
const readings = [...(known?.readings ?? []), decodeCostSec].slice(-READINGS_KEPT);
|
|
968
|
+
const costSec = medianOf(readings);
|
|
969
|
+
if (!movedBeyondScatter(known?.costSec ?? null, costSec, readings)) {
|
|
970
|
+
// The same answer as before, by the readings' own scatter. Storing it
|
|
971
|
+
// would bump the version and make every session recompute its offer,
|
|
972
|
+
// which is asked for on the path that serves every playlist, init and
|
|
973
|
+
// segment.
|
|
974
|
+
this.#decodeCost.set(key, { ...known, readings });
|
|
975
|
+
return;
|
|
976
|
+
}
|
|
977
|
+
this.#decodeCost.set(key, { costSec, readings, version: (known?.version ?? 0) + 1 });
|
|
978
|
+
logger.info(
|
|
979
|
+
`transcode: ${session.file.name} decodes at ${(1 / costSec).toFixed(2)}x on this host ` +
|
|
980
|
+
`(median of ${readings.length}, latest ${(1 / decodeCostSec).toFixed(2)}x from ${height}p ` +
|
|
981
|
+
`at ${speed.toFixed(2)}x, preset ${session.output.softwarePreset})`
|
|
982
|
+
);
|
|
983
|
+
}
|
|
984
|
+
|
|
985
|
+
/**
|
|
986
|
+
* The newest processing speed measured by a run of this output, with the
|
|
987
|
+
* time it was measured. Read from the runs, which own it; the measurement
|
|
988
|
+
* time lets the playback model project the observed trend without imposing
|
|
989
|
+
* a separate freshness window.
|
|
990
|
+
*
|
|
991
|
+
* @param {HlsSession} session
|
|
992
|
+
* @returns {{ speed: number, at: number } | null}
|
|
993
|
+
*/
|
|
994
|
+
latestSpeedReadingOf(session) {
|
|
995
|
+
let newest = null;
|
|
996
|
+
for (const run of this.#runsFor(session)) {
|
|
997
|
+
const reading = run?.speedReading ?? null;
|
|
998
|
+
if (reading !== null && (newest === null || reading.at > newest.at)) {
|
|
999
|
+
newest = reading;
|
|
1000
|
+
}
|
|
1001
|
+
}
|
|
1002
|
+
return newest;
|
|
1003
|
+
}
|
|
1004
|
+
|
|
1005
|
+
/**
|
|
1006
|
+
* Realtime budget (software encoder only): choose the output resolution AND
|
|
1007
|
+
* libx264 preset this host can encode faster than realtime, from the startup
|
|
1008
|
+
* benchmark. The ceiling is the client-requested box capped to the source
|
|
1009
|
+
* (never upscaled); the budget picks the highest resolution rung at or below
|
|
1010
|
+
* that ceiling that clears realtime × margin, then the best preset at that
|
|
1011
|
+
* resolution. On a weak host this downscales below the client target instead
|
|
1012
|
+
* of dropping into sub-realtime playback. Returns null when not applicable
|
|
1013
|
+
* (no video transcode, hardware encoder, or missing benchmark/source size) —
|
|
1014
|
+
* the encode then keeps the ceiling resolution and the default preset.
|
|
1015
|
+
*
|
|
1016
|
+
* @param {{ transcodeVideo: boolean, targetWidth: number, targetHeight: number, sourceWidth: number | null, sourceHeight: number | null, outputFps: number, source?: { megapixelsPerSecond: number, megabitsPerSecond: number } | null }} params
|
|
1017
|
+
* @returns {{ width: number, height: number, preset: string } | null}
|
|
1018
|
+
*/
|
|
1019
|
+
chooseEncodeBudget({
|
|
1020
|
+
transcodeVideo,
|
|
1021
|
+
targetWidth,
|
|
1022
|
+
targetHeight,
|
|
1023
|
+
sourceWidth,
|
|
1024
|
+
sourceHeight,
|
|
1025
|
+
outputFps,
|
|
1026
|
+
source = null,
|
|
1027
|
+
requiredSpeed = null
|
|
1028
|
+
}) {
|
|
1029
|
+
if (!transcodeVideo || this.#host().encoderKind !== "software" || !this.#host().benchmark) {
|
|
1030
|
+
return null;
|
|
1031
|
+
}
|
|
1032
|
+
const ceiling = computeOutputDimensions(targetWidth, targetHeight, sourceWidth, sourceHeight);
|
|
1033
|
+
if (!ceiling) {
|
|
1034
|
+
return null;
|
|
1035
|
+
}
|
|
1036
|
+
return chooseSoftwareEncodeSettings(
|
|
1037
|
+
this.#host().benchmark,
|
|
1038
|
+
{ width: ceiling.w, height: ceiling.h },
|
|
1039
|
+
outputFps,
|
|
1040
|
+
{ decodeModel: this.#host().decodeModel, source, requiredSpeed }
|
|
1041
|
+
);
|
|
1042
|
+
}
|
|
1043
|
+
}
|