blob: fc8a899ad66b10b076c03147419a44afe3109103 [file] [log] [blame]
Noah Richardsbbf7c862015-04-21 23:30:131/*
2 * Copyright 2015 The WebRTC Project Authors. All rights reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
11#include "webrtc/base/bitbuffer.h"
12
Noah Richards86153c22015-04-28 22:13:4413#include <algorithm>
Noah Richardsbbf7c862015-04-21 23:30:1314#include <limits>
15
16#include "webrtc/base/checks.h"
17
18namespace {
19
20// Returns the lowest (right-most) |bit_count| bits in |byte|.
Noah Richards9b9f1c42015-05-12 19:20:4721uint8_t LowestBits(uint8_t byte, size_t bit_count) {
kwibergaf476c72016-11-28 23:21:3922 RTC_DCHECK_LE(bit_count, 8);
Noah Richards86153c22015-04-28 22:13:4423 return byte & ((1 << bit_count) - 1);
Noah Richardsbbf7c862015-04-21 23:30:1324}
25
26// Returns the highest (left-most) |bit_count| bits in |byte|, shifted to the
27// lowest bits (to the right).
Noah Richards9b9f1c42015-05-12 19:20:4728uint8_t HighestBits(uint8_t byte, size_t bit_count) {
kwibergaf476c72016-11-28 23:21:3929 RTC_DCHECK_LE(bit_count, 8);
Noah Richards9b9f1c42015-05-12 19:20:4730 uint8_t shift = 8 - static_cast<uint8_t>(bit_count);
31 uint8_t mask = 0xFF << shift;
Noah Richardsbbf7c862015-04-21 23:30:1332 return (byte & mask) >> shift;
33}
34
Noah Richards9b9f1c42015-05-12 19:20:4735// Returns the highest byte of |val| in a uint8_t.
36uint8_t HighestByte(uint64_t val) {
37 return static_cast<uint8_t>(val >> 56);
Noah Richards86153c22015-04-28 22:13:4438}
39
40// Returns the result of writing partial data from |source|, of
41// |source_bit_count| size in the highest bits, to |target| at
42// |target_bit_offset| from the highest bit.
Noah Richards9b9f1c42015-05-12 19:20:4743uint8_t WritePartialByte(uint8_t source,
44 size_t source_bit_count,
45 uint8_t target,
46 size_t target_bit_offset) {
henrikg91d6ede2015-09-17 07:24:3447 RTC_DCHECK(target_bit_offset < 8);
48 RTC_DCHECK(source_bit_count < 9);
49 RTC_DCHECK(source_bit_count <= (8 - target_bit_offset));
Noah Richards86153c22015-04-28 22:13:4450 // Generate a mask for just the bits we're going to overwrite, so:
Noah Richards9b9f1c42015-05-12 19:20:4751 uint8_t mask =
Noah Richards86153c22015-04-28 22:13:4452 // The number of bits we want, in the most significant bits...
Noah Richards9b9f1c42015-05-12 19:20:4753 static_cast<uint8_t>(0xFF << (8 - source_bit_count))
Noah Richards86153c22015-04-28 22:13:4454 // ...shifted over to the target offset from the most signficant bit.
55 >> target_bit_offset;
56
57 // We want the target, with the bits we'll overwrite masked off, or'ed with
58 // the bits from the source we want.
59 return (target & ~mask) | (source >> target_bit_offset);
60}
61
62// Counts the number of bits used in the binary representation of val.
Noah Richards9b9f1c42015-05-12 19:20:4763size_t CountBits(uint64_t val) {
Noah Richards86153c22015-04-28 22:13:4464 size_t bit_count = 0;
65 while (val != 0) {
66 bit_count++;
67 val >>= 1;
68 }
69 return bit_count;
70}
71
Noah Richardsbbf7c862015-04-21 23:30:1372} // namespace
73
74namespace rtc {
75
Noah Richards9b9f1c42015-05-12 19:20:4776BitBuffer::BitBuffer(const uint8_t* bytes, size_t byte_count)
Noah Richardsbbf7c862015-04-21 23:30:1377 : bytes_(bytes), byte_count_(byte_count), byte_offset_(), bit_offset_() {
henrikg91d6ede2015-09-17 07:24:3478 RTC_DCHECK(static_cast<uint64_t>(byte_count_) <=
79 std::numeric_limits<uint32_t>::max());
Noah Richardsbbf7c862015-04-21 23:30:1380}
81
Noah Richards9b9f1c42015-05-12 19:20:4782uint64_t BitBuffer::RemainingBitCount() const {
83 return (static_cast<uint64_t>(byte_count_) - byte_offset_) * 8 - bit_offset_;
Noah Richardsbbf7c862015-04-21 23:30:1384}
85
Noah Richards9b9f1c42015-05-12 19:20:4786bool BitBuffer::ReadUInt8(uint8_t* val) {
87 uint32_t bit_val;
88 if (!ReadBits(&bit_val, sizeof(uint8_t) * 8)) {
Noah Richardsbbf7c862015-04-21 23:30:1389 return false;
90 }
henrikg91d6ede2015-09-17 07:24:3491 RTC_DCHECK(bit_val <= std::numeric_limits<uint8_t>::max());
Noah Richards9b9f1c42015-05-12 19:20:4792 *val = static_cast<uint8_t>(bit_val);
Noah Richardsbbf7c862015-04-21 23:30:1393 return true;
94}
95
Noah Richards9b9f1c42015-05-12 19:20:4796bool BitBuffer::ReadUInt16(uint16_t* val) {
97 uint32_t bit_val;
98 if (!ReadBits(&bit_val, sizeof(uint16_t) * 8)) {
Noah Richardsbbf7c862015-04-21 23:30:1399 return false;
100 }
henrikg91d6ede2015-09-17 07:24:34101 RTC_DCHECK(bit_val <= std::numeric_limits<uint16_t>::max());
Noah Richards9b9f1c42015-05-12 19:20:47102 *val = static_cast<uint16_t>(bit_val);
Noah Richardsbbf7c862015-04-21 23:30:13103 return true;
104}
105
Noah Richards9b9f1c42015-05-12 19:20:47106bool BitBuffer::ReadUInt32(uint32_t* val) {
107 return ReadBits(val, sizeof(uint32_t) * 8);
Noah Richardsbbf7c862015-04-21 23:30:13108}
109
Noah Richards9b9f1c42015-05-12 19:20:47110bool BitBuffer::PeekBits(uint32_t* val, size_t bit_count) {
Noah Richardsbbf7c862015-04-21 23:30:13111 if (!val || bit_count > RemainingBitCount() || bit_count > 32) {
112 return false;
113 }
Noah Richards9b9f1c42015-05-12 19:20:47114 const uint8_t* bytes = bytes_ + byte_offset_;
Noah Richardsbbf7c862015-04-21 23:30:13115 size_t remaining_bits_in_current_byte = 8 - bit_offset_;
Noah Richards9b9f1c42015-05-12 19:20:47116 uint32_t bits = LowestBits(*bytes++, remaining_bits_in_current_byte);
Noah Richardsbbf7c862015-04-21 23:30:13117 // If we're reading fewer bits than what's left in the current byte, just
118 // return the portion of this byte that we need.
119 if (bit_count < remaining_bits_in_current_byte) {
120 *val = HighestBits(bits, bit_offset_ + bit_count);
121 return true;
122 }
123 // Otherwise, subtract what we've read from the bit count and read as many
124 // full bytes as we can into bits.
125 bit_count -= remaining_bits_in_current_byte;
126 while (bit_count >= 8) {
127 bits = (bits << 8) | *bytes++;
128 bit_count -= 8;
129 }
130 // Whatever we have left is smaller than a byte, so grab just the bits we need
131 // and shift them into the lowest bits.
132 if (bit_count > 0) {
133 bits <<= bit_count;
134 bits |= HighestBits(*bytes, bit_count);
135 }
136 *val = bits;
137 return true;
138}
139
Noah Richards9b9f1c42015-05-12 19:20:47140bool BitBuffer::ReadBits(uint32_t* val, size_t bit_count) {
Noah Richardsbbf7c862015-04-21 23:30:13141 return PeekBits(val, bit_count) && ConsumeBits(bit_count);
142}
143
144bool BitBuffer::ConsumeBytes(size_t byte_count) {
145 return ConsumeBits(byte_count * 8);
146}
147
148bool BitBuffer::ConsumeBits(size_t bit_count) {
149 if (bit_count > RemainingBitCount()) {
150 return false;
151 }
152
153 byte_offset_ += (bit_offset_ + bit_count) / 8;
154 bit_offset_ = (bit_offset_ + bit_count) % 8;
155 return true;
156}
157
Noah Richards9b9f1c42015-05-12 19:20:47158bool BitBuffer::ReadExponentialGolomb(uint32_t* val) {
Noah Richardsbbf7c862015-04-21 23:30:13159 if (!val) {
160 return false;
161 }
162 // Store off the current byte/bit offset, in case we want to restore them due
163 // to a failed parse.
164 size_t original_byte_offset = byte_offset_;
165 size_t original_bit_offset = bit_offset_;
166
167 // Count the number of leading 0 bits by peeking/consuming them one at a time.
168 size_t zero_bit_count = 0;
Noah Richards9b9f1c42015-05-12 19:20:47169 uint32_t peeked_bit;
Noah Richardsbbf7c862015-04-21 23:30:13170 while (PeekBits(&peeked_bit, 1) && peeked_bit == 0) {
171 zero_bit_count++;
172 ConsumeBits(1);
173 }
174
175 // We should either be at the end of the stream, or the next bit should be 1.
henrikg91d6ede2015-09-17 07:24:34176 RTC_DCHECK(!PeekBits(&peeked_bit, 1) || peeked_bit == 1);
Noah Richardsbbf7c862015-04-21 23:30:13177
178 // The bit count of the value is the number of zeros + 1. Make sure that many
Noah Richards9b9f1c42015-05-12 19:20:47179 // bits fits in a uint32_t and that we have enough bits left for it, and then
Noah Richardsbbf7c862015-04-21 23:30:13180 // read the value.
181 size_t value_bit_count = zero_bit_count + 1;
182 if (value_bit_count > 32 || !ReadBits(val, value_bit_count)) {
henrikg91d6ede2015-09-17 07:24:34183 RTC_CHECK(Seek(original_byte_offset, original_bit_offset));
Noah Richardsbbf7c862015-04-21 23:30:13184 return false;
185 }
186 *val -= 1;
187 return true;
188}
189
Peter Boström8c266e62015-09-24 13:06:50190bool BitBuffer::ReadSignedExponentialGolomb(int32_t* val) {
191 uint32_t unsigned_val;
192 if (!ReadExponentialGolomb(&unsigned_val)) {
193 return false;
194 }
195 if ((unsigned_val & 1) == 0) {
196 *val = -static_cast<int32_t>(unsigned_val / 2);
197 } else {
198 *val = (unsigned_val + 1) / 2;
199 }
200 return true;
201}
202
Noah Richards86153c22015-04-28 22:13:44203void BitBuffer::GetCurrentOffset(
204 size_t* out_byte_offset, size_t* out_bit_offset) {
henrikg91d6ede2015-09-17 07:24:34205 RTC_CHECK(out_byte_offset != NULL);
206 RTC_CHECK(out_bit_offset != NULL);
Noah Richards86153c22015-04-28 22:13:44207 *out_byte_offset = byte_offset_;
208 *out_bit_offset = bit_offset_;
209}
210
211bool BitBuffer::Seek(size_t byte_offset, size_t bit_offset) {
212 if (byte_offset > byte_count_ || bit_offset > 7 ||
213 (byte_offset == byte_count_ && bit_offset > 0)) {
214 return false;
215 }
216 byte_offset_ = byte_offset;
217 bit_offset_ = bit_offset;
218 return true;
219}
220
Noah Richards9b9f1c42015-05-12 19:20:47221BitBufferWriter::BitBufferWriter(uint8_t* bytes, size_t byte_count)
222 : BitBuffer(bytes, byte_count), writable_bytes_(bytes) {
Noah Richards86153c22015-04-28 22:13:44223}
224
Noah Richards9b9f1c42015-05-12 19:20:47225bool BitBufferWriter::WriteUInt8(uint8_t val) {
226 return WriteBits(val, sizeof(uint8_t) * 8);
Noah Richards86153c22015-04-28 22:13:44227}
228
Noah Richards9b9f1c42015-05-12 19:20:47229bool BitBufferWriter::WriteUInt16(uint16_t val) {
230 return WriteBits(val, sizeof(uint16_t) * 8);
Noah Richards86153c22015-04-28 22:13:44231}
232
Noah Richards9b9f1c42015-05-12 19:20:47233bool BitBufferWriter::WriteUInt32(uint32_t val) {
234 return WriteBits(val, sizeof(uint32_t) * 8);
Noah Richards86153c22015-04-28 22:13:44235}
236
Noah Richards9b9f1c42015-05-12 19:20:47237bool BitBufferWriter::WriteBits(uint64_t val, size_t bit_count) {
Noah Richards86153c22015-04-28 22:13:44238 if (bit_count > RemainingBitCount()) {
239 return false;
240 }
241 size_t total_bits = bit_count;
242
243 // For simplicity, push the bits we want to read from val to the highest bits.
Noah Richards9b9f1c42015-05-12 19:20:47244 val <<= (sizeof(uint64_t) * 8 - bit_count);
Noah Richards86153c22015-04-28 22:13:44245
Noah Richards9b9f1c42015-05-12 19:20:47246 uint8_t* bytes = writable_bytes_ + byte_offset_;
Noah Richards86153c22015-04-28 22:13:44247
248 // The first byte is relatively special; the bit offset to write to may put us
249 // in the middle of the byte, and the total bit count to write may require we
250 // save the bits at the end of the byte.
251 size_t remaining_bits_in_current_byte = 8 - bit_offset_;
252 size_t bits_in_first_byte =
253 std::min(bit_count, remaining_bits_in_current_byte);
254 *bytes = WritePartialByte(
255 HighestByte(val), bits_in_first_byte, *bytes, bit_offset_);
256 if (bit_count <= remaining_bits_in_current_byte) {
257 // Nothing left to write, so quit early.
258 return ConsumeBits(total_bits);
259 }
260
261 // Subtract what we've written from the bit count, shift it off the value, and
262 // write the remaining full bytes.
263 val <<= bits_in_first_byte;
264 bytes++;
265 bit_count -= bits_in_first_byte;
266 while (bit_count >= 8) {
267 *bytes++ = HighestByte(val);
268 val <<= 8;
269 bit_count -= 8;
270 }
271
272 // Last byte may also be partial, so write the remaining bits from the top of
273 // val.
274 if (bit_count > 0) {
275 *bytes = WritePartialByte(HighestByte(val), bit_count, *bytes, 0);
276 }
277
278 // All done! Consume the bits we've written.
279 return ConsumeBits(total_bits);
280}
281
Noah Richards9b9f1c42015-05-12 19:20:47282bool BitBufferWriter::WriteExponentialGolomb(uint32_t val) {
283 // We don't support reading UINT32_MAX, because it doesn't fit in a uint32_t
Noah Richards86153c22015-04-28 22:13:44284 // when encoded, so don't support writing it either.
Noah Richards9b9f1c42015-05-12 19:20:47285 if (val == std::numeric_limits<uint32_t>::max()) {
Noah Richards86153c22015-04-28 22:13:44286 return false;
287 }
Noah Richards9b9f1c42015-05-12 19:20:47288 uint64_t val_to_encode = static_cast<uint64_t>(val) + 1;
Noah Richards86153c22015-04-28 22:13:44289
290 // We need to write CountBits(val+1) 0s and then val+1. Since val (as a
Noah Richards9b9f1c42015-05-12 19:20:47291 // uint64_t) has leading zeros, we can just write the total golomb encoded
292 // size worth of bits, knowing the value will appear last.
Noah Richards86153c22015-04-28 22:13:44293 return WriteBits(val_to_encode, CountBits(val_to_encode) * 2 - 1);
294}
295
sprang52033d62016-06-02 09:43:32296bool BitBufferWriter::WriteSignedExponentialGolomb(int32_t val) {
297 if (val == 0) {
298 return WriteExponentialGolomb(0);
299 } else if (val > 0) {
300 uint32_t signed_val = val;
301 return WriteExponentialGolomb((signed_val * 2) - 1);
302 } else {
303 if (val == std::numeric_limits<int32_t>::min())
304 return false; // Not supported, would cause overflow.
305 uint32_t signed_val = -val;
306 return WriteExponentialGolomb(signed_val * 2);
307 }
308}
309
Noah Richardsbbf7c862015-04-21 23:30:13310} // namespace rtc