snappy.h 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  1. // Copyright 2005 and onwards Google Inc.
  2. //
  3. // Redistribution and use in source and binary forms, with or without
  4. // modification, are permitted provided that the following conditions are
  5. // met:
  6. //
  7. // * Redistributions of source code must retain the above copyright
  8. // notice, this list of conditions and the following disclaimer.
  9. // * Redistributions in binary form must reproduce the above
  10. // copyright notice, this list of conditions and the following disclaimer
  11. // in the documentation and/or other materials provided with the
  12. // distribution.
  13. // * Neither the name of Google Inc. nor the names of its
  14. // contributors may be used to endorse or promote products derived from
  15. // this software without specific prior written permission.
  16. //
  17. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  18. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  19. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  20. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  21. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  22. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  23. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  24. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  25. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  27. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. //
  29. // A light-weight compression algorithm. It is designed for speed of
  30. // compression and decompression, rather than for the utmost in space
  31. // savings.
  32. //
  33. // For getting better compression ratios when you are compressing data
  34. // with long repeated sequences or compressing data that is similar to
  35. // other data, while still compressing fast, you might look at first
  36. // using BMDiff and then compressing the output of BMDiff with
  37. // Snappy.
  38. #ifndef THIRD_PARTY_SNAPPY_SNAPPY_H__
  39. #define THIRD_PARTY_SNAPPY_SNAPPY_H__
  40. #include <stddef.h>
  41. #include <stdint.h>
  42. #include <string>
  43. #include <util/generic/fwd.h>
  44. #include "snappy-stubs-public.h"
  45. namespace snappy {
  46. class Source;
  47. class Sink;
  48. // ------------------------------------------------------------------------
  49. // Generic compression/decompression routines.
  50. // ------------------------------------------------------------------------
  51. // Compress the bytes read from "*source" and append to "*sink". Return the
  52. // number of bytes written.
  53. size_t Compress(Source* source, Sink* sink);
  54. // Find the uncompressed length of the given stream, as given by the header.
  55. // Note that the true length could deviate from this; the stream could e.g.
  56. // be truncated.
  57. //
  58. // Also note that this leaves "*source" in a state that is unsuitable for
  59. // further operations, such as RawUncompress(). You will need to rewind
  60. // or recreate the source yourself before attempting any further calls.
  61. bool GetUncompressedLength(Source* source, uint32_t* result);
  62. // ------------------------------------------------------------------------
  63. // Higher-level string based routines (should be sufficient for most users)
  64. // ------------------------------------------------------------------------
  65. // Sets "*compressed" to the compressed version of "input[0,input_length-1]".
  66. // Original contents of *compressed are lost.
  67. //
  68. // REQUIRES: "input[]" is not an alias of "*compressed".
  69. size_t Compress(const char* input, size_t input_length,
  70. std::string* compressed);
  71. size_t Compress(const char* input, size_t input_length,
  72. TString* compressed);
  73. // Decompresses "compressed[0,compressed_length-1]" to "*uncompressed".
  74. // Original contents of "*uncompressed" are lost.
  75. //
  76. // REQUIRES: "compressed[]" is not an alias of "*uncompressed".
  77. //
  78. // returns false if the message is corrupted and could not be decompressed
  79. bool Uncompress(const char* compressed, size_t compressed_length,
  80. std::string* uncompressed);
  81. bool Uncompress(const char* compressed, size_t compressed_length,
  82. TString* uncompressed);
  83. // Decompresses "compressed" to "*uncompressed".
  84. //
  85. // returns false if the message is corrupted and could not be decompressed
  86. bool Uncompress(Source* compressed, Sink* uncompressed);
  87. // This routine uncompresses as much of the "compressed" as possible
  88. // into sink. It returns the number of valid bytes added to sink
  89. // (extra invalid bytes may have been added due to errors; the caller
  90. // should ignore those). The emitted data typically has length
  91. // GetUncompressedLength(), but may be shorter if an error is
  92. // encountered.
  93. size_t UncompressAsMuchAsPossible(Source* compressed, Sink* uncompressed);
  94. // ------------------------------------------------------------------------
  95. // Lower-level character array based routines. May be useful for
  96. // efficiency reasons in certain circumstances.
  97. // ------------------------------------------------------------------------
  98. // REQUIRES: "compressed" must point to an area of memory that is at
  99. // least "MaxCompressedLength(input_length)" bytes in length.
  100. //
  101. // Takes the data stored in "input[0..input_length]" and stores
  102. // it in the array pointed to by "compressed".
  103. //
  104. // "*compressed_length" is set to the length of the compressed output.
  105. //
  106. // Example:
  107. // char* output = new char[snappy::MaxCompressedLength(input_length)];
  108. // size_t output_length;
  109. // RawCompress(input, input_length, output, &output_length);
  110. // ... Process(output, output_length) ...
  111. // delete [] output;
  112. void RawCompress(const char* input,
  113. size_t input_length,
  114. char* compressed,
  115. size_t* compressed_length);
  116. // Given data in "compressed[0..compressed_length-1]" generated by
  117. // calling the Snappy::Compress routine, this routine
  118. // stores the uncompressed data to
  119. // uncompressed[0..GetUncompressedLength(compressed)-1]
  120. // returns false if the message is corrupted and could not be decrypted
  121. bool RawUncompress(const char* compressed, size_t compressed_length,
  122. char* uncompressed);
  123. // Given data from the byte source 'compressed' generated by calling
  124. // the Snappy::Compress routine, this routine stores the uncompressed
  125. // data to
  126. // uncompressed[0..GetUncompressedLength(compressed,compressed_length)-1]
  127. // returns false if the message is corrupted and could not be decrypted
  128. bool RawUncompress(Source* compressed, char* uncompressed);
  129. // Given data in "compressed[0..compressed_length-1]" generated by
  130. // calling the Snappy::Compress routine, this routine
  131. // stores the uncompressed data to the iovec "iov". The number of physical
  132. // buffers in "iov" is given by iov_cnt and their cumulative size
  133. // must be at least GetUncompressedLength(compressed). The individual buffers
  134. // in "iov" must not overlap with each other.
  135. //
  136. // returns false if the message is corrupted and could not be decrypted
  137. bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
  138. const struct iovec* iov, size_t iov_cnt);
  139. // Given data from the byte source 'compressed' generated by calling
  140. // the Snappy::Compress routine, this routine stores the uncompressed
  141. // data to the iovec "iov". The number of physical
  142. // buffers in "iov" is given by iov_cnt and their cumulative size
  143. // must be at least GetUncompressedLength(compressed). The individual buffers
  144. // in "iov" must not overlap with each other.
  145. //
  146. // returns false if the message is corrupted and could not be decrypted
  147. bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
  148. size_t iov_cnt);
  149. // Returns the maximal size of the compressed representation of
  150. // input data that is "source_bytes" bytes in length;
  151. size_t MaxCompressedLength(size_t source_bytes);
  152. // REQUIRES: "compressed[]" was produced by RawCompress() or Compress()
  153. // Returns true and stores the length of the uncompressed data in
  154. // *result normally. Returns false on parsing error.
  155. // This operation takes O(1) time.
  156. bool GetUncompressedLength(const char* compressed, size_t compressed_length,
  157. size_t* result);
  158. // Returns true iff the contents of "compressed[]" can be uncompressed
  159. // successfully. Does not return the uncompressed data. Takes
  160. // time proportional to compressed_length, but is usually at least
  161. // a factor of four faster than actual decompression.
  162. bool IsValidCompressedBuffer(const char* compressed,
  163. size_t compressed_length);
  164. // Returns true iff the contents of "compressed" can be uncompressed
  165. // successfully. Does not return the uncompressed data. Takes
  166. // time proportional to *compressed length, but is usually at least
  167. // a factor of four faster than actual decompression.
  168. // On success, consumes all of *compressed. On failure, consumes an
  169. // unspecified prefix of *compressed.
  170. bool IsValidCompressed(Source* compressed);
  171. // The size of a compression block. Note that many parts of the compression
  172. // code assumes that kBlockSize <= 65536; in particular, the hash table
  173. // can only store 16-bit offsets, and EmitCopy() also assumes the offset
  174. // is 65535 bytes or less. Note also that if you change this, it will
  175. // affect the framing format (see framing_format.txt).
  176. //
  177. // Note that there might be older data around that is compressed with larger
  178. // block sizes, so the decompression code should not rely on the
  179. // non-existence of long backreferences.
  180. static constexpr int kBlockLog = 16;
  181. static constexpr size_t kBlockSize = 1 << kBlockLog;
  182. static constexpr int kMinHashTableBits = 8;
  183. static constexpr size_t kMinHashTableSize = 1 << kMinHashTableBits;
  184. static constexpr int kMaxHashTableBits = 14;
  185. static constexpr size_t kMaxHashTableSize = 1 << kMaxHashTableBits;
  186. } // end namespace snappy
  187. #endif // THIRD_PARTY_SNAPPY_SNAPPY_H__