process.cpp 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273
  1. // Copyright 2015 Citra Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include "common/assert.h"
  5. #include "common/common_funcs.h"
  6. #include "common/logging/log.h"
  7. #include "common/make_unique.h"
  8. #include "core/hle/kernel/memory.h"
  9. #include "core/hle/kernel/process.h"
  10. #include "core/hle/kernel/resource_limit.h"
  11. #include "core/hle/kernel/thread.h"
  12. #include "core/hle/kernel/vm_manager.h"
  13. #include "core/memory.h"
  14. namespace Kernel {
  15. SharedPtr<CodeSet> CodeSet::Create(std::string name, u64 program_id) {
  16. SharedPtr<CodeSet> codeset(new CodeSet);
  17. codeset->name = std::move(name);
  18. codeset->program_id = program_id;
  19. return codeset;
  20. }
  21. CodeSet::CodeSet() {}
  22. CodeSet::~CodeSet() {}
  23. u32 Process::next_process_id;
  24. SharedPtr<Process> Process::Create(SharedPtr<CodeSet> code_set) {
  25. SharedPtr<Process> process(new Process);
  26. process->codeset = std::move(code_set);
  27. process->flags.raw = 0;
  28. process->flags.memory_region = MemoryRegion::APPLICATION;
  29. Memory::InitLegacyAddressSpace(process->vm_manager);
  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; bits >>= 1;
  49. }
  50. } else if ((type & 0xFF0) == 0xFE0) { // 0x00FF
  51. // Handle table size
  52. handle_table_size = descriptor & 0x3FF;
  53. } else if ((type & 0xFF8) == 0xFF0) { // 0x007F
  54. // Misc. flags
  55. flags.raw = descriptor & 0xFFFF;
  56. } else if ((type & 0xFFE) == 0xFF8) { // 0x001F
  57. // Mapped memory range
  58. if (i+1 >= len || ((kernel_caps[i+1] >> 20) & 0xFFE) != 0xFF8) {
  59. LOG_WARNING(Loader, "Incomplete exheader memory range descriptor ignored.");
  60. continue;
  61. }
  62. u32 end_desc = kernel_caps[i+1];
  63. ++i; // Skip over the second descriptor on the next iteration
  64. AddressMapping mapping;
  65. mapping.address = descriptor << 12;
  66. mapping.size = (end_desc << 12) - mapping.address;
  67. mapping.writable = (descriptor & (1 << 20)) != 0;
  68. mapping.unk_flag = (end_desc & (1 << 20)) != 0;
  69. address_mappings.push_back(mapping);
  70. } else if ((type & 0xFFF) == 0xFFE) { // 0x000F
  71. // Mapped memory page
  72. AddressMapping mapping;
  73. mapping.address = descriptor << 12;
  74. mapping.size = Memory::PAGE_SIZE;
  75. mapping.writable = true; // TODO: Not sure if correct
  76. mapping.unk_flag = false;
  77. } else if ((type & 0xFE0) == 0xFC0) { // 0x01FF
  78. // Kernel version
  79. kernel_version = descriptor & 0xFFFF;
  80. int minor = kernel_version & 0xFF;
  81. int major = (kernel_version >> 8) & 0xFF;
  82. LOG_INFO(Loader, "ExHeader kernel version: %d.%d", major, minor);
  83. } else {
  84. LOG_ERROR(Loader, "Unhandled kernel caps descriptor: 0x%08X", descriptor);
  85. }
  86. }
  87. }
  88. void Process::Run(s32 main_thread_priority, u32 stack_size) {
  89. memory_region = GetMemoryRegion(flags.memory_region);
  90. auto MapSegment = [&](CodeSet::Segment& segment, VMAPermission permissions, MemoryState memory_state) {
  91. auto vma = vm_manager.MapMemoryBlock(segment.addr, codeset->memory,
  92. segment.offset, segment.size, memory_state).Unwrap();
  93. vm_manager.Reprotect(vma, permissions);
  94. misc_memory_used += segment.size;
  95. memory_region->used += segment.size;
  96. };
  97. // Map CodeSet segments
  98. MapSegment(codeset->code, VMAPermission::ReadExecute, MemoryState::Code);
  99. MapSegment(codeset->rodata, VMAPermission::Read, MemoryState::Code);
  100. MapSegment(codeset->data, VMAPermission::ReadWrite, MemoryState::Private);
  101. // Allocate and map stack
  102. vm_manager.MapMemoryBlock(Memory::HEAP_VADDR_END - stack_size,
  103. std::make_shared<std::vector<u8>>(stack_size, 0), 0, stack_size, MemoryState::Locked
  104. ).Unwrap();
  105. misc_memory_used += stack_size;
  106. memory_region->used += stack_size;
  107. vm_manager.LogLayout(Log::Level::Debug);
  108. Kernel::SetupMainThread(codeset->entrypoint, main_thread_priority);
  109. }
  110. VAddr Process::GetLinearHeapBase() const {
  111. return (kernel_version < 0x22C ? Memory::LINEAR_HEAP_VADDR : Memory::NEW_LINEAR_HEAP_VADDR)
  112. + memory_region->base;
  113. }
  114. VAddr Process::GetLinearHeapLimit() const {
  115. return GetLinearHeapBase() + memory_region->size;
  116. }
  117. ResultVal<VAddr> Process::HeapAllocate(VAddr target, u32 size, VMAPermission perms) {
  118. if (target < Memory::HEAP_VADDR || target + size > Memory::HEAP_VADDR_END || target + size < target) {
  119. return ERR_INVALID_ADDRESS;
  120. }
  121. if (heap_memory == nullptr) {
  122. // Initialize heap
  123. heap_memory = std::make_shared<std::vector<u8>>();
  124. heap_start = heap_end = target;
  125. }
  126. // If necessary, expand backing vector to cover new heap extents.
  127. if (target < heap_start) {
  128. heap_memory->insert(begin(*heap_memory), heap_start - target, 0);
  129. heap_start = target;
  130. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  131. }
  132. if (target + size > heap_end) {
  133. heap_memory->insert(end(*heap_memory), (target + size) - heap_end, 0);
  134. heap_end = target + size;
  135. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  136. }
  137. ASSERT(heap_end - heap_start == heap_memory->size());
  138. CASCADE_RESULT(auto vma, vm_manager.MapMemoryBlock(target, heap_memory, target - heap_start, size, MemoryState::Private));
  139. vm_manager.Reprotect(vma, perms);
  140. heap_used += size;
  141. memory_region->used += size;
  142. return MakeResult<VAddr>(heap_end - size);
  143. }
  144. ResultCode Process::HeapFree(VAddr target, u32 size) {
  145. if (target < Memory::HEAP_VADDR || target + size > Memory::HEAP_VADDR_END || target + size < target) {
  146. return ERR_INVALID_ADDRESS;
  147. }
  148. if (size == 0) {
  149. return RESULT_SUCCESS;
  150. }
  151. ResultCode result = vm_manager.UnmapRange(target, size);
  152. if (result.IsError()) return result;
  153. heap_used -= size;
  154. memory_region->used -= size;
  155. return RESULT_SUCCESS;
  156. }
  157. ResultVal<VAddr> Process::LinearAllocate(VAddr target, u32 size, VMAPermission perms) {
  158. auto& linheap_memory = memory_region->linear_heap_memory;
  159. VAddr heap_end = GetLinearHeapBase() + (u32)linheap_memory->size();
  160. // Games and homebrew only ever seem to pass 0 here (which lets the kernel decide the address),
  161. // but explicit addresses are also accepted and respected.
  162. if (target == 0) {
  163. target = heap_end;
  164. }
  165. if (target < GetLinearHeapBase() || target + size > GetLinearHeapLimit() ||
  166. target > heap_end || target + size < target) {
  167. return ERR_INVALID_ADDRESS;
  168. }
  169. // Expansion of the linear heap is only allowed if you do an allocation immediatelly at its
  170. // end. It's possible to free gaps in the middle of the heap and then reallocate them later,
  171. // but expansions are only allowed at the end.
  172. if (target == heap_end) {
  173. linheap_memory->insert(linheap_memory->end(), size, 0);
  174. vm_manager.RefreshMemoryBlockMappings(linheap_memory.get());
  175. }
  176. // TODO(yuriks): As is, this lets processes map memory allocated by other processes from the
  177. // same region. It is unknown if or how the 3DS kernel checks against this.
  178. size_t offset = target - GetLinearHeapBase();
  179. CASCADE_RESULT(auto vma, vm_manager.MapMemoryBlock(target, linheap_memory, offset, size, MemoryState::Continuous));
  180. vm_manager.Reprotect(vma, perms);
  181. linear_heap_used += size;
  182. memory_region->used += size;
  183. return MakeResult<VAddr>(target);
  184. }
  185. ResultCode Process::LinearFree(VAddr target, u32 size) {
  186. auto& linheap_memory = memory_region->linear_heap_memory;
  187. if (target < GetLinearHeapBase() || target + size > GetLinearHeapLimit() ||
  188. target + size < target) {
  189. return ERR_INVALID_ADDRESS;
  190. }
  191. if (size == 0) {
  192. return RESULT_SUCCESS;
  193. }
  194. VAddr heap_end = GetLinearHeapBase() + (u32)linheap_memory->size();
  195. if (target + size > heap_end) {
  196. return ERR_INVALID_ADDRESS_STATE;
  197. }
  198. ResultCode result = vm_manager.UnmapRange(target, size);
  199. if (result.IsError()) return result;
  200. linear_heap_used -= size;
  201. memory_region->used -= size;
  202. if (target + size == heap_end) {
  203. // End of linear heap has been freed, so check what's the last allocated block in it and
  204. // reduce the size.
  205. auto vma = vm_manager.FindVMA(target);
  206. ASSERT(vma != vm_manager.vma_map.end());
  207. ASSERT(vma->second.type == VMAType::Free);
  208. VAddr new_end = vma->second.base;
  209. if (new_end >= GetLinearHeapBase()) {
  210. linheap_memory->resize(new_end - GetLinearHeapBase());
  211. }
  212. }
  213. return RESULT_SUCCESS;
  214. }
  215. Kernel::Process::Process() {}
  216. Kernel::Process::~Process() {}
  217. SharedPtr<Process> g_current_process;
  218. }