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 "media/base/bit_reader_core.h" |
| 6 |
| 7 #include <base/sys_byteorder.h> |
| 8 |
| 9 namespace media { |
| 10 |
| 11 BitReaderCore::ByteStreamProvider::ByteStreamProvider() { |
| 12 } |
| 13 |
| 14 BitReaderCore::ByteStreamProvider::~ByteStreamProvider() { |
| 15 } |
| 16 |
| 17 BitReaderCore::BitReaderCore(ByteStreamProvider* byte_stream_provider) |
| 18 : byte_stream_provider_(byte_stream_provider), |
| 19 bit_count_(0), |
| 20 nbits_(0), |
| 21 reg_(0), |
| 22 nbits_next_(0), |
| 23 reg_next_(0) { |
| 24 } |
| 25 |
| 26 BitReaderCore::~BitReaderCore() { |
| 27 } |
| 28 |
| 29 bool BitReaderCore::ReadFlag(bool* flag) { |
| 30 if (nbits_ == 0 && !Refill(1)) |
| 31 return false; |
| 32 |
| 33 *flag = (static_cast<SignedRegType>(reg_) < 0); |
| 34 reg_ <<= 1; |
| 35 nbits_--; |
| 36 bit_count_++; |
| 37 return true; |
| 38 } |
| 39 |
| 40 bool BitReaderCore::ReadUE(uint32* out) { |
| 41 // Get the number of leading zeros. |
| 42 int zero_count = -1; |
| 43 bool is_one; |
| 44 do { |
| 45 if (nbits_ == 0 && !Refill(1)) |
| 46 return false; |
| 47 is_one = (static_cast<SignedRegType>(reg_) < 0); |
| 48 reg_ <<= 1; |
| 49 nbits_--; |
| 50 zero_count++; |
| 51 } while(!is_one); |
| 52 bit_count_ += (zero_count + 1); |
| 53 |
| 54 // If zero_count is greater than 31, the calculated value will overflow. |
| 55 if (zero_count > 31) |
| 56 return false; |
| 57 |
| 58 // Read the actual value. |
| 59 uint32 base = (1 << zero_count) - 1; |
| 60 uint32 offset; |
| 61 if (!ReadBits(zero_count, &offset)) |
| 62 return false; |
| 63 *out = base + offset; |
| 64 |
| 65 return true; |
| 66 } |
| 67 |
| 68 bool BitReaderCore::SkipBits(int num_bits) { |
| 69 DCHECK_GE(num_bits, 0); |
| 70 DVLOG_IF(0, num_bits > 100) |
| 71 << "BitReader::SkipBits inefficient for large skips"; |
| 72 |
| 73 uint64 dummy; |
| 74 while (num_bits >= 32) { |
| 75 if (!ReadBitsInternal(32, &dummy)) |
| 76 return false; |
| 77 num_bits -= 32; |
| 78 } |
| 79 return ReadBitsInternal(num_bits, &dummy); |
| 80 } |
| 81 |
| 82 int BitReaderCore::GetBitCount() const { |
| 83 return bit_count_; |
| 84 } |
| 85 |
| 86 int BitReaderCore::bits_available() const { |
| 87 return nbits_ + nbits_next_; |
| 88 } |
| 89 |
| 90 bool BitReaderCore::HasMoreRBSPData() { |
| 91 // Try to have at least 9 bits (strictly more than 1 byte). |
| 92 if (nbits_ < 9) |
| 93 Refill(9); |
| 94 |
| 95 // Not on last byte. |
| 96 if (nbits_ > 8) |
| 97 return true; |
| 98 |
| 99 // Last byte, look for stop bit; |
| 100 // We have more RBSP data if the last non-zero bit we find is not the |
| 101 // first available bit. |
| 102 return (reg_ << 1) != 0; |
| 103 } |
| 104 |
| 105 bool BitReaderCore::ReadBitsInternal(int num_bits, uint64* out) { |
| 106 DCHECK_GE(num_bits, 0); |
| 107 |
| 108 if (num_bits == 0) { |
| 109 *out = 0; |
| 110 return true; |
| 111 } |
| 112 |
| 113 if (num_bits > nbits_ && !Refill(num_bits)) { |
| 114 // Any subsequent ReadBits should fail: |
| 115 // empty the current bit register for that purposer. |
| 116 nbits_ = 0; |
| 117 reg_ = 0; |
| 118 return false; |
| 119 } |
| 120 |
| 121 bit_count_ += num_bits; |
| 122 |
| 123 if (num_bits == sizeof(RegType) * CHAR_BIT) { |
| 124 // Special case needed since for example for a 64 bit integer "a" |
| 125 // "a << 64" is not defined by the C/C++ standard. |
| 126 *out = reg_; |
| 127 reg_ = 0; |
| 128 nbits_ = 0; |
| 129 return true; |
| 130 } |
| 131 |
| 132 *out = reg_ >> (sizeof(RegType) * CHAR_BIT - num_bits); |
| 133 reg_ <<= num_bits; |
| 134 nbits_ -= num_bits; |
| 135 return true; |
| 136 } |
| 137 |
| 138 bool BitReaderCore::Refill(int min_nbits) { |
| 139 DCHECK_LE(min_nbits, static_cast<int>(sizeof(RegType) * CHAR_BIT)); |
| 140 |
| 141 // Transfer from the next to the current register. |
| 142 RefillCurrentRegister(); |
| 143 if (min_nbits <= nbits_) |
| 144 return true; |
| 145 DCHECK_EQ(nbits_next_, 0); |
| 146 DCHECK_EQ(reg_next_, 0u); |
| 147 |
| 148 // Strict minimum number of bytes to refill. |
| 149 int min_nbytes = (min_nbits - nbits_ + CHAR_BIT - 1) / CHAR_BIT; |
| 150 |
| 151 // Max number of bytes to refill. |
| 152 int max_nbytes = sizeof(RegType); |
| 153 |
| 154 // Refill. |
| 155 const uint8* byte_stream_window; |
| 156 int window_size = |
| 157 byte_stream_provider_->GetBytes( |
| 158 min_nbytes, max_nbytes, &byte_stream_window); |
| 159 if (window_size == 0) |
| 160 return false; |
| 161 |
| 162 reg_next_ = 0; |
| 163 memcpy(®_next_, byte_stream_window, window_size); |
| 164 reg_next_ = base::NetToHost64(reg_next_); |
| 165 nbits_next_ = window_size * CHAR_BIT; |
| 166 |
| 167 // Transfer from the next to the current register. |
| 168 RefillCurrentRegister(); |
| 169 |
| 170 return (nbits_ >= min_nbits); |
| 171 } |
| 172 |
| 173 void BitReaderCore::RefillCurrentRegister() { |
| 174 // No refill possible if the destination register is full |
| 175 // or the source register is empty. |
| 176 if (nbits_ == sizeof(RegType) * CHAR_BIT || nbits_next_ == 0) |
| 177 return; |
| 178 |
| 179 reg_ |= (reg_next_ >> nbits_); |
| 180 |
| 181 int free_nbits = static_cast<int>(sizeof(RegType) * CHAR_BIT) - nbits_; |
| 182 if (free_nbits >= nbits_next_) { |
| 183 nbits_ += nbits_next_; |
| 184 reg_next_ = 0; |
| 185 nbits_next_ = 0; |
| 186 } else { |
| 187 nbits_ += free_nbits; |
| 188 reg_next_ <<= free_nbits; |
| 189 nbits_next_ -= free_nbits; |
| 190 } |
| 191 } |
| 192 |
| 193 } // namespace media |
OLD | NEW |