mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 23:50:19 +00:00
120 lines
5.3 KiB
C++
120 lines
5.3 KiB
C++
|
/*
|
||
|
* Copyright (c) 2020-2021, the SerenityOS developers.
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions are met:
|
||
|
*
|
||
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
||
|
* list of conditions and the following disclaimer.
|
||
|
*
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||
|
* this list of conditions and the following disclaimer in the documentation
|
||
|
* and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include <AK/TestSuite.h>
|
||
|
|
||
|
#include <AK/Array.h>
|
||
|
#include <AK/Random.h>
|
||
|
#include <LibCompress/Gzip.h>
|
||
|
|
||
|
TEST_CASE(gzip_decompress_simple)
|
||
|
{
|
||
|
const Array<u8, 33> compressed {
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0x77, 0xff, 0x47, 0x5f, 0x02, 0xff, 0x2b, 0xcf,
|
||
|
0x2f, 0x4a, 0x31, 0x54, 0x48, 0x4c, 0x4a, 0x56, 0x28, 0x07, 0xb2, 0x8c,
|
||
|
0x00, 0xc2, 0x1d, 0x22, 0x15, 0x0f, 0x00, 0x00, 0x00
|
||
|
};
|
||
|
|
||
|
const u8 uncompressed[] = "word1 abc word2";
|
||
|
|
||
|
const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
|
||
|
EXPECT(decompressed.value().bytes() == (ReadonlyBytes { uncompressed, sizeof(uncompressed) - 1 }));
|
||
|
}
|
||
|
|
||
|
TEST_CASE(gzip_decompress_multiple_members)
|
||
|
{
|
||
|
const Array<u8, 52> compressed {
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0xe0, 0x03, 0x48, 0x5f, 0x02, 0xff, 0x4b, 0x4c,
|
||
|
0x4a, 0x4e, 0x4c, 0x4a, 0x06, 0x00, 0x4c, 0x99, 0x6e, 0x72, 0x06, 0x00,
|
||
|
0x00, 0x00, 0x1f, 0x8b, 0x08, 0x00, 0xe0, 0x03, 0x48, 0x5f, 0x02, 0xff,
|
||
|
0x4b, 0x4c, 0x4a, 0x4e, 0x4c, 0x4a, 0x06, 0x00, 0x4c, 0x99, 0x6e, 0x72,
|
||
|
0x06, 0x00, 0x00, 0x00
|
||
|
};
|
||
|
|
||
|
const u8 uncompressed[] = "abcabcabcabc";
|
||
|
|
||
|
const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
|
||
|
EXPECT(decompressed.value().bytes() == (ReadonlyBytes { uncompressed, sizeof(uncompressed) - 1 }));
|
||
|
}
|
||
|
|
||
|
TEST_CASE(gzip_decompress_zeroes)
|
||
|
{
|
||
|
const Array<u8, 161> compressed {
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0x6e, 0x7a, 0x4b, 0x5f, 0x02, 0xff, 0xed, 0xc1,
|
||
|
0x31, 0x01, 0x00, 0x00, 0x00, 0xc2, 0xa0, 0xf5, 0x4f, 0xed, 0x61, 0x0d,
|
||
|
0xa0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x6e, 0xcd, 0xcd, 0xe8,
|
||
|
0x7e, 0x00, 0x00, 0x02, 0x00
|
||
|
};
|
||
|
|
||
|
const Array<u8, 128 * 1024> uncompressed = { 0 };
|
||
|
|
||
|
const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
|
||
|
EXPECT(uncompressed == decompressed.value().bytes());
|
||
|
}
|
||
|
|
||
|
TEST_CASE(gzip_decompress_repeat_around_buffer)
|
||
|
{
|
||
|
const Array<u8, 70> compressed {
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0xc6, 0x74, 0x53, 0x5f, 0x02, 0xff, 0xed, 0xc1,
|
||
|
0x01, 0x0d, 0x00, 0x00, 0x0c, 0x02, 0xa0, 0xdb, 0xbf, 0xf4, 0x37, 0x6b,
|
||
|
0x08, 0x24, 0xdb, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0xca,
|
||
|
0xb8, 0x07, 0xcd, 0xe5, 0x38, 0xfa, 0x00, 0x80, 0x00, 0x00
|
||
|
};
|
||
|
|
||
|
Array<u8, 0x8000> uncompressed;
|
||
|
uncompressed.span().slice(0x0000, 0x0100).fill(1);
|
||
|
uncompressed.span().slice(0x0100, 0x7e00).fill(0);
|
||
|
uncompressed.span().slice(0x7f00, 0x0100).fill(1);
|
||
|
|
||
|
const auto decompressed = Compress::GzipDecompressor::decompress_all(compressed);
|
||
|
EXPECT(uncompressed == decompressed.value().bytes());
|
||
|
}
|
||
|
|
||
|
TEST_CASE(gzip_round_trip)
|
||
|
{
|
||
|
auto original = ByteBuffer::create_uninitialized(1024);
|
||
|
fill_with_random(original.data(), 1024);
|
||
|
auto compressed = Compress::GzipCompressor::compress_all(original);
|
||
|
EXPECT(compressed.has_value());
|
||
|
auto uncompressed = Compress::GzipDecompressor::decompress_all(compressed.value());
|
||
|
EXPECT(uncompressed.has_value());
|
||
|
EXPECT(uncompressed.value() == original);
|
||
|
}
|
||
|
|
||
|
TEST_MAIN(Gzip)
|