mirror of
https://github.com/zeromq/libzmq.git
synced 2025-03-10 07:56:09 +00:00
f0f16505e5
Copyrights had become ads for Sustrik's corporate sponsors, going against the original agreement to share copyrights with the community (that agreement was: one line stating iMatix copyright + one reference to AUTHORS file). The proliferation of corporate ads is also unfair to the many individual authors. I've removed ALL corporate title from the source files so the copyright statements can now be centralized in AUTHORS and source files can be properly updated on an annual basis.
100 lines
2.8 KiB
C++
100 lines
2.8 KiB
C++
/*
|
|
Copyright (c) 2007-2013 Contributors as noted in the AUTHORS file
|
|
|
|
This file is part of 0MQ.
|
|
|
|
0MQ is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
0MQ 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 "poller_base.hpp"
|
|
#include "i_poll_events.hpp"
|
|
#include "err.hpp"
|
|
|
|
zmq::poller_base_t::poller_base_t ()
|
|
{
|
|
}
|
|
|
|
zmq::poller_base_t::~poller_base_t ()
|
|
{
|
|
// Make sure there is no more load on the shutdown.
|
|
zmq_assert (get_load () == 0);
|
|
}
|
|
|
|
int zmq::poller_base_t::get_load ()
|
|
{
|
|
return load.get ();
|
|
}
|
|
|
|
void zmq::poller_base_t::adjust_load (int amount_)
|
|
{
|
|
if (amount_ > 0)
|
|
load.add (amount_);
|
|
else
|
|
if (amount_ < 0)
|
|
load.sub (-amount_);
|
|
}
|
|
|
|
void zmq::poller_base_t::add_timer (int timeout_, i_poll_events *sink_, int id_)
|
|
{
|
|
uint64_t expiration = clock.now_ms () + timeout_;
|
|
timer_info_t info = {sink_, id_};
|
|
timers.insert (timers_t::value_type (expiration, info));
|
|
}
|
|
|
|
void zmq::poller_base_t::cancel_timer (i_poll_events *sink_, int id_)
|
|
{
|
|
// Complexity of this operation is O(n). We assume it is rarely used.
|
|
for (timers_t::iterator it = timers.begin (); it != timers.end (); ++it)
|
|
if (it->second.sink == sink_ && it->second.id == id_) {
|
|
timers.erase (it);
|
|
return;
|
|
}
|
|
|
|
// Timer not found.
|
|
zmq_assert (false);
|
|
}
|
|
|
|
uint64_t zmq::poller_base_t::execute_timers ()
|
|
{
|
|
// Fast track.
|
|
if (timers.empty ())
|
|
return 0;
|
|
|
|
// Get the current time.
|
|
uint64_t current = clock.now_ms ();
|
|
|
|
// Execute the timers that are already due.
|
|
timers_t::iterator it = timers.begin ();
|
|
while (it != timers.end ()) {
|
|
|
|
// If we have to wait to execute the item, same will be true about
|
|
// all the following items (multimap is sorted). Thus we can stop
|
|
// checking the subsequent timers and return the time to wait for
|
|
// the next timer (at least 1ms).
|
|
if (it->first > current)
|
|
return it->first - current;
|
|
|
|
// Trigger the timer.
|
|
it->second.sink->timer_event (it->second.id);
|
|
|
|
// Remove it from the list of active timers.
|
|
timers_t::iterator o = it;
|
|
++it;
|
|
timers.erase (o);
|
|
}
|
|
|
|
// There are no more timers.
|
|
return 0;
|
|
}
|