2022-01-14 00:14:23 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2021, kleines Filmröllchen <filmroellchen@serenityos.org>.
|
|
|
|
*
|
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
|
|
*/
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <AK/ByteBuffer.h>
|
2023-01-22 03:24:18 +00:00
|
|
|
#include <AK/MaybeOwned.h>
|
2022-01-14 00:14:23 +00:00
|
|
|
#include <AK/OwnPtr.h>
|
2023-01-25 19:06:16 +00:00
|
|
|
#include <AK/Stream.h>
|
2022-01-14 00:14:23 +00:00
|
|
|
|
2023-01-25 19:06:16 +00:00
|
|
|
namespace AK {
|
2022-01-14 00:14:23 +00:00
|
|
|
|
|
|
|
/// A stream wrapper class that allows you to read arbitrary amounts of bits
|
|
|
|
/// in big-endian order from another stream.
|
2023-01-25 19:06:16 +00:00
|
|
|
class BigEndianInputBitStream : public Stream {
|
2022-01-14 00:14:23 +00:00
|
|
|
public:
|
2023-01-30 10:03:45 +00:00
|
|
|
explicit BigEndianInputBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
2022-01-14 00:14:23 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// ^Stream
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes bytes) override
|
2022-01-14 00:14:23 +00:00
|
|
|
{
|
|
|
|
if (m_current_byte.has_value() && is_aligned_to_byte_boundary()) {
|
|
|
|
bytes[0] = m_current_byte.release_value();
|
2023-02-24 21:38:01 +00:00
|
|
|
// FIXME: This accidentally slices off the first byte of the returned span.
|
|
|
|
return m_stream->read_some(bytes.slice(1));
|
2022-01-14 00:14:23 +00:00
|
|
|
}
|
|
|
|
align_to_byte_boundary();
|
2023-02-24 21:38:01 +00:00
|
|
|
return m_stream->read_some(bytes);
|
2022-01-14 00:14:23 +00:00
|
|
|
}
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override { return m_stream->write_some(bytes); }
|
2022-12-02 18:26:49 +00: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 00:14:23 +00:00
|
|
|
virtual void close() override
|
|
|
|
{
|
2022-12-02 18:26:49 +00:00
|
|
|
m_stream->close();
|
2022-01-14 00:14:23 +00:00
|
|
|
align_to_byte_boundary();
|
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<bool> read_bit()
|
|
|
|
{
|
|
|
|
return read_bits<bool>(1);
|
|
|
|
}
|
|
|
|
/// 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 17:58:27 +00:00
|
|
|
auto const bit = (m_current_byte.value() >> (7 - m_bit_offset)) & 1;
|
2022-01-14 00:14:23 +00: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 17:58:27 +00:00
|
|
|
auto const bit = (m_current_byte.value() >> (7 - m_bit_offset)) & 1;
|
2022-01-14 00:14:23 +00: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 15:13:47 +00:00
|
|
|
m_current_byte = TRY(m_stream->read_value<u8>());
|
2022-01-14 00:14:23 +00: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.
|
|
|
|
ALWAYS_INLINE bool is_aligned_to_byte_boundary() const { return m_bit_offset == 0; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
Optional<u8> m_current_byte;
|
|
|
|
size_t m_bit_offset { 0 };
|
2023-01-22 03:24:18 +00:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-01-14 00:14:23 +00:00
|
|
|
};
|
|
|
|
|
2022-04-05 19:18:09 +00:00
|
|
|
/// A stream wrapper class that allows you to read arbitrary amounts of bits
|
|
|
|
/// in little-endian order from another stream.
|
2023-01-25 19:06:16 +00:00
|
|
|
class LittleEndianInputBitStream : public Stream {
|
2022-04-05 19:18:09 +00:00
|
|
|
public:
|
2023-01-30 10:04:23 +00:00
|
|
|
explicit LittleEndianInputBitStream(MaybeOwned<Stream> stream)
|
2022-12-02 18:26:49 +00:00
|
|
|
: m_stream(move(stream))
|
2022-04-05 19:18:09 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// ^Stream
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes bytes) override
|
2022-04-05 19:18:09 +00:00
|
|
|
{
|
|
|
|
if (m_current_byte.has_value() && is_aligned_to_byte_boundary()) {
|
|
|
|
bytes[0] = m_current_byte.release_value();
|
2023-02-24 21:38:01 +00:00
|
|
|
// FIXME: This accidentally slices off the first byte of the returned span.
|
|
|
|
return m_stream->read_some(bytes.slice(1));
|
2022-04-05 19:18:09 +00:00
|
|
|
}
|
|
|
|
align_to_byte_boundary();
|
2023-02-24 21:38:01 +00:00
|
|
|
return m_stream->read_some(bytes);
|
2022-04-05 19:18:09 +00:00
|
|
|
}
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override { return m_stream->write_some(bytes); }
|
2022-12-02 18:26:49 +00: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-04-05 19:18:09 +00:00
|
|
|
virtual void close() override
|
|
|
|
{
|
2022-12-02 18:26:49 +00:00
|
|
|
m_stream->close();
|
2022-04-05 19:18:09 +00:00
|
|
|
align_to_byte_boundary();
|
|
|
|
}
|
|
|
|
|
|
|
|
ErrorOr<bool> read_bit()
|
|
|
|
{
|
|
|
|
return read_bits<bool>(1);
|
|
|
|
}
|
|
|
|
/// 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 |= (m_current_byte.value() << nread);
|
|
|
|
nread += 8;
|
|
|
|
m_current_byte.clear();
|
|
|
|
} else {
|
|
|
|
auto const bit = (m_current_byte.value() >> m_bit_offset) & 1;
|
|
|
|
result |= (bit << nread);
|
|
|
|
++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
|
|
|
|
auto const bit = (m_current_byte.value() >> m_bit_offset) & 1;
|
|
|
|
if constexpr (IsSame<bool, T>)
|
|
|
|
result = bit;
|
|
|
|
else
|
|
|
|
result |= (bit << nread);
|
|
|
|
++nread;
|
|
|
|
if (m_bit_offset++ == 7)
|
|
|
|
m_current_byte.clear();
|
|
|
|
}
|
|
|
|
} else {
|
2023-03-01 15:13:47 +00:00
|
|
|
m_current_byte = TRY(m_stream->read_value<u8>());
|
2022-04-05 19:18:09 +00: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.
|
|
|
|
u8 align_to_byte_boundary()
|
|
|
|
{
|
|
|
|
u8 remaining_bits = m_current_byte.value_or(0) >> m_bit_offset;
|
|
|
|
m_current_byte.clear();
|
|
|
|
m_bit_offset = 0;
|
|
|
|
return remaining_bits;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Whether we are (accidentally or intentionally) at a byte boundary right now.
|
|
|
|
ALWAYS_INLINE bool is_aligned_to_byte_boundary() const { return m_bit_offset == 0; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
Optional<u8> m_current_byte;
|
|
|
|
size_t m_bit_offset { 0 };
|
2023-01-22 03:24:18 +00:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-04-05 19:18:09 +00:00
|
|
|
};
|
|
|
|
|
2022-12-26 13:32:01 +00:00
|
|
|
/// A stream wrapper class that allows you to write arbitrary amounts of bits
|
|
|
|
/// in big-endian order to another stream.
|
2023-01-25 19:06:16 +00:00
|
|
|
class BigEndianOutputBitStream : public Stream {
|
2022-12-26 13:32:01 +00:00
|
|
|
public:
|
2023-01-30 10:04:48 +00:00
|
|
|
explicit BigEndianOutputBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes) override
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
return Error::from_errno(EBADF);
|
|
|
|
}
|
|
|
|
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
VERIFY(m_bit_offset == 0);
|
2023-02-24 21:38:01 +00:00
|
|
|
return m_stream->write_some(bytes);
|
2022-12-26 13:32:01 +00: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 15:13:47 +00:00
|
|
|
TRY(m_stream->write_value(m_current_byte));
|
2022-12-26 13:32:01 +00: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 03:24:18 +00:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-12-26 13:32:01 +00: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-01-25 19:06:16 +00:00
|
|
|
class LittleEndianOutputBitStream : public Stream {
|
2022-12-26 13:32:01 +00:00
|
|
|
public:
|
2023-01-30 10:05:12 +00:00
|
|
|
explicit LittleEndianOutputBitStream(MaybeOwned<Stream> stream)
|
|
|
|
: m_stream(move(stream))
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<Bytes> read_some(Bytes) override
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
return Error::from_errno(EBADF);
|
|
|
|
}
|
|
|
|
|
2023-02-24 21:38:01 +00:00
|
|
|
virtual ErrorOr<size_t> write_some(ReadonlyBytes bytes) override
|
2022-12-26 13:32:01 +00:00
|
|
|
{
|
|
|
|
VERIFY(m_bit_offset == 0);
|
2023-02-24 21:38:01 +00:00
|
|
|
return m_stream->write_some(bytes);
|
2022-12-26 13:32:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<Unsigned T>
|
|
|
|
ErrorOr<void> write_bits(T value, size_t bit_count)
|
|
|
|
{
|
|
|
|
VERIFY(m_bit_offset <= 7);
|
|
|
|
|
|
|
|
size_t input_offset = 0;
|
|
|
|
while (input_offset < bit_count) {
|
|
|
|
u8 next_bit = (value >> input_offset) & 1;
|
|
|
|
input_offset++;
|
|
|
|
|
|
|
|
m_current_byte |= next_bit << m_bit_offset;
|
|
|
|
m_bit_offset++;
|
|
|
|
|
|
|
|
if (m_bit_offset > 7) {
|
2023-03-01 15:13:47 +00:00
|
|
|
TRY(m_stream->write_value(m_current_byte));
|
2022-12-26 13:32:01 +00: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 03:24:18 +00:00
|
|
|
MaybeOwned<Stream> m_stream;
|
2022-12-26 13:32:01 +00:00
|
|
|
u8 m_current_byte { 0 };
|
|
|
|
size_t m_bit_offset { 0 };
|
|
|
|
};
|
|
|
|
|
2022-01-14 00:14:23 +00:00
|
|
|
}
|