Tue, 06 Jan 2015 21:39:09 +0100
Conditionally force memory storage according to privacy.thirdparty.isolate;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.
michael@0 | 1 | // Copyright 2011 Google Inc. All Rights Reserved. |
michael@0 | 2 | // |
michael@0 | 3 | // Redistribution and use in source and binary forms, with or without |
michael@0 | 4 | // modification, are permitted provided that the following conditions are |
michael@0 | 5 | // met: |
michael@0 | 6 | // |
michael@0 | 7 | // * Redistributions of source code must retain the above copyright |
michael@0 | 8 | // notice, this list of conditions and the following disclaimer. |
michael@0 | 9 | // * Redistributions in binary form must reproduce the above |
michael@0 | 10 | // copyright notice, this list of conditions and the following disclaimer |
michael@0 | 11 | // in the documentation and/or other materials provided with the |
michael@0 | 12 | // distribution. |
michael@0 | 13 | // * Neither the name of Google Inc. nor the names of its |
michael@0 | 14 | // contributors may be used to endorse or promote products derived from |
michael@0 | 15 | // this software without specific prior written permission. |
michael@0 | 16 | // |
michael@0 | 17 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
michael@0 | 18 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
michael@0 | 19 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
michael@0 | 20 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
michael@0 | 21 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
michael@0 | 22 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
michael@0 | 23 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
michael@0 | 24 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
michael@0 | 25 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
michael@0 | 26 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
michael@0 | 27 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 28 | |
michael@0 | 29 | #include <string.h> |
michael@0 | 30 | |
michael@0 | 31 | #include "snappy-sinksource.h" |
michael@0 | 32 | |
michael@0 | 33 | namespace snappy { |
michael@0 | 34 | |
michael@0 | 35 | Source::~Source() { } |
michael@0 | 36 | |
michael@0 | 37 | Sink::~Sink() { } |
michael@0 | 38 | |
michael@0 | 39 | char* Sink::GetAppendBuffer(size_t length, char* scratch) { |
michael@0 | 40 | return scratch; |
michael@0 | 41 | } |
michael@0 | 42 | |
michael@0 | 43 | ByteArraySource::~ByteArraySource() { } |
michael@0 | 44 | |
michael@0 | 45 | size_t ByteArraySource::Available() const { return left_; } |
michael@0 | 46 | |
michael@0 | 47 | const char* ByteArraySource::Peek(size_t* len) { |
michael@0 | 48 | *len = left_; |
michael@0 | 49 | return ptr_; |
michael@0 | 50 | } |
michael@0 | 51 | |
michael@0 | 52 | void ByteArraySource::Skip(size_t n) { |
michael@0 | 53 | left_ -= n; |
michael@0 | 54 | ptr_ += n; |
michael@0 | 55 | } |
michael@0 | 56 | |
michael@0 | 57 | UncheckedByteArraySink::~UncheckedByteArraySink() { } |
michael@0 | 58 | |
michael@0 | 59 | void UncheckedByteArraySink::Append(const char* data, size_t n) { |
michael@0 | 60 | // Do no copying if the caller filled in the result of GetAppendBuffer() |
michael@0 | 61 | if (data != dest_) { |
michael@0 | 62 | memcpy(dest_, data, n); |
michael@0 | 63 | } |
michael@0 | 64 | dest_ += n; |
michael@0 | 65 | } |
michael@0 | 66 | |
michael@0 | 67 | char* UncheckedByteArraySink::GetAppendBuffer(size_t len, char* scratch) { |
michael@0 | 68 | return dest_; |
michael@0 | 69 | } |
michael@0 | 70 | |
michael@0 | 71 | |
michael@0 | 72 | } |