GY-63_MS5611/libraries/Fletcher/Fletcher.cpp

83 lines
1.7 KiB
C++
Raw Normal View History

2022-04-15 11:36:01 -04:00
//
// FILE: Fletcher.cpp
// AUTHOR: Rob Tillaart
2022-11-07 08:21:36 -05:00
// VERSION: 0.1.7
2022-04-15 11:36:01 -04:00
// DATE: 2022-01-25
// PURPOSE: Arduino Library for calculating Fletcher's checksum
// URL: https://github.com/RobTillaart/Fletcher
// https://en.wikipedia.org/wiki/Fletcher%27s_checksum
//
2022-11-07 08:21:36 -05:00
// HISTORY: see changelog.md
2022-04-15 11:36:01 -04:00
2022-09-08 07:31:39 -04:00
#include "Fletcher.h"
2022-04-15 11:36:01 -04:00
// straightforward implementation.
// max length buffer 65534.
// Wikipedia shows optimizations.
//
uint16_t fletcher16(uint8_t *data, uint16_t length)
{
uint32_t s1 = 0;
uint32_t s2 = 0;
for (uint16_t i = 0; i < length;)
{
// if S2 is halfway it is time to do modulo
while ((i < length) && (s2 < 2147483648ULL))
{
s1 += data[i++];
s2 += s1;
}
2022-09-08 11:33:44 -04:00
// this optimization does not work due to the above "32-bit" loop.
// for all three functions.
2022-09-13 10:31:43 -04:00
// s1 = (s1 & 255) + (s1 >> 8);
s1 %= FLETCHER_16;
2022-04-15 11:36:01 -04:00
s2 %= FLETCHER_16;
}
return (s2 << 8) | s1;
}
uint32_t fletcher32(uint16_t *data, uint16_t length)
{
uint32_t s1 = 0;
uint32_t s2 = 0;
for (uint16_t i = 0; i < length;)
{
// if S2 is halfway it is time to do modulo
while ((i < length) && (s2 < 2147483648ULL))
{
s1 += data[i++];
s2 += s1;
}
2022-09-08 11:33:44 -04:00
s1 %= FLETCHER_32;
s2 %= FLETCHER_32;
2022-04-15 11:36:01 -04:00
}
return (s2 << 16) | s1;
}
uint64_t fletcher64(uint32_t *data, uint16_t length)
{
uint64_t s1 = 0;
uint64_t s2 = 0;
for (uint16_t i = 0; i < length;)
{
// if S2 is halfway it is time to do modulo
while ((i < length) && (s2 < 9223372036854775808ULL))
{
s1 += data[i++];
s2 += s1;
}
2022-09-08 11:33:44 -04:00
s1 %= FLETCHER_64;
s2 %= FLETCHER_64;
2022-04-15 11:36:01 -04:00
}
return (s2 << 32) | s1;
}
// -- END OF FILE --