Files
eden/src/core/hle/kernel/semaphore.cpp
T

96 lines
3.3 KiB
C++
Raw Normal View History

2014-12-03 18:49:51 -05:00
// Copyright 2014 Citra Emulator Project
2014-12-16 21:38:14 -08:00
// Licensed under GPLv2 or any later version
2014-12-03 18:49:51 -05:00
// Refer to the license.txt file included.
2014-12-04 11:40:36 -05:00
#include <queue>
2014-12-03 18:49:51 -05:00
#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 Object {
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; }
2014-12-03 18:49:51 -05:00
2014-12-19 22:16:34 -05:00
s32 max_count; ///< Maximum number of simultaneous holders the semaphore can have
s32 available_count; ///< Number of free slots left in the semaphore
2014-12-04 11:40:36 -05:00
std::queue<Handle> waiting_threads; ///< Threads that are waiting for the semaphore
2014-12-03 18:49:51 -05:00
std::string name; ///< Name of semaphore (optional)
2014-12-04 11:40:36 -05:00
/**
2014-12-12 20:46:52 -05:00
* Tests whether a semaphore still has free slots
* @return Whether the semaphore is available
2014-12-04 11:40:36 -05:00
*/
2014-12-12 20:46:52 -05:00
bool IsAvailable() const {
return available_count > 0;
2014-12-04 11:40:36 -05:00
}
2014-12-03 18:49:51 -05:00
ResultVal<bool> WaitSynchronization() override {
2014-12-13 10:29:11 -05:00
bool wait = !IsAvailable();
2014-12-03 18:49:51 -05:00
if (wait) {
Kernel::WaitCurrentThread(WAITTYPE_SEMA, GetHandle());
2014-12-04 11:40:36 -05:00
waiting_threads.push(GetCurrentThreadHandle());
2014-12-03 18:49:51 -05:00
} else {
--available_count;
2014-12-03 18:49:51 -05:00
}
return MakeResult<bool>(wait);
}
};
////////////////////////////////////////////////////////////////////////////////////////////////////
2014-12-19 22:16:34 -05:00
ResultCode CreateSemaphore(Handle* handle, s32 initial_count,
s32 max_count, const std::string& name) {
2014-12-04 11:40:36 -05:00
2014-12-12 20:46:52 -05:00
if (initial_count > max_count)
return ResultCode(ErrorDescription::InvalidCombination, ErrorModule::Kernel,
ErrorSummary::WrongArgument, ErrorLevel::Permanent);
2014-12-03 18:49:51 -05:00
Semaphore* semaphore = new Semaphore;
2014-12-21 10:04:08 -02:00
// TOOD(yuriks): Fix error reporting
*handle = g_handle_table.Create(semaphore).ValueOr(INVALID_HANDLE);
2014-12-03 18:49:51 -05:00
// When the semaphore is created, some slots are reserved for other threads,
// and the rest is reserved for the caller thread
2014-12-12 20:46:52 -05:00
semaphore->max_count = max_count;
semaphore->available_count = initial_count;
2014-12-03 18:49:51 -05:00
semaphore->name = name;
2014-12-04 11:40:36 -05:00
return RESULT_SUCCESS;
}
ResultCode ReleaseSemaphore(s32* count, Handle handle, s32 release_count) {
2014-12-13 21:16:13 -02:00
Semaphore* semaphore = g_handle_table.Get<Semaphore>(handle);
2014-12-04 11:40:36 -05:00
if (semaphore == nullptr)
return InvalidHandle(ErrorModule::Kernel);
if (semaphore->max_count - semaphore->available_count < release_count)
2014-12-04 11:40:36 -05:00
return ResultCode(ErrorDescription::OutOfRange, ErrorModule::Kernel,
ErrorSummary::InvalidArgument, ErrorLevel::Permanent);
*count = semaphore->available_count;
semaphore->available_count += release_count;
2014-12-04 11:40:36 -05:00
// 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
2014-12-12 20:46:52 -05:00
while (!semaphore->waiting_threads.empty() && semaphore->IsAvailable()) {
2014-12-04 11:40:36 -05:00
Kernel::ResumeThreadFromWait(semaphore->waiting_threads.front());
semaphore->waiting_threads.pop();
--semaphore->available_count;
2014-12-04 11:40:36 -05:00
}
return RESULT_SUCCESS;
2014-12-03 18:49:51 -05:00
}
} // namespace