process.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330
  1. // Copyright 2015 Citra Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include <algorithm>
  5. #include <memory>
  6. #include "common/assert.h"
  7. #include "common/common_funcs.h"
  8. #include "common/logging/log.h"
  9. #include "core/core.h"
  10. #include "core/file_sys/program_metadata.h"
  11. #include "core/hle/kernel/errors.h"
  12. #include "core/hle/kernel/kernel.h"
  13. #include "core/hle/kernel/process.h"
  14. #include "core/hle/kernel/resource_limit.h"
  15. #include "core/hle/kernel/scheduler.h"
  16. #include "core/hle/kernel/thread.h"
  17. #include "core/hle/kernel/vm_manager.h"
  18. #include "core/memory.h"
  19. namespace Kernel {
  20. CodeSet::CodeSet() = default;
  21. CodeSet::~CodeSet() = default;
  22. SharedPtr<Process> Process::Create(KernelCore& kernel, std::string&& name) {
  23. SharedPtr<Process> process(new Process(kernel));
  24. process->name = std::move(name);
  25. process->flags.raw = 0;
  26. process->flags.memory_region.Assign(MemoryRegion::APPLICATION);
  27. process->resource_limit = kernel.ResourceLimitForCategory(ResourceLimitCategory::APPLICATION);
  28. process->status = ProcessStatus::Created;
  29. process->program_id = 0;
  30. process->process_id = kernel.CreateNewProcessID();
  31. process->svc_access_mask.set();
  32. kernel.AppendNewProcess(process);
  33. return process;
  34. }
  35. void Process::LoadFromMetadata(const FileSys::ProgramMetadata& metadata) {
  36. program_id = metadata.GetTitleID();
  37. is_64bit_process = metadata.Is64BitProgram();
  38. vm_manager.Reset(metadata.GetAddressSpaceType());
  39. }
  40. void Process::ParseKernelCaps(const u32* kernel_caps, std::size_t len) {
  41. for (std::size_t i = 0; i < len; ++i) {
  42. u32 descriptor = kernel_caps[i];
  43. u32 type = descriptor >> 20;
  44. if (descriptor == 0xFFFFFFFF) {
  45. // Unused descriptor entry
  46. continue;
  47. } else if ((type & 0xF00) == 0xE00) { // 0x0FFF
  48. // Allowed interrupts list
  49. LOG_WARNING(Loader, "ExHeader allowed interrupts list ignored");
  50. } else if ((type & 0xF80) == 0xF00) { // 0x07FF
  51. // Allowed syscalls mask
  52. unsigned int index = ((descriptor >> 24) & 7) * 24;
  53. u32 bits = descriptor & 0xFFFFFF;
  54. while (bits && index < svc_access_mask.size()) {
  55. svc_access_mask.set(index, bits & 1);
  56. ++index;
  57. bits >>= 1;
  58. }
  59. } else if ((type & 0xFF0) == 0xFE0) { // 0x00FF
  60. // Handle table size
  61. handle_table_size = descriptor & 0x3FF;
  62. } else if ((type & 0xFF8) == 0xFF0) { // 0x007F
  63. // Misc. flags
  64. flags.raw = descriptor & 0xFFFF;
  65. } else if ((type & 0xFFE) == 0xFF8) { // 0x001F
  66. // Mapped memory range
  67. if (i + 1 >= len || ((kernel_caps[i + 1] >> 20) & 0xFFE) != 0xFF8) {
  68. LOG_WARNING(Loader, "Incomplete exheader memory range descriptor ignored.");
  69. continue;
  70. }
  71. u32 end_desc = kernel_caps[i + 1];
  72. ++i; // Skip over the second descriptor on the next iteration
  73. AddressMapping mapping;
  74. mapping.address = descriptor << 12;
  75. VAddr end_address = end_desc << 12;
  76. if (mapping.address < end_address) {
  77. mapping.size = end_address - mapping.address;
  78. } else {
  79. mapping.size = 0;
  80. }
  81. mapping.read_only = (descriptor & (1 << 20)) != 0;
  82. mapping.unk_flag = (end_desc & (1 << 20)) != 0;
  83. address_mappings.push_back(mapping);
  84. } else if ((type & 0xFFF) == 0xFFE) { // 0x000F
  85. // Mapped memory page
  86. AddressMapping mapping;
  87. mapping.address = descriptor << 12;
  88. mapping.size = Memory::PAGE_SIZE;
  89. mapping.read_only = false;
  90. mapping.unk_flag = false;
  91. address_mappings.push_back(mapping);
  92. } else if ((type & 0xFE0) == 0xFC0) { // 0x01FF
  93. // Kernel version
  94. kernel_version = descriptor & 0xFFFF;
  95. int minor = kernel_version & 0xFF;
  96. int major = (kernel_version >> 8) & 0xFF;
  97. LOG_INFO(Loader, "ExHeader kernel version: {}.{}", major, minor);
  98. } else {
  99. LOG_ERROR(Loader, "Unhandled kernel caps descriptor: 0x{:08X}", descriptor);
  100. }
  101. }
  102. }
  103. void Process::Run(VAddr entry_point, s32 main_thread_priority, u32 stack_size) {
  104. // Allocate and map the main thread stack
  105. // TODO(bunnei): This is heap area that should be allocated by the kernel and not mapped as part
  106. // of the user address space.
  107. vm_manager
  108. .MapMemoryBlock(vm_manager.GetTLSIORegionEndAddress() - stack_size,
  109. std::make_shared<std::vector<u8>>(stack_size, 0), 0, stack_size,
  110. MemoryState::Mapped)
  111. .Unwrap();
  112. vm_manager.LogLayout();
  113. status = ProcessStatus::Running;
  114. Kernel::SetupMainThread(kernel, entry_point, main_thread_priority, *this);
  115. }
  116. void Process::PrepareForTermination() {
  117. status = ProcessStatus::Exited;
  118. const auto stop_threads = [this](const std::vector<SharedPtr<Thread>>& thread_list) {
  119. for (auto& thread : thread_list) {
  120. if (thread->GetOwnerProcess() != this)
  121. continue;
  122. if (thread == GetCurrentThread())
  123. continue;
  124. // TODO(Subv): When are the other running/ready threads terminated?
  125. ASSERT_MSG(thread->GetStatus() == ThreadStatus::WaitSynchAny ||
  126. thread->GetStatus() == ThreadStatus::WaitSynchAll,
  127. "Exiting processes with non-waiting threads is currently unimplemented");
  128. thread->Stop();
  129. }
  130. };
  131. const auto& system = Core::System::GetInstance();
  132. stop_threads(system.Scheduler(0).GetThreadList());
  133. stop_threads(system.Scheduler(1).GetThreadList());
  134. stop_threads(system.Scheduler(2).GetThreadList());
  135. stop_threads(system.Scheduler(3).GetThreadList());
  136. }
  137. /**
  138. * Finds a free location for the TLS section of a thread.
  139. * @param tls_slots The TLS page array of the thread's owner process.
  140. * Returns a tuple of (page, slot, alloc_needed) where:
  141. * page: The index of the first allocated TLS page that has free slots.
  142. * slot: The index of the first free slot in the indicated page.
  143. * alloc_needed: Whether there's a need to allocate a new TLS page (All pages are full).
  144. */
  145. static std::tuple<std::size_t, std::size_t, bool> FindFreeThreadLocalSlot(
  146. const std::vector<std::bitset<8>>& tls_slots) {
  147. // Iterate over all the allocated pages, and try to find one where not all slots are used.
  148. for (std::size_t page = 0; page < tls_slots.size(); ++page) {
  149. const auto& page_tls_slots = tls_slots[page];
  150. if (!page_tls_slots.all()) {
  151. // We found a page with at least one free slot, find which slot it is
  152. for (std::size_t slot = 0; slot < page_tls_slots.size(); ++slot) {
  153. if (!page_tls_slots.test(slot)) {
  154. return std::make_tuple(page, slot, false);
  155. }
  156. }
  157. }
  158. }
  159. return std::make_tuple(0, 0, true);
  160. }
  161. VAddr Process::MarkNextAvailableTLSSlotAsUsed(Thread& thread) {
  162. auto [available_page, available_slot, needs_allocation] = FindFreeThreadLocalSlot(tls_slots);
  163. const VAddr tls_begin = vm_manager.GetTLSIORegionBaseAddress();
  164. if (needs_allocation) {
  165. tls_slots.emplace_back(0); // The page is completely available at the start
  166. available_page = tls_slots.size() - 1;
  167. available_slot = 0; // Use the first slot in the new page
  168. // Allocate some memory from the end of the linear heap for this region.
  169. auto& tls_memory = thread.GetTLSMemory();
  170. tls_memory->insert(tls_memory->end(), Memory::PAGE_SIZE, 0);
  171. vm_manager.RefreshMemoryBlockMappings(tls_memory.get());
  172. vm_manager.MapMemoryBlock(tls_begin + available_page * Memory::PAGE_SIZE, tls_memory, 0,
  173. Memory::PAGE_SIZE, MemoryState::ThreadLocal);
  174. }
  175. tls_slots[available_page].set(available_slot);
  176. return tls_begin + available_page * Memory::PAGE_SIZE + available_slot * Memory::TLS_ENTRY_SIZE;
  177. }
  178. void Process::FreeTLSSlot(VAddr tls_address) {
  179. const VAddr tls_base = tls_address - vm_manager.GetTLSIORegionBaseAddress();
  180. const VAddr tls_page = tls_base / Memory::PAGE_SIZE;
  181. const VAddr tls_slot = (tls_base % Memory::PAGE_SIZE) / Memory::TLS_ENTRY_SIZE;
  182. tls_slots[tls_page].reset(tls_slot);
  183. }
  184. void Process::LoadModule(CodeSet module_, VAddr base_addr) {
  185. const auto MapSegment = [&](CodeSet::Segment& segment, VMAPermission permissions,
  186. MemoryState memory_state) {
  187. const auto vma = vm_manager
  188. .MapMemoryBlock(segment.addr + base_addr, module_.memory,
  189. segment.offset, segment.size, memory_state)
  190. .Unwrap();
  191. vm_manager.Reprotect(vma, permissions);
  192. };
  193. // Map CodeSet segments
  194. MapSegment(module_.CodeSegment(), VMAPermission::ReadExecute, MemoryState::CodeStatic);
  195. MapSegment(module_.RODataSegment(), VMAPermission::Read, MemoryState::CodeMutable);
  196. MapSegment(module_.DataSegment(), VMAPermission::ReadWrite, MemoryState::CodeMutable);
  197. // Clear instruction cache in CPU JIT
  198. Core::System::GetInstance().ArmInterface(0).ClearInstructionCache();
  199. Core::System::GetInstance().ArmInterface(1).ClearInstructionCache();
  200. Core::System::GetInstance().ArmInterface(2).ClearInstructionCache();
  201. Core::System::GetInstance().ArmInterface(3).ClearInstructionCache();
  202. }
  203. ResultVal<VAddr> Process::HeapAllocate(VAddr target, u64 size, VMAPermission perms) {
  204. if (target < vm_manager.GetHeapRegionBaseAddress() ||
  205. target + size > vm_manager.GetHeapRegionEndAddress() || target + size < target) {
  206. return ERR_INVALID_ADDRESS;
  207. }
  208. if (heap_memory == nullptr) {
  209. // Initialize heap
  210. heap_memory = std::make_shared<std::vector<u8>>();
  211. heap_start = heap_end = target;
  212. } else {
  213. vm_manager.UnmapRange(heap_start, heap_end - heap_start);
  214. }
  215. // If necessary, expand backing vector to cover new heap extents.
  216. if (target < heap_start) {
  217. heap_memory->insert(begin(*heap_memory), heap_start - target, 0);
  218. heap_start = target;
  219. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  220. }
  221. if (target + size > heap_end) {
  222. heap_memory->insert(end(*heap_memory), (target + size) - heap_end, 0);
  223. heap_end = target + size;
  224. vm_manager.RefreshMemoryBlockMappings(heap_memory.get());
  225. }
  226. ASSERT(heap_end - heap_start == heap_memory->size());
  227. CASCADE_RESULT(auto vma, vm_manager.MapMemoryBlock(target, heap_memory, target - heap_start,
  228. size, MemoryState::Heap));
  229. vm_manager.Reprotect(vma, perms);
  230. heap_used = size;
  231. return MakeResult<VAddr>(heap_end - size);
  232. }
  233. ResultCode Process::HeapFree(VAddr target, u32 size) {
  234. if (target < vm_manager.GetHeapRegionBaseAddress() ||
  235. target + size > vm_manager.GetHeapRegionEndAddress() || target + size < target) {
  236. return ERR_INVALID_ADDRESS;
  237. }
  238. if (size == 0) {
  239. return RESULT_SUCCESS;
  240. }
  241. ResultCode result = vm_manager.UnmapRange(target, size);
  242. if (result.IsError())
  243. return result;
  244. heap_used -= size;
  245. return RESULT_SUCCESS;
  246. }
  247. ResultCode Process::MirrorMemory(VAddr dst_addr, VAddr src_addr, u64 size) {
  248. auto vma = vm_manager.FindVMA(src_addr);
  249. ASSERT_MSG(vma != vm_manager.vma_map.end(), "Invalid memory address");
  250. ASSERT_MSG(vma->second.backing_block, "Backing block doesn't exist for address");
  251. // The returned VMA might be a bigger one encompassing the desired address.
  252. auto vma_offset = src_addr - vma->first;
  253. ASSERT_MSG(vma_offset + size <= vma->second.size,
  254. "Shared memory exceeds bounds of mapped block");
  255. const std::shared_ptr<std::vector<u8>>& backing_block = vma->second.backing_block;
  256. std::size_t backing_block_offset = vma->second.offset + vma_offset;
  257. CASCADE_RESULT(auto new_vma,
  258. vm_manager.MapMemoryBlock(dst_addr, backing_block, backing_block_offset, size,
  259. MemoryState::Mapped));
  260. // Protect mirror with permissions from old region
  261. vm_manager.Reprotect(new_vma, vma->second.permissions);
  262. // Remove permissions from old region
  263. vm_manager.Reprotect(vma, VMAPermission::None);
  264. return RESULT_SUCCESS;
  265. }
  266. ResultCode Process::UnmapMemory(VAddr dst_addr, VAddr /*src_addr*/, u64 size) {
  267. return vm_manager.UnmapRange(dst_addr, size);
  268. }
  269. Kernel::Process::Process(KernelCore& kernel) : Object{kernel} {}
  270. Kernel::Process::~Process() {}
  271. } // namespace Kernel