use super::state::Dec;
use crate::hevc::cabac::off;
use crate::hevc::error::{Error, Result};
const SIG_MAP_4X4: [u8; 16] = [0, 1, 4, 5, 2, 3, 4, 5, 6, 6, 8, 8, 7, 7, 8, 8];
const SIG_PATTERN: [[u8; 16]; 4] = [
[2, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0],
[2, 2, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],
[2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0],
[2; 16],
];
const FLAT: [u8; 16] = [0; 16];
pub fn scan_index(d: &Dec<'_>, log2_size: usize, c_idx: usize, pred_mode: u8) -> usize {
let mode_dependent =
log2_size == 2 || (log2_size == 3 && c_idx == 0) || (log2_size == 3 && d.cat == 3);
if !mode_dependent {
return 0;
}
if (6..=14).contains(&pred_mode) {
2
} else if (22..=30).contains(&pred_mode) {
1
} else {
0
}
}
pub fn last_position(d: &mut Dec<'_>, log2_size: usize, c_idx: usize) -> (usize, usize) {
let (ctx_offset, ctx_shift) = if c_idx == 0 {
(
3 * (log2_size - 2) + ((log2_size - 1) >> 2),
(log2_size + 1) >> 2,
)
} else {
(15, log2_size - 2)
};
let c_max = (log2_size << 1) - 1;
let mut prefix = [0usize; 2];
for (k, base) in [off::LAST_X, off::LAST_Y].into_iter().enumerate() {
let mut v = 0usize;
while v < c_max {
let ctx = base + ctx_offset + (v >> ctx_shift);
if d.cab.decision(ctx) == 0 {
break;
}
v += 1;
}
prefix[k] = v;
}
let mut out = [0usize; 2];
for k in 0..2 {
out[k] = if prefix[k] > 3 {
let bits = (prefix[k] >> 1) - 1;
let suffix = d.cab.bypass_bits(bits as u32) as usize;
((1usize << bits) * (2 + (prefix[k] & 1))) + suffix
} else {
prefix[k]
};
}
(out[0], out[1])
}
pub struct SigCtx {
table: &'static [u8; 16],
add: usize,
dc: Option<usize>,
}
impl SigCtx {
#[allow(clippy::too_many_arguments)]
pub fn new(
d: &Dec<'_>,
log2_size: usize,
c_idx: usize,
xs: usize,
ys: usize,
sb_n: usize,
scan_idx: usize,
ts_ctx: bool,
) -> SigCtx {
let chroma = if c_idx > 0 { 27 } else { 0 };
if ts_ctx {
let add = if c_idx == 0 { 42 } else { 43 };
return SigCtx {
table: &FLAT,
add,
dc: None,
};
}
if log2_size == 2 {
return SigCtx {
table: &SIG_MAP_4X4,
add: chroma,
dc: None,
};
}
let mut prev = 0usize;
if xs + 1 < sb_n {
prev += d.csbf[ys * sb_n + xs + 1] as usize;
}
if ys + 1 < sb_n {
prev += (d.csbf[(ys + 1) * sb_n + xs] as usize) << 1;
}
let add = if c_idx == 0 {
let size = if log2_size == 3 {
if scan_idx == 0 { 9 } else { 15 }
} else {
21
};
usize::from(xs + ys > 0) * 3 + size
} else {
chroma + if log2_size == 3 { 9 } else { 12 }
};
SigCtx {
table: &SIG_PATTERN[prev & 3],
add,
dc: if xs + ys == 0 { Some(chroma) } else { None },
}
}
#[inline]
pub fn at(&self, m: usize, raster: usize) -> usize {
match self.dc {
Some(dc) if m == 0 => dc,
_ => self.table[raster & 15] as usize + self.add,
}
}
}
pub fn read_remaining(d: &mut Dec<'_>, rice: u32) -> Result<u32> {
let mut prefix = 0u32;
while d.cab.bypass() == 1 {
prefix += 1;
if prefix > 24 {
return Err(Error::InvalidData(
"coeff_abs_level_remaining prefix too long",
));
}
}
if prefix < 3 {
let suffix = d.cab.bypass_bits(rice);
Ok((prefix << rice) + suffix)
} else {
let extra = prefix - 3;
let suffix = d.cab.bypass_bits(extra + rice);
Ok(suffix + (((1u32 << extra) + 3 - 1) << rice))
}
}