OpenRCT2/src/openrct2/util/SawyerCoding.cpp

394 lines
12 KiB
C++
Raw Normal View History

2014-04-10 01:22:57 +02:00
/*****************************************************************************
* Copyright (c) 2014-2018 OpenRCT2 developers
2015-10-12 22:18:14 +02:00
*
* For a complete list of all authors, please refer to contributors.md
* Interested in contributing? Visit https://github.com/OpenRCT2/OpenRCT2
2015-10-12 22:18:14 +02:00
*
* OpenRCT2 is licensed under the GNU General Public License version 3.
2014-04-10 01:22:57 +02:00
*****************************************************************************/
2018-03-14 12:44:16 +01:00
#include <cstring>
2017-12-13 13:02:24 +01:00
#include "../core/Math.hpp"
2015-07-05 06:36:25 +02:00
#include "../platform/platform.h"
2018-01-02 18:58:43 +01:00
#include "../scenario/Scenario.h"
2017-12-13 13:02:24 +01:00
#include "SawyerCoding.h"
#include "Util.h"
2014-04-10 01:22:57 +02:00
2015-10-12 22:18:14 +02:00
static size_t decode_chunk_rle(const uint8* src_buffer, uint8* dst_buffer, size_t length);
2016-06-23 22:48:46 +02:00
static size_t decode_chunk_rle_with_size(const uint8* src_buffer, uint8* dst_buffer, size_t length, size_t dstSize);
2014-04-10 01:22:57 +02:00
2015-10-12 22:18:14 +02:00
static size_t encode_chunk_rle(const uint8 *src_buffer, uint8 *dst_buffer, size_t length);
static size_t encode_chunk_repeat(const uint8 *src_buffer, uint8 *dst_buffer, size_t length);
static void encode_chunk_rotate(uint8 *buffer, size_t length);
2016-11-28 10:59:01 +01:00
bool gUseRLE = true;
2015-10-12 22:18:14 +02:00
uint32 sawyercoding_calculate_checksum(const uint8* buffer, size_t length)
{
size_t i;
uint32 checksum = 0;
for (i = 0; i < length; i++)
checksum += buffer[i];
return checksum;
}
/**
*
* rct2: 0x006762E1
2015-10-12 22:18:14 +02:00
*
*/
2016-11-28 10:59:01 +01:00
size_t sawyercoding_write_chunk_buffer(uint8 *dst_file, const uint8* buffer, sawyercoding_chunk_header chunkHeader) {
uint8 *encode_buffer, *encode_buffer2;
if (gUseRLE == false) {
if (chunkHeader.encoding == CHUNK_ENCODING_RLE || chunkHeader.encoding == CHUNK_ENCODING_RLECOMPRESSED) {
chunkHeader.encoding = CHUNK_ENCODING_NONE;
}
}
switch (chunkHeader.encoding){
case CHUNK_ENCODING_NONE:
memcpy(dst_file, &chunkHeader, sizeof(sawyercoding_chunk_header));
dst_file += sizeof(sawyercoding_chunk_header);
memcpy(dst_file, buffer, chunkHeader.length);
//fwrite(&chunkHeader, sizeof(sawyercoding_chunk_header), 1, file);
//fwrite(buffer, 1, chunkHeader.length, file);
break;
case CHUNK_ENCODING_RLE:
2017-12-13 13:02:24 +01:00
encode_buffer = (uint8 *)malloc(0x600000);
chunkHeader.length = (uint32)encode_chunk_rle(buffer, encode_buffer, chunkHeader.length);
memcpy(dst_file, &chunkHeader, sizeof(sawyercoding_chunk_header));
dst_file += sizeof(sawyercoding_chunk_header);
memcpy(dst_file, encode_buffer, chunkHeader.length);
free(encode_buffer);
break;
case CHUNK_ENCODING_RLECOMPRESSED:
2017-12-13 13:02:24 +01:00
encode_buffer = (uint8 *)malloc(chunkHeader.length * 2);
encode_buffer2 = (uint8 *)malloc(0x600000);
chunkHeader.length = (uint32)encode_chunk_repeat(buffer, encode_buffer, chunkHeader.length);
chunkHeader.length = (uint32)encode_chunk_rle(encode_buffer, encode_buffer2, chunkHeader.length);
memcpy(dst_file, &chunkHeader, sizeof(sawyercoding_chunk_header));
dst_file += sizeof(sawyercoding_chunk_header);
memcpy(dst_file, encode_buffer2, chunkHeader.length);
free(encode_buffer2);
free(encode_buffer);
break;
case CHUNK_ENCODING_ROTATE:
2017-12-13 13:02:24 +01:00
encode_buffer = (uint8 *)malloc(chunkHeader.length);
memcpy(encode_buffer, buffer, chunkHeader.length);
encode_chunk_rotate(encode_buffer, chunkHeader.length);
memcpy(dst_file, &chunkHeader, sizeof(sawyercoding_chunk_header));
dst_file += sizeof(sawyercoding_chunk_header);
memcpy(dst_file, encode_buffer, chunkHeader.length);
free(encode_buffer);
break;
}
return chunkHeader.length + sizeof(sawyercoding_chunk_header);
}
2016-09-01 08:59:12 +02:00
size_t sawyercoding_decode_sv4(const uint8 *src, uint8 *dst, size_t length, size_t bufferLength)
{
// (0 to length - 4): RLE chunk
// (length - 4 to length): checksum
return decode_chunk_rle_with_size(src, dst, length - 4, bufferLength);
}
2016-09-01 08:59:12 +02:00
size_t sawyercoding_decode_sc4(const uint8 *src, uint8 *dst, size_t length, size_t bufferLength)
{
// Uncompress
size_t decodedLength = decode_chunk_rle_with_size(src, dst, length - 4, bufferLength);
// Decode
for (size_t i = 0x60018; i <= std::min(decodedLength - 1, (size_t)0x1F8353); i++)
dst[i] = dst[i] ^ 0x9C;
for (size_t i = 0x60018; i <= std::min(decodedLength - 1, (size_t)0x1F8350); i += 4) {
dst[i + 1] = ror8(dst[i + 1], 3);
uint32 *code = (uint32*)&dst[i];
*code = rol32(*code, 9);
}
return decodedLength;
}
2015-10-12 22:18:14 +02:00
size_t sawyercoding_encode_sv4(const uint8 *src, uint8 *dst, size_t length)
{
size_t encodedLength;
uint32 checksum;
// Encode
encodedLength = encode_chunk_rle(src, dst, length);
// Append checksum
checksum = sawyercoding_calculate_checksum(dst, encodedLength);
*((uint32*)&dst[encodedLength]) = checksum;
return encodedLength + 4;
}
2015-10-12 22:18:14 +02:00
size_t sawyercoding_decode_td6(const uint8 *src, uint8 *dst, size_t length)
{
return decode_chunk_rle(src, dst, length - 4);
}
2015-10-12 22:18:14 +02:00
size_t sawyercoding_encode_td6(const uint8* src, uint8* dst, size_t length){
size_t output_length = encode_chunk_rle(src, dst, length);
uint32 checksum = 0;
for (size_t i = 0; i < output_length; i++){
uint8 new_byte = ((checksum & 0xFF) + dst[i]) & 0xFF;
checksum = (checksum & 0xFFFFFF00) + new_byte;
checksum = rol32(checksum, 3);
}
checksum -= 0x1D4C1;
*((uint32*)&dst[output_length]) = checksum;
output_length += 4;
return output_length;
}
/* Based off of rct2: 0x006770C1 */
2017-01-04 22:17:08 +01:00
sint32 sawyercoding_validate_track_checksum(const uint8* src, size_t length){
uint32 file_checksum = *((uint32*)&src[length - 4]);
uint32 checksum = 0;
for (size_t i = 0; i < length - 4; i++){
uint8 new_byte = ((checksum & 0xFF) + src[i]) & 0xFF;
checksum = (checksum & 0xFFFFFF00) + new_byte;
checksum = rol32(checksum, 3);
}
if (checksum - 0x1D4C1 == file_checksum)
return 1; // .TD6
else if (checksum - 0x1A67C == file_checksum)
return 1; // .TD4
else if (checksum - 0x1A650 == file_checksum)
return 1; // .TD4
else
return 0;
}
#pragma region Decoding
2014-04-10 01:22:57 +02:00
/**
2015-10-12 22:18:14 +02:00
*
2014-04-10 01:22:57 +02:00
* rct2: 0x0067693A
*/
2015-10-12 22:18:14 +02:00
static size_t decode_chunk_rle(const uint8* src_buffer, uint8* dst_buffer, size_t length)
2014-04-10 01:22:57 +02:00
{
size_t count;
uint8 *dst, rleCodeByte;
dst = dst_buffer;
for (size_t i = 0; i < length; i++) {
rleCodeByte = src_buffer[i];
if (rleCodeByte & 128) {
i++;
count = 257 - rleCodeByte;
memset(dst, src_buffer[i], count);
dst = (uint8*)((uintptr_t)dst + count);
} else {
memcpy(dst, src_buffer + i + 1, rleCodeByte + 1);
dst = (uint8*)((uintptr_t)dst + rleCodeByte + 1);
i += rleCodeByte + 1;
}
}
// Return final size
return dst - dst_buffer;
2014-04-10 01:22:57 +02:00
}
2016-06-23 22:48:46 +02:00
/**
*
* rct2: 0x0067693A
*/
static size_t decode_chunk_rle_with_size(const uint8* src_buffer, uint8* dst_buffer, size_t length, size_t dstSize)
{
size_t count;
uint8 *dst, rleCodeByte;
dst = dst_buffer;
2017-07-31 22:13:24 +02:00
assert(length > 0);
assert(dstSize > 0);
for (size_t i = 0; i < length; i++) {
rleCodeByte = src_buffer[i];
if (rleCodeByte & 128) {
i++;
count = 257 - rleCodeByte;
assert(dst + count <= dst_buffer + dstSize);
2017-07-31 22:13:24 +02:00
assert(i < length);
memset(dst, src_buffer[i], count);
dst = (uint8*)((uintptr_t)dst + count);
} else {
assert(dst + rleCodeByte + 1 <= dst_buffer + dstSize);
2017-07-31 22:13:24 +02:00
assert(i + 1 < length);
memcpy(dst, src_buffer + i + 1, rleCodeByte + 1);
dst = (uint8*)((uintptr_t)dst + rleCodeByte + 1);
i += rleCodeByte + 1;
}
}
// Return final size
return dst - dst_buffer;
2016-06-23 22:48:46 +02:00
}
#pragma endregion
#pragma region Encoding
/**
* Ensure dst_buffer is bigger than src_buffer then resize afterwards
* returns length of dst_buffer
*/
2015-10-12 22:18:14 +02:00
static size_t encode_chunk_rle(const uint8 *src_buffer, uint8 *dst_buffer, size_t length)
{
const uint8* src = src_buffer;
uint8* dst = dst_buffer;
const uint8* end_src = src + length;
uint8 count = 0;
const uint8* src_norm_start = src;
while (src < end_src - 1){
if ((count && *src == src[1]) || count > 125){
*dst++ = count - 1;
memcpy(dst, src_norm_start, count);
dst += count;
src_norm_start += count;
count = 0;
}
if (*src == src[1]){
for (; (count < 125) && ((src + count) < end_src); count++){
if (*src != src[count]) break;
}
*dst++ = 257 - count;
*dst++ = *src;
src += count;
src_norm_start = src;
count = 0;
}
else{
count++;
src++;
}
}
if (src == end_src - 1)count++;
if (count){
*dst++ = count - 1;
memcpy(dst, src_norm_start, count);
dst += count;
}
return dst - dst_buffer;
}
2015-10-12 22:18:14 +02:00
static size_t encode_chunk_repeat(const uint8 *src_buffer, uint8 *dst_buffer, size_t length)
{
if (length == 0)
return 0;
size_t outLength = 0;
// Need to emit at least one byte, otherwise there is nothing to repeat
*dst_buffer++ = 255;
*dst_buffer++ = src_buffer[0];
outLength += 2;
// Iterate through remainder of the source buffer
for (size_t i = 1; i < length; ) {
size_t searchIndex = (i < 32) ? 0 : (i - 32);
size_t searchEnd = i - 1;
size_t bestRepeatIndex = 0;
size_t bestRepeatCount = 0;
for (size_t repeatIndex = searchIndex; repeatIndex <= searchEnd; repeatIndex++) {
size_t repeatCount = 0;
size_t maxRepeatCount = std::min(std::min((size_t)7, searchEnd - repeatIndex), length - i - 1);
// maxRepeatCount should not exceed length
assert(repeatIndex + maxRepeatCount < length);
assert(i + maxRepeatCount < length);
for (size_t j = 0; j <= maxRepeatCount; j++) {
if (src_buffer[repeatIndex + j] == src_buffer[i + j]) {
repeatCount++;
} else {
break;
}
}
if (repeatCount > bestRepeatCount) {
bestRepeatIndex = repeatIndex;
bestRepeatCount = repeatCount;
// Maximum repeat count is 8
if (repeatCount == 8)
break;
}
}
if (bestRepeatCount == 0) {
*dst_buffer++ = 255;
*dst_buffer++ = src_buffer[i];
outLength += 2;
i++;
} else {
*dst_buffer++ = (uint8)((bestRepeatCount - 1) | ((32 - (i - bestRepeatIndex)) << 3));
outLength++;
i += bestRepeatCount;
}
}
return outLength;
}
2015-10-12 22:18:14 +02:00
static void encode_chunk_rotate(uint8 *buffer, size_t length)
{
size_t i;
uint8 code = 1;
for (i = 0; i < length; i++) {
buffer[i] = rol8(buffer[i], code);
code = (code + 2) % 8;
}
}
#pragma endregion
2017-01-04 22:17:08 +01:00
sint32 sawyercoding_detect_file_type(const uint8 *src, size_t length)
{
size_t i;
// Currently can't detect TD4, as the checksum is the same as SC4 (need alternative method)
uint32 checksum = *((uint32*)&src[length - 4]);
uint32 actualChecksum = 0;
for (i = 0; i < length - 4; i++) {
actualChecksum = (actualChecksum & 0xFFFFFF00) | (((actualChecksum & 0xFF) + (uint8)src[i]) & 0xFF);
actualChecksum = rol32(actualChecksum, 3);
}
return sawyercoding_detect_rct1_version(checksum - actualChecksum);
}
2017-01-04 22:17:08 +01:00
sint32 sawyercoding_detect_rct1_version(sint32 gameVersion)
{
sint32 fileType = (gameVersion) > 0 ? FILE_TYPE_SV4 : FILE_TYPE_SC4;
gameVersion = abs(gameVersion);
if (gameVersion >= 108000 && gameVersion < 110000)
return (FILE_VERSION_RCT1 | fileType);
else if (gameVersion >= 110000 && gameVersion < 120000)
return (FILE_VERSION_RCT1_AA | fileType);
else if (gameVersion >= 120000 && gameVersion < 130000)
return (FILE_VERSION_RCT1_LL | fileType);
// RCTOA Acres sets this, and possibly some other user-created scenarios as well
else if (gameVersion == 0)
return (FILE_VERSION_RCT1_LL | fileType);
return -1;
2015-10-12 22:18:14 +02:00
}