2022-12-04 14:45:13 +00:00
|
|
|
#pragma once
|
|
|
|
#include "boot/bootboot.h"
|
|
|
|
#include <luna/Result.h>
|
|
|
|
#include <luna/Types.h>
|
|
|
|
|
|
|
|
struct MemoryMapEntry
|
|
|
|
{
|
2022-12-05 12:23:01 +00:00
|
|
|
MemoryMapEntry() = default;
|
|
|
|
MemoryMapEntry(const MemoryMapEntry& other) = default;
|
|
|
|
MemoryMapEntry(u64 address, u64 size, bool is_free);
|
|
|
|
|
|
|
|
u64 address() const
|
|
|
|
{
|
|
|
|
return m_address;
|
|
|
|
}
|
|
|
|
|
|
|
|
void* ptr() const
|
|
|
|
{
|
|
|
|
return (void*)m_address;
|
|
|
|
}
|
|
|
|
|
|
|
|
u64 size() const
|
|
|
|
{
|
|
|
|
return m_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool is_free() const
|
|
|
|
{
|
|
|
|
return m_is_free;
|
|
|
|
}
|
|
|
|
|
|
|
|
MemoryMapEntry& operator=(const MemoryMapEntry& other);
|
|
|
|
|
|
|
|
private:
|
|
|
|
u64 m_address;
|
|
|
|
u64 m_size;
|
|
|
|
bool m_is_free;
|
2022-12-04 14:45:13 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
class MemoryMapIterator
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
MemoryMapIterator();
|
|
|
|
|
|
|
|
void rewind();
|
|
|
|
|
|
|
|
Result<MemoryMapEntry> next();
|
|
|
|
|
|
|
|
MemoryMapEntry largest_free();
|
|
|
|
|
|
|
|
MemoryMapEntry highest();
|
|
|
|
|
2022-12-05 12:04:01 +00:00
|
|
|
Result<MemoryMapEntry> at(usize index) const;
|
2022-12-04 14:45:13 +00:00
|
|
|
|
2022-12-05 12:04:01 +00:00
|
|
|
usize entries() const
|
2022-12-04 14:45:13 +00:00
|
|
|
{
|
|
|
|
return m_mmap_entries;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2022-12-05 12:23:01 +00:00
|
|
|
const usize m_mmap_entries;
|
2022-12-05 12:04:01 +00:00
|
|
|
const MMapEnt* m_base_ent;
|
2022-12-04 14:45:13 +00:00
|
|
|
usize m_cur_ent;
|
|
|
|
};
|