diff --git a/core/embed/rust/Cargo.lock b/core/embed/rust/Cargo.lock index 5ce4e1d19c..cee5284091 100644 --- a/core/embed/rust/Cargo.lock +++ b/core/embed/rust/Cargo.lock @@ -308,6 +308,10 @@ dependencies = [ "unicode-xid", ] +[[package]] +name = "trezor-tjpgdec" +version = "0.1.0" + [[package]] name = "trezor_lib" version = "0.1.0" @@ -322,6 +326,7 @@ dependencies = [ "num-traits", "qrcodegen", "serde_json", + "trezor-tjpgdec", ] [[package]] diff --git a/core/embed/rust/Cargo.toml b/core/embed/rust/Cargo.toml index 40c54cb48e..dc5298ae73 100644 --- a/core/embed/rust/Cargo.toml +++ b/core/embed/rust/Cargo.toml @@ -55,12 +55,16 @@ codegen-units = 1 split-debuginfo = "off" debug = 2 +[profile.release.package.trezor-tjpgdec] +opt-level = 3 + [profile.test] split-debuginfo = "off" debug = 2 [dependencies] qrcodegen = { version = "1.8.0", path = "../../vendor/QR-Code-generator/rust-no-heap" } +trezor-tjpgdec = { version = "0.1.0", path = "../../../rust/trezor-tjpgdec" } # Runtime dependencies diff --git a/core/embed/rust/src/ui/display/tjpgd.rs b/core/embed/rust/src/ui/display/tjpgd.rs index c85971de41..1fc6de3455 100644 --- a/core/embed/rust/src/ui/display/tjpgd.rs +++ b/core/embed/rust/src/ui/display/tjpgd.rs @@ -1,37 +1,5 @@ -/*----------------------------------------------------------------------------/ -/ TJpgDec - Tiny JPEG Decompressor R0.03+trezor (C)ChaN, 2021 -/-----------------------------------------------------------------------------/ -/ The TJpgDec is a generic JPEG decompressor module for tiny embedded systems. -/ This is a free software that opened for education, research and commercial -/ developments under license policy of following terms. -/ -/ Copyright (C) 2021, ChaN, all right reserved. -/ -/ * The TJpgDec module is a free software and there is NO WARRANTY. -/ * No restriction on use. You can use, modify and redistribute it for -/ personal, non-profit or commercial products UNDER YOUR RESPONSIBILITY. -/ * Redistributions of source code must retain the above copyright notice. -/ -/-----------------------------------------------------------------------------/ -/ Oct 04, 2011 R0.01 First release. -/ Feb 19, 2012 R0.01a Fixed decompression fails when scan starts with an escape seq. -/ Sep 03, 2012 R0.01b Added JD_TBLCLIP option. -/ Mar 16, 2019 R0.01c Supprted stdint.h. -/ Jul 01, 2020 R0.01d Fixed wrong integer type usage. -/ May 08, 2021 R0.02 Supprted grayscale image. Separated configuration options. -/ Jun 11, 2021 R0.02a Some performance improvement. -/ Jul 01, 2021 R0.03 Added JD_FASTDECODE option. -/ Some performance improvement. -/ Jan 02, 2023 Rust version by Trezor Company, modified to meet our needs. - -Trezor modifications: - - included overflow detection from https://github.com/cmumford/TJpgDec - - removed JD_FASTDECODE=0 option - - removed JD_TBLCLIP option - - allowed interrupted functionality - - tighter integration into Trezor codebase by using our data structures - - removed generic input and output functions, replaced by our specific functionality -/----------------------------------------------------------------------------*/ +use trezor_tjpgdec::{BlackHoleOutput, JpegOutput}; +pub use trezor_tjpgdec::{BufferInput, Error, JDEC}; use crate::{ trezorhal::{ @@ -44,1359 +12,6 @@ use crate::{ geometry::{Offset, Point, Rect}, }, }; -use core::{ - f64::consts::{FRAC_1_SQRT_2, SQRT_2}, - mem, slice, -}; - -/// Specifies output pixel format. -/// 0: RGB888 (24-bit/pix) -/// 1: RGB565 (16-bit/pix) -/// 2: Grayscale (8-bit/pix) -const JD_FORMAT: u32 = 1; - -/// Switches output descaling feature. -/// 0: Disable -/// 1: Enable -const JD_USE_SCALE: u32 = 1; - -/// Optimization level -/// 0: NOT IMPLEMENTED Basic optimization. Suitable for 8/16-bit MCUs. -/// 1: + 32-bit barrel shifter. Suitable for 32-bit MCUs. -/// 2: + Table conversion for huffman decoding (wants 6 << HUFF_BIT bytes of -/// RAM) -const JD_FASTDECODE: u32 = 2; - -/// Specifies size of stream input buffer -const JD_SZBUF: usize = 512; - -const HUFF_BIT: u32 = 10; -const HUFF_LEN: u32 = 1 << HUFF_BIT; -const HUFF_MASK: u32 = HUFF_LEN - 1; - -const NUM_DEQUANTIZER_TABLES: usize = 4; - -#[derive(PartialEq, Eq)] -pub enum Error { - /// Interrupted by output function, call `JDEC::decomp` to continue. - Interrupted, - /// Device error or wrong termination of input stream. - Input, - /// Insufficient memory pool for the image. - MemoryPool, - /// Insufficient stream input buffer. - MemoryInput, - /// Parameter error. - Parameter, - /// Data format error (may be broken data). - InvalidData, - /// Not supported JPEG standard. - UnsupportedJpeg, -} - -pub struct JDEC<'i, 'p> { - dctr: usize, - dptr: usize, - inbuf: &'p mut [u8], - dbit: u8, - scale: u8, - msx: u8, - msy: u8, - qtid: [u8; 3], - ncomp: u8, - dcv: [i16; 3], - nrst: u16, - rst: u16, - rsc: u16, - width: u16, - height: u16, - huffbits: [[&'p mut [u8]; 2]; 2], - huffcode: [[&'p mut [u16]; 2]; 2], - huffcode_len: [[usize; 2]; 2], - huffdata: [[&'p mut [u8]; 2]; 2], - qttbl: [&'p mut [i32]; 4], - wreg: u32, - marker: u8, - longofs: [[u8; 2]; 2], - hufflut_ac: [&'p mut [u16]; 2], - hufflut_dc: [&'p mut [u8]; 2], - workbuf: &'p mut [i32], - mcubuf: &'p mut [i16], - pool: &'p mut [u8], - input_func: &'i mut dyn JpegInput, -} - -/// Zigzag-order to raster-order conversion table -#[rustfmt::skip] -const ZIG: [u8; 64] = [ - 0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5, - 12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6, 7, 14, 21, 28, - 35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51, - 58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47, 55, 62, 63, -]; - -macro_rules! f { - ($num:expr) => {{ - ($num * 8192_f64) as u16 - }}; -} - -/// Input scale factor of Arai algorithm -/// (scaled up 16 bits for fixed point operations) -#[rustfmt::skip] -const IPSF: [u16; 64] = [ - f!(1.00000), f!(1.38704), f!(1.30656), f!(1.17588), f!(1.00000), f!(0.78570), f!(0.54120), f!(0.27590), - f!(1.38704), f!(1.92388), f!(1.81226), f!(1.63099), f!(1.38704), f!(1.08979), f!(0.75066), f!(0.38268), - f!(1.30656), f!(1.81226), f!(1.70711), f!(1.53636), f!(1.30656), f!(1.02656), f!(FRAC_1_SQRT_2), f!(0.36048), - f!(1.17588), f!(1.63099), f!(1.53636), f!(1.38268), f!(1.17588), f!(0.92388), f!(0.63638), f!(0.32442), - f!(1.00000), f!(1.38704), f!(1.30656), f!(1.17588), f!(1.00000), f!(0.78570), f!(0.54120), f!(0.27590), - f!(0.78570), f!(1.08979), f!(1.02656), f!(0.92388), f!(0.78570), f!(0.61732), f!(0.42522), f!(0.21677), - f!(0.54120), f!(0.75066), f!(FRAC_1_SQRT_2), f!(0.63638), f!(0.54120), f!(0.42522), f!(0.29290), f!(0.14932), - f!(0.27590), f!(0.38268), f!(0.36048), f!(0.32442), f!(0.27590), f!(0.21678), f!(0.14932), f!(0.07612), -]; - -impl<'i, 'p> JDEC<'i, 'p> { - /// Allocate a memory block from memory pool - /// `self`: decompressor object reference - /// `ndata` number of `T` items to allocate - fn alloc_slice(&mut self, ndata: usize) -> Result<&'p mut [T], Error> { - let ndata_bytes = ndata * mem::size_of::(); - let ndata_aligned = (ndata_bytes + 3) & !3; - if self.pool.len() < ndata_aligned { - // Err: not enough memory - return Err(Error::MemoryPool); - } - - // SAFETY: - // - Memory is valid because it comes from a valid slice. - // - Memory is initialized because here we consider integers always - // initialized. - // - The slices do not overlap and the original reference is overwritten, - // ensuring that the returned references are exclusive. - unsafe { - let data = slice::from_raw_parts_mut(self.pool.as_mut_ptr() as _, ndata); - let newpool = slice::from_raw_parts_mut( - self.pool.as_mut_ptr().add(ndata_aligned), - self.pool.len() - ndata_aligned, - ); - self.pool = newpool; - Ok(data) - } - } - - fn jpeg_in(&mut self, inbuf_offset: Option, n_data: usize) -> usize { - if let Some(offset) = inbuf_offset { - let inbuf = &mut self.inbuf[offset..offset + n_data]; - self.input_func.read(Some(inbuf), n_data) - } else { - self.input_func.read(None, n_data) - } - } - - /// Create de-quantization and prescaling tables with a DQT segment - /// `self`: decompressor object reference - /// `ndata`: size of input data - fn create_qt_tbl(&mut self, mut ndata: usize) -> Result<(), Error> { - let mut i: u32; - let mut d: u8; - let mut data_idx = 0; - while ndata != 0 { - // Process all tables in the segment - if ndata < 65 { - // Err: table size is unaligned - return Err(Error::InvalidData); - } - ndata -= 65; - - d = self.inbuf[data_idx]; // Get table property - data_idx += 1; - if d & 0xf0 != 0 { - // Err: not 8-bit resolution - return Err(Error::InvalidData); - } - i = (d & 3) as u32; // Get table ID - - // Allocate a memory block for the table - // Register the table - self.qttbl[i as usize] = self.alloc_slice(64)?; - for zi in ZIG { - // Load the table - // Apply scale factor of Arai algorithm to the de-quantizers - self.qttbl[i as usize][zi as usize] = - ((self.inbuf[data_idx] as u32) * IPSF[zi as usize] as u32) as i32; - data_idx += 1; - } - } - Ok(()) - } - - /// Create huffman code tables with a DHT segment - /// `self`: decompressor object reference - /// `ndata`: size of input data - fn create_huffman_tbl(&mut self, mut ndata: usize) -> Result<(), Error> { - let mut j: u32; - let mut b: u32; - let mut cls: usize; - let mut num: usize; - let mut np: usize; - let mut d: u8; - let mut hc: u16; - let mut data_idx = 0; - while ndata != 0 { - // Process all tables in the segment - if ndata < 17 { - // Err: wrong data size - return Err(Error::InvalidData); - } - ndata -= 17; - d = self.inbuf[data_idx]; // Get table number and class - data_idx += 1; - if d & 0xee != 0 { - // Err: invalid class/number - return Err(Error::InvalidData); - } - cls = d as usize >> 4; // class = dc(0)/ac(1) - num = d as usize & 0xf; // table number = 0/1 - // Allocate a memory block for the bit distribution table - self.huffbits[num][cls] = self.alloc_slice(16)?; - - np = 0; - for i in 0..16 { - // Load number of patterns for 1 to 16-bit code - // Get sum of code words for each code - self.huffbits[num][cls][i] = self.inbuf[data_idx]; - np += self.inbuf[data_idx] as usize; - data_idx += 1; - } - // Allocate a memory block for the code word table - self.huffcode[num][cls] = self.alloc_slice(np)?; - self.huffcode_len[num][cls] = np; - - // Re-build huffman code word table - hc = 0; - j = 0; - for i in 0..16 { - b = self.huffbits[num][cls][i] as u32; - while b > 0 { - self.huffcode[num][cls][j as usize] = hc; - hc += 1; - j += 1; - b -= 1; - } - hc <<= 1; - } - if ndata < np { - // Err: wrong data size - return Err(Error::InvalidData); - } - ndata -= np; - - // Allocate a memory block for the decoded data - self.huffdata[num][cls] = self.alloc_slice(np)?; - - // Load decoded data corresponds to each code word - for i in 0..np { - d = self.inbuf[data_idx]; - data_idx += 1; - if cls == 0 && d > 11 { - return Err(Error::InvalidData); - } - self.huffdata[num][cls][i] = d; - } - if JD_FASTDECODE == 2 { - // Create fast huffman decode table - let mut span: u32; - let mut td: u32; - let mut ti: u32; - if cls != 0 { - // LUT for AC elements - self.hufflut_ac[num] = self.alloc_slice(HUFF_LEN as usize)?; - // Default value (0xFFFF: may be long code) - self.hufflut_ac[num].fill(0xffff); - } else { - // LUT for DC elements - self.hufflut_dc[num] = self.alloc_slice(HUFF_LEN as usize)?; - // Default value (0xFF: may be long code) - self.hufflut_dc[num].fill(0xff); - } - let mut i = 0; - - // Create LUT - for b in 0..HUFF_BIT { - j = self.huffbits[num][cls][b as usize] as u32; - while j != 0 { - // Index of input pattern for the code - ti = - (self.huffcode[num][cls][i] << ((HUFF_BIT - 1) - b)) as u32 & HUFF_MASK; - - if cls != 0 { - // b15..b8: code length, b7..b0: zero run and data length - td = self.huffdata[num][cls][i] as u32 | (b + 1) << 8; - i += 1; - span = 1 << ((HUFF_BIT - 1) - b); - while span != 0 { - span -= 1; - self.hufflut_ac[num][ti as usize] = td as u16; - ti += 1; - } - } else { - // b7..b4: code length, b3..b0: data length - td = self.huffdata[num][cls][i] as u32 | (b + 1) << 4; - i += 1; - span = 1 << ((HUFF_BIT - 1) - b); - while span != 0 { - span -= 1; - self.hufflut_dc[num][ti as usize] = td as u8; - ti += 1; - } - } - j -= 1; - } - } - // Code table offset for long code - self.longofs[num][cls] = i as u8; - } - } - Ok(()) - } - - /// Extract a huffman decoded data from input stream - /// `self`: decompressor object reference - /// `id`: table ID (0:Y, 1:C) - /// `cls`: table class (0:DC, 1:AC) - #[optimize(speed)] - fn huffext(&mut self, id: usize, cls: usize) -> Result { - let mut dc: usize = self.dctr; - let mut dp: usize = self.dptr; - let mut d: u32; - let mut flg: u32 = 0; - let mut nc: u32; - let mut bl: u32; - let mut wbit: u32 = (self.dbit as i32 % 32) as u32; - let mut w: u32 = self.wreg & ((1 << wbit) - 1); - while wbit < 16 { - // Prepare 16 bits into the working register - if self.marker != 0 { - d = 0xff; // Input stream has stalled for a marker. Generate - // stuff bits - } else { - if dc == 0 { - // Buffer empty, re-fill input buffer - dp = 0; // Top of input buffer - dc = self.jpeg_in(Some(0), JD_SZBUF); - if dc == 0 { - // Err: read error or wrong stream termination - return Err(Error::Input); - } - } - d = self.inbuf[dp] as u32; - dp += 1; - - dc -= 1; - if flg != 0 { - // In flag sequence? - flg = 0; // Exit flag sequence - if d != 0 { - // Not an escape of 0xFF but a marker - self.marker = d as u8; - } - d = 0xff; - } else if d == 0xff { - // Is start of flag sequence? - // Enter flag sequence, get trailing byte - flg = 1; - continue; - } - } - // Shift 8 bits in the working register - w = w << 8 | d; - wbit += 8; - } - self.dctr = dc; - self.dptr = dp; - self.wreg = w; - - let mut hb_idx = 0; - let mut hc_idx = 0; - let mut hd_idx = 0; - - if JD_FASTDECODE == 2 { - // Table serch for the short codes - d = w >> (wbit - HUFF_BIT); // Short code as table index - if cls != 0 { - // AC element - d = self.hufflut_ac[id][d as usize] as u32; // Table decode - if d != 0xffff { - // It is done if hit in short code - self.dbit = (wbit - (d >> 8)) as u8; // Snip the code length - return Ok((d & 0xff) as i32); // b7..0: zero run and - // following - // data bits - } - } else { - // DC element - d = self.hufflut_dc[id][d as usize] as u32; // Table decode - if d != 0xff { - // It is done if hit in short code - self.dbit = (wbit - (d >> 4)) as u8; // Snip the code length - return Ok((d & 0xf) as i32); // b3..0: following data bits - } - } - - // Incremental serch for the codes longer than HUFF_BIT - hb_idx = HUFF_BIT; // Bit distribution table - hc_idx = self.longofs[id][cls]; // Code word table - hd_idx = self.longofs[id][cls]; // Data table - bl = HUFF_BIT + 1; - } else { - // Incremental search for all codes - bl = 1; - } - - // Incremental search - while bl <= 16 { - nc = self.huffbits[id][cls][hb_idx as usize] as u32; - hb_idx += 1; - if nc != 0 { - d = w >> (wbit - bl); - loop { - // Search the code word in this bit length - if hc_idx as usize >= self.huffcode_len[id][cls] { - return Err(Error::InvalidData); - } - let val = self.huffcode[id][cls][hc_idx as usize]; - if d == val as u32 { - // Matched? - self.dbit = (wbit - bl) as u8; // Snip the huffman code - // Return the decoded data - return Ok(self.huffdata[id][cls][hd_idx as usize] as i32); - } - hc_idx += 1; - hd_idx += 1; - nc -= 1; - if nc == 0 { - break; - } - } - } - bl += 1; - } - - // Err: code not found (may be collapted data) - Err(Error::InvalidData) - } - - /// Extract N bits from input stream - /// `self`: decompressor object reference - /// `nbit`: number of bits to extract (1 to 16) - #[optimize(speed)] - fn bitext(&mut self, nbit: u32) -> Result { - let mut dc: usize = self.dctr; - let mut dp: usize = self.dptr; - let mut d: u32; - let mut flg: u32 = 0; - let mut wbit: u32 = (self.dbit as i32 % 32) as u32; - let mut w: u32 = self.wreg & ((1 << wbit) - 1); - while wbit < nbit { - // Prepare nbit bits into the working register - if self.marker != 0 { - d = 0xff; // Input stream stalled, generate stuff bits - } else { - if dc == 0 { - // Buffer empty, re-fill input buffer - dp = 0; // Top of input buffer - dc = self.jpeg_in(Some(0), JD_SZBUF); - if dc == 0 { - // Err: read error or wrong stream termination - return Err(Error::Input); - } - } - d = self.inbuf[dp] as u32; - dp += 1; - dc -= 1; - if flg != 0 { - // In flag sequence? - flg = 0; // Exit flag sequence - if d != 0 { - // Not an escape of 0xFF but a marker - self.marker = d as u8; - } - d = 0xff; - } else if d == 0xff { - // Is start of flag sequence? - flg = 1; // Enter flag sequence, get trailing byte - continue; - } - } - w = w << 8 | d; - wbit += 8; - } - self.wreg = w; - self.dbit = (wbit - nbit) as u8; - self.dctr = dc; - self.dptr = dp; - - Ok((w >> ((wbit - nbit) % 32)) as i32) - } - - /// Process restart interval - /// `self`: decompressor object reference - /// `rstn`: expected restart sequence number - #[optimize(speed)] - fn restart(&mut self, rstn: u16) -> Result<(), Error> { - let mut dp = self.dptr; - let mut dc: usize = self.dctr; - let mut marker: u16; - if self.marker != 0 { - // Generate a maker if it has been detected - marker = 0xff00 | self.marker as u16; - self.marker = 0; - } else { - marker = 0; - for _ in 0..2 { - // Get a restart marker - if dc == 0 { - // No input data is available, re-fill input buffer - dp = 0; - dc = self.jpeg_in(Some(0), JD_SZBUF); - if dc == 0 { - return Err(Error::Input); - } - } - // Get a byte - let b = self.inbuf[dp] as u16; - marker = marker << 8 | b; - dp += 1; - dc -= 1; - } - self.dptr = dp; - self.dctr = dc; - } - - // Check the marker - if marker & 0xffd8 != 0xffd0 || marker & 7 != rstn & 7 { - // Err: expected RSTn marker was not detected (may be collapted data) - return Err(Error::InvalidData); - } - self.dbit = 0; // Discard stuff bits - // Reset DC offset - self.dcv[0] = 0; - self.dcv[1] = 0; - self.dcv[2] = 0; - Ok(()) - } - - /// Apply Inverse-DCT in Arai Algorithm - /// `src`: input block data (de-quantized and pre-scaled for Arai Algorithm) - /// `dst`: destination to store the block as byte array - #[optimize(speed)] - fn block_idct(src: &mut [i32], dst: &mut [i16]) { - let m13: i32 = (SQRT_2 * 4096_f64) as i32; - let m2: i32 = (1.08239f64 * 4096_f64) as i32; - let m4: i32 = (2.61313f64 * 4096_f64) as i32; - let m5: i32 = (1.84776f64 * 4096_f64) as i32; - let mut v0: i32; - let mut v1: i32; - let mut v2: i32; - let mut v3: i32; - let mut v4: i32; - let mut v5: i32; - let mut v6: i32; - let mut v7: i32; - let mut t10: i32; - let mut t11: i32; - let mut t12: i32; - let mut t13: i32; - - // Process columns - for idx in 0..8 { - // Get even elements - v0 = src[idx]; - v1 = src[idx + 8 * 2]; - v2 = src[idx + 8 * 4]; - v3 = src[idx + 8 * 6]; - - // Process the even elements - t10 = v0 + v2; - t12 = v0 - v2; - t11 = ((v1 - v3) * m13) >> 12; - v3 += v1; - t11 -= v3; - v0 = t10 + v3; - v3 = t10 - v3; - v1 = t11 + t12; - v2 = t12 - t11; - - // Get odd elements - v4 = src[idx + 8 * 7]; - v5 = src[idx + 8]; - v6 = src[idx + 8 * 5]; - v7 = src[idx + 8 * 3]; - - // Process the odd elements - t10 = v5 - v4; - t11 = v5 + v4; - t12 = v6 - v7; - v7 += v6; - v5 = ((t11 - v7) * m13) >> 12; - v7 += t11; - t13 = ((t10 + t12) * m5) >> 12; - v4 = t13 - ((t10 * m2) >> 12); - v6 = t13 - ((t12 * m4) >> 12) - v7; - v5 -= v6; - v4 -= v5; - - // Write-back transformed values - src[idx] = v0 + v7; - src[idx + 8 * 7] = v0 - v7; - src[idx + 8] = v1 + v6; - src[idx + 8 * 6] = v1 - v6; - src[idx + 8 * 2] = v2 + v5; - src[idx + 8 * 5] = v2 - v5; - src[idx + 8 * 3] = v3 + v4; - src[idx + 8 * 4] = v3 - v4; - } - - // Process rows - for idx in (0..64).step_by(8) { - // Get even elements - v0 = src[idx] + (128 << 8); // remove DC offset (-128) here - v1 = src[idx + 2]; - v2 = src[idx + 4]; - v3 = src[idx + 6]; - - // Process the even elements - t10 = v0 + v2; - t12 = v0 - v2; - t11 = ((v1 - v3) * m13) >> 12; - v3 += v1; - t11 -= v3; - v0 = t10 + v3; - v3 = t10 - v3; - v1 = t11 + t12; - v2 = t12 - t11; - - // Get odd elements - v4 = src[idx + 7]; - v5 = src[idx + 1]; - v6 = src[idx + 5]; - v7 = src[idx + 3]; - - // Process the odd elements - t10 = v5 - v4; - t11 = v5 + v4; - t12 = v6 - v7; - v7 += v6; - v5 = ((t11 - v7) * m13) >> 12; - v7 += t11; - t13 = ((t10 + t12) * m5) >> 12; - v4 = t13 - ((t10 * m2) >> 12); - v6 = t13 - ((t12 * m4) >> 12) - v7; - v5 -= v6; - v4 -= v5; - - // Descale the transformed values 8 bits and output a row - dst[idx] = ((v0 + v7) >> 8) as i16; - dst[idx + 7] = ((v0 - v7) >> 8) as i16; - dst[idx + 1] = ((v1 + v6) >> 8) as i16; - dst[idx + 6] = ((v1 - v6) >> 8) as i16; - dst[idx + 2] = ((v2 + v5) >> 8) as i16; - dst[idx + 5] = ((v2 - v5) >> 8) as i16; - dst[idx + 3] = ((v3 + v4) >> 8) as i16; - dst[idx + 4] = ((v3 - v4) >> 8) as i16; - } - } - - /// Load all blocks in an MCU into working buffer - /// `self`: decompressor object reference - #[optimize(speed)] - fn mcu_load(&mut self) -> Result<(), Error> { - let mut d: i32; - let mut e: i32; - let mut blk: u32; - let mut bc: u32; - let mut z: u32; - let mut id: u32; - let mut cmp: u32; - let nby = (self.msx as i32 * self.msy as i32) as u32; // Number of Y blocks (1, 2 or 4) - let mut mcu_buf_idx = 0; // Pointer to the first block of MCU - blk = 0; - while blk < nby + 2 { - // Get nby Y blocks and two C blocks - cmp = if blk < nby { 0 } else { blk - nby + 1 }; // Component number 0:Y, 1:Cb, 2:Cr - if cmp != 0 && self.ncomp as i32 != 3 { - // Clear C blocks if not exist (monochrome image) - for i in 0..64 { - self.mcubuf[mcu_buf_idx + i] = 128; - } - } else { - // Load Y/C blocks from input stream - id = if cmp != 0 { 1 } else { 0 }; // Huffman table ID of this component - - // Extract a DC element from input stream - d = self.huffext(id as usize, 0)?; // Extract a huffman coded data (bit length) - bc = d as u32; - d = self.dcv[cmp as usize] as i32; // DC value of previous block - if bc != 0 { - // If there is any difference from previous block - e = self.bitext(bc)?; // Extract data bits - bc = 1 << (bc - 1); // MSB position - if e as u32 & bc == 0 { - e -= ((bc << 1) - 1) as i32; // Restore negative value - // if - // needed - } - d += e; // Get current value - self.dcv[cmp as usize] = d as i16; // Save current DC value - // for - // next block - } - // De-quantizer table ID for this component - let dqidx = self.qtid[cmp as usize] as usize; - if dqidx >= NUM_DEQUANTIZER_TABLES { - return Err(Error::InvalidData); - } - // De-quantize, apply scale factor of Arai algorithm and descale 8 bits - let dfq = &self.qttbl[dqidx]; - self.workbuf[0] = (d * dfq[0]) >> 8; - - // Extract following 63 AC elements from input stream - self.workbuf[1..64].fill(0); // Initialize all AC elements - z = 1; // Top of the AC elements (in zigzag-order) - loop { - // Extract a huffman coded value (zero runs and bit length) - d = self.huffext(id as usize, 1)?; - if d == 0 { - // EOB? - break; - } - bc = d as u32; - z += bc >> 4; // Skip leading zero run - if z >= 64 { - // Too long zero run - return Err(Error::InvalidData); - } - bc &= 0xf; - if bc != 0 { - // Bit length? - d = self.bitext(bc)?; // Extract data bits - bc = 1 << (bc - 1); // MSB position - if d as u32 & bc == 0 { - // Restore negative value if needed - d -= ((bc << 1) - 1) as i32; - } - let i = ZIG[z as usize] as u32; // Get raster-order index - // De-quantize, apply scale factor of Arai algorithm and descale 8 bits - let dqidx = self.qtid[cmp as usize] as usize; - if dqidx >= NUM_DEQUANTIZER_TABLES { - return Err(Error::InvalidData); - } - let dfq = &self.qttbl[dqidx]; - self.workbuf[i as usize] = (d * dfq[i as usize]) >> 8; - } - z += 1; - if z >= 64 { - break; - } - } - - // C components may not be processed if in grayscale output - if JD_FORMAT != 2 || cmp == 0 { - // If no AC element or scale ratio is 1/8, IDCT can be omitted and the block is - // filled with DC value - if z == 1 || JD_USE_SCALE != 0 && self.scale == 3 { - d = self.workbuf[0] / 256 + 128; - if JD_FASTDECODE >= 1 { - for i in 0..64 { - self.mcubuf[mcu_buf_idx + i] = d as i16; - } - } else { - self.mcubuf[..64].fill(d as i16); - } - } else { - // Apply IDCT and store the block to the MCU buffer - Self::block_idct(self.workbuf, &mut self.mcubuf[mcu_buf_idx..]); - } - } - } - mcu_buf_idx += 64; // Next block - blk += 1; - } - Ok(()) // All blocks have been loaded successfully - } - - /// Output an MCU: Convert YCrCb to RGB and output it in RGB form - /// `self`: decompressor object reference - /// `x`: MCU location in the image - /// `y`: MCU location in the image - #[optimize(speed)] - fn mcu_output( - &mut self, - mut x: u32, - mut y: u32, - output_func: &mut dyn JpegOutput, - ) -> Result<(), Error> { - // Adaptive accuracy for both 16-/32-bit systems - let cvacc: i32 = if mem::size_of::() > 2 { 1024 } else { 128 }; - let mut yy: i32; - let mut cb: i32; - let mut cr: i32; - let mut py_idx: usize; - let mut pc_idx: usize; - - // MCU size (pixel) - let mut mx = (self.msx as i32 * 8) as u32; - let my = (self.msy as i32 * 8) as u32; - - // Output rectangular size (it may be clipped at right/bottom end of image) - let mut rx = if (x + mx) <= self.width as u32 { - mx - } else { - self.width as u32 - x - }; - let mut ry = if (y + my) <= self.height as u32 { - my - } else { - self.height as u32 - y - }; - if JD_USE_SCALE != 0 { - rx >>= self.scale; - ry >>= self.scale; - if rx == 0 || ry == 0 { - // Skip this MCU if all pixel is to be rounded off - return Ok(()); - } - x >>= self.scale; - y >>= self.scale; - } - let rect = Rect::from_top_left_and_size( - Point::new(x as i16, y as i16), - Offset::new(rx as i16, ry as i16), - ); - - // SAFETY: Aligning to u8 slice is safe, because the original slice is aligned - // to 32 bits, therefore there are also no residuals (prefix/suffix). - // The data in the slices are integers, so these are valid for both i32 - // and u8. - let (_, workbuf, _) = unsafe { self.workbuf.align_to_mut::() }; - - let mut pix_idx: usize = 0; - let mut op_idx: usize; - - if JD_USE_SCALE == 0 || self.scale != 3 { - // Not for 1/8 scaling - if JD_FORMAT != 2 { - // RGB output (build an RGB MCU from Y/C component) - for iy in 0..my { - py_idx = 0; - pc_idx = 0; - if my == 16 { - // Double block height? - pc_idx += (64 * 4) + ((iy as usize >> 1) * 8); - if iy >= 8 { - py_idx += 64; - } - } else { - // Single block height - pc_idx += (mx * 8 + iy * 8) as usize; - } - py_idx += (iy * 8) as usize; - for ix in 0..mx { - cb = self.mcubuf[pc_idx] as i32 - 128; // Get Cb/Cr component and remove offset - cr = self.mcubuf[pc_idx + 64] as i32 - 128; - if mx == 16 { - // Double block width? - if ix == 8 { - // Jump to next block if double block height - py_idx += 64 - 8; - } - // Step forward chroma pointer every two pixels - pc_idx += (ix & 1) as usize; - } else { - // Single block width - // Step forward chroma pointer every pixel - pc_idx += 1; - } - // Get Y component - yy = self.mcubuf[py_idx] as i32; - py_idx += 1; - // R - workbuf[pix_idx] = (yy + (1.402f64 * cvacc as f64) as i32 * cr / cvacc) - .clamp(0, 255) as u8; - pix_idx += 1; - // G - workbuf[pix_idx] = (yy - - ((0.344f64 * cvacc as f64) as i32 * cb - + (0.714f64 * cvacc as f64) as i32 * cr) - / cvacc) - .clamp(0, 255) as u8; - pix_idx += 1; - // B - workbuf[pix_idx] = (yy + (1.772f64 * cvacc as f64) as i32 * cb / cvacc) - .clamp(0, 255) as u8; - pix_idx += 1; - } - } - } else { - // Monochrome output (build a grayscale MCU from Y comopnent) - - for iy in 0..my { - py_idx = (iy * 8) as usize; - if my == 16 && iy >= 8 { - // Double block height? - py_idx += 64; - } - for ix in 0..mx { - if mx == 16 && ix == 8 { - // Double block width? - // Jump to next block if double block height - py_idx += 64 - 8; - } - // Get and store a Y value as grayscale - workbuf[pix_idx] = self.mcubuf[py_idx] as u8; - pix_idx += 1; - py_idx += 1; - } - } - } - // Descale the MCU rectangular if needed - if JD_USE_SCALE != 0 && self.scale != 0 { - // Get averaged RGB value of each square corresponds to a pixel - let s = (self.scale * 2) as u32; // Number of shifts for averaging - let w = 1 << self.scale as u32; // Width of square - let a = (mx - w) * (if JD_FORMAT != 2 { 3 } else { 1 }); // Bytes to skip for next line in the square - op_idx = 0; - for iy in (0..my).step_by(w as usize) { - for ix in (0..mx).step_by(w as usize) { - pix_idx = ((iy * mx + ix) * (if JD_FORMAT != 2 { 3 } else { 1 })) as usize; - let mut b = 0; - let mut g = 0; - let mut r = 0; - for _ in 0..w { - // Accumulate RGB value in the square - for _ in 0..w { - // Accumulate R or Y (monochrome output) - r += workbuf[pix_idx] as u32; - pix_idx += 1; - if JD_FORMAT != 2 { - // Accumulate G - g += workbuf[pix_idx] as u32; - pix_idx += 1; - // Accumulate B - b += workbuf[pix_idx] as u32; - pix_idx += 1; - } - } - pix_idx += a as usize; - } - // Put the averaged pixel value - // Put R or Y (monochrome output) - workbuf[op_idx] = (r >> s) as u8; - op_idx += 1; - if JD_FORMAT != 2 { - // RGB output? - // Put G - workbuf[op_idx] = (g >> s) as u8; - op_idx += 1; - // Put B - workbuf[op_idx] = (b >> s) as u8; - op_idx += 1; - } - } - } - } - } else { - // For only 1/8 scaling (left-top pixel in each block are the DC value of the - // block) Build a 1/8 descaled RGB MCU from discrete components - pix_idx = 0; - pc_idx = (mx * my) as usize; - cb = self.mcubuf[pc_idx] as i32 - 128; // Get Cb/Cr component and restore right level - cr = self.mcubuf[pc_idx + 64] as i32 - 128; - - for iy in (0..my).step_by(8) { - py_idx = 0; - if iy == 8 { - py_idx = 64 * 2; - } - for _ in (0..mx).step_by(8) { - // Get Y component - yy = self.mcubuf[py_idx] as i32; - py_idx += 64; - if JD_FORMAT != 2 { - // R - workbuf[pix_idx] = (yy + (1.402f64 * cvacc as f64) as i32 * cr / cvacc) - .clamp(0, 255) as u8; - pix_idx += 1; - // G - workbuf[pix_idx] = (yy - - ((0.344f64 * cvacc as f64) as i32 * cb - + (0.714f64 * cvacc as f64) as i32 * cr) - / cvacc) - .clamp(0, 255) as u8; - //B - pix_idx += 1; - workbuf[pix_idx] = (yy + (1.772f64 * cvacc as f64) as i32 * cb / cvacc) - .clamp(0, 255) as u8; - pix_idx += 1; - } else { - workbuf[pix_idx] = yy as u8; - pix_idx += 1; - } - } - } - } - - // Squeeze up pixel table if a part of MCU is to be truncated - mx >>= self.scale as i32; - if rx < mx { - // Is the MCU spans right edge? - let mut s_0_idx = 0; - let mut d_idx = 0; - for _ in 0..ry { - for _ in 0..rx { - // Copy effective pixels - workbuf[d_idx] = workbuf[s_0_idx]; - s_0_idx += 1; - d_idx += 1; - if JD_FORMAT != 2 { - workbuf[d_idx] = workbuf[s_0_idx]; - s_0_idx += 1; - d_idx += 1; - workbuf[d_idx] = workbuf[s_0_idx]; - s_0_idx += 1; - d_idx += 1; - } - } - // Skip truncated pixels - s_0_idx += ((mx - rx) * (if JD_FORMAT != 2 { 3 } else { 1 })) as usize; - } - } - - // Convert RGB888 to RGB565 if needed - if JD_FORMAT == 1 { - let mut s_1_idx = 0; - let mut d_0_idx = 0; - let mut w_0: u16; - for _ in 0..rx * ry { - // RRRRR----------- - w_0 = ((workbuf[s_1_idx] as i32 & 0xf8) << 8) as u16; - s_1_idx += 1; - // -----GGGGGG----- - w_0 = (w_0 as i32 | (workbuf[s_1_idx] as i32 & 0xfc) << 3) as u16; - s_1_idx += 1; - // -----------BBBBB - w_0 = (w_0 as i32 | workbuf[s_1_idx] as i32 >> 3) as u16; - s_1_idx += 1; - - workbuf[d_0_idx] = (w_0 & 0xFF) as u8; - workbuf[d_0_idx + 1] = (w_0 >> 8) as u8; - d_0_idx += 2; - } - } - - // Output the rectangular - // SAFETY: Aligning to u16 slice is safe, because the original slice is aligned - // to 32 bits, therefore there are also no residuals (prefix/suffix). - // The data in the slices are integers, so these are valid for both i32 - // and u16. - let (_, bitmap, _) = unsafe { self.workbuf.align_to::() }; - let bitmap = &bitmap[..(rect.width() * rect.height()) as usize]; - if output_func.write(self, rect, bitmap) { - Ok(()) - } else { - Err(Error::Interrupted) - } - } - - pub fn mcu_height(&self) -> i16 { - self.msy as i16 * 8 - } - - pub fn width(&self) -> i16 { - self.width as i16 - } - - pub fn height(&self) -> i16 { - self.height as i16 - } - - pub fn set_scale(&mut self, scale: u8) -> Result<(), Error> { - if scale > (if JD_USE_SCALE != 0 { 3 } else { 0 }) { - return Err(Error::Parameter); - } - self.scale = scale; - Ok(()) - } - - /// Analyze the JPEG image and Initialize decompressor object - pub fn new(input_func: &'i mut dyn JpegInput, pool: &'p mut [u8]) -> Result { - let mut jd = JDEC { - dctr: 0, - dptr: 0, - inbuf: &mut [], - dbit: 0, - scale: 0, - msx: 0, - msy: 0, - qtid: [0; 3], - pool, - dcv: [0; 3], - rsc: 0, - width: 0, - height: 0, - huffbits: [[&mut [], &mut []], [&mut [], &mut []]], - huffcode: [[&mut [], &mut []], [&mut [], &mut []]], - huffcode_len: [[0; 2]; 2], - huffdata: [[&mut [], &mut []], [&mut [], &mut []]], - qttbl: [&mut [], &mut [], &mut [], &mut []], - wreg: 0, - marker: 0, - longofs: [[0; 2]; 2], - hufflut_ac: [&mut [], &mut []], - hufflut_dc: [&mut [], &mut []], - workbuf: &mut [], - rst: 0, - ncomp: 0, - nrst: 0, - mcubuf: &mut [], - input_func, - }; - - let mut marker: u16; - let mut ofs: u32; - let mut len: usize; - - // Allocate stream input buffer - jd.inbuf = jd.alloc_slice(JD_SZBUF)?; - - // Find SOI marker - marker = 0; - ofs = marker as u32; - loop { - if jd.jpeg_in(Some(0), 1) != 1 { - // Err: SOI was not detected - return Err(Error::Input); - } - ofs += 1; - marker = ((marker as i32) << 8 | jd.inbuf[0] as i32) as u16; - if marker == 0xffd8 { - break; - } - } - loop { - // Parse JPEG segments - // Get a JPEG marker - if jd.jpeg_in(Some(0), 4) != 4 { - return Err(Error::Input); - } - // Marker - marker = ((jd.inbuf[0] as i32) << 8 | jd.inbuf[1] as i32) as u16; - // Length field - len = ((jd.inbuf[2] as i32) << 8 | jd.inbuf[3] as i32) as usize; - if len <= 2 || marker >> 8 != 0xff { - return Err(Error::InvalidData); - } - len -= 2; // Segment content size - ofs += (4 + len) as u32; // Number of bytes loaded - - match marker & 0xff { - 0xC0 => { - // SOF0 (baseline JPEG) - if len > JD_SZBUF { - return Err(Error::MemoryInput); - } - // Load segment data - if jd.jpeg_in(Some(0), len) != len { - return Err(Error::Input); - } - // Image width in unit of pixel - jd.width = ((jd.inbuf[3] as i32) << 8 | jd.inbuf[4] as i32) as u16; - // Image height in unit of pixel - jd.height = ((jd.inbuf[1] as i32) << 8 | jd.inbuf[2] as i32) as u16; - // Number of color components - jd.ncomp = jd.inbuf[5]; - if jd.ncomp != 3 && jd.ncomp != 1 { - // Err: Supports only Grayscale and Y/Cb/Cr - return Err(Error::UnsupportedJpeg); - } - // Check each image component - for i in 0..jd.ncomp as usize { - // Get sampling factor - let b = jd.inbuf[7 + 3 * i]; - if i == 0 { - // Y component - if b != 0x11 && b != 0x22 && b != 0x21 { - // Check sampling factor - // Err: Supports only 4:4:4, 4:2:0 or 4:2:2 - return Err(Error::UnsupportedJpeg); - } - // Size of MCU [blocks] - jd.msx = (b as i32 >> 4) as u8; - jd.msy = (b as i32 & 15) as u8; - } else if b as i32 != 0x11 { - // Cb/Cr component - // Err: Sampling factor of Cb/Cr must be 1 - return Err(Error::UnsupportedJpeg); - } - // Get dequantizer table ID for this component - jd.qtid[i] = jd.inbuf[8 + 3 * i]; - if jd.qtid[i] as i32 > 3 { - // Err: Invalid ID - return Err(Error::UnsupportedJpeg); - } - } - } - 0xDD => { - // DRI - Define Restart Interval - if len > JD_SZBUF { - return Err(Error::MemoryInput); - } - // Load segment data - if jd.jpeg_in(Some(0), len) != len { - return Err(Error::Input); - } - // Get restart interval (MCUs) - jd.nrst = ((jd.inbuf[0] as i32) << 8 | jd.inbuf[1] as i32) as u16; - } - 0xC4 => { - // DHT - Define Huffman Tables - if len > JD_SZBUF { - return Err(Error::MemoryInput); - } - // Load segment data - if jd.jpeg_in(Some(0), len) != len { - return Err(Error::Input); - } - // Create huffman tables - jd.create_huffman_tbl(len)?; - } - 0xDB => { - // DQT - Define Quantizer Tables - if len > JD_SZBUF { - return Err(Error::MemoryInput); - } - // Load segment data - if jd.jpeg_in(Some(0), len) != len { - return Err(Error::Input); - } - // Create de-quantizer tables - jd.create_qt_tbl(len)?; - } - 0xDA => { - // SOS - Start of Scan - if len > JD_SZBUF { - return Err(Error::MemoryInput); - } - // Load segment data - if jd.jpeg_in(Some(0), len) != len { - return Err(Error::Input); - } - if jd.width == 0 || jd.height == 0 { - // Err: Invalid image size - return Err(Error::InvalidData); - } - if jd.inbuf[0] as i32 != jd.ncomp as i32 { - // Err: Wrong color components - return Err(Error::UnsupportedJpeg); - } - // Check if all tables corresponding to each components have been loaded - for i in 0..jd.ncomp as usize { - // Get huffman table ID - let b = jd.inbuf[2 + 2 * i]; - if b != 0 && b != 0x11 { - // Err: Different table number for DC/AC element - return Err(Error::UnsupportedJpeg); - } - let n = if i != 0 { 1 } else { 0 }; // Component class - - // Check huffman table for this component - if (jd.huffbits[n][0]).is_empty() || (jd.huffbits[n][1]).is_empty() { - // Err: Not loaded - return Err(Error::InvalidData); - } - // Check dequantizer table for this component - if (jd.qttbl[jd.qtid[i] as usize]).is_empty() { - // Err: Not loaded - return Err(Error::InvalidData); - } - } - // Allocate working buffer for MCU and pixel output - let n = jd.msy as i32 * jd.msx as i32; // Number of Y blocks in the MCU - if n == 0 { - // Err: SOF0 has not been loaded - return Err(Error::InvalidData); - } - len = (n * 64 * 3 + 64) as usize; // Allocate buffer for IDCT and RGB output - if len < 256 { - // but at least 256 byte is required for IDCT - len = 256; - } - - jd.workbuf = jd.alloc_slice(len / 4)?; - - // Allocate MCU working buffer - jd.mcubuf = jd.alloc_slice((n as usize + 2) * 64)?; - - // Align stream read offset to JD_SZBUF - ofs %= JD_SZBUF as u32; - if ofs != 0 { - jd.dctr = jd.jpeg_in(Some(ofs as usize), (JD_SZBUF as u32 - ofs) as usize); - } - jd.dptr = (ofs - (if JD_FASTDECODE != 0 { 0 } else { 1 })) as usize; - return Ok(jd); // Initialization succeeded. Ready to - // decompress the JPEG image. - } - // SOF1, SOF2, SOF3, SOF5, SOF6, SOF7, SOF9, SOF10, SOF11, SOF13, SOF14, SOF15, EOI - 0xC1 | 0xC2 | 0xC3 | 0xC5 | 0xC6 | 0xC7 | 0xC9 | 0xCA | 0xCB | 0xCD | 0xCF - | 0xCE | 0xD9 => { - // Unsupported JPEG standard (may be progressive JPEG) - return Err(Error::UnsupportedJpeg); - } - _ => { - // Unknown segment (comment, exif or etc..) - // Skip segment data (null pointer specifies to remove data from the stream) - if jd.jpeg_in(None, len) != len { - return Err(Error::Input); - } - } - } - } - } - - /// Start to decompress the JPEG picture - /// `scale`: output de-scaling factor (0 to 3) - #[optimize(speed)] - pub fn decomp(&mut self, output_func: &mut dyn JpegOutput) -> Result<(), Error> { - let mx = (self.msx as i32 * 8) as u32; // Size of the MCU (pixel) - let my = (self.msy as i32 * 8) as u32; // Size of the MCU (pixel) - let mut y = 0; - while y < self.height as u32 { - // Vertical loop of MCUs - let mut x = 0; - while x < self.width as u32 { - // Horizontal loop of MCUs - if self.nrst != 0 && { - // Process restart interval if enabled - let val = self.rst; - self.rst += 1; - val == self.nrst - } { - let val = self.rsc; - self.rsc += 1; - self.restart(val)?; - self.rst = 1; - } - // Load an MCU (decompress huffman coded stream, dequantize and apply IDCT) - self.mcu_load()?; - // Output the MCU (YCbCr to RGB, scaling and output) - self.mcu_output(x, y, output_func)?; - x += mx; - } - y += my; - } - Ok(()) - } -} pub fn jpeg(data: &[u8], pos: Point, scale: u8) { let mut buffer = BufferJpegWork::get_cleared(); @@ -1446,29 +61,6 @@ pub fn jpeg_test(data: &[u8]) -> bool { result } -pub trait JpegInput { - fn read(&mut self, buf: Option<&mut [u8]>, nread: usize) -> usize; -} - -pub struct BufferInput<'i>(pub &'i [u8]); - -impl<'i> JpegInput for BufferInput<'i> { - fn read(&mut self, inbuf: Option<&mut [u8]>, n_data: usize) -> usize { - let len = n_data.min(self.0.len()); - let (toread, newdata) = self.0.split_at(len); - if let Some(inbuf) = inbuf { - (inbuf[..len]).copy_from_slice(toread) - } - self.0 = newdata; - len - } -} - -pub trait JpegOutput { - /// Return `false` to interrupt. - fn write(&mut self, jd: &JDEC, rect: Rect, pixels: &[u16]) -> bool; -} - pub struct BufferOutput { buffer: BufferJpeg, buffer_width: i16, @@ -1494,10 +86,16 @@ impl BufferOutput { } impl JpegOutput for BufferOutput { - fn write(&mut self, jd: &JDEC, rect: Rect, bitmap: &[u16]) -> bool { - let w = rect.width(); - let h = rect.height(); - let x = rect.x0; + fn write( + &mut self, + jd: &JDEC, + rect_origin: (u32, u32), + rect_size: (u32, u32), + bitmap: &[u16], + ) -> bool { + let w = rect_size.0 as i16; + let h = rect_size.1 as i16; + let x = rect_origin.0 as i16; if h > self.buffer_height { // unsupported height, call and let know @@ -1531,8 +129,18 @@ impl JpegOutput for BufferOutput { pub struct PixelDataOutput(Point); impl JpegOutput for PixelDataOutput { - fn write(&mut self, _jd: &JDEC, rect: Rect, bitmap: &[u16]) -> bool { + fn write( + &mut self, + _jd: &JDEC, + rect_origin: (u32, u32), + rect_size: (u32, u32), + bitmap: &[u16], + ) -> bool { let pos = self.0; + let rect = Rect::from_top_left_and_size( + Point::new(rect_origin.0 as i16, rect_origin.1 as i16), + Offset::new(rect_size.0 as i16, rect_size.1 as i16), + ); let r = rect.translate(pos.into()); let clamped = r.clamp(constant::screen()); set_window(clamped); @@ -1549,11 +157,3 @@ impl JpegOutput for PixelDataOutput { true } } - -pub struct BlackHoleOutput; - -impl JpegOutput for BlackHoleOutput { - fn write(&mut self, _jd: &JDEC, _rect: Rect, _bitmap: &[u16]) -> bool { - true - } -} diff --git a/rust/trezor-tjpgdec/Cargo.toml b/rust/trezor-tjpgdec/Cargo.toml new file mode 100644 index 0000000000..6c594fb0e6 --- /dev/null +++ b/rust/trezor-tjpgdec/Cargo.toml @@ -0,0 +1,9 @@ +[package] +name = "trezor-tjpgdec" +description = "Tiny JPEG Decompressor" +version = "0.1.0" +edition = "2021" +authors = ["Trezor Company"] +readme = "README.md" +license = "GPL-3.0-only" +repository = "https://github.com/trezor/trezor-firmware/" diff --git a/rust/trezor-tjpgdec/LICENSE b/rust/trezor-tjpgdec/LICENSE new file mode 100644 index 0000000000..f288702d2f --- /dev/null +++ b/rust/trezor-tjpgdec/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/rust/trezor-tjpgdec/README.md b/rust/trezor-tjpgdec/README.md new file mode 100644 index 0000000000..be2c212a1c --- /dev/null +++ b/rust/trezor-tjpgdec/README.md @@ -0,0 +1,10 @@ +# trezor-tjpgdec + +Rust version of [Tiny JPEG Decompressor](http://elm-chan.org/fsw/tjpgd/00index.html). + +## Credits + +* Original C library was written by [ChaN](http://elm-chan.org/). +* Several bugs fixed by [Chris Mumford](https://github.com/cmumford/TJpgDec). +* Converted to Rust using [c2rust](https://c2rust.com/) by [Martin Milata](mailto:martin.milata@satoshilabs.com). +* Heavy refactoring by [Michal Bruna](mailto:michal.bruna@satoshilabs.com). diff --git a/rust/trezor-tjpgdec/src/lib.rs b/rust/trezor-tjpgdec/src/lib.rs new file mode 100644 index 0000000000..39a2c890e3 --- /dev/null +++ b/rust/trezor-tjpgdec/src/lib.rs @@ -0,0 +1,1424 @@ +/*----------------------------------------------------------------------------/ +/ TJpgDec - Tiny JPEG Decompressor R0.03+trezor (C)ChaN, 2021 +/-----------------------------------------------------------------------------/ +/ The TJpgDec is a generic JPEG decompressor module for tiny embedded systems. +/ This is a free software that opened for education, research and commercial +/ developments under license policy of following terms. +/ +/ Copyright (C) 2021, ChaN, all right reserved. +/ +/ * The TJpgDec module is a free software and there is NO WARRANTY. +/ * No restriction on use. You can use, modify and redistribute it for +/ personal, non-profit or commercial products UNDER YOUR RESPONSIBILITY. +/ * Redistributions of source code must retain the above copyright notice. +/ +/-----------------------------------------------------------------------------/ +/ Oct 04, 2011 R0.01 First release. +/ Feb 19, 2012 R0.01a Fixed decompression fails when scan starts with an escape seq. +/ Sep 03, 2012 R0.01b Added JD_TBLCLIP option. +/ Mar 16, 2019 R0.01c Supprted stdint.h. +/ Jul 01, 2020 R0.01d Fixed wrong integer type usage. +/ May 08, 2021 R0.02 Supprted grayscale image. Separated configuration options. +/ Jun 11, 2021 R0.02a Some performance improvement. +/ Jul 01, 2021 R0.03 Added JD_FASTDECODE option. +/ Some performance improvement. +/ Jan 02, 2023 Rust version by Trezor Company, modified to meet our needs. + +Trezor modifications: + - included overflow detection from https://github.com/cmumford/TJpgDec + - removed JD_FASTDECODE=0 option + - removed JD_TBLCLIP option + - allowed interrupted functionality + - tighter integration into Trezor codebase by using our data structures + - removed generic input and output functions, replaced by our specific functionality +/----------------------------------------------------------------------------*/ + +#![no_std] + +use core::{ + f64::consts::{FRAC_1_SQRT_2, SQRT_2}, + mem, slice, +}; + +/// Specifies output pixel format. +/// 0: RGB888 (24-bit/pix) +/// 1: RGB565 (16-bit/pix) +/// 2: Grayscale (8-bit/pix) +const JD_FORMAT: u32 = 1; + +/// Switches output descaling feature. +/// 0: Disable +/// 1: Enable +const JD_USE_SCALE: u32 = 1; + +/// Optimization level +/// 0: NOT IMPLEMENTED Basic optimization. Suitable for 8/16-bit MCUs. +/// 1: + 32-bit barrel shifter. Suitable for 32-bit MCUs. +/// 2: + Table conversion for huffman decoding (wants 6 << HUFF_BIT bytes of +/// RAM) +const JD_FASTDECODE: u32 = 2; + +/// Specifies size of stream input buffer +const JD_SZBUF: usize = 512; + +const HUFF_BIT: u32 = 10; +const HUFF_LEN: u32 = 1 << HUFF_BIT; +const HUFF_MASK: u32 = HUFF_LEN - 1; + +const NUM_DEQUANTIZER_TABLES: usize = 4; + +#[derive(PartialEq, Eq)] +pub enum Error { + /// Interrupted by output function, call `JDEC::decomp` to continue. + Interrupted, + /// Device error or wrong termination of input stream. + Input, + /// Insufficient memory pool for the image. + MemoryPool, + /// Insufficient stream input buffer. + MemoryInput, + /// Parameter error. + Parameter, + /// Data format error (may be broken data). + InvalidData, + /// Not supported JPEG standard. + UnsupportedJpeg, +} + +pub struct JDEC<'i, 'p> { + dctr: usize, + dptr: usize, + inbuf: &'p mut [u8], + dbit: u8, + scale: u8, + msx: u8, + msy: u8, + qtid: [u8; 3], + ncomp: u8, + dcv: [i16; 3], + nrst: u16, + rst: u16, + rsc: u16, + width: u16, + height: u16, + huffbits: [[&'p mut [u8]; 2]; 2], + huffcode: [[&'p mut [u16]; 2]; 2], + huffcode_len: [[usize; 2]; 2], + huffdata: [[&'p mut [u8]; 2]; 2], + qttbl: [&'p mut [i32]; 4], + wreg: u32, + marker: u8, + longofs: [[u8; 2]; 2], + hufflut_ac: [&'p mut [u16]; 2], + hufflut_dc: [&'p mut [u8]; 2], + workbuf: &'p mut [i32], + mcubuf: &'p mut [i16], + pool: &'p mut [u8], + input_func: &'i mut dyn JpegInput, +} + +/// Zigzag-order to raster-order conversion table +#[rustfmt::skip] +const ZIG: [u8; 64] = [ + 0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5, + 12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6, 7, 14, 21, 28, + 35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51, + 58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47, 55, 62, 63, +]; + +macro_rules! f { + ($num:expr) => {{ + ($num * 8192_f64) as u16 + }}; +} + +/// Input scale factor of Arai algorithm +/// (scaled up 16 bits for fixed point operations) +#[rustfmt::skip] +const IPSF: [u16; 64] = [ + f!(1.00000), f!(1.38704), f!(1.30656), f!(1.17588), f!(1.00000), f!(0.78570), f!(0.54120), f!(0.27590), + f!(1.38704), f!(1.92388), f!(1.81226), f!(1.63099), f!(1.38704), f!(1.08979), f!(0.75066), f!(0.38268), + f!(1.30656), f!(1.81226), f!(1.70711), f!(1.53636), f!(1.30656), f!(1.02656), f!(FRAC_1_SQRT_2), f!(0.36048), + f!(1.17588), f!(1.63099), f!(1.53636), f!(1.38268), f!(1.17588), f!(0.92388), f!(0.63638), f!(0.32442), + f!(1.00000), f!(1.38704), f!(1.30656), f!(1.17588), f!(1.00000), f!(0.78570), f!(0.54120), f!(0.27590), + f!(0.78570), f!(1.08979), f!(1.02656), f!(0.92388), f!(0.78570), f!(0.61732), f!(0.42522), f!(0.21677), + f!(0.54120), f!(0.75066), f!(FRAC_1_SQRT_2), f!(0.63638), f!(0.54120), f!(0.42522), f!(0.29290), f!(0.14932), + f!(0.27590), f!(0.38268), f!(0.36048), f!(0.32442), f!(0.27590), f!(0.21678), f!(0.14932), f!(0.07612), +]; + +impl<'i, 'p> JDEC<'i, 'p> { + /// Allocate a memory block from memory pool + /// `self`: decompressor object reference + /// `ndata` number of `T` items to allocate + fn alloc_slice(&mut self, ndata: usize) -> Result<&'p mut [T], Error> { + let ndata_bytes = ndata * mem::size_of::(); + let ndata_aligned = (ndata_bytes + 3) & !3; + if self.pool.len() < ndata_aligned { + // Err: not enough memory + return Err(Error::MemoryPool); + } + + // SAFETY: + // - Memory is valid because it comes from a valid slice. + // - Memory is initialized because here we consider integers always + // initialized. + // - The slices do not overlap and the original reference is overwritten, + // ensuring that the returned references are exclusive. + unsafe { + let data = slice::from_raw_parts_mut(self.pool.as_mut_ptr() as _, ndata); + let newpool = slice::from_raw_parts_mut( + self.pool.as_mut_ptr().add(ndata_aligned), + self.pool.len() - ndata_aligned, + ); + self.pool = newpool; + Ok(data) + } + } + + fn jpeg_in(&mut self, inbuf_offset: Option, n_data: usize) -> usize { + if let Some(offset) = inbuf_offset { + let inbuf = &mut self.inbuf[offset..offset + n_data]; + self.input_func.read(Some(inbuf), n_data) + } else { + self.input_func.read(None, n_data) + } + } + + /// Create de-quantization and prescaling tables with a DQT segment + /// `self`: decompressor object reference + /// `ndata`: size of input data + fn create_qt_tbl(&mut self, mut ndata: usize) -> Result<(), Error> { + let mut i: u32; + let mut d: u8; + let mut data_idx = 0; + while ndata != 0 { + // Process all tables in the segment + if ndata < 65 { + // Err: table size is unaligned + return Err(Error::InvalidData); + } + ndata -= 65; + + d = self.inbuf[data_idx]; // Get table property + data_idx += 1; + if d & 0xf0 != 0 { + // Err: not 8-bit resolution + return Err(Error::InvalidData); + } + i = (d & 3) as u32; // Get table ID + + // Allocate a memory block for the table + // Register the table + self.qttbl[i as usize] = self.alloc_slice(64)?; + for zi in ZIG { + // Load the table + // Apply scale factor of Arai algorithm to the de-quantizers + self.qttbl[i as usize][zi as usize] = + ((self.inbuf[data_idx] as u32) * IPSF[zi as usize] as u32) as i32; + data_idx += 1; + } + } + Ok(()) + } + + /// Create huffman code tables with a DHT segment + /// `self`: decompressor object reference + /// `ndata`: size of input data + fn create_huffman_tbl(&mut self, mut ndata: usize) -> Result<(), Error> { + let mut j: u32; + let mut b: u32; + let mut cls: usize; + let mut num: usize; + let mut np: usize; + let mut d: u8; + let mut hc: u16; + let mut data_idx = 0; + while ndata != 0 { + // Process all tables in the segment + if ndata < 17 { + // Err: wrong data size + return Err(Error::InvalidData); + } + ndata -= 17; + d = self.inbuf[data_idx]; // Get table number and class + data_idx += 1; + if d & 0xee != 0 { + // Err: invalid class/number + return Err(Error::InvalidData); + } + cls = d as usize >> 4; // class = dc(0)/ac(1) + num = d as usize & 0xf; // table number = 0/1 + // Allocate a memory block for the bit distribution table + self.huffbits[num][cls] = self.alloc_slice(16)?; + + np = 0; + for i in 0..16 { + // Load number of patterns for 1 to 16-bit code + // Get sum of code words for each code + self.huffbits[num][cls][i] = self.inbuf[data_idx]; + np += self.inbuf[data_idx] as usize; + data_idx += 1; + } + // Allocate a memory block for the code word table + self.huffcode[num][cls] = self.alloc_slice(np)?; + self.huffcode_len[num][cls] = np; + + // Re-build huffman code word table + hc = 0; + j = 0; + for i in 0..16 { + b = self.huffbits[num][cls][i] as u32; + while b > 0 { + self.huffcode[num][cls][j as usize] = hc; + hc += 1; + j += 1; + b -= 1; + } + hc <<= 1; + } + if ndata < np { + // Err: wrong data size + return Err(Error::InvalidData); + } + ndata -= np; + + // Allocate a memory block for the decoded data + self.huffdata[num][cls] = self.alloc_slice(np)?; + + // Load decoded data corresponds to each code word + for i in 0..np { + d = self.inbuf[data_idx]; + data_idx += 1; + if cls == 0 && d > 11 { + return Err(Error::InvalidData); + } + self.huffdata[num][cls][i] = d; + } + if JD_FASTDECODE == 2 { + // Create fast huffman decode table + let mut span: u32; + let mut td: u32; + let mut ti: u32; + if cls != 0 { + // LUT for AC elements + self.hufflut_ac[num] = self.alloc_slice(HUFF_LEN as usize)?; + // Default value (0xFFFF: may be long code) + self.hufflut_ac[num].fill(0xffff); + } else { + // LUT for DC elements + self.hufflut_dc[num] = self.alloc_slice(HUFF_LEN as usize)?; + // Default value (0xFF: may be long code) + self.hufflut_dc[num].fill(0xff); + } + let mut i = 0; + + // Create LUT + for b in 0..HUFF_BIT { + j = self.huffbits[num][cls][b as usize] as u32; + while j != 0 { + // Index of input pattern for the code + ti = + (self.huffcode[num][cls][i] << ((HUFF_BIT - 1) - b)) as u32 & HUFF_MASK; + + if cls != 0 { + // b15..b8: code length, b7..b0: zero run and data length + td = self.huffdata[num][cls][i] as u32 | (b + 1) << 8; + i += 1; + span = 1 << ((HUFF_BIT - 1) - b); + while span != 0 { + span -= 1; + self.hufflut_ac[num][ti as usize] = td as u16; + ti += 1; + } + } else { + // b7..b4: code length, b3..b0: data length + td = self.huffdata[num][cls][i] as u32 | (b + 1) << 4; + i += 1; + span = 1 << ((HUFF_BIT - 1) - b); + while span != 0 { + span -= 1; + self.hufflut_dc[num][ti as usize] = td as u8; + ti += 1; + } + } + j -= 1; + } + } + // Code table offset for long code + self.longofs[num][cls] = i as u8; + } + } + Ok(()) + } + + /// Extract a huffman decoded data from input stream + /// `self`: decompressor object reference + /// `id`: table ID (0:Y, 1:C) + /// `cls`: table class (0:DC, 1:AC) + fn huffext(&mut self, id: usize, cls: usize) -> Result { + let mut dc: usize = self.dctr; + let mut dp: usize = self.dptr; + let mut d: u32; + let mut flg: u32 = 0; + let mut nc: u32; + let mut bl: u32; + let mut wbit: u32 = (self.dbit as i32 % 32) as u32; + let mut w: u32 = self.wreg & ((1 << wbit) - 1); + while wbit < 16 { + // Prepare 16 bits into the working register + if self.marker != 0 { + d = 0xff; // Input stream has stalled for a marker. Generate + // stuff bits + } else { + if dc == 0 { + // Buffer empty, re-fill input buffer + dp = 0; // Top of input buffer + dc = self.jpeg_in(Some(0), JD_SZBUF); + if dc == 0 { + // Err: read error or wrong stream termination + return Err(Error::Input); + } + } + d = self.inbuf[dp] as u32; + dp += 1; + + dc -= 1; + if flg != 0 { + // In flag sequence? + flg = 0; // Exit flag sequence + if d != 0 { + // Not an escape of 0xFF but a marker + self.marker = d as u8; + } + d = 0xff; + } else if d == 0xff { + // Is start of flag sequence? + // Enter flag sequence, get trailing byte + flg = 1; + continue; + } + } + // Shift 8 bits in the working register + w = w << 8 | d; + wbit += 8; + } + self.dctr = dc; + self.dptr = dp; + self.wreg = w; + + let mut hb_idx = 0; + let mut hc_idx = 0; + let mut hd_idx = 0; + + if JD_FASTDECODE == 2 { + // Table serch for the short codes + d = w >> (wbit - HUFF_BIT); // Short code as table index + if cls != 0 { + // AC element + d = self.hufflut_ac[id][d as usize] as u32; // Table decode + if d != 0xffff { + // It is done if hit in short code + self.dbit = (wbit - (d >> 8)) as u8; // Snip the code length + return Ok((d & 0xff) as i32); // b7..0: zero run and + // following + // data bits + } + } else { + // DC element + d = self.hufflut_dc[id][d as usize] as u32; // Table decode + if d != 0xff { + // It is done if hit in short code + self.dbit = (wbit - (d >> 4)) as u8; // Snip the code length + return Ok((d & 0xf) as i32); // b3..0: following data bits + } + } + + // Incremental serch for the codes longer than HUFF_BIT + hb_idx = HUFF_BIT; // Bit distribution table + hc_idx = self.longofs[id][cls]; // Code word table + hd_idx = self.longofs[id][cls]; // Data table + bl = HUFF_BIT + 1; + } else { + // Incremental search for all codes + bl = 1; + } + + // Incremental search + while bl <= 16 { + nc = self.huffbits[id][cls][hb_idx as usize] as u32; + hb_idx += 1; + if nc != 0 { + d = w >> (wbit - bl); + loop { + // Search the code word in this bit length + if hc_idx as usize >= self.huffcode_len[id][cls] { + return Err(Error::InvalidData); + } + let val = self.huffcode[id][cls][hc_idx as usize]; + if d == val as u32 { + // Matched? + self.dbit = (wbit - bl) as u8; // Snip the huffman code + // Return the decoded data + return Ok(self.huffdata[id][cls][hd_idx as usize] as i32); + } + hc_idx += 1; + hd_idx += 1; + nc -= 1; + if nc == 0 { + break; + } + } + } + bl += 1; + } + + // Err: code not found (may be collapted data) + Err(Error::InvalidData) + } + + /// Extract N bits from input stream + /// `self`: decompressor object reference + /// `nbit`: number of bits to extract (1 to 16) + fn bitext(&mut self, nbit: u32) -> Result { + let mut dc: usize = self.dctr; + let mut dp: usize = self.dptr; + let mut d: u32; + let mut flg: u32 = 0; + let mut wbit: u32 = (self.dbit as i32 % 32) as u32; + let mut w: u32 = self.wreg & ((1 << wbit) - 1); + while wbit < nbit { + // Prepare nbit bits into the working register + if self.marker != 0 { + d = 0xff; // Input stream stalled, generate stuff bits + } else { + if dc == 0 { + // Buffer empty, re-fill input buffer + dp = 0; // Top of input buffer + dc = self.jpeg_in(Some(0), JD_SZBUF); + if dc == 0 { + // Err: read error or wrong stream termination + return Err(Error::Input); + } + } + d = self.inbuf[dp] as u32; + dp += 1; + dc -= 1; + if flg != 0 { + // In flag sequence? + flg = 0; // Exit flag sequence + if d != 0 { + // Not an escape of 0xFF but a marker + self.marker = d as u8; + } + d = 0xff; + } else if d == 0xff { + // Is start of flag sequence? + flg = 1; // Enter flag sequence, get trailing byte + continue; + } + } + w = w << 8 | d; + wbit += 8; + } + self.wreg = w; + self.dbit = (wbit - nbit) as u8; + self.dctr = dc; + self.dptr = dp; + + Ok((w >> ((wbit - nbit) % 32)) as i32) + } + + /// Process restart interval + /// `self`: decompressor object reference + /// `rstn`: expected restart sequence number + fn restart(&mut self, rstn: u16) -> Result<(), Error> { + let mut dp = self.dptr; + let mut dc: usize = self.dctr; + let mut marker: u16; + if self.marker != 0 { + // Generate a maker if it has been detected + marker = 0xff00 | self.marker as u16; + self.marker = 0; + } else { + marker = 0; + for _ in 0..2 { + // Get a restart marker + if dc == 0 { + // No input data is available, re-fill input buffer + dp = 0; + dc = self.jpeg_in(Some(0), JD_SZBUF); + if dc == 0 { + return Err(Error::Input); + } + } + // Get a byte + let b = self.inbuf[dp] as u16; + marker = marker << 8 | b; + dp += 1; + dc -= 1; + } + self.dptr = dp; + self.dctr = dc; + } + + // Check the marker + if marker & 0xffd8 != 0xffd0 || marker & 7 != rstn & 7 { + // Err: expected RSTn marker was not detected (may be collapted data) + return Err(Error::InvalidData); + } + self.dbit = 0; // Discard stuff bits + // Reset DC offset + self.dcv[0] = 0; + self.dcv[1] = 0; + self.dcv[2] = 0; + Ok(()) + } + + /// Apply Inverse-DCT in Arai Algorithm + /// `src`: input block data (de-quantized and pre-scaled for Arai Algorithm) + /// `dst`: destination to store the block as byte array + fn block_idct(src: &mut [i32], dst: &mut [i16]) { + let m13: i32 = (SQRT_2 * 4096_f64) as i32; + let m2: i32 = (1.08239f64 * 4096_f64) as i32; + let m4: i32 = (2.61313f64 * 4096_f64) as i32; + let m5: i32 = (1.84776f64 * 4096_f64) as i32; + let mut v0: i32; + let mut v1: i32; + let mut v2: i32; + let mut v3: i32; + let mut v4: i32; + let mut v5: i32; + let mut v6: i32; + let mut v7: i32; + let mut t10: i32; + let mut t11: i32; + let mut t12: i32; + let mut t13: i32; + + // Process columns + for idx in 0..8 { + // Get even elements + v0 = src[idx]; + v1 = src[idx + 8 * 2]; + v2 = src[idx + 8 * 4]; + v3 = src[idx + 8 * 6]; + + // Process the even elements + t10 = v0 + v2; + t12 = v0 - v2; + t11 = ((v1 - v3) * m13) >> 12; + v3 += v1; + t11 -= v3; + v0 = t10 + v3; + v3 = t10 - v3; + v1 = t11 + t12; + v2 = t12 - t11; + + // Get odd elements + v4 = src[idx + 8 * 7]; + v5 = src[idx + 8]; + v6 = src[idx + 8 * 5]; + v7 = src[idx + 8 * 3]; + + // Process the odd elements + t10 = v5 - v4; + t11 = v5 + v4; + t12 = v6 - v7; + v7 += v6; + v5 = ((t11 - v7) * m13) >> 12; + v7 += t11; + t13 = ((t10 + t12) * m5) >> 12; + v4 = t13 - ((t10 * m2) >> 12); + v6 = t13 - ((t12 * m4) >> 12) - v7; + v5 -= v6; + v4 -= v5; + + // Write-back transformed values + src[idx] = v0 + v7; + src[idx + 8 * 7] = v0 - v7; + src[idx + 8] = v1 + v6; + src[idx + 8 * 6] = v1 - v6; + src[idx + 8 * 2] = v2 + v5; + src[idx + 8 * 5] = v2 - v5; + src[idx + 8 * 3] = v3 + v4; + src[idx + 8 * 4] = v3 - v4; + } + + // Process rows + for idx in (0..64).step_by(8) { + // Get even elements + v0 = src[idx] + (128 << 8); // remove DC offset (-128) here + v1 = src[idx + 2]; + v2 = src[idx + 4]; + v3 = src[idx + 6]; + + // Process the even elements + t10 = v0 + v2; + t12 = v0 - v2; + t11 = ((v1 - v3) * m13) >> 12; + v3 += v1; + t11 -= v3; + v0 = t10 + v3; + v3 = t10 - v3; + v1 = t11 + t12; + v2 = t12 - t11; + + // Get odd elements + v4 = src[idx + 7]; + v5 = src[idx + 1]; + v6 = src[idx + 5]; + v7 = src[idx + 3]; + + // Process the odd elements + t10 = v5 - v4; + t11 = v5 + v4; + t12 = v6 - v7; + v7 += v6; + v5 = ((t11 - v7) * m13) >> 12; + v7 += t11; + t13 = ((t10 + t12) * m5) >> 12; + v4 = t13 - ((t10 * m2) >> 12); + v6 = t13 - ((t12 * m4) >> 12) - v7; + v5 -= v6; + v4 -= v5; + + // Descale the transformed values 8 bits and output a row + dst[idx] = ((v0 + v7) >> 8) as i16; + dst[idx + 7] = ((v0 - v7) >> 8) as i16; + dst[idx + 1] = ((v1 + v6) >> 8) as i16; + dst[idx + 6] = ((v1 - v6) >> 8) as i16; + dst[idx + 2] = ((v2 + v5) >> 8) as i16; + dst[idx + 5] = ((v2 - v5) >> 8) as i16; + dst[idx + 3] = ((v3 + v4) >> 8) as i16; + dst[idx + 4] = ((v3 - v4) >> 8) as i16; + } + } + + /// Load all blocks in an MCU into working buffer + /// `self`: decompressor object reference + fn mcu_load(&mut self) -> Result<(), Error> { + let mut d: i32; + let mut e: i32; + let mut blk: u32; + let mut bc: u32; + let mut z: u32; + let mut id: u32; + let mut cmp: u32; + let nby = (self.msx as i32 * self.msy as i32) as u32; // Number of Y blocks (1, 2 or 4) + let mut mcu_buf_idx = 0; // Pointer to the first block of MCU + blk = 0; + while blk < nby + 2 { + // Get nby Y blocks and two C blocks + cmp = if blk < nby { 0 } else { blk - nby + 1 }; // Component number 0:Y, 1:Cb, 2:Cr + if cmp != 0 && self.ncomp as i32 != 3 { + // Clear C blocks if not exist (monochrome image) + for i in 0..64 { + self.mcubuf[mcu_buf_idx + i] = 128; + } + } else { + // Load Y/C blocks from input stream + id = if cmp != 0 { 1 } else { 0 }; // Huffman table ID of this component + + // Extract a DC element from input stream + d = self.huffext(id as usize, 0)?; // Extract a huffman coded data (bit length) + bc = d as u32; + d = self.dcv[cmp as usize] as i32; // DC value of previous block + if bc != 0 { + // If there is any difference from previous block + e = self.bitext(bc)?; // Extract data bits + bc = 1 << (bc - 1); // MSB position + if e as u32 & bc == 0 { + e -= ((bc << 1) - 1) as i32; // Restore negative value + // if + // needed + } + d += e; // Get current value + self.dcv[cmp as usize] = d as i16; // Save current DC value + // for + // next block + } + // De-quantizer table ID for this component + let dqidx = self.qtid[cmp as usize] as usize; + if dqidx >= NUM_DEQUANTIZER_TABLES { + return Err(Error::InvalidData); + } + // De-quantize, apply scale factor of Arai algorithm and descale 8 bits + let dfq = &self.qttbl[dqidx]; + self.workbuf[0] = (d * dfq[0]) >> 8; + + // Extract following 63 AC elements from input stream + self.workbuf[1..64].fill(0); // Initialize all AC elements + z = 1; // Top of the AC elements (in zigzag-order) + loop { + // Extract a huffman coded value (zero runs and bit length) + d = self.huffext(id as usize, 1)?; + if d == 0 { + // EOB? + break; + } + bc = d as u32; + z += bc >> 4; // Skip leading zero run + if z >= 64 { + // Too long zero run + return Err(Error::InvalidData); + } + bc &= 0xf; + if bc != 0 { + // Bit length? + d = self.bitext(bc)?; // Extract data bits + bc = 1 << (bc - 1); // MSB position + if d as u32 & bc == 0 { + // Restore negative value if needed + d -= ((bc << 1) - 1) as i32; + } + let i = ZIG[z as usize] as u32; // Get raster-order index + // De-quantize, apply scale factor of Arai algorithm and descale 8 bits + let dqidx = self.qtid[cmp as usize] as usize; + if dqidx >= NUM_DEQUANTIZER_TABLES { + return Err(Error::InvalidData); + } + let dfq = &self.qttbl[dqidx]; + self.workbuf[i as usize] = (d * dfq[i as usize]) >> 8; + } + z += 1; + if z >= 64 { + break; + } + } + + // C components may not be processed if in grayscale output + if JD_FORMAT != 2 || cmp == 0 { + // If no AC element or scale ratio is 1/8, IDCT can be omitted and the block is + // filled with DC value + if z == 1 || JD_USE_SCALE != 0 && self.scale == 3 { + d = self.workbuf[0] / 256 + 128; + if JD_FASTDECODE >= 1 { + for i in 0..64 { + self.mcubuf[mcu_buf_idx + i] = d as i16; + } + } else { + self.mcubuf[..64].fill(d as i16); + } + } else { + // Apply IDCT and store the block to the MCU buffer + Self::block_idct(self.workbuf, &mut self.mcubuf[mcu_buf_idx..]); + } + } + } + mcu_buf_idx += 64; // Next block + blk += 1; + } + Ok(()) // All blocks have been loaded successfully + } + + /// Output an MCU: Convert YCrCb to RGB and output it in RGB form + /// `self`: decompressor object reference + /// `x`: MCU location in the image + /// `y`: MCU location in the image + fn mcu_output( + &mut self, + mut x: u32, + mut y: u32, + output_func: &mut dyn JpegOutput, + ) -> Result<(), Error> { + // Adaptive accuracy for both 16-/32-bit systems + let cvacc: i32 = if mem::size_of::() > 2 { 1024 } else { 128 }; + let mut yy: i32; + let mut cb: i32; + let mut cr: i32; + let mut py_idx: usize; + let mut pc_idx: usize; + + // MCU size (pixel) + let mut mx = (self.msx as i32 * 8) as u32; + let my = (self.msy as i32 * 8) as u32; + + // Output rectangular size (it may be clipped at right/bottom end of image) + let mut rx = if (x + mx) <= self.width as u32 { + mx + } else { + self.width as u32 - x + }; + let mut ry = if (y + my) <= self.height as u32 { + my + } else { + self.height as u32 - y + }; + if JD_USE_SCALE != 0 { + rx >>= self.scale; + ry >>= self.scale; + if rx == 0 || ry == 0 { + // Skip this MCU if all pixel is to be rounded off + return Ok(()); + } + x >>= self.scale; + y >>= self.scale; + } + let rect_origin = (x, y); + let rect_size = (rx, ry); + + // SAFETY: Aligning to u8 slice is safe, because the original slice is aligned + // to 32 bits, therefore there are also no residuals (prefix/suffix). + // The data in the slices are integers, so these are valid for both i32 + // and u8. + let (_, workbuf, _) = unsafe { self.workbuf.align_to_mut::() }; + + let mut pix_idx: usize = 0; + let mut op_idx: usize; + + if JD_USE_SCALE == 0 || self.scale != 3 { + // Not for 1/8 scaling + if JD_FORMAT != 2 { + // RGB output (build an RGB MCU from Y/C component) + for iy in 0..my { + py_idx = 0; + pc_idx = 0; + if my == 16 { + // Double block height? + pc_idx += (64 * 4) + ((iy as usize >> 1) * 8); + if iy >= 8 { + py_idx += 64; + } + } else { + // Single block height + pc_idx += (mx * 8 + iy * 8) as usize; + } + py_idx += (iy * 8) as usize; + for ix in 0..mx { + cb = self.mcubuf[pc_idx] as i32 - 128; // Get Cb/Cr component and remove offset + cr = self.mcubuf[pc_idx + 64] as i32 - 128; + if mx == 16 { + // Double block width? + if ix == 8 { + // Jump to next block if double block height + py_idx += 64 - 8; + } + // Step forward chroma pointer every two pixels + pc_idx += (ix & 1) as usize; + } else { + // Single block width + // Step forward chroma pointer every pixel + pc_idx += 1; + } + // Get Y component + yy = self.mcubuf[py_idx] as i32; + py_idx += 1; + // R + workbuf[pix_idx] = (yy + (1.402f64 * cvacc as f64) as i32 * cr / cvacc) + .clamp(0, 255) as u8; + pix_idx += 1; + // G + workbuf[pix_idx] = (yy + - ((0.344f64 * cvacc as f64) as i32 * cb + + (0.714f64 * cvacc as f64) as i32 * cr) + / cvacc) + .clamp(0, 255) as u8; + pix_idx += 1; + // B + workbuf[pix_idx] = (yy + (1.772f64 * cvacc as f64) as i32 * cb / cvacc) + .clamp(0, 255) as u8; + pix_idx += 1; + } + } + } else { + // Monochrome output (build a grayscale MCU from Y comopnent) + + for iy in 0..my { + py_idx = (iy * 8) as usize; + if my == 16 && iy >= 8 { + // Double block height? + py_idx += 64; + } + for ix in 0..mx { + if mx == 16 && ix == 8 { + // Double block width? + // Jump to next block if double block height + py_idx += 64 - 8; + } + // Get and store a Y value as grayscale + workbuf[pix_idx] = self.mcubuf[py_idx] as u8; + pix_idx += 1; + py_idx += 1; + } + } + } + // Descale the MCU rectangular if needed + if JD_USE_SCALE != 0 && self.scale != 0 { + // Get averaged RGB value of each square corresponds to a pixel + let s = (self.scale * 2) as u32; // Number of shifts for averaging + let w = 1 << self.scale as u32; // Width of square + let a = (mx - w) * (if JD_FORMAT != 2 { 3 } else { 1 }); // Bytes to skip for next line in the square + op_idx = 0; + for iy in (0..my).step_by(w as usize) { + for ix in (0..mx).step_by(w as usize) { + pix_idx = ((iy * mx + ix) * (if JD_FORMAT != 2 { 3 } else { 1 })) as usize; + let mut b = 0; + let mut g = 0; + let mut r = 0; + for _ in 0..w { + // Accumulate RGB value in the square + for _ in 0..w { + // Accumulate R or Y (monochrome output) + r += workbuf[pix_idx] as u32; + pix_idx += 1; + if JD_FORMAT != 2 { + // Accumulate G + g += workbuf[pix_idx] as u32; + pix_idx += 1; + // Accumulate B + b += workbuf[pix_idx] as u32; + pix_idx += 1; + } + } + pix_idx += a as usize; + } + // Put the averaged pixel value + // Put R or Y (monochrome output) + workbuf[op_idx] = (r >> s) as u8; + op_idx += 1; + if JD_FORMAT != 2 { + // RGB output? + // Put G + workbuf[op_idx] = (g >> s) as u8; + op_idx += 1; + // Put B + workbuf[op_idx] = (b >> s) as u8; + op_idx += 1; + } + } + } + } + } else { + // For only 1/8 scaling (left-top pixel in each block are the DC value of the + // block) Build a 1/8 descaled RGB MCU from discrete components + pix_idx = 0; + pc_idx = (mx * my) as usize; + cb = self.mcubuf[pc_idx] as i32 - 128; // Get Cb/Cr component and restore right level + cr = self.mcubuf[pc_idx + 64] as i32 - 128; + + for iy in (0..my).step_by(8) { + py_idx = 0; + if iy == 8 { + py_idx = 64 * 2; + } + for _ in (0..mx).step_by(8) { + // Get Y component + yy = self.mcubuf[py_idx] as i32; + py_idx += 64; + if JD_FORMAT != 2 { + // R + workbuf[pix_idx] = (yy + (1.402f64 * cvacc as f64) as i32 * cr / cvacc) + .clamp(0, 255) as u8; + pix_idx += 1; + // G + workbuf[pix_idx] = (yy + - ((0.344f64 * cvacc as f64) as i32 * cb + + (0.714f64 * cvacc as f64) as i32 * cr) + / cvacc) + .clamp(0, 255) as u8; + //B + pix_idx += 1; + workbuf[pix_idx] = (yy + (1.772f64 * cvacc as f64) as i32 * cb / cvacc) + .clamp(0, 255) as u8; + pix_idx += 1; + } else { + workbuf[pix_idx] = yy as u8; + pix_idx += 1; + } + } + } + } + + // Squeeze up pixel table if a part of MCU is to be truncated + mx >>= self.scale as i32; + if rx < mx { + // Is the MCU spans right edge? + let mut s_0_idx = 0; + let mut d_idx = 0; + for _ in 0..ry { + for _ in 0..rx { + // Copy effective pixels + workbuf[d_idx] = workbuf[s_0_idx]; + s_0_idx += 1; + d_idx += 1; + if JD_FORMAT != 2 { + workbuf[d_idx] = workbuf[s_0_idx]; + s_0_idx += 1; + d_idx += 1; + workbuf[d_idx] = workbuf[s_0_idx]; + s_0_idx += 1; + d_idx += 1; + } + } + // Skip truncated pixels + s_0_idx += ((mx - rx) * (if JD_FORMAT != 2 { 3 } else { 1 })) as usize; + } + } + + // Convert RGB888 to RGB565 if needed + if JD_FORMAT == 1 { + let mut s_1_idx = 0; + let mut d_0_idx = 0; + let mut w_0: u16; + for _ in 0..rx * ry { + // RRRRR----------- + w_0 = ((workbuf[s_1_idx] as i32 & 0xf8) << 8) as u16; + s_1_idx += 1; + // -----GGGGGG----- + w_0 = (w_0 as i32 | (workbuf[s_1_idx] as i32 & 0xfc) << 3) as u16; + s_1_idx += 1; + // -----------BBBBB + w_0 = (w_0 as i32 | workbuf[s_1_idx] as i32 >> 3) as u16; + s_1_idx += 1; + + workbuf[d_0_idx] = (w_0 & 0xFF) as u8; + workbuf[d_0_idx + 1] = (w_0 >> 8) as u8; + d_0_idx += 2; + } + } + + // Output the rectangular + // SAFETY: Aligning to u16 slice is safe, because the original slice is aligned + // to 32 bits, therefore there are also no residuals (prefix/suffix). + // The data in the slices are integers, so these are valid for both i32 + // and u16. + let (_, bitmap, _) = unsafe { self.workbuf.align_to::() }; + let bitmap = &bitmap[..(rect_size.0 * rect_size.1) as usize]; + if output_func.write(self, rect_origin, rect_size, bitmap) { + Ok(()) + } else { + Err(Error::Interrupted) + } + } + + pub fn mcu_height(&self) -> i16 { + self.msy as i16 * 8 + } + + pub fn width(&self) -> i16 { + self.width as i16 + } + + pub fn height(&self) -> i16 { + self.height as i16 + } + + pub fn set_scale(&mut self, scale: u8) -> Result<(), Error> { + if scale > (if JD_USE_SCALE != 0 { 3 } else { 0 }) { + return Err(Error::Parameter); + } + self.scale = scale; + Ok(()) + } + + /// Analyze the JPEG image and Initialize decompressor object + pub fn new(input_func: &'i mut dyn JpegInput, pool: &'p mut [u8]) -> Result { + let mut jd = JDEC { + dctr: 0, + dptr: 0, + inbuf: &mut [], + dbit: 0, + scale: 0, + msx: 0, + msy: 0, + qtid: [0; 3], + pool, + dcv: [0; 3], + rsc: 0, + width: 0, + height: 0, + huffbits: [[&mut [], &mut []], [&mut [], &mut []]], + huffcode: [[&mut [], &mut []], [&mut [], &mut []]], + huffcode_len: [[0; 2]; 2], + huffdata: [[&mut [], &mut []], [&mut [], &mut []]], + qttbl: [&mut [], &mut [], &mut [], &mut []], + wreg: 0, + marker: 0, + longofs: [[0; 2]; 2], + hufflut_ac: [&mut [], &mut []], + hufflut_dc: [&mut [], &mut []], + workbuf: &mut [], + rst: 0, + ncomp: 0, + nrst: 0, + mcubuf: &mut [], + input_func, + }; + + let mut marker: u16; + let mut ofs: u32; + let mut len: usize; + + // Allocate stream input buffer + jd.inbuf = jd.alloc_slice(JD_SZBUF)?; + + // Find SOI marker + marker = 0; + ofs = marker as u32; + loop { + if jd.jpeg_in(Some(0), 1) != 1 { + // Err: SOI was not detected + return Err(Error::Input); + } + ofs += 1; + marker = ((marker as i32) << 8 | jd.inbuf[0] as i32) as u16; + if marker == 0xffd8 { + break; + } + } + loop { + // Parse JPEG segments + // Get a JPEG marker + if jd.jpeg_in(Some(0), 4) != 4 { + return Err(Error::Input); + } + // Marker + marker = ((jd.inbuf[0] as i32) << 8 | jd.inbuf[1] as i32) as u16; + // Length field + len = ((jd.inbuf[2] as i32) << 8 | jd.inbuf[3] as i32) as usize; + if len <= 2 || marker >> 8 != 0xff { + return Err(Error::InvalidData); + } + len -= 2; // Segment content size + ofs += (4 + len) as u32; // Number of bytes loaded + + match marker & 0xff { + 0xC0 => { + // SOF0 (baseline JPEG) + if len > JD_SZBUF { + return Err(Error::MemoryInput); + } + // Load segment data + if jd.jpeg_in(Some(0), len) != len { + return Err(Error::Input); + } + // Image width in unit of pixel + jd.width = ((jd.inbuf[3] as i32) << 8 | jd.inbuf[4] as i32) as u16; + // Image height in unit of pixel + jd.height = ((jd.inbuf[1] as i32) << 8 | jd.inbuf[2] as i32) as u16; + // Number of color components + jd.ncomp = jd.inbuf[5]; + if jd.ncomp != 3 && jd.ncomp != 1 { + // Err: Supports only Grayscale and Y/Cb/Cr + return Err(Error::UnsupportedJpeg); + } + // Check each image component + for i in 0..jd.ncomp as usize { + // Get sampling factor + let b = jd.inbuf[7 + 3 * i]; + if i == 0 { + // Y component + if b != 0x11 && b != 0x22 && b != 0x21 { + // Check sampling factor + // Err: Supports only 4:4:4, 4:2:0 or 4:2:2 + return Err(Error::UnsupportedJpeg); + } + // Size of MCU [blocks] + jd.msx = (b as i32 >> 4) as u8; + jd.msy = (b as i32 & 15) as u8; + } else if b as i32 != 0x11 { + // Cb/Cr component + // Err: Sampling factor of Cb/Cr must be 1 + return Err(Error::UnsupportedJpeg); + } + // Get dequantizer table ID for this component + jd.qtid[i] = jd.inbuf[8 + 3 * i]; + if jd.qtid[i] as i32 > 3 { + // Err: Invalid ID + return Err(Error::UnsupportedJpeg); + } + } + } + 0xDD => { + // DRI - Define Restart Interval + if len > JD_SZBUF { + return Err(Error::MemoryInput); + } + // Load segment data + if jd.jpeg_in(Some(0), len) != len { + return Err(Error::Input); + } + // Get restart interval (MCUs) + jd.nrst = ((jd.inbuf[0] as i32) << 8 | jd.inbuf[1] as i32) as u16; + } + 0xC4 => { + // DHT - Define Huffman Tables + if len > JD_SZBUF { + return Err(Error::MemoryInput); + } + // Load segment data + if jd.jpeg_in(Some(0), len) != len { + return Err(Error::Input); + } + // Create huffman tables + jd.create_huffman_tbl(len)?; + } + 0xDB => { + // DQT - Define Quantizer Tables + if len > JD_SZBUF { + return Err(Error::MemoryInput); + } + // Load segment data + if jd.jpeg_in(Some(0), len) != len { + return Err(Error::Input); + } + // Create de-quantizer tables + jd.create_qt_tbl(len)?; + } + 0xDA => { + // SOS - Start of Scan + if len > JD_SZBUF { + return Err(Error::MemoryInput); + } + // Load segment data + if jd.jpeg_in(Some(0), len) != len { + return Err(Error::Input); + } + if jd.width == 0 || jd.height == 0 { + // Err: Invalid image size + return Err(Error::InvalidData); + } + if jd.inbuf[0] as i32 != jd.ncomp as i32 { + // Err: Wrong color components + return Err(Error::UnsupportedJpeg); + } + // Check if all tables corresponding to each components have been loaded + for i in 0..jd.ncomp as usize { + // Get huffman table ID + let b = jd.inbuf[2 + 2 * i]; + if b != 0 && b != 0x11 { + // Err: Different table number for DC/AC element + return Err(Error::UnsupportedJpeg); + } + let n = if i != 0 { 1 } else { 0 }; // Component class + + // Check huffman table for this component + if (jd.huffbits[n][0]).is_empty() || (jd.huffbits[n][1]).is_empty() { + // Err: Not loaded + return Err(Error::InvalidData); + } + // Check dequantizer table for this component + if (jd.qttbl[jd.qtid[i] as usize]).is_empty() { + // Err: Not loaded + return Err(Error::InvalidData); + } + } + // Allocate working buffer for MCU and pixel output + let n = jd.msy as i32 * jd.msx as i32; // Number of Y blocks in the MCU + if n == 0 { + // Err: SOF0 has not been loaded + return Err(Error::InvalidData); + } + len = (n * 64 * 3 + 64) as usize; // Allocate buffer for IDCT and RGB output + if len < 256 { + // but at least 256 byte is required for IDCT + len = 256; + } + + jd.workbuf = jd.alloc_slice(len / 4)?; + + // Allocate MCU working buffer + jd.mcubuf = jd.alloc_slice((n as usize + 2) * 64)?; + + // Align stream read offset to JD_SZBUF + ofs %= JD_SZBUF as u32; + if ofs != 0 { + jd.dctr = jd.jpeg_in(Some(ofs as usize), (JD_SZBUF as u32 - ofs) as usize); + } + jd.dptr = (ofs - (if JD_FASTDECODE != 0 { 0 } else { 1 })) as usize; + return Ok(jd); // Initialization succeeded. Ready to + // decompress the JPEG image. + } + // SOF1, SOF2, SOF3, SOF5, SOF6, SOF7, SOF9, SOF10, SOF11, SOF13, SOF14, SOF15, EOI + 0xC1 | 0xC2 | 0xC3 | 0xC5 | 0xC6 | 0xC7 | 0xC9 | 0xCA | 0xCB | 0xCD | 0xCF + | 0xCE | 0xD9 => { + // Unsupported JPEG standard (may be progressive JPEG) + return Err(Error::UnsupportedJpeg); + } + _ => { + // Unknown segment (comment, exif or etc..) + // Skip segment data (null pointer specifies to remove data from the stream) + if jd.jpeg_in(None, len) != len { + return Err(Error::Input); + } + } + } + } + } + + /// Start to decompress the JPEG picture + /// `scale`: output de-scaling factor (0 to 3) + pub fn decomp(&mut self, output_func: &mut dyn JpegOutput) -> Result<(), Error> { + let mx = (self.msx as i32 * 8) as u32; // Size of the MCU (pixel) + let my = (self.msy as i32 * 8) as u32; // Size of the MCU (pixel) + let mut y = 0; + while y < self.height as u32 { + // Vertical loop of MCUs + let mut x = 0; + while x < self.width as u32 { + // Horizontal loop of MCUs + if self.nrst != 0 && { + // Process restart interval if enabled + let val = self.rst; + self.rst += 1; + val == self.nrst + } { + let val = self.rsc; + self.rsc += 1; + self.restart(val)?; + self.rst = 1; + } + // Load an MCU (decompress huffman coded stream, dequantize and apply IDCT) + self.mcu_load()?; + // Output the MCU (YCbCr to RGB, scaling and output) + self.mcu_output(x, y, output_func)?; + x += mx; + } + y += my; + } + Ok(()) + } +} + +pub trait JpegInput { + fn read(&mut self, buf: Option<&mut [u8]>, nread: usize) -> usize; +} + +pub struct BufferInput<'i>(pub &'i [u8]); + +impl<'i> JpegInput for BufferInput<'i> { + fn read(&mut self, inbuf: Option<&mut [u8]>, n_data: usize) -> usize { + let len = n_data.min(self.0.len()); + let (toread, newdata) = self.0.split_at(len); + if let Some(inbuf) = inbuf { + (inbuf[..len]).copy_from_slice(toread) + } + self.0 = newdata; + len + } +} + +pub trait JpegOutput { + /// Return `false` to interrupt. + fn write( + &mut self, + jd: &JDEC, + rect_origin: (u32, u32), + rect_size: (u32, u32), + pixels: &[u16], + ) -> bool; +} + +pub struct BlackHoleOutput; + +impl JpegOutput for BlackHoleOutput { + fn write( + &mut self, + _jd: &JDEC, + _rect_origin: (u32, u32), + _rect_size: (u32, u32), + _bitmap: &[u16], + ) -> bool { + true + } +}