1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440
|
/*
* Copyright (C) 2005-2018 Team Kodi
* This file is part of Kodi - https://kodi.tv
*
* SPDX-License-Identifier: GPL-2.0-or-later
* See LICENSES/README.md for more information.
*/
#include "JobManager.h"
#include "ServiceBroker.h"
#include "utils/XTimeUtils.h"
#include "utils/log.h"
#include <algorithm>
#include <functional>
#include <mutex>
#include <stdexcept>
using namespace std::chrono_literals;
bool CJob::ShouldCancel(unsigned int progress, unsigned int total) const
{
if (m_callback)
return m_callback->OnJobProgress(progress, total, this);
return false;
}
CJobWorker::CJobWorker(CJobManager *manager) : CThread("JobWorker")
{
m_jobManager = manager;
Create(true); // start work immediately, and kill ourselves when we're done
}
CJobWorker::~CJobWorker()
{
m_jobManager->RemoveWorker(this);
if(!IsAutoDelete())
StopThread();
}
void CJobWorker::Process()
{
SetPriority(ThreadPriority::LOWEST);
while (true)
{
// request an item from our manager (this call is blocking)
CJob* job = m_jobManager->GetNextJob();
if (!job)
break;
bool success = false;
try
{
success = job->DoWork();
}
catch (...)
{
CLog::Log(LOGERROR, "{} error processing job {}", __FUNCTION__, job->GetType());
}
m_jobManager->OnJobComplete(success, job);
}
}
void CJobQueue::CJobPointer::CancelJob()
{
CServiceBroker::GetJobManager()->CancelJob(m_id);
m_id = 0;
}
CJobQueue::CJobQueue(bool lifo, unsigned int jobsAtOnce, CJob::PRIORITY priority)
: m_jobsAtOnce(jobsAtOnce), m_priority(priority), m_lifo(lifo)
{
}
CJobQueue::~CJobQueue()
{
CancelJobs();
}
void CJobQueue::OnJobComplete(unsigned int jobID, bool success, CJob *job)
{
OnJobNotify(job);
}
void CJobQueue::OnJobAbort(unsigned int jobID, CJob* job)
{
OnJobNotify(job);
}
void CJobQueue::CancelJob(const CJob *job)
{
std::unique_lock<CCriticalSection> lock(m_section);
Processing::iterator i = find(m_processing.begin(), m_processing.end(), job);
if (i != m_processing.end())
{
i->CancelJob();
m_processing.erase(i);
return;
}
Queue::iterator j = find(m_jobQueue.begin(), m_jobQueue.end(), job);
if (j != m_jobQueue.end())
{
j->FreeJob();
m_jobQueue.erase(j);
}
}
bool CJobQueue::AddJob(CJob *job)
{
std::unique_lock<CCriticalSection> lock(m_section);
// check if we have this job already. If so, we're done.
if (find(m_jobQueue.begin(), m_jobQueue.end(), job) != m_jobQueue.end() ||
find(m_processing.begin(), m_processing.end(), job) != m_processing.end())
{
delete job;
return false;
}
if (m_lifo)
m_jobQueue.emplace_back(job);
else
m_jobQueue.emplace_front(job);
QueueNextJob();
return true;
}
void CJobQueue::OnJobNotify(CJob* job)
{
std::unique_lock<CCriticalSection> lock(m_section);
// check if this job is in our processing list
const auto it = std::find(m_processing.begin(), m_processing.end(), job);
if (it != m_processing.end())
m_processing.erase(it);
// request a new job be queued
QueueNextJob();
}
void CJobQueue::QueueNextJob()
{
std::unique_lock<CCriticalSection> lock(m_section);
while (m_jobQueue.size() && m_processing.size() < m_jobsAtOnce)
{
CJobPointer &job = m_jobQueue.back();
job.m_id = CServiceBroker::GetJobManager()->AddJob(job.m_job, this, m_priority);
if (job.m_id > 0)
{
m_processing.emplace_back(job);
m_jobQueue.pop_back();
return;
}
m_jobQueue.pop_back();
}
}
void CJobQueue::CancelJobs()
{
std::unique_lock<CCriticalSection> lock(m_section);
for_each(m_processing.begin(), m_processing.end(), [](CJobPointer& jp) { jp.CancelJob(); });
for_each(m_jobQueue.begin(), m_jobQueue.end(), [](CJobPointer& jp) { jp.FreeJob(); });
m_jobQueue.clear();
m_processing.clear();
}
bool CJobQueue::IsProcessing() const
{
return CServiceBroker::GetJobManager()->m_running &&
(!m_processing.empty() || !m_jobQueue.empty());
}
bool CJobQueue::QueueEmpty() const
{
std::unique_lock<CCriticalSection> lock(m_section);
return m_jobQueue.empty();
}
CJobManager::CJobManager()
{
m_jobCounter = 0;
m_running = true;
m_pauseJobs = false;
}
void CJobManager::Restart()
{
std::unique_lock<CCriticalSection> lock(m_section);
if (m_running)
throw std::logic_error("CJobManager already running");
m_running = true;
}
void CJobManager::CancelJobs()
{
std::unique_lock<CCriticalSection> lock(m_section);
m_running = false;
// clear any pending jobs
for (unsigned int priority = CJob::PRIORITY_LOW_PAUSABLE; priority <= CJob::PRIORITY_DEDICATED; ++priority)
{
std::for_each(m_jobQueue[priority].begin(), m_jobQueue[priority].end(), [](CWorkItem& wi) {
if (wi.m_callback)
wi.m_callback->OnJobAbort(wi.m_id, wi.m_job);
wi.FreeJob();
});
m_jobQueue[priority].clear();
}
// cancel any callbacks on jobs still processing
std::for_each(m_processing.begin(), m_processing.end(), [](CWorkItem& wi) {
if (wi.m_callback)
wi.m_callback->OnJobAbort(wi.m_id, wi.m_job);
wi.Cancel();
});
// tell our workers to finish
while (m_workers.size())
{
lock.unlock();
m_jobEvent.Set();
std::this_thread::yield(); // yield after setting the event to give the workers some time to die
lock.lock();
}
}
unsigned int CJobManager::AddJob(CJob *job, IJobCallback *callback, CJob::PRIORITY priority)
{
std::unique_lock<CCriticalSection> lock(m_section);
if (!m_running)
{
delete job;
return 0;
}
// increment the job counter, ensuring 0 (invalid job) is never hit
m_jobCounter++;
if (m_jobCounter == 0)
m_jobCounter++;
// create a work item for this job
CWorkItem work(job, m_jobCounter, priority, callback);
m_jobQueue[priority].push_back(work);
StartWorkers(priority);
return work.m_id;
}
void CJobManager::CancelJob(unsigned int jobID)
{
std::unique_lock<CCriticalSection> lock(m_section);
// check whether we have this job in the queue
for (unsigned int priority = CJob::PRIORITY_LOW_PAUSABLE; priority <= CJob::PRIORITY_DEDICATED; ++priority)
{
JobQueue::iterator i = find(m_jobQueue[priority].begin(), m_jobQueue[priority].end(), jobID);
if (i != m_jobQueue[priority].end())
{
delete i->m_job;
m_jobQueue[priority].erase(i);
return;
}
}
// or if we're processing it
Processing::iterator it = find(m_processing.begin(), m_processing.end(), jobID);
if (it != m_processing.end())
it->m_callback = NULL; // job is in progress, so only thing to do is to remove callback
}
void CJobManager::StartWorkers(CJob::PRIORITY priority)
{
std::unique_lock<CCriticalSection> lock(m_section);
// check how many free threads we have
if (m_processing.size() >= GetMaxWorkers(priority))
return;
// do we have any sleeping threads?
if (m_processing.size() < m_workers.size())
{
m_jobEvent.Set();
return;
}
// everyone is busy - we need more workers
m_workers.push_back(new CJobWorker(this));
}
CJob *CJobManager::PopJob()
{
std::unique_lock<CCriticalSection> lock(m_section);
for (int priority = CJob::PRIORITY_DEDICATED; priority >= CJob::PRIORITY_LOW_PAUSABLE; --priority)
{
// Check whether we're pausing pausable jobs
if (priority == CJob::PRIORITY_LOW_PAUSABLE && m_pauseJobs)
continue;
if (m_jobQueue[priority].size() && m_processing.size() < GetMaxWorkers(CJob::PRIORITY(priority)))
{
// pop the job off the queue
CWorkItem job = m_jobQueue[priority].front();
m_jobQueue[priority].pop_front();
// add to the processing vector
m_processing.push_back(job);
job.m_job->m_callback = this;
return job.m_job;
}
}
return NULL;
}
void CJobManager::PauseJobs()
{
std::unique_lock<CCriticalSection> lock(m_section);
m_pauseJobs = true;
}
void CJobManager::UnPauseJobs()
{
std::unique_lock<CCriticalSection> lock(m_section);
m_pauseJobs = false;
}
bool CJobManager::IsProcessing(const CJob::PRIORITY &priority) const
{
std::unique_lock<CCriticalSection> lock(m_section);
if (m_pauseJobs)
return false;
for(Processing::const_iterator it = m_processing.begin(); it < m_processing.end(); ++it)
{
if (priority == it->m_priority)
return true;
}
return false;
}
int CJobManager::IsProcessing(const std::string &type) const
{
int jobsMatched = 0;
std::unique_lock<CCriticalSection> lock(m_section);
if (m_pauseJobs)
return 0;
for(Processing::const_iterator it = m_processing.begin(); it < m_processing.end(); ++it)
{
if (type == std::string(it->m_job->GetType()))
jobsMatched++;
}
return jobsMatched;
}
CJob* CJobManager::GetNextJob()
{
std::unique_lock<CCriticalSection> lock(m_section);
while (m_running)
{
// grab a job off the queue if we have one
CJob *job = PopJob();
if (job)
return job;
// no jobs are left - sleep for 30 seconds to allow new jobs to come in
lock.unlock();
bool newJob = m_jobEvent.Wait(30000ms);
lock.lock();
if (!newJob)
break;
}
// ensure no jobs have come in during the period after
// timeout and before we held the lock
return PopJob();
}
bool CJobManager::OnJobProgress(unsigned int progress, unsigned int total, const CJob *job) const
{
std::unique_lock<CCriticalSection> lock(m_section);
// find the job in the processing queue, and check whether it's cancelled (no callback)
Processing::const_iterator i = find(m_processing.begin(), m_processing.end(), job);
if (i != m_processing.end())
{
CWorkItem item(*i);
lock.unlock(); // leave section prior to call
if (item.m_callback)
{
item.m_callback->OnJobProgress(item.m_id, progress, total, job);
return false;
}
}
return true; // couldn't find the job, or it's been cancelled
}
void CJobManager::OnJobComplete(bool success, CJob *job)
{
std::unique_lock<CCriticalSection> lock(m_section);
// remove the job from the processing queue
Processing::iterator i = find(m_processing.begin(), m_processing.end(), job);
if (i != m_processing.end())
{
// tell any listeners we're done with the job, then delete it
CWorkItem item(*i);
lock.unlock();
try
{
if (item.m_callback)
item.m_callback->OnJobComplete(item.m_id, success, item.m_job);
}
catch (...)
{
CLog::Log(LOGERROR, "{} error processing job {}", __FUNCTION__, item.m_job->GetType());
}
lock.lock();
Processing::iterator j = find(m_processing.begin(), m_processing.end(), job);
if (j != m_processing.end())
m_processing.erase(j);
lock.unlock();
item.FreeJob();
}
}
void CJobManager::RemoveWorker(const CJobWorker *worker)
{
std::unique_lock<CCriticalSection> lock(m_section);
// remove our worker
Workers::iterator i = find(m_workers.begin(), m_workers.end(), worker);
if (i != m_workers.end())
m_workers.erase(i); // workers auto-delete
}
unsigned int CJobManager::GetMaxWorkers(CJob::PRIORITY priority)
{
static const unsigned int max_workers = 5;
if (priority == CJob::PRIORITY_DEDICATED)
return 10000; // A large number..
return max_workers - (CJob::PRIORITY_HIGH - priority);
}
|