145 lines
3.5 KiB
C
145 lines
3.5 KiB
C
/*
|
|
* This file is a part of Pcompress, a chunked parallel multi-
|
|
* algorithm lossless compression and decompression program.
|
|
*
|
|
* Copyright (C) 2012-2013 Moinak Ghosh. All rights reserved.
|
|
* Use is subject to license terms.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 3 of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this program.
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
* moinakg@belenix.org, http://moinakg.wordpress.com/
|
|
*
|
|
*/
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
/// \file crc64.c
|
|
/// \brief CRC64 calculation
|
|
///
|
|
/// Calculate the CRC64 using the slice-by-four algorithm. This is the same
|
|
/// idea that is used in crc32_fast.c, but for CRC64 we use only four tables
|
|
/// instead of eight to avoid increasing CPU cache usage.
|
|
//
|
|
// Author: Lasse Collin
|
|
//
|
|
// This file has been put into the public domain.
|
|
// You can do whatever you want with this file.
|
|
//
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "lzma_crc.h"
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
# define A1(x) ((x) >> 56)
|
|
#else
|
|
# define A1 A
|
|
#endif
|
|
|
|
extern const uint64_t lzma_crc64_table[4][256];
|
|
|
|
// See the comments in crc32_fast.c. They aren't duplicated here.
|
|
extern uint64_t
|
|
lzma_crc64(const uint8_t *buf, size_t size, uint64_t crc)
|
|
{
|
|
crc = ~crc;
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
crc = bswap64(crc);
|
|
#endif
|
|
|
|
if (size > 4) {
|
|
while ((uintptr_t)(buf) & 3) {
|
|
crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
|
|
--size;
|
|
}
|
|
|
|
const uint8_t *const limit = buf + (size & ~(size_t)(3));
|
|
size &= (size_t)(3);
|
|
|
|
while (buf < limit) {
|
|
#ifdef WORDS_BIGENDIAN
|
|
const uint32_t tmp = (crc >> 32)
|
|
^ *(const uint32_t *)(buf);
|
|
#else
|
|
const uint32_t tmp = crc ^ *(const uint32_t *)(buf);
|
|
#endif
|
|
buf += 4;
|
|
|
|
crc = lzma_crc64_table[3][A(tmp)]
|
|
^ lzma_crc64_table[2][B(tmp)]
|
|
^ S32(crc)
|
|
^ lzma_crc64_table[1][C(tmp)]
|
|
^ lzma_crc64_table[0][D(tmp)];
|
|
}
|
|
}
|
|
|
|
while (size-- != 0)
|
|
crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
crc = bswap64(crc);
|
|
#endif
|
|
|
|
return ~crc;
|
|
}
|
|
|
|
extern uint64_t
|
|
lzma_crc64_8bchk(const uint8_t *buf, size_t size, uint64_t crc, uint64_t *cnt)
|
|
{
|
|
crc = ~crc;
|
|
uint64_t cnt1 = 0;
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
crc = bswap64(crc);
|
|
#endif
|
|
|
|
if (size > 4) {
|
|
while ((uintptr_t)(buf) & 3) {
|
|
crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
|
|
--size;
|
|
}
|
|
|
|
const uint8_t *const limit = buf + (size & ~(size_t)(3));
|
|
size &= (size_t)(3);
|
|
|
|
while (buf < limit) {
|
|
uint32_t val = *(const uint32_t *)(buf);
|
|
#ifdef WORDS_BIGENDIAN
|
|
const uint32_t tmp = (crc >> 32) ^ val;
|
|
#else
|
|
const uint32_t tmp = crc ^ val;
|
|
#endif
|
|
buf += 4;
|
|
val >>= 7; cnt1 += (val & 1);
|
|
val >>= 8; cnt1 += (val & 1);
|
|
|
|
crc = lzma_crc64_table[3][A(tmp)]
|
|
^ lzma_crc64_table[2][B(tmp)]
|
|
^ S32(crc)
|
|
^ lzma_crc64_table[1][C(tmp)]
|
|
^ lzma_crc64_table[0][D(tmp)];
|
|
}
|
|
}
|
|
|
|
while (size-- != 0)
|
|
crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
crc = bswap64(crc);
|
|
#endif
|
|
|
|
*cnt = cnt1;
|
|
return ~crc;
|
|
}
|