mirror of
https://git.suyu.dev/suyu/suyu
synced 2024-11-01 12:57:52 +00:00
Thread: Added priority range checking to svcSetThreadPriority and removed priority clamping code from Thread::SetPriority.
This commit is contained in:
parent
5ddc2e09b1
commit
f2f2572fed
3 changed files with 18 additions and 18 deletions
|
@ -62,6 +62,8 @@ s32 ResourceLimit::GetCurrentResourceValue(u32 resource) const {
|
||||||
|
|
||||||
s32 ResourceLimit::GetMaxResourceValue(u32 resource) const {
|
s32 ResourceLimit::GetMaxResourceValue(u32 resource) const {
|
||||||
switch (resource) {
|
switch (resource) {
|
||||||
|
case PRIORITY:
|
||||||
|
return max_priority;
|
||||||
case COMMIT:
|
case COMMIT:
|
||||||
return max_commit;
|
return max_commit;
|
||||||
case THREAD:
|
case THREAD:
|
||||||
|
|
|
@ -444,25 +444,9 @@ ResultVal<SharedPtr<Thread>> Thread::Create(std::string name, VAddr entry_point,
|
||||||
return MakeResult<SharedPtr<Thread>>(std::move(thread));
|
return MakeResult<SharedPtr<Thread>>(std::move(thread));
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO(peachum): Remove this. Range checking should be done, and an appropriate error should be
|
|
||||||
// returned.
|
|
||||||
static void ClampPriority(const Thread* thread, s32* priority) {
|
|
||||||
if (*priority < THREADPRIO_HIGHEST || *priority > THREADPRIO_LOWEST) {
|
|
||||||
DEBUG_ASSERT_MSG(
|
|
||||||
false, "Application passed an out of range priority. An error should be returned.");
|
|
||||||
|
|
||||||
s32 new_priority = MathUtil::Clamp<s32>(*priority, THREADPRIO_HIGHEST, THREADPRIO_LOWEST);
|
|
||||||
LOG_WARNING(Kernel_SVC, "(name=%s): invalid priority=%d, clamping to %d",
|
|
||||||
thread->name.c_str(), *priority, new_priority);
|
|
||||||
// TODO(bunnei): Clamping to a valid priority is not necessarily correct behavior... Confirm
|
|
||||||
// validity of this
|
|
||||||
*priority = new_priority;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void Thread::SetPriority(s32 priority) {
|
void Thread::SetPriority(s32 priority) {
|
||||||
ClampPriority(this, &priority);
|
ASSERT_MSG(priority <= THREADPRIO_LOWEST && priority >= THREADPRIO_HIGHEST,
|
||||||
|
"Invalid priority value.");
|
||||||
// If thread was ready, adjust queues
|
// If thread was ready, adjust queues
|
||||||
if (status == THREADSTATUS_READY)
|
if (status == THREADSTATUS_READY)
|
||||||
ready_queue.move(this, current_priority, priority);
|
ready_queue.move(this, current_priority, priority);
|
||||||
|
|
|
@ -598,10 +598,24 @@ static ResultCode GetThreadPriority(s32* priority, Kernel::Handle handle) {
|
||||||
|
|
||||||
/// Sets the priority for the specified thread
|
/// Sets the priority for the specified thread
|
||||||
static ResultCode SetThreadPriority(Kernel::Handle handle, s32 priority) {
|
static ResultCode SetThreadPriority(Kernel::Handle handle, s32 priority) {
|
||||||
|
if (priority > THREADPRIO_LOWEST) {
|
||||||
|
return ResultCode(ErrorDescription::OutOfRange, ErrorModule::OS,
|
||||||
|
ErrorSummary::InvalidArgument, ErrorLevel::Usage);
|
||||||
|
}
|
||||||
|
|
||||||
SharedPtr<Kernel::Thread> thread = Kernel::g_handle_table.Get<Kernel::Thread>(handle);
|
SharedPtr<Kernel::Thread> thread = Kernel::g_handle_table.Get<Kernel::Thread>(handle);
|
||||||
if (thread == nullptr)
|
if (thread == nullptr)
|
||||||
return ERR_INVALID_HANDLE;
|
return ERR_INVALID_HANDLE;
|
||||||
|
|
||||||
|
using Kernel::ResourceLimit;
|
||||||
|
// Note: The kernel uses the current process's resource limit instead of
|
||||||
|
// the one from the thread owner's resource limit.
|
||||||
|
Kernel::SharedPtr<ResourceLimit>& resource_limit = Kernel::g_current_process->resource_limit;
|
||||||
|
if (resource_limit->GetMaxResourceValue(Kernel::ResourceTypes::PRIORITY) > priority) {
|
||||||
|
return ResultCode(ErrorDescription::NotAuthorized, ErrorModule::OS,
|
||||||
|
ErrorSummary::WrongArgument, ErrorLevel::Permanent);
|
||||||
|
}
|
||||||
|
|
||||||
thread->SetPriority(priority);
|
thread->SetPriority(priority);
|
||||||
thread->UpdatePriority();
|
thread->UpdatePriority();
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue