test-compress.cpp 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  1. /*
  2. * Copyright (c) 2020, the SerenityOS developers.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/TestSuite.h>
  27. #include <AK/Array.h>
  28. #include <AK/MemoryStream.h>
  29. #include <LibCompress/Deflate.h>
  30. #include <LibCompress/Gzip.h>
  31. #include <LibCompress/Zlib.h>
  32. static bool compare(ReadonlyBytes lhs, ReadonlyBytes rhs)
  33. {
  34. if (lhs.size() != rhs.size())
  35. return false;
  36. for (size_t idx = 0; idx < lhs.size(); ++idx) {
  37. if (lhs[idx] != rhs[idx])
  38. return false;
  39. }
  40. return true;
  41. }
  42. TEST_CASE(canonical_code_simple)
  43. {
  44. const Array<u8, 32> code {
  45. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
  46. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
  47. 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05
  48. };
  49. const Array<u8, 6> input {
  50. 0x00, 0x42, 0x84, 0xa9, 0xb0, 0x15
  51. };
  52. const Array<u32, 9> output {
  53. 0x00, 0x01, 0x01, 0x02, 0x03, 0x05, 0x08, 0x0d, 0x15
  54. };
  55. const auto huffman = Compress::CanonicalCode::from_bytes(code).value();
  56. auto memory_stream = InputMemoryStream { input };
  57. auto bit_stream = InputBitStream { memory_stream };
  58. for (size_t idx = 0; idx < 9; ++idx)
  59. EXPECT_EQ(huffman.read_symbol(bit_stream), output[idx]);
  60. }
  61. TEST_CASE(canonical_code_complex)
  62. {
  63. const Array<u8, 6> code {
  64. 0x03, 0x02, 0x03, 0x03, 0x02, 0x03
  65. };
  66. const Array<u8, 4> input {
  67. 0xa1, 0xf3, 0xa1, 0xf3
  68. };
  69. const Array<u32, 12> output {
  70. 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05
  71. };
  72. const auto huffman = Compress::CanonicalCode::from_bytes(code).value();
  73. auto memory_stream = InputMemoryStream { input };
  74. auto bit_stream = InputBitStream { memory_stream };
  75. for (size_t idx = 0; idx < 12; ++idx)
  76. EXPECT_EQ(huffman.read_symbol(bit_stream), output[idx]);
  77. }
  78. TEST_CASE(deflate_decompress_compressed_block)
  79. {
  80. const Array<u8, 28> compressed {
  81. 0x0B, 0xC9, 0xC8, 0x2C, 0x56, 0x00, 0xA2, 0x44, 0x85, 0xE2, 0xCC, 0xDC,
  82. 0x82, 0x9C, 0x54, 0x85, 0x92, 0xD4, 0x8A, 0x12, 0x85, 0xB4, 0x4C, 0x20,
  83. 0xCB, 0x4A, 0x13, 0x00
  84. };
  85. const u8 uncompressed[] = "This is a simple text file :)";
  86. const auto decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  87. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  88. }
  89. TEST_CASE(deflate_decompress_uncompressed_block)
  90. {
  91. const Array<u8, 18> compressed {
  92. 0x01, 0x0d, 0x00, 0xf2, 0xff, 0x48, 0x65, 0x6c, 0x6c, 0x6f, 0x2c, 0x20,
  93. 0x57, 0x6f, 0x72, 0x6c, 0x64, 0x21
  94. };
  95. const u8 uncompressed[] = "Hello, World!";
  96. const auto decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  97. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  98. }
  99. TEST_CASE(deflate_decompress_multiple_blocks)
  100. {
  101. const Array<u8, 84> compressed {
  102. 0x00, 0x1f, 0x00, 0xe0, 0xff, 0x54, 0x68, 0x65, 0x20, 0x66, 0x69, 0x72,
  103. 0x73, 0x74, 0x20, 0x62, 0x6c, 0x6f, 0x63, 0x6b, 0x20, 0x69, 0x73, 0x20,
  104. 0x75, 0x6e, 0x63, 0x6f, 0x6d, 0x70, 0x72, 0x65, 0x73, 0x73, 0x65, 0x64,
  105. 0x53, 0x48, 0xcc, 0x4b, 0x51, 0x28, 0xc9, 0x48, 0x55, 0x28, 0x4e, 0x4d,
  106. 0xce, 0x07, 0x32, 0x93, 0x72, 0xf2, 0x93, 0xb3, 0x15, 0x32, 0x8b, 0x15,
  107. 0x92, 0xf3, 0x73, 0x0b, 0x8a, 0x52, 0x8b, 0x8b, 0x53, 0x53, 0xf4, 0x00
  108. };
  109. const u8 uncompressed[] = "The first block is uncompressed and the second block is compressed.";
  110. const auto decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  111. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  112. }
  113. TEST_CASE(deflate_decompress_zeroes)
  114. {
  115. const Array<u8, 20> compressed {
  116. 0xed, 0xc1, 0x01, 0x0d, 0x00, 0x00, 0x00, 0xc2, 0xa0, 0xf7, 0x4f, 0x6d,
  117. 0x0f, 0x07, 0x14, 0x00, 0x00, 0x00, 0xf0, 0x6e
  118. };
  119. const Array<u8, 4096> uncompressed { 0 };
  120. const auto decompressed = Compress::DeflateDecompressor::decompress_all(compressed);
  121. EXPECT(compare(uncompressed, decompressed.value().bytes()));
  122. }
  123. TEST_CASE(zlib_decompress_simple)
  124. {
  125. const Array<u8, 40> compressed {
  126. 0x78, 0x01, 0x01, 0x1D, 0x00, 0xE2, 0xFF, 0x54, 0x68, 0x69, 0x73, 0x20,
  127. 0x69, 0x73, 0x20, 0x61, 0x20, 0x73, 0x69, 0x6D, 0x70, 0x6C, 0x65, 0x20,
  128. 0x74, 0x65, 0x78, 0x74, 0x20, 0x66, 0x69, 0x6C, 0x65, 0x20, 0x3A, 0x29,
  129. 0x99, 0x5E, 0x09, 0xE8
  130. };
  131. const u8 uncompressed[] = "This is a simple text file :)";
  132. const auto decompressed = Compress::Zlib::decompress_all(compressed);
  133. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  134. }
  135. TEST_CASE(gzip_decompress_simple)
  136. {
  137. const Array<u8, 33> compressed {
  138. 0x1f, 0x8b, 0x08, 0x00, 0x77, 0xff, 0x47, 0x5f, 0x02, 0xff, 0x2b, 0xcf,
  139. 0x2f, 0x4a, 0x31, 0x54, 0x48, 0x4c, 0x4a, 0x56, 0x28, 0x07, 0xb2, 0x8c,
  140. 0x00, 0xc2, 0x1d, 0x22, 0x15, 0x0f, 0x00, 0x00, 0x00
  141. };
  142. const u8 uncompressed[] = "word1 abc word2";
  143. const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
  144. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  145. }
  146. TEST_CASE(gzip_decompress_multiple_members)
  147. {
  148. const Array<u8, 52> compressed {
  149. 0x1f, 0x8b, 0x08, 0x00, 0xe0, 0x03, 0x48, 0x5f, 0x02, 0xff, 0x4b, 0x4c,
  150. 0x4a, 0x4e, 0x4c, 0x4a, 0x06, 0x00, 0x4c, 0x99, 0x6e, 0x72, 0x06, 0x00,
  151. 0x00, 0x00, 0x1f, 0x8b, 0x08, 0x00, 0xe0, 0x03, 0x48, 0x5f, 0x02, 0xff,
  152. 0x4b, 0x4c, 0x4a, 0x4e, 0x4c, 0x4a, 0x06, 0x00, 0x4c, 0x99, 0x6e, 0x72,
  153. 0x06, 0x00, 0x00, 0x00
  154. };
  155. const u8 uncompressed[] = "abcabcabcabc";
  156. const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
  157. EXPECT(compare({ uncompressed, sizeof(uncompressed) - 1 }, decompressed.value().bytes()));
  158. }
  159. TEST_CASE(gzip_decompress_zeroes)
  160. {
  161. const Array<u8, 161> compressed {
  162. 0x1f, 0x8b, 0x08, 0x00, 0x6e, 0x7a, 0x4b, 0x5f, 0x02, 0xff, 0xed, 0xc1,
  163. 0x31, 0x01, 0x00, 0x00, 0x00, 0xc2, 0xa0, 0xf5, 0x4f, 0xed, 0x61, 0x0d,
  164. 0xa0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  165. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  166. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  167. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  168. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  169. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  170. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  171. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  172. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  173. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  174. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x6e, 0xcd, 0xcd, 0xe8,
  175. 0x7e, 0x00, 0x00, 0x02, 0x00
  176. };
  177. const Array<u8, 128 * 1024> uncompressed = { 0 };
  178. const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
  179. EXPECT(compare(uncompressed, decompressed.value().bytes()));
  180. }
  181. TEST_CASE(gzip_decompress_repeat_around_buffer)
  182. {
  183. const Array<u8, 70> compressed {
  184. 0x1f, 0x8b, 0x08, 0x00, 0xc6, 0x74, 0x53, 0x5f, 0x02, 0xff, 0xed, 0xc1,
  185. 0x01, 0x0d, 0x00, 0x00, 0x0c, 0x02, 0xa0, 0xdb, 0xbf, 0xf4, 0x37, 0x6b,
  186. 0x08, 0x24, 0xdb, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  187. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  188. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0xca,
  189. 0xb8, 0x07, 0xcd, 0xe5, 0x38, 0xfa, 0x00, 0x80, 0x00, 0x00
  190. };
  191. Array<u8, 0x8000> uncompressed;
  192. uncompressed.span().slice(0x0000, 0x0100).fill(1);
  193. uncompressed.span().slice(0x0100, 0x7e00).fill(0);
  194. uncompressed.span().slice(0x7f00, 0x0100).fill(1);
  195. const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
  196. EXPECT(compare(uncompressed, decompressed.value().bytes()));
  197. }
  198. TEST_MAIN(Compress)