mirror of
https://github.com/storytold/craft-libs.git
synced 2026-11-17 07:44:40 +00:00
1099 lines
40 KiB
Rust
1099 lines
40 KiB
Rust
//! Lossless JPEG ("LJ92"): ITU-T T.81 / ISO 10918-1 process 14 (Annex H), Huffman-coded, as used by DNG,
|
||
//! Canon CR2 and Sony lossless ARW.
|
||
//!
|
||
//! - All seven predictors, 2–16 bit precision, 1–4 interleaved components (1×1 sampling), point transform,
|
||
//! restart intervals, `SSSS = 16` differences.
|
||
//! - [`decode`] returns the frame as interleaved samples in raster order (`width × height × components`),
|
||
//! which callers re-tile (DNG tiles, CR2 slices).
|
||
//! - Selection value 8, which T.81 leaves undefined, is Hasselblad's coding in 3FR and FFF files
|
||
//! ([`decode`] reads it; [`decode_hasselblad`] documents the rule and how it was established).
|
||
//! - [`encode`] writes a conforming stream with per-component optimal Huffman tables built with the
|
||
//! T.81 Annex K.2 procedure — used by tests (bit-exact round trips) and later by DNG export.
|
||
|
||
use crate::RawError;
|
||
|
||
/// A decoded lossless-JPEG frame.
|
||
#[derive(Clone, Debug, PartialEq, Eq)]
|
||
pub struct Frame {
|
||
pub width: usize,
|
||
pub height: usize,
|
||
pub components: usize,
|
||
pub precision: u8,
|
||
pub predictor: u8,
|
||
pub point_transform: u8,
|
||
/// `width × height × components` interleaved samples.
|
||
pub data: Vec<u16>,
|
||
}
|
||
|
||
fn err(s: &str) -> RawError {
|
||
RawError::Corrupt(format!("lossless JPEG: {s}"))
|
||
}
|
||
|
||
/// Huffman decoding table (T.81 Annex C "BITS"/"HUFFVAL").
|
||
#[derive(Clone, Debug)]
|
||
pub struct Huffman {
|
||
/// Indexed by the next `LOOKUP` bits; length 0 = slow path. Per entry: bits 0-7 the symbol, bits 8-11 the code
|
||
/// length, bits 12-15 the length of code plus extra bits when both fit in the lookup (0 = they do not), and
|
||
/// bits 16-31 the signed difference in that case.
|
||
fast: Vec<u32>,
|
||
maxcode: [i32; 18],
|
||
valptr: [i32; 17],
|
||
mincode: [i32; 17],
|
||
values: Vec<u8>,
|
||
}
|
||
|
||
const LOOKUP: u32 = 12;
|
||
|
||
impl Huffman {
|
||
/// Build from the 16 code-length counts and the symbol list.
|
||
pub fn new(counts: &[u8; 16], values: &[u8]) -> Result<Huffman, RawError> {
|
||
let total: usize = counts.iter().map(|&c| c as usize).sum();
|
||
if total > values.len() || total > 256 || total == 0 {
|
||
return Err(err("bad Huffman table"));
|
||
}
|
||
let mut maxcode = [-1i32; 18];
|
||
let mut valptr = [0i32; 17];
|
||
let mut mincode = [0i32; 17];
|
||
let mut fast = vec![0u32; 1 << LOOKUP];
|
||
let mut code = 0i32;
|
||
let mut k = 0usize;
|
||
for len in 1..=16usize {
|
||
let n = counts[len - 1] as i32;
|
||
valptr[len] = k as i32;
|
||
mincode[len] = code;
|
||
for _ in 0..n {
|
||
if len as u32 <= LOOKUP {
|
||
let shift = LOOKUP - len as u32;
|
||
let base = (code as usize) << shift;
|
||
let ssss = values[k] as u32;
|
||
for i in 0..(1usize << shift) {
|
||
if let Some(slot) = fast.get_mut(base + i) {
|
||
*slot = fast_entry(len as u32, ssss, base + i);
|
||
}
|
||
}
|
||
}
|
||
code += 1;
|
||
k += 1;
|
||
}
|
||
maxcode[len] = if n > 0 { code - 1 } else { -1 };
|
||
if code > (1 << len) {
|
||
return Err(err("over-subscribed Huffman table"));
|
||
}
|
||
code <<= 1;
|
||
}
|
||
maxcode[17] = i32::MAX;
|
||
Ok(Huffman { fast, maxcode, valptr, mincode, values: values[..total].to_vec() })
|
||
}
|
||
|
||
#[inline]
|
||
pub fn decode<B: Bits>(&self, br: &mut B) -> Result<u8, RawError> {
|
||
let e = self.fast[br.peek(LOOKUP) as usize];
|
||
let len = (e >> 8) & 15;
|
||
if len > 0 {
|
||
br.consume(len);
|
||
return Ok(e as u8);
|
||
}
|
||
self.decode_slow(br)
|
||
}
|
||
|
||
/// One symbol and its T.81 difference in a single lookup when code and extra bits fit in `LOOKUP` bits; the same
|
||
/// as [`Huffman::decode`] followed by [`diff_value`]. `strict`: a category above 16 is an error (subsampled
|
||
/// scans) instead of reading 16 bits.
|
||
#[inline]
|
||
pub fn decode_diff<B: Bits>(&self, br: &mut B, strict: bool) -> Result<i32, RawError> {
|
||
let e = self.fast[br.peek(LOOKUP) as usize];
|
||
let len = (e >> 8) & 15;
|
||
let total = (e >> 12) & 15;
|
||
if total > 0 {
|
||
br.consume(total);
|
||
return Ok((e as i32) >> 16);
|
||
}
|
||
let ssss = if len > 0 {
|
||
br.consume(len);
|
||
e as u8
|
||
} else {
|
||
self.decode_slow(br)?
|
||
};
|
||
if strict && ssss > 16 {
|
||
return Err(err("invalid difference category"));
|
||
}
|
||
Ok(diff_value(br, ssss))
|
||
}
|
||
|
||
#[cold]
|
||
fn decode_slow<B: Bits>(&self, br: &mut B) -> Result<u8, RawError> {
|
||
let mut code = br.peek(LOOKUP + 1) as i32;
|
||
let mut len = LOOKUP as usize + 1;
|
||
while len <= 16 && code > self.maxcode[len] {
|
||
len += 1;
|
||
code = br.peek(len as u32) as i32;
|
||
}
|
||
if len > 16 {
|
||
return Err(err("invalid Huffman code"));
|
||
}
|
||
br.consume(len as u32);
|
||
let idx = self.valptr[len] + code - self.mincode[len];
|
||
self.values.get(idx as usize).copied().ok_or_else(|| err("invalid Huffman code"))
|
||
}
|
||
}
|
||
|
||
/// Lookup entry for a code of `len` bits (`len <= LOOKUP`) naming category `ssss`, at window position `index`
|
||
/// (the code is the top `len` bits of the `LOOKUP`-bit window). See [`Huffman::fast`].
|
||
fn fast_entry(len: u32, ssss: u32, index: usize) -> u32 {
|
||
let base = (len << 8) | ssss;
|
||
if ssss == 0 {
|
||
return base | (len << 12);
|
||
}
|
||
if ssss > 11 || len + ssss > LOOKUP {
|
||
return base;
|
||
}
|
||
let v = ((index >> (LOOKUP - len - ssss)) & ((1 << ssss) - 1)) as i32;
|
||
let d = if v < (1 << (ssss - 1)) { v - (1 << ssss) + 1 } else { v };
|
||
base | ((len + ssss) << 12) | ((d as i16 as u16 as u32) << 16)
|
||
}
|
||
|
||
/// A source of entropy-coded bits, first bit most significant.
|
||
pub trait Bits {
|
||
/// The next `n` (1..=32) bits without consuming them; zeros past the end.
|
||
fn peek(&mut self, n: u32) -> u32;
|
||
fn consume(&mut self, n: u32);
|
||
#[inline]
|
||
fn get(&mut self, n: u32) -> u32 {
|
||
if n == 0 {
|
||
return 0;
|
||
}
|
||
let v = self.peek(n);
|
||
self.consume(n);
|
||
v
|
||
}
|
||
}
|
||
|
||
impl Bits for BitReader<'_> {
|
||
#[inline]
|
||
fn peek(&mut self, n: u32) -> u32 {
|
||
BitReader::peek(self, n)
|
||
}
|
||
#[inline]
|
||
fn consume(&mut self, n: u32) {
|
||
BitReader::consume(self, n)
|
||
}
|
||
}
|
||
|
||
/// MSB-first bit reader over JPEG entropy-coded data (handles `FF 00` stuffing; stops at markers, feeding zeros).
|
||
pub struct BitReader<'a> {
|
||
data: &'a [u8],
|
||
pos: usize,
|
||
buf: u64,
|
||
bits: u32,
|
||
/// A marker (`FF xx`, xx ≠ 0) was reached.
|
||
pub marker: Option<u8>,
|
||
/// Bits fed past the end of data (for corruption detection).
|
||
pub overrun: u32,
|
||
}
|
||
|
||
impl<'a> BitReader<'a> {
|
||
pub fn new(data: &'a [u8]) -> Self {
|
||
Self { data, pos: 0, buf: 0, bits: 0, marker: None, overrun: 0 }
|
||
}
|
||
#[inline]
|
||
fn fill(&mut self) {
|
||
while self.bits <= 56 {
|
||
let byte = if self.marker.is_some() || self.pos >= self.data.len() {
|
||
self.overrun += 8;
|
||
0
|
||
} else {
|
||
let b = self.data[self.pos];
|
||
if b == 0xff {
|
||
let next = self.data.get(self.pos + 1).copied().unwrap_or(0);
|
||
if next == 0 {
|
||
self.pos += 2;
|
||
0xff
|
||
} else {
|
||
self.marker = Some(next);
|
||
self.overrun += 8;
|
||
0
|
||
}
|
||
} else {
|
||
self.pos += 1;
|
||
b
|
||
}
|
||
};
|
||
self.buf |= (byte as u64) << (56 - self.bits);
|
||
self.bits += 8;
|
||
}
|
||
}
|
||
#[inline]
|
||
pub fn peek(&mut self, n: u32) -> u32 {
|
||
if self.bits < n {
|
||
self.fill();
|
||
}
|
||
(self.buf >> (64 - n)) as u32
|
||
}
|
||
#[inline]
|
||
pub fn consume(&mut self, n: u32) {
|
||
self.buf <<= n;
|
||
self.bits -= n;
|
||
}
|
||
#[inline]
|
||
pub fn get(&mut self, n: u32) -> u32 {
|
||
if n == 0 {
|
||
return 0;
|
||
}
|
||
let v = self.peek(n);
|
||
self.consume(n);
|
||
v
|
||
}
|
||
/// Discard buffered bits and skip to just after the next `RSTn` marker. Returns false if none found.
|
||
fn restart(&mut self) -> bool {
|
||
self.buf = 0;
|
||
self.bits = 0;
|
||
self.marker = None;
|
||
self.overrun = 0;
|
||
while self.pos + 1 < self.data.len() {
|
||
if self.data[self.pos] == 0xff && (0xd0..=0xd7).contains(&self.data[self.pos + 1]) {
|
||
self.pos += 2;
|
||
return true;
|
||
}
|
||
self.pos += 1;
|
||
}
|
||
false
|
||
}
|
||
/// Bytes consumed so far (approximate while bits are buffered).
|
||
pub fn position(&self) -> usize {
|
||
self.pos
|
||
}
|
||
}
|
||
|
||
/// Difference value for category `ssss` (T.81 Table H.2 / F.12 EXTEND).
|
||
#[inline]
|
||
pub fn diff_value<B: Bits>(br: &mut B, ssss: u8) -> i32 {
|
||
match ssss {
|
||
0 => 0,
|
||
16 => 32768,
|
||
s => {
|
||
let s = s.min(16) as u32;
|
||
let v = br.get(s) as i32;
|
||
if v < (1 << (s - 1)) { v - (1 << s) + 1 } else { v }
|
||
}
|
||
}
|
||
}
|
||
|
||
struct Header {
|
||
precision: u8,
|
||
height: usize,
|
||
width: usize,
|
||
comps: Vec<u8>,
|
||
sampling: Vec<u8>,
|
||
tables: [Option<Huffman>; 4],
|
||
table_for: Vec<usize>,
|
||
predictor: u8,
|
||
pt: u8,
|
||
restart: usize,
|
||
scan_start: usize,
|
||
}
|
||
|
||
fn be16(d: &[u8], i: usize) -> Result<usize, RawError> {
|
||
d.get(i..i + 2).map(|s| u16::from_be_bytes([s[0], s[1]]) as usize).ok_or_else(|| err("truncated header"))
|
||
}
|
||
|
||
fn parse_header(d: &[u8]) -> Result<Header, RawError> {
|
||
if d.len() < 4 || d[0] != 0xff || d[1] != 0xd8 {
|
||
return Err(err("missing SOI"));
|
||
}
|
||
let mut h = Header {
|
||
precision: 0,
|
||
height: 0,
|
||
width: 0,
|
||
comps: vec![],
|
||
sampling: vec![],
|
||
tables: [None, None, None, None],
|
||
table_for: vec![],
|
||
predictor: 1,
|
||
pt: 0,
|
||
restart: 0,
|
||
scan_start: 0,
|
||
};
|
||
let mut i = 2;
|
||
let mut have_sof = false;
|
||
loop {
|
||
// skip fill bytes / stray data up to the next marker
|
||
while i < d.len() && d[i] != 0xff {
|
||
i += 1;
|
||
}
|
||
while i < d.len() && d[i] == 0xff {
|
||
i += 1;
|
||
}
|
||
let Some(&m) = d.get(i) else { return Err(err("no scan")) };
|
||
i += 1;
|
||
if m == 0xd8 || (0xd0..=0xd7).contains(&m) {
|
||
continue;
|
||
}
|
||
if m == 0xd9 {
|
||
return Err(err("EOI before scan"));
|
||
}
|
||
let len = be16(d, i)?;
|
||
if len < 2 || i + len > d.len() {
|
||
return Err(err("truncated segment"));
|
||
}
|
||
let seg = &d[i + 2..i + len];
|
||
match m {
|
||
0xc3 => {
|
||
if seg.len() < 6 {
|
||
return Err(err("short SOF3"));
|
||
}
|
||
h.precision = seg[0];
|
||
h.height = u16::from_be_bytes([seg[1], seg[2]]) as usize;
|
||
h.width = u16::from_be_bytes([seg[3], seg[4]]) as usize;
|
||
let n = seg[5] as usize;
|
||
if n == 0 || n > 4 || seg.len() < 6 + 3 * n {
|
||
return Err(err("bad component count"));
|
||
}
|
||
for c in 0..n {
|
||
let (id, samp) = (seg[6 + 3 * c], seg[7 + 3 * c]);
|
||
if !(1..=4).contains(&(samp >> 4)) || !(1..=4).contains(&(samp & 15)) {
|
||
return Err(err("invalid sampling factors"));
|
||
}
|
||
h.comps.push(id);
|
||
h.sampling.push(samp);
|
||
}
|
||
if !(2..=16).contains(&h.precision) {
|
||
return Err(err("bad precision"));
|
||
}
|
||
have_sof = true;
|
||
}
|
||
0xc0..=0xc2 | 0xc5..=0xc7 | 0xc9..=0xcb | 0xcd..=0xcf => {
|
||
return Err(RawError::Unsupported(format!("JPEG process SOF{:X} (not lossless Huffman)", m - 0xc0)));
|
||
}
|
||
0xc4 => {
|
||
let mut j = 0;
|
||
while j + 17 <= seg.len() {
|
||
let (class, id) = (seg[j] >> 4, (seg[j] & 15) as usize);
|
||
let mut counts = [0u8; 16];
|
||
counts.copy_from_slice(&seg[j + 1..j + 17]);
|
||
let n: usize = counts.iter().map(|&c| c as usize).sum();
|
||
let vals = seg.get(j + 17..j + 17 + n).ok_or_else(|| err("truncated DHT"))?;
|
||
if class == 0 && id < 4 {
|
||
h.tables[id] = Some(Huffman::new(&counts, vals)?);
|
||
}
|
||
j += 17 + n;
|
||
}
|
||
}
|
||
0xdd => h.restart = be16(seg, 0)?,
|
||
0xda => {
|
||
if !have_sof {
|
||
return Err(err("SOS before SOF3"));
|
||
}
|
||
let ns = *seg.first().ok_or_else(|| err("short SOS"))? as usize;
|
||
if ns != h.comps.len() || seg.len() < 1 + 2 * ns + 3 {
|
||
return Err(RawError::Unsupported("lossless JPEG with multiple scans".into()));
|
||
}
|
||
for c in 0..ns {
|
||
let cid = seg[1 + 2 * c];
|
||
let pos = h.comps.iter().position(|&x| x == cid).ok_or_else(|| err("unknown scan component"))?;
|
||
if pos != c {
|
||
return Err(err("scan component order"));
|
||
}
|
||
let td = (seg[2 + 2 * c] >> 4) as usize;
|
||
if td > 3 || h.tables[td].is_none() {
|
||
return Err(err("missing Huffman table"));
|
||
}
|
||
h.table_for.push(td);
|
||
}
|
||
h.predictor = seg[1 + 2 * ns];
|
||
h.pt = seg[3 + 2 * ns] & 15;
|
||
if h.predictor > 8 {
|
||
return Err(RawError::Unsupported(format!(
|
||
"lossless JPEG scan with predictor selection value {} (T.81 defines 0 to 7, Hasselblad uses 8)",
|
||
h.predictor
|
||
)));
|
||
}
|
||
if h.pt >= h.precision {
|
||
return Err(err("bad point transform"));
|
||
}
|
||
h.scan_start = i + len;
|
||
return Ok(h);
|
||
}
|
||
_ => {}
|
||
}
|
||
i += len;
|
||
}
|
||
}
|
||
|
||
/// Parse only the frame header: (width, height, components, precision).
|
||
pub fn frame_info(d: &[u8]) -> Result<(usize, usize, usize, u8), RawError> {
|
||
let h = parse_header(d)?;
|
||
check_full_resolution(&h)?;
|
||
if h.predictor == 8 {
|
||
check_hasselblad(&h)?;
|
||
}
|
||
Ok((h.width, h.height, h.comps.len(), h.precision))
|
||
}
|
||
|
||
fn check_full_resolution(h: &Header) -> Result<(), RawError> {
|
||
if h.sampling.iter().any(|&s| s != 0x11) {
|
||
return Err(RawError::Unsupported("lossless JPEG with subsampled components".into()));
|
||
}
|
||
Ok(())
|
||
}
|
||
|
||
/// The layout of every Hasselblad selection-value-8 scan measured; other layouts are not known to follow the rule.
|
||
fn check_hasselblad(h: &Header) -> Result<(), RawError> {
|
||
if h.comps.len() != 1 || h.precision != 16 || h.pt != 0 || h.restart != 0 || h.width == 0 || !h.width.is_multiple_of(2) {
|
||
return Err(RawError::Unsupported(format!(
|
||
"lossless JPEG with selection value 8 and {} components, {} bits, point transform {}, restart interval {}, width {}",
|
||
h.comps.len(),
|
||
h.precision,
|
||
h.pt,
|
||
h.restart,
|
||
h.width
|
||
)));
|
||
}
|
||
Ok(())
|
||
}
|
||
|
||
/// Bits of Hasselblad's entropy data: 32-bit little-endian words, each read from its most significant bit, with
|
||
/// no byte stuffing (every byte is data; `FF` bytes are not markers).
|
||
struct WordBits<'a> {
|
||
data: &'a [u8],
|
||
pos: usize,
|
||
buf: u64,
|
||
bits: u32,
|
||
/// Zero bits fed past the last whole word (consumption reached them once `overrun > bits`).
|
||
overrun: u32,
|
||
}
|
||
|
||
impl<'a> WordBits<'a> {
|
||
fn new(data: &'a [u8]) -> Self {
|
||
Self { data, pos: 0, buf: 0, bits: 0, overrun: 0 }
|
||
}
|
||
|
||
#[inline]
|
||
fn fill(&mut self) {
|
||
while self.bits <= 32 {
|
||
let word = match self.data.get(self.pos..self.pos + 4) {
|
||
Some(w) => {
|
||
self.pos += 4;
|
||
u32::from_le_bytes([w[0], w[1], w[2], w[3]])
|
||
}
|
||
None => {
|
||
self.overrun = self.overrun.saturating_add(32);
|
||
0
|
||
}
|
||
};
|
||
self.buf |= (word as u64) << (32 - self.bits);
|
||
self.bits += 32;
|
||
}
|
||
}
|
||
}
|
||
|
||
impl Bits for WordBits<'_> {
|
||
#[inline]
|
||
fn peek(&mut self, n: u32) -> u32 {
|
||
if self.bits < n {
|
||
self.fill();
|
||
}
|
||
(self.buf >> (64 - n)) as u32
|
||
}
|
||
#[inline]
|
||
fn consume(&mut self, n: u32) {
|
||
self.buf <<= n;
|
||
self.bits -= n;
|
||
}
|
||
}
|
||
|
||
/// Hasselblad's lossless JPEG with selection value 8 (3FR and FFF raws).
|
||
///
|
||
/// The rule was established by measurement on 14 sample files with the `ljpeg-explorer` tool, which tested it
|
||
/// against alternative bit orders, stuffing, sample groupings, category-16 treatments and predictors:
|
||
/// - the entropy data are 32-bit little-endian words, each read from its most significant bit, without byte
|
||
/// stuffing;
|
||
/// - each row is coded in pairs of samples: both Huffman categories (`SSSS`, T.81 table) come first, then both
|
||
/// differences;
|
||
/// - a difference has `SSSS` extra bits, extended as in T.81 Table H.2; after `SSSS = 16` come sixteen bits that
|
||
/// take no part, and the difference is -32768 (equal to T.81's +32768 modulo 2^16);
|
||
/// - a sample is the previous sample of the same column parity in its row plus the difference, modulo 2^16; before
|
||
/// the first pair of every row both are 32768 (half the 16-bit range).
|
||
///
|
||
/// Provenance: the first hypothesis for this rule was recalled by the AI model that wrote this code from its training
|
||
/// data, which includes other raw converters; it was treated as one candidate, corrected where the files disagreed
|
||
/// (the byte order of the words) and confirmed by an exhaustive black-box search over 17,280 layout hypotheses on the
|
||
/// CC0 sample files. No other converter's source was consulted, and the code is original.
|
||
pub fn decode_hasselblad(d: &[u8], max_samples: usize) -> Result<Frame, RawError> {
|
||
let h = parse_header(d)?;
|
||
if h.predictor != 8 {
|
||
return Err(err("not a selection value 8 scan"));
|
||
}
|
||
hasselblad_frame(d, &h, max_samples)
|
||
}
|
||
|
||
fn hasselblad_frame(d: &[u8], h: &Header, max_samples: usize) -> Result<Frame, RawError> {
|
||
check_hasselblad(h)?;
|
||
let (w, ht) = (h.width, h.height);
|
||
let total = w.checked_mul(ht).ok_or_else(|| err("frame too large"))?;
|
||
if total > max_samples {
|
||
return Err(RawError::Limit("lossless JPEG frame larger than expected"));
|
||
}
|
||
let entropy = &d[h.scan_start..];
|
||
if (entropy.len() as u64 + 64) * 8 < total as u64 {
|
||
return Err(err("entropy data too short for frame"));
|
||
}
|
||
let table =
|
||
h.table_for.first().and_then(|&t| h.tables.get(t)).and_then(Option::as_ref).ok_or_else(|| err("scan uses an undefined Huffman table"))?;
|
||
let mut out = vec![0u16; total];
|
||
let mut br = WordBits::new(entropy);
|
||
let start = 1u32 << (h.precision - 1);
|
||
for row in out.chunks_exact_mut(w) {
|
||
let mut last = [start, start];
|
||
// the width is even (checked), so every sample is in a pair
|
||
for pair in row.as_chunks_mut::<2>().0 {
|
||
let ssss = [table.decode(&mut br)?, table.decode(&mut br)?];
|
||
for (k, s) in ssss.into_iter().enumerate() {
|
||
let diff = match s {
|
||
0..=15 => diff_value(&mut br, s),
|
||
16 => {
|
||
br.get(16);
|
||
-32768
|
||
}
|
||
_ => return Err(err("invalid difference category")),
|
||
};
|
||
let v = (last[k] as i32 + diff) as u32 & 0xffff;
|
||
last[k] = v;
|
||
pair[k] = v as u16;
|
||
}
|
||
}
|
||
// bits consumed beyond the last whole word
|
||
if br.overrun > br.bits {
|
||
return Err(err("entropy data exhausted"));
|
||
}
|
||
}
|
||
Ok(Frame { width: w, height: ht, components: 1, precision: h.precision, predictor: 8, point_transform: 0, data: out })
|
||
}
|
||
|
||
fn check_subsampled(h: &Header) -> Result<usize, RawError> {
|
||
let vertical = match h.sampling.as_slice() {
|
||
[0x22, 0x11, 0x11] => 2,
|
||
[0x21, 0x11, 0x11] => 1,
|
||
_ => return Err(RawError::Unsupported("lossless JPEG subsampling layout".into())),
|
||
};
|
||
if h.predictor != 1 || h.restart != 0 {
|
||
return Err(RawError::Unsupported("lossless JPEG subsampled predictor / restarts".into()));
|
||
}
|
||
if h.width == 0 || h.height == 0 || !h.width.is_multiple_of(2) || !h.height.is_multiple_of(vertical) {
|
||
return Err(err("subsampled frame dimensions do not match MCU size"));
|
||
}
|
||
Ok(vertical)
|
||
}
|
||
|
||
/// Sony M/S tiles and Canon sRAW / mRAW: horizontal prediction, no restart markers. Keep subsampled planes
|
||
/// separate; expanding them into a mosaic would silently corrupt the existing CFA callers.
|
||
/// Returns (width, height, vertical subsampling of the chroma planes).
|
||
pub fn frame_info_subsampled(d: &[u8]) -> Result<(usize, usize, usize), RawError> {
|
||
let h = parse_header(d)?;
|
||
let vertical = check_subsampled(&h)?;
|
||
Ok((h.width, h.height, vertical))
|
||
}
|
||
|
||
/// How the first-column prediction and the running predictor of a subsampled frame are chosen.
|
||
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
|
||
pub enum Prediction {
|
||
/// Sony: the left neighbour in the plane; at the first column the sample above, except that a top luma
|
||
/// row of an MCU row reads the previous MCU row's top luma sample.
|
||
Geometric,
|
||
/// Canon: every component is its own one-dimensional chain in decoding order (the previous sample of the
|
||
/// same component, so the second luma row of a 4:2:0 MCU continues from the end of the first); the first
|
||
/// sample of each MCU row starts from the first sample of the previous MCU row.
|
||
Sequential,
|
||
}
|
||
|
||
pub struct FrameSubsampled {
|
||
pub width: usize,
|
||
pub height: usize,
|
||
pub vertical_subsampling: usize,
|
||
/// Y at full resolution; Cb and Cr at half width, with 1× or 2× vertical subsampling.
|
||
pub planes: [Vec<u16>; 3],
|
||
}
|
||
|
||
/// The 4:2:0 / 4:2:2 LJ92 variants of Sony (M/S ARW) and Canon (sRAW / mRAW): T.81 MCU ordering and differences,
|
||
/// modulo 2^16. [`Prediction`] selects the predictor each maker uses.
|
||
///
|
||
/// Sony: at the first column, the top luma row predicts from the previous MCU row's top
|
||
/// sample (two image rows above), and the bottom row from the current top sample.
|
||
/// Observed black-box: using the immediately preceding image row introduces tile seams.
|
||
pub fn decode_subsampled(d: &[u8], max_samples: usize, prediction: Prediction) -> Result<FrameSubsampled, RawError> {
|
||
let h = parse_header(d)?;
|
||
let vertical = check_subsampled(&h)?;
|
||
let pixels = h.width.checked_mul(h.height).ok_or_else(|| err("frame too large"))?;
|
||
let chroma = pixels / (2 * vertical);
|
||
let total = pixels.checked_add(chroma.checked_mul(2).ok_or_else(|| err("frame too large"))?).ok_or_else(|| err("frame too large"))?;
|
||
if total > max_samples {
|
||
return Err(RawError::Limit("lossless JPEG frame larger than expected"));
|
||
}
|
||
let entropy = &d[h.scan_start..];
|
||
if (entropy.len() as u64 + 64) * 8 < total as u64 {
|
||
return Err(err("entropy data too short for frame"));
|
||
}
|
||
let tables: Vec<&Huffman> = h
|
||
.table_for
|
||
.iter()
|
||
.map(|&t| h.tables.get(t).and_then(Option::as_ref).ok_or_else(|| err("missing Huffman table")))
|
||
.collect::<Result<_, _>>()?;
|
||
let mut planes = [vec![0u16; pixels], vec![0u16; chroma], vec![0u16; chroma]];
|
||
let mut br = BitReader::new(entropy);
|
||
let init = 1i32 << (h.precision - h.pt - 1);
|
||
// Sequential prediction: the last sample of each component, and the first sample of its previous MCU row
|
||
let mut last = [init; 3];
|
||
let mut row_first = [init; 3];
|
||
for my in 0..h.height / vertical {
|
||
for mx in 0..h.width / 2 {
|
||
for (c, plane) in planes.iter_mut().enumerate() {
|
||
let horizontal_factor = if c == 0 { 2 } else { 1 };
|
||
let vertical_factor = if c == 0 { vertical } else { 1 };
|
||
let width = h.width * horizontal_factor / 2;
|
||
for dy in 0..vertical_factor {
|
||
for dx in 0..horizontal_factor {
|
||
let (x, y) = (mx * horizontal_factor + dx, my * vertical_factor + dy);
|
||
let i = y * width + x;
|
||
let pred = match prediction {
|
||
Prediction::Geometric if x > 0 => plane[i - 1] as i32,
|
||
Prediction::Geometric if c == 0 && dy == 0 && y >= vertical => plane[i - vertical * width] as i32,
|
||
Prediction::Geometric if y > 0 => plane[i - width] as i32,
|
||
Prediction::Geometric => init,
|
||
Prediction::Sequential if mx == 0 && dx == 0 && dy == 0 => row_first[c],
|
||
Prediction::Sequential => last[c],
|
||
};
|
||
let value = ((pred + tables[c].decode_diff(&mut br, true)?) & 0xffff) as u16;
|
||
plane[i] = value;
|
||
last[c] = i32::from(value);
|
||
if mx == 0 && dx == 0 && dy == 0 {
|
||
row_first[c] = i32::from(value);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
}
|
||
if br.overrun > br.bits {
|
||
return Err(err("entropy data exhausted"));
|
||
}
|
||
}
|
||
if h.pt > 0 {
|
||
for plane in &mut planes {
|
||
for v in plane {
|
||
*v <<= h.pt;
|
||
}
|
||
}
|
||
}
|
||
Ok(FrameSubsampled { width: h.width, height: h.height, vertical_subsampling: vertical, planes })
|
||
}
|
||
|
||
/// T.81 Table H.1 predictor `pred` (1..=7; 0 = none) from the left, above and above-left neighbours.
|
||
#[inline(always)]
|
||
fn predict(pred: u8, ra: i32, rb: i32, rc: i32) -> i32 {
|
||
match pred {
|
||
0 => 0,
|
||
1 => ra,
|
||
2 => rb,
|
||
3 => rc,
|
||
4 => ra + rb - rc,
|
||
5 => ra + ((rb - rc) >> 1),
|
||
6 => rb + ((ra - rc) >> 1),
|
||
_ => (ra + rb) >> 1,
|
||
}
|
||
}
|
||
|
||
/// Decode the pixels `x0..x1` (`x0 >= 1`) of one row with the fixed predictor `P`. `prev` is empty on the first
|
||
/// line, which only predicts from the left (`P = 1`).
|
||
#[inline(always)]
|
||
fn decode_run<const P: u8>(
|
||
tables: &[&Huffman],
|
||
br: &mut BitReader<'_>,
|
||
cur: &mut [u16],
|
||
prev: &[u16],
|
||
nc: usize,
|
||
x0: usize,
|
||
x1: usize,
|
||
) -> Result<(), RawError> {
|
||
for x in x0..x1 {
|
||
for (c, table) in tables.iter().enumerate() {
|
||
let i = x * nc + c;
|
||
let ra = cur[i - nc] as i32;
|
||
let p = if P <= 1 { predict(P, ra, 0, 0) } else { predict(P, ra, prev[i] as i32, prev[i - nc] as i32) };
|
||
cur[i] = ((p + table.decode_diff(br, false)?) & 0xffff) as u16;
|
||
}
|
||
}
|
||
Ok(())
|
||
}
|
||
|
||
/// Decode a lossless JPEG stream. `max_samples` bounds the allocation (hostile headers).
|
||
pub fn decode(d: &[u8], max_samples: usize) -> Result<Frame, RawError> {
|
||
let h = parse_header(d)?;
|
||
check_full_resolution(&h)?;
|
||
if h.predictor == 8 {
|
||
return hasselblad_frame(d, &h, max_samples);
|
||
}
|
||
let (w, ht, nc) = (h.width, h.height, h.comps.len());
|
||
if w == 0 || ht == 0 {
|
||
return Err(err("zero frame size"));
|
||
}
|
||
let total = w.checked_mul(ht).and_then(|v| v.checked_mul(nc)).ok_or_else(|| err("frame too large"))?;
|
||
if total > max_samples {
|
||
return Err(RawError::Limit("lossless JPEG frame larger than expected"));
|
||
}
|
||
// The entropy data must hold at least ~1 bit per sample; reject absurd headers early.
|
||
let entropy = &d[h.scan_start..];
|
||
if (entropy.len() as u64 + 64) * 8 < total as u64 {
|
||
return Err(err("entropy data too short for frame"));
|
||
}
|
||
let tables: Vec<&Huffman> = h
|
||
.table_for
|
||
.iter()
|
||
.map(|&t| h.tables.get(t).and_then(Option::as_ref).ok_or_else(|| err("scan uses an undefined Huffman table")))
|
||
.collect::<Result<_, RawError>>()?;
|
||
let mut out = vec![0u16; total];
|
||
let mut br = BitReader::new(entropy);
|
||
let init = 1i32 << (h.precision - h.pt - 1);
|
||
let mask = 0xffffi32;
|
||
let row_len = w * nc;
|
||
let pred = h.predictor;
|
||
let mut restart_left = h.restart;
|
||
let mut first_line = true; // first line of image or restart interval
|
||
let mut reset_pending = true;
|
||
for y in 0..ht {
|
||
let (prev_rows, cur_rows) = out.split_at_mut(y * row_len);
|
||
let cur = &mut cur_rows[..row_len];
|
||
let prev = if y > 0 { &prev_rows[(y - 1) * row_len..] } else { &[][..] };
|
||
let mut x = 0;
|
||
while x < w {
|
||
if h.restart > 0 && restart_left == 0 {
|
||
if !br.restart() {
|
||
return Err(err("missing restart marker"));
|
||
}
|
||
restart_left = h.restart;
|
||
first_line = true;
|
||
reset_pending = true;
|
||
}
|
||
// pixels up to the next restart marker or the end of the row
|
||
let mut end = w;
|
||
if h.restart > 0 {
|
||
end = w.min(x + restart_left);
|
||
restart_left -= end - x;
|
||
}
|
||
// the first pixel of the run has the special predictions (start of the interval, first column)
|
||
#[allow(clippy::needless_range_loop)] // `c` indexes the tables and the sample position alike
|
||
for c in 0..nc {
|
||
let i = x * nc + c;
|
||
let p = if reset_pending {
|
||
init
|
||
} else if first_line {
|
||
if x == 0 { prev.get(i).map_or(init, |&v| v as i32) } else { cur[i - nc] as i32 }
|
||
} else if x == 0 || pred == 0 {
|
||
if pred == 0 { 0 } else { prev[i] as i32 }
|
||
} else {
|
||
predict(pred, cur[i - nc] as i32, prev[i] as i32, prev[i - nc] as i32)
|
||
};
|
||
cur[i] = ((p + tables[c].decode_diff(&mut br, false)?) & mask) as u16;
|
||
}
|
||
reset_pending = false;
|
||
// the rest of the run: the predictor is fixed, so it is chosen once here, not per sample
|
||
if first_line {
|
||
// the first line of an interval predicts from the left neighbour
|
||
decode_run::<1>(&tables, &mut br, cur, prev, nc, x + 1, end)?;
|
||
} else {
|
||
match pred {
|
||
0 => decode_run::<0>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
1 => decode_run::<1>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
2 => decode_run::<2>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
3 => decode_run::<3>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
4 => decode_run::<4>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
5 => decode_run::<5>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
6 => decode_run::<6>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
_ => decode_run::<7>(&tables, &mut br, cur, prev, nc, x + 1, end)?,
|
||
}
|
||
}
|
||
x = end;
|
||
}
|
||
first_line = false;
|
||
if br.overrun > 64 * 8 {
|
||
return Err(err("entropy data exhausted"));
|
||
}
|
||
}
|
||
if h.pt > 0 {
|
||
for v in &mut out {
|
||
*v <<= h.pt;
|
||
}
|
||
}
|
||
Ok(Frame { width: w, height: ht, components: nc, precision: h.precision, predictor: pred, point_transform: h.pt, data: out })
|
||
}
|
||
|
||
// ------------------------------------------------------------------------------------------------ encoder
|
||
|
||
/// Build Huffman code lengths from frequencies (T.81 Annex K.2, Figures K.1–K.3), limited to 16 bits.
|
||
fn code_lengths(freq_in: &[u32; 17]) -> ([u8; 16], Vec<u8>) {
|
||
let mut freq = [0i64; 18];
|
||
for (i, &f) in freq_in.iter().enumerate() {
|
||
freq[i] = f as i64;
|
||
}
|
||
freq[17] = 1; // reserved symbol so no code is all ones
|
||
let mut codesize = [0usize; 18];
|
||
let mut others = [-1i32; 18];
|
||
loop {
|
||
// V1: least frequency > 0 (largest index on ties), V2: next least
|
||
let mut v1 = -1i32;
|
||
let mut v2 = -1i32;
|
||
for i in 0..18 {
|
||
if freq[i] > 0 && (v1 < 0 || freq[i] <= freq[v1 as usize]) {
|
||
v1 = i as i32;
|
||
}
|
||
}
|
||
for i in 0..18 {
|
||
if freq[i] > 0 && i as i32 != v1 && (v2 < 0 || freq[i] <= freq[v2 as usize]) {
|
||
v2 = i as i32;
|
||
}
|
||
}
|
||
if v2 < 0 {
|
||
break;
|
||
}
|
||
let (a, b) = (v1 as usize, v2 as usize);
|
||
freq[a] += freq[b];
|
||
freq[b] = 0;
|
||
let mut x = a;
|
||
codesize[x] += 1;
|
||
while others[x] >= 0 {
|
||
x = others[x] as usize;
|
||
codesize[x] += 1;
|
||
}
|
||
others[x] = b as i32;
|
||
let mut x = b;
|
||
codesize[x] += 1;
|
||
while others[x] >= 0 {
|
||
x = others[x] as usize;
|
||
codesize[x] += 1;
|
||
}
|
||
}
|
||
let mut bits = [0i32; 33];
|
||
for &cs in &codesize {
|
||
if cs > 0 {
|
||
bits[cs.min(32)] += 1;
|
||
}
|
||
}
|
||
// Adjust_BITS (Figure K.3)
|
||
let mut i = 32;
|
||
while i > 16 {
|
||
while bits[i] > 0 {
|
||
let mut j = i - 2;
|
||
while bits[j] == 0 {
|
||
j -= 1;
|
||
}
|
||
bits[i] -= 2;
|
||
bits[i - 1] += 1;
|
||
bits[j + 1] += 2;
|
||
bits[j] -= 1;
|
||
}
|
||
i -= 1;
|
||
}
|
||
while bits[i] == 0 {
|
||
i -= 1;
|
||
}
|
||
bits[i] -= 1; // remove the reserved code
|
||
let mut counts = [0u8; 16];
|
||
for l in 1..=16 {
|
||
counts[l - 1] = bits[l] as u8;
|
||
}
|
||
// Sort_input (Figure K.4): symbols by code size
|
||
let mut values = Vec::new();
|
||
for l in 1..=32 {
|
||
for (s, &cs) in codesize.iter().enumerate().take(17) {
|
||
if cs == l {
|
||
values.push(s as u8);
|
||
}
|
||
}
|
||
}
|
||
(counts, values)
|
||
}
|
||
|
||
/// Canonical codes for a table: symbol → (code, length).
|
||
fn canonical_codes(counts: &[u8; 16], values: &[u8]) -> [(u32, u8); 17] {
|
||
let mut table = [(0u32, 0u8); 17];
|
||
let mut code = 0u32;
|
||
let mut k = 0;
|
||
for len in 1..=16u8 {
|
||
for _ in 0..counts[len as usize - 1] {
|
||
if let Some(&s) = values.get(k)
|
||
&& (s as usize) < 17
|
||
{
|
||
table[s as usize] = (code, len);
|
||
}
|
||
code += 1;
|
||
k += 1;
|
||
}
|
||
code <<= 1;
|
||
}
|
||
table
|
||
}
|
||
|
||
struct BitWriter {
|
||
out: Vec<u8>,
|
||
acc: u64,
|
||
n: u32,
|
||
}
|
||
|
||
impl BitWriter {
|
||
fn put(&mut self, v: u32, bits: u32) {
|
||
if bits == 0 {
|
||
return;
|
||
}
|
||
self.acc = (self.acc << bits) | (v as u64 & ((1u64 << bits) - 1));
|
||
self.n += bits;
|
||
while self.n >= 8 {
|
||
let b = (self.acc >> (self.n - 8)) as u8;
|
||
self.out.push(b);
|
||
if b == 0xff {
|
||
self.out.push(0);
|
||
}
|
||
self.n -= 8;
|
||
}
|
||
}
|
||
fn flush(&mut self) {
|
||
if self.n > 0 {
|
||
let pad = 8 - self.n;
|
||
self.put((1 << pad) - 1, pad);
|
||
}
|
||
}
|
||
}
|
||
|
||
fn ssss_of(diff: i32) -> u8 {
|
||
if diff == 0 {
|
||
0
|
||
} else if diff == 32768 || diff == -32768 {
|
||
16
|
||
} else {
|
||
32 - (diff.unsigned_abs()).leading_zeros() as u8
|
||
}
|
||
}
|
||
|
||
/// Encode samples (`width × height × components`, interleaved) as a lossless JPEG with `predictor` (1–7) and
|
||
/// `precision` bits. `restart` > 0 inserts restart markers every `restart` MCUs (pixels).
|
||
pub fn encode(data: &[u16], width: usize, height: usize, components: usize, precision: u8, predictor: u8, restart: usize) -> Vec<u8> {
|
||
assert!((1..=4).contains(&components) && (2..=16).contains(&precision) && (1..=7).contains(&predictor));
|
||
assert_eq!(data.len(), width * height * components);
|
||
let init = 1i32 << (precision - 1);
|
||
let row_len = width * components;
|
||
// compute differences in the same order as the decoder
|
||
let mut diffs = vec![0i32; data.len()];
|
||
let mut restart_left = restart;
|
||
let mut first_line = true;
|
||
let mut reset_pending = true;
|
||
let mut marks = Vec::new(); // sample index where an RST marker precedes
|
||
for y in 0..height {
|
||
for x in 0..width {
|
||
if restart > 0 {
|
||
if restart_left == 0 {
|
||
marks.push((y * width + x) * components);
|
||
restart_left = restart;
|
||
first_line = true;
|
||
reset_pending = true;
|
||
}
|
||
restart_left -= 1;
|
||
}
|
||
for c in 0..components {
|
||
let i = y * row_len + x * components + c;
|
||
let p = if reset_pending {
|
||
init
|
||
} else if first_line {
|
||
if x == 0 { data[i - row_len] as i32 } else { data[i - components] as i32 }
|
||
} else if x == 0 {
|
||
data[i - row_len] as i32
|
||
} else {
|
||
let ra = data[i - components] as i32;
|
||
let rb = data[i - row_len] as i32;
|
||
let rc = data[i - row_len - components] as i32;
|
||
match predictor {
|
||
1 => ra,
|
||
2 => rb,
|
||
3 => rc,
|
||
4 => ra + rb - rc,
|
||
5 => ra + ((rb - rc) >> 1),
|
||
6 => rb + ((ra - rc) >> 1),
|
||
_ => (ra + rb) >> 1,
|
||
}
|
||
};
|
||
// modulo 2^16 difference mapped into [-32767, 32768]
|
||
let mut d = (data[i] as i32 - p) & 0xffff;
|
||
if d > 32768 {
|
||
d -= 65536;
|
||
}
|
||
diffs[i] = d;
|
||
}
|
||
reset_pending = false;
|
||
}
|
||
first_line = false;
|
||
}
|
||
let mut tables = Vec::new();
|
||
for c in 0..components {
|
||
let mut freq = [0u32; 17];
|
||
for d in diffs.iter().skip(c).step_by(components) {
|
||
freq[ssss_of(*d) as usize] += 1;
|
||
}
|
||
let (counts, values) = code_lengths(&freq);
|
||
tables.push((counts, values));
|
||
}
|
||
let mut out = vec![0xff, 0xd8];
|
||
// SOF3
|
||
out.extend_from_slice(&[0xff, 0xc3]);
|
||
out.extend_from_slice(&((8 + 3 * components) as u16).to_be_bytes());
|
||
out.push(precision);
|
||
out.extend_from_slice(&(height as u16).to_be_bytes());
|
||
out.extend_from_slice(&(width as u16).to_be_bytes());
|
||
out.push(components as u8);
|
||
for c in 0..components {
|
||
out.extend_from_slice(&[c as u8 + 1, 0x11, 0]);
|
||
}
|
||
// DHT
|
||
for (c, (counts, values)) in tables.iter().enumerate() {
|
||
out.extend_from_slice(&[0xff, 0xc4]);
|
||
out.extend_from_slice(&((2 + 17 + values.len()) as u16).to_be_bytes());
|
||
out.push(c as u8);
|
||
out.extend_from_slice(counts);
|
||
out.extend_from_slice(values);
|
||
}
|
||
if restart > 0 {
|
||
out.extend_from_slice(&[0xff, 0xdd, 0, 4]);
|
||
out.extend_from_slice(&(restart as u16).to_be_bytes());
|
||
}
|
||
// SOS
|
||
out.extend_from_slice(&[0xff, 0xda]);
|
||
out.extend_from_slice(&((6 + 2 * components) as u16).to_be_bytes());
|
||
out.push(components as u8);
|
||
for c in 0..components {
|
||
out.extend_from_slice(&[c as u8 + 1, (c as u8) << 4]);
|
||
}
|
||
out.extend_from_slice(&[predictor, 0, 0]);
|
||
let codes: Vec<[(u32, u8); 17]> = tables.iter().map(|(c, v)| canonical_codes(c, v)).collect();
|
||
let mut bw = BitWriter { out, acc: 0, n: 0 };
|
||
let mut mark_iter = marks.iter().peekable();
|
||
let mut rst = 0u8;
|
||
for (i, &d) in diffs.iter().enumerate() {
|
||
if mark_iter.peek().is_some_and(|&&m| m == i) {
|
||
mark_iter.next();
|
||
bw.flush();
|
||
bw.out.extend_from_slice(&[0xff, 0xd0 + rst]);
|
||
rst = (rst + 1) & 7;
|
||
bw.acc = 0;
|
||
}
|
||
let c = i % components;
|
||
let s = ssss_of(d);
|
||
let (code, len) = codes[c][s as usize];
|
||
bw.put(code, len as u32);
|
||
if s > 0 && s < 16 {
|
||
let v = if d < 0 { d - 1 } else { d };
|
||
bw.put(v as u32 & ((1 << s) - 1), s as u32);
|
||
}
|
||
}
|
||
bw.flush();
|
||
let mut out = bw.out;
|
||
out.extend_from_slice(&[0xff, 0xd9]);
|
||
out
|
||
}
|
||
|
||
#[cfg(test)]
|
||
pub(crate) mod tests;
|