adler32.c 3.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /*
  2. * Compute the Adler-32 checksum of a data stream.
  3. * This is a modified version based on adler32.c from the zlib library.
  4. *
  5. * Copyright (C) 1995 Mark Adler
  6. *
  7. * This software is provided 'as-is', without any express or implied
  8. * warranty. In no event will the authors be held liable for any damages
  9. * arising from the use of this software.
  10. *
  11. * Permission is granted to anyone to use this software for any purpose,
  12. * including commercial applications, and to alter it and redistribute it
  13. * freely, subject to the following restrictions:
  14. *
  15. * 1. The origin of this software must not be misrepresented; you must not
  16. * claim that you wrote the original software. If you use this software
  17. * in a product, an acknowledgment in the product documentation would be
  18. * appreciated but is not required.
  19. * 2. Altered source versions must be plainly marked as such, and must not be
  20. * misrepresented as being the original software.
  21. * 3. This notice may not be removed or altered from any source distribution.
  22. */
  23. /**
  24. * @file
  25. * Computes the Adler-32 checksum of a data stream
  26. *
  27. * This is a modified version based on adler32.c from the zlib library.
  28. * @author Mark Adler
  29. * @ingroup lavu_adler32
  30. */
  31. #include "config.h"
  32. #include "adler32.h"
  33. #include "common.h"
  34. #include "intreadwrite.h"
  35. #define BASE 65521L /* largest prime smaller than 65536 */
  36. #define DO1(buf) { s1 += *buf++; s2 += s1; }
  37. #define DO4(buf) DO1(buf); DO1(buf); DO1(buf); DO1(buf);
  38. #define DO16(buf) DO4(buf); DO4(buf); DO4(buf); DO4(buf);
  39. unsigned long av_adler32_update(unsigned long adler, const uint8_t * buf,
  40. unsigned int len)
  41. {
  42. unsigned long s1 = adler & 0xffff;
  43. unsigned long s2 = adler >> 16;
  44. while (len > 0) {
  45. #if HAVE_FAST_64BIT && HAVE_FAST_UNALIGNED && !CONFIG_SMALL
  46. unsigned len2 = FFMIN((len-1) & ~7, 23*8);
  47. if (len2) {
  48. uint64_t a1= 0;
  49. uint64_t a2= 0;
  50. uint64_t b1= 0;
  51. uint64_t b2= 0;
  52. len -= len2;
  53. s2 += s1*len2;
  54. while (len2 >= 8) {
  55. uint64_t v = AV_RN64(buf);
  56. a2 += a1;
  57. b2 += b1;
  58. a1 += v &0x00FF00FF00FF00FF;
  59. b1 += (v>>8)&0x00FF00FF00FF00FF;
  60. len2 -= 8;
  61. buf+=8;
  62. }
  63. //We combine the 8 interleaved adler32 checksums without overflows
  64. //Decreasing the number of iterations would allow below code to be
  65. //simplified but would likely be slower due to the fewer iterations
  66. //of the inner loop
  67. s1 += ((a1+b1)*0x1000100010001)>>48;
  68. s2 += ((((a2&0xFFFF0000FFFF)+(b2&0xFFFF0000FFFF)+((a2>>16)&0xFFFF0000FFFF)+((b2>>16)&0xFFFF0000FFFF))*0x800000008)>>32)
  69. #if HAVE_BIGENDIAN
  70. + 2*((b1*0x1000200030004)>>48)
  71. + ((a1*0x1000100010001)>>48)
  72. + 2*((a1*0x0000100020003)>>48);
  73. #else
  74. + 2*((a1*0x4000300020001)>>48)
  75. + ((b1*0x1000100010001)>>48)
  76. + 2*((b1*0x3000200010000)>>48);
  77. #endif
  78. }
  79. #else
  80. while (len > 4 && s2 < (1U << 31)) {
  81. DO4(buf);
  82. len -= 4;
  83. }
  84. #endif
  85. DO1(buf); len--;
  86. s1 %= BASE;
  87. s2 %= BASE;
  88. }
  89. return (s2 << 16) | s1;
  90. }