mirror of
https://github.com/cryb-to/cryb-to.git
synced 2024-11-14 09:45:40 +00:00
Add a simple implementation of the Adler-32 checksum.
This commit is contained in:
parent
1609b4e08a
commit
531eeec36b
5 changed files with 197 additions and 1 deletions
|
@ -34,6 +34,7 @@
|
|||
#define pearson_hash_str cryb_pearson_hash_str
|
||||
#define murmur3_32_hash cryb_murmur3_32_hash
|
||||
|
||||
uint32_t adler32_hash(const void *, size_t);
|
||||
uint16_t fletcher16_hash(const void *, size_t);
|
||||
uint32_t fletcher32_hash(const void *, size_t);
|
||||
uint64_t fletcher64_hash(const void *, size_t);
|
||||
|
|
|
@ -3,6 +3,7 @@ AM_CPPFLAGS = -I$(top_srcdir)/include
|
|||
lib_LTLIBRARIES = libcryb-hash.la
|
||||
|
||||
libcryb_hash_la_SOURCES = \
|
||||
adler32.c \
|
||||
fletcher16.c \
|
||||
fletcher32.c \
|
||||
fletcher64.c \
|
||||
|
|
53
lib/hash/adler32.c
Normal file
53
lib/hash/adler32.c
Normal file
|
@ -0,0 +1,53 @@
|
|||
/*-
|
||||
* Copyright (c) 2015 Dag-Erling Smørgrav
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. The name of the author may not be used to endorse or promote
|
||||
* products derived from this software without specific prior written
|
||||
* permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "cryb/impl.h"
|
||||
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <cryb/bitwise.h>
|
||||
#include <cryb/endian.h>
|
||||
#include <cryb/hash.h>
|
||||
|
||||
/*
|
||||
* Simple implementation of the Adler-32 checksum described in RFC1905.
|
||||
*/
|
||||
uint32_t
|
||||
adler32_hash(const void *data, size_t len)
|
||||
{
|
||||
const uint8_t *bytes;
|
||||
uint32_t c0, c1;
|
||||
|
||||
for (bytes = data, c0 = 1, c1 = 0; len > 0; len--, bytes++) {
|
||||
c0 = (c0 + *bytes) % 65521;
|
||||
c1 = (c1 + c0) % 65521;
|
||||
}
|
||||
return (c1 << 16 | c0);
|
||||
}
|
|
@ -103,7 +103,8 @@ t_sha512_openssl_LDADD = $(libt) $(OPENSSL_LDADD) $(RT_LIBS)
|
|||
endif
|
||||
|
||||
# libcryb-hash
|
||||
TESTS += t_fletcher t_murmur3_32 t_pearson
|
||||
TESTS += t_adler t_fletcher t_murmur3_32 t_pearson
|
||||
t_adler_LDADD = $(libt) $(libhash)
|
||||
t_fletcher_LDADD = $(libt) $(libhash)
|
||||
t_murmur3_32_LDADD = $(libt) $(libhash)
|
||||
t_pearson_LDADD = $(libt) $(libhash)
|
||||
|
|
140
t/t_adler.c
Normal file
140
t/t_adler.c
Normal file
|
@ -0,0 +1,140 @@
|
|||
/*-
|
||||
* Copyright (c) 2015 Dag-Erling Smørgrav
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. The name of the author may not be used to endorse or promote
|
||||
* products derived from this software without specific prior written
|
||||
* permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "cryb/impl.h"
|
||||
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <cryb/hash.h>
|
||||
|
||||
#include "t.h"
|
||||
|
||||
struct t_case {
|
||||
const char *desc;
|
||||
const char *data;
|
||||
size_t len;
|
||||
uint32_t sum;
|
||||
};
|
||||
|
||||
/***************************************************************************
|
||||
* Test cases
|
||||
*/
|
||||
static struct t_case t_cases[] = {
|
||||
{
|
||||
.desc = "len == 0",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 0,
|
||||
.sum = 0x00000001,
|
||||
},
|
||||
{
|
||||
.desc = "len == 1",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 1,
|
||||
.sum = 0x00020002,
|
||||
},
|
||||
{
|
||||
.desc = "len == 2",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 2,
|
||||
.sum = 0x00060004,
|
||||
},
|
||||
{
|
||||
.desc = "len == 3",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 3,
|
||||
.sum = 0x000d0007,
|
||||
},
|
||||
{
|
||||
.desc = "len == 4",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 4,
|
||||
.sum = 0x0018000b,
|
||||
},
|
||||
{
|
||||
.desc = "len == 5",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 5,
|
||||
.sum = 0x00280010,
|
||||
},
|
||||
{
|
||||
.desc = "len == 6",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 6,
|
||||
.sum = 0x003e0016,
|
||||
},
|
||||
{
|
||||
.desc = "len == 7",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 7,
|
||||
.sum = 0x005b001d,
|
||||
},
|
||||
{
|
||||
.desc = "len == 8",
|
||||
.data = "\x01\x02\x03\x04\x05\x06\x07\x08",
|
||||
.len = 8,
|
||||
.sum = 0x00800025,
|
||||
},
|
||||
};
|
||||
|
||||
/***************************************************************************
|
||||
* Test function
|
||||
*/
|
||||
static int
|
||||
t_adler(char **desc CRYB_UNUSED, void *arg)
|
||||
{
|
||||
struct t_case *t = arg;
|
||||
int ret;
|
||||
|
||||
ret = t_compare_x32(t->sum, adler32_hash(t->data, t->len));
|
||||
return (ret);
|
||||
}
|
||||
|
||||
|
||||
/***************************************************************************
|
||||
* Boilerplate
|
||||
*/
|
||||
|
||||
int
|
||||
t_prepare(int argc, char *argv[])
|
||||
{
|
||||
int i, n;
|
||||
|
||||
(void)argc;
|
||||
(void)argv;
|
||||
n = sizeof t_cases / sizeof t_cases[0];
|
||||
for (i = 0; i < n; ++i)
|
||||
t_add_test(t_adler, &t_cases[i], t_cases[i].desc);
|
||||
return (0);
|
||||
}
|
||||
|
||||
void
|
||||
t_cleanup(void)
|
||||
{
|
||||
}
|
Loading…
Reference in a new issue