TestDeflate.cpp 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. /*
  2. * Copyright (c) 2020-2021, the SerenityOS developers.
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibTest/TestCase.h>
  7. #include <AK/Array.h>
  8. #include <AK/BitStream.h>
  9. #include <AK/Random.h>
  10. #include <LibCompress/Deflate.h>
  11. #include <LibCore/MemoryStream.h>
  12. #include <cstring>
  13. TEST_CASE(canonical_code_simple)
  14. {
  15. Array<u8, 32> const code {
  16. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
  17. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
  18. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05
  19. };
  20. Array<u8, 6> const input {
  21. 0x00, 0x42, 0x84, 0xa9, 0xb0, 0x15
  22. };
  23. Array<u32, 9> const output {
  24. 0x00, 0x01, 0x01, 0x02, 0x03, 0x05, 0x08, 0x0d, 0x15
  25. };
  26. auto const huffman = Compress::CanonicalCode::from_bytes(code).value();
  27. auto memory_stream = MUST(Core::Stream::FixedMemoryStream::construct(input));
  28. auto bit_stream = MUST(LittleEndianInputBitStream::construct(move(memory_stream)));
  29. for (size_t idx = 0; idx < 9; ++idx)
  30. EXPECT_EQ(MUST(huffman.read_symbol(*bit_stream)), output[idx]);
  31. }
  32. TEST_CASE(canonical_code_complex)
  33. {
  34. Array<u8, 6> const code {
  35. 0x03, 0x02, 0x03, 0x03, 0x02, 0x03
  36. };
  37. Array<u8, 4> const input {
  38. 0xa1, 0xf3, 0xa1, 0xf3
  39. };
  40. Array<u32, 12> const output {
  41. 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05
  42. };
  43. auto const huffman = Compress::CanonicalCode::from_bytes(code).value();
  44. auto memory_stream = MUST(Core::Stream::FixedMemoryStream::construct(input));
  45. auto bit_stream = MUST(LittleEndianInputBitStream::construct(move(memory_stream)));
  46. for (size_t idx = 0; idx < 12; ++idx)
  47. EXPECT_EQ(MUST(huffman.read_symbol(*bit_stream)), output[idx]);
  48. }
  49. TEST_CASE(deflate_decompress_compressed_block)
  50. {
  51. Array<u8, 28> const compressed {
  52. 0x0B, 0xC9, 0xC8, 0x2C, 0x56, 0x00, 0xA2, 0x44, 0x85, 0xE2, 0xCC, 0xDC,
  53. 0x82, 0x9C, 0x54, 0x85, 0x92, 0xD4, 0x8A, 0x12, 0x85, 0xB4, 0x4C, 0x20,
  54. 0xCB, 0x4A, 0x13, 0x00
  55. };
  56. const u8 uncompressed[] = "This is a simple text file :)";
  57. auto const decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  58. EXPECT(decompressed.value().bytes() == ReadonlyBytes({ uncompressed, sizeof(uncompressed) - 1 }));
  59. }
  60. TEST_CASE(deflate_decompress_uncompressed_block)
  61. {
  62. Array<u8, 18> const compressed {
  63. 0x01, 0x0d, 0x00, 0xf2, 0xff, 0x48, 0x65, 0x6c, 0x6c, 0x6f, 0x2c, 0x20,
  64. 0x57, 0x6f, 0x72, 0x6c, 0x64, 0x21
  65. };
  66. const u8 uncompressed[] = "Hello, World!";
  67. auto const decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  68. EXPECT(decompressed.value().bytes() == (ReadonlyBytes { uncompressed, sizeof(uncompressed) - 1 }));
  69. }
  70. TEST_CASE(deflate_decompress_multiple_blocks)
  71. {
  72. Array<u8, 84> const compressed {
  73. 0x00, 0x1f, 0x00, 0xe0, 0xff, 0x54, 0x68, 0x65, 0x20, 0x66, 0x69, 0x72,
  74. 0x73, 0x74, 0x20, 0x62, 0x6c, 0x6f, 0x63, 0x6b, 0x20, 0x69, 0x73, 0x20,
  75. 0x75, 0x6e, 0x63, 0x6f, 0x6d, 0x70, 0x72, 0x65, 0x73, 0x73, 0x65, 0x64,
  76. 0x53, 0x48, 0xcc, 0x4b, 0x51, 0x28, 0xc9, 0x48, 0x55, 0x28, 0x4e, 0x4d,
  77. 0xce, 0x07, 0x32, 0x93, 0x72, 0xf2, 0x93, 0xb3, 0x15, 0x32, 0x8b, 0x15,
  78. 0x92, 0xf3, 0x73, 0x0b, 0x8a, 0x52, 0x8b, 0x8b, 0x53, 0x53, 0xf4, 0x00
  79. };
  80. const u8 uncompressed[] = "The first block is uncompressed and the second block is compressed.";
  81. auto const decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  82. EXPECT(decompressed.value().bytes() == (ReadonlyBytes { uncompressed, sizeof(uncompressed) - 1 }));
  83. }
  84. TEST_CASE(deflate_decompress_zeroes)
  85. {
  86. Array<u8, 20> const compressed {
  87. 0xed, 0xc1, 0x01, 0x0d, 0x00, 0x00, 0x00, 0xc2, 0xa0, 0xf7, 0x4f, 0x6d,
  88. 0x0f, 0x07, 0x14, 0x00, 0x00, 0x00, 0xf0, 0x6e
  89. };
  90. Array<u8, 4096> const uncompressed { 0 };
  91. auto const decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  92. EXPECT(uncompressed == decompressed.value().bytes());
  93. }
  94. TEST_CASE(deflate_round_trip_store)
  95. {
  96. auto original = ByteBuffer::create_uninitialized(1024).release_value();
  97. fill_with_random(original.data(), 1024);
  98. auto compressed = Compress::DeflateCompressor::compress_all(original, Compress::DeflateCompressor::CompressionLevel::STORE);
  99. EXPECT(!compressed.is_error());
  100. auto uncompressed = Compress::DeflateDecompressor::decompress_all(compressed.value());
  101. EXPECT(!uncompressed.is_error());
  102. EXPECT(uncompressed.value() == original);
  103. }
  104. TEST_CASE(deflate_round_trip_compress)
  105. {
  106. auto original = ByteBuffer::create_zeroed(2048).release_value();
  107. fill_with_random(original.data(), 1024); // we pre-filled the second half with 0s to make sure we test back references as well
  108. // Since the different levels just change how much time is spent looking for better matches, just use fast here to reduce test time
  109. auto compressed = Compress::DeflateCompressor::compress_all(original, Compress::DeflateCompressor::CompressionLevel::FAST);
  110. EXPECT(!compressed.is_error());
  111. auto uncompressed = Compress::DeflateDecompressor::decompress_all(compressed.value());
  112. EXPECT(!uncompressed.is_error());
  113. EXPECT(uncompressed.value() == original);
  114. }
  115. TEST_CASE(deflate_round_trip_compress_large)
  116. {
  117. auto size = Compress::DeflateCompressor::block_size * 2;
  118. auto original = ByteBuffer::create_uninitialized(size).release_value(); // Compress a buffer larger than the maximum block size to test the sliding window mechanism
  119. fill_with_random(original.data(), size);
  120. // Since the different levels just change how much time is spent looking for better matches, just use fast here to reduce test time
  121. auto compressed = Compress::DeflateCompressor::compress_all(original, Compress::DeflateCompressor::CompressionLevel::FAST);
  122. EXPECT(!compressed.is_error());
  123. auto uncompressed = Compress::DeflateDecompressor::decompress_all(compressed.value());
  124. EXPECT(!uncompressed.is_error());
  125. EXPECT(uncompressed.value() == original);
  126. }
  127. TEST_CASE(deflate_compress_literals)
  128. {
  129. // This byte array is known to not produce any back references with our lz77 implementation even at the highest compression settings
  130. Array<u8, 0x13> test { 0, 0, 0, 0, 0x72, 0, 0, 0xee, 0, 0, 0, 0x26, 0, 0, 0, 0x28, 0, 0, 0x72 };
  131. auto compressed = Compress::DeflateCompressor::compress_all(test, Compress::DeflateCompressor::CompressionLevel::GOOD);
  132. EXPECT(!compressed.is_error());
  133. }