1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
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
134
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
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
334
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
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
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
852
853
854
855
856
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
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
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
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
/*
* // Copyright (c) Radzivon Bartoshyk 6/2026. All rights reserved.
* //
* // Redistribution and use in source and binary forms, with or without modification,
* // are permitted provided that the following conditions are met:
* //
* // 1. Redistributions of source code must retain the above copyright notice, this
* // list of conditions and the following disclaimer.
* //
* // 2. Redistributions in binary form must reproduce the above copyright notice,
* // this list of conditions and the following disclaimer in the documentation
* // and/or other materials provided with the distribution.
* //
* // 3. Neither the name of the copyright holder nor the names of its
* // contributors may be used to endorse or promote products derived from
* // this software without specific prior written permission.
* //
* // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
use crate::cabac::CabacDecoder;
use crate::cabac::{ContextSet, IntraModeContexts};
use crate::cabac::{SCAN_DIAG, SCAN_HORIZ, SCAN_VERT, residual_coding};
use crate::config::{Pps, Sps};
use crate::error::DecodeError;
use crate::fmt::BitDepth;
use crate::intra;
use crate::transform;
use crate::yuv::YuvPlanes;
const MODE_PLANAR: u8 = 0;
const MODE_DC: u8 = 1;
#[derive(Clone, Default)]
struct SaoCtb {
type_idx: [u8; 3], // 0=off,1=band,2=edge
offsets: [[i32; 4]; 3],
band_pos: [u8; 3],
eo_class: [u8; 3],
}
pub(crate) struct FullDecoder<'a> {
cab: CabacDecoder<'a>,
ctx: ContextSet,
ictx: IntraModeContexts,
sps: Sps,
pps: Pps,
// Reconstruction planes (coded dimensions, CTB-aligned).
y: Vec<u16>,
cb: Vec<u16>,
cr: Vec<u16>,
w: usize, // coded luma width
h: usize, // coded luma height
cw: usize, // chroma width
ch: usize, // chroma height
sub_w: usize,
sub_h: usize,
bd: u8,
bd_c: u8,
log2_ctb: u32,
log2_min_cb: u32,
log2_min_tb: u32,
log2_max_tb: u32,
max_trafo_depth_intra: u32,
// Per-4×4-luma intra mode and "decoded" availability.
mode_y: Vec<u8>,
decoded: Vec<bool>, // per 4×4 luma block
tqb: Vec<bool>, // per 4×4 luma block: cu_transquant_bypass_flag (lossless)
cu_tqb: bool, // current CU's cu_transquant_bypass_flag
grid_w: usize, // w/4
#[allow(dead_code)]
grid_h: usize, // h/4
ct_depth: Vec<u8>, // per 4×4, coding-tree depth (for split_cu_flag ctx)
// QP tracking
slice_qp: i32,
qp_y_prev: i32,
qp_y_map: Vec<i16>, // per 4×4 luma (QpY ∈ −24..51, fits i16; halves a multi-MB buffer)
cu_qp_delta_val: i32,
is_cu_qp_delta_coded: bool,
log2_qg: u32,
cur_qp: i32,
sao: Vec<SaoCtb>,
ctb_cols: usize,
ctb_rows: usize,
sao_luma: bool,
sao_chroma: bool,
sign_hiding: bool,
// WPP context snapshots
wpp_ctx_snap: Vec<Option<ContextSet>>,
wpp_ictx_snap: Vec<Option<IntraModeContexts>>,
/// Pre-allocated scratch memory reused every TU to avoid per-block
/// heap allocations on the hot path (~4–6 allocs per TU eliminated).
scratch: intra::IntraScratch,
/// Dequantised coefficient scratch (max 32×32 = 1024 values, clamped to ±32768 → i32)
deq_scratch: Vec<i32>,
/// Inverse-transform output scratch (max 32×32 = 1024 i32 values)
res_scratch: Vec<i32>,
/// Cached strong_intra_smoothing (avoids env-var lookup per TU)
strong_smoothing: bool,
}
impl<'a> FullDecoder<'a> {
/// Maximum allowed dimension per axis and pixel count.
pub(crate) const MAX_DIM: usize = 16_384;
pub(crate) const MAX_PIXELS: usize = 64 * 1024 * 1024; // 64 MP
pub(crate) fn new(
cabac: &'a [u8],
sps: Sps,
pps: Pps,
slice_qp: i32,
sao_luma: bool,
sao_chroma: bool,
) -> Result<Self, DecodeError> {
// Reject dimensions that would cause enormous allocations.
let w = sps.width as usize;
let h = sps.height as usize;
if w == 0
|| h == 0
|| w > Self::MAX_DIM
|| h > Self::MAX_DIM
|| w.saturating_mul(h) > Self::MAX_PIXELS
{
return Err(DecodeError::Bitstream(format!(
"image dimensions {}×{} exceed maximum",
w, h
)));
}
let cab =
CabacDecoder::new(cabac).map_err(|_| DecodeError::Bitstream("cabac init".into()))?;
let log2_ctb = sps.log2_ctb;
let ctb = 1usize << log2_ctb;
let sub_w = sps.chroma.sub_w();
let sub_h = sps.chroma.sub_h();
let cw = if sps.chroma.is_monochrome() {
0
} else {
w / sub_w
};
let ch = if sps.chroma.is_monochrome() {
0
} else {
h / sub_h
};
let grid_w = w / 4;
let grid_h = h / 4;
let qp = ContextSet::init_islice(slice_qp.clamp(0, 51) as u8);
let ictx = IntraModeContexts::init_islice(slice_qp.clamp(0, 51) as u8);
let ctb_cols = w.div_ceil(ctb);
let ctb_rows = h.div_ceil(ctb);
let log2_qg = sps.log2_ctb - pps.diff_cu_qp_delta_depth;
Ok(FullDecoder {
cab,
ctx: qp,
ictx,
bd: sps.bit_depth_luma,
bd_c: sps.bit_depth_chroma,
log2_ctb,
log2_min_cb: sps.log2_min_cb,
log2_min_tb: sps.log2_min_tb,
log2_max_tb: sps.log2_max_tb,
max_trafo_depth_intra: sps.max_transform_hierarchy_intra,
y: vec![0; w * h],
cb: vec![0; cw * ch],
cr: vec![0; cw * ch],
w,
h,
cw,
ch,
sub_w,
sub_h,
mode_y: vec![MODE_DC; grid_w * grid_h],
decoded: vec![false; grid_w * grid_h],
tqb: vec![false; grid_w * grid_h],
cu_tqb: false,
ct_depth: vec![0; grid_w * grid_h],
grid_w,
grid_h,
slice_qp,
qp_y_prev: slice_qp,
qp_y_map: vec![slice_qp as i16; grid_w * grid_h],
cu_qp_delta_val: 0,
is_cu_qp_delta_coded: false,
log2_qg,
cur_qp: slice_qp,
sao: vec![SaoCtb::default(); ctb_cols * ctb_rows],
ctb_cols,
ctb_rows,
sao_luma,
sao_chroma,
sign_hiding: pps.sign_data_hiding_enabled,
wpp_ctx_snap: vec![None; ctb_rows],
wpp_ictx_snap: vec![None; ctb_rows],
scratch: intra::IntraScratch::new(),
deq_scratch: vec![0i32; 1024],
res_scratch: vec![0i32; 1024],
strong_smoothing: std::env::var("NOSTRONG").is_err(),
sps,
pps,
})
}
pub(crate) fn decode(&mut self) -> Result<YuvPlanes, DecodeError> {
let ctb = 1usize << self.log2_ctb;
let wpp = self.pps.entropy_coding_sync_enabled;
for ry in 0..self.ctb_rows {
// WPP: at start of every non-first row, restore saved contexts and
// reinitialize the CABAC engine from the current stream position
// (which the previous row's sub-stream end already byte-aligned to).
if wpp && ry > 0 {
if let (Some(ctx), Some(ictx)) = (
self.wpp_ctx_snap[ry - 1].take(),
self.wpp_ictx_snap[ry - 1].take(),
) {
self.ctx = ctx;
self.ictx = ictx;
}
self.cab.reinit_engine();
}
for rx in 0..self.ctb_cols {
if self.sps.sao_enabled {
self.parse_sao(rx, ry);
}
// New CTB → QG reset handled inside coding_unit via QG tracking.
self.coding_quadtree(rx * ctb, ry * ctb, self.log2_ctb, 0);
// WPP: save context snapshot after the 2nd CTB of each row.
if wpp && rx == 1 {
self.wpp_ctx_snap[ry] = Some(self.ctx.clone());
self.wpp_ictx_snap[ry] = Some(self.ictx);
}
let end = self.cab.decode_terminate();
if end != 0 {
// end_of_slice_segment_flag (or end_of_sub_stream if WPP
// miscounted) — just finish gracefully.
break;
}
}
// WPP: after the last CTB of each non-final row, the stream contains
// an end_of_sub_stream_one_bit (= 1), then byte-alignment padding,
// then the next row's sub-stream starts.
if wpp && ry < self.ctb_rows - 1 {
let eoss = self.cab.decode_terminate();
debug_assert_eq!(eoss, 1, "WPP: end_of_sub_stream_one_bit must be 1");
self.cab.byte_align();
// Engine reinit happens at the top of the next loop iteration.
}
}
if self.sps.sao_enabled {
self.apply_deblocking();
self.apply_sao();
}
Ok(YuvPlanes {
y: std::mem::take(&mut self.y),
cb: std::mem::take(&mut self.cb),
cr: std::mem::take(&mut self.cr),
width: self.w,
height: self.h,
chroma: self.sps.chroma,
bit_depth: self.sps.bit_depth().unwrap_or(BitDepth::Eight),
})
}
fn parse_sao(&mut self, rx: usize, ry: usize) {
let idx = ry * self.ctb_cols + rx;
if !self.sao_luma && !self.sao_chroma {
return;
}
let mut merge_left = false;
let mut merge_up = false;
if rx > 0 {
merge_left = self.cab.decode_bin(&mut self.ctx.sao_merge_flag) != 0;
}
if !merge_left && ry > 0 {
merge_up = self.cab.decode_bin(&mut self.ctx.sao_merge_flag) != 0;
}
if merge_left {
self.sao[idx] = self.sao[idx - 1].clone();
return;
}
if merge_up {
self.sao[idx] = self.sao[idx - self.ctb_cols].clone();
return;
}
let mut s = SaoCtb::default();
let ncomp = if self.sps.chroma.is_monochrome() {
1
} else {
3
};
let cmax = (1i32 << (self.bd.min(10) - 5)) - 1;
for c in 0..ncomp {
let enabled = if c == 0 {
self.sao_luma
} else {
self.sao_chroma
};
if !enabled {
continue;
}
// sao_type_idx
let type_idx = if c == 2 {
s.type_idx[1] // Cr reuses Cb's type
} else {
let bin0 = self.cab.decode_bin(&mut self.ctx.sao_type_idx);
if bin0 == 0 {
0
} else if self.cab.decode_bypass() == 0 {
1
} else {
2
}
};
s.type_idx[c] = type_idx;
if type_idx == 0 {
continue;
}
// 4 offset magnitudes (TR, bypass, cMax)
let mut absv = [0i32; 4];
for v in absv.iter_mut() {
let mut m = 0;
while m < cmax && self.cab.decode_bypass() != 0 {
m += 1;
}
*v = m;
}
if type_idx == 1 {
// band: signs for nonzero, then band position
for dst in absv.iter_mut() {
if *dst != 0 && self.cab.decode_bypass() != 0 {
*dst = -*dst;
}
}
let mut bp = 0u8;
for _ in 0..5 {
bp = (bp << 1) | self.cab.decode_bypass();
}
s.band_pos[c] = bp;
} else {
// edge: offsets are +,+,-,- by convention; eo_class
absv[2] = -absv[2];
absv[3] = -absv[3];
if c != 2 {
let mut eo = 0u8;
for _ in 0..2 {
eo = (eo << 1) | self.cab.decode_bypass();
}
s.eo_class[c] = eo;
} else {
s.eo_class[2] = s.eo_class[1];
}
}
s.offsets[c] = absv;
}
self.sao[idx] = s;
}
fn apply_deblocking(&mut self) {
// HEVC §8.7.2.4 Tables 8-10 / 8-11 (beta, tC)
#[rustfmt::skip]
static BETA: [i32; 52] = [
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 6, 7, 8, 9,
10,11,12,13,14,15,16,17,18,20,
22,24,26,28,30,32,34,36,38,40,
42,44,46,48,50,52,54,56,58,60,
62,64,
];
#[rustfmt::skip]
static TC: [i32; 54] = [
0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,1,
1,1,1,1,1,1,1,2,2,2,
2,3,3,3,3,4,4,4,5,5,
6,6,7,8,9,10,11,13,14,16,
18,20,22,24,
];
// Slice-level offsets (default 0 for libheif)
let beta_offset = self.pps.beta_offset_div2 * 2;
let tc_offset = self.pps.tc_offset_div2 * 2;
// HEVC §8.7.2.3: table indices use QP′ = QP + QpBdOffset where
// QpBdOffset = 6*(BitDepth−8). For 8-bit this is 0; for 10-bit it's 12.
let qp_bd_offset_y = 6 * (self.bd as i32 - 8);
let qp_bd_offset_c = 6 * (self.bd_c as i32 - 8);
// QP for dequantization (per 4×4 grid). For intra-only all Bs=2.
// We use the CTB average QP — approximation good enough.
let w = self.w;
let h = self.h;
let cw = self.cw;
let ch = self.ch;
let gw = self.grid_w;
// Helper: look up qp_y_map for a luma pixel (rounded to 4×4 grid)
let qp_at = |qp_map: &[i16], px: usize, py: usize| -> i32 {
qp_map[(py / 4).min(h / 4 - 1) * gw + (px / 4).min(w / 4 - 1)] as i32
};
// Vertical edges first (filter across columns), then horizontal.
for pass in 0..2usize {
// pass 0 = vertical edges (x mod 8 == 0, filter across x boundary)
// pass 1 = horizontal edges (y mod 8 == 0, filter across y boundary)
let (edge_step, scan_step, edge_max, scan_max) = if pass == 0 {
(8, 1, w, h)
} else {
(8, 1, h, w)
};
let _ = scan_step;
let mut edge = 8; // skip image boundary
while edge < edge_max {
// For each 4-pixel segment along the edge
let mut scan = 0;
while scan + 4 <= scan_max {
// p-side: pixels going into the block (edge-1, edge-2, edge-3, edge-4)
// q-side: pixels going out (edge, edge+1, edge+2, edge+3)
if pass == 0 {
// vertical edge at x=edge, rows scan..scan+3
let mid = scan + 1; // representative row
let qp_p = qp_at(&self.qp_y_map, edge - 1, mid);
let qp_q = qp_at(&self.qp_y_map, edge, mid);
// Lossless (transquant-bypass) CUs are exempt from deblocking
// (HEVC §8.7.2): if either side is bypass, skip this segment.
if self.tqb_at(edge - 1, mid) || self.tqb_at(edge, mid) {
scan += 4;
continue;
}
let avg_qp = (qp_p + qp_q + 1) >> 1;
let beta_prime = (avg_qp + qp_bd_offset_y + beta_offset).clamp(0, 51);
let tc_prime = (avg_qp + qp_bd_offset_y + 2 + tc_offset).clamp(0, 53);
let beta = BETA[beta_prime as usize];
let tc = TC[tc_prime as usize];
if tc == 0 {
scan += 4;
continue;
}
// Compute d across all 4 rows of the segment
let mut d_total = 0i32;
for s in scan..scan + 4 {
if s >= h {
break;
}
let p = |o: usize| self.y[s * w + edge - 1 - o] as i32;
let q = |o: usize| self.y[s * w + edge + o] as i32;
d_total +=
(p(2) - 2 * p(1) + p(0)).abs() + (q(0) - 2 * q(1) + q(2)).abs();
}
if d_total >= beta {
scan += 4;
continue;
}
// Apply filter to each of the 4 rows
for s in scan..scan + 4 {
if s >= h {
continue;
}
let base_p = s * w + edge - 1;
let base_q = s * w + edge;
let (p0, p1, p2, p3) = (
self.y[base_p] as i32,
self.y[base_p - 1] as i32,
self.y[base_p - 2] as i32,
self.y[base_p - 3] as i32,
);
let (q0, q1, q2, q3) = (
self.y[base_q] as i32,
self.y[base_q + 1] as i32,
self.y[base_q + 2] as i32,
self.y[base_q + 3] as i32,
);
let dp = (p2 - 2 * p1 + p0).abs();
let dq = (q2 - 2 * q1 + q0).abs();
let d = dp + dq;
let strong = d < (beta >> 2)
&& (p0 - q0).abs() < (5 * tc + 1) >> 1
&& (p3 - p0).abs() + (q0 - q3).abs() < (beta * 3) >> 3;
let maxv = (1i32 << self.bd) - 1;
if strong {
self.y[base_p] = ((p2 + 2 * p1 + 2 * p0 + 2 * q0 + q1 + 4) >> 3)
.clamp(0, maxv)
as u16;
self.y[base_p - 1] =
((p2 + p1 + p0 + q0 + 2) >> 2).clamp(0, maxv) as u16;
self.y[base_p - 2] = ((2 * p3 + 3 * p2 + p1 + p0 + q0 + 4) >> 3)
.clamp(0, maxv)
as u16;
self.y[base_q] = ((p1 + 2 * p0 + 2 * q0 + 2 * q1 + q2 + 4) >> 3)
.clamp(0, maxv)
as u16;
self.y[base_q + 1] =
((p0 + q0 + q1 + q2 + 2) >> 2).clamp(0, maxv) as u16;
self.y[base_q + 2] = ((p0 + q0 + q1 + 3 * q2 + 2 * q3 + 4) >> 3)
.clamp(0, maxv)
as u16;
} else {
let delta =
((9 * (q0 - p0) - 3 * (q1 - p1) + 8) >> 4).clamp(-tc, tc);
self.y[base_p] = (p0 + delta).clamp(0, maxv) as u16;
self.y[base_q] = (q0 - delta).clamp(0, maxv) as u16;
let thres = (tc * 10 + 1) >> 1;
if (2 * (p0 - p1) - delta).abs() < thres {
let dp1 = (((p2 + p0 + 1) >> 1) - p1 + (delta >> 1))
.clamp(-(tc >> 1), tc >> 1);
self.y[base_p - 1] = (p1 + dp1).clamp(0, maxv) as u16;
}
if (2 * (q0 - q1) + delta).abs() < thres {
let dq1 = (((q2 + q0 + 1) >> 1) - q1 - (delta >> 1))
.clamp(-(tc >> 1), tc >> 1);
self.y[base_q + 1] = (q1 + dq1).clamp(0, maxv) as u16;
}
}
}
scan += 4;
continue;
} else {
// horizontal edge at y=edge, cols scan..scan+3
let mid = scan + 1;
let qp_p = qp_at(&self.qp_y_map, mid, edge - 1);
let qp_q = qp_at(&self.qp_y_map, mid, edge);
if self.tqb_at(mid, edge - 1) || self.tqb_at(mid, edge) {
scan += 4;
continue;
}
let avg_qp = (qp_p + qp_q + 1) >> 1;
let beta_prime = (avg_qp + qp_bd_offset_y + beta_offset).clamp(0, 51);
let tc_prime = (avg_qp + qp_bd_offset_y + 2 + tc_offset).clamp(0, 53);
let beta = BETA[beta_prime as usize];
let tc = TC[tc_prime as usize];
if tc == 0 {
scan += 4;
continue;
}
let mut d_total = 0i32;
for s in scan..scan + 4 {
if s >= w {
break;
}
let p = |o: usize| self.y[(edge - 1 - o) * w + s] as i32;
let q = |o: usize| self.y[(edge + o) * w + s] as i32;
d_total +=
(p(2) - 2 * p(1) + p(0)).abs() + (q(0) - 2 * q(1) + q(2)).abs();
}
if d_total >= beta {
scan += 4;
continue;
}
for s in scan..scan + 4 {
if s >= w {
continue;
}
let (p0, p1, p2, p3) = (
self.y[(edge - 1) * w + s] as i32,
self.y[(edge - 2) * w + s] as i32,
self.y[(edge - 3) * w + s] as i32,
if edge >= 4 {
self.y[(edge - 4) * w + s] as i32
} else {
0
},
);
let (q0, q1, q2, q3) = (
self.y[(edge) * w + s] as i32,
self.y[(edge + 1) * w + s] as i32,
self.y[(edge + 2) * w + s] as i32,
if edge + 3 < h {
self.y[(edge + 3) * w + s] as i32
} else {
0
},
);
let dp = (p2 - 2 * p1 + p0).abs();
let dq = (q2 - 2 * q1 + q0).abs();
let d = dp + dq;
let strong = d < (beta >> 2)
&& (p0 - q0).abs() < (5 * tc + 1) >> 1
&& (p3 - p0).abs() + (q0 - q3).abs() < (beta * 3) >> 3;
let maxv = (1i32 << self.bd) - 1;
if strong {
self.y[(edge - 1) * w + s] =
((p2 + 2 * p1 + 2 * p0 + 2 * q0 + q1 + 4) >> 3).clamp(0, maxv)
as u16;
self.y[(edge - 2) * w + s] =
((p2 + p1 + p0 + q0 + 2) >> 2).clamp(0, maxv) as u16;
self.y[(edge - 3) * w + s] =
((2 * p3 + 3 * p2 + p1 + p0 + q0 + 4) >> 3).clamp(0, maxv)
as u16;
self.y[(edge) * w + s] =
((p1 + 2 * p0 + 2 * q0 + 2 * q1 + q2 + 4) >> 3).clamp(0, maxv)
as u16;
self.y[(edge + 1) * w + s] =
((p0 + q0 + q1 + q2 + 2) >> 2).clamp(0, maxv) as u16;
self.y[(edge + 2) * w + s] =
((p0 + q0 + q1 + 3 * q2 + 2 * q3 + 4) >> 3).clamp(0, maxv)
as u16;
} else {
let delta =
((9 * (q0 - p0) - 3 * (q1 - p1) + 8) >> 4).clamp(-tc, tc);
self.y[(edge - 1) * w + s] = (p0 + delta).clamp(0, maxv) as u16;
self.y[(edge) * w + s] = (q0 - delta).clamp(0, maxv) as u16;
let thres = (tc * 10 + 1) >> 1;
if (2 * (p0 - p1) - delta).abs() < thres {
let dp1 = (((p2 + p0 + 1) >> 1) - p1 + (delta >> 1))
.clamp(-(tc >> 1), tc >> 1);
self.y[(edge - 2) * w + s] = (p1 + dp1).clamp(0, maxv) as u16;
}
if (2 * (q0 - q1) + delta).abs() < thres {
let dq1 = (((q2 + q0 + 1) >> 1) - q1 - (delta >> 1))
.clamp(-(tc >> 1), tc >> 1);
self.y[(edge + 1) * w + s] = (q1 + dq1).clamp(0, maxv) as u16;
}
}
}
scan += 4;
continue;
}
}
edge += edge_step;
}
}
for pass in 0..2usize {
let (edge_step, scan_max) = if pass == 0 { (8, ch) } else { (8, cw) };
let maxv_c = (1i32 << self.bd_c) - 1;
let mut edge = 8;
while edge < if pass == 0 { cw } else { ch } {
let mut scan = 0;
while scan + 4 <= scan_max {
let mid = scan + 1;
// QP for chroma — use luma QP at corresponding position
let (qlx, qly) = if pass == 0 {
(edge * self.sub_w, mid * self.sub_h)
} else {
(mid * self.sub_w, edge * self.sub_h)
};
let avg_qp_l = qp_at(&self.qp_y_map, qlx.min(w - 1), qly.min(h - 1));
let tc_prime_c = (avg_qp_l + qp_bd_offset_c + 2 + tc_offset).clamp(0, 53);
let tc_c = TC[tc_prime_c as usize];
if tc_c == 0 {
scan += 4;
continue;
}
// Lossless CUs are exempt from chroma deblocking too.
let (px_p, py_p, px_q, py_q) = if pass == 0 {
(
(edge - 1) * self.sub_w,
mid * self.sub_h,
edge * self.sub_w,
mid * self.sub_h,
)
} else {
(
mid * self.sub_w,
(edge - 1) * self.sub_h,
mid * self.sub_w,
edge * self.sub_h,
)
};
if self.tqb_at(px_p, py_p) || self.tqb_at(px_q, py_q) {
scan += 4;
continue;
}
for plane in 0..2usize {
let pix = if plane == 0 {
&mut self.cb
} else {
&mut self.cr
};
for s in scan..scan + 4 {
if s >= scan_max {
continue;
}
let (p0, p1, q0, q1) = if pass == 0 {
(
pix[s * cw + edge - 1] as i32,
pix[s * cw + edge - 2] as i32,
pix[s * cw + edge] as i32,
pix[s * cw + edge + 1] as i32,
)
} else {
(
pix[(edge - 1) * cw + s] as i32,
pix[(edge - 2) * cw + s] as i32,
pix[(edge) * cw + s] as i32,
pix[(edge + 1) * cw + s] as i32,
)
};
let delta = ((q0 - p0) * 4 + p1 - q1 + 4) >> 3;
let delta = delta.clamp(-tc_c, tc_c);
if delta != 0 {
let (ip, iq) = if pass == 0 {
(s * cw + edge - 1, s * cw + edge)
} else {
((edge - 1) * cw + s, edge * cw + s)
};
pix[ip] = (p0 + delta).clamp(0, maxv_c) as u16;
pix[iq] = (q0 - delta).clamp(0, maxv_c) as u16;
}
}
}
scan += 4;
}
edge += edge_step;
}
}
}
fn apply_sao(&mut self) {
let ctb = 1usize << self.log2_ctb;
// Work on clones so EO neighbor lookups always use original values.
let orig_y = self.y.clone();
let orig_cb = self.cb.clone();
let orig_cr = self.cr.clone();
for ry in 0..self.ctb_rows {
for rx in 0..self.ctb_cols {
let idx = ry * self.ctb_cols + rx;
let sao = &self.sao[idx];
let x0 = rx * ctb;
let y0 = ry * ctb;
// Luma
if self.sao_luma && sao.type_idx[0] != 0 {
let x_end = (x0 + ctb).min(self.w);
let y_end = (y0 + ctb).min(self.h);
Self::apply_sao_plane(
&mut self.y,
&orig_y,
self.w,
self.h,
x0,
y0,
x_end,
y_end,
sao.type_idx[0],
&sao.offsets[0],
sao.band_pos[0],
sao.eo_class[0],
self.bd,
);
}
// Chroma (Cb, Cr share eo_class)
if self.sao_chroma {
let cw = self.cw;
let ch = self.ch;
let cx0 = x0 / self.sub_w;
let cy0 = y0 / self.sub_h;
let cx_end = ((x0 + ctb) / self.sub_w).min(cw);
let cy_end = ((y0 + ctb) / self.sub_h).min(ch);
if sao.type_idx[1] != 0 {
Self::apply_sao_plane(
&mut self.cb,
&orig_cb,
cw,
ch,
cx0,
cy0,
cx_end,
cy_end,
sao.type_idx[1],
&sao.offsets[1],
sao.band_pos[1],
sao.eo_class[1],
self.bd_c,
);
}
if sao.type_idx[2] != 0 {
Self::apply_sao_plane(
&mut self.cr,
&orig_cr,
cw,
ch,
cx0,
cy0,
cx_end,
cy_end,
sao.type_idx[2],
&sao.offsets[2],
sao.band_pos[2],
sao.eo_class[2],
self.bd_c,
);
}
}
}
}
}
#[allow(clippy::too_many_arguments)]
fn apply_sao_plane(
dst: &mut [u16],
src: &[u16],
w: usize,
h: usize,
x0: usize,
y0: usize,
x_end: usize,
y_end: usize,
type_idx: u8,
offsets: &[i32; 4],
band_pos: u8,
eo_class: u8,
bd: u8,
) {
let max_val = ((1u32 << bd) - 1) as i32;
match type_idx {
1 => {
// Band offset
let shift = bd - 5;
for y in y0..y_end {
for x in x0..x_end {
let s = src[y * w + x] as i32;
let band = (s >> shift) as u8;
let rel = band.wrapping_sub(band_pos);
if rel < 4 {
let v = (s + offsets[rel as usize]).clamp(0, max_val);
dst[y * w + x] = v as u16;
}
}
}
}
2 => {
// Edge offset (§8.7.3.2.4)
// Direction vectors for the two neighbors
let (dx, dy): (i32, i32) = match eo_class {
0 => (1, 0), // horizontal
1 => (0, 1), // vertical
2 => (1, 1), // 135°
_ => (1, -1), // 45°
};
for y in y0..y_end {
for x in x0..x_end {
let s = src[y * w + x] as i32;
// Neighbor 1 (forward direction)
let x1 = x as i32 + dx;
let y1 = y as i32 + dy;
// Neighbor 2 (backward direction)
let x2 = x as i32 - dx;
let y2 = y as i32 - dy;
// Out-of-bounds neighbors count as "equal" (no offset)
let inb = |xx: i32, yy: i32| -> bool {
xx >= 0 && yy >= 0 && (xx as usize) < w && (yy as usize) < h
};
let n1 = if inb(x1, y1) {
src[y1 as usize * w + x1 as usize] as i32
} else {
s
};
let n2 = if inb(x2, y2) {
src[y2 as usize * w + x2 as usize] as i32
} else {
s
};
let sign1 = (s > n1) as i32 - (s < n1) as i32;
let sign2 = (s > n2) as i32 - (s < n2) as i32;
let edge_idx = sign1 + sign2 + 2; // 0..4
// category 2 (edge_idx==2) always has offset 0
let offset = match edge_idx {
0 => offsets[0], // local min → positive offset
1 => offsets[1],
3 => offsets[2],
4 => offsets[3], // local max → negative offset
_ => 0,
};
if offset != 0 {
dst[y * w + x] = (s + offset).clamp(0, max_val) as u16;
}
}
}
}
_ => {}
}
}
fn coding_quadtree(&mut self, x0: usize, y0: usize, log2_cb: u32, depth: u8) {
let cb_size = 1usize << log2_cb;
let in_pic = x0 + cb_size <= self.w && y0 + cb_size <= self.h;
let can_split = log2_cb > self.log2_min_cb;
let split = if x0 + cb_size <= self.w && y0 + cb_size <= self.h && can_split {
// read split_cu_flag with neighbor-depth context
let ctx_inc = self.split_cu_ctx(x0, y0, depth);
self.cab.decode_bin(&mut self.ctx.split_cu_flag[ctx_inc]) != 0
} else {
can_split && !in_pic
};
if split {
let half = cb_size / 2;
let d = depth + 1;
self.coding_quadtree(x0, y0, log2_cb - 1, d);
if x0 + half < self.w {
self.coding_quadtree(x0 + half, y0, log2_cb - 1, d);
}
if y0 + half < self.h {
self.coding_quadtree(x0, y0 + half, log2_cb - 1, d);
}
if x0 + half < self.w && y0 + half < self.h {
self.coding_quadtree(x0 + half, y0 + half, log2_cb - 1, d);
}
} else {
self.set_ct_depth(x0, y0, cb_size, depth);
self.coding_unit(x0, y0, log2_cb);
}
}
fn split_cu_ctx(&self, x0: usize, y0: usize, depth: u8) -> usize {
let mut inc = 0;
if x0 >= 4 {
let g = (y0 / 4) * self.grid_w + (x0 - 1) / 4;
if self.decoded[g] && self.ct_depth[g] as usize > depth as usize {
inc += 1;
}
}
if y0 >= 4 {
let g = ((y0 - 1) / 4) * self.grid_w + x0 / 4;
if self.decoded[g] && self.ct_depth[g] as usize > depth as usize {
inc += 1;
}
}
inc
}
fn set_ct_depth(&mut self, x0: usize, y0: usize, size: usize, depth: u8) {
for yy in (y0..y0 + size).step_by(4) {
for xx in (x0..x0 + size).step_by(4) {
if xx < self.w && yy < self.h {
self.ct_depth[(yy / 4) * self.grid_w + xx / 4] = depth;
}
}
}
}
fn coding_unit(&mut self, x0: usize, y0: usize, log2_cb: u32) {
// QG handling
let qg_mask = !((1usize << self.log2_qg) - 1);
let xqg = x0 & qg_mask;
let yqg = y0 & qg_mask;
if x0 == xqg && y0 == yqg {
self.is_cu_qp_delta_coded = false;
self.cu_qp_delta_val = 0;
self.cur_qp = self.predict_qp(xqg, yqg);
}
// cu_transquant_bypass_flag (HEVC §7.3.8.5): first CU element, present only
// when the PPS enables transquant bypass. When set, transform + quantization
// are skipped and the parsed residual is used verbatim (lossless coding).
self.cu_tqb = if self.pps.transquant_bypass_enabled {
self.cab.decode_bin(&mut self.ctx.cu_transquant_bypass_flag) != 0
} else {
false
};
if self.cu_tqb {
let cb = 1usize << log2_cb;
self.set_tqb(x0, y0, cb);
}
let cb_size = 1usize << log2_cb;
// part_mode: NxN only at min CB
let nxn = if log2_cb == self.log2_min_cb {
self.cab.decode_bin(&mut self.ictx.part_mode) == 0
} else {
false
};
let npu = if nxn { 2 } else { 1 };
let pu_size = cb_size / npu;
let mut luma_modes = [MODE_DC; 4];
// prev_intra_luma_pred_flag for each PU
let mut prev_flags = [false; 4];
for dst in prev_flags[..npu * npu].iter_mut() {
*dst = self
.cab
.decode_bin(&mut self.ictx.prev_intra_luma_pred_flag)
!= 0;
}
let mut mpm_or_rem = [0u8; 4];
for (&src, dst) in prev_flags[..npu * npu].iter().zip(mpm_or_rem.iter_mut()) {
if src {
// mpm_idx: TR cMax=2, bypass
let mut v = 0u8;
if self.cab.decode_bypass() != 0 {
v = 1 + self.cab.decode_bypass();
}
*dst = v;
} else {
let mut v = 0u8;
for _ in 0..5 {
v = (v << 1) | self.cab.decode_bypass();
}
*dst = v;
}
}
let npu_sqr = npu * npu;
for (i, ((luma_mode, &prev_flag), &mpm_or_rem)) in luma_modes[..npu_sqr]
.iter_mut()
.zip(prev_flags[..npu_sqr].iter())
.zip(mpm_or_rem[..npu_sqr].iter())
.enumerate()
{
let pux = x0 + (i % npu) * pu_size;
let puy = y0 + (i / npu) * pu_size;
let mode = self.derive_luma_mode(pux, puy, prev_flag, mpm_or_rem);
*luma_mode = mode;
self.set_mode(pux, puy, pu_size, mode);
}
// intra_chroma_pred_mode (1 per CU for 4:2:0/4:2:2)
let chroma_mode = if self.sps.chroma.is_monochrome() {
MODE_DC
} else {
self.decode_chroma_mode(luma_modes[0])
};
// transform_tree
let intra_split = nxn;
let max_depth = self.max_trafo_depth_intra + intra_split as u32;
self.transform_tree(
x0,
y0,
x0,
y0,
log2_cb,
0,
0,
&luma_modes,
chroma_mode,
intra_split,
max_depth,
[false; 2],
[false; 2],
);
// mark decoded
self.mark_decoded(x0, y0, cb_size);
self.qp_y_prev = self.cur_qp;
self.set_qp(x0, y0, cb_size, self.cur_qp);
}
fn predict_qp(&self, xqg: usize, yqg: usize) -> i32 {
let ctb = 1usize << self.log2_ctb;
let ctb_x = (xqg / ctb) * ctb;
let ctb_y = (yqg / ctb) * ctb;
// WPP (HEVC §8.6.1): for the first QG in a CTB row, qPY_PRED = SliceQpY.
let first_in_ctb_row = xqg == 0 && (yqg & (ctb - 1)) == 0;
if self.pps.entropy_coding_sync_enabled && first_in_ctb_row {
return self.slice_qp;
}
// qPY_A: left neighbor, must be in same CTB
let qp_a = if xqg >= 1 && (xqg - 1) >= ctb_x {
self.qp_y_map[(yqg / 4) * self.grid_w + (xqg - 1) / 4] as i32
} else {
self.qp_y_prev
};
// qPY_B: above neighbor, must be in same CTB
let qp_b = if yqg >= 1 && (yqg - 1) >= ctb_y {
self.qp_y_map[((yqg - 1) / 4) * self.grid_w + xqg / 4] as i32
} else {
self.qp_y_prev
};
(qp_a + qp_b + 1) >> 1
}
fn set_qp(&mut self, x0: usize, y0: usize, size: usize, qp: i32) {
for yy in (y0..y0 + size).step_by(4) {
for xx in (x0..x0 + size).step_by(4) {
if xx < self.w && yy < self.h {
self.qp_y_map[(yy / 4) * self.grid_w + xx / 4] = qp as i16;
}
}
}
}
fn set_mode(&mut self, x0: usize, y0: usize, size: usize, mode: u8) {
for yy in (y0..y0 + size).step_by(4) {
for xx in (x0..x0 + size).step_by(4) {
if xx < self.w && yy < self.h {
self.mode_y[(yy / 4) * self.grid_w + xx / 4] = mode;
}
}
}
}
fn mark_decoded(&mut self, x0: usize, y0: usize, size: usize) {
for yy in (y0..y0 + size).step_by(4) {
for xx in (x0..x0 + size).step_by(4) {
if xx < self.w && yy < self.h {
self.decoded[(yy / 4) * self.grid_w + xx / 4] = true;
}
}
}
}
fn set_tqb(&mut self, x0: usize, y0: usize, size: usize) {
for yy in (y0..y0 + size).step_by(4) {
for xx in (x0..x0 + size).step_by(4) {
if xx < self.w && yy < self.h {
self.tqb[(yy / 4) * self.grid_w + xx / 4] = true;
}
}
}
}
/// cu_transquant_bypass_flag at a luma pixel (4×4 grid). Out-of-range → false.
fn tqb_at(&self, px: usize, py: usize) -> bool {
if px >= self.w || py >= self.h {
return false;
}
self.tqb[(py / 4) * self.grid_w + px / 4]
}
fn derive_luma_mode(&self, x0: usize, y0: usize, prev: bool, val: u8) -> u8 {
let cand_a = self.neighbor_mode(x0 as i32 - 1, y0 as i32, true);
let cand_b = self.neighbor_mode(x0 as i32, y0 as i32 - 1, false);
let mpm = mpm_list(cand_a, cand_b, y0, self.log2_ctb);
if prev {
mpm[val as usize]
} else {
let mut sorted = mpm;
sorted.sort_unstable();
let mut mode = val;
for &m in sorted.iter() {
if mode >= m {
mode += 1;
}
}
mode
}
}
fn neighbor_mode(&self, x: i32, y: i32, _left: bool) -> u8 {
if x < 0 || y < 0 || x as usize >= self.w || y as usize >= self.h {
return MODE_DC;
}
let g = (y as usize / 4) * self.grid_w + x as usize / 4;
self.mode_y[g]
}
fn decode_chroma_mode(&mut self, luma_mode: u8) -> u8 {
let bin0 = self.cab.decode_bin(&mut self.ictx.intra_chroma_pred_mode);
let derived = if bin0 == 0 {
luma_mode // DM
} else {
let mut idx = 0u8;
for _ in 0..2 {
idx = (idx << 1) | self.cab.decode_bypass();
}
let cand = [0u8, 26, 10, 1][idx as usize];
if cand == luma_mode { 34 } else { cand }
};
// HEVC §8.4.3 / Table 8-3: for ChromaArrayType==2 (4:2:2) the derived chroma
// intra mode is remapped (the asymmetric sampling rotates the angle). This
// mode drives both the angular prediction and the mode-dependent coefficient
// scan, so it must match the encoder exactly.
if self.sps.chroma_idc == 2 {
MODE_422_MAP[derived as usize]
} else {
derived
}
}
}
/// HEVC Table 8-3: derived-chroma-mode remap for 4:2:2 (ChromaArrayType==2).
static MODE_422_MAP: [u8; 35] = [
0, 1, 2, 2, 2, 2, 3, 5, 7, 8, 10, 12, 13, 15, 17, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 25,
26, 27, 27, 28, 28, 29, 29, 30, 31,
];
/// MPM candidate list (§8.4.2).
fn mpm_list(mut cand_a: u8, cand_b: u8, y0: usize, log2_ctb: u32) -> [u8; 3] {
// candB from a different CTB row → DC
let cand_b = if y0 > 0 && ((y0 - 1) >> log2_ctb) != (y0 >> log2_ctb) {
MODE_DC
} else {
cand_b
};
let _ = &mut cand_a;
if cand_a == cand_b {
if cand_a < 2 {
[MODE_PLANAR, MODE_DC, 26]
} else {
[
cand_a,
2 + ((cand_a as i32 + 29) % 32) as u8,
2 + ((cand_a as i32 - 2 + 1) % 32) as u8,
]
}
} else {
let m0 = cand_a;
let m1 = cand_b;
let m2 = if m0 != MODE_PLANAR && m1 != MODE_PLANAR {
MODE_PLANAR
} else if m0 != MODE_DC && m1 != MODE_DC {
MODE_DC
} else {
26
};
[m0, m1, m2]
}
}
impl<'a> FullDecoder<'a> {
#[allow(clippy::too_many_arguments)]
fn transform_tree(
&mut self,
x0: usize,
y0: usize,
xbase: usize,
ybase: usize,
log2_ts: u32,
depth: u8,
blk_idx: u8,
luma_modes: &[u8; 4],
chroma_mode: u8,
intra_split: bool,
max_depth: u32,
parent_cbf_cb: [bool; 2],
parent_cbf_cr: [bool; 2],
) {
let split_allowed = log2_ts <= self.log2_max_tb
&& log2_ts > self.log2_min_tb
&& (depth as u32) < max_depth
&& !(intra_split && depth == 0);
let split = if split_allowed {
self.cab
.decode_bin(&mut self.ctx.split_transform_flag[(5 - log2_ts) as usize])
!= 0
} else {
log2_ts > self.log2_max_tb || (intra_split && depth == 0)
};
// chroma cbf. For ChromaArrayType==2 (4:2:2) there are two stacked chroma
// TBs, each with its own cbf_cb / cbf_cr, signaled cb[0],cb[1],cr[0],cr[1]
// (HEVC §7.3.8.8). 4:2:0 / 4:4:4 have one of each.
let chroma_present = !self.sps.chroma.is_monochrome();
let _ = depth;
let n_tb = if self.sps.chroma_idc == 2 { 2 } else { 1 };
let mut cbf_cb = parent_cbf_cb;
let mut cbf_cr = parent_cbf_cr;
if chroma_present && (log2_ts > 2 || self.sps.chroma_idc == 3) {
for t in 0..n_tb {
if depth == 0 || parent_cbf_cb[t] {
cbf_cb[t] = self
.cab
.decode_bin(&mut self.ctx.cbf_chroma[depth.min(4) as usize])
!= 0;
}
}
for t in 0..n_tb {
if depth == 0 || parent_cbf_cr[t] {
cbf_cr[t] = self
.cab
.decode_bin(&mut self.ctx.cbf_chroma[depth.min(4) as usize])
!= 0;
}
}
}
if split {
let half = 1usize << (log2_ts - 1);
self.transform_tree(
x0,
y0,
x0,
y0,
log2_ts - 1,
depth + 1,
0,
luma_modes,
chroma_mode,
intra_split,
max_depth,
cbf_cb,
cbf_cr,
);
self.transform_tree(
x0 + half,
y0,
x0,
y0,
log2_ts - 1,
depth + 1,
1,
luma_modes,
chroma_mode,
intra_split,
max_depth,
cbf_cb,
cbf_cr,
);
self.transform_tree(
x0,
y0 + half,
x0,
y0,
log2_ts - 1,
depth + 1,
2,
luma_modes,
chroma_mode,
intra_split,
max_depth,
cbf_cb,
cbf_cr,
);
self.transform_tree(
x0 + half,
y0 + half,
x0,
y0,
log2_ts - 1,
depth + 1,
3,
luma_modes,
chroma_mode,
intra_split,
max_depth,
cbf_cb,
cbf_cr,
);
} else {
// cbf_luma always read for intra
let cbf_luma = self
.cab
.decode_bin(&mut self.ctx.cbf_luma[if depth == 0 { 1 } else { 0 }])
!= 0;
self.transform_unit(
x0,
y0,
xbase,
ybase,
log2_ts,
depth,
blk_idx,
luma_modes,
chroma_mode,
cbf_luma,
cbf_cb,
cbf_cr,
);
}
}
#[allow(clippy::too_many_arguments)]
fn transform_unit(
&mut self,
x0: usize,
y0: usize,
xbase: usize,
ybase: usize,
log2_ts: u32,
depth: u8,
blk_idx: u8,
luma_modes: &[u8; 4],
chroma_mode: u8,
cbf_luma: bool,
cbf_cb: [bool; 2],
cbf_cr: [bool; 2],
) {
let chroma_present = !self.sps.chroma.is_monochrome();
let _ = depth;
let any_chroma = cbf_cb.iter().any(|&b| b) || cbf_cr.iter().any(|&b| b);
let need_qp = cbf_luma || any_chroma;
// cu_qp_delta
if self.pps.cu_qp_delta_enabled && need_qp && !self.is_cu_qp_delta_coded {
self.cu_qp_delta_val = self.decode_cu_qp_delta();
self.is_cu_qp_delta_coded = true;
// recompute QpY for the QG
let qp_bd = 0; // 8/10/12-bit luma offset is 0 here (QpBdOffsetY=6*(bd-8) but applied symmetrically)
let off = 6 * (self.bd as i32 - 8);
self.cur_qp =
((self.predict_qp_cur() + self.cu_qp_delta_val + 52 + 2 * off) % (52 + off)) - off
+ qp_bd;
}
// luma residual + reconstruction
let luma_mode = self.luma_mode_at(x0, y0, luma_modes, blk_idx);
if cbf_luma {
let scan = luma_scan(luma_mode, log2_ts);
let ts_ctx = if self.pps.transform_skip_enabled && log2_ts == 2 {
Some(0)
} else {
None
};
let (levels, _tskip) = residual_coding(
&mut self.cab,
&mut self.ctx,
log2_ts,
true,
scan,
self.sign_hiding,
ts_ctx,
self.cu_tqb,
);
self.reconstruct_luma(x0, y0, log2_ts, luma_mode, &levels);
} else {
// prediction only (no residual) still needs to fill rec for neighbors
self.predict_only_luma(x0, y0, log2_ts, luma_mode);
}
// chroma
if chroma_present {
if log2_ts > 2 || self.sps.chroma_idc == 3 {
self.do_chroma(x0, y0, log2_ts, chroma_mode, cbf_cb, cbf_cr);
} else if blk_idx == 3 {
// 4×4 luma TUs: chroma coded once at parent 8×8 (log2=2 chroma)
self.do_chroma(xbase, ybase, 3, chroma_mode, cbf_cb, cbf_cr);
}
}
}
fn predict_qp_cur(&self) -> i32 {
// qPY_PRED was stored in cur_qp at QG entry (before delta).
self.cur_qp
}
fn decode_cu_qp_delta(&mut self) -> i32 {
// cu_qp_delta_abs: prefix TU (cMax=5) ctx[0] then ctx[1], then bypass EG0
let mut abs_val;
let mut prefix = 0;
while prefix < 5 {
let ci = if prefix == 0 { 0 } else { 1 };
if self.cab.decode_bin(&mut self.ctx.cu_qp_delta_abs[ci]) == 0 {
break;
}
prefix += 1;
}
abs_val = prefix;
if prefix >= 5 {
// EG0 suffix (bypass)
let mut k = 0;
while self.cab.decode_bypass() != 0 {
k += 1;
if k > 30 {
break;
}
}
let mut suffix = 0i32;
for _ in 0..k {
suffix = (suffix << 1) | self.cab.decode_bypass() as i32;
}
abs_val += suffix + (1 << k) - 1;
}
if abs_val > 0 {
let sign = self.cab.decode_bypass();
if sign != 0 { -abs_val } else { abs_val }
} else {
0
}
}
fn luma_mode_at(&self, x0: usize, y0: usize, _modes: &[u8; 4], _blk: u8) -> u8 {
self.mode_y[(y0 / 4) * self.grid_w + x0 / 4]
}
}
fn luma_scan(mode: u8, log2_ts: u32) -> u8 {
if log2_ts == 2 || log2_ts == 3 {
if (6..=14).contains(&mode) {
SCAN_VERT
} else if (22..=30).contains(&mode) {
SCAN_HORIZ
} else {
SCAN_DIAG
}
} else {
SCAN_DIAG
}
}
fn chroma_scan(mode: u8, log2_ts: u32, is_444: bool) -> u8 {
// HEVC §6.5.3: scan is mode-dependent for 4×4, and for 8×8 when it's luma
// (handled by luma_scan) or ChromaArrayType==3 (4:4:4). 4:2:0/4:2:2 chroma at
// 8×8 stays diagonal. Mirrors the encoder's dct::scan_idx_for.
let mode_dependent = log2_ts == 2 || (log2_ts == 3 && is_444);
if mode_dependent {
if (6..=14).contains(&mode) {
SCAN_VERT
} else if (22..=30).contains(&mode) {
SCAN_HORIZ
} else {
SCAN_DIAG
}
} else {
SCAN_DIAG
}
}
impl<'a> FullDecoder<'a> {
fn luma_avail(&self, x: i32, y: i32) -> bool {
if x < 0 || y < 0 || x as usize >= self.w || y as usize >= self.h {
return false;
}
self.decoded[(y as usize / 4) * self.grid_w + x as usize / 4]
}
fn chroma_avail(&self, cx: i32, cy: i32) -> bool {
if cx < 0 || cy < 0 || cx as usize >= self.cw || cy as usize >= self.ch {
return false;
}
let lx = cx as usize * self.sub_w;
let ly = cy as usize * self.sub_h;
if lx >= self.w || ly >= self.h {
return false;
}
self.decoded[(ly / 4) * self.grid_w + lx / 4]
}
fn gather_luma_refs_into(
&self,
x0: usize,
y0: usize,
n: usize,
above: &mut [Option<u16>],
left: &mut [Option<u16>],
) -> Option<u16> {
let corner = if self.luma_avail(x0 as i32 - 1, y0 as i32 - 1) {
Some(self.y[(y0 - 1) * self.w + (x0 - 1)])
} else {
None
};
for (i, (above, left)) in above[..2 * n].iter_mut().zip(left.iter_mut()).enumerate() {
let ax = x0 as i32 + i as i32;
*above = if self.luma_avail(ax, y0 as i32 - 1) {
Some(self.y[(y0 - 1) * self.w + ax as usize])
} else {
None
};
let ly = y0 as i32 + i as i32;
*left = if self.luma_avail(x0 as i32 - 1, ly) {
Some(self.y[ly as usize * self.w + (x0 - 1)])
} else {
None
};
}
corner
}
fn reconstruct_luma(&mut self, x0: usize, y0: usize, log2_ts: u32, mode: u8, levels: &[i32]) {
let n = 1usize << log2_ts;
self.predict_luma_block_into(x0, y0, n, mode);
if self.cu_tqb {
// Lossless: residual is the parsed level array verbatim (row-major),
// no scaling or inverse transform (HEVC §8.6.5).
self.res_scratch[..n * n].copy_from_slice(&levels[..n * n]);
} else {
let qp = self.cur_qp.clamp(0, 51) as u8;
transform::dequantize_i32_into(levels, n, qp, self.bd, &mut self.deq_scratch[..n * n]);
if n == 4 {
transform::inv_transform_dst_into(
&self.deq_scratch[..n * n],
self.bd,
&mut self.res_scratch[..n * n],
);
} else {
transform::inv_transform_into(
&self.deq_scratch[..n * n],
n,
self.bd,
&mut self.res_scratch[..n * n],
);
}
}
let max = (1i32 << self.bd) - 1;
for yy in 0..n {
for xx in 0..n {
let v = (self.scratch.pred[yy * n + xx] as i32 + self.res_scratch[yy * n + xx])
.clamp(0, max);
self.y[(y0 + yy) * self.w + (x0 + xx)] = v as u16;
}
}
self.mark_decoded(x0, y0, n);
}
fn predict_only_luma(&mut self, x0: usize, y0: usize, log2_ts: u32, mode: u8) {
let n = 1usize << log2_ts;
self.predict_luma_block_into(x0, y0, n, mode);
for yy in 0..n {
for xx in 0..n {
self.y[(y0 + yy) * self.w + (x0 + xx)] = self.scratch.pred[yy * n + xx];
}
}
self.mark_decoded(x0, y0, n);
}
fn predict_luma_block_into(&mut self, x0: usize, y0: usize, n: usize, mode: u8) {
let mut above = std::mem::take(&mut self.scratch.raw_above);
let mut left = std::mem::take(&mut self.scratch.raw_left);
let corner = self.gather_luma_refs_into(x0, y0, n, &mut above[..2 * n], &mut left[..2 * n]);
let neutral = 1u16 << (self.bd - 1);
let strong = self.strong_smoothing && self.sps.strong_intra_smoothing;
let sc = &mut self.scratch;
intra::substitute_refs_into(
corner,
&above[..2 * n],
&left[..2 * n],
n,
neutral,
&mut sc.sub_s,
&mut sc.sub_avail,
&mut sc.above,
&mut sc.left,
);
intra::filter_refs_into(
&sc.above[..2 * n + 1],
&sc.left[..2 * n + 1],
n,
mode,
true,
strong,
self.bd,
&mut sc.fa,
&mut sc.fl,
);
intra::predict_into(
mode,
&sc.fa[..2 * n + 1],
&sc.fl[..2 * n + 1],
n,
true,
self.bd,
&mut sc.pred[..n * n],
&mut sc.refs_ang,
);
self.scratch.raw_above = above;
self.scratch.raw_left = left;
}
fn do_chroma(
&mut self,
lx: usize,
ly: usize,
luma_log2: u32,
mode: u8,
cbf_cb: [bool; 2],
cbf_cr: [bool; 2],
) {
let idc = self.sps.chroma_idc;
let clog2 = if idc == 3 { luma_log2 } else { luma_log2 - 1 };
let cn = 1usize << clog2;
let cx0 = lx / self.sub_w;
let cy0 = ly / self.sub_h;
// 4:2:2 stacks two square chroma TBs vertically per luma TB (ChromaArrayType
// 2); 4:2:0 and 4:4:4 have a single chroma TB. The bitstream codes them
// component-major: all Cb TBs, then all Cr TBs (HEVC §7.3.8.11). Each TB is
// reconstructed before the next so a lower stacked TB can use the upper one
// as its intra above-reference.
let n_tb = if idc == 2 { 2 } else { 1 };
let scan = chroma_scan(mode, clog2, idc == 3);
let qp_cb = qpc(self.cur_qp + self.pps.cb_qp_offset, idc);
for (t, &cb) in cbf_cb[0..n_tb].iter().enumerate() {
let ty = cy0 + t * cn;
if cb {
let (levels, _) = residual_coding(
&mut self.cab,
&mut self.ctx,
clog2,
false,
scan,
self.sign_hiding,
None,
self.cu_tqb,
);
self.reconstruct_chroma(true, cx0, ty, cn, mode, &levels, qp_cb);
} else {
self.predict_only_chroma(true, cx0, ty, cn, mode);
}
}
let qp_cr = qpc(self.cur_qp + self.pps.cr_qp_offset, idc);
for (t, &cr) in cbf_cr[..n_tb].iter().enumerate() {
let ty = cy0 + t * cn;
if cr {
let (levels, _) = residual_coding(
&mut self.cab,
&mut self.ctx,
clog2,
false,
scan,
self.sign_hiding,
None,
self.cu_tqb,
);
self.reconstruct_chroma(false, cx0, ty, cn, mode, &levels, qp_cr);
} else {
self.predict_only_chroma(false, cx0, ty, cn, mode);
}
}
}
fn gather_chroma_refs_into(
&self,
is_cb: bool,
cx0: usize,
cy0: usize,
n: usize,
above: &mut [Option<u16>],
left: &mut [Option<u16>],
) -> Option<u16> {
let plane = if is_cb { &self.cb } else { &self.cr };
let corner = if self.chroma_avail(cx0 as i32 - 1, cy0 as i32 - 1) {
Some(plane[(cy0 - 1) * self.cw + (cx0 - 1)])
} else {
None
};
for i in 0..2 * n {
let ax = cx0 as i32 + i as i32;
above[i] = if self.chroma_avail(ax, cy0 as i32 - 1) {
Some(plane[(cy0 - 1) * self.cw + ax as usize])
} else {
None
};
let ly = cy0 as i32 + i as i32;
left[i] = if self.chroma_avail(cx0 as i32 - 1, ly) {
Some(plane[ly as usize * self.cw + (cx0 - 1)])
} else {
None
};
}
corner
}
fn predict_chroma_block_into(
&mut self,
is_cb: bool,
cx0: usize,
cy0: usize,
n: usize,
mode: u8,
) {
let mut above = std::mem::take(&mut self.scratch.raw_above);
let mut left = std::mem::take(&mut self.scratch.raw_left);
let corner = self.gather_chroma_refs_into(
is_cb,
cx0,
cy0,
n,
&mut above[..2 * n],
&mut left[..2 * n],
);
let neutral = 1u16 << (self.bd_c - 1);
let sc = &mut self.scratch;
intra::substitute_refs_into(
corner,
&above[..2 * n],
&left[..2 * n],
n,
neutral,
&mut sc.sub_s,
&mut sc.sub_avail,
&mut sc.above,
&mut sc.left,
);
// Reference filtering: 4:2:0/4:2:2 chroma TBs are 4×4 and never filtered.
// 4:4:4 chroma (≥8×8) filters references with the same [1 2 1] rule as luma
// (HEVC: cIdx>0 filters only when ChromaArrayType==3), but without the luma
// strong-intra-smoothing path. The DC/H/V prediction edge filter stays off
// for chroma (is_luma=false in predict_into).
if self.sps.chroma_idc == 3 {
intra::filter_refs_into(
&sc.above[..2 * n + 1],
&sc.left[..2 * n + 1],
n,
mode,
true, // apply the luma [1 2 1] filtering decision
false, // no strong intra smoothing for chroma
self.bd_c,
&mut sc.fa,
&mut sc.fl,
);
intra::predict_into(
mode,
&sc.fa[..2 * n + 1],
&sc.fl[..2 * n + 1],
n,
false,
self.bd_c,
&mut sc.pred[..n * n],
&mut sc.refs_ang,
);
} else {
intra::predict_into(
mode,
&sc.above[..2 * n + 1],
&sc.left[..2 * n + 1],
n,
false,
self.bd_c,
&mut sc.pred[..n * n],
&mut sc.refs_ang,
);
}
self.scratch.raw_above = above;
self.scratch.raw_left = left;
}
#[allow(clippy::too_many_arguments)]
fn reconstruct_chroma(
&mut self,
is_cb: bool,
cx0: usize,
cy0: usize,
n: usize,
mode: u8,
levels: &[i32],
qp: i32,
) {
self.predict_chroma_block_into(is_cb, cx0, cy0, n, mode);
if self.cu_tqb {
// Lossless: chroma residual is the parsed levels verbatim.
self.res_scratch[..n * n].copy_from_slice(&levels[..n * n]);
} else {
let qp_c = qp.clamp(0, 51) as u8;
transform::dequantize_i32_into(
levels,
n,
qp_c,
self.bd_c,
&mut self.deq_scratch[..n * n],
);
transform::inv_transform_into(
&self.deq_scratch[..n * n],
n,
self.bd_c,
&mut self.res_scratch[..n * n],
);
}
let max = (1i32 << self.bd_c) - 1;
// Copy scratch.pred out before mutable borrow of plane
let n2 = n * n;
let pred_tmp: [u16; 1024] = {
// max chroma TB = 16×16 = 256 samples
let mut buf = [0u16; 1024];
buf[..n2].copy_from_slice(&self.scratch.pred[..n2]);
buf
};
let plane = if is_cb { &mut self.cb } else { &mut self.cr };
for yy in 0..n {
for xx in 0..n {
let v =
(pred_tmp[yy * n + xx] as i32 + self.res_scratch[yy * n + xx]).clamp(0, max);
plane[(cy0 + yy) * self.cw + (cx0 + xx)] = v as u16;
}
}
}
fn predict_only_chroma(&mut self, is_cb: bool, cx0: usize, cy0: usize, n: usize, mode: u8) {
self.predict_chroma_block_into(is_cb, cx0, cy0, n, mode);
let n2 = n * n;
let pred_tmp: [u16; 1024] = {
let mut buf = [0u16; 1024];
buf[..n2].copy_from_slice(&self.scratch.pred[..n2]);
buf
};
let plane = if is_cb { &mut self.cb } else { &mut self.cr };
for yy in 0..n {
for xx in 0..n {
plane[(cy0 + yy) * self.cw + (cx0 + xx)] = pred_tmp[yy * n + xx];
}
}
}
}
/// Chroma QP mapping (Table 8-10). ChromaArrayType 1 (4:2:0) uses the table;
/// 2/3 clamp differently but share the <30 / table / -6 structure.
fn qpc(qpi: i32, chroma_idc: u8) -> i32 {
let qpi = qpi.clamp(0, 57);
if chroma_idc != 1 {
// 4:2:2 / 4:4:4: QpC = min(qpi, 51)
return qpi.min(51);
}
if qpi < 30 {
qpi
} else if qpi > 43 {
qpi - 6
} else {
const T: [i32; 14] = [29, 30, 31, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37];
T[(qpi - 30) as usize]
}
}
// ── Top-level entry point for lib.rs ────────────────────────────────────────
/// Parse a slice header from the RBSP (after 2-byte NAL header has been consumed
/// by the caller or is still in the byte slice — we consume it here).
/// Returns (slice_qp, sao_luma, sao_chroma, cabac_byte_offset).
pub(crate) fn parse_slice_header_full(
rbsp: &[u8],
sps: &crate::config::Sps,
pps: &crate::config::Pps,
nal_type: u8,
) -> Result<(i32, bool, bool, usize), crate::error::DecodeError> {
let mut r = crate::bitreader::BitReader::new(rbsp);
let e = |s: &'static str| crate::error::DecodeError::Bitstream(s.into());
r.read_bits(16).map_err(|_| e("NAL header"))?; // consume 2-byte NAL header
let _first = r.read_flag().map_err(|_| e("first_slice"))?;
let is_irap = (16..=23).contains(&nal_type);
if is_irap {
r.read_flag().map_err(|_| e("no_prior_pics"))?;
}
let _pps_id = r.read_ue().map_err(|_| e("pps_id"))?;
for _ in 0..pps.num_extra_slice_header_bits {
r.read_bit().map_err(|_| e("extra_bits"))?;
}
let _slice_type = r.read_ue().map_err(|_| e("slice_type"))?;
if pps.output_flag_present {
r.read_flag().map_err(|_| e("pic_output_flag"))?;
}
if sps.separate_colour_plane {
r.read_bits(2).map_err(|_| e("colour_plane"))?;
}
let is_idr = nal_type == 19 || nal_type == 20;
if !is_idr { /* skip poc/ref-pic-set — not for IDR */ }
let mut sao_luma = false;
let mut sao_chroma = false;
if sps.sao_enabled {
sao_luma = r.read_flag().map_err(|_| e("sao_luma"))?;
if !sps.chroma.is_monochrome() {
sao_chroma = r.read_flag().map_err(|_| e("sao_chroma"))?;
}
}
let slice_qp_delta = r.read_se().map_err(|_| e("qp_delta"))?;
let slice_qp = pps.init_qp + slice_qp_delta;
if pps.slice_chroma_qp_offsets_present {
r.read_se().map_err(|_| e("cb_qp_off"))?;
r.read_se().map_err(|_| e("cr_qp_off"))?;
}
let mut deblock_override = false;
if pps.deblocking_filter_override_enabled {
deblock_override = r.read_flag().map_err(|_| e("deblock_override"))?;
}
if deblock_override {
let disabled = r.read_flag().map_err(|_| e("deblock_disabled"))?;
if !disabled {
r.read_se().map_err(|_| e("beta_off"))?;
r.read_se().map_err(|_| e("tc_off"))?;
}
}
if pps.loop_filter_across_slices && (sao_luma || sao_chroma || !pps.deblocking_filter_disabled)
{
r.read_flag()
.map_err(|_| e("loop_filter_across_slices_flag"))?;
}
if pps.tiles_enabled || pps.entropy_coding_sync_enabled {
let n = r.read_ue().map_err(|_| e("num_entry_points"))?;
if n > 0 {
let len = r.read_ue().map_err(|_| e("offset_len"))? + 1;
for _ in 0..n {
r.read_bits(len).map_err(|_| e("entry_point"))?;
}
}
}
if pps.slice_segment_header_extension_present {
let l = r.read_ue().map_err(|_| e("ext_len"))?;
for _ in 0..l {
r.read_bits(8).map_err(|_| e("ext_byte"))?;
}
}
r.read_bit().map_err(|_| e("alignment_bit"))?;
while !r.bit_pos().is_multiple_of(8) {
r.read_bit().map_err(|_| e("alignment_pad"))?;
}
Ok((slice_qp, sao_luma, sao_chroma, r.bit_pos() / 8))
}