use super::extent::extent;
pub const LEVEL_SCALE: [i64; 6] = [40, 45, 51, 57, 64, 72];
pub const COEFF_MIN: i64 = -32768;
pub const COEFF_MAX: i64 = 32767;
pub fn scale(levels: &mut [i32], n: usize, qp: i32, bit_depth: u8, factors: Option<&[u8]>) {
let log2n = n.trailing_zeros() as i32;
let bd_shift = bit_depth as i32 + log2n - 5;
if !(1..=40).contains(&bd_shift) {
return;
}
let count = n * n;
if n == 0 || levels.len() < count {
return;
}
let (rows, cols) = extent(levels, n);
let qp = qp.max(0);
let ls = LEVEL_SCALE[(qp % 6) as usize];
let shift = (qp / 6) as u32;
let round = 1i64 << (bd_shift - 1);
let rows = levels.chunks_exact_mut(n).take(rows);
match factors {
None => {
let mul = ls << 4; for row in rows {
for v in &mut row[..cols] {
let t = (((*v as i64) * mul) << shift) + round;
*v = (t >> bd_shift).clamp(COEFF_MIN, COEFF_MAX) as i32;
}
}
}
Some(f) if f.len() >= count => {
for (row, frow) in rows.zip(f.chunks_exact(n)) {
for (v, &m) in row[..cols].iter_mut().zip(&frow[..cols]) {
let t = (((*v as i64) * ls * m as i64) << shift) + round;
*v = (t >> bd_shift).clamp(COEFF_MIN, COEFF_MAX) as i32;
}
}
}
Some(_) => {}
}
}
#[cfg(test)]
#[path = "dequant_tests.rs"]
mod tests;