mirror of
https://gitlab.com/suyu-emu/suyu.git
synced 2024-03-15 23:15:44 +00:00
6643673f28
- Separate wait checking from waiting the current thread - Resume thread when wait_all=true only if all objects are available at once - Set output to correct wait object index when there are duplicate handles
102 lines
3.3 KiB
C++
102 lines
3.3 KiB
C++
// Copyright 2014 Citra Emulator Project
|
|
// Licensed under GPLv2 or any later version
|
|
// Refer to the license.txt file included.
|
|
|
|
#include <queue>
|
|
|
|
#include "common/common.h"
|
|
|
|
#include "core/hle/kernel/kernel.h"
|
|
#include "core/hle/kernel/semaphore.h"
|
|
#include "core/hle/kernel/thread.h"
|
|
|
|
namespace Kernel {
|
|
|
|
class Semaphore : public WaitObject {
|
|
public:
|
|
std::string GetTypeName() const override { return "Semaphore"; }
|
|
std::string GetName() const override { return name; }
|
|
|
|
static const HandleType HANDLE_TYPE = HandleType::Semaphore;
|
|
HandleType GetHandleType() const override { return HANDLE_TYPE; }
|
|
|
|
s32 max_count; ///< Maximum number of simultaneous holders the semaphore can have
|
|
s32 available_count; ///< Number of free slots left in the semaphore
|
|
std::string name; ///< Name of semaphore (optional)
|
|
|
|
/**
|
|
* Tests whether a semaphore still has free slots
|
|
* @return Whether the semaphore is available
|
|
*/
|
|
bool IsAvailable() const {
|
|
return available_count > 0;
|
|
}
|
|
|
|
ResultVal<bool> Wait(bool wait_thread) override {
|
|
bool wait = !IsAvailable();
|
|
|
|
if (wait && wait_thread) {
|
|
Kernel::WaitCurrentThread_WaitSynchronization(WAITTYPE_SEMA, this);
|
|
AddWaitingThread(GetCurrentThread());
|
|
}
|
|
|
|
return MakeResult<bool>(wait);
|
|
}
|
|
|
|
ResultVal<bool> Acquire() override {
|
|
bool res = false;
|
|
|
|
if (IsAvailable()) {
|
|
--available_count;
|
|
res = true;
|
|
}
|
|
|
|
return MakeResult<bool>(res);
|
|
}
|
|
};
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
ResultCode CreateSemaphore(Handle* handle, s32 initial_count,
|
|
s32 max_count, const std::string& name) {
|
|
|
|
if (initial_count > max_count)
|
|
return ResultCode(ErrorDescription::InvalidCombination, ErrorModule::Kernel,
|
|
ErrorSummary::WrongArgument, ErrorLevel::Permanent);
|
|
|
|
Semaphore* semaphore = new Semaphore;
|
|
// TOOD(yuriks): Fix error reporting
|
|
*handle = g_handle_table.Create(semaphore).ValueOr(INVALID_HANDLE);
|
|
|
|
// When the semaphore is created, some slots are reserved for other threads,
|
|
// and the rest is reserved for the caller thread
|
|
semaphore->max_count = max_count;
|
|
semaphore->available_count = initial_count;
|
|
semaphore->name = name;
|
|
|
|
return RESULT_SUCCESS;
|
|
}
|
|
|
|
ResultCode ReleaseSemaphore(s32* count, Handle handle, s32 release_count) {
|
|
Semaphore* semaphore = g_handle_table.Get<Semaphore>(handle).get();
|
|
if (semaphore == nullptr)
|
|
return InvalidHandle(ErrorModule::Kernel);
|
|
|
|
if (semaphore->max_count - semaphore->available_count < release_count)
|
|
return ResultCode(ErrorDescription::OutOfRange, ErrorModule::Kernel,
|
|
ErrorSummary::InvalidArgument, ErrorLevel::Permanent);
|
|
|
|
*count = semaphore->available_count;
|
|
semaphore->available_count += release_count;
|
|
|
|
// Notify some of the threads that the semaphore has been released
|
|
// stop once the semaphore is full again or there are no more waiting threads
|
|
while (semaphore->IsAvailable() && semaphore->ReleaseNextThread() != nullptr) {
|
|
--semaphore->available_count;
|
|
}
|
|
|
|
return RESULT_SUCCESS;
|
|
}
|
|
|
|
} // namespace
|