mirror of
https://github.com/Atmosphere-NX/Atmosphere.git
synced 2024-11-10 14:11:43 +00:00
ad636f7216
* Stratosphere: Use modern C++ idioms in some places * algorithms like std::for_each are used instead of raw loops * Stratosphere: Replace more raw loops with algorithms * Stratosphere: Add a utility predicate function to test for equality with a reference element This can be used to rewrite some common raw loops using algorithms instead * fs.mitm: Use variant * fs.mitm: Use enum class * fs.mitm: Turn RomFSSourceInfo::Cleanup into a destructor This obsoletes the need for a custom deleter in other places * fs.mitm: Use enum class some more * fs.mitm: Use unique_ptr * fs.mitm: Simplify initialization * Stratosphere: Simplify initialization * fs.mitm: Use unique_ptr (fix memory leak along the way) The previous code was using "delete" rather than "delete[]" * fs.mitm: Use vector::emplace_back rather than push_back emplace_back constructs elements in-place, hence avoiding a redundant element copy. * Stratosphere: Replace more raw loops with algorithms * Stratosphere: Use unique_ptr * fs.mitm: Replace more raw loops with algorithms * Stratosphere: Prefer move-construction over copy-construction when moving sink parameters around
90 lines
3 KiB
C++
90 lines
3 KiB
C++
#include <switch.h>
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
|
|
#include <stratosphere/waitablemanager.hpp>
|
|
|
|
void WaitableManager::add_waitable(IWaitable *waitable) {
|
|
this->lock.Lock();
|
|
this->to_add_waitables.push_back(waitable);
|
|
waitable->set_manager(this);
|
|
this->has_new_items = true;
|
|
this->lock.Unlock();
|
|
}
|
|
|
|
void WaitableManager::process_internal(bool break_on_timeout) {
|
|
std::vector<Handle> handles;
|
|
|
|
int handle_index = 0;
|
|
Result rc;
|
|
|
|
while (1) {
|
|
/* Add new items, if relevant. */
|
|
if (this->has_new_items) {
|
|
this->lock.Lock();
|
|
this->waitables.insert(this->waitables.end(), this->to_add_waitables.begin(), this->to_add_waitables.end());
|
|
this->to_add_waitables.clear();
|
|
this->has_new_items = false;
|
|
this->lock.Unlock();
|
|
}
|
|
|
|
/* Sort waitables by priority. */
|
|
std::sort(this->waitables.begin(), this->waitables.end(), IWaitable::compare);
|
|
|
|
/* Copy out handles. */
|
|
handles.resize(this->waitables.size());
|
|
std::transform(this->waitables.begin(), this->waitables.end(), handles.begin(), [](IWaitable *w) { return w->get_handle(); });
|
|
|
|
|
|
rc = svcWaitSynchronization(&handle_index, handles.data(), this->waitables.size(), this->timeout);
|
|
if (R_SUCCEEDED(rc)) {
|
|
/* Handle a signaled waitable. */
|
|
/* TODO: What timeout should be passed here? */
|
|
|
|
rc = this->waitables[handle_index]->handle_signaled(0);
|
|
|
|
std::for_each(waitables.begin(), waitables.begin() + handle_index, std::mem_fn(&IWaitable::update_priority));
|
|
} else if (rc == 0xEA01) {
|
|
/* Timeout. */
|
|
std::for_each(waitables.begin(), waitables.end(), std::mem_fn(&IWaitable::update_priority));
|
|
if (break_on_timeout) {
|
|
return;
|
|
}
|
|
} else if (rc != 0xF601) {
|
|
/* TODO: Panic. When can this happen? */
|
|
}
|
|
|
|
if (rc == 0xF601) {
|
|
/* handles[handle_index] was closed! */
|
|
|
|
/* Close the handle. */
|
|
svcCloseHandle(handles[handle_index]);
|
|
|
|
IWaitable *to_delete = this->waitables[handle_index];
|
|
|
|
/* If relevant, remove from waitables. */
|
|
this->waitables.erase(this->waitables.begin() + handle_index);
|
|
|
|
/* Delete it. */
|
|
delete to_delete;
|
|
|
|
std::for_each(waitables.begin(), waitables.begin() + handle_index, std::mem_fn(&IWaitable::update_priority));
|
|
}
|
|
|
|
/* Do deferred callback for each waitable. */
|
|
for (auto & waitable : this->waitables) {
|
|
if (waitable->get_deferred()) {
|
|
waitable->handle_deferred();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void WaitableManager::process() {
|
|
WaitableManager::process_internal(false);
|
|
}
|
|
|
|
void WaitableManager::process_until_timeout() {
|
|
WaitableManager::process_internal(true);
|
|
}
|