2022-01-14 03:14:23 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2021, kleines Filmröllchen <filmroellchen@serenityos.org>.
|
|
|
|
*
|
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
|
|
*/
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <AK/ByteBuffer.h>
|
2023-11-05 01:10:33 +03:00
|
|
|
#include <AK/Concepts.h>
|
2023-01-22 06:24:18 +03:00
|
|
|
#include <AK/MaybeOwned.h>
|
2023-03-28 18:58:33 +03:00
|
|
|
#include <AK/NumericLimits.h>
|
2022-01-14 03:14:23 +03:00
|
|
|
#include <AK/OwnPtr.h>
|
2023-01-25 22:06:16 +03:00
|
|
|
#include <AK/Stream.h>
|
2022-01-14 03:14:23 +03:00
|
|
|
|
2023-01-25 22:06:16 +03:00
|
|
|
namespace AK {
|
2022-01-14 03:14:23 +03:00
|
|
|
|
|
|
|
/// A stream wrapper class that allows you to read arbitrary amounts of bits
|
|
|
|
/// in big-endian order from another stream.
|
2023-01-25 22:06:16 +03:00
|
|
|
class BigEndianInputBitStream : public Stream {
|
2022-01-14 03:14:23 +03:00
|
|
|
public:
|
2023-01-30 13:03:45 +03:00
|
|
|
explicit BigEndianInputBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
2022-01-14 03:14:23 +03:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// ^Stream
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes bytes) override
|
2022-01-14 03:14:23 +03:00
|
|
|
{
|
|
|
|
if (m_current_byte.has_value() && is_aligned_to_byte_boundary()) {
|
|
|
|
bytes[0] = m_current_byte.release_value();
|
2023-11-11 14:54:46 +03:00
|
|
|
auto freshly_read_bytes = TRY(m_stream->read_some(bytes.slice(1)));
|
|
|
|
return bytes.trim(1 + freshly_read_bytes.size());
|
2022-01-14 03:14:23 +03:00
|
|
|
}
|
|
|
|
align_to_byte_boundary();
|
2023-02-25 00:38:01 +03:00
|
|
|
return m_stream->read_some(bytes);
|
2022-01-14 03:14:23 +03:00
|
|
|
}
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override { return m_stream->write_some(bytes); }
|
2022-12-02 21:26:49 +03:00
|
|
|
virtual bool is_eof() const override { return m_stream->is_eof() && !m_current_byte.has_value(); }
|
|
|
|
virtual bool is_open() const override { return m_stream->is_open(); }
|
2022-01-14 03:14:23 +03:00
|
|
|
virtual void close() override
|
|
|
|
{
|
2022-12-02 21:26:49 +03:00
|
|
|
m_stream->close();
|
2022-01-14 03:14:23 +03:00
|
|
|
align_to_byte_boundary();
|
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<bool> read_bit()
|
|
|
|
{
|
|
|
|
return read_bits<bool>(1);
|
|
|
|
}
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2022-01-14 03:14:23 +03:00
|
|
|
/// Depending on the number of bits to read, the return type can be chosen appropriately.
|
|
|
|
/// This avoids a bunch of static_cast<>'s for the user.
|
|
|
|
// TODO: Support u128, u256 etc. as well: The concepts would be quite complex.
|
|
|
|
template<Unsigned T = u64>
|
|
|
|
ErrorOr<T> read_bits(size_t count)
|
|
|
|
{
|
|
|
|
if constexpr (IsSame<bool, T>) {
|
|
|
|
VERIFY(count == 1);
|
|
|
|
}
|
|
|
|
T result = 0;
|
|
|
|
|
|
|
|
size_t nread = 0;
|
|
|
|
while (nread < count) {
|
|
|
|
if (m_current_byte.has_value()) {
|
|
|
|
if constexpr (!IsSame<bool, T> && !IsSame<u8, T>) {
|
|
|
|
// read as many bytes as possible directly
|
|
|
|
if (((count - nread) >= 8) && is_aligned_to_byte_boundary()) {
|
|
|
|
// shift existing data over
|
|
|
|
result <<= 8;
|
|
|
|
result |= m_current_byte.value();
|
|
|
|
nread += 8;
|
|
|
|
m_current_byte.clear();
|
|
|
|
} else {
|
2022-04-01 20:58:27 +03:00
|
|
|
auto const bit = (m_current_byte.value() >> (7 - m_bit_offset)) & 1;
|
2022-01-14 03:14:23 +03:00
|
|
|
result <<= 1;
|
|
|
|
result |= bit;
|
|
|
|
++nread;
|
|
|
|
if (m_bit_offset++ == 7)
|
|
|
|
m_current_byte.clear();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Always take this branch for booleans or u8: there's no purpose in reading more than a single bit
|
2022-04-01 20:58:27 +03:00
|
|
|
auto const bit = (m_current_byte.value() >> (7 - m_bit_offset)) & 1;
|
2022-01-14 03:14:23 +03:00
|
|
|
if constexpr (IsSame<bool, T>)
|
|
|
|
result = bit;
|
|
|
|
else {
|
|
|
|
result <<= 1;
|
|
|
|
result |= bit;
|
|
|
|
}
|
|
|
|
++nread;
|
|
|
|
if (m_bit_offset++ == 7)
|
|
|
|
m_current_byte.clear();
|
|
|
|
}
|
|
|
|
} else {
|
2023-03-01 18:13:47 +03:00
|
|
|
m_current_byte = TRY(m_stream->read_value<u8>());
|
2022-01-14 03:14:23 +03:00
|
|
|
m_bit_offset = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Discards any sub-byte stream positioning the input stream may be keeping track of.
|
|
|
|
/// Non-bitwise reads will implicitly call this.
|
|
|
|
void align_to_byte_boundary()
|
|
|
|
{
|
|
|
|
m_current_byte.clear();
|
|
|
|
m_bit_offset = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Whether we are (accidentally or intentionally) at a byte boundary right now.
|
2023-05-18 16:51:46 +03:00
|
|
|
ALWAYS_INLINE bool is_aligned_to_byte_boundary() const { return m_bit_offset % 8 == 0; }
|
2024-01-18 08:28:32 +03:00
|
|
|
ALWAYS_INLINE u8 bits_until_next_byte_boundary() const { return m_bit_offset % 8 == 0 ? 0 : 8 - m_bit_offset; }
|
2022-01-14 03:14:23 +03:00
|
|
|
|
|
|
|
private:
|
|
|
|
Optional<u8> m_current_byte;
|
|
|
|
size_t m_bit_offset { 0 };
|
2023-01-22 06:24:18 +03:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-01-14 03:14:23 +03:00
|
|
|
};
|
|
|
|
|
2023-04-01 23:19:21 +03:00
|
|
|
class LittleEndianBitStream : public Stream {
|
|
|
|
protected:
|
|
|
|
using BufferType = u64;
|
|
|
|
|
|
|
|
static constexpr size_t bits_per_byte = 8u;
|
|
|
|
static constexpr size_t bit_buffer_size = sizeof(BufferType) * bits_per_byte;
|
|
|
|
|
|
|
|
explicit LittleEndianBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2023-03-29 10:03:15 +03:00
|
|
|
template<Unsigned T>
|
|
|
|
static constexpr T lsb_mask(T bits)
|
|
|
|
{
|
|
|
|
constexpr auto max = NumericLimits<T>::max();
|
|
|
|
constexpr auto digits = NumericLimits<T>::digits();
|
|
|
|
|
|
|
|
return bits == 0 ? 0 : max >> (digits - bits);
|
|
|
|
}
|
|
|
|
|
2023-04-01 23:19:21 +03:00
|
|
|
ALWAYS_INLINE bool is_aligned_to_byte_boundary() const { return m_bit_count % bits_per_byte == 0; }
|
|
|
|
|
|
|
|
MaybeOwned<Stream> m_stream;
|
|
|
|
|
|
|
|
BufferType m_bit_buffer { 0 };
|
|
|
|
u8 m_bit_count { 0 };
|
|
|
|
};
|
|
|
|
|
|
|
|
/// A stream wrapper class that allows you to read arbitrary amounts of bits
|
|
|
|
/// in little-endian order from another stream.
|
|
|
|
class LittleEndianInputBitStream : public LittleEndianBitStream {
|
2022-04-05 22:18:09 +03:00
|
|
|
public:
|
2023-11-11 15:42:49 +03:00
|
|
|
enum UnsatisfiableReadBehavior {
|
|
|
|
Reject,
|
|
|
|
FillWithZero,
|
|
|
|
};
|
|
|
|
|
2023-11-11 15:57:48 +03:00
|
|
|
explicit LittleEndianInputBitStream(MaybeOwned<Stream> stream, UnsatisfiableReadBehavior unsatisfiable_read_behavior = UnsatisfiableReadBehavior::Reject)
|
2023-04-01 23:19:21 +03:00
|
|
|
: LittleEndianBitStream(move(stream))
|
2023-11-11 15:42:49 +03:00
|
|
|
, m_unsatisfiable_read_behavior(unsatisfiable_read_behavior)
|
2022-04-05 22:18:09 +03:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// ^Stream
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes bytes) override
|
2022-04-05 22:18:09 +03:00
|
|
|
{
|
|
|
|
align_to_byte_boundary();
|
2023-03-28 18:58:33 +03:00
|
|
|
|
|
|
|
size_t bytes_read = 0;
|
|
|
|
auto buffer = bytes;
|
|
|
|
|
|
|
|
if (m_bit_count > 0) {
|
|
|
|
auto bits_to_read = min(buffer.size() * bits_per_byte, m_bit_count);
|
|
|
|
auto result = TRY(read_bits(bits_to_read));
|
|
|
|
|
|
|
|
bytes_read = bits_to_read / bits_per_byte;
|
|
|
|
buffer.overwrite(0, &result, bytes_read);
|
|
|
|
|
|
|
|
buffer = buffer.slice(bytes_read);
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer = TRY(m_stream->read_some(buffer));
|
|
|
|
bytes_read += buffer.size();
|
|
|
|
|
|
|
|
return bytes.trim(bytes_read);
|
2022-04-05 22:18:09 +03:00
|
|
|
}
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override { return m_stream->write_some(bytes); }
|
2023-03-28 18:58:33 +03:00
|
|
|
virtual bool is_eof() const override { return m_stream->is_eof() && m_bit_count == 0; }
|
2022-12-02 21:26:49 +03:00
|
|
|
virtual bool is_open() const override { return m_stream->is_open(); }
|
2022-04-05 22:18:09 +03:00
|
|
|
virtual void close() override
|
|
|
|
{
|
2022-12-02 21:26:49 +03:00
|
|
|
m_stream->close();
|
2022-04-05 22:18:09 +03:00
|
|
|
align_to_byte_boundary();
|
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<bool> read_bit()
|
|
|
|
{
|
|
|
|
return read_bits<bool>(1);
|
|
|
|
}
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2022-04-05 22:18:09 +03:00
|
|
|
/// Depending on the number of bits to read, the return type can be chosen appropriately.
|
|
|
|
/// This avoids a bunch of static_cast<>'s for the user.
|
|
|
|
// TODO: Support u128, u256 etc. as well: The concepts would be quite complex.
|
|
|
|
template<Unsigned T = u64>
|
|
|
|
ErrorOr<T> read_bits(size_t count)
|
|
|
|
{
|
2023-03-28 18:58:33 +03:00
|
|
|
auto result = TRY(peek_bits<T>(count));
|
|
|
|
discard_previously_peeked_bits(count);
|
2022-04-05 22:18:09 +03:00
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2023-03-28 18:58:33 +03:00
|
|
|
template<Unsigned T = u64>
|
|
|
|
ErrorOr<T> peek_bits(size_t count)
|
|
|
|
{
|
2023-11-28 15:06:19 +03:00
|
|
|
if (count > m_bit_count)
|
|
|
|
TRY(refill_buffer_from_stream(count));
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2023-05-18 14:23:49 +03:00
|
|
|
return m_bit_buffer & lsb_mask<T>(min(count, m_bit_count));
|
2023-03-28 18:58:33 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
ALWAYS_INLINE void discard_previously_peeked_bits(u8 count)
|
|
|
|
{
|
2023-04-27 12:33:08 +03:00
|
|
|
// We allow "retrieving" more bits than we can provide, but we need to make sure that we don't underflow the current bit counter.
|
2023-11-11 15:42:49 +03:00
|
|
|
// This only affects certain "modes", but all the relevant checks have been handled in the respective `peek_bits` call.
|
2023-04-27 12:33:08 +03:00
|
|
|
if (count > m_bit_count)
|
|
|
|
count = m_bit_count;
|
|
|
|
|
2023-05-18 14:23:49 +03:00
|
|
|
m_bit_buffer >>= count;
|
2023-03-28 18:58:33 +03:00
|
|
|
m_bit_count -= count;
|
|
|
|
}
|
|
|
|
|
2022-04-05 22:18:09 +03:00
|
|
|
/// Discards any sub-byte stream positioning the input stream may be keeping track of.
|
|
|
|
/// Non-bitwise reads will implicitly call this.
|
|
|
|
u8 align_to_byte_boundary()
|
|
|
|
{
|
2023-03-28 18:58:33 +03:00
|
|
|
u8 remaining_bits = 0;
|
|
|
|
|
|
|
|
if (auto offset = m_bit_count % bits_per_byte; offset != 0) {
|
|
|
|
remaining_bits = m_bit_buffer & lsb_mask<u8>(offset);
|
|
|
|
discard_previously_peeked_bits(offset);
|
|
|
|
}
|
|
|
|
|
2022-04-05 22:18:09 +03:00
|
|
|
return remaining_bits;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2023-11-28 15:06:19 +03:00
|
|
|
ErrorOr<void> refill_buffer_from_stream(size_t requested_bit_count)
|
2023-03-28 18:58:33 +03:00
|
|
|
{
|
2023-11-28 15:06:19 +03:00
|
|
|
while (requested_bit_count > m_bit_count) [[likely]] {
|
|
|
|
if (m_stream->is_eof()) [[unlikely]] {
|
|
|
|
if (m_unsatisfiable_read_behavior == UnsatisfiableReadBehavior::FillWithZero) {
|
|
|
|
m_bit_count = requested_bit_count;
|
|
|
|
return {};
|
|
|
|
}
|
2023-11-11 15:42:49 +03:00
|
|
|
|
2023-11-28 15:06:19 +03:00
|
|
|
return Error::from_string_literal("Reached end-of-stream without collecting the required number of bits");
|
|
|
|
}
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2023-11-28 15:06:19 +03:00
|
|
|
size_t bits_to_read = bit_buffer_size - m_bit_count;
|
|
|
|
size_t bytes_to_read = bits_to_read / bits_per_byte;
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2023-11-28 15:06:19 +03:00
|
|
|
BufferType buffer = 0;
|
|
|
|
auto bytes = TRY(m_stream->read_some({ &buffer, bytes_to_read }));
|
|
|
|
|
|
|
|
m_bit_buffer |= (buffer << m_bit_count);
|
|
|
|
m_bit_count += bytes.size() * bits_per_byte;
|
|
|
|
}
|
2023-03-28 18:58:33 +03:00
|
|
|
|
2023-11-28 15:06:19 +03:00
|
|
|
return {};
|
2023-03-28 18:58:33 +03:00
|
|
|
}
|
2023-11-11 15:42:49 +03:00
|
|
|
|
|
|
|
UnsatisfiableReadBehavior m_unsatisfiable_read_behavior;
|
2022-04-05 22:18:09 +03:00
|
|
|
};
|
|
|
|
|
2022-12-26 16:32:01 +03:00
|
|
|
/// A stream wrapper class that allows you to write arbitrary amounts of bits
|
|
|
|
/// in big-endian order to another stream.
|
2023-01-25 22:06:16 +03:00
|
|
|
class BigEndianOutputBitStream : public Stream {
|
2022-12-26 16:32:01 +03:00
|
|
|
public:
|
2023-01-30 13:04:48 +03:00
|
|
|
explicit BigEndianOutputBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes) override
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
|
|
|
return Error::from_errno(EBADF);
|
|
|
|
}
|
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
|
|
|
VERIFY(m_bit_offset == 0);
|
2023-02-25 00:38:01 +03:00
|
|
|
return m_stream->write_some(bytes);
|
2022-12-26 16:32:01 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
template<Unsigned T>
|
|
|
|
ErrorOr<void> write_bits(T value, size_t bit_count)
|
|
|
|
{
|
|
|
|
VERIFY(m_bit_offset <= 7);
|
|
|
|
|
|
|
|
while (bit_count > 0) {
|
|
|
|
u8 next_bit = (value >> (bit_count - 1)) & 1;
|
|
|
|
bit_count--;
|
|
|
|
|
|
|
|
m_current_byte <<= 1;
|
|
|
|
m_current_byte |= next_bit;
|
|
|
|
m_bit_offset++;
|
|
|
|
|
|
|
|
if (m_bit_offset > 7) {
|
2023-03-01 18:13:47 +03:00
|
|
|
TRY(m_stream->write_value(m_current_byte));
|
2022-12-26 16:32:01 +03:00
|
|
|
m_bit_offset = 0;
|
|
|
|
m_current_byte = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool is_eof() const override
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool is_open() const override
|
|
|
|
{
|
|
|
|
return m_stream->is_open();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void close() override
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t bit_offset() const
|
|
|
|
{
|
|
|
|
return m_bit_offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<void> align_to_byte_boundary()
|
|
|
|
{
|
|
|
|
if (m_bit_offset == 0)
|
|
|
|
return {};
|
|
|
|
|
|
|
|
TRY(write_bits(0u, 8 - m_bit_offset));
|
|
|
|
VERIFY(m_bit_offset == 0);
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2023-01-22 06:24:18 +03:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-12-26 16:32:01 +03:00
|
|
|
u8 m_current_byte { 0 };
|
|
|
|
size_t m_bit_offset { 0 };
|
|
|
|
};
|
|
|
|
|
|
|
|
/// A stream wrapper class that allows you to write arbitrary amounts of bits
|
|
|
|
/// in little-endian order to another stream.
|
2023-04-01 23:19:21 +03:00
|
|
|
class LittleEndianOutputBitStream : public LittleEndianBitStream {
|
2022-12-26 16:32:01 +03:00
|
|
|
public:
|
2023-01-30 13:05:12 +03:00
|
|
|
explicit LittleEndianOutputBitStream(MaybeOwned<Stream> stream)
|
2023-04-01 23:19:21 +03:00
|
|
|
: LittleEndianBitStream(move(stream))
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes) override
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
|
|
|
return Error::from_errno(EBADF);
|
|
|
|
}
|
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
2023-04-01 23:19:21 +03:00
|
|
|
VERIFY(is_aligned_to_byte_boundary());
|
|
|
|
|
|
|
|
if (m_bit_count > 0)
|
|
|
|
TRY(flush_buffer_to_stream());
|
|
|
|
|
2023-02-25 00:38:01 +03:00
|
|
|
return m_stream->write_some(bytes);
|
2022-12-26 16:32:01 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
template<Unsigned T>
|
2023-04-01 23:19:21 +03:00
|
|
|
ErrorOr<void> write_bits(T value, size_t count)
|
2022-12-26 16:32:01 +03:00
|
|
|
{
|
2023-04-01 23:19:21 +03:00
|
|
|
if (m_bit_count == bit_buffer_size) {
|
|
|
|
TRY(flush_buffer_to_stream());
|
|
|
|
} else if (auto remaining = bit_buffer_size - m_bit_count; count >= remaining) {
|
|
|
|
m_bit_buffer |= (static_cast<BufferType>(value) & lsb_mask<BufferType>(remaining)) << m_bit_count;
|
|
|
|
m_bit_count = bit_buffer_size;
|
2022-12-26 16:32:01 +03:00
|
|
|
|
2023-04-01 23:19:21 +03:00
|
|
|
if (remaining != sizeof(value) * bits_per_byte)
|
|
|
|
value >>= remaining;
|
|
|
|
count -= remaining;
|
2022-12-26 16:32:01 +03:00
|
|
|
|
2023-04-01 23:19:21 +03:00
|
|
|
TRY(flush_buffer_to_stream());
|
|
|
|
}
|
2022-12-26 16:32:01 +03:00
|
|
|
|
2023-04-01 23:19:21 +03:00
|
|
|
if (count == 0)
|
|
|
|
return {};
|
|
|
|
|
|
|
|
m_bit_buffer |= static_cast<BufferType>(value) << m_bit_count;
|
|
|
|
m_bit_count += count;
|
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
ALWAYS_INLINE ErrorOr<void> flush_buffer_to_stream()
|
|
|
|
{
|
|
|
|
auto bytes_to_write = m_bit_count / bits_per_byte;
|
|
|
|
TRY(m_stream->write_until_depleted({ &m_bit_buffer, bytes_to_write }));
|
|
|
|
|
|
|
|
if (m_bit_count == bit_buffer_size) {
|
|
|
|
m_bit_buffer = 0;
|
|
|
|
m_bit_count = 0;
|
|
|
|
} else {
|
|
|
|
auto bits_written = bytes_to_write * bits_per_byte;
|
|
|
|
|
|
|
|
m_bit_buffer >>= bits_written;
|
|
|
|
m_bit_count -= bits_written;
|
2022-12-26 16:32:01 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool is_eof() const override
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool is_open() const override
|
|
|
|
{
|
|
|
|
return m_stream->is_open();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void close() override
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t bit_offset() const
|
|
|
|
{
|
2023-04-01 23:19:21 +03:00
|
|
|
return m_bit_count;
|
2022-12-26 16:32:01 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<void> align_to_byte_boundary()
|
|
|
|
{
|
2023-04-01 23:19:21 +03:00
|
|
|
if (auto offset = m_bit_count % bits_per_byte; offset != 0)
|
|
|
|
TRY(write_bits<u8>(0u, bits_per_byte - offset));
|
2022-12-26 16:32:01 +03:00
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2023-11-05 01:10:33 +03:00
|
|
|
template<typename T>
|
|
|
|
concept InputBitStream = OneOf<T, BigEndianInputBitStream, LittleEndianInputBitStream>;
|
|
|
|
|
2022-01-14 03:14:23 +03:00
|
|
|
}
|
2023-11-05 01:10:33 +03:00
|
|
|
|
|
|
|
#if USING_AK_GLOBALLY
|
|
|
|
using AK::InputBitStream;
|
|
|
|
#endif
|