2021-09-21 23:59:19 +01:00
|
|
|
/*
|
|
|
|
|
* This file is part of the Aaru Data Preservation Suite.
|
2022-12-01 23:06:20 +00:00
|
|
|
* Copyright (c) 2019-2023 Natalia Portillo.
|
2021-09-21 23:59:19 +01:00
|
|
|
*
|
|
|
|
|
* This library 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 2.1 of the
|
|
|
|
|
* License, or (at your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* This library 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 library; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef AARU_CHECKSUMS_NATIVE_FLETCHER16_H
|
|
|
|
|
#define AARU_CHECKSUMS_NATIVE_FLETCHER16_H
|
|
|
|
|
|
|
|
|
|
#define FLETCHER16_MODULE 0xFF
|
2021-09-22 23:49:32 +01:00
|
|
|
/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(ADLER_MODULE-1) <= 2^16-1 */
|
|
|
|
|
#define NMAX 22
|
2021-09-21 23:59:19 +01:00
|
|
|
|
2021-09-22 01:27:28 +01:00
|
|
|
typedef struct
|
|
|
|
|
{
|
2021-09-21 23:59:19 +01:00
|
|
|
uint8_t sum1;
|
|
|
|
|
uint8_t sum2;
|
|
|
|
|
} fletcher16_ctx;
|
|
|
|
|
|
|
|
|
|
AARU_EXPORT fletcher16_ctx* AARU_CALL fletcher16_init();
|
2021-09-22 01:27:28 +01:00
|
|
|
AARU_EXPORT int AARU_CALL fletcher16_update(fletcher16_ctx* ctx, const uint8_t* data, uint32_t len);
|
|
|
|
|
AARU_EXPORT int AARU_CALL fletcher16_final(fletcher16_ctx* ctx, uint16_t* checksum);
|
|
|
|
|
AARU_EXPORT void AARU_CALL fletcher16_free(fletcher16_ctx* ctx);
|
2021-09-21 23:59:19 +01:00
|
|
|
|
2021-09-22 01:27:28 +01:00
|
|
|
#endif // AARU_CHECKSUMS_NATIVE_FLETCHER16_H
|