process.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303
  1. // Copyright 2015 Citra Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include <memory>
  5. #include "common/assert.h"
  6. #include "common/common_funcs.h"
  7. #include "common/logging/log.h"
  8. #include "core/hle/kernel/errors.h"
  9. #include "core/hle/kernel/memory.h"
  10. #include "core/hle/kernel/process.h"
  11. #include "core/hle/kernel/resource_limit.h"
  12. #include "core/hle/kernel/thread.h"
  13. #include "core/hle/kernel/vm_manager.h"
  14. #include "core/memory.h"
  15. namespace Kernel {
  16. SharedPtr<CodeSet> CodeSet::Create(std::string name, u64 program_id) {
  17. SharedPtr<CodeSet> codeset(new CodeSet);
  18. codeset->name = std::move(name);
  19. codeset->program_id = program_id;
  20. return codeset;
  21. }
  22. CodeSet::CodeSet() {}
  23. CodeSet::~CodeSet() {}
  24. u32 Process::next_process_id;
  25. SharedPtr<Process> Process::Create(std::string&& name) {
  26. SharedPtr<Process> process(new Process);
  27. process->name = std::move(name);
  28. process->flags.raw = 0;
  29. process->flags.memory_region.Assign(MemoryRegion::APPLICATION);
  30. return process;
  31. }
  32. void Process::ParseKernelCaps(const u32* kernel_caps, size_t len) {
  33. for (size_t i = 0; i < len; ++i) {
  34. u32 descriptor = kernel_caps[i];
  35. u32 type = descriptor >> 20;
  36. if (descriptor == 0xFFFFFFFF) {
  37. // Unused descriptor entry
  38. continue;
  39. } else if ((type & 0xF00) == 0xE00) { // 0x0FFF
  40. // Allowed interrupts list
  41. LOG_WARNING(Loader, "ExHeader allowed interrupts list ignored");
  42. } else if ((type & 0xF80) == 0xF00) { // 0x07FF
  43. // Allowed syscalls mask
  44. unsigned int index = ((descriptor >> 24) & 7) * 24;
  45. u32 bits = descriptor & 0xFFFFFF;
  46. while (bits && index < svc_access_mask.size()) {
  47. svc_access_mask.set(index, bits & 1);
  48. ++index;
  49. bits >>= 1;
  50. }
  51. } else if ((type & 0xFF0) == 0xFE0) { // 0x00FF
  52. // Handle table size
  53. handle_table_size = descriptor & 0x3FF;
  54. } else if ((type & 0xFF8) == 0xFF0) { // 0x007F
  55. // Misc. flags
  56. flags.raw = descriptor & 0xFFFF;
  57. } else if ((type & 0xFFE) == 0xFF8) { // 0x001F
  58. // Mapped memory range
  59. if (i + 1 >= len || ((kernel_caps[i + 1] >> 20) & 0xFFE) != 0xFF8) {
  60. LOG_WARNING(Loader, "Incomplete exheader memory range descriptor ignored.");
  61. continue;
  62. }
  63. u32 end_desc = kernel_caps[i + 1];
  64. ++i; // Skip over the second descriptor on the next iteration
  65. AddressMapping mapping;
  66. mapping.address = descriptor << 12;
  67. VAddr end_address = end_desc << 12;
  68. if (mapping.address < end_address) {
  69. mapping.size = end_address - mapping.address;
  70. } else {
  71. mapping.size = 0;
  72. }
  73. mapping.read_only = (descriptor & (1 << 20)) != 0;
  74. mapping.unk_flag = (end_desc & (1 << 20)) != 0;
  75. address_mappings.push_back(mapping);
  76. } else if ((type & 0xFFF) == 0xFFE) { // 0x000F
  77. // Mapped memory page
  78. AddressMapping mapping;
  79. mapping.address = descriptor << 12;
  80. mapping.size = Memory::PAGE_SIZE;
  81. mapping.read_only = false;
  82. mapping.unk_flag = false;
  83. address_mappings.push_back(mapping);
  84. } else if ((type & 0xFE0) == 0xFC0) { // 0x01FF
  85. // Kernel version
  86. kernel_version = descriptor & 0xFFFF;
  87. int minor = kernel_version & 0xFF;
  88. int major = (kernel_version >> 8) & 0xFF;
  89. LOG_INFO(Loader, "ExHeader kernel version: %d.%d", major, minor);
  90. } else {
  91. LOG_ERROR(Loader, "Unhandled kernel caps descriptor: 0x%08X", descriptor);
  92. }
  93. }
  94. }
  95. void Process::Run(VAddr entry_point, s32 main_thread_priority, u32 stack_size) {
  96. // Allocate and map stack
  97. vm_manager
  98. .MapMemoryBlock(Memory::HEAP_VADDR_END - stack_size,
  99. std::make_shared<std::vector<u8>>(stack_size, 0), 0, stack_size,
  100. MemoryState::Heap)
  101. .Unwrap();
  102. misc_memory_used += stack_size;
  103. memory_region->used += stack_size;
  104. // Map special address mappings
  105. MapSharedPages(vm_manager);
  106. for (const auto& mapping : address_mappings) {
  107. HandleSpecialMapping(vm_manager, mapping);
  108. }
  109. vm_manager.LogLayout(Log::Level::Debug);
  110. Kernel::SetupMainThread(entry_point, main_thread_priority, this);
  111. }
  112. void Process::LoadModule(SharedPtr<CodeSet> module_, VAddr base_addr) {
  113. memory_region = GetMemoryRegion(flags.memory_region);
  114. auto MapSegment = [&](CodeSet::Segment& segment, VMAPermission permissions,
  115. MemoryState memory_state) {
  116. auto vma = vm_manager
  117. .MapMemoryBlock(segment.addr + base_addr, module_->memory, segment.offset, segment.size,
  118. memory_state)
  119. .Unwrap();
  120. vm_manager.Reprotect(vma, permissions);
  121. misc_memory_used += segment.size;
  122. memory_region->used += segment.size;
  123. };
  124. // Map CodeSet segments
  125. MapSegment(module_->code, VMAPermission::ReadExecute, MemoryState::Code);
  126. MapSegment(module_->rodata, VMAPermission::Read, MemoryState::Static);
  127. MapSegment(module_->data, VMAPermission::ReadWrite, MemoryState::Static);
  128. }
  129. VAddr Process::GetLinearHeapAreaAddress() const {
  130. // Starting from system version 8.0.0 a new linear heap layout is supported to allow usage of
  131. // the extra RAM in the n3DS.
  132. return kernel_version < 0x22C ? Memory::LINEAR_HEAP_VADDR : Memory::NEW_LINEAR_HEAP_VADDR;
  133. }
  134. VAddr Process::GetLinearHeapBase() const {
  135. return GetLinearHeapAreaAddress() + memory_region->base;
  136. }
  137. VAddr Process::GetLinearHeapLimit() const {
  138. return GetLinearHeapBase() + memory_region->size;
  139. }
  140. ResultVal<VAddr> Process::HeapAllocate(VAddr target, u64 size, VMAPermission perms) {
  141. if (target < Memory::HEAP_VADDR || target + size > Memory::HEAP_VADDR_END ||
  142. target + size < target) {
  143. return ERR_INVALID_ADDRESS;
  144. }
  145. if (heap_memory == nullptr) {
  146. // Initialize heap
  147. heap_memory = std::make_shared<std::vector<u8>>();
  148. heap_start = heap_end = target;
  149. }
  150. // If necessary, expand backing vector to cover new heap extents.
  151. if (target < heap_start) {
  152. heap_memory->insert(begin(*heap_memory), heap_start - target, 0);
  153. heap_start = target;
  154. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  155. }
  156. if (target + size > heap_end) {
  157. heap_memory->insert(end(*heap_memory), (target + size) - heap_end, 0);
  158. heap_end = target + size;
  159. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  160. }
  161. ASSERT(heap_end - heap_start == heap_memory->size());
  162. CASCADE_RESULT(auto vma, vm_manager.MapMemoryBlock(target, heap_memory, target - heap_start,
  163. size, MemoryState::Heap));
  164. vm_manager.Reprotect(vma, perms);
  165. heap_used += size;
  166. memory_region->used += size;
  167. return MakeResult<VAddr>(heap_end - size);
  168. }
  169. ResultCode Process::HeapFree(VAddr target, u32 size) {
  170. if (target < Memory::HEAP_VADDR || target + size > Memory::HEAP_VADDR_END ||
  171. target + size < target) {
  172. return ERR_INVALID_ADDRESS;
  173. }
  174. if (size == 0) {
  175. return RESULT_SUCCESS;
  176. }
  177. ResultCode result = vm_manager.UnmapRange(target, size);
  178. if (result.IsError())
  179. return result;
  180. heap_used -= size;
  181. memory_region->used -= size;
  182. return RESULT_SUCCESS;
  183. }
  184. ResultVal<VAddr> Process::LinearAllocate(VAddr target, u32 size, VMAPermission perms) {
  185. UNIMPLEMENTED();
  186. return {};
  187. }
  188. ResultCode Process::LinearFree(VAddr target, u32 size) {
  189. auto& linheap_memory = memory_region->linear_heap_memory;
  190. if (target < GetLinearHeapBase() || target + size > GetLinearHeapLimit() ||
  191. target + size < target) {
  192. return ERR_INVALID_ADDRESS;
  193. }
  194. if (size == 0) {
  195. return RESULT_SUCCESS;
  196. }
  197. VAddr heap_end = GetLinearHeapBase() + (u32)linheap_memory->size();
  198. if (target + size > heap_end) {
  199. return ERR_INVALID_ADDRESS_STATE;
  200. }
  201. ResultCode result = vm_manager.UnmapRange(target, size);
  202. if (result.IsError())
  203. return result;
  204. linear_heap_used -= size;
  205. memory_region->used -= size;
  206. if (target + size == heap_end) {
  207. // End of linear heap has been freed, so check what's the last allocated block in it and
  208. // reduce the size.
  209. auto vma = vm_manager.FindVMA(target);
  210. ASSERT(vma != vm_manager.vma_map.end());
  211. ASSERT(vma->second.type == VMAType::Free);
  212. VAddr new_end = vma->second.base;
  213. if (new_end >= GetLinearHeapBase()) {
  214. linheap_memory->resize(new_end - GetLinearHeapBase());
  215. }
  216. }
  217. return RESULT_SUCCESS;
  218. }
  219. ResultCode Process::MirrorMemory(VAddr dst_addr, VAddr src_addr, u64 size) {
  220. auto vma = vm_manager.FindVMA(src_addr);
  221. ASSERT_MSG(vma != vm_manager.vma_map.end(), "Invalid memory address");
  222. ASSERT_MSG(vma->second.backing_block, "Backing block doesn't exist for address");
  223. // The returned VMA might be a bigger one encompassing the desired address.
  224. auto vma_offset = src_addr - vma->first;
  225. ASSERT_MSG(vma_offset + size <= vma->second.size,
  226. "Shared memory exceeds bounds of mapped block");
  227. const std::shared_ptr<std::vector<u8>>& backing_block = vma->second.backing_block;
  228. size_t backing_block_offset = vma->second.offset + vma_offset;
  229. CASCADE_RESULT(auto new_vma,
  230. vm_manager.MapMemoryBlock(dst_addr, backing_block, backing_block_offset, size,
  231. vma->second.meminfo_state));
  232. // Protect mirror with permissions from old region
  233. vm_manager.Reprotect(new_vma, vma->second.permissions);
  234. // Remove permissions from old region
  235. vm_manager.Reprotect(vma, VMAPermission::None);
  236. return RESULT_SUCCESS;
  237. }
  238. ResultCode Process::UnmapMemory(VAddr dst_addr, VAddr /*src_addr*/, u64 size) {
  239. return vm_manager.UnmapRange(dst_addr, size);
  240. }
  241. Kernel::Process::Process() {}
  242. Kernel::Process::~Process() {}
  243. SharedPtr<Process> g_current_process;
  244. }