2009-01-28 23:03:17 +00:00
|
|
|
/*
|
|
|
|
* Compute the Adler-32 checksum of a data stream.
|
2006-09-03 14:13:32 +00:00
|
|
|
* This is a modified version based on adler32.c from the zlib library.
|
|
|
|
*
|
2006-07-13 21:29:01 +00:00
|
|
|
* Copyright (C) 1995 Mark Adler
|
2006-09-03 14:13:32 +00:00
|
|
|
*
|
|
|
|
* This software is provided 'as-is', without any express or implied
|
|
|
|
* warranty. In no event will the authors be held liable for any damages
|
|
|
|
* arising from the use of this software.
|
|
|
|
*
|
|
|
|
* Permission is granted to anyone to use this software for any purpose,
|
|
|
|
* including commercial applications, and to alter it and redistribute it
|
|
|
|
* freely, subject to the following restrictions:
|
|
|
|
*
|
|
|
|
* 1. The origin of this software must not be misrepresented; you must not
|
|
|
|
* claim that you wrote the original software. If you use this software
|
|
|
|
* in a product, an acknowledgment in the product documentation would be
|
|
|
|
* appreciated but is not required.
|
|
|
|
* 2. Altered source versions must be plainly marked as such, and must not be
|
|
|
|
* misrepresented as being the original software.
|
|
|
|
* 3. This notice may not be removed or altered from any source distribution.
|
2006-07-13 21:29:01 +00:00
|
|
|
*/
|
|
|
|
|
2013-11-02 22:03:15 +00:00
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
* Computes the Adler-32 checksum of a data stream
|
|
|
|
*
|
|
|
|
* This is a modified version based on adler32.c from the zlib library.
|
|
|
|
* @author Mark Adler
|
|
|
|
* @ingroup lavu_adler32
|
|
|
|
*/
|
|
|
|
|
2010-03-09 17:39:19 +00:00
|
|
|
#include "config.h"
|
2006-07-13 21:29:01 +00:00
|
|
|
#include "adler32.h"
|
2012-02-03 21:18:05 +00:00
|
|
|
#include "common.h"
|
2012-02-04 06:52:31 +00:00
|
|
|
#include "intreadwrite.h"
|
2006-07-13 21:29:01 +00:00
|
|
|
|
|
|
|
#define BASE 65521L /* largest prime smaller than 65536 */
|
|
|
|
|
2011-06-30 09:15:10 +00:00
|
|
|
#define DO1(buf) { s1 += *buf++; s2 += s1; }
|
2006-07-19 08:39:50 +00:00
|
|
|
#define DO4(buf) DO1(buf); DO1(buf); DO1(buf); DO1(buf);
|
|
|
|
#define DO16(buf) DO4(buf); DO4(buf); DO4(buf); DO4(buf);
|
2006-07-13 21:29:01 +00:00
|
|
|
|
2011-06-30 09:15:10 +00:00
|
|
|
unsigned long av_adler32_update(unsigned long adler, const uint8_t * buf,
|
|
|
|
unsigned int len)
|
2006-07-13 21:29:01 +00:00
|
|
|
{
|
|
|
|
unsigned long s1 = adler & 0xffff;
|
2006-07-20 08:34:01 +00:00
|
|
|
unsigned long s2 = adler >> 16;
|
2006-07-13 21:29:01 +00:00
|
|
|
|
2011-06-30 09:15:10 +00:00
|
|
|
while (len > 0) {
|
2012-02-04 06:52:31 +00:00
|
|
|
#if HAVE_FAST_64BIT && HAVE_FAST_UNALIGNED && !CONFIG_SMALL
|
|
|
|
unsigned len2 = FFMIN((len-1) & ~7, 23*8);
|
2012-02-03 21:18:05 +00:00
|
|
|
if (len2) {
|
2012-02-04 06:52:31 +00:00
|
|
|
uint64_t a1= 0;
|
|
|
|
uint64_t a2= 0;
|
|
|
|
uint64_t b1= 0;
|
|
|
|
uint64_t b2= 0;
|
2012-02-03 21:18:05 +00:00
|
|
|
len -= len2;
|
2012-02-04 06:52:31 +00:00
|
|
|
s2 += s1*len2;
|
|
|
|
while (len2 >= 8) {
|
|
|
|
uint64_t v = AV_RN64(buf);
|
|
|
|
a2 += a1;
|
|
|
|
b2 += b1;
|
|
|
|
a1 += v &0x00FF00FF00FF00FF;
|
|
|
|
b1 += (v>>8)&0x00FF00FF00FF00FF;
|
|
|
|
len2 -= 8;
|
|
|
|
buf+=8;
|
|
|
|
}
|
2012-02-04 19:27:02 +00:00
|
|
|
|
|
|
|
//We combine the 8 interleaved adler32 checksums without overflows
|
|
|
|
//Decreasing the number of iterations would allow below code to be
|
|
|
|
//simplified but would likely be slower due to the fewer iterations
|
|
|
|
//of the inner loop
|
2012-02-04 06:52:31 +00:00
|
|
|
s1 += ((a1+b1)*0x1000100010001)>>48;
|
|
|
|
s2 += ((((a2&0xFFFF0000FFFF)+(b2&0xFFFF0000FFFF)+((a2>>16)&0xFFFF0000FFFF)+((b2>>16)&0xFFFF0000FFFF))*0x800000008)>>32)
|
|
|
|
#if HAVE_BIGENDIAN
|
|
|
|
+ 2*((b1*0x1000200030004)>>48)
|
|
|
|
+ ((a1*0x1000100010001)>>48)
|
|
|
|
+ 2*((a1*0x0000100020003)>>48);
|
|
|
|
#else
|
|
|
|
+ 2*((a1*0x4000300020001)>>48)
|
|
|
|
+ ((b1*0x1000100010001)>>48)
|
|
|
|
+ 2*((b1*0x3000200010000)>>48);
|
|
|
|
#endif
|
2011-06-30 09:15:10 +00:00
|
|
|
}
|
2006-07-20 08:34:01 +00:00
|
|
|
#else
|
2012-02-04 06:52:31 +00:00
|
|
|
while (len > 4 && s2 < (1U << 31)) {
|
|
|
|
DO4(buf);
|
|
|
|
len -= 4;
|
2006-07-13 21:41:28 +00:00
|
|
|
}
|
2011-06-30 09:15:10 +00:00
|
|
|
#endif
|
2006-07-20 08:34:01 +00:00
|
|
|
DO1(buf); len--;
|
2006-07-13 21:29:01 +00:00
|
|
|
s1 %= BASE;
|
|
|
|
s2 %= BASE;
|
|
|
|
}
|
|
|
|
return (s2 << 16) | s1;
|
|
|
|
}
|
2006-07-20 08:34:01 +00:00
|
|
|
|
|
|
|
#ifdef TEST
|
2011-11-29 21:01:09 +00:00
|
|
|
// LCOV_EXCL_START
|
2011-06-29 18:33:10 +00:00
|
|
|
#include <string.h>
|
2006-07-20 08:34:01 +00:00
|
|
|
#include "log.h"
|
2010-03-09 17:39:19 +00:00
|
|
|
#include "timer.h"
|
2006-07-20 08:34:01 +00:00
|
|
|
#define LEN 7001
|
2011-09-21 16:44:41 +00:00
|
|
|
|
|
|
|
static volatile int checksum;
|
|
|
|
|
2011-06-29 18:33:10 +00:00
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
2006-07-20 08:34:01 +00:00
|
|
|
int i;
|
|
|
|
char data[LEN];
|
2011-06-30 09:15:10 +00:00
|
|
|
|
2009-03-19 01:10:30 +00:00
|
|
|
av_log_set_level(AV_LOG_DEBUG);
|
2011-06-30 09:15:10 +00:00
|
|
|
|
|
|
|
for (i = 0; i < LEN; i++)
|
|
|
|
data[i] = ((i * i) >> 3) + 123 * i;
|
2011-06-29 18:33:10 +00:00
|
|
|
|
|
|
|
if (argc > 1 && !strcmp(argv[1], "-t")) {
|
|
|
|
for (i = 0; i < 1000; i++) {
|
|
|
|
START_TIMER;
|
|
|
|
checksum = av_adler32_update(1, data, LEN);
|
|
|
|
STOP_TIMER("adler");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
checksum = av_adler32_update(1, data, LEN);
|
2006-07-20 08:34:01 +00:00
|
|
|
}
|
2011-06-29 18:33:10 +00:00
|
|
|
|
|
|
|
av_log(NULL, AV_LOG_DEBUG, "%X (expected 50E6E508)\n", checksum);
|
2011-06-30 09:15:10 +00:00
|
|
|
return checksum == 0x50e6e508 ? 0 : 1;
|
2006-07-20 08:34:01 +00:00
|
|
|
}
|
2011-11-29 21:01:09 +00:00
|
|
|
// LCOV_EXCL_STOP
|
2006-07-20 08:34:01 +00:00
|
|
|
#endif
|