michael@0: // Copyright 2011 Martin Gieseking . michael@0: // michael@0: // Redistribution and use in source and binary forms, with or without michael@0: // modification, are permitted provided that the following conditions are michael@0: // met: michael@0: // michael@0: // * Redistributions of source code must retain the above copyright michael@0: // notice, this list of conditions and the following disclaimer. michael@0: // * Redistributions in binary form must reproduce the above michael@0: // copyright notice, this list of conditions and the following disclaimer michael@0: // in the documentation and/or other materials provided with the michael@0: // distribution. michael@0: // * Neither the name of Google Inc. nor the names of its michael@0: // contributors may be used to endorse or promote products derived from michael@0: // this software without specific prior written permission. michael@0: // michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. michael@0: michael@0: #include "snappy.h" michael@0: #include "snappy-c.h" michael@0: michael@0: extern "C" { michael@0: michael@0: snappy_status snappy_compress(const char* input, michael@0: size_t input_length, michael@0: char* compressed, michael@0: size_t *compressed_length) { michael@0: if (*compressed_length < snappy_max_compressed_length(input_length)) { michael@0: return SNAPPY_BUFFER_TOO_SMALL; michael@0: } michael@0: snappy::RawCompress(input, input_length, compressed, compressed_length); michael@0: return SNAPPY_OK; michael@0: } michael@0: michael@0: snappy_status snappy_uncompress(const char* compressed, michael@0: size_t compressed_length, michael@0: char* uncompressed, michael@0: size_t* uncompressed_length) { michael@0: size_t real_uncompressed_length; michael@0: if (!snappy::GetUncompressedLength(compressed, michael@0: compressed_length, michael@0: &real_uncompressed_length)) { michael@0: return SNAPPY_INVALID_INPUT; michael@0: } michael@0: if (*uncompressed_length < real_uncompressed_length) { michael@0: return SNAPPY_BUFFER_TOO_SMALL; michael@0: } michael@0: if (!snappy::RawUncompress(compressed, compressed_length, uncompressed)) { michael@0: return SNAPPY_INVALID_INPUT; michael@0: } michael@0: *uncompressed_length = real_uncompressed_length; michael@0: return SNAPPY_OK; michael@0: } michael@0: michael@0: size_t snappy_max_compressed_length(size_t source_length) { michael@0: return snappy::MaxCompressedLength(source_length); michael@0: } michael@0: michael@0: snappy_status snappy_uncompressed_length(const char *compressed, michael@0: size_t compressed_length, michael@0: size_t *result) { michael@0: if (snappy::GetUncompressedLength(compressed, michael@0: compressed_length, michael@0: result)) { michael@0: return SNAPPY_OK; michael@0: } else { michael@0: return SNAPPY_INVALID_INPUT; michael@0: } michael@0: } michael@0: michael@0: snappy_status snappy_validate_compressed_buffer(const char *compressed, michael@0: size_t compressed_length) { michael@0: if (snappy::IsValidCompressedBuffer(compressed, compressed_length)) { michael@0: return SNAPPY_OK; michael@0: } else { michael@0: return SNAPPY_INVALID_INPUT; michael@0: } michael@0: } michael@0: michael@0: } // extern "C"