mirror of
https://github.com/intel/isa-l.git
synced 2024-12-12 09:23:50 +01:00
65 lines
2.4 KiB
C
65 lines
2.4 KiB
C
/**********************************************************************
|
|
Copyright(c) 2011-2017 Intel Corporation All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* 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.
|
|
* Neither the name of Intel Corporation nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT
|
|
OWNER 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 <stdint.h>
|
|
#include "igzip_checksums.h"
|
|
|
|
uint32_t
|
|
adler32_base(uint32_t adler32, uint8_t *start, uint32_t length)
|
|
{
|
|
uint8_t *end, *next = start;
|
|
uint64_t A, B;
|
|
|
|
A = adler32 & 0xffff;
|
|
B = adler32 >> 16;
|
|
|
|
while (length > MAX_ADLER_BUF) {
|
|
end = next + MAX_ADLER_BUF;
|
|
for (; next < end; next++) {
|
|
A += *next;
|
|
B += A;
|
|
}
|
|
|
|
A = A % ADLER_MOD;
|
|
B = B % ADLER_MOD;
|
|
length -= MAX_ADLER_BUF;
|
|
}
|
|
|
|
end = next + length;
|
|
for (; next < end; next++) {
|
|
A += *next;
|
|
B += A;
|
|
}
|
|
|
|
A = A % ADLER_MOD;
|
|
B = B % ADLER_MOD;
|
|
|
|
return B << 16 | A;
|
|
}
|