2012-03-21 16:19:26 +00:00
|
|
|
/*******************************************************************************
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2015-03-16 16:24:42 +00:00
|
|
|
Copyright(C) Jonas 'Sortie' Termansen 2011, 2012, 2014, 2015.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2013-07-10 13:26:01 +00:00
|
|
|
This file is part of Sortix.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2013-07-10 13:26:01 +00:00
|
|
|
Sortix 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, either version 3 of the License, or (at your option) any later
|
|
|
|
version.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2013-07-10 13:26:01 +00:00
|
|
|
Sortix 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 for more
|
|
|
|
details.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2013-07-10 13:26:01 +00:00
|
|
|
You should have received a copy of the GNU General Public License along with
|
|
|
|
Sortix. If not, see <http://www.gnu.org/licenses/>.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2013-07-10 13:26:01 +00:00
|
|
|
sortix/kernel/memorymanagement.h
|
|
|
|
Functions that allow modification of virtual memory.
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2012-03-21 16:19:26 +00:00
|
|
|
*******************************************************************************/
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2014-01-04 00:04:29 +00:00
|
|
|
#ifndef INCLUDE_SORTIX_KERNEL_MEMORYMANAGEMENT_H
|
|
|
|
#define INCLUDE_SORTIX_KERNEL_MEMORYMANAGEMENT_H
|
2011-08-05 12:25:00 +00:00
|
|
|
|
2014-02-25 21:39:57 +00:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
|
|
|
|
#include <sortix/kernel/decl.h>
|
|
|
|
|
2011-08-12 00:58:55 +00:00
|
|
|
typedef struct multiboot_info multiboot_info_t;
|
|
|
|
|
2014-01-04 00:04:29 +00:00
|
|
|
namespace Sortix {
|
|
|
|
|
|
|
|
class Process;
|
|
|
|
|
2014-05-15 17:55:23 +00:00
|
|
|
enum page_usage
|
|
|
|
{
|
|
|
|
PAGE_USAGE_OTHER,
|
|
|
|
PAGE_USAGE_PHYSICAL,
|
|
|
|
PAGE_USAGE_PAGING_OVERHEAD,
|
|
|
|
PAGE_USAGE_KERNEL_HEAP,
|
|
|
|
PAGE_USAGE_FILESYSTEM_CACHE,
|
|
|
|
PAGE_USAGE_USER_SPACE,
|
|
|
|
PAGE_USAGE_EXECUTE,
|
|
|
|
PAGE_USAGE_DRIVER,
|
|
|
|
PAGE_USAGE_NUM_KINDS,
|
|
|
|
PAGE_USAGE_WASNT_ALLOCATED,
|
|
|
|
};
|
|
|
|
|
2014-01-04 00:04:29 +00:00
|
|
|
} // namespace Sortix
|
|
|
|
|
|
|
|
namespace Sortix {
|
|
|
|
namespace Page {
|
|
|
|
|
|
|
|
bool Reserve(size_t* counter, size_t amount);
|
|
|
|
bool ReserveUnlocked(size_t* counter, size_t amount);
|
|
|
|
bool Reserve(size_t* counter, size_t least, size_t ideal);
|
|
|
|
bool ReserveUnlocked(size_t* counter, size_t least, size_t ideal);
|
2014-05-15 17:55:23 +00:00
|
|
|
addr_t GetReserved(size_t* counter, enum page_usage usage);
|
|
|
|
addr_t GetReservedUnlocked(size_t* counter, enum page_usage usage);
|
|
|
|
addr_t Get(enum page_usage usage);
|
|
|
|
addr_t GetUnlocked(enum page_usage usage);
|
|
|
|
void Put(addr_t page, enum page_usage usage);
|
|
|
|
void PutUnlocked(addr_t page, enum page_usage usage);
|
2014-01-04 00:04:29 +00:00
|
|
|
void Lock();
|
|
|
|
void Unlock();
|
|
|
|
|
|
|
|
inline size_t Size() { return 4096UL; }
|
|
|
|
|
|
|
|
// Rounds a memory address down to nearest page.
|
|
|
|
inline addr_t AlignDown(addr_t page) { return page & ~(0xFFFUL); }
|
|
|
|
|
|
|
|
// Rounds a memory address up to nearest page.
|
|
|
|
inline addr_t AlignUp(addr_t page) { return AlignDown(page + 0xFFFUL); }
|
|
|
|
|
|
|
|
// Tests whether an address is page aligned.
|
|
|
|
inline bool IsAligned(addr_t page) { return AlignDown(page) == page; }
|
|
|
|
|
|
|
|
} // namespace Page
|
|
|
|
} // namespace Sortix
|
|
|
|
|
|
|
|
namespace Sortix {
|
|
|
|
namespace Memory {
|
|
|
|
|
|
|
|
void Init(multiboot_info_t* bootinfo);
|
|
|
|
void InvalidatePage(addr_t addr);
|
|
|
|
void Flush();
|
|
|
|
addr_t Fork();
|
|
|
|
addr_t GetAddressSpace();
|
|
|
|
addr_t SwitchAddressSpace(addr_t addrspace);
|
2015-03-16 16:24:42 +00:00
|
|
|
void DestroyAddressSpace(addr_t fallback);
|
2014-01-04 00:04:29 +00:00
|
|
|
bool Map(addr_t physical, addr_t mapto, int prot);
|
|
|
|
addr_t Unmap(addr_t mapto);
|
|
|
|
addr_t Physical(addr_t mapto);
|
|
|
|
int PageProtection(addr_t mapto);
|
|
|
|
bool LookUp(addr_t mapto, addr_t* physical, int* prot);
|
|
|
|
int ProvidedProtection(int prot);
|
|
|
|
void PageProtect(addr_t mapto, int protection);
|
|
|
|
void PageProtectAdd(addr_t mapto, int protection);
|
|
|
|
void PageProtectSub(addr_t mapto, int protection);
|
2014-05-15 17:55:23 +00:00
|
|
|
bool MapRange(addr_t where, size_t bytes, int protection, enum page_usage usage);
|
|
|
|
bool UnmapRange(addr_t where, size_t bytes, enum page_usage usage);
|
2014-01-04 00:04:29 +00:00
|
|
|
void Statistics(size_t* amountused, size_t* totalmem);
|
|
|
|
addr_t GetKernelStack();
|
|
|
|
size_t GetKernelStackSize();
|
|
|
|
void GetKernelVirtualArea(addr_t* from, size_t* size);
|
|
|
|
void GetUserVirtualArea(uintptr_t* from, size_t* size);
|
|
|
|
void UnmapMemory(Process* process, uintptr_t addr, size_t size);
|
|
|
|
bool ProtectMemory(Process* process, uintptr_t addr, size_t size, int prot);
|
|
|
|
bool MapMemory(Process* process, uintptr_t addr, size_t size, int prot);
|
|
|
|
|
|
|
|
} // namespace Memory
|
|
|
|
} // namespace Sortix
|
2011-08-05 12:25:00 +00:00
|
|
|
|
|
|
|
#endif
|