mirror of
https://github.com/shadps4-emu/shadPS4.git
synced 2025-06-14 22:53:15 +00:00
* Implement sceKernelMapDirectMemory2 Behaves similarly to sceKernelMapDirectMemory, but has a type parameter. * Simplify No need to copy all the MapDirectMemory code over, can just call the function, then do the SetDirectMemoryType call * Clang
994 lines
37 KiB
C++
994 lines
37 KiB
C++
// SPDX-FileCopyrightText: Copyright 2024 shadPS4 Emulator Project
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
#include "common/alignment.h"
|
|
#include "common/assert.h"
|
|
#include "common/config.h"
|
|
#include "common/debug.h"
|
|
#include "core/libraries/kernel/memory.h"
|
|
#include "core/libraries/kernel/orbis_error.h"
|
|
#include "core/libraries/kernel/process.h"
|
|
#include "core/memory.h"
|
|
#include "video_core/renderer_vulkan/vk_rasterizer.h"
|
|
|
|
namespace Core {
|
|
|
|
MemoryManager::MemoryManager() {
|
|
// Insert a virtual memory area that covers the entire area we manage.
|
|
const VAddr system_managed_base = impl.SystemManagedVirtualBase();
|
|
const size_t system_managed_size = impl.SystemManagedVirtualSize();
|
|
const VAddr system_reserved_base = impl.SystemReservedVirtualBase();
|
|
const size_t system_reserved_size = impl.SystemReservedVirtualSize();
|
|
const VAddr user_base = impl.UserVirtualBase();
|
|
const size_t user_size = impl.UserVirtualSize();
|
|
vma_map.emplace(system_managed_base,
|
|
VirtualMemoryArea{system_managed_base, system_managed_size});
|
|
vma_map.emplace(system_reserved_base,
|
|
VirtualMemoryArea{system_reserved_base, system_reserved_size});
|
|
vma_map.emplace(user_base, VirtualMemoryArea{user_base, user_size});
|
|
|
|
// Log initialization.
|
|
LOG_INFO(Kernel_Vmm, "Usable memory address space: {}_GB",
|
|
(system_managed_size + system_reserved_size + user_size) >> 30);
|
|
}
|
|
|
|
MemoryManager::~MemoryManager() = default;
|
|
|
|
void MemoryManager::SetupMemoryRegions(u64 flexible_size, bool use_extended_mem1,
|
|
bool use_extended_mem2) {
|
|
const bool is_neo = ::Libraries::Kernel::sceKernelIsNeoMode();
|
|
auto total_size = is_neo ? SCE_KERNEL_TOTAL_MEM_PRO : SCE_KERNEL_TOTAL_MEM;
|
|
if (Config::isDevKitConsole()) {
|
|
const auto old_size = total_size;
|
|
// Assuming 2gb is neo for now, will need to link it with sceKernelIsDevKit
|
|
total_size += is_neo ? 2_GB : 768_MB;
|
|
LOG_WARNING(Kernel_Vmm,
|
|
"Config::isDevKitConsole is enabled! Added additional {:s} of direct memory.",
|
|
is_neo ? "2 GB" : "768 MB");
|
|
LOG_WARNING(Kernel_Vmm, "Old Direct Size: {:#x} -> New Direct Size: {:#x}", old_size,
|
|
total_size);
|
|
}
|
|
if (!use_extended_mem1 && is_neo) {
|
|
total_size -= 256_MB;
|
|
}
|
|
if (!use_extended_mem2 && !is_neo) {
|
|
total_size -= 128_MB;
|
|
}
|
|
total_flexible_size = flexible_size - SCE_FLEXIBLE_MEMORY_BASE;
|
|
total_direct_size = total_size - flexible_size;
|
|
|
|
// Insert an area that covers direct memory physical block.
|
|
// Note that this should never be called after direct memory allocations have been made.
|
|
dmem_map.clear();
|
|
dmem_map.emplace(0, DirectMemoryArea{0, total_direct_size});
|
|
|
|
LOG_INFO(Kernel_Vmm, "Configured memory regions: flexible size = {:#x}, direct size = {:#x}",
|
|
total_flexible_size, total_direct_size);
|
|
}
|
|
|
|
u64 MemoryManager::ClampRangeSize(VAddr virtual_addr, u64 size) {
|
|
static constexpr u64 MinSizeToClamp = 512_MB;
|
|
// Dont bother with clamping if the size is small so we dont pay a map lookup on every buffer.
|
|
if (size < MinSizeToClamp) {
|
|
return size;
|
|
}
|
|
|
|
// Clamp size to the remaining size of the current VMA.
|
|
auto vma = FindVMA(virtual_addr);
|
|
ASSERT_MSG(vma->second.Contains(virtual_addr, 0),
|
|
"Attempted to access invalid GPU address {:#x}", virtual_addr);
|
|
u64 clamped_size = vma->second.base + vma->second.size - virtual_addr;
|
|
++vma;
|
|
|
|
// Keep adding to the size while there is contigious virtual address space.
|
|
while (!vma->second.IsFree() && clamped_size < size) {
|
|
clamped_size += vma->second.size;
|
|
++vma;
|
|
}
|
|
clamped_size = std::min(clamped_size, size);
|
|
|
|
if (size != clamped_size) {
|
|
LOG_WARNING(Kernel_Vmm, "Clamped requested buffer range addr={:#x}, size={:#x} to {:#x}",
|
|
virtual_addr, size, clamped_size);
|
|
}
|
|
return clamped_size;
|
|
}
|
|
|
|
bool MemoryManager::TryWriteBacking(void* address, const void* data, u32 num_bytes) {
|
|
const VAddr virtual_addr = std::bit_cast<VAddr>(address);
|
|
const auto& vma = FindVMA(virtual_addr)->second;
|
|
ASSERT_MSG(vma.Contains(virtual_addr, 0),
|
|
"Attempting to access out of bounds memory at address {:#x}", virtual_addr);
|
|
if (vma.type != VMAType::Direct) {
|
|
return false;
|
|
}
|
|
u8* backing = impl.BackingBase() + vma.phys_base + (virtual_addr - vma.base);
|
|
memcpy(backing, data, num_bytes);
|
|
return true;
|
|
}
|
|
|
|
PAddr MemoryManager::PoolExpand(PAddr search_start, PAddr search_end, size_t size, u64 alignment) {
|
|
std::scoped_lock lk{mutex};
|
|
alignment = alignment > 0 ? alignment : 64_KB;
|
|
|
|
auto dmem_area = FindDmemArea(search_start);
|
|
auto mapping_start = search_start > dmem_area->second.base
|
|
? Common::AlignUp(search_start, alignment)
|
|
: Common::AlignUp(dmem_area->second.base, alignment);
|
|
auto mapping_end = mapping_start + size;
|
|
|
|
// Find the first free, large enough dmem area in the range.
|
|
while (!dmem_area->second.is_free || dmem_area->second.GetEnd() < mapping_end) {
|
|
// The current dmem_area isn't suitable, move to the next one.
|
|
dmem_area++;
|
|
if (dmem_area == dmem_map.end()) {
|
|
break;
|
|
}
|
|
|
|
// Update local variables based on the new dmem_area
|
|
mapping_start = Common::AlignUp(dmem_area->second.base, alignment);
|
|
mapping_end = mapping_start + size;
|
|
}
|
|
|
|
if (dmem_area == dmem_map.end()) {
|
|
// There are no suitable mappings in this range
|
|
LOG_ERROR(Kernel_Vmm, "Unable to find free direct memory area: size = {:#x}", size);
|
|
return -1;
|
|
}
|
|
|
|
// Add the allocated region to the list and commit its pages.
|
|
auto& area = CarveDmemArea(mapping_start, size)->second;
|
|
area.is_free = false;
|
|
area.is_pooled = true;
|
|
|
|
// Track how much dmem was allocated for pools.
|
|
pool_budget += size;
|
|
|
|
return mapping_start;
|
|
}
|
|
|
|
PAddr MemoryManager::Allocate(PAddr search_start, PAddr search_end, size_t size, u64 alignment,
|
|
int memory_type) {
|
|
std::scoped_lock lk{mutex};
|
|
alignment = alignment > 0 ? alignment : 16_KB;
|
|
|
|
auto dmem_area = FindDmemArea(search_start);
|
|
auto mapping_start = search_start > dmem_area->second.base
|
|
? Common::AlignUp(search_start, alignment)
|
|
: Common::AlignUp(dmem_area->second.base, alignment);
|
|
auto mapping_end = mapping_start + size;
|
|
|
|
// Find the first free, large enough dmem area in the range.
|
|
while (!dmem_area->second.is_free || dmem_area->second.GetEnd() < mapping_end) {
|
|
// The current dmem_area isn't suitable, move to the next one.
|
|
dmem_area++;
|
|
if (dmem_area == dmem_map.end()) {
|
|
break;
|
|
}
|
|
|
|
// Update local variables based on the new dmem_area
|
|
mapping_start = Common::AlignUp(dmem_area->second.base, alignment);
|
|
mapping_end = mapping_start + size;
|
|
}
|
|
|
|
if (dmem_area == dmem_map.end()) {
|
|
// There are no suitable mappings in this range
|
|
LOG_ERROR(Kernel_Vmm, "Unable to find free direct memory area: size = {:#x}", size);
|
|
return -1;
|
|
}
|
|
|
|
// Add the allocated region to the list and commit its pages.
|
|
auto& area = CarveDmemArea(mapping_start, size)->second;
|
|
area.memory_type = memory_type;
|
|
area.is_free = false;
|
|
return mapping_start;
|
|
}
|
|
|
|
void MemoryManager::Free(PAddr phys_addr, size_t size) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
auto dmem_area = CarveDmemArea(phys_addr, size);
|
|
|
|
// Release any dmem mappings that reference this physical block.
|
|
std::vector<std::pair<VAddr, u64>> remove_list;
|
|
for (const auto& [addr, mapping] : vma_map) {
|
|
if (mapping.type != VMAType::Direct) {
|
|
continue;
|
|
}
|
|
if (mapping.phys_base <= phys_addr && phys_addr < mapping.phys_base + mapping.size) {
|
|
auto vma_segment_start_addr = phys_addr - mapping.phys_base + addr;
|
|
LOG_INFO(Kernel_Vmm, "Unmaping direct mapping {:#x} with size {:#x}",
|
|
vma_segment_start_addr, size);
|
|
// Unmaping might erase from vma_map. We can't do it here.
|
|
remove_list.emplace_back(vma_segment_start_addr, size);
|
|
}
|
|
}
|
|
for (const auto& [addr, size] : remove_list) {
|
|
UnmapMemoryImpl(addr, size);
|
|
}
|
|
|
|
// Mark region as free and attempt to coalesce it with neighbours.
|
|
auto& area = dmem_area->second;
|
|
area.is_free = true;
|
|
area.memory_type = 0;
|
|
MergeAdjacent(dmem_map, dmem_area);
|
|
}
|
|
|
|
int MemoryManager::PoolReserve(void** out_addr, VAddr virtual_addr, size_t size,
|
|
MemoryMapFlags flags, u64 alignment) {
|
|
std::scoped_lock lk{mutex};
|
|
alignment = alignment > 0 ? alignment : 2_MB;
|
|
VAddr min_address = Common::AlignUp(impl.SystemManagedVirtualBase(), alignment);
|
|
VAddr mapped_addr = Common::AlignUp(virtual_addr, alignment);
|
|
|
|
// Fixed mapping means the virtual address must exactly match the provided one.
|
|
if (True(flags & MemoryMapFlags::Fixed)) {
|
|
// Make sure we're mapping to a valid address
|
|
mapped_addr = mapped_addr > min_address ? mapped_addr : min_address;
|
|
auto vma = FindVMA(mapped_addr)->second;
|
|
size_t remaining_size = vma.base + vma.size - mapped_addr;
|
|
// If the VMA is mapped or there's not enough space, unmap the region first.
|
|
if (vma.IsMapped() || remaining_size < size) {
|
|
UnmapMemoryImpl(mapped_addr, size);
|
|
vma = FindVMA(mapped_addr)->second;
|
|
}
|
|
}
|
|
|
|
if (False(flags & MemoryMapFlags::Fixed)) {
|
|
// When MemoryMapFlags::Fixed is not specified, and mapped_addr is 0,
|
|
// search from address 0x200000000 instead.
|
|
mapped_addr = mapped_addr == 0 ? 0x200000000 : mapped_addr;
|
|
mapped_addr = SearchFree(mapped_addr, size, alignment);
|
|
if (mapped_addr == -1) {
|
|
// No suitable memory areas to map to
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
}
|
|
}
|
|
|
|
// Add virtual memory area
|
|
const auto new_vma_handle = CarveVMA(mapped_addr, size);
|
|
auto& new_vma = new_vma_handle->second;
|
|
new_vma.disallow_merge = True(flags & MemoryMapFlags::NoCoalesce);
|
|
new_vma.prot = MemoryProt::NoAccess;
|
|
new_vma.name = "anon";
|
|
new_vma.type = VMAType::PoolReserved;
|
|
|
|
*out_addr = std::bit_cast<void*>(mapped_addr);
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::Reserve(void** out_addr, VAddr virtual_addr, size_t size, MemoryMapFlags flags,
|
|
u64 alignment) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
virtual_addr = (virtual_addr == 0) ? impl.SystemManagedVirtualBase() : virtual_addr;
|
|
alignment = alignment > 0 ? alignment : 16_KB;
|
|
VAddr mapped_addr = alignment > 0 ? Common::AlignUp(virtual_addr, alignment) : virtual_addr;
|
|
|
|
// Fixed mapping means the virtual address must exactly match the provided one.
|
|
if (True(flags & MemoryMapFlags::Fixed)) {
|
|
auto vma = FindVMA(mapped_addr)->second;
|
|
size_t remaining_size = vma.base + vma.size - mapped_addr;
|
|
// If the VMA is mapped or there's not enough space, unmap the region first.
|
|
if (vma.IsMapped() || remaining_size < size) {
|
|
UnmapMemoryImpl(mapped_addr, size);
|
|
vma = FindVMA(mapped_addr)->second;
|
|
}
|
|
}
|
|
|
|
// Find the first free area starting with provided virtual address.
|
|
if (False(flags & MemoryMapFlags::Fixed)) {
|
|
mapped_addr = SearchFree(mapped_addr, size, alignment);
|
|
if (mapped_addr == -1) {
|
|
// No suitable memory areas to map to
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
}
|
|
}
|
|
|
|
// Add virtual memory area
|
|
const auto new_vma_handle = CarveVMA(mapped_addr, size);
|
|
auto& new_vma = new_vma_handle->second;
|
|
new_vma.disallow_merge = True(flags & MemoryMapFlags::NoCoalesce);
|
|
new_vma.prot = MemoryProt::NoAccess;
|
|
new_vma.name = "anon";
|
|
new_vma.type = VMAType::Reserved;
|
|
MergeAdjacent(vma_map, new_vma_handle);
|
|
|
|
*out_addr = std::bit_cast<void*>(mapped_addr);
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::PoolCommit(VAddr virtual_addr, size_t size, MemoryProt prot) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
const u64 alignment = 64_KB;
|
|
|
|
// Input addresses to PoolCommit are treated as fixed.
|
|
VAddr mapped_addr = Common::AlignUp(virtual_addr, alignment);
|
|
|
|
auto& vma = FindVMA(mapped_addr)->second;
|
|
if (vma.type != VMAType::PoolReserved) {
|
|
// If we're attempting to commit non-pooled memory, return EINVAL
|
|
LOG_ERROR(Kernel_Vmm, "Attempting to commit non-pooled memory at {:#x}", mapped_addr);
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
if (!vma.Contains(mapped_addr, size)) {
|
|
// If there's not enough space to commit, return EINVAL
|
|
LOG_ERROR(Kernel_Vmm,
|
|
"Pooled region {:#x} to {:#x} is not large enough to commit from {:#x} to {:#x}",
|
|
vma.base, vma.base + vma.size, mapped_addr, mapped_addr + size);
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
if (pool_budget <= size) {
|
|
// If there isn't enough pooled memory to perform the mapping, return ENOMEM
|
|
LOG_ERROR(Kernel_Vmm, "Not enough pooled memory to perform mapping");
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
} else {
|
|
// Track how much pooled memory this commit will take
|
|
pool_budget -= size;
|
|
}
|
|
|
|
// Carve out the new VMA representing this mapping
|
|
const auto new_vma_handle = CarveVMA(mapped_addr, size);
|
|
auto& new_vma = new_vma_handle->second;
|
|
new_vma.disallow_merge = false;
|
|
new_vma.prot = prot;
|
|
new_vma.name = "anon";
|
|
new_vma.type = Core::VMAType::Pooled;
|
|
new_vma.is_exec = false;
|
|
new_vma.phys_base = 0;
|
|
|
|
// Perform the mapping
|
|
void* out_addr = impl.Map(mapped_addr, size, alignment, -1, false);
|
|
TRACK_ALLOC(out_addr, size, "VMEM");
|
|
|
|
if (IsValidGpuMapping(mapped_addr, size)) {
|
|
rasterizer->MapMemory(mapped_addr, size);
|
|
}
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::MapMemory(void** out_addr, VAddr virtual_addr, size_t size, MemoryProt prot,
|
|
MemoryMapFlags flags, VMAType type, std::string_view name,
|
|
bool is_exec, PAddr phys_addr, u64 alignment) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
// Certain games perform flexible mappings on loop to determine
|
|
// the available flexible memory size. Questionable but we need to handle this.
|
|
if (type == VMAType::Flexible && flexible_usage + size > total_flexible_size) {
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
}
|
|
|
|
// When virtual addr is zero, force it to virtual_base. The guest cannot pass Fixed
|
|
// flag so we will take the branch that searches for free (or reserved) mappings.
|
|
virtual_addr = (virtual_addr == 0) ? impl.SystemManagedVirtualBase() : virtual_addr;
|
|
alignment = alignment > 0 ? alignment : 16_KB;
|
|
VAddr mapped_addr = alignment > 0 ? Common::AlignUp(virtual_addr, alignment) : virtual_addr;
|
|
|
|
// Fixed mapping means the virtual address must exactly match the provided one.
|
|
if (True(flags & MemoryMapFlags::Fixed)) {
|
|
auto vma = FindVMA(mapped_addr)->second;
|
|
size_t remaining_size = vma.base + vma.size - mapped_addr;
|
|
// There's a possible edge case where we're mapping to a partially reserved range.
|
|
// To account for this, unmap any reserved areas within this mapping range first.
|
|
auto unmap_addr = mapped_addr;
|
|
auto unmap_size = size;
|
|
while (!vma.IsMapped() && unmap_addr < mapped_addr + size && remaining_size < size) {
|
|
auto unmapped = UnmapBytesFromEntry(unmap_addr, vma, unmap_size);
|
|
unmap_addr += unmapped;
|
|
unmap_size -= unmapped;
|
|
vma = FindVMA(unmap_addr)->second;
|
|
}
|
|
|
|
// This should return SCE_KERNEL_ERROR_ENOMEM but rarely happens.
|
|
vma = FindVMA(mapped_addr)->second;
|
|
remaining_size = vma.base + vma.size - mapped_addr;
|
|
ASSERT_MSG(!vma.IsMapped() && remaining_size >= size,
|
|
"Memory region {:#x} to {:#x} isn't free enough to map region {:#x} to {:#x}",
|
|
vma.base, vma.base + vma.size, virtual_addr, virtual_addr + size);
|
|
}
|
|
|
|
// Find the first free area starting with provided virtual address.
|
|
if (False(flags & MemoryMapFlags::Fixed)) {
|
|
mapped_addr = SearchFree(mapped_addr, size, alignment);
|
|
if (mapped_addr == -1) {
|
|
// No suitable memory areas to map to
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
}
|
|
}
|
|
|
|
// Perform the mapping.
|
|
*out_addr = impl.Map(mapped_addr, size, alignment, phys_addr, is_exec);
|
|
TRACK_ALLOC(*out_addr, size, "VMEM");
|
|
|
|
auto& new_vma = CarveVMA(mapped_addr, size)->second;
|
|
new_vma.disallow_merge = True(flags & MemoryMapFlags::NoCoalesce);
|
|
new_vma.prot = prot;
|
|
new_vma.name = name;
|
|
new_vma.type = type;
|
|
new_vma.is_exec = is_exec;
|
|
|
|
if (type == VMAType::Direct) {
|
|
new_vma.phys_base = phys_addr;
|
|
}
|
|
if (type == VMAType::Flexible) {
|
|
flexible_usage += size;
|
|
}
|
|
|
|
if (IsValidGpuMapping(mapped_addr, size)) {
|
|
rasterizer->MapMemory(mapped_addr, size);
|
|
}
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::MapFile(void** out_addr, VAddr virtual_addr, size_t size, MemoryProt prot,
|
|
MemoryMapFlags flags, uintptr_t fd, size_t offset) {
|
|
VAddr mapped_addr = (virtual_addr == 0) ? impl.SystemManagedVirtualBase() : virtual_addr;
|
|
const size_t size_aligned = Common::AlignUp(size, 16_KB);
|
|
|
|
// Find first free area to map the file.
|
|
if (False(flags & MemoryMapFlags::Fixed)) {
|
|
mapped_addr = SearchFree(mapped_addr, size_aligned, 1);
|
|
if (mapped_addr == -1) {
|
|
// No suitable memory areas to map to
|
|
return ORBIS_KERNEL_ERROR_ENOMEM;
|
|
}
|
|
}
|
|
|
|
if (True(flags & MemoryMapFlags::Fixed)) {
|
|
const auto& vma = FindVMA(virtual_addr)->second;
|
|
const size_t remaining_size = vma.base + vma.size - virtual_addr;
|
|
ASSERT_MSG(!vma.IsMapped() && remaining_size >= size,
|
|
"Memory region {:#x} to {:#x} isn't free enough to map region {:#x} to {:#x}",
|
|
vma.base, vma.base + vma.size, virtual_addr, virtual_addr + size);
|
|
}
|
|
|
|
// Map the file.
|
|
impl.MapFile(mapped_addr, size_aligned, offset, std::bit_cast<u32>(prot), fd);
|
|
|
|
// Add virtual memory area
|
|
auto& new_vma = CarveVMA(mapped_addr, size_aligned)->second;
|
|
new_vma.disallow_merge = True(flags & MemoryMapFlags::NoCoalesce);
|
|
new_vma.prot = prot;
|
|
new_vma.name = "File";
|
|
new_vma.fd = fd;
|
|
new_vma.type = VMAType::File;
|
|
|
|
*out_addr = std::bit_cast<void*>(mapped_addr);
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
s32 MemoryManager::PoolDecommit(VAddr virtual_addr, size_t size) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
const auto it = FindVMA(virtual_addr);
|
|
const auto& vma_base = it->second;
|
|
ASSERT_MSG(vma_base.Contains(virtual_addr, size),
|
|
"Existing mapping does not contain requested unmap range");
|
|
|
|
const auto vma_base_addr = vma_base.base;
|
|
const auto vma_base_size = vma_base.size;
|
|
const auto phys_base = vma_base.phys_base;
|
|
const bool is_exec = vma_base.is_exec;
|
|
const auto start_in_vma = virtual_addr - vma_base_addr;
|
|
const auto type = vma_base.type;
|
|
|
|
if (type != VMAType::PoolReserved && type != VMAType::Pooled) {
|
|
LOG_ERROR(Kernel_Vmm, "Attempting to decommit non-pooled memory!");
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
if (type == VMAType::Pooled) {
|
|
// Track how much pooled memory is decommitted
|
|
pool_budget += size;
|
|
}
|
|
|
|
if (IsValidGpuMapping(virtual_addr, size)) {
|
|
rasterizer->UnmapMemory(virtual_addr, size);
|
|
}
|
|
|
|
// Mark region as free and attempt to coalesce it with neighbours.
|
|
const auto new_it = CarveVMA(virtual_addr, size);
|
|
auto& vma = new_it->second;
|
|
vma.type = VMAType::PoolReserved;
|
|
vma.prot = MemoryProt::NoAccess;
|
|
vma.phys_base = 0;
|
|
vma.disallow_merge = false;
|
|
vma.name = "anon";
|
|
MergeAdjacent(vma_map, new_it);
|
|
|
|
if (type != VMAType::PoolReserved) {
|
|
// Unmap the memory region.
|
|
impl.Unmap(vma_base_addr, vma_base_size, start_in_vma, start_in_vma + size, phys_base,
|
|
is_exec, false, false);
|
|
TRACK_FREE(virtual_addr, "VMEM");
|
|
}
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
s32 MemoryManager::UnmapMemory(VAddr virtual_addr, size_t size) {
|
|
std::scoped_lock lk{mutex};
|
|
return UnmapMemoryImpl(virtual_addr, size);
|
|
}
|
|
|
|
u64 MemoryManager::UnmapBytesFromEntry(VAddr virtual_addr, VirtualMemoryArea vma_base, u64 size) {
|
|
const auto vma_base_addr = vma_base.base;
|
|
const auto vma_base_size = vma_base.size;
|
|
const auto type = vma_base.type;
|
|
const auto phys_base = vma_base.phys_base;
|
|
const bool is_exec = vma_base.is_exec;
|
|
const auto start_in_vma = virtual_addr - vma_base_addr;
|
|
const auto adjusted_size =
|
|
vma_base_size - start_in_vma < size ? vma_base_size - start_in_vma : size;
|
|
const bool has_backing = type == VMAType::Direct || type == VMAType::File;
|
|
|
|
if (type == VMAType::Free) {
|
|
return adjusted_size;
|
|
}
|
|
if (type == VMAType::Flexible) {
|
|
flexible_usage -= adjusted_size;
|
|
}
|
|
|
|
if (IsValidGpuMapping(virtual_addr, adjusted_size)) {
|
|
rasterizer->UnmapMemory(virtual_addr, adjusted_size);
|
|
}
|
|
|
|
// Mark region as free and attempt to coalesce it with neighbours.
|
|
const auto new_it = CarveVMA(virtual_addr, adjusted_size);
|
|
auto& vma = new_it->second;
|
|
vma.type = VMAType::Free;
|
|
vma.prot = MemoryProt::NoAccess;
|
|
vma.phys_base = 0;
|
|
vma.disallow_merge = false;
|
|
vma.name = "";
|
|
const auto post_merge_it = MergeAdjacent(vma_map, new_it);
|
|
auto& post_merge_vma = post_merge_it->second;
|
|
bool readonly_file = post_merge_vma.prot == MemoryProt::CpuRead && type == VMAType::File;
|
|
if (type != VMAType::Reserved && type != VMAType::PoolReserved) {
|
|
// Unmap the memory region.
|
|
impl.Unmap(vma_base_addr, vma_base_size, start_in_vma, start_in_vma + adjusted_size,
|
|
phys_base, is_exec, has_backing, readonly_file);
|
|
TRACK_FREE(virtual_addr, "VMEM");
|
|
}
|
|
return adjusted_size;
|
|
}
|
|
|
|
s32 MemoryManager::UnmapMemoryImpl(VAddr virtual_addr, u64 size) {
|
|
u64 unmapped_bytes = 0;
|
|
do {
|
|
auto it = FindVMA(virtual_addr + unmapped_bytes);
|
|
auto& vma_base = it->second;
|
|
ASSERT_MSG(vma_base.Contains(virtual_addr + unmapped_bytes, 0),
|
|
"Address {:#x} is out of bounds", virtual_addr + unmapped_bytes);
|
|
auto unmapped =
|
|
UnmapBytesFromEntry(virtual_addr + unmapped_bytes, vma_base, size - unmapped_bytes);
|
|
ASSERT_MSG(unmapped > 0, "Failed to unmap memory, progress is impossible");
|
|
unmapped_bytes += unmapped;
|
|
} while (unmapped_bytes < size);
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::QueryProtection(VAddr addr, void** start, void** end, u32* prot) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
const auto it = FindVMA(addr);
|
|
const auto& vma = it->second;
|
|
if (!vma.Contains(addr, 0) || vma.IsFree()) {
|
|
LOG_ERROR(Kernel_Vmm, "Address {:#x} is not mapped", addr);
|
|
return ORBIS_KERNEL_ERROR_EACCES;
|
|
}
|
|
|
|
if (start != nullptr) {
|
|
*start = reinterpret_cast<void*>(vma.base);
|
|
}
|
|
if (end != nullptr) {
|
|
*end = reinterpret_cast<void*>(vma.base + vma.size);
|
|
}
|
|
if (prot != nullptr) {
|
|
*prot = static_cast<u32>(vma.prot);
|
|
}
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
s64 MemoryManager::ProtectBytes(VAddr addr, VirtualMemoryArea vma_base, size_t size,
|
|
MemoryProt prot) {
|
|
const auto start_in_vma = addr - vma_base.base;
|
|
const auto adjusted_size =
|
|
vma_base.size - start_in_vma < size ? vma_base.size - start_in_vma : size;
|
|
|
|
if (vma_base.type == VMAType::Free) {
|
|
LOG_ERROR(Kernel_Vmm, "Cannot change protection on free memory region");
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
// Validate protection flags
|
|
constexpr static MemoryProt valid_flags = MemoryProt::NoAccess | MemoryProt::CpuRead |
|
|
MemoryProt::CpuReadWrite | MemoryProt::GpuRead |
|
|
MemoryProt::GpuWrite | MemoryProt::GpuReadWrite;
|
|
|
|
MemoryProt invalid_flags = prot & ~valid_flags;
|
|
if (u32(invalid_flags) != 0 && u32(invalid_flags) != u32(MemoryProt::NoAccess)) {
|
|
LOG_ERROR(Kernel_Vmm, "Invalid protection flags: prot = {:#x}, invalid flags = {:#x}",
|
|
u32(prot), u32(invalid_flags));
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
// Change protection
|
|
vma_base.prot = prot;
|
|
|
|
// Set permissions
|
|
Core::MemoryPermission perms{};
|
|
|
|
if (True(prot & MemoryProt::CpuRead)) {
|
|
perms |= Core::MemoryPermission::Read;
|
|
}
|
|
if (True(prot & MemoryProt::CpuReadWrite)) {
|
|
perms |= Core::MemoryPermission::ReadWrite;
|
|
}
|
|
if (True(prot & MemoryProt::GpuRead)) {
|
|
perms |= Core::MemoryPermission::Read;
|
|
}
|
|
if (True(prot & MemoryProt::GpuWrite)) {
|
|
perms |= Core::MemoryPermission::Write;
|
|
}
|
|
if (True(prot & MemoryProt::GpuReadWrite)) {
|
|
perms |= Core::MemoryPermission::ReadWrite;
|
|
}
|
|
|
|
impl.Protect(addr, size, perms);
|
|
|
|
return adjusted_size;
|
|
}
|
|
|
|
s32 MemoryManager::Protect(VAddr addr, size_t size, MemoryProt prot) {
|
|
std::scoped_lock lk{mutex};
|
|
s64 protected_bytes = 0;
|
|
|
|
auto aligned_addr = Common::AlignDown(addr, 16_KB);
|
|
auto aligned_size = Common::AlignUp(size + addr - aligned_addr, 16_KB);
|
|
do {
|
|
auto it = FindVMA(aligned_addr + protected_bytes);
|
|
auto& vma_base = it->second;
|
|
ASSERT_MSG(vma_base.Contains(addr + protected_bytes, 0), "Address {:#x} is out of bounds",
|
|
addr + protected_bytes);
|
|
auto result = 0;
|
|
result = ProtectBytes(aligned_addr + protected_bytes, vma_base,
|
|
aligned_size - protected_bytes, prot);
|
|
if (result < 0) {
|
|
// ProtectBytes returned an error, return it
|
|
return result;
|
|
}
|
|
protected_bytes += result;
|
|
} while (protected_bytes < aligned_size);
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::VirtualQuery(VAddr addr, int flags,
|
|
::Libraries::Kernel::OrbisVirtualQueryInfo* info) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
// FindVMA on addresses before the vma_map return garbage data.
|
|
auto query_addr =
|
|
addr < impl.SystemManagedVirtualBase() ? impl.SystemManagedVirtualBase() : addr;
|
|
if (addr < query_addr && flags == 0) {
|
|
LOG_WARNING(Kernel_Vmm, "VirtualQuery on free memory region");
|
|
return ORBIS_KERNEL_ERROR_EACCES;
|
|
}
|
|
auto it = FindVMA(query_addr);
|
|
|
|
while (it->second.type == VMAType::Free && flags == 1 && it != --vma_map.end()) {
|
|
++it;
|
|
}
|
|
if (it->second.type == VMAType::Free) {
|
|
LOG_WARNING(Kernel_Vmm, "VirtualQuery on free memory region");
|
|
return ORBIS_KERNEL_ERROR_EACCES;
|
|
}
|
|
|
|
const auto& vma = it->second;
|
|
info->start = vma.base;
|
|
info->end = vma.base + vma.size;
|
|
info->offset = vma.phys_base;
|
|
info->protection = static_cast<s32>(vma.prot);
|
|
info->is_flexible = vma.type == VMAType::Flexible ? 1 : 0;
|
|
info->is_direct = vma.type == VMAType::Direct ? 1 : 0;
|
|
info->is_stack = vma.type == VMAType::Stack ? 1 : 0;
|
|
info->is_pooled = vma.type == VMAType::PoolReserved || vma.type == VMAType::Pooled ? 1 : 0;
|
|
info->is_committed = vma.IsMapped() ? 1 : 0;
|
|
|
|
strncpy(info->name, vma.name.data(), ::Libraries::Kernel::ORBIS_KERNEL_MAXIMUM_NAME_LENGTH);
|
|
|
|
if (vma.type == VMAType::Direct) {
|
|
const auto dmem_it = FindDmemArea(vma.phys_base);
|
|
ASSERT_MSG(vma.phys_base <= dmem_it->second.GetEnd(), "vma.phys_base is not in dmem_map!");
|
|
info->memory_type = dmem_it->second.memory_type;
|
|
} else {
|
|
info->memory_type = ::Libraries::Kernel::SCE_KERNEL_WB_ONION;
|
|
}
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::DirectMemoryQuery(PAddr addr, bool find_next,
|
|
::Libraries::Kernel::OrbisQueryInfo* out_info) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
auto dmem_area = FindDmemArea(addr);
|
|
while (dmem_area != --dmem_map.end() && dmem_area->second.is_free && find_next) {
|
|
dmem_area++;
|
|
}
|
|
|
|
if (dmem_area->second.is_free) {
|
|
LOG_ERROR(Core, "Unable to find allocated direct memory region to query!");
|
|
return ORBIS_KERNEL_ERROR_EACCES;
|
|
}
|
|
|
|
const auto& area = dmem_area->second;
|
|
out_info->start = area.base;
|
|
out_info->end = area.GetEnd();
|
|
out_info->memoryType = area.memory_type;
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::DirectQueryAvailable(PAddr search_start, PAddr search_end, size_t alignment,
|
|
PAddr* phys_addr_out, size_t* size_out) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
auto dmem_area = FindDmemArea(search_start);
|
|
PAddr paddr{};
|
|
size_t max_size{};
|
|
|
|
while (dmem_area != dmem_map.end()) {
|
|
if (!dmem_area->second.is_free) {
|
|
dmem_area++;
|
|
continue;
|
|
}
|
|
|
|
auto aligned_base = alignment > 0 ? Common::AlignUp(dmem_area->second.base, alignment)
|
|
: dmem_area->second.base;
|
|
const auto alignment_size = aligned_base - dmem_area->second.base;
|
|
auto remaining_size =
|
|
dmem_area->second.size >= alignment_size ? dmem_area->second.size - alignment_size : 0;
|
|
|
|
if (dmem_area->second.base < search_start) {
|
|
// We need to trim remaining_size to ignore addresses before search_start
|
|
remaining_size = remaining_size > (search_start - dmem_area->second.base)
|
|
? remaining_size - (search_start - dmem_area->second.base)
|
|
: 0;
|
|
aligned_base = alignment > 0 ? Common::AlignUp(search_start, alignment) : search_start;
|
|
}
|
|
|
|
if (dmem_area->second.GetEnd() > search_end) {
|
|
// We need to trim remaining_size to ignore addresses beyond search_end
|
|
remaining_size = remaining_size > (dmem_area->second.GetEnd() - search_end)
|
|
? remaining_size - (dmem_area->second.GetEnd() - search_end)
|
|
: 0;
|
|
}
|
|
|
|
if (remaining_size > max_size) {
|
|
paddr = aligned_base;
|
|
max_size = remaining_size;
|
|
}
|
|
dmem_area++;
|
|
}
|
|
|
|
*phys_addr_out = paddr;
|
|
*size_out = max_size;
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
s32 MemoryManager::SetDirectMemoryType(s64 phys_addr, s32 memory_type) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
auto& dmem_area = FindDmemArea(phys_addr)->second;
|
|
|
|
ASSERT_MSG(phys_addr <= dmem_area.GetEnd() && !dmem_area.is_free,
|
|
"Direct memory area is not mapped");
|
|
|
|
dmem_area.memory_type = memory_type;
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
void MemoryManager::NameVirtualRange(VAddr virtual_addr, size_t size, std::string_view name) {
|
|
auto it = FindVMA(virtual_addr);
|
|
|
|
ASSERT_MSG(it->second.Contains(virtual_addr, size),
|
|
"Range provided is not fully contained in vma");
|
|
it->second.name = name;
|
|
}
|
|
|
|
void MemoryManager::InvalidateMemory(const VAddr addr, const u64 size) const {
|
|
if (rasterizer) {
|
|
rasterizer->InvalidateMemory(addr, size);
|
|
}
|
|
}
|
|
|
|
VAddr MemoryManager::SearchFree(VAddr virtual_addr, size_t size, u32 alignment) {
|
|
// If the requested address is below the mapped range, start search from the lowest address
|
|
auto min_search_address = impl.SystemManagedVirtualBase();
|
|
if (virtual_addr < min_search_address) {
|
|
virtual_addr = min_search_address;
|
|
}
|
|
|
|
// If the requested address is beyond the maximum our code can handle, throw an assert
|
|
auto max_search_address = impl.UserVirtualBase() + impl.UserVirtualSize();
|
|
ASSERT_MSG(virtual_addr <= max_search_address, "Input address {:#x} is out of bounds",
|
|
virtual_addr);
|
|
|
|
auto it = FindVMA(virtual_addr);
|
|
|
|
// If the VMA is free and contains the requested mapping we are done.
|
|
if (it->second.IsFree() && it->second.Contains(virtual_addr, size)) {
|
|
return virtual_addr;
|
|
}
|
|
|
|
// Search for the first free VMA that fits our mapping.
|
|
while (it != vma_map.end()) {
|
|
if (!it->second.IsFree()) {
|
|
it++;
|
|
continue;
|
|
}
|
|
|
|
const auto& vma = it->second;
|
|
virtual_addr = Common::AlignUp(vma.base, alignment);
|
|
// Sometimes the alignment itself might be larger than the VMA.
|
|
if (virtual_addr > vma.base + vma.size) {
|
|
it++;
|
|
continue;
|
|
}
|
|
|
|
// Make sure the address is within our defined bounds
|
|
if (virtual_addr >= max_search_address) {
|
|
// There are no free mappings within our safely usable address space.
|
|
break;
|
|
}
|
|
|
|
// If there's enough space in the VMA, return the address.
|
|
const size_t remaining_size = vma.base + vma.size - virtual_addr;
|
|
if (remaining_size >= size) {
|
|
return virtual_addr;
|
|
}
|
|
it++;
|
|
}
|
|
|
|
// Couldn't find a suitable VMA, return an error.
|
|
LOG_ERROR(Kernel_Vmm, "Couldn't find a free mapping for address {:#x}, size {:#x}",
|
|
virtual_addr, size);
|
|
return -1;
|
|
}
|
|
|
|
MemoryManager::VMAHandle MemoryManager::CarveVMA(VAddr virtual_addr, size_t size) {
|
|
auto vma_handle = FindVMA(virtual_addr);
|
|
ASSERT_MSG(vma_handle->second.Contains(virtual_addr, 0), "Virtual address not in vm_map");
|
|
|
|
const VirtualMemoryArea& vma = vma_handle->second;
|
|
ASSERT_MSG(vma.base <= virtual_addr, "Adding a mapping to already mapped region");
|
|
|
|
const VAddr start_in_vma = virtual_addr - vma.base;
|
|
const VAddr end_in_vma = start_in_vma + size;
|
|
|
|
if (start_in_vma == 0 && size == vma.size) {
|
|
// if requsting the whole VMA, return it
|
|
return vma_handle;
|
|
}
|
|
|
|
ASSERT_MSG(end_in_vma <= vma.size, "Mapping cannot fit inside free region");
|
|
|
|
if (end_in_vma != vma.size) {
|
|
// Split VMA at the end of the allocated region
|
|
Split(vma_handle, end_in_vma);
|
|
}
|
|
if (start_in_vma != 0) {
|
|
// Split VMA at the start of the allocated region
|
|
vma_handle = Split(vma_handle, start_in_vma);
|
|
}
|
|
|
|
return vma_handle;
|
|
}
|
|
|
|
MemoryManager::DMemHandle MemoryManager::CarveDmemArea(PAddr addr, size_t size) {
|
|
auto dmem_handle = FindDmemArea(addr);
|
|
ASSERT_MSG(addr <= dmem_handle->second.GetEnd(), "Physical address not in dmem_map");
|
|
|
|
const DirectMemoryArea& area = dmem_handle->second;
|
|
ASSERT_MSG(area.base <= addr, "Adding an allocation to already allocated region");
|
|
|
|
const PAddr start_in_area = addr - area.base;
|
|
const PAddr end_in_vma = start_in_area + size;
|
|
ASSERT_MSG(end_in_vma <= area.size, "Mapping cannot fit inside free region: size = {:#x}",
|
|
size);
|
|
|
|
if (end_in_vma != area.size) {
|
|
// Split VMA at the end of the allocated region
|
|
Split(dmem_handle, end_in_vma);
|
|
}
|
|
if (start_in_area != 0) {
|
|
// Split VMA at the start of the allocated region
|
|
dmem_handle = Split(dmem_handle, start_in_area);
|
|
}
|
|
|
|
return dmem_handle;
|
|
}
|
|
|
|
MemoryManager::VMAHandle MemoryManager::Split(VMAHandle vma_handle, size_t offset_in_vma) {
|
|
auto& old_vma = vma_handle->second;
|
|
ASSERT(offset_in_vma < old_vma.size && offset_in_vma > 0);
|
|
|
|
auto new_vma = old_vma;
|
|
old_vma.size = offset_in_vma;
|
|
new_vma.base += offset_in_vma;
|
|
new_vma.size -= offset_in_vma;
|
|
|
|
if (new_vma.type == VMAType::Direct) {
|
|
new_vma.phys_base += offset_in_vma;
|
|
}
|
|
return vma_map.emplace_hint(std::next(vma_handle), new_vma.base, new_vma);
|
|
}
|
|
|
|
MemoryManager::DMemHandle MemoryManager::Split(DMemHandle dmem_handle, size_t offset_in_area) {
|
|
auto& old_area = dmem_handle->second;
|
|
ASSERT(offset_in_area < old_area.size && offset_in_area > 0);
|
|
|
|
auto new_area = old_area;
|
|
old_area.size = offset_in_area;
|
|
new_area.base += offset_in_area;
|
|
new_area.size -= offset_in_area;
|
|
|
|
return dmem_map.emplace_hint(std::next(dmem_handle), new_area.base, new_area);
|
|
}
|
|
|
|
int MemoryManager::GetDirectMemoryType(PAddr addr, int* directMemoryTypeOut,
|
|
void** directMemoryStartOut, void** directMemoryEndOut) {
|
|
std::scoped_lock lk{mutex};
|
|
|
|
auto dmem_area = FindDmemArea(addr);
|
|
|
|
if (addr > dmem_area->second.GetEnd() || dmem_area->second.is_free) {
|
|
LOG_ERROR(Core, "Unable to find allocated direct memory region to check type!");
|
|
return ORBIS_KERNEL_ERROR_ENOENT;
|
|
}
|
|
|
|
const auto& area = dmem_area->second;
|
|
*directMemoryStartOut = reinterpret_cast<void*>(area.base);
|
|
*directMemoryEndOut = reinterpret_cast<void*>(area.GetEnd());
|
|
*directMemoryTypeOut = area.memory_type;
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
int MemoryManager::IsStack(VAddr addr, void** start, void** end) {
|
|
auto vma_handle = FindVMA(addr);
|
|
if (vma_handle == vma_map.end()) {
|
|
return ORBIS_KERNEL_ERROR_EINVAL;
|
|
}
|
|
|
|
const VirtualMemoryArea& vma = vma_handle->second;
|
|
if (!vma.Contains(addr, 0) || vma.IsFree()) {
|
|
return ORBIS_KERNEL_ERROR_EACCES;
|
|
}
|
|
|
|
auto stack_start = 0ul;
|
|
auto stack_end = 0ul;
|
|
if (vma.type == VMAType::Stack) {
|
|
stack_start = vma.base;
|
|
stack_end = vma.base + vma.size;
|
|
}
|
|
|
|
if (start != nullptr) {
|
|
*start = reinterpret_cast<void*>(stack_start);
|
|
}
|
|
|
|
if (end != nullptr) {
|
|
*end = reinterpret_cast<void*>(stack_end);
|
|
}
|
|
|
|
return ORBIS_OK;
|
|
}
|
|
|
|
} // namespace Core
|