xxhash_other.go 1.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
  1. //go:build (!amd64 && !arm64) || appengine || !gc || purego || noasm
  2. package xxhash
  3. // Sum64 computes the 64-bit xxHash digest of b.
  4. func Sum64(b []byte) uint64 {
  5. // A simpler version would be
  6. // d := New()
  7. // d.Write(b)
  8. // return d.Sum64()
  9. // but this is faster, particularly for small inputs.
  10. n := len(b)
  11. var h uint64
  12. if n >= 32 {
  13. v1 := primes[0] + prime2
  14. v2 := prime2
  15. v3 := uint64(0)
  16. v4 := -primes[0]
  17. for len(b) >= 32 {
  18. v1 = round(v1, u64(b[0:8:len(b)]))
  19. v2 = round(v2, u64(b[8:16:len(b)]))
  20. v3 = round(v3, u64(b[16:24:len(b)]))
  21. v4 = round(v4, u64(b[24:32:len(b)]))
  22. b = b[32:len(b):len(b)]
  23. }
  24. h = rol1(v1) + rol7(v2) + rol12(v3) + rol18(v4)
  25. h = mergeRound(h, v1)
  26. h = mergeRound(h, v2)
  27. h = mergeRound(h, v3)
  28. h = mergeRound(h, v4)
  29. } else {
  30. h = prime5
  31. }
  32. h += uint64(n)
  33. for ; len(b) >= 8; b = b[8:] {
  34. k1 := round(0, u64(b[:8]))
  35. h ^= k1
  36. h = rol27(h)*prime1 + prime4
  37. }
  38. if len(b) >= 4 {
  39. h ^= uint64(u32(b[:4])) * prime1
  40. h = rol23(h)*prime2 + prime3
  41. b = b[4:]
  42. }
  43. for ; len(b) > 0; b = b[1:] {
  44. h ^= uint64(b[0]) * prime5
  45. h = rol11(h) * prime1
  46. }
  47. h ^= h >> 33
  48. h *= prime2
  49. h ^= h >> 29
  50. h *= prime3
  51. h ^= h >> 32
  52. return h
  53. }
  54. func writeBlocks(d *Digest, b []byte) int {
  55. v1, v2, v3, v4 := d.v1, d.v2, d.v3, d.v4
  56. n := len(b)
  57. for len(b) >= 32 {
  58. v1 = round(v1, u64(b[0:8:len(b)]))
  59. v2 = round(v2, u64(b[8:16:len(b)]))
  60. v3 = round(v3, u64(b[16:24:len(b)]))
  61. v4 = round(v4, u64(b[24:32:len(b)]))
  62. b = b[32:len(b):len(b)]
  63. }
  64. d.v1, d.v2, d.v3, d.v4 = v1, v2, v3, v4
  65. return n - len(b)
  66. }