| OLD | NEW |
| (Empty) |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "mojo/public/cpp/bindings/lib/scratch_buffer.h" | |
| 6 | |
| 7 #include <assert.h> | |
| 8 #include <stdlib.h> | |
| 9 #include <string.h> | |
| 10 | |
| 11 #include <algorithm> | |
| 12 | |
| 13 #include "mojo/public/cpp/bindings/lib/bindings_serialization.h" | |
| 14 | |
| 15 // Scrub memory in debug builds to help catch use-after-free bugs. | |
| 16 #ifdef NDEBUG | |
| 17 #define DEBUG_SCRUB(address, size) (void) (address), (void) (size) | |
| 18 #else | |
| 19 #define DEBUG_SCRUB(address, size) memset(address, 0xCD, size) | |
| 20 #endif | |
| 21 | |
| 22 namespace mojo { | |
| 23 namespace internal { | |
| 24 | |
| 25 ScratchBuffer::ScratchBuffer() | |
| 26 : overflow_(NULL) { | |
| 27 fixed_.next = NULL; | |
| 28 fixed_.cursor = internal::AlignPointer(fixed_data_); | |
| 29 fixed_.end = fixed_data_ + kMinSegmentSize; | |
| 30 } | |
| 31 | |
| 32 ScratchBuffer::~ScratchBuffer() { | |
| 33 // Invoke destructors in reverse order to mirror allocation order. | |
| 34 std::deque<PendingDestructor>::reverse_iterator it; | |
| 35 for (it = pending_dtors_.rbegin(); it != pending_dtors_.rend(); ++it) | |
| 36 it->func(it->address); | |
| 37 | |
| 38 while (overflow_) { | |
| 39 Segment* doomed = overflow_; | |
| 40 overflow_ = overflow_->next; | |
| 41 DEBUG_SCRUB(doomed, doomed->end - reinterpret_cast<char*>(doomed)); | |
| 42 free(doomed); | |
| 43 } | |
| 44 DEBUG_SCRUB(fixed_data_, sizeof(fixed_data_)); | |
| 45 } | |
| 46 | |
| 47 void* ScratchBuffer::Allocate(size_t delta, Destructor func) { | |
| 48 delta = internal::Align(delta); | |
| 49 void* result = AllocateInSegment(&fixed_, delta); | |
| 50 if (!result && overflow_) | |
| 51 result = AllocateInSegment(overflow_, delta); | |
| 52 | |
| 53 if (!result && AddOverflowSegment(delta)) | |
| 54 result = AllocateInSegment(overflow_, delta); | |
| 55 | |
| 56 if (func && result) { | |
| 57 PendingDestructor dtor; | |
| 58 dtor.func = func; | |
| 59 dtor.address = result; | |
| 60 pending_dtors_.push_back(dtor); | |
| 61 } | |
| 62 return result; | |
| 63 } | |
| 64 | |
| 65 void* ScratchBuffer::AllocateInSegment(Segment* segment, size_t delta) { | |
| 66 if (static_cast<size_t>(segment->end - segment->cursor) >= delta) { | |
| 67 void* result = segment->cursor; | |
| 68 memset(result, 0, delta); // Required to avoid info leaks. | |
| 69 segment->cursor += delta; | |
| 70 return result; | |
| 71 } | |
| 72 return NULL; | |
| 73 } | |
| 74 | |
| 75 bool ScratchBuffer::AddOverflowSegment(size_t delta) { | |
| 76 if (delta < kMinSegmentSize) | |
| 77 delta = kMinSegmentSize; | |
| 78 | |
| 79 if (delta > kMaxSegmentSize) | |
| 80 return false; | |
| 81 | |
| 82 // Ensure segment buffer is aligned. | |
| 83 size_t padded_segment_size = internal::Align(sizeof(Segment)); | |
| 84 Segment* segment = static_cast<Segment*>( | |
| 85 malloc(padded_segment_size + delta)); | |
| 86 if (segment) { | |
| 87 segment->next = overflow_; | |
| 88 segment->cursor = reinterpret_cast<char*>(segment) + padded_segment_size; | |
| 89 segment->end = segment->cursor + delta; | |
| 90 overflow_ = segment; | |
| 91 return true; | |
| 92 } | |
| 93 | |
| 94 return false; | |
| 95 } | |
| 96 | |
| 97 } // namespace internal | |
| 98 } // namespace mojo | |
| OLD | NEW |