mirror of
https://github.com/zeromq/libzmq.git
synced 2025-01-08 19:04:09 +01:00
41e3f14d6a
Solution: add const
126 lines
3.8 KiB
C++
126 lines
3.8 KiB
C++
/*
|
|
Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
|
|
|
|
This file is part of libzmq, the ZeroMQ core engine in C++.
|
|
|
|
libzmq is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU Lesser General Public License (LGPL) as published
|
|
by the Free Software Foundation; either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
As a special exception, the Contributors give you permission to link
|
|
this library with independent modules to produce an executable,
|
|
regardless of the license terms of these independent modules, and to
|
|
copy and distribute the resulting executable under terms of your choice,
|
|
provided that you also meet, for each linked independent module, the
|
|
terms and conditions of the license of that module. An independent
|
|
module is a module which is not derived from or based on this library.
|
|
If you modify this library, you must extend this exception to your
|
|
version of the library.
|
|
|
|
libzmq is distributed in the hope that it will be useful, but WITHOUT
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
|
|
License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "precompiled.hpp"
|
|
#include "mailbox_safe.hpp"
|
|
#include "clock.hpp"
|
|
#include "err.hpp"
|
|
|
|
#include <algorithm>
|
|
|
|
zmq::mailbox_safe_t::mailbox_safe_t (mutex_t *sync_) : _sync (sync_)
|
|
{
|
|
// Get the pipe into passive state. That way, if the users starts by
|
|
// polling on the associated file descriptor it will get woken up when
|
|
// new command is posted.
|
|
const bool ok = _cpipe.check_read ();
|
|
zmq_assert (!ok);
|
|
}
|
|
|
|
zmq::mailbox_safe_t::~mailbox_safe_t ()
|
|
{
|
|
// TODO: Retrieve and deallocate commands inside the cpipe.
|
|
|
|
// Work around problem that other threads might still be in our
|
|
// send() method, by waiting on the mutex before disappearing.
|
|
_sync->lock ();
|
|
_sync->unlock ();
|
|
}
|
|
|
|
void zmq::mailbox_safe_t::add_signaler (signaler_t *signaler_)
|
|
{
|
|
_signalers.push_back (signaler_);
|
|
}
|
|
|
|
void zmq::mailbox_safe_t::remove_signaler (signaler_t *signaler_)
|
|
{
|
|
// TODO: make a copy of array and signal outside the lock
|
|
const std::vector<zmq::signaler_t *>::iterator end = _signalers.end ();
|
|
const std::vector<signaler_t *>::iterator it =
|
|
std::find (_signalers.begin (), end, signaler_);
|
|
|
|
if (it != end)
|
|
_signalers.erase (it);
|
|
}
|
|
|
|
void zmq::mailbox_safe_t::clear_signalers ()
|
|
{
|
|
_signalers.clear ();
|
|
}
|
|
|
|
void zmq::mailbox_safe_t::send (const command_t &cmd_)
|
|
{
|
|
_sync->lock ();
|
|
_cpipe.write (cmd_, false);
|
|
const bool ok = _cpipe.flush ();
|
|
|
|
if (!ok) {
|
|
_cond_var.broadcast ();
|
|
|
|
for (std::vector<signaler_t *>::iterator it = _signalers.begin (),
|
|
end = _signalers.end ();
|
|
it != end; ++it) {
|
|
(*it)->send ();
|
|
}
|
|
}
|
|
|
|
_sync->unlock ();
|
|
}
|
|
|
|
int zmq::mailbox_safe_t::recv (command_t *cmd_, int timeout_)
|
|
{
|
|
// Try to get the command straight away.
|
|
if (_cpipe.read (cmd_))
|
|
return 0;
|
|
|
|
// If the timeout is zero, it will be quicker to release the lock, giving other a chance to send a command
|
|
// and immediately relock it.
|
|
if (timeout_ == 0) {
|
|
_sync->unlock ();
|
|
_sync->lock ();
|
|
} else {
|
|
// Wait for signal from the command sender.
|
|
const int rc = _cond_var.wait (_sync, timeout_);
|
|
if (rc == -1) {
|
|
errno_assert (errno == EAGAIN || errno == EINTR);
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
// Another thread may already fetch the command
|
|
const bool ok = _cpipe.read (cmd_);
|
|
|
|
if (!ok) {
|
|
errno = EAGAIN;
|
|
return -1;
|
|
}
|
|
|
|
return 0;
|
|
}
|