1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
|
#include "CRC.h"
namespace BT_NAMESPACE {
#ifdef HASH_ARRAY_2
static const UINT32 kHash2Size = 1 << 10;
#ifdef HASH_ARRAY_3
static const UINT32 kNumHashDirectBytes = 0;
static const UINT32 kNumHashBytes = 4;
static const UINT32 kHash3Size = 1 << 18;
#ifdef HASH_BIG
static const UINT32 kHashSize = 1 << 23;
#else
static const UINT32 kHashSize = 1 << 20;
#endif
#else
static const UINT32 kNumHashDirectBytes = 3;
static const UINT32 kNumHashBytes = 3;
static const UINT32 kHashSize = 1 << (8 * kNumHashBytes);
#endif
#else
#ifdef HASH_ZIP
static const UINT32 kNumHashDirectBytes = 0;
static const UINT32 kNumHashBytes = 3;
static const UINT32 kHashSize = 1 << 16;
#else
static const UINT32 kNumHashDirectBytes = 2;
static const UINT32 kNumHashBytes = 2;
static const UINT32 kHashSize = 1 << (8 * kNumHashBytes);
#endif
#endif
CInTree::CInTree():
#ifdef HASH_ARRAY_2
m_Hash2(0),
#ifdef HASH_ARRAY_3
m_Hash3(0),
#endif
#endif
m_Hash(0),
m_Base(0),
m_CutValue(0xFF)
{
}
void CInTree::FreeMemory()
{
if (m_Base != 0)
delete [] m_Base;
if (m_Hash != 0)
delete [] m_Hash;
m_Base = 0;
m_Hash = 0;
CIn::Free();
}
CInTree::~CInTree()
{
FreeMemory();
}
HRESULT CInTree::Create(UINT32 aSizeHistory, UINT32 aKeepAddBufferBefore,
UINT32 aMatchMaxLen, UINT32 aKeepAddBufferAfter, UINT32 aSizeReserv)
{
FreeMemory();
CIn::Create(aSizeHistory + aKeepAddBufferBefore,
aMatchMaxLen + aKeepAddBufferAfter, aSizeReserv);
if (m_BlockSize + 256 > kMaxValForNormalize)
return E_INVALIDARG;
m_HistorySize = aSizeHistory;
m_MatchMaxLen = aMatchMaxLen;
UINT32 aSize = kHashSize;
#ifdef HASH_ARRAY_2
aSize += kHash2Size;
#ifdef HASH_ARRAY_3
aSize += kHash3Size;
#endif
#endif
m_Base = new CPair[m_BlockSize + 1];
if (m_Base == 0)
return E_OUTOFMEMORY;
m_Hash = new CIndex[aSize + 1];
if (m_Hash == 0)
return E_OUTOFMEMORY;
#ifdef HASH_ARRAY_2
m_Hash2 = &m_Hash[kHashSize];
#ifdef HASH_ARRAY_3
m_Hash3 = &m_Hash2[kHash2Size];
#endif
#endif
return S_OK;
}
static const UINT32 kEmptyHashValue = 0;
HRESULT CInTree::Init(ISequentialInStream *aStream)
{
RETURN_IF_NOT_S_OK(CIn::Init(aStream));
unsigned i;
for(i = 0; i < kHashSize; i++)
m_Hash[i] = kEmptyHashValue;
#ifdef HASH_ARRAY_2
for(i = 0; i < kHash2Size; i++)
m_Hash2[i] = kEmptyHashValue;
#ifdef HASH_ARRAY_3
for(i = 0; i < kHash3Size; i++)
m_Hash3[i] = kEmptyHashValue;
#endif
#endif
m_Son = m_Base;
ReduceOffsets(0 - 1);
return S_OK;
}
#ifdef HASH_ARRAY_2
#ifdef HASH_ARRAY_3
inline UINT32 Hash(const BYTE *aPointer, UINT32 &aHash2Value, UINT32 &aHash3Value)
{
UINT32 aTemp = CCRC::m_Table[aPointer[0]] ^ aPointer[1];
aHash2Value = aTemp & (kHash2Size - 1);
aHash3Value = (aTemp ^ (UINT32(aPointer[2]) << 8)) & (kHash3Size - 1);
return (aTemp ^ (UINT32(aPointer[2]) << 8) ^ (CCRC::m_Table[aPointer[3]] << 5)) &
(kHashSize - 1);
}
#else // no HASH_ARRAY_3
inline UINT32 Hash(const BYTE *aPointer, UINT32 &aHash2Value)
{
aHash2Value = (CCRC::m_Table[aPointer[0]] ^ aPointer[1]) & (kHash2Size - 1);
return (*((const UINT32 *)aPointer)) & 0xFFFFFF;
}
#endif // HASH_ARRAY_3
#else // no HASH_ARRAY_2
#ifdef HASH_ZIP
inline UINT32 Hash(const BYTE *aPointer)
{
return ((UINT32(aPointer[0]) << 8) ^
CCRC::m_Table[aPointer[1]] ^ aPointer[2]) & (kHashSize - 1);
}
#else // no HASH_ZIP
inline UINT32 Hash(const BYTE *aPointer)
{
return aPointer[0] ^ (UINT32(aPointer[1]) << 8);
}
#endif // HASH_ZIP
#endif // HASH_ARRAY_2
UINT32 CInTree::GetLongestMatch(UINT32 *aDistances)
{
UINT32 aCurrentLimit;
if (m_Pos + m_MatchMaxLen <= m_StreamPos)
aCurrentLimit = m_MatchMaxLen;
else
{
aCurrentLimit = m_StreamPos - m_Pos;
if(aCurrentLimit < kNumHashBytes)
return 0;
}
UINT32 aMatchMinPos = (m_Pos > m_HistorySize) ? (m_Pos - m_HistorySize) : 1;
BYTE *aCur = m_Buffer + m_Pos;
UINT32 aMatchHashLenMax = 0;
#ifdef HASH_ARRAY_2
UINT32 aHash2Value;
#ifdef HASH_ARRAY_3
UINT32 aHash3Value;
UINT32 aHashValue = Hash(aCur, aHash2Value, aHash3Value);
#else
UINT32 aHashValue = Hash(aCur, aHash2Value);
#endif
#else
UINT32 aHashValue = Hash(aCur);
#endif
UINT32 aCurMatch = m_Hash[aHashValue];
#ifdef HASH_ARRAY_2
UINT32 aCurMatch2 = m_Hash2[aHash2Value];
#ifdef HASH_ARRAY_3
UINT32 aCurMatch3 = m_Hash3[aHash3Value];
#endif
m_Hash2[aHash2Value] = m_Pos;
bool aMatchLen2Exist = false;
UINT32 aLen2Distance = 0;
if(aCurMatch2 >= aMatchMinPos)
{
if (m_Buffer[aCurMatch2] == aCur[0])
{
aLen2Distance = m_Pos - aCurMatch2 - 1;
aMatchHashLenMax = 2;
aMatchLen2Exist = true;
}
}
#ifdef HASH_ARRAY_3
m_Hash3[aHash3Value] = m_Pos;
UINT32 aMatchLen3Exist = false;
UINT32 aLen3Distance = 0;
if(aCurMatch3 >= aMatchMinPos)
{
if (m_Buffer[aCurMatch3] == aCur[0])
{
aLen3Distance = m_Pos - aCurMatch3 - 1;
aMatchHashLenMax = 3;
aMatchLen3Exist = true;
if (aMatchLen2Exist)
{
if (aLen3Distance < aLen2Distance)
aLen2Distance = aLen3Distance;
}
else
{
aLen2Distance = aLen3Distance;
aMatchLen2Exist = true;
}
}
}
#endif
#endif
m_Hash[aHashValue] = m_Pos;
if(aCurMatch < aMatchMinPos)
{
m_Son[m_Pos].Left = kEmptyHashValue;
m_Son[m_Pos].Right = kEmptyHashValue;
#ifdef HASH_ARRAY_2
aDistances[2] = aLen2Distance;
#ifdef HASH_ARRAY_3
aDistances[3] = aLen3Distance;
#endif
#endif
return aMatchHashLenMax;
}
CIndex *aPtrLeft = &m_Son[m_Pos].Right;
CIndex *aPtrRight = &m_Son[m_Pos].Left;
UINT32 aMax, aMinSameLeft, aMinSameRight, aMinSame;
aMax = aMinSameLeft = aMinSameRight = aMinSame = kNumHashDirectBytes;
#ifdef HASH_ARRAY_2
#ifndef HASH_ARRAY_3
if (aMatchLen2Exist)
aDistances[2] = aLen2Distance;
else
if (kNumHashDirectBytes >= 2)
aDistances[2] = m_Pos - aCurMatch - 1;
#endif
#endif
aDistances[aMax] = m_Pos - aCurMatch - 1;
for(UINT32 aCount = m_CutValue; aCount > 0; aCount--)
{
BYTE *pby1 = m_Buffer + aCurMatch;
// CIndex aLeft = m_Son[aCurMatch].Left; // it's prefetch
UINT32 aCurrentLen;
for(aCurrentLen = aMinSame; aCurrentLen < aCurrentLimit; aCurrentLen++/*, dwComps++*/)
if (pby1[aCurrentLen] != aCur[aCurrentLen])
break;
while (aCurrentLen > aMax)
aDistances[++aMax] = m_Pos - aCurMatch - 1;
if (aCurrentLen != aCurrentLimit)
{
if (pby1[aCurrentLen] < aCur[aCurrentLen])
{
*aPtrRight = aCurMatch;
aPtrRight = &m_Son[aCurMatch].Right;
aCurMatch = m_Son[aCurMatch].Right;
if(aCurrentLen > aMinSameLeft)
{
aMinSameLeft = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
else
{
*aPtrLeft = aCurMatch;
aPtrLeft = &m_Son[aCurMatch].Left;
// aCurMatch = aLeft;
aCurMatch = m_Son[aCurMatch].Left;
if(aCurrentLen > aMinSameRight)
{
aMinSameRight = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
}
else
{
if(aCurrentLen < m_MatchMaxLen)
{
*aPtrLeft = aCurMatch;
aPtrLeft = &m_Son[aCurMatch].Left;
aCurMatch = m_Son[aCurMatch].Left;
if(aCurrentLen > aMinSameRight)
{
aMinSameRight = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
else
{
*aPtrLeft = m_Son[aCurMatch].Right;
*aPtrRight = m_Son[aCurMatch].Left;
#ifdef HASH_ARRAY_2
if (aMatchLen2Exist && aLen2Distance < aDistances[2])
aDistances[2] = aLen2Distance;
#ifdef HASH_ARRAY_3
if (aMatchLen3Exist && aLen3Distance < aDistances[3])
aDistances[3] = aLen3Distance;
#endif
#endif
return aMax;
}
}
if(aCurMatch < aMatchMinPos)
break;
}
*aPtrLeft = kEmptyHashValue;
*aPtrRight = kEmptyHashValue;
#ifdef HASH_ARRAY_2
if (aMatchLen2Exist)
{
if (aMax < 2)
{
aDistances[2] = aLen2Distance;
aMax = 2;
}
else if (aLen2Distance < aDistances[2])
aDistances[2] = aLen2Distance;
}
#ifdef HASH_ARRAY_3
if (aMatchLen3Exist)
{
if (aMax < 3)
{
aDistances[3] = aLen3Distance;
aMax = 3;
}
else if (aLen3Distance < aDistances[3])
aDistances[3] = aLen3Distance;
}
#endif
#endif
return aMax;
}
void CInTree::DummyLongestMatch()
{
UINT32 aCurrentLimit;
if (m_Pos + m_MatchMaxLen <= m_StreamPos)
aCurrentLimit = m_MatchMaxLen;
else
{
aCurrentLimit = m_StreamPos - m_Pos;
if(aCurrentLimit < kNumHashBytes)
return;
}
UINT32 aMatchMinPos = (m_Pos > m_HistorySize) ? (m_Pos - m_HistorySize) : 1;
BYTE *aCur = m_Buffer + m_Pos;
#ifdef HASH_ARRAY_2
UINT32 aHash2Value;
#ifdef HASH_ARRAY_3
UINT32 aHash3Value;
UINT32 aHashValue = Hash(aCur, aHash2Value, aHash3Value);
m_Hash3[aHash3Value] = m_Pos;
#else
UINT32 aHashValue = Hash(aCur, aHash2Value);
#endif
m_Hash2[aHash2Value] = m_Pos;
#else
UINT32 aHashValue = Hash(aCur);
#endif
UINT32 aCurMatch = m_Hash[aHashValue];
m_Hash[aHashValue] = m_Pos;
if(aCurMatch < aMatchMinPos)
{
m_Son[m_Pos].Left = kEmptyHashValue;
m_Son[m_Pos].Right = kEmptyHashValue;
return;
}
CIndex *aPtrLeft = &m_Son[m_Pos].Right;
CIndex *aPtrRight = &m_Son[m_Pos].Left;
UINT32 aMax, aMinSameLeft, aMinSameRight, aMinSame;
aMax = aMinSameLeft = aMinSameRight = aMinSame = kNumHashDirectBytes;
for(UINT32 aCount = m_CutValue; aCount > 0; aCount--)
{
BYTE *pby1 = m_Buffer + aCurMatch;
// CIndex aLeft = m_Son[aCurMatch].Left; // it's prefetch
UINT32 aCurrentLen;
for(aCurrentLen = aMinSame; aCurrentLen < aCurrentLimit; aCurrentLen++/*, dwComps++*/)
if (pby1[aCurrentLen] != aCur[aCurrentLen])
break;
if (aCurrentLen != aCurrentLimit)
{
if (pby1[aCurrentLen] < aCur[aCurrentLen])
{
*aPtrRight = aCurMatch;
aPtrRight = &m_Son[aCurMatch].Right;
aCurMatch = m_Son[aCurMatch].Right;
if(aCurrentLen > aMinSameLeft)
{
aMinSameLeft = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
else
{
*aPtrLeft = aCurMatch;
aPtrLeft = &m_Son[aCurMatch].Left;
aCurMatch = m_Son[aCurMatch].Left;
// aCurMatch = aLeft;
if(aCurrentLen > aMinSameRight)
{
aMinSameRight = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
}
else
{
if(aCurrentLen < m_MatchMaxLen)
{
*aPtrLeft = aCurMatch;
aPtrLeft = &m_Son[aCurMatch].Left;
aCurMatch = m_Son[aCurMatch].Left;
if(aCurrentLen > aMinSameRight)
{
aMinSameRight = aCurrentLen;
aMinSame = MyMin(aMinSameLeft, aMinSameRight);
}
}
else
{
*aPtrLeft = m_Son[aCurMatch].Right;
*aPtrRight = m_Son[aCurMatch].Left;
return;
}
}
if(aCurMatch < aMatchMinPos)
break;
}
*aPtrLeft = kEmptyHashValue;
*aPtrRight = kEmptyHashValue;
}
void CInTree::AfterMoveBlock()
{
UINT32 aNumBytesToMove = m_HistorySize * sizeof(CPair);
UINT32 aSpecOffset = ((m_Son + m_Pos) - m_Base) - m_HistorySize;
memmove(m_Base, m_Base + aSpecOffset, aNumBytesToMove);
m_Son -= aSpecOffset;
}
void CInTree::NormalizeLinks(CIndex *anArray, UINT32 aNumItems, UINT32 aSubValue)
{
for (UINT32 i = 0; i < aNumItems; i++)
{
UINT32 aValue = anArray[i];
if (aValue <= aSubValue)
aValue = kEmptyHashValue;
else
aValue -= aSubValue;
anArray[i] = aValue;
}
}
void CInTree::Normalize()
{
UINT32 aStartItem = m_Pos - m_HistorySize;
UINT32 aSubValue = aStartItem - 1;
NormalizeLinks((CIndex *)(m_Son + aStartItem), m_HistorySize * 2, aSubValue);
NormalizeLinks(m_Hash, kHashSize, aSubValue);
#ifdef HASH_ARRAY_2
NormalizeLinks(m_Hash2, kHash2Size, aSubValue);
#ifdef HASH_ARRAY_3
NormalizeLinks(m_Hash3, kHash3Size, aSubValue);
#endif
#endif
ReduceOffsets(aSubValue);
}
}
|
