Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "media/base/bit_reader.h" | 5 #include "media/base/bit_reader.h" |
| 6 | 6 |
| 7 #include <algorithm> | |
| 8 | |
| 9 namespace media { | 7 namespace media { |
| 10 | 8 |
| 9 namespace { | |
| 10 | |
| 11 class LinearByteStreamProvider : public BitReaderCore::ByteStreamProvider { | |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
Since nothing else can access this class, is there
damienv1
2013/12/28 04:02:23
Done.
| |
| 12 public: | |
| 13 LinearByteStreamProvider(const uint8* data, off_t size); | |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
nit: s/off_t/size_t/ since it is a size?
damienv1
2013/12/28 02:26:17
Need to check what is best (the original code was
damienv1
2013/12/28 04:02:23
Now use "int" everywhere.
| |
| 14 virtual ~LinearByteStreamProvider(); | |
| 15 | |
| 16 // BitReaderCore::ByteStreamProvider implementation. | |
| 17 virtual int GetBytes(int min_n, | |
| 18 int max_n, | |
| 19 const uint8** out) OVERRIDE; | |
| 20 virtual int GetBytesLeft() const OVERRIDE; | |
| 21 | |
| 22 private: | |
| 23 // Pointer to the next unread byte in the stream. | |
| 24 // Does not include bits held in the bit registers. | |
| 25 const uint8* data_; | |
| 26 | |
| 27 // Bytes left in the stream. | |
| 28 // Does not include bits held in the bit registers. | |
| 29 int bytes_left_; | |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
nit: This should match the type passed into the co
damienv1
2013/12/28 02:26:17
Will do.
| |
| 30 }; | |
| 31 | |
| 32 LinearByteStreamProvider::LinearByteStreamProvider( | |
| 33 const uint8* data, off_t size) | |
| 34 : data_(data), | |
| 35 bytes_left_(size) { | |
| 36 DCHECK(data_ != NULL && bytes_left_ > 0); | |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
nit: You should probably change this to
DCHECK(dat
damienv1
2013/12/28 02:26:17
Will do.
| |
| 37 } | |
| 38 | |
| 39 LinearByteStreamProvider::~LinearByteStreamProvider() { | |
| 40 } | |
| 41 | |
| 42 int LinearByteStreamProvider::GetBytes( | |
| 43 int min_nbytes, int max_nbytes, const uint8** out) { | |
| 44 int nbytes = max_nbytes; | |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
nit: Add the following DCHECKS to clarify expectat
damienv1
2013/12/28 02:26:17
Will do.
| |
| 45 if (nbytes > bytes_left_) | |
| 46 nbytes = bytes_left_; | |
| 47 | |
| 48 *out = data_; | |
| 49 data_ += nbytes; | |
| 50 bytes_left_ -= nbytes; | |
| 51 return nbytes; | |
| 52 } | |
| 53 | |
| 54 int LinearByteStreamProvider::GetBytesLeft() const { | |
| 55 return bytes_left_; | |
| 56 } | |
| 57 | |
| 58 } // namespace | |
| 59 | |
| 11 BitReader::BitReader(const uint8* data, off_t size) | 60 BitReader::BitReader(const uint8* data, off_t size) |
| 12 : data_(data), bytes_left_(size), num_remaining_bits_in_curr_byte_(0) { | 61 : byte_stream_provider_(new LinearByteStreamProvider(data, size)), |
|
acolwell GONE FROM CHROMIUM
2013/12/28 01:54:42
If you don't go with my suggestion above, you shou
damienv1
2013/12/28 02:26:17
But in this case, I cannot have LinearByteStreamPr
damienv1
2013/12/28 04:02:23
Did the private inheritance.
acolwell GONE FROM CHROMIUM
2014/01/06 22:44:06
That's ok. You can just make it a private inner cl
| |
| 13 DCHECK(data_ != NULL && bytes_left_ > 0); | 62 bit_reader_core_(byte_stream_provider_.get()) { |
| 14 | |
| 15 UpdateCurrByte(); | |
| 16 } | 63 } |
| 17 | 64 |
| 18 BitReader::~BitReader() {} | 65 BitReader::~BitReader() {} |
| 19 | 66 |
| 20 bool BitReader::SkipBits(int num_bits) { | |
| 21 DCHECK_GE(num_bits, 0); | |
| 22 DVLOG_IF(0, num_bits > 100) | |
| 23 << "BitReader::SkipBits inefficient for large skips"; | |
| 24 | |
| 25 // Skip any bits in the current byte waiting to be processed, then | |
| 26 // process full bytes until less than 8 bits remaining. | |
| 27 while (num_bits > 0 && num_bits > num_remaining_bits_in_curr_byte_) { | |
| 28 num_bits -= num_remaining_bits_in_curr_byte_; | |
| 29 num_remaining_bits_in_curr_byte_ = 0; | |
| 30 UpdateCurrByte(); | |
| 31 | |
| 32 // If there is no more data remaining, only return true if we | |
| 33 // skipped all that were requested. | |
| 34 if (num_remaining_bits_in_curr_byte_ == 0) | |
| 35 return (num_bits == 0); | |
| 36 } | |
| 37 | |
| 38 // Less than 8 bits remaining to skip. Use ReadBitsInternal to verify | |
| 39 // that the remaining bits we need exist, and adjust them as necessary | |
| 40 // for subsequent operations. | |
| 41 uint64 not_needed; | |
| 42 return ReadBitsInternal(num_bits, ¬_needed); | |
| 43 } | |
| 44 | |
| 45 int BitReader::bits_available() const { | |
| 46 return 8 * bytes_left_ + num_remaining_bits_in_curr_byte_; | |
| 47 } | |
| 48 | |
| 49 bool BitReader::ReadBitsInternal(int num_bits, uint64* out) { | |
| 50 DCHECK_LE(num_bits, 64); | |
| 51 | |
| 52 *out = 0; | |
| 53 | |
| 54 while (num_remaining_bits_in_curr_byte_ != 0 && num_bits != 0) { | |
| 55 int bits_to_take = std::min(num_remaining_bits_in_curr_byte_, num_bits); | |
| 56 | |
| 57 *out <<= bits_to_take; | |
| 58 *out += curr_byte_ >> (num_remaining_bits_in_curr_byte_ - bits_to_take); | |
| 59 num_bits -= bits_to_take; | |
| 60 num_remaining_bits_in_curr_byte_ -= bits_to_take; | |
| 61 curr_byte_ &= (1 << num_remaining_bits_in_curr_byte_) - 1; | |
| 62 | |
| 63 if (num_remaining_bits_in_curr_byte_ == 0) | |
| 64 UpdateCurrByte(); | |
| 65 } | |
| 66 | |
| 67 return num_bits == 0; | |
| 68 } | |
| 69 | |
| 70 void BitReader::UpdateCurrByte() { | |
| 71 DCHECK_EQ(num_remaining_bits_in_curr_byte_, 0); | |
| 72 | |
| 73 if (bytes_left_ == 0) | |
| 74 return; | |
| 75 | |
| 76 // Load a new byte and advance pointers. | |
| 77 curr_byte_ = *data_; | |
| 78 ++data_; | |
| 79 --bytes_left_; | |
| 80 num_remaining_bits_in_curr_byte_ = 8; | |
| 81 } | |
| 82 | |
| 83 } // namespace media | 67 } // namespace media |
| OLD | NEW |