icinga2/lib/base/workqueue.cpp

200 lines
5.0 KiB
C++
Raw Normal View History

2013-09-18 09:09:16 +02:00
/******************************************************************************
* Icinga 2 *
* Copyright (C) 2012-2014 Icinga Development Team (http://www.icinga.org) *
2013-09-18 09:09:16 +02:00
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License *
* as published by the Free Software Foundation; either version 2 *
* of the License, or (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the Free Software Foundation *
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. *
******************************************************************************/
2014-05-25 16:23:35 +02:00
#include "base/workqueue.hpp"
#include "base/utility.hpp"
#include "base/logger_fwd.hpp"
#include "base/convert.hpp"
2013-09-18 09:09:16 +02:00
#include <boost/bind.hpp>
#include <boost/foreach.hpp>
2013-09-18 09:09:16 +02:00
using namespace icinga;
2013-10-17 10:19:17 +02:00
int WorkQueue::m_NextID = 1;
WorkQueue::WorkQueue(size_t maxItems)
: m_ID(m_NextID++), m_MaxItems(maxItems), m_Stopped(false),
m_Processing(false), m_ExceptionCallback(WorkQueue::DefaultExceptionCallback)
2013-10-17 10:19:17 +02:00
{
m_StatusTimer = make_shared<Timer>();
m_StatusTimer->SetInterval(10);
m_StatusTimer->OnTimerExpired.connect(boost::bind(&WorkQueue::StatusTimerHandler, this));
m_StatusTimer->Start();
2013-10-17 10:19:17 +02:00
}
2013-09-21 17:53:14 +02:00
2013-09-18 09:09:16 +02:00
WorkQueue::~WorkQueue(void)
{
Join(true);
2013-09-18 09:09:16 +02:00
}
/**
* Enqueues a work item. Work items are guaranteed to be executed in the order
* they were enqueued in except when allowInterleaved is true in which case
* the new work item might be run immediately if it's being enqueued from
* within the WorkQueue thread.
2013-09-18 09:09:16 +02:00
*/
void WorkQueue::Enqueue(const WorkCallback& callback, bool allowInterleaved)
2013-09-18 09:09:16 +02:00
{
bool wq_thread = (boost::this_thread::get_id() == GetThreadId());
if (wq_thread && allowInterleaved) {
callback();
return;
}
WorkItem item;
item.Callback = callback;
item.AllowInterleaved = allowInterleaved;
2013-09-18 09:09:16 +02:00
boost::mutex::scoped_lock lock(m_Mutex);
2013-09-21 17:53:14 +02:00
if (m_Thread.get_id() == boost::thread::id())
m_Thread = boost::thread(boost::bind(&WorkQueue::WorkerThreadProc, this));
2013-11-22 10:32:53 +01:00
if (!wq_thread) {
while (m_Items.size() >= m_MaxItems)
m_CVFull.wait(lock);
}
2013-10-17 10:19:17 +02:00
2013-09-18 09:09:16 +02:00
m_Items.push_back(item);
2013-11-22 10:32:53 +01:00
if (m_Items.size() == 1)
m_CVEmpty.notify_all();
2013-09-18 09:09:16 +02:00
}
void WorkQueue::Join(bool stop)
2013-09-18 09:09:16 +02:00
{
boost::mutex::scoped_lock lock(m_Mutex);
2013-10-17 15:49:53 +02:00
while (m_Processing || !m_Items.empty())
m_CVStarved.wait(lock);
if (stop) {
m_Stopped = true;
m_CVEmpty.notify_all();
lock.unlock();
if (m_Thread.joinable())
m_Thread.join();
}
2013-09-18 09:09:16 +02:00
}
boost::thread::id WorkQueue::GetThreadId(void) const
{
return m_Thread.get_id();
}
void WorkQueue::SetExceptionCallback(const ExceptionCallback& callback)
{
boost::mutex::scoped_lock lock(m_Mutex);
m_ExceptionCallback = callback;
}
size_t WorkQueue::GetLength(void)
{
boost::mutex::scoped_lock lock(m_Mutex);
return m_Items.size();
}
void WorkQueue::DefaultExceptionCallback(boost::exception_ptr)
{
throw;
}
void WorkQueue::StatusTimerHandler(void)
{
boost::mutex::scoped_lock lock(m_Mutex);
Log(LogNotice, "WorkQueue", "#" + Convert::ToString(m_ID) + " items: " + Convert::ToString(m_Items.size()));
}
void WorkQueue::WorkerThreadProc(void)
2013-09-18 09:09:16 +02:00
{
std::ostringstream idbuf;
idbuf << "WQ #" << m_ID;
Utility::SetThreadName(idbuf.str());
2013-09-18 09:09:16 +02:00
boost::mutex::scoped_lock lock(m_Mutex);
for (;;) {
while (m_Items.empty() && !m_Stopped)
m_CVEmpty.wait(lock);
if (m_Stopped)
break;
std::deque<WorkItem> items;
m_Items.swap(items);
2013-10-17 10:19:17 +02:00
if (items.size() >= m_MaxItems)
m_CVFull.notify_all();
2013-10-17 10:19:17 +02:00
m_Processing = true;
lock.unlock();
BOOST_FOREACH(WorkItem& wi, items) {
try {
wi.Callback();
}
catch (const std::exception&) {
lock.lock();
ExceptionCallback callback = m_ExceptionCallback;
2013-11-22 10:32:53 +01:00
lock.unlock();
2013-11-22 10:32:53 +01:00
callback(boost::current_exception());
}
}
2013-11-22 10:32:53 +01:00
lock.lock();
2013-11-22 10:32:53 +01:00
m_Processing = false;
2013-11-22 10:32:53 +01:00
m_CVStarved.notify_all();
2013-11-22 10:32:53 +01:00
}
}
ParallelWorkQueue::ParallelWorkQueue(void)
: m_QueueCount(boost::thread::hardware_concurrency()),
m_Queues(new WorkQueue[m_QueueCount]),
m_Index(0)
{ }
ParallelWorkQueue::~ParallelWorkQueue(void)
{
delete[] m_Queues;
}
void ParallelWorkQueue::Enqueue(const boost::function<void(void)>& callback)
{
m_Index++;
m_Queues[m_Index % m_QueueCount].Enqueue(callback);
}
void ParallelWorkQueue::Join(void)
{
for (unsigned int i = 0; i < m_QueueCount; i++)
m_Queues[i].Join();
2013-09-18 09:09:16 +02:00
}