/* * Copyright (c) 2023. * * This software is free software; * * You can redistribute it or modify it under terms of the MIT, Apache License or Zlib license */ //! Platform independent IDCT algorithm //! //! Not as fast as AVX one. const SCALE_BITS: i32 = 512 + 65536 + (128 << 17); #[inline(always)] fn wa(a: i32, b: i32) -> i32 { a.wrapping_add(b) } #[inline(always)] fn ws(a: i32, b: i32) -> i32 { a.wrapping_sub(b) } #[inline(always)] fn wm(a: i32, b: i32) -> i32 { a.wrapping_mul(b) } #[inline] pub fn idct_int_1x1(in_vector: &mut [i32; 64], mut out_vector: &mut [i16], stride: usize) { let coeff = ((wa(wa(in_vector[0], 4), 1024) >> 3).clamp(0, 255)) as i16; out_vector[..8].fill(coeff); for _ in 0..7 { out_vector = &mut out_vector[stride..]; out_vector[..8].fill(coeff); } } #[allow(unused_assignments)] #[allow( clippy::too_many_lines, clippy::op_ref, clippy::cast_possible_truncation )] pub fn idct_int(in_vector: &mut [i32; 64], out_vector: &mut [i16], stride: usize) { let mut pos = 0; let mut i = 0; if &in_vector[1..] == &[0_i32; 63] { return idct_int_1x1(in_vector, out_vector, stride); } // vertical pass for ptr in 0..8 { let p2 = in_vector[ptr + 16]; let p3 = in_vector[ptr + 48]; let p1 = wm(wa(p2, p3), 2217); let t2 = wa(p1, wm(p3, -7567)); let t3 = wa(p1, wm(p2, 3135)); let p2 = in_vector[ptr]; let p3 = in_vector[32 + ptr]; let t0 = fsh(wa(p2, p3)); let t1 = fsh(ws(p2, p3)); let x0 = wa(wa(t0, t3), 512); let x3 = wa(ws(t0, t3), 512); let x1 = wa(wa(t1, t2), 512); let x2 = wa(ws(t1, t2), 512); let mut t0 = in_vector[ptr + 56]; let mut t1 = in_vector[ptr + 40]; let mut t2 = in_vector[ptr + 24]; let mut t3 = in_vector[ptr + 8]; let p3 = wa(t0, t2); let p4 = wa(t1, t3); let p1 = wa(t0, t3); let p2 = wa(t1, t2); let p5 = wm(wa(p3, p4), 4816); t0 = wm(t0, 1223); t1 = wm(t1, 8410); t2 = wm(t2, 12586); t3 = wm(t3, 6149); let p1 = wa(p5, wm(p1, -3685)); let p2 = wa(p5, wm(p2, -10497)); let p3 = wm(p3, -8034); let p4 = wm(p4, -1597); t3 = wa(t3, wa(p1, p4)); t2 = wa(t2, wa(p2, p3)); t1 = wa(t1, wa(p2, p4)); t0 = wa(t0, wa(p1, p3)); in_vector[ptr] = ws(wa(x0, t3), 0) >> 10; in_vector[ptr + 8] = ws(wa(x1, t2), 0) >> 10; in_vector[ptr + 16] = ws(wa(x2, t1), 0) >> 10; in_vector[ptr + 24] = ws(wa(x3, t0), 0) >> 10; in_vector[ptr + 32] = ws(ws(x3, t0), 0) >> 10; in_vector[ptr + 40] = ws(ws(x2, t1), 0) >> 10; in_vector[ptr + 48] = ws(ws(x1, t2), 0) >> 10; in_vector[ptr + 56] = ws(ws(x0, t3), 0) >> 10; } // horizontal pass while i < 64 { let p2 = in_vector[i + 2]; let p3 = in_vector[i + 6]; let p1 = wm(wa(p2, p3), 2217); let t2 = wa(p1, wm(p3, -7567)); let t3 = wa(p1, wm(p2, 3135)); let p2 = in_vector[i]; let p3 = in_vector[i + 4]; let t0 = fsh(wa(p2, p3)); let t1 = fsh(ws(p2, p3)); let x0 = wa(wa(t0, t3), SCALE_BITS); let x3 = wa(ws(t0, t3), SCALE_BITS); let x1 = wa(wa(t1, t2), SCALE_BITS); let x2 = wa(ws(t1, t2), SCALE_BITS); let mut t0 = in_vector[i + 7]; let mut t1 = in_vector[i + 5]; let mut t2 = in_vector[i + 3]; let mut t3 = in_vector[i + 1]; let p3 = wa(t0, t2); let p4 = wa(t1, t3); let p1 = wa(t0, t3); let p2 = wa(t1, t2); let p5 = wm(wa(p3, p4), f2f(1.175875602)); t0 = wm(t0, 1223); t1 = wm(t1, 8410); t2 = wm(t2, 12586); t3 = wm(t3, 6149); let p1 = wa(p5, wm(p1, -3685)); let p2 = wa(p5, wm(p2, -10497)); let p3 = wm(p3, -8034); let p4 = wm(p4, -1597); t3 = wa(t3, wa(p1, p4)); t2 = wa(t2, wa(p2, p3)); t1 = wa(t1, wa(p2, p4)); t0 = wa(t0, wa(p1, p3)); let out: &mut [i16; 8] = out_vector .get_mut(pos..pos + 8) .unwrap() .try_into() .unwrap(); out[0] = clamp(wa(x0, t3) >> 17); out[1] = clamp(wa(x1, t2) >> 17); out[2] = clamp(wa(x2, t1) >> 17); out[3] = clamp(wa(x3, t0) >> 17); out[4] = clamp(ws(x3, t0) >> 17); out[5] = clamp(ws(x2, t1) >> 17); out[6] = clamp(ws(x1, t2) >> 17); out[7] = clamp(ws(x0, t3) >> 17); i += 8; pos += stride; } } #[inline] #[allow(clippy::cast_possible_truncation)] /// Multiply a number by 4096 fn f2f(x: f32) -> i32 { (x * 4096.0 + 0.5) as i32 } #[inline] /// Multiply a number by 4096 fn fsh(x: i32) -> i32 { x << 12 } /// Clamp values between 0 and 255 #[inline] #[allow(clippy::cast_possible_truncation)] fn clamp(a: i32) -> i16 { a.clamp(0, 255) as i16 } /// IDCT assuming only the upper 4x4 is filled. pub fn idct4x4(in_vector: &mut [i32; 64], out_vector: &mut [i16], stride: usize) { let mut pos = 0; // vertical pass for ptr in 0..4 { let i0 = wa(fsh(in_vector[ptr]), 512); let i2 = in_vector[ptr + 16]; let p1 = wm(i2, 2217); let p3 = wm(i2, 5352); let x0 = wa(i0, p3); let x1 = wa(i0, p1); let x2 = ws(i0, p1); let x3 = ws(i0, p3); // odd part let i4 = in_vector[ptr + 24]; let i3 = in_vector[ptr + 8]; let p5 = wm(wa(i4, i3), 4816); let p1 = wa(p5, wm(i3, -3685)); let p2 = wa(p5, wm(i4, -10497)); let t3 = wa(p5, wm(i3, 867)); let t2 = wa(p5, wm(i4, -5945)); let t1 = wa(p2, wm(i3, -1597)); let t0 = wa(p1, wm(i4, -8034)); in_vector[ptr] = wa(x0, t3) >> 10; in_vector[ptr + 8] = wa(x1, t2) >> 10; in_vector[ptr + 16] = wa(x2, t1) >> 10; in_vector[ptr + 24] = wa(x3, t0) >> 10; in_vector[ptr + 32] = ws(x3, t0) >> 10; in_vector[ptr + 40] = ws(x2, t1) >> 10; in_vector[ptr + 48] = ws(x1, t2) >> 10; in_vector[ptr + 56] = ws(x0, t3) >> 10; } // horizontal pass for i in (0..8).map(|i| 8 * i) { let i2 = in_vector[i + 2]; let i0 = in_vector[i]; let t0 = wa(fsh(i0), SCALE_BITS); let t2 = wm(i2, 2217); let t3 = wm(i2, 5352); let x0 = wa(t0, t3); let x3 = ws(t0, t3); let x1 = wa(t0, t2); let x2 = ws(t0, t2); // odd part let i3 = in_vector[i + 3]; let i1 = in_vector[i + 1]; let p5 = wm(wa(i3, i1), f2f(1.175875602)); let p1 = wa(p5, wm(i1, -3685)); let p2 = wa(p5, wm(i3, -10497)); let t3 = wa(p5, wm(i1, 867)); let t2 = wa(p5, wm(i3, -5945)); let t1 = wa(p2, wm(i1, -1597)); let t0 = wa(p1, wm(i3, -8034)); let out: &mut [i16; 8] = out_vector .get_mut(pos..pos + 8) .unwrap() .try_into() .unwrap(); out.copy_from_slice(&[ clamp(wa(x0, t3) >> 17), clamp(wa(x1, t2) >> 17), clamp(wa(x2, t1) >> 17), clamp(wa(x3, t0) >> 17), clamp(ws(x3, t0) >> 17), clamp(ws(x2, t1) >> 17), clamp(ws(x1, t2) >> 17), clamp(ws(x0, t3) >> 17), ]); pos += stride; } in_vector[32..36].fill(0); in_vector[40..44].fill(0); in_vector[48..52].fill(0); in_vector[56..60].fill(0); }