/* * Copyright (c) 2024, Nico Weber * * SPDX-License-Identifier: BSD-2-Clause */ // Lossless format: https://developers.google.com/speed/webp/docs/webp_lossless_bitstream_specification #include #include #include #include #include #include #include #include namespace Gfx { static bool are_all_pixels_opaque(Bitmap const& bitmap) { for (ARGB32 pixel : bitmap) { if ((pixel >> 24) != 0xff) return false; } return true; } NEVER_INLINE static ErrorOr write_image_data(LittleEndianOutputBitStream& bit_stream, Bitmap const& bitmap, PrefixCodeGroup const& prefix_code_group) { // This is currently the hot loop. Keep performance in mind when you change it. for (ARGB32 pixel : bitmap) { u8 a = pixel >> 24; u8 r = pixel >> 16; u8 g = pixel >> 8; u8 b = pixel; TRY(prefix_code_group[0].write_symbol(bit_stream, g)); TRY(prefix_code_group[1].write_symbol(bit_stream, r)); TRY(prefix_code_group[2].write_symbol(bit_stream, b)); TRY(prefix_code_group[3].write_symbol(bit_stream, a)); } return {}; } static ErrorOr write_VP8L_image_data(Stream& stream, Bitmap const& bitmap) { LittleEndianOutputBitStream bit_stream { MaybeOwned(stream) }; // optional-transform = (%b1 transform optional-transform) / %b0 TRY(bit_stream.write_bits(0u, 1u)); // No transform for now. // https://developers.google.com/speed/webp/docs/webp_lossless_bitstream_specification#5_image_data // spatially-coded-image = color-cache-info meta-prefix data // color-cache-info = %b0 // color-cache-info =/ (%b1 4BIT) ; 1 followed by color cache size TRY(bit_stream.write_bits(0u, 1u)); // No color cache for now. // meta-prefix = %b0 / (%b1 entropy-image) TRY(bit_stream.write_bits(0u, 1u)); // No meta prefix for now. // data = prefix-codes lz77-coded-image // prefix-codes = prefix-code-group *prefix-codes // prefix-code-group = // 5prefix-code ; See "Interpretation of Meta Prefix Codes" to // ; understand what each of these five prefix // ; codes are for. // We're writing a single prefix-code-group. // "These codes are (in bitstream order): // Prefix code #1: Used for green channel, backward-reference length, and color cache. // Prefix code #2, #3, and #4: Used for red, blue, and alpha channels, respectively. // Prefix code #5: Used for backward-reference distance." // We use neither back-references not color cache entries yet. // We write prefix trees for 256 literals all of length 8, which means each byte is encoded as itself. // That doesn't give any compression, but is a valid bit stream. // We can make this smarter later on. size_t const color_cache_size = 0; constexpr Array alphabet_sizes = to_array({ 256 + 24 + static_cast(color_cache_size), 256, 256, 256, 40 }); // XXX Shared? // If you add support for color cache: At the moment, CanonicalCodes does not support writing more than 288 symbols. if (alphabet_sizes[0] > 288) return Error::from_string_literal("Invalid alphabet size"); bool all_pixels_are_opaque = are_all_pixels_opaque(bitmap); PrefixCodeGroup prefix_code_group; int number_of_full_channels = all_pixels_are_opaque ? 3 : 4; for (int i = 0; i < number_of_full_channels; ++i) { TRY(bit_stream.write_bits(0u, 1u)); // Normal code length code. // Write code length codes. constexpr int kCodeLengthCodes = 19; Array kCodeLengthCodeOrder = { 17, 18, 0, 1, 2, 3, 4, 5, 16, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }; int num_code_lengths = max(4u, find_index(kCodeLengthCodeOrder.begin(), kCodeLengthCodeOrder.end(), 8) + 1); // "int num_code_lengths = 4 + ReadBits(4);" TRY(bit_stream.write_bits(num_code_lengths - 4u, 4u)); for (int i = 0; i < num_code_lengths - 1; ++i) TRY(bit_stream.write_bits(0u, 3u)); TRY(bit_stream.write_bits(1u, 3u)); // Write code lengths. if (alphabet_sizes[i] == 256) { TRY(bit_stream.write_bits(0u, 1u)); // max_symbol is alphabet_size } else { TRY(bit_stream.write_bits(1u, 1u)); // max_symbol is explicitly coded // "int length_nbits = 2 + 2 * ReadBits(3); // int max_symbol = 2 + ReadBits(length_nbits);" TRY(bit_stream.write_bits(3u, 3u)); // length_nbits = 2 + 2 * 3 TRY(bit_stream.write_bits(254u, 8u)); // max_symbol = 2 + 254 } auto bits_per_symbol = Array::from_repeated_value(8); prefix_code_group[i] = TRY(CanonicalCode::from_bytes(bits_per_symbol)); // The code length codes only contain a single entry for '8'. WebP streams with a single element store 0 bits per element. // (This is different from deflate, which needs 1 bit per element.) } if (all_pixels_are_opaque) { // Use a simple 1-element code. TRY(bit_stream.write_bits(1u, 1u)); // Simple code length code. TRY(bit_stream.write_bits(0u, 1u)); // num_symbols - 1 TRY(bit_stream.write_bits(1u, 1u)); // is_first_8bits TRY(bit_stream.write_bits(255u, 8u)); // symbol0 Array bits_per_symbol {}; // "When coding a single leaf node [...], all but one code length are zeros, and the single leaf node value // is marked with the length of 1 -- even when no bits are consumed when that single leaf node tree is used." // CanonicalCode follows that convention too, even when describing simple code lengths. bits_per_symbol[255] = 1; prefix_code_group[3] = TRY(CanonicalCode::from_bytes(bits_per_symbol)); } // For code #5, use a simple empty code, since we don't use this yet. // "Note: Another special case is when all prefix code lengths are zeros (an empty prefix code). [...] // empty prefix codes can be coded as those containing a single symbol 0." TRY(bit_stream.write_bits(1u, 1u)); // Simple code length code. TRY(bit_stream.write_bits(0u, 1u)); // num_symbols - 1 TRY(bit_stream.write_bits(0u, 1u)); // is_first_8bits TRY(bit_stream.write_bits(0u, 1u)); // symbol0 Array bits_per_symbol {}; bits_per_symbol[0] = 1; // See comment in `if (all_pixels_are_opaque)` block above. prefix_code_group[4] = TRY(CanonicalCode::from_bytes(bits_per_symbol)); // Image data. TRY(write_image_data(bit_stream, bitmap, prefix_code_group)); // FIXME: Make ~LittleEndianOutputBitStream do this, or make it VERIFY() that it has happened at least. TRY(bit_stream.align_to_byte_boundary()); TRY(bit_stream.flush_buffer_to_stream()); return {}; } ErrorOr compress_VP8L_image_data(Bitmap const& bitmap) { AllocatingMemoryStream vp8l_data_stream; TRY(write_VP8L_image_data(vp8l_data_stream, bitmap)); return vp8l_data_stream.read_until_eof(); } }