// Copyright (c) the JPEG XL Project Authors. All rights reserved. // // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file.
use std::collections::BTreeSet; use std::sync::Arc;
fn upsample_lf_group(
group: usize,
pixels: &mut [Image<f32>; 3],
lf_image: &[Image<f32>; 3],
header: &FrameHeader,
factors: &CustomTransformData,
) -> Result<()> { let group_dim = header.group_dim(); let lf_group_dim = group_dim / 8; let (width_groups, _) = header.size_groups(); let gx = group % width_groups; let gy = group / width_groups;
let upsample = Upsample8x::new(factors, 0); letmut state = upsample.init_local_state(0)?.unwrap();
let max_width = pixels.iter().map(|x| x.size().0).max().unwrap();
// Temporary buffer for 8 output rows // We reuse this buffer for each iteration to minimize allocation letmut temp_out_buf: [_; 8] = std::array::from_fn(|_| vec![0.0f32; max_width + 128]);
// Copy back to out_img let base_y = y * 8; for (i, buf) in temp_out_buf.iter().enumerate() { let out_y = base_y + i; if out_y < out_height {
out_img.row_mut(out_y)[..out_width].copy_from_slice(&buf[..out_width]);
}
}
}
}
Ok(())
}
let reference_frame_data = if frame_header.can_be_referenced { let image_size = &decoder_state.file_header.size; let image_size = (image_size.xsize() as usize, image_size.ysize() as usize); let sz = if frame_header.save_before_ct {
frame_header.size_upsampled()
} else {
image_size
};
self.header.frame_type == FrameType::RegularFrame
|| (self.header.frame_type == FrameType::LFFrame
&& self.header.lf_level == 1 // TODO(veluca): this should probably be "there is no alpha".
&& self.header.num_extra_channels == 0)
}
/// Given a bit reader pointing at the end of the TOC, returns a vector of `BitReader`s, each /// of which reads a specific section. pubfn sections<'a>(&self, br: &'a mut BitReader) -> Result<Vec<BitReader<'a>>> {
debug!(toc = ?self.toc); let ret = self
.toc
.entries
.iter()
.scan(br, |br, count| Some(br.split_at(*count as usize)))
.collect::<Result<Vec<_>>>()?; if !self.toc.permuted { return Ok(ret);
} letmut inv_perm = vec![0; ret.len()]; for (i, pos) inself.toc.permutation.iter().enumerate() {
inv_perm[*pos as usize] = i;
} letmut shuffled_ret = ret.clone(); for (br, pos) in ret.into_iter().zip(inv_perm) {
shuffled_ret[pos] = br;
}
Ok(shuffled_ret)
}
let color_correlation_params = ifself.header.encoding == Encoding::VarDCT {
info!("decoding color correlation params"); let ccp = ColorCorrelationParams::read(br)?;
*self.color_correlation_params.borrow_mut() = ccp;
Some(ccp)
} else {
None
};
debug!(?color_correlation_params);
let tree = if br.read(1)? == 1 { let size_limit = (1024
+ self.header.width as usize
* self.header.height as usize
* (self.color_channels + self.decoder_state.extra_channel_info().len())
/ 16)
.min(1 << 22);
Some(Tree::read(br, size_limit)?)
} else {
None
};
let modular_global = FullModularImage::read(
&self.header,
&self.decoder_state.file_header.image_metadata, self.modular_color_channels(),
br,
)?;
// Ensure that, if we call this function again, we resume from just after // reading modular global data (excluding section 0 channels). let total_bits_read = br.total_bits_read();
lf_global.modular_global.read_stream(
ModularStreamId::ModularLF(group),
&self.header,
&lf_global.tree,
br,
)?; ifself.header.encoding == Encoding::VarDCT {
info!("decoding HF metadata with group id {}", group); let hf_meta = self.hf_meta.as_mut().unwrap();
decode_hf_metadata(
group,
&self.header,
&self.decoder_state.file_header.image_metadata,
&lf_global.tree,
hf_meta,
br,
)?;
}
Ok(())
}
#[instrument(level = "debug", skip_all)] pubfn decode_hf_global(&mutself, br: &mut BitReader) -> Result<()> {
debug!(section_size = br.total_bits_available()); ifself.header.encoding == Encoding::VarDCT { let lf_global = self.lf_global.as_mut().unwrap(); let dequant_matrices = DequantMatrices::decode(&self.header, lf_global, br)?; let block_context_map = lf_global.block_context_map.as_mut().unwrap(); let num_histo_bits = self.header.num_groups().ceil_log2(); let num_histograms: u32 = br.read(num_histo_bits)? as u32 + 1;
info!( "Processing HFGlobal section with {} passes and {} histograms", self.header.passes.num_passes, num_histograms
); letmut passes: Vec<PassState> = vec![]; #[allow(unused_variables)] for i in0..self.header.passes.num_passes as usize { let used_orders = match br.read(2)? { 0 => 0x5f, 1 => 0x13, 2 => 0,
_ => br.read(coeff_order::NUM_ORDERS)?,
} as u32;
debug!(used_orders); let coeff_orders = decode_coeff_orders(used_orders, br)?;
assert_eq!(coeff_orders.len(), 3 * coeff_order::NUM_ORDERS); let num_contexts = num_histograms as usize * block_context_map.num_ac_contexts();
info!( "Decoding histograms for pass {} with {} contexts",
i, num_contexts
); letmut histograms = Histograms::decode(num_contexts, br, true)?; // Pad the context map to avoid index out of bounds in decode_vardct_group (group.rs#L514@752e6a4). let padding = ZERO_DENSITY_CONTEXT_LIMIT - ZERO_DENSITY_CONTEXT_COUNT;
histograms.resize(num_contexts + padding);
debug!("Found {} histograms", histograms.num_histograms());
passes.push(PassState {
coeff_orders,
histograms,
});
} // Note that, if we have extra channels that can be rendered progressively, // we might end up re-drawing some VarDCT groups. In that case, we need to // keep around the coefficients, so allocate coefficients under those conditions // too. // TODO(veluca): evaluate whether we can make this check more precise. let hf_coefficients = if passes.len() <= 1
&& !(self
.lf_global
.as_mut()
.unwrap()
.modular_global
.can_do_partial_render()
&& self.header.num_extra_channels > 0)
{
None
} else { let xs = GROUP_DIM * GROUP_DIM; let ys = self.header.num_groups();
Some((
Image::new((xs, ys))?,
Image::new((xs, ys))?,
Image::new((xs, ys))?,
))
};
self.hf_global = Some(HfGlobalState {
num_histograms,
passes,
dequant_matrices,
hf_coefficients,
});
} // Set EPF sigma values to the correct values if we are doing EPF. ifself.header.restoration_filter.epf_iters > 0 {
*self.epf_sigma.borrow_mut() = SigmaSource::new(
&self.header, self.lf_global.as_ref().unwrap(),
&self.hf_meta,
)?;
}
Ok(())
}
pubfn render_noise_for_group(
&mutself,
group: usize,
complete: bool,
buffer_splitter: &mut BufferSplitter,
) -> Result<()> { // TODO(sboukortt): consider making this a dedicated stage // TODO(veluca): SIMD. let num_channels = self.header.num_extra_channels as usize + 3;
let group_dim = self.header.group_dim() as u32; let xsize_groups = self.header.size_groups().0; let gx = (group % xsize_groups) as u32; let gy = (group / xsize_groups) as u32; let upsampling = self.header.upsampling; let upsampled_size = self.header.size_upsampled();
// Total buffer covers the upsampled region for this group let buf_x1 = ((gx + 1) * upsampling * group_dim) as usize; let buf_y1 = ((gy + 1) * upsampling * group_dim) as usize; let buf_xsize = buf_x1.min(upsampled_size.0) - (gx * upsampling * group_dim) as usize; let buf_ysize = buf_y1.min(upsampled_size.1) - (gy * upsampling * group_dim) as usize;
let bits_to_float = |bits: u32| f32::from_bits((bits >> 9) | 0x3F800000);
// libjxl iterates through upsampling subdivisions with separate RNG seeds. // For each subregion, a single RNG is shared across all 3 channels. for iy in0..upsampling { for ix in0..upsampling { // Seed coordinates for this subregion (matches libjxl) let x0 = (gx * upsampling + ix) * group_dim; let y0 = (gy * upsampling + iy) * group_dim;
// Create RNG with this subregion's seed - shared across all 3 channels letmut rng = Xorshift128Plus::new_with_seeds( self.decoder_state.visible_frame_index as u32, self.decoder_state.nonvisible_frame_index as u32,
x0,
y0,
);
// Subregion boundaries within the buffer let sub_x0 = (ix * group_dim) as usize; let sub_y0 = (iy * group_dim) as usize; let sub_x1 = ((ix + 1) * group_dim) as usize; let sub_y1 = ((iy + 1) * group_dim) as usize;
// Clamp to actual buffer size let sub_xsize = sub_x1.min(buf_xsize).saturating_sub(sub_x0); let sub_ysize = sub_y1.min(buf_ysize).saturating_sub(sub_y0);
// Skip if this subregion is entirely outside the buffer if sub_xsize == 0 || sub_ysize == 0 { continue;
}
// Fill all 3 channels with this subregion's noise, sharing the RNG for buf in &mut bufs { for y in0..sub_ysize { let row = buf.row_mut(sub_y0 + y); for batch_index in0..sub_xsize.div_ceil(FLOATS_PER_BATCH) {
rng.fill(&mut batch); let batch_size =
(sub_xsize - batch_index * FLOATS_PER_BATCH).min(FLOATS_PER_BATCH); for i in0..batch_size { let x = sub_x0 + FLOATS_PER_BATCH * batch_index + i; let k = i / 2; let high_bytes = i % 2 != 0; let bits = if high_bytes {
((batch[k] & 0xFFFFFFFF00000000) >> 32) as u32
} else {
(batch[k] & 0xFFFFFFFF) as u32
};
row[x] = bits_to_float(bits);
}
}
}
}
}
}
// Returns `true` if VarDCT and noise data were effectively rendered. #[instrument(level = "debug", skip(self, passes, buffer_splitter))] pubfn decode_hf_group(
&mutself,
group: usize,
passes: &mut [(usize, BitReader)],
buffer_splitter: &mut BufferSplitter,
force_render: bool,
) -> Result<bool> { if passes.is_empty() {
assert!(force_render);
}
let last_pass_in_file = self.header.passes.num_passes as usize - 1; let was_complete = self.last_rendered_pass[group].is_some_and(|p| p >= last_pass_in_file);
iflet Some((p, _)) = passes.last() { self.last_rendered_pass[group] = Some(*p);
}; let pass_to_render = self.last_rendered_pass[group]; let complete = pass_to_render.is_some_and(|p| p >= last_pass_in_file);
if complete && !was_complete { self.incomplete_groups = self.incomplete_groups.checked_sub(1).unwrap();
}
// Render if we are decoding the last pass, or if we are requesting an eager render and // we can handle this case of eager renders. let do_render = if complete { true
} elseif force_render { self.allow_rendering_before_last_pass()
} else { false
};
if !do_render && passes.is_empty() { return Ok(false);
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.