nerdcruft/libcruft-util
1
0
Fork 0
Code Issues Releases Activity

Add some simple checksum algorithms

Browse Source 
* adler
* bsdsum
* crc
* fletcher
This commit is contained in:
Danny Robson 2011-11-04 16:56:25 +11:00
parent 6b38a3486c
commit 6560353cb0
11 changed files with 296 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Makefile.am
View File

@ -7,12 +7,18 @@ AM_CXXFLAGS = $(BOOST_CPPFLAGS) $(COMMON_CXXFLAGS)
SUBDIRS = test
UTIL_FILES = \
adler.hpp \
adler.cpp \
annotations.hpp \
backtrace.hpp \
bitwise.cpp \
bitwise.hpp \
bsdsum.hpp \
bsdsum.cpp \
colour.cpp \
colour.hpp \
crc.cpp \
crc.hpp \
debug.cpp \
debug.hpp \
enable_if.hpp \
@ -24,6 +30,7 @@ UTIL_FILES = \
extent.hpp \
fixed.cpp \
fixed.hpp \
fletcher.hpp \
float.cpp \
float.hpp \
fwd.hpp \

30
adler.cpp Normal file
View File

@ -0,0 +1,30 @@
/*
* This file is part of libgim.
*
* Waif is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* Waif 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010 Danny Robson <danny@blubinc.net>
*/
#include "adler.hpp"
#include "debug.hpp"
#include "fletcher.hpp"
static const unsigned MODULUS = 65521;
uint32_t
adler32 (const void* restrict _data, size_t _size)
{ return fletcher<32, MODULUS, 1, 0> (_data, _size); }

28
adler.hpp Normal file
View File

@ -0,0 +1,28 @@
/*
* This file is part of libgim.
*
* Waif is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* Waif 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010 Danny Robson <danny@blubinc.net>
*/
#ifndef __UTIL_ADLER_HPP
#define __UTIL_ADLER_HPP
#include <cstdint>
#include <cstdlib>
extern uint32_t adler32(const void* restrict, size_t);
#endif

35
bsdsum.cpp Normal file
View File

@ -0,0 +1,35 @@
/*
* This file is part of libgim.
*
* Waif is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* Waif 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010 Danny Robson <danny@blubinc.net>
*/
#include "bsdsum.hpp"
uint16_t
bsdsum (const void *restrict _data, size_t size) {
const uint8_t *restrict data = static_cast<const uint8_t*> (data);
uint16_t accum = 0;
for (size_t i = 0; i < size; ++i) {
accum = (accum >> 1) | ((accum & 0x1) << 15);
accum += data[i];
}
return accum;
}

28
bsdsum.hpp Normal file
View File

@ -0,0 +1,28 @@
/*
* This file is part of libgim.
*
* Waif is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* Waif 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010 Danny Robson <danny@blubinc.net>
*/
#ifndef __UTIL_BSDSUM_HPP
#define __UTIL_BSDSUMP_HPP
#include <cstdint>
#include <cstdlib>
uint16_t bsdsum (const void *restrict, size_t);
#endif

58
crc.cpp Normal file
View File

@ -0,0 +1,58 @@
/*
* This file is part of libgim.
*
* libgim is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* libgim 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2011 Danny Robson <danny@blubinc.net>
*/
#include "crc.hpp"
#include "debug.hpp"
#include "endian.hpp"
uint32_t
crc32 (const void *restrict, size_t) {
not_implemented ();
/*
const uint8_t *restrict data = static_cast<const uint8_t*> (_data);
static const uint32_t POLYNOMIAL = hton (static_cast<uint32_t>(0x04C11DB7));
uint64_t bits = 0;
unsigned int i = 0;
if (size == 0)
return POLYNOMIAL;
switch (size) {
default: bits |= static_cast<uint64_t>(data[3]) << 32U;
case 3: bits |= static_cast<uint64_t>(data[2]) << 40U;
case 2: bits |= static_cast<uint64_t>(data[1]) << 48U;
case 1: bits |= static_cast<uint64_t>(data[0]) << 56U;
}
for (size_t i = 0; i < size; ++i) {
for (unsigned j = 0; j < 32; ++j) {
bool mix = bits 0x7000000000000000ULL;
bits <<= 1;
if (mix)
bits ^= POLYNOMIAL << 32;
}
}
*/
}

29
crc.hpp Normal file
View File

@ -0,0 +1,29 @@
/*
* This file is part of libgim.
*
* libgim is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* libgim 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2011 Danny Robson <danny@blubinc.net>
*/
#ifndef __UTIL_CRC_HPP
#define __UTIL_CRC_HPP
#include <cstdint>
#include <cstdlib>
uint32_t crc32 (const void *restrict, size_t);
#endif

44
fletcher.hpp Normal file
View File

@ -0,0 +1,44 @@
/*
* This file is part of libgim.
*
* Waif is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* Waif 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 General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010 Danny Robson <danny@blubinc.net>
*/
#ifndef __UTIL_FLETCHER_HPP
#define __UTIL_FLETCHER_HPP
#include "types.hpp"
#include <cstdint>
#include <cstdlib>
template <unsigned BITS, unsigned MODULUS, unsigned INITIAL_A, unsigned INITIAL_B>
typename bits_type<BITS>::uint
fletcher (const void *restrict _data, size_t size) {
const uint8_t *restrict data = static_cast<const uint8_t*> (_data);
typename bits_type<BITS>::uint A = INITIAL_A,
B = INITIAL_B;
for (size_t i = 0; i < size; ++i) {
A = (A + data[i]) % MODULUS;
B = (A + B) % MODULUS;
}
return (B << (BITS / 2)) | A;
}
#endif

1
test/.gitignore vendored
View File

@ -1,3 +1,4 @@
/adler
/backtrace*
/float*
/hton*

4
test/Makefile.am
View File

@ -9,6 +9,7 @@ AM_LDFLAGS = $(COMMON_LDFLAGS)
TEST_BIN = \
backtrace \
checksum \
float \
hton \
ip \
@ -27,6 +28,9 @@ backtrace_CPPFLAGS = $(COMMON_CXXFLAGS)
backtrace_LDADD = $(builddir)/../libutil.la
backtrace_SOURCES = backtrace.cpp
checksum_LDADD = $(builddir)/../libutil.la
checksum_SOURCES = checksum.cpp
float_LDADD = $(builddir)/../libutil.la
float_SOURCES = float.cpp

32
test/checksum.cpp Normal file
View File

@ -0,0 +1,32 @@
#include "adler.hpp"
#include "bsdsum.hpp"
#include "types.hpp"
#include <cstdlib>
#include <cstring>
using namespace std;
static const char *ALPHABET = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
static const struct {
uint32_t adler;
uint16_t bsd;
const char *data;
size_t size;
} TESTS[] = {
{ 0xDF5B150C, 0x52FB, ALPHABET, strlen (ALPHABET) }
};
int
main (int, char**) {
for (unsigned i = 0; i < elems (TESTS); ++i) {
check_eq (TESTS[i].adler, adler32 (TESTS[i].data, TESTS[i].size));
check_eq (TESTS[i].bsd, bsdsum (TESTS[i].data, TESTS[i].size));
}
return EXIT_SUCCESS;
}