You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

87 lines
3.3 KiB

  1. // Copyright 2011 The Snappy-Go Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style
  3. // license that can be found in the LICENSE file.
  4. // Package snappy implements the snappy block-based compression format.
  5. // It aims for very high speeds and reasonable compression.
  6. //
  7. // The C++ snappy implementation is at https://github.com/google/snappy
  8. package snappy // import "github.com/golang/snappy"
  9. import (
  10. "hash/crc32"
  11. )
  12. /*
  13. Each encoded block begins with the varint-encoded length of the decoded data,
  14. followed by a sequence of chunks. Chunks begin and end on byte boundaries. The
  15. first byte of each chunk is broken into its 2 least and 6 most significant bits
  16. called l and m: l ranges in [0, 4) and m ranges in [0, 64). l is the chunk tag.
  17. Zero means a literal tag. All other values mean a copy tag.
  18. For literal tags:
  19. - If m < 60, the next 1 + m bytes are literal bytes.
  20. - Otherwise, let n be the little-endian unsigned integer denoted by the next
  21. m - 59 bytes. The next 1 + n bytes after that are literal bytes.
  22. For copy tags, length bytes are copied from offset bytes ago, in the style of
  23. Lempel-Ziv compression algorithms. In particular:
  24. - For l == 1, the offset ranges in [0, 1<<11) and the length in [4, 12).
  25. The length is 4 + the low 3 bits of m. The high 3 bits of m form bits 8-10
  26. of the offset. The next byte is bits 0-7 of the offset.
  27. - For l == 2, the offset ranges in [0, 1<<16) and the length in [1, 65).
  28. The length is 1 + m. The offset is the little-endian unsigned integer
  29. denoted by the next 2 bytes.
  30. - For l == 3, this tag is a legacy format that is no longer issued by most
  31. encoders. Nonetheless, the offset ranges in [0, 1<<32) and the length in
  32. [1, 65). The length is 1 + m. The offset is the little-endian unsigned
  33. integer denoted by the next 4 bytes.
  34. */
  35. const (
  36. tagLiteral = 0x00
  37. tagCopy1 = 0x01
  38. tagCopy2 = 0x02
  39. tagCopy4 = 0x03
  40. )
  41. const (
  42. checksumSize = 4
  43. chunkHeaderSize = 4
  44. magicChunk = "\xff\x06\x00\x00" + magicBody
  45. magicBody = "sNaPpY"
  46. // maxBlockSize is the maximum size of the input to encodeBlock. It is not
  47. // part of the wire format per se, but some parts of the encoder assume
  48. // that an offset fits into a uint16.
  49. //
  50. // Also, for the framing format (Writer type instead of Encode function),
  51. // https://github.com/google/snappy/blob/master/framing_format.txt says
  52. // that "the uncompressed data in a chunk must be no longer than 65536
  53. // bytes".
  54. maxBlockSize = 65536
  55. // maxEncodedLenOfMaxBlockSize equals MaxEncodedLen(maxBlockSize), but is
  56. // hard coded to be a const instead of a variable, so that obufLen can also
  57. // be a const. Their equivalence is confirmed by
  58. // TestMaxEncodedLenOfMaxBlockSize.
  59. maxEncodedLenOfMaxBlockSize = 76490
  60. obufHeaderLen = len(magicChunk) + checksumSize + chunkHeaderSize
  61. obufLen = obufHeaderLen + maxEncodedLenOfMaxBlockSize
  62. )
  63. const (
  64. chunkTypeCompressedData = 0x00
  65. chunkTypeUncompressedData = 0x01
  66. chunkTypePadding = 0xfe
  67. chunkTypeStreamIdentifier = 0xff
  68. )
  69. var crcTable = crc32.MakeTable(crc32.Castagnoli)
  70. // crc implements the checksum specified in section 3 of
  71. // https://github.com/google/snappy/blob/master/framing_format.txt
  72. func crc(b []byte) uint32 {
  73. c := crc32.Update(0, crcTable, b)
  74. return uint32(c>>15|c<<17) + 0xa282ead8
  75. }