/* * Copyright (c) 2018-2020, Andreas Kling * Copyright (c) 2021, Gunnar Beutner * * SPDX-License-Identifier: BSD-2-Clause */ #pragma once #include #include #include namespace AK { namespace Detail { template class ByteBuffer { public: ByteBuffer() = default; ~ByteBuffer() { clear(); } ByteBuffer(ByteBuffer const& other) { grow(other.size()); VERIFY(m_size == other.size()); __builtin_memcpy(data(), other.data(), other.size()); } ByteBuffer(ByteBuffer&& other) { move_from(move(other)); } ByteBuffer& operator=(ByteBuffer&& other) { if (this != &other) { if (!is_inline()) kfree(m_outline_buffer); move_from(move(other)); } return *this; } ByteBuffer& operator=(ByteBuffer const& other) { if (this != &other) { if (m_size > other.size()) internal_trim(other.size(), true); else grow(other.size()); __builtin_memcpy(data(), other.data(), other.size()); } return *this; } [[nodiscard]] static ByteBuffer create_uninitialized(size_t size) { return ByteBuffer(size); } [[nodiscard]] static ByteBuffer create_zeroed(size_t size) { auto buffer = create_uninitialized(size); buffer.zero_fill(); VERIFY(size == 0 || (buffer[0] == 0 && buffer[size - 1] == 0)); return buffer; } [[nodiscard]] static ByteBuffer copy(void const* data, size_t size) { auto buffer = create_uninitialized(size); if (size != 0) __builtin_memcpy(buffer.data(), data, size); return buffer; } [[nodiscard]] static ByteBuffer copy(ReadonlyBytes bytes) { return copy(bytes.data(), bytes.size()); } template bool operator==(ByteBuffer const& other) const { if (size() != other.size()) return false; // So they both have data, and the same length. return !__builtin_memcmp(data(), other.data(), size()); } bool operator!=(ByteBuffer const& other) const { return !(*this == other); } [[nodiscard]] u8& operator[](size_t i) { VERIFY(i < m_size); return data()[i]; } [[nodiscard]] u8 const& operator[](size_t i) const { VERIFY(i < m_size); return data()[i]; } [[nodiscard]] bool is_empty() const { return !m_size; } [[nodiscard]] size_t size() const { return m_size; } [[nodiscard]] u8* data() { return is_inline() ? m_inline_buffer : m_outline_buffer; } [[nodiscard]] u8 const* data() const { return is_inline() ? m_inline_buffer : m_outline_buffer; } [[nodiscard]] Bytes bytes() { return { data(), size() }; } [[nodiscard]] ReadonlyBytes bytes() const { return { data(), size() }; } [[nodiscard]] AK::Span span() { return { data(), size() }; } [[nodiscard]] AK::Span span() const { return { data(), size() }; } [[nodiscard]] u8* offset_pointer(int offset) { return data() + offset; } [[nodiscard]] u8 const* offset_pointer(int offset) const { return data() + offset; } [[nodiscard]] void* end_pointer() { return data() + m_size; } [[nodiscard]] void const* end_pointer() const { return data() + m_size; } void trim(size_t size) { internal_trim(size, false); } [[nodiscard]] ByteBuffer slice(size_t offset, size_t size) const { // I cannot hand you a slice I don't have VERIFY(offset + size <= this->size()); return copy(offset_pointer(offset), size); } void clear() { if (!is_inline()) kfree(m_outline_buffer); m_size = 0; } void grow(size_t new_size) { if (new_size <= m_size) return; if (new_size <= capacity()) { m_size = new_size; return; } u8* new_buffer; auto new_capacity = kmalloc_good_size(new_size); if (!is_inline()) { new_buffer = (u8*)krealloc(m_outline_buffer, new_capacity); VERIFY(new_buffer); } else { new_buffer = (u8*)kmalloc(new_capacity); VERIFY(new_buffer); __builtin_memcpy(new_buffer, data(), m_size); } m_outline_buffer = new_buffer; m_outline_capacity = new_capacity; m_size = new_size; } void append(void const* data, size_t data_size) { if (data_size == 0) return; VERIFY(data != nullptr); int old_size = size(); grow(size() + data_size); __builtin_memcpy(this->data() + old_size, data, data_size); } void operator+=(ByteBuffer const& other) { append(other.data(), other.size()); } void overwrite(size_t offset, void const* data, size_t data_size) { // make sure we're not told to write past the end VERIFY(offset + data_size <= size()); __builtin_memcpy(this->data() + offset, data, data_size); } void zero_fill() { __builtin_memset(data(), 0, m_size); } operator Bytes() { return bytes(); } operator ReadonlyBytes() const { return bytes(); } private: ByteBuffer(size_t size) { grow(size); VERIFY(m_size == size); } void move_from(ByteBuffer&& other) { m_size = other.m_size; if (other.m_size > inline_capacity) { m_outline_buffer = other.m_outline_buffer; m_outline_capacity = other.m_outline_capacity; } else __builtin_memcpy(m_inline_buffer, other.m_inline_buffer, other.m_size); other.m_size = 0; } void internal_trim(size_t size, bool may_discard_existing_data) { VERIFY(size <= m_size); if (!is_inline() && size <= inline_capacity) { // m_inline_buffer and m_outline_buffer are part of a union, so save the pointer auto outline_buffer = m_outline_buffer; if (!may_discard_existing_data) __builtin_memcpy(m_inline_buffer, outline_buffer, size); kfree(outline_buffer); } m_size = size; } bool is_inline() const { return m_size <= inline_capacity; } size_t capacity() const { return is_inline() ? inline_capacity : m_outline_capacity; } size_t m_size { 0 }; union { u8 m_inline_buffer[inline_capacity]; struct { u8* m_outline_buffer; size_t m_outline_capacity; }; }; }; } }