snappy.h 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  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 UTIL_SNAPPY_SNAPPY_H__
  39. #define UTIL_SNAPPY_SNAPPY_H__
  40. #include <stddef.h>
  41. #include <string>
  42. #include "snappy-stubs-public.h"
  43. // Windows does not define ssize_t by default. This is a workaround.
  44. // Please note that this is only defined in the Blosc sources of Snappy.
  45. #if defined(_WIN32) && !defined(__MINGW32__)
  46. #include <BaseTsd.h>
  47. typedef SSIZE_T ssize_t;
  48. #endif
  49. namespace snappy {
  50. class Source;
  51. class Sink;
  52. // ------------------------------------------------------------------------
  53. // Generic compression/decompression routines.
  54. // ------------------------------------------------------------------------
  55. // Compress the bytes read from "*source" and append to "*sink". Return the
  56. // number of bytes written.
  57. size_t Compress(Source* source, Sink* sink);
  58. // Find the uncompressed length of the given stream, as given by the header.
  59. // Note that the true length could deviate from this; the stream could e.g.
  60. // be truncated.
  61. //
  62. // Also note that this leaves "*source" in a state that is unsuitable for
  63. // further operations, such as RawUncompress(). You will need to rewind
  64. // or recreate the source yourself before attempting any further calls.
  65. bool GetUncompressedLength(Source* source, uint32* result);
  66. // ------------------------------------------------------------------------
  67. // Higher-level string based routines (should be sufficient for most users)
  68. // ------------------------------------------------------------------------
  69. // Sets "*output" to the compressed version of "input[0,input_length-1]".
  70. // Original contents of *output are lost.
  71. //
  72. // REQUIRES: "input[]" is not an alias of "*output".
  73. size_t Compress(const char* input, size_t input_length, string* output);
  74. // Decompresses "compressed[0,compressed_length-1]" to "*uncompressed".
  75. // Original contents of "*uncompressed" are lost.
  76. //
  77. // REQUIRES: "compressed[]" is not an alias of "*uncompressed".
  78. //
  79. // returns false if the message is corrupted and could not be decompressed
  80. bool Uncompress(const char* compressed, size_t compressed_length,
  81. string* uncompressed);
  82. // ------------------------------------------------------------------------
  83. // Lower-level character array based routines. May be useful for
  84. // efficiency reasons in certain circumstances.
  85. // ------------------------------------------------------------------------
  86. // REQUIRES: "compressed" must point to an area of memory that is at
  87. // least "MaxCompressedLength(input_length)" bytes in length.
  88. //
  89. // Takes the data stored in "input[0..input_length]" and stores
  90. // it in the array pointed to by "compressed".
  91. //
  92. // "*compressed_length" is set to the length of the compressed output.
  93. //
  94. // Example:
  95. // char* output = new char[snappy::MaxCompressedLength(input_length)];
  96. // size_t output_length;
  97. // RawCompress(input, input_length, output, &output_length);
  98. // ... Process(output, output_length) ...
  99. // delete [] output;
  100. void RawCompress(const char* input,
  101. size_t input_length,
  102. char* compressed,
  103. size_t* compressed_length);
  104. // Given data in "compressed[0..compressed_length-1]" generated by
  105. // calling the Snappy::Compress routine, this routine
  106. // stores the uncompressed data to
  107. // uncompressed[0..GetUncompressedLength(compressed)-1]
  108. // returns false if the message is corrupted and could not be decrypted
  109. bool RawUncompress(const char* compressed, size_t compressed_length,
  110. char* uncompressed);
  111. // Given data from the byte source 'compressed' generated by calling
  112. // the Snappy::Compress routine, this routine stores the uncompressed
  113. // data to
  114. // uncompressed[0..GetUncompressedLength(compressed,compressed_length)-1]
  115. // returns false if the message is corrupted and could not be decrypted
  116. bool RawUncompress(Source* compressed, char* uncompressed);
  117. // Given data in "compressed[0..compressed_length-1]" generated by
  118. // calling the Snappy::Compress routine, this routine
  119. // stores the uncompressed data to the iovec "iov". The number of physical
  120. // buffers in "iov" is given by iov_cnt and their cumulative size
  121. // must be at least GetUncompressedLength(compressed). The individual buffers
  122. // in "iov" must not overlap with each other.
  123. //
  124. // returns false if the message is corrupted and could not be decrypted
  125. bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
  126. const struct iovec* iov, size_t iov_cnt);
  127. // Given data from the byte source 'compressed' generated by calling
  128. // the Snappy::Compress routine, this routine stores the uncompressed
  129. // data to the iovec "iov". The number of physical
  130. // buffers in "iov" is given by iov_cnt and their cumulative size
  131. // must be at least GetUncompressedLength(compressed). The individual buffers
  132. // in "iov" must not overlap with each other.
  133. //
  134. // returns false if the message is corrupted and could not be decrypted
  135. bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
  136. size_t iov_cnt);
  137. // Returns the maximal size of the compressed representation of
  138. // input data that is "source_bytes" bytes in length;
  139. size_t MaxCompressedLength(size_t source_bytes);
  140. // REQUIRES: "compressed[]" was produced by RawCompress() or Compress()
  141. // Returns true and stores the length of the uncompressed data in
  142. // *result normally. Returns false on parsing error.
  143. // This operation takes O(1) time.
  144. bool GetUncompressedLength(const char* compressed, size_t compressed_length,
  145. size_t* result);
  146. // Returns true iff the contents of "compressed[]" can be uncompressed
  147. // successfully. Does not return the uncompressed data. Takes
  148. // time proportional to compressed_length, but is usually at least
  149. // a factor of four faster than actual decompression.
  150. bool IsValidCompressedBuffer(const char* compressed,
  151. size_t compressed_length);
  152. // The size of a compression block. Note that many parts of the compression
  153. // code assumes that kBlockSize <= 65536; in particular, the hash table
  154. // can only store 16-bit offsets, and EmitCopy() also assumes the offset
  155. // is 65535 bytes or less. Note also that if you change this, it will
  156. // affect the framing format (see framing_format.txt).
  157. //
  158. // Note that there might be older data around that is compressed with larger
  159. // block sizes, so the decompression code should not rely on the
  160. // non-existence of long backreferences.
  161. static const int kBlockLog = 16;
  162. static const size_t kBlockSize = 1 << kBlockLog;
  163. static const int kMaxHashTableBits = 14;
  164. static const size_t kMaxHashTableSize = 1 << kMaxHashTableBits;
  165. } // end namespace snappy
  166. #endif // UTIL_SNAPPY_SNAPPY_H__