2011-11-04 16:56:25 +11:00
|
|
|
/*
|
2015-04-13 18:05:28 +10:00
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
2011-11-04 16:56:25 +11:00
|
|
|
*
|
2015-04-13 18:05:28 +10:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
2011-11-04 16:56:25 +11:00
|
|
|
*
|
2018-01-13 13:48:58 +11:00
|
|
|
* Copyright 2011-2018 Danny Robson <danny@nerdcruft.net>
|
2011-11-04 16:56:25 +11:00
|
|
|
*/
|
|
|
|
|
2018-01-13 13:48:58 +11:00
|
|
|
#ifndef CRUFT_UTIL_HASH_CRC_HPP
|
|
|
|
#define CRUFT_UTIL_HASH_CRC_HPP
|
|
|
|
|
|
|
|
#include "../view.hpp"
|
2011-11-04 16:56:25 +11:00
|
|
|
|
2017-02-13 17:13:46 +11:00
|
|
|
#include <array>
|
2011-11-04 16:56:25 +11:00
|
|
|
#include <cstdint>
|
|
|
|
#include <cstdlib>
|
2017-02-13 17:13:46 +11:00
|
|
|
#include <type_traits>
|
2011-11-04 16:56:25 +11:00
|
|
|
|
2016-06-17 16:20:09 +10:00
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
2018-01-13 13:48:58 +11:00
|
|
|
namespace util::hash {
|
2017-02-13 17:13:46 +11:00
|
|
|
// Implements the crc checksum (from ethernet, png, etc).
|
2017-02-14 19:47:12 +11:00
|
|
|
//
|
|
|
|
// Adapted from the PNG specification (ISO/IEC 15948:2003), appendix D and
|
|
|
|
// the public domain implementation of Ross Williams.
|
2017-02-20 18:01:40 +11:00
|
|
|
//
|
|
|
|
// Generator: the polynomial, with the leading (ie, 32nd) high bit truncated.
|
|
|
|
// Initial: value used to initialise the digest
|
|
|
|
// Final: value to xor against the digest at finish time
|
|
|
|
// ReflectIn: whether to reverse the bits of each data byte
|
|
|
|
// ReflectOut: whether to reverse the bits of the digest at finish time
|
|
|
|
//
|
|
|
|
// Note that reflection isn't necessarily explicitly performed at update
|
2018-01-13 13:48:58 +11:00
|
|
|
// time. Instead we construct the lookup table appropriately to use the
|
|
|
|
// data values directly.
|
2017-02-14 19:47:12 +11:00
|
|
|
template <
|
|
|
|
typename DigestT,
|
|
|
|
DigestT Generator,
|
|
|
|
DigestT Initial,
|
|
|
|
DigestT Final,
|
|
|
|
bool ReflectIn,
|
|
|
|
bool ReflectOut
|
|
|
|
>
|
2017-02-13 17:13:46 +11:00
|
|
|
class crc {
|
2016-06-20 16:48:17 +10:00
|
|
|
public:
|
2017-02-13 17:13:46 +11:00
|
|
|
using digest_t = DigestT;
|
|
|
|
|
2017-02-14 19:47:12 +11:00
|
|
|
static constexpr auto generator = Generator;
|
|
|
|
|
2018-01-13 13:48:58 +11:00
|
|
|
digest_t operator() (util::view<const uint8_t*>) const noexcept;
|
2017-01-25 16:12:12 +11:00
|
|
|
|
2017-02-14 19:47:12 +11:00
|
|
|
static constexpr
|
2017-02-13 17:13:46 +11:00
|
|
|
std::array<DigestT,256>
|
|
|
|
table (void);
|
|
|
|
|
2017-01-25 16:12:12 +11:00
|
|
|
private:
|
2017-02-13 17:13:46 +11:00
|
|
|
static const std::array<DigestT,256> s_table;
|
2016-06-20 16:48:17 +10:00
|
|
|
};
|
2017-02-13 17:13:46 +11:00
|
|
|
|
2018-01-13 13:48:58 +11:00
|
|
|
|
2017-02-14 19:47:12 +11:00
|
|
|
using crc32 = crc<uint32_t, 0x04c11db7, 0xffffffff, 0xffffffff, true, true>;
|
|
|
|
using crc32b = crc<uint32_t, 0x04c11db7, 0xffffffff, 0xffffffff, false, false>;
|
|
|
|
using crc32c = crc<uint32_t, 0x1edc6f41, 0xffffffff, 0xffffffff, true, true>;
|
|
|
|
using crc32d = crc<uint32_t, 0xa833982b, 0xffffffff, 0xffffffff, true, true>;
|
|
|
|
|
|
|
|
using crc64 = crc<uint64_t, 0x42f0e1eba9ea3693, 0, 0, false, false>;
|
2018-01-13 13:48:58 +11:00
|
|
|
}
|
2016-06-20 16:48:17 +10:00
|
|
|
|
2011-11-04 16:56:25 +11:00
|
|
|
#endif
|