mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 07:30:19 +00:00
256 lines
5.4 KiB
C++
256 lines
5.4 KiB
C++
#include "SimpleMalloc.h"
|
|
#include "Assertions.h"
|
|
#include "Types.h"
|
|
#include <sys/mman.h>
|
|
#include <cstring>
|
|
#include <cstdio>
|
|
|
|
namespace SimpleMalloc {
|
|
|
|
class AllocationBitmap {
|
|
public:
|
|
static AllocationBitmap wrap(byte* data, unsigned size)
|
|
{
|
|
return AllocationBitmap(data, size);
|
|
}
|
|
|
|
~AllocationBitmap()
|
|
{
|
|
}
|
|
|
|
unsigned size() const { return m_size; }
|
|
bool get(unsigned index) const
|
|
{
|
|
ASSERT(index < m_size);
|
|
return 0 != (m_data[index / 8] & (1u << (index % 8)));
|
|
}
|
|
void set(unsigned index, bool value) const
|
|
{
|
|
ASSERT(index < m_size);
|
|
if (value)
|
|
m_data[index / 8] |= static_cast<byte>((1u << (index % 8)));
|
|
else
|
|
m_data[index / 8] &= static_cast<byte>(~(1u << (index % 8)));
|
|
}
|
|
|
|
private:
|
|
AllocationBitmap(byte* data, unsigned size)
|
|
: m_data(data)
|
|
, m_size(size)
|
|
{
|
|
}
|
|
|
|
byte* m_data { nullptr };
|
|
unsigned m_size { 0 };
|
|
};
|
|
|
|
template<dword chunkSize>
|
|
class ChunkAllocator {
|
|
public:
|
|
void initialize(byte* base)
|
|
{
|
|
m_base = base;
|
|
m_free = capacityInAllocations();
|
|
dump();
|
|
}
|
|
|
|
static constexpr dword capacityInAllocations()
|
|
{
|
|
return 1048576 / chunkSize;
|
|
}
|
|
|
|
static constexpr dword capacityInBytes()
|
|
{
|
|
return capacityInAllocations() * chunkSize;
|
|
}
|
|
|
|
byte* allocate()
|
|
{
|
|
auto bitmap = this->bitmap();
|
|
for (dword i = 0; i < capacityInAllocations(); ++i) {
|
|
if (!bitmap.get(i)) {
|
|
bitmap.set(i, true);
|
|
--m_free;
|
|
return pointerToChunk(i);
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void dump() const
|
|
{
|
|
printf("ChunkAllocator<%u> @ %p, free: %u\n", chunkSize, m_base, m_free);
|
|
}
|
|
|
|
void free(byte* ptr)
|
|
{
|
|
ASSERT(isInAllocator(ptr));
|
|
auto bitmap = this->bitmap();
|
|
auto chunkIndex = chunkIndexFromPointer(ptr);
|
|
ASSERT(bitmap.get(chunkIndex));
|
|
bitmap.set(chunkIndex, false);
|
|
++m_free;
|
|
}
|
|
|
|
bool isInAllocator(byte* ptr)
|
|
{
|
|
return ptr >= pointerToChunk(0) && ptr <= addressAfterThisAllocator();
|
|
}
|
|
|
|
dword chunkIndexFromPointer(byte* ptr)
|
|
{
|
|
return (ptr - pointerToChunk(0)) / chunkSize;
|
|
}
|
|
|
|
byte* pointerToChunk(dword index)
|
|
{
|
|
return m_base + sizeOfAllocationBitmapInBytes() + (index * chunkSize);
|
|
}
|
|
|
|
AllocationBitmap bitmap()
|
|
{
|
|
return AllocationBitmap::wrap(m_base, capacityInAllocations());
|
|
}
|
|
|
|
static constexpr dword sizeOfAllocationBitmapInBytes()
|
|
{
|
|
return capacityInAllocations() / 8;
|
|
}
|
|
|
|
byte* addressAfterThisAllocator() const
|
|
{
|
|
return m_base + sizeOfAllocationBitmapInBytes() + capacityInBytes();
|
|
}
|
|
|
|
dword numberOfFreeChunks() const
|
|
{
|
|
return m_free;
|
|
}
|
|
|
|
private:
|
|
byte* m_base { nullptr };
|
|
dword m_free { capacityInAllocations() };
|
|
};
|
|
|
|
struct Allocator {
|
|
void initialize();
|
|
void initializeIfNeeded();
|
|
void dump();
|
|
|
|
ChunkAllocator<8> alloc8;
|
|
ChunkAllocator<16> alloc16;
|
|
ChunkAllocator<4096> alloc4096;
|
|
ChunkAllocator<16384> alloc16384;
|
|
|
|
byte* space;
|
|
bool initialized { false };
|
|
};
|
|
|
|
static Allocator allocator;
|
|
|
|
void Allocator::initializeIfNeeded()
|
|
{
|
|
if (initialized)
|
|
return;
|
|
initialize();
|
|
initialized = true;
|
|
}
|
|
|
|
void Allocator::initialize()
|
|
{
|
|
space = (byte*)mmap((void*)0x20000000, 32 * MB, PROT_WRITE | PROT_READ | PROT_EXEC, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
|
|
ASSERT(space != MAP_FAILED);
|
|
alloc8.initialize(space + 0x10000);
|
|
alloc16.initialize(alloc8.addressAfterThisAllocator());
|
|
alloc4096.initialize(alloc16.addressAfterThisAllocator());
|
|
alloc16384.initialize(alloc4096.addressAfterThisAllocator());
|
|
}
|
|
|
|
void Allocator::dump()
|
|
{
|
|
alloc8.dump();
|
|
alloc16.dump();
|
|
alloc4096.dump();
|
|
alloc16384.dump();
|
|
}
|
|
|
|
void initialize()
|
|
{
|
|
allocator.initialize();
|
|
}
|
|
|
|
void dump()
|
|
{
|
|
allocator.dump();
|
|
}
|
|
|
|
byte* allocate(dword size)
|
|
{
|
|
if (!size)
|
|
return nullptr;
|
|
allocator.initializeIfNeeded();
|
|
if (size <= 8) {
|
|
if (auto* ptr = allocator.alloc8.allocate())
|
|
return ptr;
|
|
}
|
|
if (size <= 16) {
|
|
if (auto* ptr = allocator.alloc16.allocate())
|
|
return ptr;
|
|
}
|
|
if (size <= 4096) {
|
|
if (auto* ptr = allocator.alloc4096.allocate())
|
|
return ptr;
|
|
}
|
|
if (size <= 16384) {
|
|
if (auto* ptr = allocator.alloc16384.allocate())
|
|
return ptr;
|
|
}
|
|
printf("SimpleMalloc: unsupported alloc size: %u\n", size);
|
|
ASSERT_NOT_REACHED();
|
|
return nullptr;
|
|
}
|
|
|
|
byte* allocateZeroed(dword size)
|
|
{
|
|
auto* ptr = allocate(size);
|
|
if (!ptr)
|
|
return nullptr;
|
|
memset(ptr, 0, size);
|
|
return ptr;
|
|
}
|
|
|
|
byte* reallocate(byte* ptr, dword size)
|
|
{
|
|
// FIXME;
|
|
(void) ptr;
|
|
(void) size;
|
|
ASSERT_NOT_REACHED();
|
|
return nullptr;
|
|
}
|
|
|
|
void free(byte* ptr)
|
|
{
|
|
if (!ptr)
|
|
return;
|
|
allocator.initializeIfNeeded();
|
|
if (allocator.alloc8.isInAllocator(ptr)) {
|
|
allocator.alloc8.free(ptr);
|
|
return;
|
|
}
|
|
if (allocator.alloc16.isInAllocator(ptr)) {
|
|
allocator.alloc16.free(ptr);
|
|
return;
|
|
}
|
|
if (allocator.alloc4096.isInAllocator(ptr)) {
|
|
allocator.alloc4096.free(ptr);
|
|
return;
|
|
}
|
|
if (allocator.alloc16384.isInAllocator(ptr)) {
|
|
allocator.alloc16384.free(ptr);
|
|
return;
|
|
}
|
|
ASSERT_NOT_REACHED();
|
|
}
|
|
|
|
}
|
|
|