citra/src/core/hle/kernel/kernel.cpp

163 lines
4.4 KiB
C++
Raw Normal View History

2014-12-17 05:38:14 +00:00
// Copyright 2014 Citra Emulator Project
// Licensed under GPLv2 or any later version
// Refer to the license.txt file included.
2014-05-10 03:11:18 +01:00
2014-12-04 00:55:45 +00:00
#include <algorithm>
2014-05-10 03:11:18 +01:00
#include "common/common.h"
#include "core/arm/arm_interface.h"
#include "core/core.h"
2014-05-10 03:11:18 +01:00
#include "core/hle/kernel/kernel.h"
#include "core/hle/kernel/thread.h"
#include "core/hle/kernel/timer.h"
2014-05-10 03:11:18 +01:00
namespace Kernel {
2014-05-10 03:11:18 +01:00
unsigned int Object::next_object_id = 0;
SharedPtr<Thread> g_main_thread = nullptr;
2014-12-13 23:16:13 +00:00
HandleTable g_handle_table;
u64 g_program_id = 0;
2014-05-10 03:11:18 +01:00
void WaitObject::AddWaitingThread(SharedPtr<Thread> thread) {
auto itr = std::find(waiting_threads.begin(), waiting_threads.end(), thread);
if (itr == waiting_threads.end())
waiting_threads.push_back(std::move(thread));
}
void WaitObject::RemoveWaitingThread(Thread* thread) {
auto itr = std::find(waiting_threads.begin(), waiting_threads.end(), thread);
if (itr != waiting_threads.end())
waiting_threads.erase(itr);
}
SharedPtr<Thread> WaitObject::WakeupNextThread() {
if (waiting_threads.empty())
return nullptr;
auto next_thread = std::move(waiting_threads.front());
waiting_threads.erase(waiting_threads.begin());
next_thread->ReleaseWaitObject(this);
2015-01-19 01:40:53 +00:00
return next_thread;
}
void WaitObject::WakeupAllWaitingThreads() {
auto waiting_threads_copy = waiting_threads;
// We use a copy because ReleaseWaitObject will remove the thread from this object's
// waiting_threads list
for (auto thread : waiting_threads_copy)
thread->ReleaseWaitObject(this);
ASSERT_MSG(waiting_threads.empty(), "failed to awaken all waiting threads!");
}
2014-12-13 23:16:13 +00:00
HandleTable::HandleTable() {
next_generation = 1;
Clear();
2014-05-10 03:11:18 +01:00
}
ResultVal<Handle> HandleTable::Create(SharedPtr<Object> obj) {
DEBUG_ASSERT(obj != nullptr);
u16 slot = next_free_slot;
if (slot >= generations.size()) {
LOG_ERROR(Kernel, "Unable to allocate Handle, too many slots in use.");
return ERR_OUT_OF_HANDLES;
2014-05-10 03:11:18 +01:00
}
next_free_slot = generations[slot];
2014-05-10 03:11:18 +01:00
u16 generation = next_generation++;
2014-05-10 03:11:18 +01:00
// Overflow count so it fits in the 15 bits dedicated to the generation in the handle.
// CTR-OS doesn't use generation 0, so skip straight to 1.
if (next_generation >= (1 << 15)) next_generation = 1;
generations[slot] = generation;
objects[slot] = std::move(obj);
Handle handle = generation | (slot << 15);
return MakeResult<Handle>(handle);
2014-05-10 03:11:18 +01:00
}
ResultVal<Handle> HandleTable::Duplicate(Handle handle) {
SharedPtr<Object> object = GetGeneric(handle);
if (object == nullptr) {
LOG_ERROR(Kernel, "Tried to duplicate invalid handle: %08X", handle);
return ERR_INVALID_HANDLE;
2014-05-10 03:11:18 +01:00
}
return Create(std::move(object));
2014-05-10 03:11:18 +01:00
}
ResultCode HandleTable::Close(Handle handle) {
if (!IsValid(handle))
return ERR_INVALID_HANDLE;
2015-02-01 20:31:21 +00:00
u16 slot = GetSlot(handle);
objects[slot] = nullptr;
2015-01-31 18:12:20 +00:00
generations[slot] = next_free_slot;
next_free_slot = slot;
return RESULT_SUCCESS;
2014-05-10 03:11:18 +01:00
}
bool HandleTable::IsValid(Handle handle) const {
size_t slot = GetSlot(handle);
u16 generation = GetGeneration(handle);
return slot < MAX_COUNT && objects[slot] != nullptr && generations[slot] == generation;
2014-05-10 03:11:18 +01:00
}
SharedPtr<Object> HandleTable::GetGeneric(Handle handle) const {
if (handle == CurrentThread) {
return GetCurrentThread();
} else if (handle == CurrentProcess) {
LOG_ERROR(Kernel, "Current process (%08X) pseudo-handle not supported", CurrentProcess);
return nullptr;
}
if (!IsValid(handle)) {
return nullptr;
}
return objects[GetSlot(handle)];
2014-05-10 03:11:18 +01:00
}
void HandleTable::Clear() {
2015-02-01 20:31:21 +00:00
for (u16 i = 0; i < MAX_COUNT; ++i) {
generations[i] = i + 1;
objects[i] = nullptr;
}
next_free_slot = 0;
2014-05-10 03:11:18 +01:00
}
/// Initialize the kernel
void Init() {
Kernel::ThreadingInit();
Kernel::TimersInit();
}
/// Shutdown the kernel
void Shutdown() {
Kernel::ThreadingShutdown();
Kernel::TimersShutdown();
2014-12-13 23:16:13 +00:00
g_handle_table.Clear(); // Free all kernel objects
}
/**
* Loads executable stored at specified address
* @entry_point Entry point in memory of loaded executable
* @return True on success, otherwise false
*/
bool LoadExec(u32 entry_point) {
// 0x30 is the typical main thread priority I've seen used so far
g_main_thread = Kernel::SetupMainThread(Kernel::DEFAULT_STACK_SIZE, entry_point, 0x30);
return true;
}
} // namespace