michael@0: // Copyright 2011 Google Inc. All Rights Reserved.
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 <string.h>
michael@0: 
michael@0: #include "snappy-sinksource.h"
michael@0: 
michael@0: namespace snappy {
michael@0: 
michael@0: Source::~Source() { }
michael@0: 
michael@0: Sink::~Sink() { }
michael@0: 
michael@0: char* Sink::GetAppendBuffer(size_t length, char* scratch) {
michael@0:   return scratch;
michael@0: }
michael@0: 
michael@0: ByteArraySource::~ByteArraySource() { }
michael@0: 
michael@0: size_t ByteArraySource::Available() const { return left_; }
michael@0: 
michael@0: const char* ByteArraySource::Peek(size_t* len) {
michael@0:   *len = left_;
michael@0:   return ptr_;
michael@0: }
michael@0: 
michael@0: void ByteArraySource::Skip(size_t n) {
michael@0:   left_ -= n;
michael@0:   ptr_ += n;
michael@0: }
michael@0: 
michael@0: UncheckedByteArraySink::~UncheckedByteArraySink() { }
michael@0: 
michael@0: void UncheckedByteArraySink::Append(const char* data, size_t n) {
michael@0:   // Do no copying if the caller filled in the result of GetAppendBuffer()
michael@0:   if (data != dest_) {
michael@0:     memcpy(dest_, data, n);
michael@0:   }
michael@0:   dest_ += n;
michael@0: }
michael@0: 
michael@0: char* UncheckedByteArraySink::GetAppendBuffer(size_t len, char* scratch) {
michael@0:   return dest_;
michael@0: }
michael@0: 
michael@0: 
michael@0: }