72 lines
1.8 KiB
C++
72 lines
1.8 KiB
C++
#include <mbgl/actor/mailbox.hpp>
|
|
#include <mbgl/actor/message.hpp>
|
|
#include <mbgl/actor/scheduler.hpp>
|
|
|
|
#include <cassert>
|
|
|
|
namespace mbgl {
|
|
|
|
Mailbox::Mailbox(Scheduler& scheduler_)
|
|
: scheduler(scheduler_) {
|
|
}
|
|
|
|
void Mailbox::close() {
|
|
// Block until neither receive() nor push() are in progress. Two mutexes are used because receive()
|
|
// must not block send(). Of the two, the receiving mutex must be acquired first, because that is
|
|
// the order that an actor will obtain them when it self-sends a message, and consistent lock
|
|
// acquisition order prevents deadlocks.
|
|
// The receiving mutex is recursive to allow a mailbox (and thus the actor) to close itself.
|
|
std::lock_guard<std::recursive_mutex> receivingLock(receivingMutex);
|
|
std::lock_guard<std::mutex> pushingLock(pushingMutex);
|
|
|
|
closed = true;
|
|
}
|
|
|
|
void Mailbox::push(std::unique_ptr<Message> message) {
|
|
std::lock_guard<std::mutex> pushingLock(pushingMutex);
|
|
|
|
if (closed) {
|
|
return;
|
|
}
|
|
|
|
std::lock_guard<std::mutex> queueLock(queueMutex);
|
|
bool wasEmpty = queue.empty();
|
|
queue.push(std::move(message));
|
|
if (wasEmpty) {
|
|
scheduler.schedule(shared_from_this());
|
|
}
|
|
}
|
|
|
|
void Mailbox::receive() {
|
|
std::lock_guard<std::recursive_mutex> receivingLock(receivingMutex);
|
|
|
|
if (closed) {
|
|
return;
|
|
}
|
|
|
|
std::unique_ptr<Message> message;
|
|
bool wasEmpty;
|
|
|
|
{
|
|
std::lock_guard<std::mutex> queueLock(queueMutex);
|
|
assert(!queue.empty());
|
|
message = std::move(queue.front());
|
|
queue.pop();
|
|
wasEmpty = queue.empty();
|
|
}
|
|
|
|
(*message)();
|
|
|
|
if (!wasEmpty) {
|
|
scheduler.schedule(shared_from_this());
|
|
}
|
|
}
|
|
|
|
void Mailbox::maybeReceive(std::weak_ptr<Mailbox> mailbox) {
|
|
if (auto locked = mailbox.lock()) {
|
|
locked->receive();
|
|
}
|
|
}
|
|
|
|
} // namespace mbgl
|