snappy.go 2.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  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 compression format. It aims for very
  5. // high speeds and reasonable compression.
  6. //
  7. // There are actually two Snappy formats: block and stream. They are related,
  8. // but different: trying to decompress block-compressed data as a Snappy stream
  9. // will fail, and vice versa. The block format is the Decode and Encode
  10. // functions and the stream format is the Reader and Writer types.
  11. //
  12. // The block format, the more common case, is used when the complete size (the
  13. // number of bytes) of the original data is known upfront, at the time
  14. // compression starts. The stream format, also known as the framing format, is
  15. // for when that isn't always true.
  16. //
  17. // The canonical, C++ implementation is at https://github.com/google/snappy and
  18. // it only implements the block format.
  19. package snappy
  20. /*
  21. Each encoded block begins with the varint-encoded length of the decoded data,
  22. followed by a sequence of chunks. Chunks begin and end on byte boundaries. The
  23. first byte of each chunk is broken into its 2 least and 6 most significant bits
  24. called l and m: l ranges in [0, 4) and m ranges in [0, 64). l is the chunk tag.
  25. Zero means a literal tag. All other values mean a copy tag.
  26. For literal tags:
  27. - If m < 60, the next 1 + m bytes are literal bytes.
  28. - Otherwise, let n be the little-endian unsigned integer denoted by the next
  29. m - 59 bytes. The next 1 + n bytes after that are literal bytes.
  30. For copy tags, length bytes are copied from offset bytes ago, in the style of
  31. Lempel-Ziv compression algorithms. In particular:
  32. - For l == 1, the offset ranges in [0, 1<<11) and the length in [4, 12).
  33. The length is 4 + the low 3 bits of m. The high 3 bits of m form bits 8-10
  34. of the offset. The next byte is bits 0-7 of the offset.
  35. - For l == 2, the offset ranges in [0, 1<<16) and the length in [1, 65).
  36. The length is 1 + m. The offset is the little-endian unsigned integer
  37. denoted by the next 2 bytes.
  38. - For l == 3, this tag is a legacy format that is no longer issued by most
  39. encoders. Nonetheless, the offset ranges in [0, 1<<32) and the length in
  40. [1, 65). The length is 1 + m. The offset is the little-endian unsigned
  41. integer denoted by the next 4 bytes.
  42. */