TestDeflate.cpp 6.2 KB

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