Repository navigation
Expand file tree
/
Copy pathtile.rs
More file actions
2265 lines (2185 loc) · 90.1 KB
/
Copy pathtile.rs
File metadata and controls
2265 lines (2185 loc) · 90.1 KB
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
//! Tile decoding: partitions, mode info, residual coefficients, prediction and reconstruction
//! (spec 5.11 syntax with the 8.3 CDF selection and 7.11 / 7.12 / 7.13 processes).
use crate::Result;
use crate::cdf::Cdfs;
use crate::frame::{MiInfo, Mv};
use crate::header::{FrameHeader, NONE, SequenceHeader};
use crate::intra::{IntraParams, is_directional_mode, predict_intra, round2_signed};
use crate::spec_tables::*;
use crate::state::{FrameShared, TileState};
use crate::symbol::SymbolDecoder;
use crate::transform::inverse_transform_2d;
/// Per-block state (the block-level variables of the syntax).
#[derive(Clone, Default)]
pub(crate) struct Block {
pub mi_row: usize,
pub mi_col: usize,
pub mi_size: usize,
pub bw4: usize,
pub bh4: usize,
pub has_chroma: bool,
pub avail_u: bool,
pub avail_l: bool,
pub avail_u_chroma: bool,
pub avail_l_chroma: bool,
pub skip: bool,
pub skip_mode: bool,
pub segment_id: usize,
pub lossless: bool,
pub is_inter: bool,
pub use_intrabc: bool,
pub y_mode: usize,
pub uv_mode: usize,
pub angle_delta_y: i32,
pub angle_delta_uv: i32,
pub use_filter_intra: bool,
pub filter_intra_mode: usize,
pub cfl_alpha_u: i32,
pub cfl_alpha_v: i32,
pub palette_size_y: usize,
pub palette_size_uv: usize,
pub palette_colors_y: [u16; 8],
pub palette_colors_u: [u16; 8],
pub palette_colors_v: [u16; 8],
pub tx_size: usize,
pub ref_frame: [i8; 2],
pub mv: [Mv; 2],
pub interp_filter: [u8; 2],
pub motion_mode: u8,
pub comp_group_idx: u8,
pub compound_idx: u8,
pub max_luma_w: usize,
pub max_luma_h: usize,
/// Mv[ ] / PredMv[ ] (row, col) for the two reference lists.
pub mv_i: [[i32; 2]; 2],
pub pred_mv: [[i32; 2]; 2],
pub ref_mv_idx: usize,
pub interintra: bool,
pub interintra_mode: usize,
pub wedge_interintra: bool,
pub wedge_index: usize,
pub wedge_sign: usize,
pub mask_type: usize,
pub compound_type: usize,
pub local_valid: bool,
pub local_warp_params: [i32; 6],
}
/// Decoder for one tile.
pub(crate) struct TileDecoder<'a, 'f> {
pub fs: &'f FrameShared,
pub t: &'f mut TileState,
pub sd: SymbolDecoder<'a>,
pub cdf: Box<Cdfs>,
pub mi_row_start: usize,
pub mi_row_end: usize,
pub mi_col_start: usize,
pub mi_col_end: usize,
pub current_q_index: i32,
pub delta_lf: [i32; 4],
pub read_deltas: bool,
pub ref_sgr_xqd: [[i32; 2]; 3],
pub ref_lr_wiener: [[[i32; 3]; 2]; 3],
/// BlockDecoded[ plane ][ y + 1 ][ x + 1 ] for y, x in -1..=32.
pub block_decoded: [[[bool; 35]; 35]; 3],
pub b: Block,
pub mvs: crate::mvpred::MvStack,
pub nb: crate::inter_info::Neighbours,
/// Quant[] for the current transform block (raster order, stride per Adjusted size).
quant: Vec<i32>,
dequant: Vec<i32>,
residual: Vec<i32>,
color_map_y: Vec<u8>,
color_map_uv: Vec<u8>,
plane_tx_type: usize,
pub pred_buf: [Vec<i32>; 2],
pub mask: Vec<i32>,
/// Intermediate rows of the sub-pixel filters (up to 2 x 128 + 8 rows of 128 with 2:1 scaled references).
pub mc_tmp: Vec<i32>,
/// Coefficient levels of the current transform block, padded (see TX_PAD).
levels: Vec<u8>,
}
const SB_MAX: usize = 32; // superblock size in 4x4 units (128 / 4)
fn block_width(bs: usize) -> usize {
4 * NUM_4X4_BLOCKS_WIDE[bs] as usize
}
fn block_height(bs: usize) -> usize {
4 * NUM_4X4_BLOCKS_HIGH[bs] as usize
}
impl<'a, 'f> TileDecoder<'a, 'f> {
pub fn new(fs: &'f FrameShared, t: &'f mut TileState, data: &'a [u8], cdf: Box<Cdfs>, tile_row: usize, tile_col: usize) -> Self {
let ti = &fs.fh.tile_info;
let (rs, re) = (ti.mi_row_starts[tile_row] as usize, ti.mi_row_starts[tile_row + 1] as usize);
let (cs, ce) = (ti.mi_col_starts[tile_col] as usize, ti.mi_col_starts[tile_col + 1] as usize);
let disable = fs.fh.disable_cdf_update;
let q = fs.fh.quant.base_q_idx as i32;
TileDecoder {
fs,
t,
sd: SymbolDecoder::new(data, disable),
cdf,
mi_row_start: rs,
mi_row_end: re,
mi_col_start: cs,
mi_col_end: ce,
current_q_index: q,
delta_lf: [0; 4],
read_deltas: false,
ref_sgr_xqd: [[0; 2]; 3],
ref_lr_wiener: [[[0; 3]; 2]; 3],
block_decoded: [[[false; 35]; 35]; 3],
b: Block::default(),
mvs: Default::default(),
nb: Default::default(),
quant: vec![0; 1024],
dequant: vec![0; 64 * 64],
residual: vec![0; 64 * 64],
color_map_y: vec![0; 64 * 64],
color_map_uv: vec![0; 64 * 64],
plane_tx_type: 0,
pred_buf: [vec![0; 128 * 128], vec![0; 128 * 128]],
mask: vec![0; 128 * 128],
mc_tmp: vec![0; (2 * 128 + 8) * 128],
levels: vec![0; (32 + TX_PAD) * (32 + TX_PAD)],
}
}
fn seq(&self) -> &SequenceHeader {
&self.fs.seq
}
fn fh(&self) -> &FrameHeader {
&self.fs.fh
}
#[inline]
fn is_inside(&self, r: isize, c: isize) -> bool {
c >= self.mi_col_start as isize && c < self.mi_col_end as isize && r >= self.mi_row_start as isize && r < self.mi_row_end as isize
}
/// decode_tile( )
pub fn decode_tile(&mut self) -> Result<()> {
// clear_above_context( )
let t = &mut *self.t;
for p in 0..3 {
t.above_level[p].fill(0);
t.above_dc[p].fill(0);
}
t.above_seg_pred.fill(0);
self.delta_lf = [0; 4];
for plane in 0..self.fs.num_planes {
for pass in 0..2 {
self.ref_sgr_xqd[plane][pass] = [-32, 31][pass];
self.ref_lr_wiener[plane][pass] = [3, -7, 15];
}
}
let sb128 = self.seq().use_128x128_superblock;
let sb_size = if sb128 { BLOCK_128X128 } else { BLOCK_64X64 };
let sb4 = NUM_4X4_BLOCKS_WIDE[sb_size] as usize;
let mut r = self.mi_row_start;
while r < self.mi_row_end {
// clear_left_context( )
let t = &mut *self.t;
for p in 0..3 {
t.left_level[p].fill(0);
t.left_dc[p].fill(0);
}
t.left_seg_pred.fill(0);
let mut c = self.mi_col_start;
while c < self.mi_col_end {
self.read_deltas = self.fh().delta_q_present;
self.clear_cdef(r, c);
self.clear_block_decoded_flags(r, c, sb4);
self.read_lr(r, c, sb_size);
self.decode_partition(r, c, sb_size)?;
c += sb4;
}
r += sb4;
}
Ok(())
}
fn clear_cdef(&mut self, r: usize, c: usize) {
let t = &mut *self.t;
t.set_cdef_idx(r, c, -1);
if self.fs.seq.use_128x128_superblock {
t.set_cdef_idx(r, c + 16, -1);
t.set_cdef_idx(r + 16, c, -1);
t.set_cdef_idx(r + 16, c + 16, -1);
}
}
fn clear_block_decoded_flags(&mut self, r: usize, c: usize, sb4: usize) {
let (ssx, ssy) = (self.fs.ssx, self.fs.ssy);
for plane in 0..self.fs.num_planes {
let sub_x = if plane > 0 { ssx } else { 0 };
let sub_y = if plane > 0 { ssy } else { 0 };
let sb_w4 = (self.mi_col_end as isize - c as isize) >> sub_x;
let sb_h4 = (self.mi_row_end as isize - r as isize) >> sub_y;
let bd = &mut self.block_decoded[plane];
for y in -1..=((sb4 >> sub_y) as isize) {
for x in -1..=((sb4 >> sub_x) as isize) {
let v = if y < 0 && x < sb_w4 { true } else { x < 0 && y < sb_h4 };
bd[(y + 1) as usize][(x + 1) as usize] = v;
}
}
bd[(sb4 >> sub_y) + 1][0] = false;
}
}
#[inline]
pub(crate) fn block_decoded_at(&self, plane: usize, y: isize, x: isize) -> bool {
let (yy, xx) = (y + 1, x + 1);
if yy < 0 || xx < 0 || yy > SB_MAX as isize + 1 || xx > SB_MAX as isize + 1 {
return false;
}
self.block_decoded[plane][yy as usize][xx as usize]
}
fn decode_partition(&mut self, r: usize, c: usize, bsize: usize) -> Result<()> {
let (mi_rows, mi_cols) = (self.fs.fh.mi_rows as usize, self.fs.fh.mi_cols as usize);
if r >= mi_rows || c >= mi_cols {
return Ok(());
}
let avail_u = self.is_inside(r as isize - 1, c as isize);
let avail_l = self.is_inside(r as isize, c as isize - 1);
let num4x4 = NUM_4X4_BLOCKS_WIDE[bsize] as usize;
let half = num4x4 >> 1;
let quarter = half >> 1;
let has_rows = (r + half) < mi_rows;
let has_cols = (c + half) < mi_cols;
let partition = if bsize < BLOCK_8X8 {
PARTITION_NONE
} else {
let bsl = MI_WIDTH_LOG2[bsize] as usize;
let mi = &self.t.mi;
let above = avail_u && (MI_WIDTH_LOG2[mi.mi_size[mi.idx(r - 1, c)] as usize] as usize) < bsl;
let left = avail_l && (MI_HEIGHT_LOG2[mi.mi_size[mi.idx(r, c - 1)] as usize] as usize) < bsl;
let ctx = left as usize * 2 + above as usize;
if has_rows && has_cols {
let cdf: &mut [u16] = match bsl {
1 => &mut self.cdf.partition_w8[ctx],
2 => &mut self.cdf.partition_w16[ctx],
3 => &mut self.cdf.partition_w32[ctx],
4 => &mut self.cdf.partition_w64[ctx],
_ => &mut self.cdf.partition_w128[ctx],
};
self.sd.read_symbol(cdf)
} else if has_cols || has_rows {
let pcdf: Vec<u16> = match bsl {
2 => self.cdf.partition_w16[ctx].to_vec(),
3 => self.cdf.partition_w32[ctx].to_vec(),
4 => self.cdf.partition_w64[ctx].to_vec(),
_ => self.cdf.partition_w128[ctx].to_vec(),
};
// pcdf holds cumulative values; P(k) = cdf[k] - cdf[k-1] (cdf[-1] = 0)
let pr = |k: usize| pcdf[k] as i32 - if k == 0 { 0 } else { pcdf[k - 1] as i32 };
let psum = if has_cols {
// split_or_horz
let mut s = pr(PARTITION_VERT) + pr(PARTITION_SPLIT) + pr(PARTITION_HORZ_A) + pr(PARTITION_VERT_A) + pr(PARTITION_VERT_B);
if bsize != BLOCK_128X128 {
s += pr(PARTITION_VERT_4);
}
s
} else {
let mut s = pr(PARTITION_HORZ) + pr(PARTITION_SPLIT) + pr(PARTITION_HORZ_A) + pr(PARTITION_HORZ_B) + pr(PARTITION_VERT_A);
if bsize != BLOCK_128X128 {
s += pr(PARTITION_HORZ_4);
}
s
};
// The spec's inverse-CDF convention: cdf values count down from 32768.
let _ = psum;
let bit = self.read_split_bool(&pcdf, has_cols, bsize);
if has_cols {
if bit { PARTITION_SPLIT } else { PARTITION_HORZ }
} else if bit {
PARTITION_SPLIT
} else {
PARTITION_VERT
}
} else {
PARTITION_SPLIT
}
};
let sub_size = PARTITION_SUBSIZE[partition][bsize] as usize;
let split_size = PARTITION_SUBSIZE[PARTITION_SPLIT][bsize] as usize;
match partition {
PARTITION_NONE => self.decode_block(r, c, sub_size)?,
PARTITION_HORZ => {
self.decode_block(r, c, sub_size)?;
if has_rows {
self.decode_block(r + half, c, sub_size)?;
}
}
PARTITION_VERT => {
self.decode_block(r, c, sub_size)?;
if has_cols {
self.decode_block(r, c + half, sub_size)?;
}
}
PARTITION_SPLIT => {
self.decode_partition(r, c, sub_size)?;
self.decode_partition(r, c + half, sub_size)?;
self.decode_partition(r + half, c, sub_size)?;
self.decode_partition(r + half, c + half, sub_size)?;
}
PARTITION_HORZ_A => {
self.decode_block(r, c, split_size)?;
self.decode_block(r, c + half, split_size)?;
self.decode_block(r + half, c, sub_size)?;
}
PARTITION_HORZ_B => {
self.decode_block(r, c, sub_size)?;
self.decode_block(r + half, c, split_size)?;
self.decode_block(r + half, c + half, split_size)?;
}
PARTITION_VERT_A => {
self.decode_block(r, c, split_size)?;
self.decode_block(r + half, c, split_size)?;
self.decode_block(r, c + half, sub_size)?;
}
PARTITION_VERT_B => {
self.decode_block(r, c, sub_size)?;
self.decode_block(r, c + half, split_size)?;
self.decode_block(r + half, c + half, split_size)?;
}
PARTITION_HORZ_4 => {
for k in 0..4 {
let rr = r + quarter * k;
if k < 3 || rr < mi_rows {
self.decode_block(rr, c, sub_size)?;
}
}
}
_ => {
for k in 0..4 {
let cc = c + quarter * k;
if k < 3 || cc < mi_cols {
self.decode_block(r, cc, sub_size)?;
}
}
}
}
Ok(())
}
/// split_or_horz / split_or_vert: a binary symbol whose probability is derived from the
/// partition CDF (8.3.2). Returns true for PARTITION_SPLIT.
fn read_split_bool(&mut self, pcdf: &[u16], split_or_horz: bool, bsize: usize) -> bool {
// The spec gives cdf values as P(X <= k) * 32768 (increasing); the probability of
// partition k is cdf[k] - cdf[k - 1].
let pr = |k: usize| pcdf[k] as i32 - if k == 0 { 0 } else { pcdf[k - 1] as i32 };
let mut psum = if split_or_horz {
pr(PARTITION_VERT) + pr(PARTITION_SPLIT) + pr(PARTITION_HORZ_A) + pr(PARTITION_VERT_A) + pr(PARTITION_VERT_B)
} else {
pr(PARTITION_HORZ) + pr(PARTITION_SPLIT) + pr(PARTITION_HORZ_A) + pr(PARTITION_HORZ_B) + pr(PARTITION_VERT_A)
};
if bsize != BLOCK_128X128 {
psum += if split_or_horz { pr(PARTITION_VERT_4) } else { pr(PARTITION_HORZ_4) };
}
let mut cdf = [((1i32 << 15) - psum) as u16, 1 << 15, 0];
// no adaptation: the array is constructed for this read only
let save = self.sd.disable_update;
self.sd.disable_update = true;
let s = self.sd.read_symbol(&mut cdf);
self.sd.disable_update = save;
s == 1
}
fn decode_block(&mut self, r: usize, c: usize, sub_size: usize) -> Result<()> {
let (ssx, ssy) = (self.fs.ssx, self.fs.ssy);
let num_planes = self.fs.num_planes;
let mut b = Block { mi_row: r, mi_col: c, mi_size: sub_size, ..Default::default() };
b.bw4 = NUM_4X4_BLOCKS_WIDE[sub_size] as usize;
b.bh4 = NUM_4X4_BLOCKS_HIGH[sub_size] as usize;
b.has_chroma = if b.bh4 == 1 && ssy == 1 && (r & 1) == 0 || b.bw4 == 1 && ssx == 1 && (c & 1) == 0 { false } else { num_planes > 1 };
b.avail_u = self.is_inside(r as isize - 1, c as isize);
b.avail_l = self.is_inside(r as isize, c as isize - 1);
b.avail_u_chroma = b.avail_u;
b.avail_l_chroma = b.avail_l;
if b.has_chroma {
if ssy == 1 && b.bh4 == 1 {
b.avail_u_chroma = self.is_inside(r as isize - 2, c as isize);
}
if ssx == 1 && b.bw4 == 1 {
b.avail_l_chroma = self.is_inside(r as isize, c as isize - 2);
}
} else {
b.avail_u_chroma = false;
b.avail_l_chroma = false;
}
b.ref_frame = [INTRA_FRAME as i8, NONE];
self.b = b;
if self.fs.fh.frame_is_intra {
self.intra_frame_mode_info()?;
} else {
self.inter_frame_mode_info()?;
}
self.palette_tokens();
self.read_block_tx_size();
if self.b.skip {
self.reset_block_context();
}
let b = &self.b;
let is_compound = b.ref_frame[1] > INTRA_FRAME as i8;
{
let mi = &mut self.t.mi;
let rows = b.bh4.min(mi.rows.saturating_sub(r));
let cols = b.bw4.min(mi.cols.saturating_sub(c));
let set_uv = b.ref_frame[0] == INTRA_FRAME as i8 && b.has_chroma;
let mvs = [Mv::new(b.mv_i[0][0], b.mv_i[0][1]), Mv::new(b.mv_i[1][0], b.mv_i[1][1])];
for y in 0..rows {
let i = mi.idx(r + y, c);
let span = i..i + cols;
mi.y_mode[span.clone()].fill(b.y_mode as u8);
if set_uv {
mi.uv_mode[span.clone()].fill(b.uv_mode as u8);
}
mi.ref_frame[span.clone()].fill(b.ref_frame);
mi.written[span.clone()].fill(true);
if b.is_inter {
if !b.use_intrabc {
mi.comp_group_idx[span.clone()].fill(b.comp_group_idx);
mi.compound_idx[span.clone()].fill(b.compound_idx);
}
mi.interp_filter[span.clone()].fill(b.interp_filter);
for m in mi.mv[span].iter_mut() {
m[0] = mvs[0];
if is_compound {
m[1] = mvs[1];
}
}
}
}
}
self.compute_prediction()?;
self.residual()?;
let b = &self.b;
let delta_lf = self.delta_lf;
let mi = &mut self.t.mi;
let rows = b.bh4.min(mi.rows.saturating_sub(r));
let cols = b.bw4.min(mi.cols.saturating_sub(c));
let dlf = [delta_lf[0] as i8, delta_lf[1] as i8, delta_lf[2] as i8, delta_lf[3] as i8];
for y in 0..rows {
let i = mi.idx(r + y, c);
let span = i..i + cols;
mi.is_inter[span.clone()].fill(b.is_inter);
mi.skip_mode[span.clone()].fill(b.skip_mode);
mi.skip[span.clone()].fill(b.skip);
mi.tx_size[span.clone()].fill(b.tx_size as u8);
mi.mi_size[span.clone()].fill(b.mi_size as u8);
mi.segment_id[span.clone()].fill(b.segment_id as u8);
if !mi.palette_size[0].is_empty() {
mi.palette_size[0][span.clone()].fill(b.palette_size_y as u8);
mi.palette_size[1][span.clone()].fill(b.palette_size_uv as u8);
mi.palette_colors[0][span.clone()].fill(b.palette_colors_y);
mi.palette_colors[1][span.clone()].fill(b.palette_colors_u);
}
mi.delta_lf[span.clone()].fill(dlf);
mi.motion_mode[span].fill(b.motion_mode);
}
Ok(())
}
fn reset_block_context(&mut self) {
let b = &self.b;
let (ssx, ssy) = (self.fs.ssx, self.fs.ssy);
for plane in 0..(1 + 2 * b.has_chroma as usize) {
let sub_x = if plane > 0 { ssx } else { 0 };
let sub_y = if plane > 0 { ssy } else { 0 };
for i in (b.mi_col >> sub_x)..((b.mi_col + b.bw4) >> sub_x) {
self.t.above_level[plane][i] = 0;
self.t.above_dc[plane][i] = 0;
}
for i in (b.mi_row >> sub_y)..((b.mi_row + b.bh4) >> sub_y) {
self.t.left_level[plane][i] = 0;
self.t.left_dc[plane][i] = 0;
}
}
}
fn intra_frame_mode_info(&mut self) -> Result<()> {
self.b.skip = false;
let pre_skip = self.fs.fh.seg.seg_id_pre_skip;
if pre_skip {
self.intra_segment_id();
}
self.b.skip_mode = false;
self.read_skip();
if !pre_skip {
self.intra_segment_id();
}
self.read_cdef();
self.read_delta_qindex();
self.read_delta_lf();
self.read_deltas = false;
self.b.ref_frame = [INTRA_FRAME as i8, NONE];
self.b.use_intrabc = if self.fs.fh.allow_intrabc { self.sd.read_symbol(&mut self.cdf.intrabc) == 1 } else { false };
if self.b.use_intrabc {
self.b.is_inter = true;
self.b.y_mode = DC_PRED;
self.b.uv_mode = DC_PRED;
self.b.motion_mode = SIMPLE as u8;
self.b.compound_type = COMPOUND_AVERAGE;
self.b.palette_size_y = 0;
self.b.palette_size_uv = 0;
self.b.interp_filter = [crate::header::BILINEAR; 2];
self.find_mv_stack(false);
self.assign_mv(false)?;
return Ok(());
}
self.b.is_inter = false;
let mi = &self.t.mi;
let (r, c) = (self.b.mi_row, self.b.mi_col);
let above = if self.b.avail_u { mi.y_mode[mi.idx(r - 1, c)] as usize } else { DC_PRED };
let left = if self.b.avail_l { mi.y_mode[mi.idx(r, c - 1)] as usize } else { DC_PRED };
let actx = INTRA_MODE_CONTEXT[above] as usize;
let lctx = INTRA_MODE_CONTEXT[left] as usize;
let mut cdf = self.t.intra_frame_y_mode_cdf[actx][lctx];
self.b.y_mode = self.sd.read_symbol(&mut cdf);
self.t.intra_frame_y_mode_cdf[actx][lctx] = cdf;
self.intra_angle_info_y();
if self.b.has_chroma {
self.read_uv_mode();
if self.b.uv_mode == UV_CFL_PRED {
self.read_cfl_alphas();
}
self.intra_angle_info_uv();
}
self.b.palette_size_y = 0;
self.b.palette_size_uv = 0;
let ms = self.b.mi_size;
if ms >= BLOCK_8X8 && block_width(ms) <= 64 && block_height(ms) <= 64 && self.fs.fh.allow_screen_content_tools {
self.palette_mode_info();
}
self.filter_intra_mode_info();
Ok(())
}
pub(crate) fn read_uv_mode(&mut self) {
let ms = self.b.mi_size;
let cfl_allowed = if self.b.lossless && self.fs.plane_residual_size(ms, 1) == BLOCK_4X4 {
true
} else {
!self.b.lossless && block_width(ms).max(block_height(ms)) <= 32
};
let y = self.b.y_mode;
self.b.uv_mode =
if cfl_allowed { self.sd.read_symbol(&mut self.cdf.uv_mode_cfl_allowed[y]) } else { self.sd.read_symbol(&mut self.cdf.uv_mode_cfl_not_allowed[y]) };
}
pub(crate) fn intra_angle_info_y(&mut self) {
self.b.angle_delta_y = 0;
if self.b.mi_size >= BLOCK_8X8 && is_directional_mode(self.b.y_mode) {
let v = self.sd.read_symbol(&mut self.cdf.angle_delta[self.b.y_mode - V_PRED]);
self.b.angle_delta_y = v as i32 - MAX_ANGLE_DELTA as i32;
}
}
pub(crate) fn intra_angle_info_uv(&mut self) {
self.b.angle_delta_uv = 0;
if self.b.mi_size >= BLOCK_8X8 && is_directional_mode(self.b.uv_mode) {
let v = self.sd.read_symbol(&mut self.cdf.angle_delta[self.b.uv_mode - V_PRED]);
self.b.angle_delta_uv = v as i32 - MAX_ANGLE_DELTA as i32;
}
}
pub(crate) fn read_cfl_alphas(&mut self) {
let signs = self.sd.read_symbol(&mut self.cdf.cfl_sign);
let sign_u = (signs + 1) / 3;
let sign_v = (signs + 1) % 3;
self.b.cfl_alpha_u = if sign_u != CFL_SIGN_ZERO {
let ctx = (sign_u - 1) * 3 + sign_v;
let a = 1 + self.sd.read_symbol(&mut self.cdf.cfl_alpha[ctx]) as i32;
if sign_u == CFL_SIGN_NEG { -a } else { a }
} else {
0
};
self.b.cfl_alpha_v = if sign_v != CFL_SIGN_ZERO {
let ctx = (sign_v - 1) * 3 + sign_u;
let a = 1 + self.sd.read_symbol(&mut self.cdf.cfl_alpha[ctx]) as i32;
if sign_v == CFL_SIGN_NEG { -a } else { a }
} else {
0
};
}
fn intra_segment_id(&mut self) {
if self.fs.fh.seg.enabled {
self.read_segment_id();
} else {
self.b.segment_id = 0;
}
self.b.lossless = self.fs.fh.lossless_array[self.b.segment_id];
}
pub(crate) fn read_segment_id(&mut self) {
let (r, c) = (self.b.mi_row, self.b.mi_col);
let mi = &self.t.mi;
let prev_ul = if self.b.avail_u && self.b.avail_l { mi.segment_id[mi.idx(r - 1, c - 1)] as i32 } else { -1 };
let prev_u = if self.b.avail_u { mi.segment_id[mi.idx(r - 1, c)] as i32 } else { -1 };
let prev_l = if self.b.avail_l { mi.segment_id[mi.idx(r, c - 1)] as i32 } else { -1 };
let pred = if prev_u == -1 {
if prev_l == -1 { 0 } else { prev_l }
} else if prev_l == -1 || prev_ul == prev_u {
prev_u
} else {
prev_l
};
if self.b.skip {
self.b.segment_id = pred as usize;
} else {
let ctx = if prev_ul < 0 {
0
} else if prev_ul == prev_u && prev_ul == prev_l {
2
} else if prev_ul == prev_u || prev_ul == prev_l || prev_u == prev_l {
1
} else {
0
};
let s = self.sd.read_symbol(&mut self.cdf.segment_id[ctx]) as i32;
let max = self.fs.fh.seg.last_active_seg_id as i32 + 1;
self.b.segment_id = neg_deinterleave(s, pred, max).clamp(0, 7) as usize;
}
}
fn seg_feature_active(&self, feature: usize) -> bool {
self.fs.fh.seg.enabled && self.fs.fh.seg.features.enabled[self.b.segment_id][feature]
}
pub(crate) fn read_skip(&mut self) {
if self.fs.fh.seg.seg_id_pre_skip && self.seg_feature_active(SEG_LVL_SKIP) {
self.b.skip = true;
} else {
let (r, c) = (self.b.mi_row, self.b.mi_col);
let mi = &self.t.mi;
let mut ctx = 0;
if self.b.avail_u {
ctx += mi.skip[mi.idx(r - 1, c)] as usize;
}
if self.b.avail_l {
ctx += mi.skip[mi.idx(r, c - 1)] as usize;
}
self.b.skip = self.sd.read_symbol(&mut self.cdf.skip[ctx]) == 1;
}
}
pub(crate) fn read_cdef(&mut self) {
let fh = &self.fs.fh;
if self.b.skip || fh.coded_lossless || !self.fs.seq.enable_cdef || fh.allow_intrabc {
return;
}
let cdef_size4 = NUM_4X4_BLOCKS_WIDE[BLOCK_64X64] as usize;
let mask = !(cdef_size4 - 1);
let r = self.b.mi_row & mask;
let c = self.b.mi_col & mask;
if self.t.cdef_idx(r, c) == -1 {
let bits = fh.cdef.bits;
let v = self.sd.read_literal(bits) as i8;
let w4 = self.b.bw4;
let h4 = self.b.bh4;
let mut i = r;
while i < r + h4 {
let mut j = c;
while j < c + w4 {
self.t.set_cdef_idx(i, j, v);
j += cdef_size4;
}
i += cdef_size4;
}
}
}
pub(crate) fn read_delta_qindex(&mut self) {
let sb_size = if self.fs.seq.use_128x128_superblock { BLOCK_128X128 } else { BLOCK_64X64 };
if self.b.mi_size == sb_size && self.b.skip {
return;
}
if self.read_deltas {
let mut abs = self.sd.read_symbol(&mut self.cdf.delta_q) as i32;
if abs == DELTA_Q_SMALL as i32 {
let rem_bits = self.sd.read_literal(3) + 1;
let abs_bits = self.sd.read_literal(rem_bits) as i32;
abs = abs_bits + (1 << rem_bits) + 1;
}
if abs != 0 {
let sign = self.sd.read_literal(1);
let reduced = if sign == 1 { -abs } else { abs };
self.current_q_index = (self.current_q_index + (reduced << self.fs.fh.delta_q_res)).clamp(1, 255);
}
}
}
pub(crate) fn read_delta_lf(&mut self) {
let sb_size = if self.fs.seq.use_128x128_superblock { BLOCK_128X128 } else { BLOCK_64X64 };
if self.b.mi_size == sb_size && self.b.skip {
return;
}
let fh = &self.fs.fh;
if self.read_deltas && fh.delta_lf_present {
let count = if fh.delta_lf_multi { if self.fs.num_planes > 1 { FRAME_LF_COUNT } else { FRAME_LF_COUNT - 2 } } else { 1 };
let multi = fh.delta_lf_multi;
let res = fh.delta_lf_res;
for i in 0..count {
let mut abs = if multi { self.sd.read_symbol(&mut self.cdf.delta_lf_multi[i]) } else { self.sd.read_symbol(&mut self.cdf.delta_lf) } as i32;
if abs == DELTA_LF_SMALL as i32 {
let n = self.sd.read_literal(3) + 1;
let bits = self.sd.read_literal(n) as i32;
abs = bits + (1 << n) + 1;
}
if abs != 0 {
let sign = self.sd.read_literal(1);
let reduced = if sign == 1 { -abs } else { abs };
self.delta_lf[i] = (self.delta_lf[i] + (reduced << res)).clamp(-(MAX_LOOP_FILTER as i32), MAX_LOOP_FILTER as i32);
}
}
}
}
pub(crate) fn filter_intra_mode_info(&mut self) {
self.b.use_filter_intra = false;
let ms = self.b.mi_size;
if self.fs.seq.enable_filter_intra && self.b.y_mode == DC_PRED && self.b.palette_size_y == 0 && block_width(ms).max(block_height(ms)) <= 32 {
self.b.use_filter_intra = self.sd.read_symbol(&mut self.cdf.filter_intra[ms]) == 1;
if self.b.use_filter_intra {
self.b.filter_intra_mode = self.sd.read_symbol(&mut self.cdf.filter_intra_mode);
}
}
}
// ---- palette -------------------------------------------------------------------------
pub(crate) fn palette_mode_info(&mut self) {
let ms = self.b.mi_size;
let bsize_ctx = MI_WIDTH_LOG2[ms] as usize + MI_HEIGHT_LOG2[ms] as usize - 2;
let bd = self.fs.bit_depth;
let (r, c) = (self.b.mi_row, self.b.mi_col);
if self.b.y_mode == DC_PRED {
let mi = &self.t.mi;
let mut ctx = 0;
if self.b.avail_u && mi.palette_size[0][mi.idx(r - 1, c)] > 0 {
ctx += 1;
}
if self.b.avail_l && mi.palette_size[0][mi.idx(r, c - 1)] > 0 {
ctx += 1;
}
if self.sd.read_symbol(&mut self.cdf.palette_y_mode[bsize_ctx][ctx]) == 1 {
let n = self.sd.read_symbol(&mut self.cdf.palette_y_size[bsize_ctx]) + 2;
self.b.palette_size_y = n;
let cache = self.get_palette_cache(0);
let mut colors = [0u16; 8];
let mut idx = 0;
for &cv in &cache {
if idx >= n {
break;
}
if self.sd.read_literal(1) == 1 {
colors[idx] = cv;
idx += 1;
}
}
if idx < n {
colors[idx] = self.sd.read_literal(bd) as u16;
idx += 1;
}
let mut palette_bits = 0;
if idx < n {
let min_bits = bd - 3;
palette_bits = min_bits + self.sd.read_literal(2);
}
while idx < n {
let delta = self.sd.read_literal(palette_bits) as i32 + 1;
colors[idx] = (colors[idx - 1] as i32 + delta).clamp(0, (1 << bd) - 1) as u16;
let range = (1i32 << bd) - colors[idx] as i32 - 1;
palette_bits = palette_bits.min(ceil_log2(range as u32));
idx += 1;
}
colors[..n].sort_unstable();
self.b.palette_colors_y = colors;
}
}
if self.b.has_chroma && self.b.uv_mode == DC_PRED {
let ctx = (self.b.palette_size_y > 0) as usize;
if self.sd.read_symbol(&mut self.cdf.palette_uv_mode[ctx]) == 1 {
let n = self.sd.read_symbol(&mut self.cdf.palette_uv_size[bsize_ctx]) + 2;
self.b.palette_size_uv = n;
let cache = self.get_palette_cache(1);
let mut colors = [0u16; 8];
let mut idx = 0;
for &cv in &cache {
if idx >= n {
break;
}
if self.sd.read_literal(1) == 1 {
colors[idx] = cv;
idx += 1;
}
}
if idx < n {
colors[idx] = self.sd.read_literal(bd) as u16;
idx += 1;
}
let mut palette_bits = 0;
if idx < n {
palette_bits = bd - 3 + self.sd.read_literal(2);
}
while idx < n {
let delta = self.sd.read_literal(palette_bits) as i32;
colors[idx] = (colors[idx - 1] as i32 + delta).clamp(0, (1 << bd) - 1) as u16;
let range = (1i32 << bd) - colors[idx] as i32;
palette_bits = palette_bits.min(ceil_log2(range as u32));
idx += 1;
}
colors[..n].sort_unstable();
self.b.palette_colors_u = colors;
let mut v = [0u16; 8];
if self.sd.read_literal(1) == 1 {
let min_bits = bd - 4;
let max_val = 1i32 << bd;
let bits = min_bits + self.sd.read_literal(2);
v[0] = self.sd.read_literal(bd) as u16;
for idx in 1..n {
let mut delta = self.sd.read_literal(bits) as i32;
if delta != 0 && self.sd.read_literal(1) == 1 {
delta = -delta;
}
let mut val = v[idx - 1] as i32 + delta;
if val < 0 {
val += max_val;
}
if val >= max_val {
val -= max_val;
}
v[idx] = val.clamp(0, (1 << bd) - 1) as u16;
}
} else {
for item in v.iter_mut().take(n) {
*item = self.sd.read_literal(bd) as u16;
}
}
self.b.palette_colors_v = v;
}
}
}
fn get_palette_cache(&self, plane: usize) -> Vec<u16> {
let (r, c) = (self.b.mi_row, self.b.mi_col);
let mi = &self.t.mi;
let above_n = if (r * 4) % 64 != 0 { mi.palette_size[plane][mi.idx(r - 1, c)] as usize } else { 0 };
let left_n = if self.b.avail_l { mi.palette_size[plane][mi.idx(r, c - 1)] as usize } else { 0 };
let above: &[u16] = if above_n > 0 { &mi.palette_colors[plane][mi.idx(r - 1, c)][..above_n] } else { &[] };
let left: &[u16] = if left_n > 0 { &mi.palette_colors[plane][mi.idx(r, c - 1)][..left_n] } else { &[] };
let (mut ai, mut li) = (0, 0);
let mut out: Vec<u16> = Vec::with_capacity(16);
while ai < above_n && li < left_n {
let (ac, lc) = (above[ai], left[li]);
if lc < ac {
if out.last() != Some(&lc) {
out.push(lc);
}
li += 1;
} else {
if out.last() != Some(&ac) {
out.push(ac);
}
ai += 1;
if lc == ac {
li += 1;
}
}
}
for &v in &above[ai..above_n] {
if out.last() != Some(&v) {
out.push(v);
}
}
for &v in &left[li..left_n] {
if out.last() != Some(&v) {
out.push(v);
}
}
out
}
fn palette_tokens(&mut self) {
let ms = self.b.mi_size;
let bh = block_height(ms);
let bw = block_width(ms);
let (mi_rows, mi_cols) = (self.fs.fh.mi_rows as usize, self.fs.fh.mi_cols as usize);
let on_h = bh.min((mi_rows - self.b.mi_row) * 4);
let on_w = bw.min((mi_cols - self.b.mi_col) * 4);
if self.b.palette_size_y > 0 {
let n = self.b.palette_size_y;
let mut map = std::mem::take(&mut self.color_map_y);
self.read_color_map(&mut map, n, bw, bh, on_w, on_h, 0);
self.color_map_y = map;
}
if self.b.palette_size_uv > 0 {
let n = self.b.palette_size_uv;
let (ssx, ssy) = (self.fs.ssx, self.fs.ssy);
let (mut bw, mut bh, mut on_w, mut on_h) = (bw >> ssx, bh >> ssy, on_w >> ssx, on_h >> ssy);
if bw < 4 {
bw += 2;
on_w += 2;
}
if bh < 4 {
bh += 2;
on_h += 2;
}
let mut map = std::mem::take(&mut self.color_map_uv);
self.read_color_map(&mut map, n, bw, bh, on_w, on_h, 1);
self.color_map_uv = map;
}
}
/// Color index map (stride 64).
#[allow(clippy::too_many_arguments)]
fn read_color_map(&mut self, map: &mut [u8], n: usize, bw: usize, bh: usize, on_w: usize, on_h: usize, plane: usize) {
map[0] = self.sd.read_ns(n as u32) as u8;
for i in 1..(on_h + on_w - 1) {
let jmax = i.min(on_w - 1);
let jmin = (i as isize - on_h as isize + 1).max(0) as usize;
let mut j = jmax as isize;
while j >= jmin as isize {
let (rr, cc) = (i - j as usize, j as usize);
let (order, hash) = palette_color_context(map, rr, cc, n);
let ctx = PALETTE_COLOR_CONTEXT[hash] as usize;
let cdf: &mut [u16] = match (plane, n) {
(0, 2) => &mut self.cdf.palette_2_y_color[ctx],
(0, 3) => &mut self.cdf.palette_3_y_color[ctx],
(0, 4) => &mut self.cdf.palette_4_y_color[ctx],
(0, 5) => &mut self.cdf.palette_5_y_color[ctx],
(0, 6) => &mut self.cdf.palette_6_y_color[ctx],
(0, 7) => &mut self.cdf.palette_7_y_color[ctx],
(0, _) => &mut self.cdf.palette_8_y_color[ctx],
(_, 2) => &mut self.cdf.palette_2_uv_color[ctx],
(_, 3) => &mut self.cdf.palette_3_uv_color[ctx],
(_, 4) => &mut self.cdf.palette_4_uv_color[ctx],
(_, 5) => &mut self.cdf.palette_5_uv_color[ctx],
(_, 6) => &mut self.cdf.palette_6_uv_color[ctx],
(_, 7) => &mut self.cdf.palette_7_uv_color[ctx],
_ => &mut self.cdf.palette_8_uv_color[ctx],
};
let s = self.sd.read_symbol(cdf);
map[rr * 64 + cc] = order[s];
j -= 1;
}
}
for i in 0..on_h {
for j in on_w..bw {
map[i * 64 + j] = map[i * 64 + on_w - 1];
}
}
for i in on_h..bh {
for j in 0..bw {
map[i * 64 + j] = map[(on_h - 1) * 64 + j];
}
}
}
// ---- transform size ---------------------------------------------------------------------
fn read_block_tx_size(&mut self) {
let b = &self.b;
let (bw4, bh4) = (b.bw4, b.bh4);
let fh = &self.fs.fh;
if fh.tx_mode == TX_MODE_SELECT as u8 && b.mi_size > BLOCK_4X4 && b.is_inter && !b.skip && !b.lossless {
let max_tx = MAX_TX_SIZE_RECT[b.mi_size] as usize;
let tw4 = TX_WIDTH[max_tx] as usize / 4;
let th4 = TX_HEIGHT[max_tx] as usize / 4;
let (r0, c0) = (b.mi_row, b.mi_col);
let mut row = r0;
while row < r0 + bh4 {
let mut col = c0;
while col < c0 + bw4 {
You can’t perform that action at this time.