mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-26 13:23:25 +03:00
789a2e2bc3
Mostly signed/unsigned comparisons and reordered member initializations; also a few unused variables. There are more, but if I chip away at them for a while, who knows, it may catch on and warnings may eventually become socially stigmatizing. :)
108 lines
2.8 KiB
C++
108 lines
2.8 KiB
C++
// $Id: ThreadPool.cpp 3045 2010-04-05 13:07:29Z hieuhoang1972 $
|
|
|
|
/***********************************************************************
|
|
Moses - factored phrase-based language decoder
|
|
Copyright (C) 2009 University of Edinburgh
|
|
|
|
This library 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 2.1 of the License, or (at your option) any later version.
|
|
|
|
This library 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 library; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
***********************************************************************/
|
|
|
|
|
|
#include "ThreadPool.h"
|
|
|
|
#ifdef WITH_THREADS
|
|
|
|
using namespace std;
|
|
using namespace Moses;
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
ThreadPool::ThreadPool( size_t numThreads )
|
|
: m_stopped(false), m_stopping(false), m_queueLimit(0)
|
|
{
|
|
for (size_t i = 0; i < numThreads; ++i) {
|
|
m_threads.create_thread(boost::bind(&ThreadPool::Execute,this));
|
|
}
|
|
}
|
|
|
|
void ThreadPool::Execute()
|
|
{
|
|
do {
|
|
boost::shared_ptr<Task> task;
|
|
{
|
|
// Find a job to perform
|
|
boost::mutex::scoped_lock lock(m_mutex);
|
|
if (m_tasks.empty() && !m_stopped) {
|
|
m_threadNeeded.wait(lock);
|
|
}
|
|
if (!m_stopped && !m_tasks.empty()) {
|
|
task = m_tasks.front();
|
|
m_tasks.pop();
|
|
}
|
|
}
|
|
//Execute job
|
|
if (task) {
|
|
// must read from task before run. otherwise task may be deleted by main thread
|
|
// race condition
|
|
task->DeleteAfterExecution();
|
|
task->Run();
|
|
}
|
|
m_threadAvailable.notify_all();
|
|
} while (!m_stopped);
|
|
}
|
|
|
|
void ThreadPool::Submit(boost::shared_ptr<Task> task)
|
|
{
|
|
boost::mutex::scoped_lock lock(m_mutex);
|
|
if (m_stopping) {
|
|
throw runtime_error("ThreadPool stopping - unable to accept new jobs");
|
|
}
|
|
while (m_queueLimit > 0 && m_tasks.size() >= m_queueLimit) {
|
|
m_threadAvailable.wait(lock);
|
|
}
|
|
m_tasks.push(task);
|
|
m_threadNeeded.notify_all();
|
|
}
|
|
|
|
void ThreadPool::Stop(bool processRemainingJobs)
|
|
{
|
|
{
|
|
//prevent more jobs from being added to the queue
|
|
boost::mutex::scoped_lock lock(m_mutex);
|
|
if (m_stopped) return;
|
|
m_stopping = true;
|
|
}
|
|
if (processRemainingJobs) {
|
|
boost::mutex::scoped_lock lock(m_mutex);
|
|
//wait for queue to drain.
|
|
while (!m_tasks.empty() && !m_stopped) {
|
|
m_threadAvailable.wait(lock);
|
|
}
|
|
}
|
|
//tell all threads to stop
|
|
{
|
|
boost::mutex::scoped_lock lock(m_mutex);
|
|
m_stopped = true;
|
|
}
|
|
m_threadNeeded.notify_all();
|
|
|
|
m_threads.join_all();
|
|
}
|
|
|
|
}
|
|
#endif //WITH_THREADS
|
|
|