199 lines
12 KiB
C
199 lines
12 KiB
C
|
//diff.h
|
||
|
|
//
|
||
|
|
/*
|
||
|
|
The MIT License (MIT)
|
||
|
|
Copyright (c) 2012-2018 HouSisong
|
||
|
|
|
||
|
|
Permission is hereby granted, free of charge, to any person
|
||
|
|
obtaining a copy of this software and associated documentation
|
||
|
|
files (the "Software"), to deal in the Software without
|
||
|
|
restriction, including without limitation the rights to use,
|
||
|
|
copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||
|
|
copies of the Software, and to permit persons to whom the
|
||
|
|
Software is furnished to do so, subject to the following
|
||
|
|
conditions:
|
||
|
|
|
||
|
|
The above copyright notice and this permission notice shall be
|
||
|
|
included in all copies or substantial portions of the Software.
|
||
|
|
|
||
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||
|
|
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
||
|
|
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||
|
|
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
||
|
|
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||
|
|
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
|
|
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
||
|
|
OTHER DEALINGS IN THE SOFTWARE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef HDiff_diff_h
|
||
|
|
#define HDiff_diff_h
|
||
|
|
#include <vector>
|
||
|
|
#include "diff_types.h"
|
||
|
|
|
||
|
|
static const int kMinSingleMatchScore_default = 6;
|
||
|
|
|
||
|
|
//create a diff data between oldData and newData
|
||
|
|
// out_diff is uncompressed, you can use create_compressed_diff()
|
||
|
|
// or create_single_compressed_diff() create compressed diff data
|
||
|
|
// recommended always use create_single_compressed_diff() replace create_diff()
|
||
|
|
// kMinSingleMatchScore: default 6, bin: 0--4 text: 4--9
|
||
|
|
// isUseBigCacheMatch: big cache max used O(oldSize) memory, match speed faster, but build big cache slow
|
||
|
|
void create_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
std::vector<unsigned char>& out_diff,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
bool isUseBigCacheMatch=false,size_t threadNum=1);
|
||
|
|
|
||
|
|
//return patch(oldData+diff)==newData?
|
||
|
|
bool check_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
const unsigned char* diff,const unsigned char* diff_end);
|
||
|
|
bool check_diff(const hpatch_TStreamInput* newData,
|
||
|
|
const hpatch_TStreamInput* oldData,
|
||
|
|
const hpatch_TStreamInput* diff);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
//create a compressed diff data between oldData and newData
|
||
|
|
// out_diff compressed by compressPlugin
|
||
|
|
// recommended always use create_single_compressed_diff() replace create_compressed_diff()
|
||
|
|
// kMinSingleMatchScore: default 6, bin: 0--4 text: 4--9
|
||
|
|
// isUseBigCacheMatch: big cache max used O(oldSize) memory, match speed faster, but build big cache slow
|
||
|
|
void create_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
std::vector<unsigned char>& out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin=0,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
bool isUseBigCacheMatch=false,
|
||
|
|
ICoverLinesListener* listener=0,size_t threadNum=1);
|
||
|
|
void create_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
const hpatch_TStreamOutput* out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin=0,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
bool isUseBigCacheMatch=false,
|
||
|
|
ICoverLinesListener* listener=0,size_t threadNum=1);
|
||
|
|
|
||
|
|
//create a compressed diff data by stream:
|
||
|
|
// can control memory requires and run speed by different kMatchBlockSize value,
|
||
|
|
// but out_diff size is larger than create_compressed_diff()
|
||
|
|
// recommended used in limited environment or support large file
|
||
|
|
// recommended always use create_single_compressed_diff_stream() replace create_compressed_diff_stream()
|
||
|
|
// kMatchBlockSize: recommended (1<<4)--(1<<14)
|
||
|
|
// if increase kMatchBlockSize then run faster and require less memory, but out_diff size increase
|
||
|
|
// NOTICE: out_diff->write()'s writeToPos may be back to update headData!
|
||
|
|
// throw std::runtime_error when I/O error,etc.
|
||
|
|
static const size_t kMatchBlockSize_default = (1<<6);
|
||
|
|
static const size_t kMatchBlockSize_min=4;
|
||
|
|
void create_compressed_diff_stream(const hpatch_TStreamInput* newData,
|
||
|
|
const hpatch_TStreamInput* oldData,
|
||
|
|
const hpatch_TStreamOutput* out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin=0,
|
||
|
|
size_t kMatchBlockSize=kMatchBlockSize_default,
|
||
|
|
const hdiff_TMTSets_s* mtsets=0);
|
||
|
|
|
||
|
|
//return patch_decompress(oldData+diff)==newData?
|
||
|
|
bool check_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
const unsigned char* diff,const unsigned char* diff_end,
|
||
|
|
hpatch_TDecompress* decompressPlugin);
|
||
|
|
bool check_compressed_diff(const hpatch_TStreamInput* newData,
|
||
|
|
const hpatch_TStreamInput* oldData,
|
||
|
|
const hpatch_TStreamInput* compressed_diff,
|
||
|
|
hpatch_TDecompress* decompressPlugin);
|
||
|
|
// check_compressed_diff_stream rename to check_compressed_diff
|
||
|
|
|
||
|
|
//resave compressed_diff
|
||
|
|
// decompress in_diff and recompress to out_diff
|
||
|
|
// throw std::runtime_error when input file error or I/O error,etc.
|
||
|
|
void resave_compressed_diff(const hpatch_TStreamInput* in_diff,
|
||
|
|
hpatch_TDecompress* decompressPlugin,
|
||
|
|
const hpatch_TStreamOutput* out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin,
|
||
|
|
hpatch_StreamPos_t out_diff_curPos=0);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
static const size_t kDefaultPatchStepMemSize =1024*256;
|
||
|
|
|
||
|
|
//create a diff data between oldData and newData, the diffData saved as single compressed stream
|
||
|
|
// kMinSingleMatchScore: default 6, bin: 0--4 text: 4--9
|
||
|
|
// patchStepMemSize>=hpatch_kStreamCacheSize, default 256k, recommended 64k,2m etc...
|
||
|
|
// isUseBigCacheMatch: big cache max used O(oldSize) memory, match speed faster, but build big cache slow
|
||
|
|
void create_single_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
std::vector<unsigned char>& out_diff,const hdiff_TCompress* compressPlugin=0,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
size_t patchStepMemSize=kDefaultPatchStepMemSize,
|
||
|
|
bool isUseBigCacheMatch=false,
|
||
|
|
ICoverLinesListener* listener=0,size_t threadNum=1);
|
||
|
|
void create_single_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
const hpatch_TStreamOutput* out_diff,const hdiff_TCompress* compressPlugin=0,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
size_t patchStepMemSize=kDefaultPatchStepMemSize,
|
||
|
|
bool isUseBigCacheMatch=false,
|
||
|
|
ICoverLinesListener* listener=0,size_t threadNum=1);
|
||
|
|
//create single compressed diff data by stream:
|
||
|
|
// can control memory requires and run speed by different kMatchBlockSize value,
|
||
|
|
// but out_diff size is larger than create_single_compressed_diff()
|
||
|
|
// recommended used in limited environment or support large file
|
||
|
|
// kMatchBlockSize: recommended (1<<4)--(1<<14)
|
||
|
|
// if increase kMatchBlockSize then run faster and require less memory, but out_diff size increase
|
||
|
|
// NOTICE: out_diff->write()'s writeToPos may be back to update headData!
|
||
|
|
// throw std::runtime_error when I/O error,etc.
|
||
|
|
void create_single_compressed_diff_stream(const hpatch_TStreamInput* newData,
|
||
|
|
const hpatch_TStreamInput* oldData,
|
||
|
|
const hpatch_TStreamOutput* out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin=0,
|
||
|
|
size_t kMatchBlockSize=kMatchBlockSize_default,
|
||
|
|
size_t patchStepMemSize=kDefaultPatchStepMemSize,
|
||
|
|
const hdiff_TMTSets_s* mtsets=0);
|
||
|
|
|
||
|
|
//return patch_single_?(oldData+diff)==newData?
|
||
|
|
bool check_single_compressed_diff(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
const unsigned char* diff,const unsigned char* diff_end,
|
||
|
|
hpatch_TDecompress* decompressPlugin);
|
||
|
|
bool check_single_compressed_diff(const hpatch_TStreamInput* newData,
|
||
|
|
const hpatch_TStreamInput* oldData,
|
||
|
|
const hpatch_TStreamInput* diff,
|
||
|
|
hpatch_TDecompress* decompressPlugin);
|
||
|
|
|
||
|
|
//resave single_compressed_diff
|
||
|
|
// decompress in_diff and recompress to out_diff
|
||
|
|
// throw std::runtime_error when input file error or I/O error,etc.
|
||
|
|
void resave_single_compressed_diff(const hpatch_TStreamInput* in_diff,
|
||
|
|
hpatch_TDecompress* decompressPlugin,
|
||
|
|
const hpatch_TStreamOutput* out_diff,
|
||
|
|
const hdiff_TCompress* compressPlugin,
|
||
|
|
const hpatch_singleCompressedDiffInfo* diffInfo=0,
|
||
|
|
hpatch_StreamPos_t in_diff_curPos=0,
|
||
|
|
hpatch_StreamPos_t out_diff_curPos=0);
|
||
|
|
|
||
|
|
|
||
|
|
//same as create?compressed_diff_stream(), but not serialize diffData, only got covers
|
||
|
|
void get_match_covers_by_block(const hpatch_TStreamInput* newData,const hpatch_TStreamInput* oldData,
|
||
|
|
hpatch_TOutputCovers* out_covers,size_t kMatchBlockSize,const hdiff_TMTSets_s* mtsets);
|
||
|
|
void get_match_covers_by_block(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
hpatch_TOutputCovers* out_covers,size_t kMatchBlockSize,size_t threadNum);
|
||
|
|
|
||
|
|
//same as create?_diff(), but not serialize diffData, only got covers
|
||
|
|
void get_match_covers_by_sstring(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
hpatch_TOutputCovers* out_covers,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
bool isUseBigCacheMatch=false,ICoverLinesListener* listener=0,
|
||
|
|
size_t threadNum=1,bool isCanExtendCover=true);
|
||
|
|
void get_match_covers_by_sstring(const unsigned char* newData,const unsigned char* newData_end,
|
||
|
|
const unsigned char* oldData,const unsigned char* oldData_end,
|
||
|
|
std::vector<hpatch_TCover_sz>& out_covers,
|
||
|
|
int kMinSingleMatchScore=kMinSingleMatchScore_default,
|
||
|
|
bool isUseBigCacheMatch=false,ICoverLinesListener* listener=0,
|
||
|
|
size_t threadNum=1,bool isCanExtendCover=true);
|
||
|
|
#endif
|