adler.c 1.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <flate.h>
  4. enum
  5. {
  6. ADLERITERS = 5552, /* max iters before can overflow 32 bits */
  7. ADLERBASE = 65521 /* largest prime smaller than 65536 */
  8. };
  9. ulong
  10. adler32(ulong adler, void *vbuf, int n)
  11. {
  12. ulong s1, s2;
  13. uchar *buf, *ebuf;
  14. int m;
  15. buf = vbuf;
  16. s1 = adler & 0xffff;
  17. s2 = (adler >> 16) & 0xffff;
  18. for(; n >= 16; n -= m){
  19. m = n;
  20. if(m > ADLERITERS)
  21. m = ADLERITERS;
  22. m &= ~15;
  23. for(ebuf = buf + m; buf < ebuf; buf += 16){
  24. s1 += buf[0];
  25. s2 += s1;
  26. s1 += buf[1];
  27. s2 += s1;
  28. s1 += buf[2];
  29. s2 += s1;
  30. s1 += buf[3];
  31. s2 += s1;
  32. s1 += buf[4];
  33. s2 += s1;
  34. s1 += buf[5];
  35. s2 += s1;
  36. s1 += buf[6];
  37. s2 += s1;
  38. s1 += buf[7];
  39. s2 += s1;
  40. s1 += buf[8];
  41. s2 += s1;
  42. s1 += buf[9];
  43. s2 += s1;
  44. s1 += buf[10];
  45. s2 += s1;
  46. s1 += buf[11];
  47. s2 += s1;
  48. s1 += buf[12];
  49. s2 += s1;
  50. s1 += buf[13];
  51. s2 += s1;
  52. s1 += buf[14];
  53. s2 += s1;
  54. s1 += buf[15];
  55. s2 += s1;
  56. }
  57. s1 %= ADLERBASE;
  58. s2 %= ADLERBASE;
  59. }
  60. if(n){
  61. for(ebuf = buf + n; buf < ebuf; buf++){
  62. s1 += buf[0];
  63. s2 += s1;
  64. }
  65. s1 %= ADLERBASE;
  66. s2 %= ADLERBASE;
  67. }
  68. return (s2 << 16) + s1;
  69. }