Lines 107-113
FastHufDecoder::FastHufDecoder
Link Here
|
107 |
for (int i = 0; i <= MAX_CODE_LEN; ++i) |
107 |
for (int i = 0; i <= MAX_CODE_LEN; ++i) |
108 |
{ |
108 |
{ |
109 |
codeCount[i] = 0; |
109 |
codeCount[i] = 0; |
110 |
base[i] = 0xffffffffffffffffL; |
110 |
base[i] = 0xffffffffffffffffULL; |
111 |
offset[i] = 0; |
111 |
offset[i] = 0; |
112 |
} |
112 |
} |
113 |
|
113 |
|
Lines 352-358
FastHufDecoder::buildTables (Int64 *base, Int64 *offset)
Link Here
|
352 |
|
352 |
|
353 |
for (int i = 0; i <= MAX_CODE_LEN; ++i) |
353 |
for (int i = 0; i <= MAX_CODE_LEN; ++i) |
354 |
{ |
354 |
{ |
355 |
if (base[i] != 0xffffffffffffffffL) |
355 |
if (base[i] != 0xffffffffffffffffULL) |
356 |
{ |
356 |
{ |
357 |
_ljBase[i] = base[i] << (64 - i); |
357 |
_ljBase[i] = base[i] << (64 - i); |
358 |
} |
358 |
} |
Lines 362-368
FastHufDecoder::buildTables (Int64 *base, Int64 *offset)
Link Here
|
362 |
// Unused code length - insert dummy values |
362 |
// Unused code length - insert dummy values |
363 |
// |
363 |
// |
364 |
|
364 |
|
365 |
_ljBase[i] = 0xffffffffffffffffL; |
365 |
_ljBase[i] = 0xffffffffffffffffULL; |
366 |
} |
366 |
} |
367 |
} |
367 |
} |
368 |
|
368 |
|
Lines 417-423
FastHufDecoder::buildTables (Int64 *base, Int64 *offset)
Link Here
|
417 |
|
417 |
|
418 |
int minIdx = TABLE_LOOKUP_BITS; |
418 |
int minIdx = TABLE_LOOKUP_BITS; |
419 |
|
419 |
|
420 |
while (minIdx > 0 && _ljBase[minIdx] == 0xffffffffffffffffL) |
420 |
while (minIdx > 0 && _ljBase[minIdx] == 0xffffffffffffffffULL) |
421 |
minIdx--; |
421 |
minIdx--; |
422 |
|
422 |
|
423 |
if (minIdx < 0) |
423 |
if (minIdx < 0) |
Lines 427-433
FastHufDecoder::buildTables (Int64 *base, Int64 *offset)
Link Here
|
427 |
// Set the min value such that the table is never tested. |
427 |
// Set the min value such that the table is never tested. |
428 |
// |
428 |
// |
429 |
|
429 |
|
430 |
_tableMin = 0xffffffffffffffffL; |
430 |
_tableMin = 0xffffffffffffffffULL; |
431 |
} |
431 |
} |
432 |
else |
432 |
else |
433 |
{ |
433 |
{ |