2013-04-09 04:38:11 +02:00
|
|
|
/*
|
|
|
|
|
2016-01-18 00:57:46 +01:00
|
|
|
Copyright (c) 2003-2016, Arvid Norberg, Daniel Wallin
|
2013-04-09 04:38:11 +02:00
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
|
|
|
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer in
|
|
|
|
the documentation and/or other materials provided with the distribution.
|
|
|
|
* Neither the name of the author nor the names of its
|
|
|
|
contributors may be used to endorse or promote products derived
|
|
|
|
from this software without specific prior written permission.
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "libtorrent/config.hpp"
|
|
|
|
#include "libtorrent/alert_manager.hpp"
|
|
|
|
#include "libtorrent/alert_types.hpp"
|
|
|
|
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
#include "libtorrent/extensions.hpp"
|
|
|
|
#endif
|
|
|
|
|
2017-04-12 19:00:57 +02:00
|
|
|
namespace libtorrent {
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2017-07-26 06:33:10 +02:00
|
|
|
alert_manager::alert_manager(int const queue_limit, alert_category_t const alert_mask)
|
2013-04-09 04:38:11 +02:00
|
|
|
: m_alert_mask(alert_mask)
|
|
|
|
, m_queue_size_limit(queue_limit)
|
|
|
|
{}
|
|
|
|
|
2016-07-10 13:34:45 +02:00
|
|
|
alert_manager::~alert_manager() = default;
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2016-09-14 04:45:39 +02:00
|
|
|
bool alert_manager::should_post_impl(int const priority) const
|
|
|
|
{
|
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
|
|
|
return m_alerts[m_generation].size()
|
|
|
|
< m_queue_size_limit * (1 + priority);
|
|
|
|
}
|
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
alert* alert_manager::wait_for_alert(time_duration max_wait)
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
if (!m_alerts[m_generation].empty())
|
|
|
|
return m_alerts[m_generation].front();
|
2015-05-18 01:32:13 +02:00
|
|
|
|
2013-04-09 04:38:11 +02:00
|
|
|
// this call can be interrupted prematurely by other signals
|
|
|
|
m_condition.wait_for(lock, max_wait);
|
2015-04-03 22:15:48 +02:00
|
|
|
if (!m_alerts[m_generation].empty())
|
|
|
|
return m_alerts[m_generation].front();
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2016-06-20 17:32:06 +02:00
|
|
|
return nullptr;
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
|
|
|
|
2016-05-01 00:54:23 +02:00
|
|
|
void alert_manager::maybe_notify(alert* a, std::unique_lock<std::mutex>& lock)
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
2015-04-03 22:15:48 +02:00
|
|
|
if (m_alerts[m_generation].size() == 1)
|
|
|
|
{
|
|
|
|
lock.unlock();
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
// we just posted to an empty queue. If anyone is waiting for
|
|
|
|
// alerts, we need to notify them. Also (potentially) call the
|
|
|
|
// user supplied m_notify callback to let the client wake up its
|
|
|
|
// message loop to poll for alerts.
|
|
|
|
if (m_notify) m_notify();
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
// TODO: 2 keep a count of the number of threads waiting. Only if it's
|
|
|
|
// > 0 notify them
|
|
|
|
m_condition.notify_all();
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
2015-05-13 03:39:21 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
lock.unlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
2016-05-08 00:46:42 +02:00
|
|
|
for (auto& e : m_ses_extensions)
|
|
|
|
e->on_alert(a);
|
2015-12-06 18:45:20 +01:00
|
|
|
#else
|
|
|
|
TORRENT_UNUSED(a);
|
2015-05-13 03:39:21 +02:00
|
|
|
#endif
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
|
|
|
|
2016-08-13 03:31:55 +02:00
|
|
|
void alert_manager::set_notify_function(std::function<void()> const& fun)
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
std::unique_lock<std::mutex> lock(m_mutex);
|
2015-04-03 22:15:48 +02:00
|
|
|
m_notify = fun;
|
|
|
|
if (!m_alerts[m_generation].empty())
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
2015-04-03 22:15:48 +02:00
|
|
|
// never call a callback with the lock held!
|
|
|
|
lock.unlock();
|
2015-07-31 03:34:55 +02:00
|
|
|
if (m_notify) m_notify();
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
2016-08-17 20:30:24 +02:00
|
|
|
void alert_manager::add_extension(std::shared_ptr<plugin> ext)
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
|
|
|
m_ses_extensions.push_back(ext);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-12-06 18:45:20 +01:00
|
|
|
void alert_manager::get_all(std::vector<alert*>& alerts)
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
2013-04-09 04:38:11 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
alerts.clear();
|
|
|
|
if (m_alerts[m_generation].empty()) return;
|
2014-07-21 05:03:59 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
m_alerts[m_generation].get_pointers(alerts);
|
|
|
|
|
|
|
|
// swap buffers
|
|
|
|
m_generation = (m_generation + 1) & 1;
|
|
|
|
// clear the one we will start writing to now
|
|
|
|
m_alerts[m_generation].clear();
|
|
|
|
m_allocations[m_generation].reset();
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool alert_manager::pending() const
|
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
2015-04-03 22:15:48 +02:00
|
|
|
return !m_alerts[m_generation].empty();
|
2013-04-09 04:38:11 +02:00
|
|
|
}
|
|
|
|
|
2015-04-04 21:11:14 +02:00
|
|
|
int alert_manager::set_alert_queue_size_limit(int queue_size_limit_)
|
2013-04-09 04:38:11 +02:00
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
std::lock_guard<std::mutex> lock(m_mutex);
|
2013-04-09 04:38:11 +02:00
|
|
|
|
|
|
|
std::swap(m_queue_size_limit, queue_size_limit_);
|
|
|
|
return queue_size_limit_;
|
|
|
|
}
|
|
|
|
}
|