OLD | NEW |
(Empty) | |
| 1 // Copyright (c) 2013 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 "content/common/partial_circular_buffer.h" |
| 6 |
| 7 #include <algorithm> |
| 8 |
| 9 #include "base/logging.h" |
| 10 |
| 11 #define MIN3(a, b, c) std::min(a, std::min(b, c)) |
| 12 |
| 13 namespace content { |
| 14 |
| 15 PartialCircularBuffer::PartialCircularBuffer(void* buffer, |
| 16 size_t buffer_size) |
| 17 : buffer_data_(reinterpret_cast<BufferData*>(buffer)), |
| 18 memory_buffer_size_(buffer_size), |
| 19 data_size_(0), |
| 20 position_(0), |
| 21 total_read_(0) { |
| 22 size_t header_size = |
| 23 buffer_data_->data - reinterpret_cast<uint8*>(buffer_data_); |
| 24 data_size_ = memory_buffer_size_ - header_size; |
| 25 |
| 26 DCHECK(buffer_data_); |
| 27 DCHECK_GE(memory_buffer_size_, header_size); |
| 28 DCHECK_LE(buffer_data_->total_written, data_size_); |
| 29 DCHECK_LT(buffer_data_->wrap_position, data_size_); |
| 30 DCHECK_LT(buffer_data_->end_position, data_size_); |
| 31 } |
| 32 |
| 33 PartialCircularBuffer::PartialCircularBuffer(void* buffer, |
| 34 size_t buffer_size, |
| 35 size_t wrap_position) |
| 36 : buffer_data_(reinterpret_cast<BufferData*>(buffer)), |
| 37 memory_buffer_size_(buffer_size), |
| 38 data_size_(0), |
| 39 position_(0), |
| 40 total_read_(0) { |
| 41 size_t header_size = |
| 42 buffer_data_->data - reinterpret_cast<uint8*>(buffer_data_); |
| 43 data_size_ = memory_buffer_size_ - header_size; |
| 44 |
| 45 DCHECK(buffer_data_); |
| 46 DCHECK_GE(memory_buffer_size_, header_size); |
| 47 DCHECK_LT(wrap_position, data_size_); |
| 48 |
| 49 buffer_data_->total_written = 0; |
| 50 buffer_data_->wrap_position = wrap_position; |
| 51 buffer_data_->end_position = 0; |
| 52 } |
| 53 |
| 54 size_t PartialCircularBuffer::Read(void* buffer, size_t buffer_size) { |
| 55 DCHECK(buffer_data_); |
| 56 if (total_read_ >= buffer_data_->total_written) |
| 57 return 0; |
| 58 |
| 59 uint8* buffer_uint8 = reinterpret_cast<uint8*>(buffer); |
| 60 size_t read = 0; |
| 61 |
| 62 // Read from beginning part. |
| 63 if (position_ < buffer_data_->wrap_position) { |
| 64 size_t to_wrap_pos = buffer_data_->wrap_position - position_; |
| 65 size_t to_eow = buffer_data_->total_written - total_read_; |
| 66 size_t to_read = MIN3(buffer_size, to_wrap_pos, to_eow); |
| 67 memcpy(buffer_uint8, buffer_data_->data + position_, to_read); |
| 68 position_ += to_read; |
| 69 total_read_ += to_read; |
| 70 read += to_read; |
| 71 if (position_ == buffer_data_->wrap_position && |
| 72 buffer_data_->total_written == data_size_) { |
| 73 // We've read all the beginning part, set the position to the middle part. |
| 74 // (The second condition above checks if the wrapping part is filled, i.e. |
| 75 // writing has wrapped.) |
| 76 position_ = buffer_data_->end_position; |
| 77 } |
| 78 if (read >= buffer_size) { |
| 79 DCHECK_EQ(read, buffer_size); |
| 80 return read; |
| 81 } |
| 82 if (read >= to_eow) { |
| 83 DCHECK_EQ(read, to_eow); |
| 84 DCHECK_EQ(total_read_, buffer_data_->total_written); |
| 85 return read; |
| 86 } |
| 87 } |
| 88 |
| 89 // Read from middle part. |
| 90 DCHECK_GE(position_, buffer_data_->wrap_position); |
| 91 if (position_ >= buffer_data_->end_position) { |
| 92 size_t remaining_buffer_size = buffer_size - read; |
| 93 size_t to_eof = data_size_ - position_; |
| 94 size_t to_eow = buffer_data_->total_written - total_read_; |
| 95 size_t to_read = MIN3(remaining_buffer_size, to_eof, to_eow); |
| 96 memcpy(buffer_uint8 + read, buffer_data_->data + position_, to_read); |
| 97 position_ += to_read; |
| 98 total_read_ += to_read; |
| 99 read += to_read; |
| 100 if (position_ == data_size_) { |
| 101 // We've read all the middle part, set position to the end part. |
| 102 position_ = buffer_data_->wrap_position; |
| 103 } |
| 104 if (read >= buffer_size) { |
| 105 DCHECK_EQ(read, buffer_size); |
| 106 return read; |
| 107 } |
| 108 if (total_read_ >= buffer_data_->total_written) { |
| 109 DCHECK_EQ(total_read_, buffer_data_->total_written); |
| 110 return read; |
| 111 } |
| 112 } |
| 113 |
| 114 // Read from end part. |
| 115 DCHECK_GE(position_, buffer_data_->wrap_position); |
| 116 DCHECK_LT(position_, buffer_data_->end_position); |
| 117 size_t remaining_buffer_size = buffer_size - read; |
| 118 size_t to_eob = buffer_data_->end_position - position_; |
| 119 size_t to_eow = buffer_data_->total_written - total_read_; |
| 120 size_t to_read = MIN3(remaining_buffer_size, to_eob, to_eow); |
| 121 memcpy(buffer_uint8 + read, buffer_data_->data + position_, to_read); |
| 122 position_ += to_read; |
| 123 total_read_ += to_read; |
| 124 read += to_read; |
| 125 DCHECK_LE(read, buffer_size); |
| 126 DCHECK_LE(total_read_, buffer_data_->total_written); |
| 127 return read; |
| 128 } |
| 129 |
| 130 void PartialCircularBuffer::Write(const void* buffer, size_t buffer_size) { |
| 131 DCHECK(buffer_data_); |
| 132 size_t position_before_write = position_; |
| 133 |
| 134 size_t to_eof = data_size_ - position_; |
| 135 size_t to_write = std::min(buffer_size, to_eof); |
| 136 DoWrite(buffer_data_->data + position_, buffer, to_write); |
| 137 if (position_ >= data_size_) { |
| 138 DCHECK_EQ(position_, data_size_); |
| 139 position_ = buffer_data_->wrap_position; |
| 140 } |
| 141 |
| 142 if (to_write < buffer_size) { |
| 143 size_t remainder_to_write = buffer_size - to_write; |
| 144 DCHECK_LT(position_, position_before_write); |
| 145 DCHECK_LE(position_ + remainder_to_write, position_before_write); |
| 146 DoWrite(buffer_data_->data + position_, |
| 147 reinterpret_cast<const uint8*>(buffer) + to_write, |
| 148 remainder_to_write); |
| 149 } |
| 150 } |
| 151 |
| 152 void PartialCircularBuffer::DoWrite(void* dest, const void* src, size_t num) { |
| 153 memcpy(dest, src, num); |
| 154 position_ += num; |
| 155 buffer_data_->total_written = |
| 156 std::min(buffer_data_->total_written + num, data_size_); |
| 157 buffer_data_->end_position = position_; |
| 158 } |
| 159 |
| 160 } // namespace content |
OLD | NEW |