89 lines
1.9 KiB
C++
89 lines
1.9 KiB
C++
#include "memory/dl_memory.h"
|
|
|
|
#include <cassert>
|
|
|
|
#include <lz4.h>
|
|
|
|
#include "math/dl_algorithm.h"
|
|
|
|
|
|
namespace dl::Memory
|
|
{
|
|
|
|
Buffer CompressLz4(BufferView unzip, double speed)
|
|
{
|
|
if (!is_saturate(speed))
|
|
{
|
|
speed = saturate(speed);
|
|
}
|
|
int zip_max_size = LZ4_compressBound((int)unzip.size());
|
|
|
|
Buffer ret;
|
|
ret.resize((size_t)zip_max_size);
|
|
|
|
int zip_size = LZ4_compress_fast((char*)unzip.data(), (char*)ret.data(), (int)unzip.size(), zip_max_size, (int)(speed * 65536 + 1));
|
|
assert(zip_size >= 0);
|
|
ret.resize((size_t)zip_size);
|
|
|
|
return ret;
|
|
}
|
|
|
|
Buffer DecompressLz4(BufferView zip, size_t size_unzip)
|
|
{
|
|
if (size_unzip == 0)
|
|
{//未传递原始大小
|
|
constexpr size_t K = 4; //猜测比例
|
|
Buffer ret;
|
|
int unzip_size;//解压后大小 -1代表失败
|
|
size_unzip = zip.size();//缓冲区大小
|
|
|
|
do
|
|
{
|
|
unzip_size = -1;
|
|
size_unzip *= K;
|
|
ret.resize(size_unzip);
|
|
|
|
unzip_size = LZ4_decompress_safe((char*)zip.data(), (char*)ret.data(), (int)zip.size(), (int)size_unzip);
|
|
if (unzip_size < 0)
|
|
{//输出区太小,或者编码错误
|
|
if (size_unzip > zip.size() * 1024)
|
|
{//超过原始大小1000倍,我们就认为是编码错误了(似乎没有更好的判断方法)
|
|
//参见https://github.com/lz4/lz4/issues/156
|
|
ret.clear();
|
|
return ret;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
ret.resize(unzip_size);
|
|
return ret;
|
|
}
|
|
} while (true);
|
|
}
|
|
else
|
|
{
|
|
Buffer ret;
|
|
ret.resize(size_unzip);
|
|
|
|
int unzip_size = LZ4_decompress_safe((char*)zip.data(), (char*)ret.data(), (int)zip.size(), (int)size_unzip);
|
|
ret.resize((size_t)unzip_size);
|
|
|
|
return ret;
|
|
}
|
|
}
|
|
|
|
void TestLz4()
|
|
{
|
|
std::string str("abcabcabcabcabc");
|
|
BufferView buf = CreateBufferView(str);
|
|
Buffer zip = Memory::CompressLz4(buf);
|
|
Buffer unzip = Memory::DecompressLz4(zip);
|
|
zip.clear();
|
|
zip.shrink_to_fit();
|
|
std::string str1 = CreateString(unzip);
|
|
unzip.clear();
|
|
unzip.shrink_to_fit();
|
|
assert(str == str1);
|
|
}
|
|
|
|
} |