2014-04-01 06:34:50 +05:30
|
|
|
// Copyright (C) 2003 Dolphin Project.
|
2013-09-05 05:47:46 +05:30
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU General Public License as published by
|
|
|
|
// the Free Software Foundation, version 2.0 or later versions.
|
|
|
|
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU General Public License 2.0 for more details.
|
|
|
|
|
|
|
|
// A copy of the GPL 2.0 should have been included with the program.
|
|
|
|
// If not, see http://www.gnu.org/licenses/
|
|
|
|
|
|
|
|
// Official SVN repository and contact information can be found at
|
|
|
|
// http://code.google.com/p/dolphin-emu/
|
|
|
|
|
|
|
|
#include <string>
|
2013-09-05 05:47:46 +05:30
|
|
|
|
2014-04-09 05:45:08 +05:30
|
|
|
#include "common/memory_util.h"
|
|
|
|
#include "common/mem_arena.h"
|
2014-08-16 04:16:20 +05:30
|
|
|
#include "common/string_util.h"
|
2013-09-05 05:47:46 +05:30
|
|
|
|
2014-04-09 05:45:08 +05:30
|
|
|
#ifndef _WIN32
|
2013-09-05 05:47:46 +05:30
|
|
|
#include <fcntl.h>
|
|
|
|
#ifdef ANDROID
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <linux/ashmem.h>
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifdef IOS
|
2014-12-04 00:27:57 +05:30
|
|
|
void* globalbase = nullptr;
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
2014-04-01 06:34:50 +05:30
|
|
|
|
2013-09-05 05:47:46 +05:30
|
|
|
#ifdef ANDROID
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
// Hopefully this ABI will never change...
|
|
|
|
|
|
|
|
|
2014-11-19 14:32:05 +05:30
|
|
|
#define ASHMEM_DEVICE "/dev/ashmem"
|
2014-04-01 06:34:50 +05:30
|
|
|
|
|
|
|
/*
|
|
|
|
* ashmem_create_region - creates a new ashmem region and returns the file
|
|
|
|
* descriptor, or <0 on error
|
|
|
|
*
|
|
|
|
* `name' is an optional label to give the region (visible in /proc/pid/maps)
|
|
|
|
* `size' is the size of the region, in page-aligned bytes
|
|
|
|
*/
|
|
|
|
int ashmem_create_region(const char *name, size_t size)
|
|
|
|
{
|
|
|
|
int fd, ret;
|
|
|
|
|
|
|
|
fd = open(ASHMEM_DEVICE, O_RDWR);
|
|
|
|
if (fd < 0)
|
|
|
|
return fd;
|
|
|
|
|
|
|
|
if (name) {
|
|
|
|
char buf[ASHMEM_NAME_LEN];
|
|
|
|
|
|
|
|
strncpy(buf, name, sizeof(buf));
|
|
|
|
ret = ioctl(fd, ASHMEM_SET_NAME, buf);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = ioctl(fd, ASHMEM_SET_SIZE, size);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
return fd;
|
|
|
|
|
|
|
|
error:
|
|
|
|
ERROR_LOG(MEMMAP, "NASTY ASHMEM ERROR: ret = %08x", ret);
|
|
|
|
close(fd);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ashmem_set_prot_region(int fd, int prot)
|
2013-09-05 05:47:46 +05:30
|
|
|
{
|
2014-04-01 06:34:50 +05:30
|
|
|
return ioctl(fd, ASHMEM_SET_PROT_MASK, prot);
|
|
|
|
}
|
|
|
|
|
|
|
|
int ashmem_pin_region(int fd, size_t offset, size_t len)
|
|
|
|
{
|
|
|
|
struct ashmem_pin pin = { offset, len };
|
|
|
|
return ioctl(fd, ASHMEM_PIN, &pin);
|
|
|
|
}
|
|
|
|
|
|
|
|
int ashmem_unpin_region(int fd, size_t offset, size_t len)
|
|
|
|
{
|
|
|
|
struct ashmem_pin pin = { offset, len };
|
|
|
|
return ioctl(fd, ASHMEM_UNPIN, &pin);
|
|
|
|
}
|
|
|
|
#endif // Android
|
|
|
|
|
|
|
|
|
2014-08-16 04:16:20 +05:30
|
|
|
#if defined(_WIN32) && !defined(_XBOX)
|
2014-04-01 06:34:50 +05:30
|
|
|
SYSTEM_INFO sysInfo;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
// Windows mappings need to be on 64K boundaries, due to Alpha legacy.
|
|
|
|
#ifdef _WIN32
|
|
|
|
size_t roundup(size_t x) {
|
|
|
|
#ifndef _XBOX
|
|
|
|
int gran = sysInfo.dwAllocationGranularity ? sysInfo.dwAllocationGranularity : 0x10000;
|
|
|
|
#else
|
|
|
|
int gran = 0x10000; // 64k in 360
|
|
|
|
#endif
|
|
|
|
return (x + gran - 1) & ~(gran - 1);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
size_t roundup(size_t x) {
|
|
|
|
return x;
|
2013-09-05 05:47:46 +05:30
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
|
2013-09-05 05:47:46 +05:30
|
|
|
void MemArena::GrabLowMemSpace(size_t size)
|
|
|
|
{
|
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifndef _XBOX
|
2014-12-04 00:27:57 +05:30
|
|
|
hMemoryMapping = CreateFileMapping(INVALID_HANDLE_VALUE, nullptr, PAGE_READWRITE, 0, (DWORD)(size), nullptr);
|
2014-04-01 06:34:50 +05:30
|
|
|
GetSystemInfo(&sysInfo);
|
|
|
|
#endif
|
2013-09-05 05:47:46 +05:30
|
|
|
#elif defined(ANDROID)
|
2014-04-01 06:34:50 +05:30
|
|
|
// Use ashmem so we don't have to allocate a file on disk!
|
|
|
|
fd = ashmem_create_region("PPSSPP_RAM", size);
|
|
|
|
// Note that it appears that ashmem is pinned by default, so no need to pin.
|
|
|
|
if (fd < 0)
|
|
|
|
{
|
|
|
|
ERROR_LOG(MEMMAP, "Failed to grab ashmem space of size: %08x errno: %d", (int)size, (int)(errno));
|
|
|
|
return;
|
|
|
|
}
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-08-16 04:16:20 +05:30
|
|
|
// Try to find a non-existing filename for our shared memory.
|
|
|
|
// In most cases the first one will be available, but it's nicer to search
|
|
|
|
// a bit more.
|
|
|
|
for (int i = 0; i < 10000; i++)
|
2014-04-01 06:34:50 +05:30
|
|
|
{
|
2014-09-08 00:20:43 +05:30
|
|
|
std::string file_name = Common::StringFromFormat("/citramem.%d", i);
|
2014-08-16 04:16:20 +05:30
|
|
|
fd = shm_open(file_name.c_str(), O_RDWR | O_CREAT | O_EXCL, 0600);
|
|
|
|
if (fd != -1)
|
|
|
|
{
|
|
|
|
shm_unlink(file_name.c_str());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if (errno != EEXIST)
|
|
|
|
{
|
|
|
|
ERROR_LOG(MEMMAP, "shm_open failed: %s", strerror(errno));
|
|
|
|
return;
|
|
|
|
}
|
2014-04-01 06:34:50 +05:30
|
|
|
}
|
2014-08-16 04:16:20 +05:30
|
|
|
if (ftruncate(fd, size) < 0)
|
|
|
|
ERROR_LOG(MEMMAP, "Failed to allocate low memory space");
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MemArena::ReleaseSpace()
|
|
|
|
{
|
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
CloseHandle(hMemoryMapping);
|
|
|
|
hMemoryMapping = 0;
|
|
|
|
#elif defined(__SYMBIAN32__)
|
|
|
|
memmap->Close();
|
|
|
|
delete memmap;
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
close(fd);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void *MemArena::CreateView(s64 offset, size_t size, void *base)
|
|
|
|
{
|
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifdef _XBOX
|
|
|
|
size = roundup(size);
|
|
|
|
// use 64kb pages
|
2014-12-04 00:27:57 +05:30
|
|
|
void * ptr = VirtualAlloc(nullptr, size, MEM_COMMIT | MEM_LARGE_PAGES, PAGE_READWRITE);
|
2014-04-01 06:34:50 +05:30
|
|
|
return ptr;
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
size = roundup(size);
|
|
|
|
void *ptr = MapViewOfFileEx(hMemoryMapping, FILE_MAP_ALL_ACCESS, 0, (DWORD)((u64)offset), size, base);
|
|
|
|
return ptr;
|
|
|
|
#endif
|
|
|
|
#else
|
|
|
|
void *retval = mmap(base, size, PROT_READ | PROT_WRITE, MAP_SHARED |
|
|
|
|
// Do not sync memory to underlying file. Linux has this by default.
|
|
|
|
#ifdef BLACKBERRY
|
|
|
|
MAP_NOSYNCFILE |
|
|
|
|
#elif defined(__FreeBSD__)
|
|
|
|
MAP_NOSYNC |
|
|
|
|
#endif
|
2014-08-16 04:16:20 +05:30
|
|
|
((base == nullptr) ? 0 : MAP_FIXED), fd, offset);
|
2014-04-01 06:34:50 +05:30
|
|
|
|
|
|
|
if (retval == MAP_FAILED)
|
|
|
|
{
|
2014-08-16 04:16:20 +05:30
|
|
|
NOTICE_LOG(MEMMAP, "mmap failed");
|
|
|
|
return nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
}
|
|
|
|
return retval;
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MemArena::ReleaseView(void* view, size_t size)
|
|
|
|
{
|
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifndef _XBOX
|
|
|
|
UnmapViewOfFile(view);
|
|
|
|
#endif
|
|
|
|
#elif defined(__SYMBIAN32__)
|
|
|
|
memmap->Decommit(((int)view - (int)memmap->Base()) & 0x3FFFFFFF, size);
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
munmap(view, size);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifndef __SYMBIAN32__
|
2013-09-05 05:47:46 +05:30
|
|
|
u8* MemArena::Find4GBBase()
|
|
|
|
{
|
|
|
|
#ifdef _M_X64
|
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
// 64 bit
|
|
|
|
u8* base = (u8*)VirtualAlloc(0, 0xE1000000, MEM_RESERVE, PAGE_READWRITE);
|
|
|
|
VirtualFree(base, 0, MEM_RELEASE);
|
|
|
|
return base;
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
// Very precarious - mmap cannot return an error when trying to map already used pages.
|
|
|
|
// This makes the Windows approach above unusable on Linux, so we will simply pray...
|
|
|
|
return reinterpret_cast<u8*>(0x2300000000ULL);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
#else // 32 bit
|
|
|
|
|
2013-09-05 05:47:46 +05:30
|
|
|
#ifdef _WIN32
|
2014-04-01 06:34:50 +05:30
|
|
|
u8* base = (u8*)VirtualAlloc(0, 0x10000000, MEM_RESERVE, PAGE_READWRITE);
|
|
|
|
if (base) {
|
|
|
|
VirtualFree(base, 0, MEM_RELEASE);
|
|
|
|
}
|
|
|
|
return base;
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
#ifdef IOS
|
2014-12-04 00:27:57 +05:30
|
|
|
void* base = nullptr;
|
|
|
|
if (globalbase == nullptr){
|
2014-04-01 06:34:50 +05:30
|
|
|
base = mmap(0, 0x08000000, PROT_READ | PROT_WRITE,
|
|
|
|
MAP_ANON | MAP_SHARED, -1, 0);
|
|
|
|
if (base == MAP_FAILED) {
|
|
|
|
PanicAlert("Failed to map 128 MB of memory space: %s", strerror(errno));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
munmap(base, 0x08000000);
|
|
|
|
globalbase = base;
|
|
|
|
}
|
|
|
|
else{ base = globalbase; }
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
void* base = mmap(0, 0x10000000, PROT_READ | PROT_WRITE,
|
|
|
|
MAP_ANON | MAP_SHARED, -1, 0);
|
|
|
|
if (base == MAP_FAILED) {
|
|
|
|
PanicAlert("Failed to map 256 MB of memory space: %s", strerror(errno));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
munmap(base, 0x10000000);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
2014-04-01 06:34:50 +05:30
|
|
|
return static_cast<u8*>(base);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
}
|
2014-04-01 06:34:50 +05:30
|
|
|
#endif
|
2013-09-05 05:47:46 +05:30
|
|
|
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
// yeah, this could also be done in like two bitwise ops...
|
2014-11-19 14:19:13 +05:30
|
|
|
#define SKIP(a_flags, b_flags)
|
2014-11-19 14:32:05 +05:30
|
|
|
//if (!(a_flags & MV_WII_ONLY) && (b_flags & MV_WII_ONLY))
|
|
|
|
// continue;
|
|
|
|
//if (!(a_flags & MV_FAKE_VMEM) && (b_flags & MV_FAKE_VMEM))
|
|
|
|
// continue;
|
2014-04-01 06:34:50 +05:30
|
|
|
|
2013-09-05 05:47:46 +05:30
|
|
|
static bool Memory_TryBase(u8 *base, const MemoryView *views, int num_views, u32 flags, MemArena *arena) {
|
2014-04-01 06:34:50 +05:30
|
|
|
// OK, we know where to find free space. Now grab it!
|
|
|
|
// We just mimic the popular BAT setup.
|
|
|
|
size_t position = 0;
|
|
|
|
size_t last_position = 0;
|
|
|
|
|
|
|
|
#if defined(_XBOX)
|
|
|
|
void *ptr;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// Zero all the pointers to be sure.
|
|
|
|
for (int i = 0; i < num_views; i++)
|
|
|
|
{
|
|
|
|
if (views[i].out_ptr_low)
|
|
|
|
*views[i].out_ptr_low = 0;
|
|
|
|
if (views[i].out_ptr)
|
|
|
|
*views[i].out_ptr = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < num_views; i++)
|
|
|
|
{
|
|
|
|
const MemoryView &view = views[i];
|
|
|
|
if (view.size == 0)
|
|
|
|
continue;
|
|
|
|
SKIP(flags, view.flags);
|
|
|
|
if (view.flags & MV_MIRROR_PREVIOUS) {
|
|
|
|
position = last_position;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
#ifdef __SYMBIAN32__
|
|
|
|
*(view.out_ptr_low) = (u8*)((int)arena->memmap->Base() + view.virtual_address);
|
|
|
|
arena->memmap->Commit(view.virtual_address & 0x3FFFFFFF, view.size);
|
|
|
|
}
|
|
|
|
*(view.out_ptr) = (u8*)((int)arena->memmap->Base() + view.virtual_address & 0x3FFFFFFF);
|
|
|
|
#elif defined(_XBOX)
|
|
|
|
*(view.out_ptr_low) = (u8*)(base + view.virtual_address);
|
|
|
|
//arena->memmap->Commit(view.virtual_address & 0x3FFFFFFF, view.size);
|
|
|
|
ptr = VirtualAlloc(base + (view.virtual_address & 0x3FFFFFFF), view.size, MEM_COMMIT, PAGE_READWRITE);
|
|
|
|
}
|
|
|
|
*(view.out_ptr) = (u8*)base + (view.virtual_address & 0x3FFFFFFF);
|
|
|
|
#else
|
|
|
|
*(view.out_ptr_low) = (u8*)arena->CreateView(position, view.size);
|
|
|
|
if (!*view.out_ptr_low)
|
|
|
|
goto bail;
|
|
|
|
}
|
2013-09-05 05:47:46 +05:30
|
|
|
#ifdef _M_X64
|
2014-04-01 06:34:50 +05:30
|
|
|
*view.out_ptr = (u8*)arena->CreateView(
|
|
|
|
position, view.size, base + view.virtual_address);
|
2013-09-05 05:47:46 +05:30
|
|
|
#else
|
2014-04-01 06:34:50 +05:30
|
|
|
if (view.flags & MV_MIRROR_PREVIOUS) { // TODO: should check if the two & 0x3FFFFFFF are identical.
|
|
|
|
// No need to create multiple identical views.
|
|
|
|
*view.out_ptr = *views[i - 1].out_ptr;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
*view.out_ptr = (u8*)arena->CreateView(
|
|
|
|
position, view.size, base + (view.virtual_address & 0x3FFFFFFF));
|
|
|
|
if (!*view.out_ptr)
|
|
|
|
goto bail;
|
|
|
|
}
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
#endif
|
|
|
|
last_position = position;
|
|
|
|
position += roundup(view.size);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2013-09-05 05:47:46 +05:30
|
|
|
|
|
|
|
bail:
|
2014-04-01 06:34:50 +05:30
|
|
|
// Argh! ERROR! Free what we grabbed so far so we can try again.
|
|
|
|
for (int j = 0; j <= i; j++)
|
|
|
|
{
|
|
|
|
if (views[i].size == 0)
|
|
|
|
continue;
|
|
|
|
SKIP(flags, views[i].flags);
|
|
|
|
if (views[j].out_ptr_low && *views[j].out_ptr_low)
|
|
|
|
{
|
|
|
|
arena->ReleaseView(*views[j].out_ptr_low, views[j].size);
|
2014-12-04 00:27:57 +05:30
|
|
|
*views[j].out_ptr_low = nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
}
|
|
|
|
if (*views[j].out_ptr)
|
|
|
|
{
|
|
|
|
#ifdef _M_X64
|
|
|
|
arena->ReleaseView(*views[j].out_ptr, views[j].size);
|
|
|
|
#else
|
|
|
|
if (!(views[j].flags & MV_MIRROR_PREVIOUS))
|
|
|
|
{
|
|
|
|
arena->ReleaseView(*views[j].out_ptr, views[j].size);
|
|
|
|
}
|
|
|
|
#endif
|
2014-12-04 00:27:57 +05:30
|
|
|
*views[j].out_ptr = nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
2013-09-05 05:47:46 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
u8 *MemoryMap_Setup(const MemoryView *views, int num_views, u32 flags, MemArena *arena)
|
|
|
|
{
|
2014-04-01 06:34:50 +05:30
|
|
|
size_t total_mem = 0;
|
|
|
|
int base_attempts = 0;
|
|
|
|
|
|
|
|
for (int i = 0; i < num_views; i++)
|
|
|
|
{
|
|
|
|
if (views[i].size == 0)
|
|
|
|
continue;
|
|
|
|
SKIP(flags, views[i].flags);
|
|
|
|
if ((views[i].flags & MV_MIRROR_PREVIOUS) == 0)
|
|
|
|
total_mem += roundup(views[i].size);
|
|
|
|
}
|
|
|
|
// Grab some pagefile backed memory out of the void ...
|
|
|
|
#ifndef __SYMBIAN32__
|
|
|
|
arena->GrabLowMemSpace(total_mem);
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
|
|
|
|
2014-04-01 06:34:50 +05:30
|
|
|
// Now, create views in high memory where there's plenty of space.
|
|
|
|
#ifdef _M_X64
|
|
|
|
u8 *base = MemArena::Find4GBBase();
|
|
|
|
// This really shouldn't fail - in 64-bit, there will always be enough
|
|
|
|
// address space.
|
|
|
|
if (!Memory_TryBase(base, views, num_views, flags, arena))
|
|
|
|
{
|
|
|
|
PanicAlert("MemoryMap_Setup: Failed finding a memory base.");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#elif defined(_XBOX)
|
|
|
|
// Reserve 256MB
|
|
|
|
u8 *base = (u8*)VirtualAlloc(0, 0x10000000, MEM_RESERVE | MEM_LARGE_PAGES, PAGE_READWRITE);
|
|
|
|
if (!Memory_TryBase(base, views, num_views, flags, arena))
|
|
|
|
{
|
|
|
|
PanicAlert("MemoryMap_Setup: Failed finding a memory base.");
|
|
|
|
exit(0);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
// Try a whole range of possible bases. Return once we got a valid one.
|
|
|
|
u32 max_base_addr = 0x7FFF0000 - 0x10000000;
|
2014-12-04 00:27:57 +05:30
|
|
|
u8 *base = nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
|
|
|
|
for (u32 base_addr = 0x01000000; base_addr < max_base_addr; base_addr += 0x400000)
|
|
|
|
{
|
|
|
|
base_attempts++;
|
|
|
|
base = (u8 *)base_addr;
|
|
|
|
if (Memory_TryBase(base, views, num_views, flags, arena))
|
|
|
|
{
|
|
|
|
INFO_LOG(MEMMAP, "Found valid memory base at %p after %i tries.", base, base_attempts);
|
|
|
|
base_attempts = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#elif defined(__SYMBIAN32__)
|
|
|
|
arena->memmap = new RChunk();
|
|
|
|
arena->memmap->CreateDisconnectedLocal(0, 0, 0x10000000);
|
|
|
|
if (!Memory_TryBase(arena->memmap->Base(), views, num_views, flags, arena))
|
|
|
|
{
|
|
|
|
PanicAlert("MemoryMap_Setup: Failed finding a memory base.");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
u8* base = arena->memmap->Base();
|
|
|
|
#else
|
|
|
|
// Linux32 is fine with the x64 method, although limited to 32-bit with no automirrors.
|
|
|
|
u8 *base = MemArena::Find4GBBase();
|
|
|
|
if (!Memory_TryBase(base, views, num_views, flags, arena))
|
|
|
|
{
|
|
|
|
ERROR_LOG(MEMMAP, "MemoryMap_Setup: Failed finding a memory base.");
|
|
|
|
PanicAlert("MemoryMap_Setup: Failed finding a memory base.");
|
|
|
|
return 0;
|
|
|
|
}
|
2013-09-05 05:47:46 +05:30
|
|
|
#endif
|
2014-04-01 06:34:50 +05:30
|
|
|
if (base_attempts)
|
|
|
|
PanicAlert("No possible memory base pointer found!");
|
|
|
|
return base;
|
2013-09-05 05:47:46 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
void MemoryMap_Shutdown(const MemoryView *views, int num_views, u32 flags, MemArena *arena)
|
|
|
|
{
|
2014-04-01 06:34:50 +05:30
|
|
|
for (int i = 0; i < num_views; i++)
|
|
|
|
{
|
|
|
|
if (views[i].size == 0)
|
|
|
|
continue;
|
|
|
|
SKIP(flags, views[i].flags);
|
|
|
|
if (views[i].out_ptr_low && *views[i].out_ptr_low)
|
|
|
|
arena->ReleaseView(*views[i].out_ptr_low, views[i].size);
|
|
|
|
if (*views[i].out_ptr && (views[i].out_ptr_low && *views[i].out_ptr != *views[i].out_ptr_low))
|
|
|
|
arena->ReleaseView(*views[i].out_ptr, views[i].size);
|
2014-12-04 00:27:57 +05:30
|
|
|
*views[i].out_ptr = nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
if (views[i].out_ptr_low)
|
2014-12-04 00:27:57 +05:30
|
|
|
*views[i].out_ptr_low = nullptr;
|
2014-04-01 06:34:50 +05:30
|
|
|
}
|
2013-09-05 05:47:46 +05:30
|
|
|
}
|