mirror of
https://github.com/storytold/pdfcraft.git
synced 2026-11-07 03:01:55 +00:00
Merge pull request #5432 from KenM76/perf/png-predictor-bytes
perf(render): undo PNG predictors a byte row at a time (#5430)
This commit is contained in:
4 files changed
+308
-102
No files matched your search
@@ -8756,6 +8756,9 @@ mod default_colour_spaces;
|
||||
// (vendored hayro-syntax patch 28, hayro-interpret patch 55).
|
||||
mod devicen_inks;
|
||||
|
||||
// #5430: PNG-predicted Flate images are undone byte by byte (vendored hayro-syntax patch 35).
|
||||
mod png_predicted_images;
|
||||
|
||||
// #3776: isolated DeviceCMYK groups blend in CMYK (vendored hayro-interpret patch 70, hayro
|
||||
// patch 27).
|
||||
mod isolated_cmyk_groups;
|
||||
|
||||
@@ -0,0 +1,69 @@
|
||||
//! #5430: Flate images with PNG predictors (ISO 32000-2 §7.4.4.4) are undone a byte row at a
|
||||
//! time (vendored hayro-syntax patch 35). The bit-level decoder they went through before dropped
|
||||
//! the last byte of each filtered row that ends part-way through a pixel, so every later row
|
||||
//! started a byte early and the picture came out sheared.
|
||||
|
||||
use super::rgb_at;
|
||||
use crate::{PageRenderer, RenderConfig, RenderRequest, RequestKind};
|
||||
use flate2::{Compression, write::ZlibEncoder};
|
||||
use std::io::Write;
|
||||
use std::sync::Arc;
|
||||
|
||||
/// The page is 150 × 200 pt, drawn at 72 dpi; the image fills it.
|
||||
const WIDTH: usize = 150;
|
||||
const HEIGHT: usize = 200;
|
||||
|
||||
/// The colour of each of the image's four rows, top first, as 4-bit samples.
|
||||
const ROWS: [[u8; 3]; 4] = [[15, 0, 0], [0, 15, 0], [0, 0, 15], [15, 15, 0]];
|
||||
|
||||
#[test]
|
||||
fn a_four_bit_rgb_image_of_odd_width_with_up_predicted_rows_is_not_sheared() {
|
||||
// Three 4-bit RGB pixels are 4.5 bytes, so each row is five bytes and ends half-way through a
|
||||
// two-byte pixel.
|
||||
let rows: Vec<Vec<u8>> = ROWS
|
||||
.iter()
|
||||
.map(|rgb| {
|
||||
let nibbles: Vec<u8> = (0..3).flat_map(|_| rgb.iter().copied()).chain([0]).collect();
|
||||
nibbles.chunks(2).map(|pair| (pair[0] << 4) | pair[1]).collect()
|
||||
})
|
||||
.collect();
|
||||
let mut predicted = Vec::new();
|
||||
let mut above = vec![0u8; 5];
|
||||
for row in &rows {
|
||||
predicted.push(2);
|
||||
predicted.extend(row.iter().zip(&above).map(|(b, a)| b.wrapping_sub(*a)));
|
||||
above.clone_from(row);
|
||||
}
|
||||
let mut encoder = ZlibEncoder::new(Vec::new(), Compression::default());
|
||||
encoder.write_all(&predicted).unwrap();
|
||||
let data = encoder.finish().unwrap();
|
||||
|
||||
let content = "q 150 0 0 200 0 0 cm /Im0 Do Q";
|
||||
let mut pdf = format!(
|
||||
"%PDF-1.7\n1 0 obj << /Type /Catalog /Pages 2 0 R >> endobj\n\
|
||||
2 0 obj << /Type /Pages /Kids [3 0 R] /Count 1 >> endobj\n\
|
||||
3 0 obj << /Type /Page /Parent 2 0 R /MediaBox [0 0 150 200] /Resources << /XObject << /Im0 5 0 R >> >> /Contents 4 0 R >> endobj\n\
|
||||
4 0 obj << /Length {} >> stream\n{content}\nendstream endobj\n\
|
||||
5 0 obj << /Type /XObject /Subtype /Image /Width 3 /Height 4 /ColorSpace /DeviceRGB /BitsPerComponent 4 \
|
||||
/Filter /FlateDecode /DecodeParms << /Predictor 15 /Colors 3 /BitsPerComponent 4 /Columns 3 >> /Length {} >> stream\n",
|
||||
content.len(),
|
||||
data.len()
|
||||
)
|
||||
.into_bytes();
|
||||
pdf.extend_from_slice(&data);
|
||||
pdf.extend_from_slice(b"\nendstream endobj\ntrailer << /Root 1 0 R >>\n%%EOF");
|
||||
|
||||
let mut renderer = PageRenderer::new(Arc::new(pdf), RenderConfig::default());
|
||||
let page = renderer.render(RenderRequest { page: 0, kind: RequestKind::Pixels, tile: None, scale: 1.0, tag: 0, preview: false });
|
||||
assert!(page.error.is_none(), "{:?}", page.error);
|
||||
assert_eq!((page.width, page.height), (WIDTH as u32, HEIGHT as u32));
|
||||
|
||||
// Each image pixel is 50 pt square; look at the middle of each.
|
||||
for (row, rgb) in ROWS.iter().enumerate() {
|
||||
let expected = rgb.map(|sample| sample * 17);
|
||||
for column in 0..3 {
|
||||
let (x, y) = (column * 50 + 25, row * 50 + 25);
|
||||
assert_eq!(rgb_at(&page.rgba, WIDTH, x, y), expected, "image row {row}, column {column}");
|
||||
}
|
||||
}
|
||||
}
|
||||
Vendored
+1
-1
@@ -43,7 +43,7 @@ Other resource categories retain their existing parent-chain lookup.
|
||||
| hayro | 0.7.1 | Apache-2.0 OR MIT | (1) `RenderSettings::{x_offset, y_offset}` to render one tile of a large page; (2) images over `MAX_IMAGE_PIXELS` (2^28) are skipped (a fuzzed `/W 4294967295` hung in resampling); (3) `tiling_cell_scale` keeps a tiling pattern's cell pixmap within 3000 px a side whatever its `/XStep`/`/YStep` (a fuzzed step far beyond `/BBox` allocated 2 GB); (4) stroke widths clamped to 4 × (canvas width + height) device pixels (a fuzzed `/LW 9223372036854775807` allocated 10 GB in stroke expansion); (5) `usable_dash_pattern`: a stroke whose dash pattern could cut it into more than `MAX_DASHES_PER_STROKE` (250,000) pieces, counting kurbo's restart of the pattern at every subpath and `ClosePath`, is drawn solid (a fuzzed `/D [[11] 0]` on a line from x = 92234775807 allocated over 5 GB, `[0.000001] 0 d` on a 20 pt line over 10 GB); (6) a dash pattern with a negative or non-finite entry, or a period that isn't positive, is drawn solid (`[-1 -1] 0 d` looped for ever in kurbo); (7) `render_size` and `render_into`: render into a buffer the caller allocates (PdfCraft renders into pixel-aligned memory that the GUI takes over as texture data); `render` is `render_into` on a new pixmap; (8) checked image source/target/RGBA, alpha-premultiplication scratch and intermediate sizes before resampling, finite transforms and exact source/mask buffers; sources wider than u16 may shrink before backend limits, with a 2^20 source-axis cap and conservative 128 MiB filter-planning estimate; an over-limit or failed resize keeps the original image resolution and geometry when the source fits the backend, otherwise skips it, with a logged warning; staging, resampling output/scratch, RGBA conversion and padding buffers use fallible reserves; (9) `may_paint_canvas`: a fill or stroke whose control-point box, grown by how far its paint reaches past the path (half the stroke width times the larger of the miter limit and √2) plus 0.5 user units and 2 pixels, misses the canvas is not drawn, so a tile no longer strokes and fills every path of its page (item 5 of #623); `set_skip_offscreen_paths` turns this off for the regression test; (10) `/Interpolate` governs the pre-resize too (#624): a minified image that does not request interpolation is pre-resized with nearest-neighbour, planned without the Catmull-Rom filter limits (`image_resampling_size` takes the flag); a Type 3 glyph image is sampled bicubically only when interpolated; a minified image with a matching soft mask is nearest-sampled straight into premultiplied RGBA; (11) `may_paint_rect`: an image whose stream-size box, mapped to the device, misses the canvas is skipped before decoding (decoded data can only shrink against that box), so a tile of an image-heavy page no longer decodes, resamples and rasterizes every image on it; (12) preview renders (`InterpreterSettings::preview`: backdrops, thumbnails, grid cells, signature-drag backgrounds) skip images under `PREVIEW_MIN_IMAGE_AREA` device pixels, while final renders always draw them; (13) reading colours (#897): `RenderSettings::color_replacement` takes a `ColorReplacement` (text colour, background, `only_black`, `line_art`) that remaps solid text and line-art paint while rendering, glyph outlines counting as text and stencil-mask ink as line art; images, image alpha masks, soft masks and pattern cells keep their colours; `render_pdf` gains a `color_replacement: Option<ColorReplacement>` argument (pass `None` for true colours); the upstream-only `[dev-dependencies.log]` entry is removed from `Cargo.toml` (log is a normal dependency since the logging patch), so `cargo test -p hayro` runs this crate's unit tests; (14) a shrunk, interpolated image whose axes lie along the device's (upright, mirrored or a quarter turn, as on a page under `/Rotate`) is snapped to whole device pixels: shrunk once to its rounded device rectangle and drawn 1:1 from the rounded corner, instead of a ceil-sized raster resampled again at a fractional scale and offset (`snap_minified_image`; scans looked soft next to Acrobat, and until #5530 a turned one still did, up to 200 grey levels off the same page drawn upright). An image counts as axis-aligned when the terms the snap drops move its far edges by at most a hundredth of a device pixel (`SNAP_SKEW`), not by a tolerance on the coefficients, which let a slight skew of a very wide image through; and the snapped 1:1 transform is used only when the shrink produced the snapped size, so a failed resize keeps the full transform instead of drawing the source raster at its source size; (15) a soft mask of another size than its image is filtered when shrunk, whatever its `/Interpolate` (#1649): such a mask carries the shape on its own (Word saves text as a tiny black image with a glyph-bitmap mask), and nearest-neighbour dropped every stroke thinner than the shrink factor; (16) under a soft mask or a blend mode, axial and radial shadings are sampled instead of drawn as native gradients (#Line truncated
|
||||
| hayro-jbig2 | 0.3.0 | Apache-2.0 OR MIT | (1) at most 2^28 pixels per bitmap and page bitmap, and 2^25 cells per halftone grid and grayscale image (each side could be 65535: 4.3 billion pixels decoded one by one, and a 4-byte value per cell); (2) at most 2^26 symbol pixels per symbol dictionary (a fuzzed dictionary decoded for minutes); (3) a symbol dictionary's height classes are capped at one per new symbol and its export runs at `2 × symbols + 1`, each plus `EXTRA_EMPTY_STEPS` (1024): an empty height class or a zero-length export run doesn't advance, and past the end of its data the arithmetic decoder can decode them for ever (one changed byte hung the renderer); (4) a segment header's long-form referred-to segment count is capped at `u16::MAX` and a larger count is refused before its retention or referred-to bytes are read: the 29-bit count went straight to `Vec::with_capacity`, a reservation of about 2 GiB whose failure aborts the process (from storytold/craft-libs#176); (5) what a page's segments hold for later ones (intermediate regions, pattern and symbol dictionaries with their headers and retained contexts, and Huffman tables) is at most 64 MiB, two square bitmaps of 16,384 a side (`MAX_RETAINED_WORDS`), and a dictionary's new and exported symbols are counted against it as they are made: each was bounded on its own, but a few dozen bytes an intermediate region held 33 MB each, and 8 MiB symbols exported again and again killed the process, so a few kilobytes could exhaust memory; (6) a segment may refer to at most 2^20 symbols, checked before any are collected: references may repeat, and 65,535 of them to one dictionary, in a 78 KB stream, asked for 17 GB; (7) a pattern dictionary keeps at most 16 MiB of shifted copies, which only speed up drawing, and none that wouldn't fit what the page has left (`MAX_SHIFTED_WORDS`); (8) a custom Huffman table has at most 2^16 lines, and a stream with its globals at most 2^20 segments and 2^22 references, checked as they are read: both grew before anything counted them, and PDFs of a kilobyte or so reached 5 GB and more behind nested Flate; (9) a page past the bounds of (1) is refused when the stream is opened: a caller sizes its output from the header before the page bitmap is made, and an Indexed image in a 743-byte PDF asked for 137 GB, which aborts; (10) a stream may ask for at most 2^30 units of decoding work, four of the largest pages, about 6 s to 17 s (`MAX_WORK`): decoding a bitmap costs a pixel each and 4 a row, copying one a word each and 1 a row, and each integer an item reads costs 38, what one takes at worst, so one with no pixels pays too, before it is decoded: each bitmap was bounded, but nothing bounded how many there were, and a 795-byte PDF took 265 s; (11) `Image::decode_within` spends from what a run of images may still do, starting with its page's pixels, and `charge_reading` charges reading a stream and its globals before anything is parsed, so an operation over a document can bound what `MAX_WORK` bounds for one image, and images that fail or decode nothing add up too: a file of thousands of images made to reach that limit took as many times as long; (12) adding to a location, a reference offset, a symbol's corner or a Huffman range line near the end of an `i32`, and negating a decoded integer of 2^31, overflowed: a panic wherever overflow is checked. The refinement context, a text region's corners, the integer decoder and the Huffman table wrap, as a release build did, and `Bitmap::combine` saturates, which comes to the same, as a location that overflows is past the end of any page. What is drawn doesn't change; (13) a bitmap filled with a default pixel of 1 (a page, or an intermediate text or halftone region) had 1s past its width in the last word of each row, and a refinement, which reads its reference a word at a time, read them as pixels where the standard has 0 (6.3.5.2): refining such a reference not a multiple of 32 wide decoded to other pixels than were coded, release builds too. `Bitmap::clear_padding` clears those bits when a bitmap is filled with 1s, as cutting symbols and patterns from a collective bitmap already did. Ghostscript reads the test's page and text streams as they decode now; (14) a region's location is unsigned (5.4.4), so one past `i32::MAX` is off the page, where the decoder took it for a signed one: a region there was drawn back onto the page from the left or the top (at 0xFFFFFFFC, four pixels left of it), and a refinement there, of the page or of a region at the same place (7.4.7.5), was refused as an overflow, and the page with it. `Bitmap::combine_region` keeps such a location past the page. A refinement of another region refines it where it is, as Table 35 has it (GRREFERENCEDX and GRREFERENCEDY 0), whatever the two locations say; a refinement of the page, see (16); (15) a refinement whose reference is offset right of it (GRREFERENCEDX above 0, which a refined text instance has from a wider bitmap, TaLine truncated
|
||||
| lopdf | 0.45.0 | MIT | (1) PNG predictor rows longer than the data are refused before their buffers are allocated (a fuzzed `/Columns 4294967295` allocated two 4 GiB rows), and empty frames return without row buffers; (2) predictor row widths use saturating arithmetic or reject overflow; (3) sub-byte TIFF Predictor 2 scratch is bounded by the samples present in the input instead of the declared `/Colors`, aligned with [lopdf#589](https://github.com/J-F-Liu/lopdf/pull/589); (4) the object lookup keeps its cycle history through compressed objects, requires an ordinary in-file container, and caps the chain of indirect lookups at 16 (a chain of new objects, each a `/Length` compressed in a container whose own `/Length` names the next, or a stream whose `/Length` names the next stream, overflowed the stack: a dev build's 2 MiB thread within 800 hops); (5) object-stream members are parsed within their own extent (up to the next distinct offset), an entry whose offset repeats an earlier entry's is skipped (so a repeated object number can resolve to its earlier entry), and offsets are processed in index order; (6) `find_latest_trailer`: a rebuild takes a `/Type /XRef` stream dictionary as the trailer when the file has no `trailer` keyword (the latest in the file wins, as a later `trailer` would), so a concatenated or truncated file keeps its /Info and /ID instead of failing to load; a candidate whose /Root is the catalog beats one whose /Root is another dictionary, and an in-file /Root must match its generation (#2365) | (1) `inspect::tests::png_predictor_rows_longer_than_the_data_are_refused_before_allocating`, `inspect::tests::empty_png_predictor_frames_do_not_allocate_rows`; (2) `inspect::tests::tiff_subbyte_predictor_row_width_overflow_is_refused`; (3) `inspect::tests::tiff_subbyte_predictor_scratch_is_bounded_by_available_samples`, `inspect::tests::tiff_subbyte_predictors_keep_components_rows_and_padding`; (4) `inspect::tests::compressed_object_self_container_does_not_recurse`, `inspect::tests::compressed_object_mutual_containers_do_not_recurse`, `inspect::tests::object_stream_length_cycle_does_not_recurse`, `inspect::tests::compressed_object_container_chain_does_not_recurse`, `inspect::tests::compressed_length_chain_does_not_recurse`, `inspect::tests::plain_stream_length_chain_does_not_recurse`, `inspect::tests::compressed_objects_and_indirect_stream_length_still_load`, `inspect::tests::compressed_length_in_a_container_with_an_indirect_length_still_loads`; (5) `inspect::tests::object_stream_member_extents_bound_owned_strings`, `inspect::tests::object_stream_member_extents_preserve_index_order_and_whitespace`; (6) `inspect::tests::rebuilt_file_keeps_the_info_of_its_cross_reference_stream`, `inspect::tests::rebuilt_file_prefers_a_trailer_whose_root_is_the_catalog` |
|
||||
| hayro-syntax | 0.7.2 | Apache-2.0 OR MIT | (1) Page-tree cycle guard in `resolve_pages` (visited set + depth cap): a `/Kids` loop among compressed objects overflowed the stack and aborted the process; (2) `ccitt_size_ok`: CCITT images wider than 2^20 columns or over 2^28 pixels are not decoded (a fuzzed `/Columns 4294967295` allocated 4 GiB); (3) Flate/LZW predictor row widths are saturating `usize`, a zero width is refused and a row longer than the data is not allocated (a fuzzed `/Columns 9223372036854775807` wrapped to a 2^61-byte allocation and aborted); (4) the inline-image end-of-data check (`EI`) doesn't nest inside its own look-ahead and examines at most 256 candidates and steps (50 images with "EI" in their data ran for over ten minutes); an EI followed by a delimiter (EI%..., EI[...) ends the image like one followed by white space; only a regular character after EI skips the candidate; (5) a stream whose `/Length` is wrong is recovered only when `stream` is the next token — scanning ahead to a later object's `stream` made an indirect appearance-state dictionary (Quartz checkboxes: `/AP /N` → `<< /Yes … /Off … >>`) render as a non-form, so the widget was skipped; (6) JPX rescaling uses an exact integer sample range for 1–32-bit components (32 shifted past u32, and floating-point maxima at 25–31 bits wrapped to zero), and refuses zero-sized rows; (7) `decode_limit`: Flate (through flate2 and the fallback inflater), LZW, RunLength and ASCII85 never write past `MAX_DECODED_STREAM` (256 MiB), or, for the last filter of an image of known size, past twice its pixel bytes (a predictor tag byte per byte), at most 1 GiB; `Stream::decoded_within` for budgeted callers; a page's `/Contents` array shares one `MAX_DECODED_STREAM` (a 2 MB page whose content stream or 8 × 8 image inflated to 2 GB took the renderer past 3 GB in under a second; naming the stream twenty times in `/Contents`, 5 GB); (8) high-precision numbers (jsPDF MediaBox coordinates with over 19 digits) parse without overflowing the u64 mantissa: fractional digits past it are dropped, integer digits past it scale the value (a real, kept finite); (9) large dictionary indexes are built on first use and shared across repeated reads within each PDF (#307); the validated-byte cache is bounded, reader contexts remain separate, repairs and inline/content dictionaries bypass sharing, and small dictionaries stay eager; (10) decoded object-stream slots publish once under contention, cold loading rejects recursive dependencies, and xref repair serializes without holding recursive read guards; this permits one parser per native render pool with private worker caches; (11) `sync.rs`: a poisoned lock is recovered instead of unwrapped (a worker panic no longer cascades into every reader of the same PDF), and xref repair takes a blocking write lock instead of asserting a non-blocking one; (12) `SegmentList` (`util.rs`) returns `None` for an out-of-range index instead of panicking; (13) a page's `/UserUnit` scales `render_dimensions` and `initial_transform`, so the page and everything on it are sized in points, as Acrobat shows them; it is read as Acrobat reads it (the page's own entry, not inherited; a number from 1 up, at most 75,000; anything else counts as 1), and a page without it keeps exactly the transform it had; (14) revision 2–4 passwords are tried as given and then in PDFDocEncoding (`legacy_passwords` in `crypto/mod.rs`, which resolves the upstream `TODO: Convert to PDFDocEncoding`): passwords arrive as UTF-8 text, so a password with characters outside ASCII (`Çok güzel`, `ılık€`) written in PDFDocEncoding, as ISO 32000-2 §7.6.4.3.2 asks and qpdf and Acrobat write it, was always wrong; (15) page content is read a piece at a time (`page::ContentReader`, `Page::content_reader`): plain streams and Flate streams without a predictor are decoded as they are read, with a budget of 64 times their compressed size and never less than `MAX_DECODED_STREAM` (a stream that expands past it is cut and reported); other streams are decoded whole, as before, and share `MAX_DECODED_STREAM`. The content tokenizer reads a window at a time (`UntypedIter::new_window`, `TypedIter::needs_more`, `TypedIter::committed`): an instruction that runs past the window is not decided until more data follows, which `Reader` records by flagging reads and `at_end` past the end of the data, including through the clones the parser makes. The Flate decoder keeps its own 32 KiB history, so it pauses at any output size. `ContentReader::new` reuses raw/decrypted stream bytes for budget accounting and piece creation, and `decoded_raw_within` applies the existing Whole-stream filters and limits to those bytes without decrypting twice; (16) revision 5–6 (AES-256) passwords are tried in their SASLprep form (RFC 4013, then UTF-8, at most 127 bytes, as ISO 32000-2 §7.6.4.3.3 Algorithm 2.A asks and pdfcraft-crypt writes them) and then, if that differs, as given (`aes256_passwLine truncated
|
||||
| hayro-syntax | 0.7.2 | Apache-2.0 OR MIT | (1) Page-tree cycle guard in `resolve_pages` (visited set + depth cap): a `/Kids` loop among compressed objects overflowed the stack and aborted the process; (2) `ccitt_size_ok`: CCITT images wider than 2^20 columns or over 2^28 pixels are not decoded (a fuzzed `/Columns 4294967295` allocated 4 GiB); (3) Flate/LZW predictor row widths are saturating `usize`, a zero width is refused and a row longer than the data is not allocated (a fuzzed `/Columns 9223372036854775807` wrapped to a 2^61-byte allocation and aborted); (4) the inline-image end-of-data check (`EI`) doesn't nest inside its own look-ahead and examines at most 256 candidates and steps (50 images with "EI" in their data ran for over ten minutes); an EI followed by a delimiter (EI%..., EI[...) ends the image like one followed by white space; only a regular character after EI skips the candidate; (5) a stream whose `/Length` is wrong is recovered only when `stream` is the next token — scanning ahead to a later object's `stream` made an indirect appearance-state dictionary (Quartz checkboxes: `/AP /N` → `<< /Yes … /Off … >>`) render as a non-form, so the widget was skipped; (6) JPX rescaling uses an exact integer sample range for 1–32-bit components (32 shifted past u32, and floating-point maxima at 25–31 bits wrapped to zero), and refuses zero-sized rows; (7) `decode_limit`: Flate (through flate2 and the fallback inflater), LZW, RunLength and ASCII85 never write past `MAX_DECODED_STREAM` (256 MiB), or, for the last filter of an image of known size, past twice its pixel bytes (a predictor tag byte per byte), at most 1 GiB; `Stream::decoded_within` for budgeted callers; a page's `/Contents` array shares one `MAX_DECODED_STREAM` (a 2 MB page whose content stream or 8 × 8 image inflated to 2 GB took the renderer past 3 GB in under a second; naming the stream twenty times in `/Contents`, 5 GB); (8) high-precision numbers (jsPDF MediaBox coordinates with over 19 digits) parse without overflowing the u64 mantissa: fractional digits past it are dropped, integer digits past it scale the value (a real, kept finite); (9) large dictionary indexes are built on first use and shared across repeated reads within each PDF (#307); the validated-byte cache is bounded, reader contexts remain separate, repairs and inline/content dictionaries bypass sharing, and small dictionaries stay eager; (10) decoded object-stream slots publish once under contention, cold loading rejects recursive dependencies, and xref repair serializes without holding recursive read guards; this permits one parser per native render pool with private worker caches; (11) `sync.rs`: a poisoned lock is recovered instead of unwrapped (a worker panic no longer cascades into every reader of the same PDF), and xref repair takes a blocking write lock instead of asserting a non-blocking one; (12) `SegmentList` (`util.rs`) returns `None` for an out-of-range index instead of panicking; (13) a page's `/UserUnit` scales `render_dimensions` and `initial_transform`, so the page and everything on it are sized in points, as Acrobat shows them; it is read as Acrobat reads it (the page's own entry, not inherited; a number from 1 up, at most 75,000; anything else counts as 1), and a page without it keeps exactly the transform it had; (14) revision 2–4 passwords are tried as given and then in PDFDocEncoding (`legacy_passwords` in `crypto/mod.rs`, which resolves the upstream `TODO: Convert to PDFDocEncoding`): passwords arrive as UTF-8 text, so a password with characters outside ASCII (`Çok güzel`, `ılık€`) written in PDFDocEncoding, as ISO 32000-2 §7.6.4.3.2 asks and qpdf and Acrobat write it, was always wrong; (15) page content is read a piece at a time (`page::ContentReader`, `Page::content_reader`): plain streams and Flate streams without a predictor are decoded as they are read, with a budget of 64 times their compressed size and never less than `MAX_DECODED_STREAM` (a stream that expands past it is cut and reported); other streams are decoded whole, as before, and share `MAX_DECODED_STREAM`. The content tokenizer reads a window at a time (`UntypedIter::new_window`, `TypedIter::needs_more`, `TypedIter::committed`): an instruction that runs past the window is not decided until more data follows, which `Reader` records by flagging reads and `at_end` past the end of the data, including through the clones the parser makes. The Flate decoder keeps its own 32 KiB history, so it pauses at any output size. `ContentReader::new` reuses raw/decrypted stream bytes for budget accounting and piece creation, and `decoded_raw_within` applies the existing Whole-stream filters and limits to those bytes without decrypting twice; (16) revision 5–6 (AES-256) passwords are tried in their SASLprep form (RFC 4013, then UTF-8, at most 127 bytes, as ISO 32000-2 §7.6.4.3.3 Algorithm 2.A asks and pdfcraft-crypt writes them) and then, if that differs, as given (`aes256_passwLine truncated
|
||||
| winit | 0.30.13 | Apache-2.0 | (1) on Windows 11 (build 22000 and later), `WM_DPICHANGED` applies the rect Windows suggests. It used to nudge the window onto the monitor `MonitorFromWindow` names, which during a drag is still the monitor being left; the nudge sent another `WM_DPICHANGED`, so a window dragged to a monitor with another scale factor grew and stayed on the wrong monitor at the wrong scale (#324). Backport of winit master 488c036a ([winit#4341](https://github.com/rust-windowing/winit/pull/4341)), which no 0.30 release has; Windows 10 keeps the old adjustment, as on winit master. (2) on Wayland, a seat's text input is destroyed when the seat goes away, not whenever it loses a capability: losing any capability (a touch screen or tablet unplugged, a remote-desktop session ending) destroyed it, and only an added capability recreated it, so IME stopped working until restart. Port of [winit#4747](https://github.com/rust-windowing/winit/pull/4747); (3) on Windows, an IME composition reports its cursor from `GCS_CURSORPOS` only when `WM_IME_COMPOSITION` says it is set, and at the end of the composition otherwise: the Microsoft Korean IME never sets it, so the cursor read as 0 (egui then drew no caret while composing; it now draws it after the syllable). Port of [winit#4746](https://github.com/rust-windowing/winit/pull/4746); (4) on Windows, a hidden window is not maximized until it is shown, and a hidden window shown while maximized gets one `ShowWindow(SW_MAXIMIZE)`: `SW_MAXIMIZE` shows a hidden window, so PdfCraft, which eframe keeps hidden until its first frame is drawn, appeared unpainted (white) when it restored a maximized window, and could lose its focus. Port of [winit#4587](https://github.com/rust-windowing/winit/pull/4587) (the later, focus-safe form of [winit#4575](https://github.com/rust-windowing/winit/pull/4575)); (5) on X11, when allowing or disallowing IME replaces the focused window's input context (egui does it each time a text field gains or loses focus), the new context is focused: no focus event follows, so it stayed unfocused until the window lost and regained focus. Port of [winit#4727](https://github.com/rust-windowing/winit/pull/4727); (6) on macOS, `insertText` commits through IME when a composition was started (`pending_commit`, set by `setMarkedText`) rather than when marked text is left: input methods that end a composition with `unmarkText` before `insertText` lost the text, and Apple Korean dropped the key typed after a syllable (`한` then `5` or `;`); other `insertText` calls stay `KeyboardInput`; a commit outside a key press (a candidate clicked with the mouse, dictation) clears the marked text and leaves no key to swallow, as in [winit#4748](https://github.com/rust-windowing/winit/pull/4748) (without it the next key, such as Backspace, was lost). `validAttributesForMarkedText` lists the underline and marked-clause attributes, without which some input methods don't compose. Port of [winit#4650](https://github.com/rust-windowing/winit/pull/4650), the 0.30 backport of [winit#4651](https://github.com/rust-windowing/winit/pull/4651) (merged on winit master), with the underline attribute spelled as AppKit's `NSUnderlineStyleAttributeName` (`NSUnderline`); (7) on macOS, disallowing IME with a composition in progress (focus leaving a text field) tells the input method to discard its marked text (`discardMarkedText`): it kept composing it once IME was allowed again, so the abandoned syllable came back (`하`, then `가` typed in the next field, became `학`, then `하` + `가`; Japanese `か` then `さ` became `傘`). Port of [winit#4745](https://github.com/rust-windowing/winit/pull/4745); (8) on macOS, text inserted outside a key press without a composition (the emoji picker) is reported as `Ime::Commit`; it was dropped. Port of the emoji-picker part of [winit#4749](https://github.com/rust-windowing/winit/pull/4749) (0.30 backport of [winit#4748](https://github.com/rust-windowing/winit/pull/4748)); its `selectedRange` change for dictation is left out because it switches on press-and-hold for every held key (an accent menu instead of key repeat, and the chosen accent added after the repeated letters); (9) on macOS, a key whose text was committed through IME isn't also sent as `KeyboardInput` unless AppKit forwards it as a command (Enter): Apple Korean answers Space with no syllable in progress with `setMarkedText(" ")`, `insertText(" ")`, `setMarkedText("")`, and the last call reset winit's state, so the space arrived twice. Same goal as [winit#4478](https://github.com/rust-windowing/winit/pull/4478), whose changes don't reach this call order (macOS 14); to be proposed upstream there; (10) on macOS, when the first key in a fresh app reaches Apple Korean's `insertText` as a raw compatibility jamo instead of starting a composition, that key is interpreted once more, synchronously, before it is sent as `KeyboardInput` (g k s typed ㅎㅏㄴ instead of 한); only an unmodified, Line truncated
|
||||
| egui-wgpu | 0.36.2 | MIT OR Apache-2.0 | (1) `winit::surface_fit`: a window's surface is configured within the device's `max_texture_dimension_2d`, both sides shrunk by one factor that egui then draws at (`pixels_per_point × render_scale`), so the whole window is drawn into the surface (on DX12 it is stretched over the window and lines up with the pointer; wgpu's GL backend copies it unscaled into a corner); the longer side becomes exactly the limit; the depth and MSAA textures follow, and a recreated surface starts again from the window's own size. egui-wgpu configured the window's size as is, and `Surface::configure` panics beyond the limit: a window restored at another monitor's scale (opening an Outlook attachment on a mixed-DPI laptop asked an 8192-pixel device for 8600 × 3423, #577) or stretched across monitors closed PdfCraft, before its window appeared when it happened at start-up ([emilk/egui#8361](https://github.com/emilk/egui/issues/8361)). The published crate leaves out egui's licence files; `LICENSE-APACHE` and `LICENSE-MIT` are from the 0.36.2 tag; (2) `winit::catch_errors`: a new window's surface is configured inside wgpu error scopes (validation, out of memory, internal), and a failure is returned as `WgpuError::ConfigureSurface` (for the root window at start-up eframe returns it as `Error::Wgpu`, which PdfCraft retries with OpenGL); nothing is kept for the window. wgpu's default handler panicked instead, and eframe configures the root surface before the app is created, so a driver that can't configure one closed PdfCraft at launch (a 2015 Intel GPU through wgpu's GL backend timed out waiting for the GPU to go idle, `GpuWaitTimeout`, #519). Unchanged, so still a panic: an error in a later reconfigure (resize, a lost surface), a device lost during the first configure (wgpu reports it only to a callback), and a window shown at zero size (first configured on resize) | (1) `pdfcraft` `tests::a_window_larger_than_the_gpu_limit_gets_a_surface_within_it`, `tests::surface_fit_never_empties_or_overflows_a_surface`, and `tests::vendor_provenance_egui_wgpu_surface_fit_identity`, which keeps the patch in the build and in the paths that size a surface; (2) `pdfcraft` `tests::a_gpu_error_while_a_window_is_set_up_is_returned_not_a_panic` (a real device: an error inside `catch_errors` is returned, not a panic) and `tests::vendor_provenance_egui_wgpu_catch_errors_identity`, which keeps it around `add_surface`'s configure |
|
||||
| vello_common | 0.0.8 | Apache-2.0 OR MIT | (1) `clip::intersect` (the clip step every clipped path passes through) starts its row walk at the first row both paths have strips in, not the earlier of the two first rows. The walk visited every row from the top of the clip for each path (on the A1 sample's full-page canvas, about half its strip rows per stroke), and rows where one path has no strips produce no output, so the strips are unchanged (vello_common 0.1 starts at the later row too). Its cost grew with the page, and a full-page render of the A1 sample was about 30% faster; the output is byte-identical | (1) `clip::tests::intersect_walks_only_rows_both_paths_have_strips` counts the rows the walk visits (`cargo test --manifest-path vendor/vello_common/Cargo.toml`) and fails without the patch; the render crate's pixel tests run through the patched crate |
|
||||
|
||||
+235
-101
@@ -1008,15 +1008,16 @@ fn apply_predictor(data: Vec<u8>, params: &PredictorParams) -> Option<Vec<u8>> {
|
||||
return None;
|
||||
}
|
||||
|
||||
let (bit_size, chunk_len) = if is_png_predictor {
|
||||
(
|
||||
8,
|
||||
// PdfCraft patch: in usize (the u8 product overflowed).
|
||||
(usize::from(params.colors) * usize::from(params.bits_per_component)).div_ceil(8),
|
||||
)
|
||||
} else {
|
||||
(params.bits_per_component, params.colors as usize)
|
||||
};
|
||||
if is_png_predictor {
|
||||
// PdfCraft patch: PNG predictors work on bytes whatever the bit depth, so they are
|
||||
// undone a row at a time on byte slices instead of through the bit-level readers.
|
||||
// In usize (the u8 product overflowed).
|
||||
let bpp = (usize::from(params.colors) * usize::from(params.bits_per_component))
|
||||
.div_ceil(8);
|
||||
return Some(unfilter_png(&data, row_len, bpp));
|
||||
}
|
||||
|
||||
let (bit_size, chunk_len) = (params.bits_per_component, params.colors as usize);
|
||||
let zero_row = vec![0; row_len];
|
||||
let mut prev_row = BitChunks::new(&zero_row, bit_size, chunk_len)?;
|
||||
let zero_col = BitChunk::new(0, chunk_len);
|
||||
@@ -1024,58 +1025,7 @@ fn apply_predictor(data: Vec<u8>, params: &PredictorParams) -> Option<Vec<u8>> {
|
||||
let mut writer = BitWriter::new(&mut out, bit_size)?;
|
||||
|
||||
for in_row in data.chunks_exact(total_row_len) {
|
||||
if is_png_predictor {
|
||||
let predictor = in_row[0];
|
||||
let in_data = &in_row[1..];
|
||||
let in_data_chunks = BitChunks::new(in_data, bit_size, chunk_len)?;
|
||||
|
||||
match predictor {
|
||||
1 => apply::<Sub>(
|
||||
prev_row,
|
||||
zero_col.clone(),
|
||||
zero_col.clone(),
|
||||
in_data_chunks,
|
||||
&mut writer,
|
||||
chunk_len,
|
||||
bit_size,
|
||||
)?,
|
||||
2 => apply::<Up>(
|
||||
prev_row,
|
||||
zero_col.clone(),
|
||||
zero_col.clone(),
|
||||
in_data_chunks,
|
||||
&mut writer,
|
||||
chunk_len,
|
||||
bit_size,
|
||||
)?,
|
||||
3 => apply::<Avg>(
|
||||
prev_row,
|
||||
zero_col.clone(),
|
||||
zero_col.clone(),
|
||||
in_data_chunks,
|
||||
&mut writer,
|
||||
chunk_len,
|
||||
bit_size,
|
||||
)?,
|
||||
4 => apply::<Paeth>(
|
||||
prev_row,
|
||||
zero_col.clone(),
|
||||
zero_col.clone(),
|
||||
in_data_chunks,
|
||||
&mut writer,
|
||||
chunk_len,
|
||||
bit_size,
|
||||
)?,
|
||||
_ => {
|
||||
// Just copy the data.
|
||||
let mut reader = BitReader::new(in_data);
|
||||
|
||||
while let Some(data) = reader.read(bit_size) {
|
||||
writer.write(data);
|
||||
}
|
||||
}
|
||||
}
|
||||
} else if i == 2 {
|
||||
if i == 2 {
|
||||
apply::<Sub>(
|
||||
prev_row,
|
||||
zero_col.clone(),
|
||||
@@ -1104,6 +1054,98 @@ fn apply_predictor(data: Vec<u8>, params: &PredictorParams) -> Option<Vec<u8>> {
|
||||
}
|
||||
}
|
||||
|
||||
/// PdfCraft patch: undoes PNG row filters (ISO 32000-2 §7.4.4.4, PNG specification §9) in
|
||||
/// rows of `row_len` bytes, each after its filter-type byte, with `bpp` bytes per complete pixel
|
||||
/// (at least 1). An unknown filter type copies the row as it is. Bytes after the last complete
|
||||
/// row are dropped.
|
||||
fn unfilter_png(data: &[u8], row_len: usize, bpp: usize) -> Vec<u8> {
|
||||
let bpp = bpp.max(1);
|
||||
let in_row_len = row_len.saturating_add(1);
|
||||
let num_rows = data.len() / in_row_len;
|
||||
let mut out = vec![0; num_rows.saturating_mul(row_len)];
|
||||
let zero_row = vec![0; row_len];
|
||||
let mut prev: &[u8] = &zero_row;
|
||||
|
||||
for (cur, in_row) in out
|
||||
.chunks_exact_mut(row_len)
|
||||
.zip(data.chunks_exact(in_row_len))
|
||||
{
|
||||
let Some((&filter, src)) = in_row.split_first() else {
|
||||
break;
|
||||
};
|
||||
|
||||
match filter {
|
||||
1 => {
|
||||
let mut left: &[u8] = &zero_row;
|
||||
for (px, src) in cur.chunks_mut(bpp).zip(src.chunks(bpp)) {
|
||||
for ((c, s), l) in px.iter_mut().zip(src).zip(left) {
|
||||
*c = s.wrapping_add(*l);
|
||||
}
|
||||
left = px;
|
||||
}
|
||||
}
|
||||
2 => {
|
||||
for ((c, s), u) in cur.iter_mut().zip(src).zip(prev) {
|
||||
*c = s.wrapping_add(*u);
|
||||
}
|
||||
}
|
||||
3 => {
|
||||
let mut left: &[u8] = &zero_row;
|
||||
for ((px, src), up) in cur
|
||||
.chunks_mut(bpp)
|
||||
.zip(src.chunks(bpp))
|
||||
.zip(prev.chunks(bpp))
|
||||
{
|
||||
for (((c, s), l), u) in px.iter_mut().zip(src).zip(left).zip(up) {
|
||||
// The sum is taken before halving, without wrapping.
|
||||
let avg = (u16::from(*l) + u16::from(*u)) / 2;
|
||||
*c = s.wrapping_add(avg as u8);
|
||||
}
|
||||
left = px;
|
||||
}
|
||||
}
|
||||
4 => {
|
||||
let mut left: &[u8] = &zero_row;
|
||||
let mut up_left: &[u8] = &zero_row;
|
||||
for ((px, src), up) in cur
|
||||
.chunks_mut(bpp)
|
||||
.zip(src.chunks(bpp))
|
||||
.zip(prev.chunks(bpp))
|
||||
{
|
||||
for ((((c, s), l), u), ul) in
|
||||
px.iter_mut().zip(src).zip(left).zip(up).zip(up_left)
|
||||
{
|
||||
*c = s.wrapping_add(paeth_byte(*l, *u, *ul));
|
||||
}
|
||||
left = px;
|
||||
up_left = up;
|
||||
}
|
||||
}
|
||||
_ => {
|
||||
for (c, s) in cur.iter_mut().zip(src) {
|
||||
*c = *s;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
prev = cur;
|
||||
}
|
||||
|
||||
out
|
||||
}
|
||||
|
||||
/// The Paeth predictor on bytes: the neighbour nearest `left + up - up_left`, preferring left,
|
||||
/// then up.
|
||||
fn paeth_byte(left: u8, up: u8, up_left: u8) -> u8 {
|
||||
let (a, b, c) = (i16::from(left), i16::from(up), i16::from(up_left));
|
||||
let pa = (b - c).abs();
|
||||
let pb = (a - c).abs();
|
||||
let pc = (a + b - c - c).abs();
|
||||
|
||||
let not_left = if pb <= pc { up } else { up_left };
|
||||
if pa <= pb && pa <= pc { left } else { not_left }
|
||||
}
|
||||
|
||||
fn apply<'a, T: Predictor>(
|
||||
prev_row: BitChunks<'a>,
|
||||
mut prev_col: BitChunk,
|
||||
@@ -1153,46 +1195,6 @@ impl Predictor for Sub {
|
||||
}
|
||||
}
|
||||
|
||||
struct Up;
|
||||
impl Predictor for Up {
|
||||
fn predict(cur_row: u16, prev_row: u16, _: u16, _: u16) -> u16 {
|
||||
cur_row.wrapping_add(prev_row)
|
||||
}
|
||||
}
|
||||
|
||||
struct Avg;
|
||||
impl Predictor for Avg {
|
||||
fn predict(cur_row: u16, prev_row: u16, prev_col: u16, _: u16) -> u16 {
|
||||
cur_row.wrapping_add(((prev_col as u32 + prev_row as u32) / 2) as u16)
|
||||
}
|
||||
}
|
||||
|
||||
struct Paeth;
|
||||
impl Predictor for Paeth {
|
||||
fn predict(cur_row: u16, prev_row: u16, prev_col: u16, top_left: u16) -> u16 {
|
||||
fn paeth(a: u16, b: u16, c: u16) -> u16 {
|
||||
let a = a as i32;
|
||||
let b = b as i32;
|
||||
let c = c as i32;
|
||||
|
||||
let p = a + b - c;
|
||||
let pa = (p - a).abs();
|
||||
let pb = (p - b).abs();
|
||||
let pc = (p - c).abs();
|
||||
|
||||
if pa <= pb && pa <= pc {
|
||||
a as u16
|
||||
} else if pb <= pc {
|
||||
b as u16
|
||||
} else {
|
||||
c as u16
|
||||
}
|
||||
}
|
||||
|
||||
cur_row.wrapping_add(paeth(prev_col, prev_row, top_left))
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
#[rustfmt::skip]
|
||||
mod tests {
|
||||
@@ -1357,3 +1359,135 @@ mod tests {
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
/// PdfCraft patch tests: PNG predictors are undone byte by byte (`unfilter_png`).
|
||||
#[cfg(test)]
|
||||
mod pdfcraft_png_predictor_tests {
|
||||
use crate::filter::lzw_flate::{PredictorParams, apply_predictor};
|
||||
|
||||
/// PNG unfiltering written out from the PNG specification (§9.2–9.4), one byte at a time.
|
||||
fn reference(data: &[u8], row_len: usize, bpp: usize) -> Vec<u8> {
|
||||
let mut out: Vec<u8> = Vec::new();
|
||||
for (r, row) in data.chunks_exact(row_len + 1).enumerate() {
|
||||
let start = r * row_len;
|
||||
for x in 0..row_len {
|
||||
let left = if x >= bpp { out[start + x - bpp] } else { 0 };
|
||||
let up = if r > 0 { out[start + x - row_len] } else { 0 };
|
||||
let up_left = if r > 0 && x >= bpp {
|
||||
out[start + x - row_len - bpp]
|
||||
} else {
|
||||
0
|
||||
};
|
||||
let predicted = match row[0] {
|
||||
1 => left,
|
||||
2 => up,
|
||||
3 => ((u16::from(left) + u16::from(up)) / 2) as u8,
|
||||
4 => {
|
||||
let p = i16::from(left) + i16::from(up) - i16::from(up_left);
|
||||
let (pa, pb, pc) = (
|
||||
(p - i16::from(left)).abs(),
|
||||
(p - i16::from(up)).abs(),
|
||||
(p - i16::from(up_left)).abs(),
|
||||
);
|
||||
if pa <= pb && pa <= pc {
|
||||
left
|
||||
} else if pb <= pc {
|
||||
up
|
||||
} else {
|
||||
up_left
|
||||
}
|
||||
}
|
||||
_ => 0,
|
||||
};
|
||||
out.push(row[1 + x].wrapping_add(predicted));
|
||||
}
|
||||
}
|
||||
out
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn png_predictors_match_the_specification_at_every_depth_and_pixel_size() {
|
||||
let mut seed: u32 = 0x2545_f491;
|
||||
let mut next = move || {
|
||||
seed ^= seed << 13;
|
||||
seed ^= seed >> 17;
|
||||
seed ^= seed << 5;
|
||||
seed
|
||||
};
|
||||
for case in 0..400 {
|
||||
let colors = 1 + (next() % 4) as u8;
|
||||
let bits_per_component = [1u8, 2, 4, 8, 16][(next() % 5) as usize];
|
||||
let columns = 1 + (next() % 40) as usize;
|
||||
let bpp = (usize::from(colors) * usize::from(bits_per_component)).div_ceil(8);
|
||||
let row_len =
|
||||
(columns * usize::from(colors) * usize::from(bits_per_component)).div_ceil(8);
|
||||
let rows = 1 + (next() % 6) as usize;
|
||||
let mut data = Vec::new();
|
||||
for _ in 0..rows {
|
||||
// Filter types 0–4, and 5–7, which are not PNG filters and copy the row.
|
||||
data.push((next() % 8) as u8);
|
||||
data.extend((0..row_len).map(|_| next() as u8));
|
||||
}
|
||||
// A partial row at the end is not decoded.
|
||||
let tail = (next() % 3) as usize;
|
||||
data.extend((0..tail.min(row_len)).map(|_| next() as u8));
|
||||
|
||||
let params = PredictorParams {
|
||||
predictor: 10 + (next() % 6) as u8,
|
||||
colors,
|
||||
bits_per_component,
|
||||
columns,
|
||||
early_change: false,
|
||||
};
|
||||
let got = apply_predictor(data.clone(), ¶ms).unwrap();
|
||||
assert_eq!(
|
||||
got,
|
||||
reference(&data, row_len, bpp),
|
||||
"case {case}: {colors} colours at {bits_per_component} bits, {columns} columns"
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn a_row_ending_part_way_through_a_pixel_keeps_its_last_byte() {
|
||||
// Three 4-bit samples are a byte and a half, so a three-column row is five bytes and ends
|
||||
// half-way through a two-byte pixel. Each row is filtered Up.
|
||||
let data = [
|
||||
2, 10, 11, 12, 13, 14, //
|
||||
2, 20, 21, 22, 23, 24, //
|
||||
2, 30, 31, 32, 33, 34,
|
||||
];
|
||||
let params = PredictorParams {
|
||||
predictor: 15,
|
||||
colors: 3,
|
||||
bits_per_component: 4,
|
||||
columns: 3,
|
||||
early_change: false,
|
||||
};
|
||||
assert_eq!(
|
||||
apply_predictor(data.to_vec(), ¶ms).unwrap(),
|
||||
[10, 11, 12, 13, 14, 30, 32, 34, 36, 38, 60, 63, 66, 69, 72]
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn png_average_and_paeth_carry_the_left_pixel_across_a_wide_row() {
|
||||
// Three 16-bit samples (6 bytes) per pixel: the left neighbour is six bytes back.
|
||||
let row_len = 6 * 3;
|
||||
let mut data = vec![3u8];
|
||||
data.extend((0..row_len).map(|i| (i * 37 + 200) as u8));
|
||||
data.push(4);
|
||||
data.extend((0..row_len).map(|i| (255 - i * 11) as u8));
|
||||
let params = PredictorParams {
|
||||
predictor: 15,
|
||||
colors: 3,
|
||||
bits_per_component: 16,
|
||||
columns: 3,
|
||||
early_change: false,
|
||||
};
|
||||
assert_eq!(
|
||||
apply_predictor(data.clone(), ¶ms).unwrap(),
|
||||
reference(&data, row_len, 6)
|
||||
);
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user