mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-29 11:00:29 +00:00
62ec6e5fe0
ByteBuffer is backed by kmalloc heap memory which is a scarce resource. This fixes an OOM panic when traversing a large directory.
134 lines
4.7 KiB
C++
134 lines
4.7 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
// KBuffer: Statically sized kernel-only memory buffer.
|
|
//
|
|
// A KBuffer is a value-type convenience class that wraps a NonnullRefPtr<KBufferImpl>.
|
|
// The memory is allocated via the global kernel-only page allocator, rather than via
|
|
// kmalloc() which is what ByteBuffer/Vector/etc will use.
|
|
//
|
|
// This makes KBuffer a little heavier to allocate, but much better for large and/or
|
|
// long-lived allocations, since they don't put all that weight and pressure on the
|
|
// severely limited kmalloc heap.
|
|
|
|
#include <AK/Assertions.h>
|
|
#include <AK/ByteBuffer.h>
|
|
#include <AK/LogStream.h>
|
|
#include <AK/Memory.h>
|
|
#include <AK/StringView.h>
|
|
#include <Kernel/VM/MemoryManager.h>
|
|
#include <Kernel/VM/Region.h>
|
|
|
|
namespace Kernel {
|
|
|
|
class KBufferImpl : public RefCounted<KBufferImpl> {
|
|
public:
|
|
static NonnullRefPtr<KBufferImpl> create_with_size(size_t size, u8 access, const char* name)
|
|
{
|
|
auto region = MM.allocate_kernel_region(PAGE_ROUND_UP(size), name, access, false, false);
|
|
ASSERT(region);
|
|
return adopt(*new KBufferImpl(region.release_nonnull(), size));
|
|
}
|
|
|
|
static NonnullRefPtr<KBufferImpl> copy(const void* data, size_t size, u8 access, const char* name)
|
|
{
|
|
auto buffer = create_with_size(size, access, name);
|
|
buffer->region().commit();
|
|
memcpy(buffer->data(), data, size);
|
|
return buffer;
|
|
}
|
|
|
|
u8* data() { return m_region->vaddr().as_ptr(); }
|
|
const u8* data() const { return m_region->vaddr().as_ptr(); }
|
|
size_t size() const { return m_size; }
|
|
size_t capacity() const { return m_region->size(); }
|
|
|
|
void set_size(size_t size)
|
|
{
|
|
ASSERT(size <= capacity());
|
|
m_size = size;
|
|
}
|
|
|
|
const Region& region() const { return *m_region; }
|
|
Region& region() { return *m_region; }
|
|
|
|
private:
|
|
explicit KBufferImpl(NonnullOwnPtr<Region>&& region, size_t size)
|
|
: m_size(size)
|
|
, m_region(move(region))
|
|
{
|
|
}
|
|
|
|
size_t m_size { 0 };
|
|
NonnullOwnPtr<Region> m_region;
|
|
};
|
|
|
|
class KBuffer {
|
|
public:
|
|
static KBuffer create_with_size(size_t size, u8 access = Region::Access::Read | Region::Access::Write, const char* name = "KBuffer")
|
|
{
|
|
return KBuffer(KBufferImpl::create_with_size(size, access, name));
|
|
}
|
|
|
|
static KBuffer copy(const void* data, size_t size, u8 access = Region::Access::Read | Region::Access::Write, const char* name = "KBuffer")
|
|
{
|
|
return KBuffer(KBufferImpl::copy(data, size, access, name));
|
|
}
|
|
|
|
u8* data() { return m_impl->data(); }
|
|
const u8* data() const { return m_impl->data(); }
|
|
size_t size() const { return m_impl->size(); }
|
|
size_t capacity() const { return m_impl->capacity(); }
|
|
|
|
void* end_pointer() { return data() + size(); }
|
|
const void* end_pointer() const { return data() + size(); }
|
|
|
|
void set_size(size_t size) { m_impl->set_size(size); }
|
|
|
|
const KBufferImpl& impl() const { return m_impl; }
|
|
|
|
KBuffer(const ByteBuffer& buffer, u8 access = Region::Access::Read | Region::Access::Write, const char* name = "KBuffer")
|
|
: m_impl(KBufferImpl::copy(buffer.data(), buffer.size(), access, name))
|
|
{
|
|
}
|
|
|
|
private:
|
|
explicit KBuffer(NonnullRefPtr<KBufferImpl>&& impl)
|
|
: m_impl(move(impl))
|
|
{
|
|
}
|
|
|
|
NonnullRefPtr<KBufferImpl> m_impl;
|
|
};
|
|
|
|
inline const LogStream& operator<<(const LogStream& stream, const KBuffer& value)
|
|
{
|
|
return stream << StringView(value.data(), value.size());
|
|
}
|
|
|
|
}
|