k_process.cpp 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583
  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 <bitset>
  6. #include <ctime>
  7. #include <memory>
  8. #include <random>
  9. #include "common/alignment.h"
  10. #include "common/assert.h"
  11. #include "common/logging/log.h"
  12. #include "common/scope_exit.h"
  13. #include "common/settings.h"
  14. #include "core/core.h"
  15. #include "core/device_memory.h"
  16. #include "core/file_sys/program_metadata.h"
  17. #include "core/hle/kernel/code_set.h"
  18. #include "core/hle/kernel/k_memory_block_manager.h"
  19. #include "core/hle/kernel/k_page_table.h"
  20. #include "core/hle/kernel/k_process.h"
  21. #include "core/hle/kernel/k_resource_limit.h"
  22. #include "core/hle/kernel/k_scheduler.h"
  23. #include "core/hle/kernel/k_scoped_resource_reservation.h"
  24. #include "core/hle/kernel/k_shared_memory.h"
  25. #include "core/hle/kernel/k_shared_memory_info.h"
  26. #include "core/hle/kernel/k_slab_heap.h"
  27. #include "core/hle/kernel/k_thread.h"
  28. #include "core/hle/kernel/kernel.h"
  29. #include "core/hle/kernel/svc_results.h"
  30. #include "core/hle/lock.h"
  31. #include "core/memory.h"
  32. namespace Kernel {
  33. namespace {
  34. /**
  35. * Sets up the primary application thread
  36. *
  37. * @param system The system instance to create the main thread under.
  38. * @param owner_process The parent process for the main thread
  39. * @param priority The priority to give the main thread
  40. */
  41. void SetupMainThread(Core::System& system, KProcess& owner_process, u32 priority, VAddr stack_top) {
  42. const VAddr entry_point = owner_process.PageTable().GetCodeRegionStart();
  43. ASSERT(owner_process.GetResourceLimit()->Reserve(LimitableResource::Threads, 1));
  44. KThread* thread = KThread::Create(system.Kernel());
  45. SCOPE_EXIT({ thread->Close(); });
  46. ASSERT(KThread::InitializeUserThread(system, thread, entry_point, 0, stack_top, priority,
  47. owner_process.GetIdealCoreId(), &owner_process)
  48. .IsSuccess());
  49. // Register 1 must be a handle to the main thread
  50. Handle thread_handle{};
  51. owner_process.GetHandleTable().Add(&thread_handle, thread);
  52. thread->SetName("main");
  53. thread->GetContext32().cpu_registers[0] = 0;
  54. thread->GetContext64().cpu_registers[0] = 0;
  55. thread->GetContext32().cpu_registers[1] = thread_handle;
  56. thread->GetContext64().cpu_registers[1] = thread_handle;
  57. auto& kernel = system.Kernel();
  58. // Threads by default are dormant, wake up the main thread so it runs when the scheduler fires
  59. {
  60. KScopedSchedulerLock lock{kernel};
  61. thread->SetState(ThreadState::Runnable);
  62. }
  63. }
  64. } // Anonymous namespace
  65. // Represents a page used for thread-local storage.
  66. //
  67. // Each TLS page contains slots that may be used by processes and threads.
  68. // Every process and thread is created with a slot in some arbitrary page
  69. // (whichever page happens to have an available slot).
  70. class TLSPage {
  71. public:
  72. static constexpr std::size_t num_slot_entries =
  73. Core::Memory::PAGE_SIZE / Core::Memory::TLS_ENTRY_SIZE;
  74. explicit TLSPage(VAddr address) : base_address{address} {}
  75. bool HasAvailableSlots() const {
  76. return !is_slot_used.all();
  77. }
  78. VAddr GetBaseAddress() const {
  79. return base_address;
  80. }
  81. std::optional<VAddr> ReserveSlot() {
  82. for (std::size_t i = 0; i < is_slot_used.size(); i++) {
  83. if (is_slot_used[i]) {
  84. continue;
  85. }
  86. is_slot_used[i] = true;
  87. return base_address + (i * Core::Memory::TLS_ENTRY_SIZE);
  88. }
  89. return std::nullopt;
  90. }
  91. void ReleaseSlot(VAddr address) {
  92. // Ensure that all given addresses are consistent with how TLS pages
  93. // are intended to be used when releasing slots.
  94. ASSERT(IsWithinPage(address));
  95. ASSERT((address % Core::Memory::TLS_ENTRY_SIZE) == 0);
  96. const std::size_t index = (address - base_address) / Core::Memory::TLS_ENTRY_SIZE;
  97. is_slot_used[index] = false;
  98. }
  99. private:
  100. bool IsWithinPage(VAddr address) const {
  101. return base_address <= address && address < base_address + Core::Memory::PAGE_SIZE;
  102. }
  103. VAddr base_address;
  104. std::bitset<num_slot_entries> is_slot_used;
  105. };
  106. ResultCode KProcess::Initialize(KProcess* process, Core::System& system, std::string process_name,
  107. ProcessType type) {
  108. auto& kernel = system.Kernel();
  109. process->name = std::move(process_name);
  110. process->resource_limit = kernel.GetSystemResourceLimit();
  111. process->status = ProcessStatus::Created;
  112. process->program_id = 0;
  113. process->process_id = type == ProcessType::KernelInternal ? kernel.CreateNewKernelProcessID()
  114. : kernel.CreateNewUserProcessID();
  115. process->capabilities.InitializeForMetadatalessProcess();
  116. process->is_initialized = true;
  117. std::mt19937 rng(Settings::values.rng_seed.GetValue().value_or(std::time(nullptr)));
  118. std::uniform_int_distribution<u64> distribution;
  119. std::generate(process->random_entropy.begin(), process->random_entropy.end(),
  120. [&] { return distribution(rng); });
  121. kernel.AppendNewProcess(process);
  122. // Open a reference to the resource limit.
  123. process->resource_limit->Open();
  124. return ResultSuccess;
  125. }
  126. KResourceLimit* KProcess::GetResourceLimit() const {
  127. return resource_limit;
  128. }
  129. void KProcess::IncrementThreadCount() {
  130. ASSERT(num_threads >= 0);
  131. num_created_threads++;
  132. if (const auto count = ++num_threads; count > peak_num_threads) {
  133. peak_num_threads = count;
  134. }
  135. }
  136. void KProcess::DecrementThreadCount() {
  137. ASSERT(num_threads > 0);
  138. if (const auto count = --num_threads; count == 0) {
  139. LOG_WARNING(Kernel, "Process termination is not fully implemented.");
  140. }
  141. }
  142. u64 KProcess::GetTotalPhysicalMemoryAvailable() const {
  143. const u64 capacity{resource_limit->GetFreeValue(LimitableResource::PhysicalMemory) +
  144. page_table->GetTotalHeapSize() + GetSystemResourceSize() + image_size +
  145. main_thread_stack_size};
  146. if (const auto pool_size = kernel.MemoryManager().GetSize(KMemoryManager::Pool::Application);
  147. capacity != pool_size) {
  148. LOG_WARNING(Kernel, "capacity {} != application pool size {}", capacity, pool_size);
  149. }
  150. if (capacity < memory_usage_capacity) {
  151. return capacity;
  152. }
  153. return memory_usage_capacity;
  154. }
  155. u64 KProcess::GetTotalPhysicalMemoryAvailableWithoutSystemResource() const {
  156. return GetTotalPhysicalMemoryAvailable() - GetSystemResourceSize();
  157. }
  158. u64 KProcess::GetTotalPhysicalMemoryUsed() const {
  159. return image_size + main_thread_stack_size + page_table->GetTotalHeapSize() +
  160. GetSystemResourceSize();
  161. }
  162. u64 KProcess::GetTotalPhysicalMemoryUsedWithoutSystemResource() const {
  163. return GetTotalPhysicalMemoryUsed() - GetSystemResourceUsage();
  164. }
  165. bool KProcess::ReleaseUserException(KThread* thread) {
  166. KScopedSchedulerLock sl{kernel};
  167. if (exception_thread == thread) {
  168. exception_thread = nullptr;
  169. // Remove waiter thread.
  170. s32 num_waiters{};
  171. if (KThread* next = thread->RemoveWaiterByKey(
  172. std::addressof(num_waiters),
  173. reinterpret_cast<uintptr_t>(std::addressof(exception_thread)));
  174. next != nullptr) {
  175. next->SetState(ThreadState::Runnable);
  176. }
  177. KScheduler::SetSchedulerUpdateNeeded(kernel);
  178. return true;
  179. } else {
  180. return false;
  181. }
  182. }
  183. void KProcess::PinCurrentThread() {
  184. ASSERT(kernel.GlobalSchedulerContext().IsLocked());
  185. // Get the current thread.
  186. const s32 core_id = GetCurrentCoreId(kernel);
  187. KThread* cur_thread = GetCurrentThreadPointer(kernel);
  188. // Pin it.
  189. PinThread(core_id, cur_thread);
  190. cur_thread->Pin();
  191. // An update is needed.
  192. KScheduler::SetSchedulerUpdateNeeded(kernel);
  193. }
  194. void KProcess::UnpinCurrentThread() {
  195. ASSERT(kernel.GlobalSchedulerContext().IsLocked());
  196. // Get the current thread.
  197. const s32 core_id = GetCurrentCoreId(kernel);
  198. KThread* cur_thread = GetCurrentThreadPointer(kernel);
  199. // Unpin it.
  200. cur_thread->Unpin();
  201. UnpinThread(core_id, cur_thread);
  202. // An update is needed.
  203. KScheduler::SetSchedulerUpdateNeeded(kernel);
  204. }
  205. ResultCode KProcess::AddSharedMemory(KSharedMemory* shmem, [[maybe_unused]] VAddr address,
  206. [[maybe_unused]] size_t size) {
  207. // Lock ourselves, to prevent concurrent access.
  208. KScopedLightLock lk(state_lock);
  209. // Try to find an existing info for the memory.
  210. KSharedMemoryInfo* shemen_info = nullptr;
  211. const auto iter = std::find_if(
  212. shared_memory_list.begin(), shared_memory_list.end(),
  213. [shmem](const KSharedMemoryInfo* info) { return info->GetSharedMemory() == shmem; });
  214. if (iter != shared_memory_list.end()) {
  215. shemen_info = *iter;
  216. }
  217. if (shemen_info == nullptr) {
  218. shemen_info = KSharedMemoryInfo::Allocate(kernel);
  219. R_UNLESS(shemen_info != nullptr, ResultOutOfMemory);
  220. shemen_info->Initialize(shmem);
  221. shared_memory_list.push_back(shemen_info);
  222. }
  223. // Open a reference to the shared memory and its info.
  224. shmem->Open();
  225. shemen_info->Open();
  226. return ResultSuccess;
  227. }
  228. void KProcess::RemoveSharedMemory(KSharedMemory* shmem, [[maybe_unused]] VAddr address,
  229. [[maybe_unused]] size_t size) {
  230. // Lock ourselves, to prevent concurrent access.
  231. KScopedLightLock lk(state_lock);
  232. KSharedMemoryInfo* shemen_info = nullptr;
  233. const auto iter = std::find_if(
  234. shared_memory_list.begin(), shared_memory_list.end(),
  235. [shmem](const KSharedMemoryInfo* info) { return info->GetSharedMemory() == shmem; });
  236. if (iter != shared_memory_list.end()) {
  237. shemen_info = *iter;
  238. }
  239. ASSERT(shemen_info != nullptr);
  240. if (shemen_info->Close()) {
  241. shared_memory_list.erase(iter);
  242. KSharedMemoryInfo::Free(kernel, shemen_info);
  243. }
  244. // Close a reference to the shared memory.
  245. shmem->Close();
  246. }
  247. void KProcess::RegisterThread(const KThread* thread) {
  248. thread_list.push_back(thread);
  249. }
  250. void KProcess::UnregisterThread(const KThread* thread) {
  251. thread_list.remove(thread);
  252. }
  253. ResultCode KProcess::Reset() {
  254. // Lock the process and the scheduler.
  255. KScopedLightLock lk(state_lock);
  256. KScopedSchedulerLock sl{kernel};
  257. // Validate that we're in a state that we can reset.
  258. R_UNLESS(status != ProcessStatus::Exited, ResultInvalidState);
  259. R_UNLESS(is_signaled, ResultInvalidState);
  260. // Clear signaled.
  261. is_signaled = false;
  262. return ResultSuccess;
  263. }
  264. ResultCode KProcess::LoadFromMetadata(const FileSys::ProgramMetadata& metadata,
  265. std::size_t code_size) {
  266. program_id = metadata.GetTitleID();
  267. ideal_core = metadata.GetMainThreadCore();
  268. is_64bit_process = metadata.Is64BitProgram();
  269. system_resource_size = metadata.GetSystemResourceSize();
  270. image_size = code_size;
  271. KScopedResourceReservation memory_reservation(resource_limit, LimitableResource::PhysicalMemory,
  272. code_size + system_resource_size);
  273. if (!memory_reservation.Succeeded()) {
  274. LOG_ERROR(Kernel, "Could not reserve process memory requirements of size {:X} bytes",
  275. code_size + system_resource_size);
  276. return ResultLimitReached;
  277. }
  278. // Initialize proces address space
  279. if (const ResultCode result{
  280. page_table->InitializeForProcess(metadata.GetAddressSpaceType(), false, 0x8000000,
  281. code_size, KMemoryManager::Pool::Application)};
  282. result.IsError()) {
  283. return result;
  284. }
  285. // Map process code region
  286. if (const ResultCode result{page_table->MapProcessCode(page_table->GetCodeRegionStart(),
  287. code_size / PageSize, KMemoryState::Code,
  288. KMemoryPermission::None)};
  289. result.IsError()) {
  290. return result;
  291. }
  292. // Initialize process capabilities
  293. const auto& caps{metadata.GetKernelCapabilities()};
  294. if (const ResultCode result{
  295. capabilities.InitializeForUserProcess(caps.data(), caps.size(), *page_table)};
  296. result.IsError()) {
  297. return result;
  298. }
  299. // Set memory usage capacity
  300. switch (metadata.GetAddressSpaceType()) {
  301. case FileSys::ProgramAddressSpaceType::Is32Bit:
  302. case FileSys::ProgramAddressSpaceType::Is36Bit:
  303. case FileSys::ProgramAddressSpaceType::Is39Bit:
  304. memory_usage_capacity = page_table->GetHeapRegionEnd() - page_table->GetHeapRegionStart();
  305. break;
  306. case FileSys::ProgramAddressSpaceType::Is32BitNoMap:
  307. memory_usage_capacity = page_table->GetHeapRegionEnd() - page_table->GetHeapRegionStart() +
  308. page_table->GetAliasRegionEnd() - page_table->GetAliasRegionStart();
  309. break;
  310. default:
  311. UNREACHABLE();
  312. }
  313. // Create TLS region
  314. tls_region_address = CreateTLSRegion();
  315. memory_reservation.Commit();
  316. return handle_table.Initialize(capabilities.GetHandleTableSize());
  317. }
  318. void KProcess::Run(s32 main_thread_priority, u64 stack_size) {
  319. AllocateMainThreadStack(stack_size);
  320. resource_limit->Reserve(LimitableResource::Threads, 1);
  321. resource_limit->Reserve(LimitableResource::PhysicalMemory, main_thread_stack_size);
  322. const std::size_t heap_capacity{memory_usage_capacity - main_thread_stack_size - image_size};
  323. ASSERT(!page_table->SetHeapCapacity(heap_capacity).IsError());
  324. ChangeStatus(ProcessStatus::Running);
  325. SetupMainThread(kernel.System(), *this, main_thread_priority, main_thread_stack_top);
  326. }
  327. void KProcess::PrepareForTermination() {
  328. ChangeStatus(ProcessStatus::Exiting);
  329. const auto stop_threads = [this](const std::vector<KThread*>& in_thread_list) {
  330. for (auto& thread : in_thread_list) {
  331. if (thread->GetOwnerProcess() != this)
  332. continue;
  333. if (thread == kernel.CurrentScheduler()->GetCurrentThread())
  334. continue;
  335. // TODO(Subv): When are the other running/ready threads terminated?
  336. ASSERT_MSG(thread->GetState() == ThreadState::Waiting,
  337. "Exiting processes with non-waiting threads is currently unimplemented");
  338. thread->Exit();
  339. }
  340. };
  341. stop_threads(kernel.System().GlobalSchedulerContext().GetThreadList());
  342. FreeTLSRegion(tls_region_address);
  343. tls_region_address = 0;
  344. if (resource_limit) {
  345. resource_limit->Release(LimitableResource::PhysicalMemory,
  346. main_thread_stack_size + image_size);
  347. }
  348. ChangeStatus(ProcessStatus::Exited);
  349. }
  350. void KProcess::Finalize() {
  351. // Finalize the handle table and close any open handles.
  352. handle_table.Finalize();
  353. // Free all shared memory infos.
  354. {
  355. auto it = shared_memory_list.begin();
  356. while (it != shared_memory_list.end()) {
  357. KSharedMemoryInfo* info = *it;
  358. KSharedMemory* shmem = info->GetSharedMemory();
  359. while (!info->Close()) {
  360. shmem->Close();
  361. }
  362. shmem->Close();
  363. it = shared_memory_list.erase(it);
  364. KSharedMemoryInfo::Free(kernel, info);
  365. }
  366. }
  367. // Release memory to the resource limit.
  368. if (resource_limit != nullptr) {
  369. resource_limit->Close();
  370. resource_limit = nullptr;
  371. }
  372. // Perform inherited finalization.
  373. KAutoObjectWithSlabHeapAndContainer<KProcess, KSynchronizationObject>::Finalize();
  374. }
  375. /**
  376. * Attempts to find a TLS page that contains a free slot for
  377. * use by a thread.
  378. *
  379. * @returns If a page with an available slot is found, then an iterator
  380. * pointing to the page is returned. Otherwise the end iterator
  381. * is returned instead.
  382. */
  383. static auto FindTLSPageWithAvailableSlots(std::vector<TLSPage>& tls_pages) {
  384. return std::find_if(tls_pages.begin(), tls_pages.end(),
  385. [](const auto& page) { return page.HasAvailableSlots(); });
  386. }
  387. VAddr KProcess::CreateTLSRegion() {
  388. KScopedSchedulerLock lock(kernel);
  389. if (auto tls_page_iter{FindTLSPageWithAvailableSlots(tls_pages)};
  390. tls_page_iter != tls_pages.cend()) {
  391. return *tls_page_iter->ReserveSlot();
  392. }
  393. Page* const tls_page_ptr{kernel.GetUserSlabHeapPages().Allocate()};
  394. ASSERT(tls_page_ptr);
  395. const VAddr start{page_table->GetKernelMapRegionStart()};
  396. const VAddr size{page_table->GetKernelMapRegionEnd() - start};
  397. const PAddr tls_map_addr{kernel.System().DeviceMemory().GetPhysicalAddr(tls_page_ptr)};
  398. const VAddr tls_page_addr{page_table
  399. ->AllocateAndMapMemory(1, PageSize, true, start, size / PageSize,
  400. KMemoryState::ThreadLocal,
  401. KMemoryPermission::ReadAndWrite,
  402. tls_map_addr)
  403. .ValueOr(0)};
  404. ASSERT(tls_page_addr);
  405. std::memset(tls_page_ptr, 0, PageSize);
  406. tls_pages.emplace_back(tls_page_addr);
  407. const auto reserve_result{tls_pages.back().ReserveSlot()};
  408. ASSERT(reserve_result.has_value());
  409. return *reserve_result;
  410. }
  411. void KProcess::FreeTLSRegion(VAddr tls_address) {
  412. KScopedSchedulerLock lock(kernel);
  413. const VAddr aligned_address = Common::AlignDown(tls_address, Core::Memory::PAGE_SIZE);
  414. auto iter =
  415. std::find_if(tls_pages.begin(), tls_pages.end(), [aligned_address](const auto& page) {
  416. return page.GetBaseAddress() == aligned_address;
  417. });
  418. // Something has gone very wrong if we're freeing a region
  419. // with no actual page available.
  420. ASSERT(iter != tls_pages.cend());
  421. iter->ReleaseSlot(tls_address);
  422. }
  423. void KProcess::LoadModule(CodeSet code_set, VAddr base_addr) {
  424. std::lock_guard lock{HLE::g_hle_lock};
  425. const auto ReprotectSegment = [&](const CodeSet::Segment& segment,
  426. KMemoryPermission permission) {
  427. page_table->SetProcessMemoryPermission(segment.addr + base_addr, segment.size, permission);
  428. };
  429. kernel.System().Memory().WriteBlock(*this, base_addr, code_set.memory.data(),
  430. code_set.memory.size());
  431. ReprotectSegment(code_set.CodeSegment(), KMemoryPermission::ReadAndExecute);
  432. ReprotectSegment(code_set.RODataSegment(), KMemoryPermission::Read);
  433. ReprotectSegment(code_set.DataSegment(), KMemoryPermission::ReadAndWrite);
  434. }
  435. bool KProcess::IsSignaled() const {
  436. ASSERT(kernel.GlobalSchedulerContext().IsLocked());
  437. return is_signaled;
  438. }
  439. KProcess::KProcess(KernelCore& kernel_)
  440. : KAutoObjectWithSlabHeapAndContainer{kernel_},
  441. page_table{std::make_unique<KPageTable>(kernel_.System())}, handle_table{kernel_},
  442. address_arbiter{kernel_.System()}, condition_var{kernel_.System()}, state_lock{kernel_} {}
  443. KProcess::~KProcess() = default;
  444. void KProcess::ChangeStatus(ProcessStatus new_status) {
  445. if (status == new_status) {
  446. return;
  447. }
  448. status = new_status;
  449. is_signaled = true;
  450. NotifyAvailable();
  451. }
  452. ResultCode KProcess::AllocateMainThreadStack(std::size_t stack_size) {
  453. ASSERT(stack_size);
  454. // The kernel always ensures that the given stack size is page aligned.
  455. main_thread_stack_size = Common::AlignUp(stack_size, PageSize);
  456. const VAddr start{page_table->GetStackRegionStart()};
  457. const std::size_t size{page_table->GetStackRegionEnd() - start};
  458. CASCADE_RESULT(main_thread_stack_top,
  459. page_table->AllocateAndMapMemory(
  460. main_thread_stack_size / PageSize, PageSize, false, start, size / PageSize,
  461. KMemoryState::Stack, KMemoryPermission::ReadAndWrite));
  462. main_thread_stack_top += main_thread_stack_size;
  463. return ResultSuccess;
  464. }
  465. } // namespace Kernel