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
|
/*
//
// Copyright 1997-2009 Torsten Rohlfing
//
// Copyright 2004-2011 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit 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 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit 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 the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#include "cmtkThreadPoolGCD.h"
#include <System/cmtkThreads.h>
#include <System/cmtkConsole.h>
namespace
cmtk
{
ThreadPoolGCD::ThreadPoolGCD( const size_t nThreads )
{
if ( ! nThreads )
this->m_NumberOfThreads = cmtk::Threads::GetNumberOfThreads();
else
this->m_NumberOfThreads = nThreads;
this->m_Queues.resize( this->m_NumberOfThreads );
for ( size_t i = 0; i < this->m_NumberOfThreads; ++i )
{
this->m_Queues[i] = dispatch_queue_create( "ThreadPoolGCD", 0 );
}
}
ThreadPoolGCD::~ThreadPoolGCD()
{
for ( size_t i = 0; i < this->m_NumberOfThreads; ++i )
{
dispatch_release( this->m_Queues[i] );
}
}
void
ThreadPoolGCD::Dispatch( Self::TaskFunction taskFunction, std::vector<void*>& taskParameters, const size_t numberOfTasksOverride )
{
const size_t numberOfTasks = numberOfTasksOverride ? numberOfTasksOverride : taskParameters.size();
if ( ! numberOfTasks )
{
StdErr << "ERROR: trying to run zero tasks on thread pool. Did you forget to resize the parameter vector?\n";
exit( 1 );
}
const std::vector<void*>& vParams = taskParameters;
const size_t nQueues = this->m_Queues.size();
for ( size_t taskIdx = 0; taskIdx < numberOfTasks; )
{
for ( size_t queueIdx = 0; queueIdx < nQueues; ++queueIdx, ++taskIdx )
{
if ( taskIdx < numberOfTasks )
{
dispatch_async( this->m_Queues[queueIdx],
^{
taskFunction( (void*)( vParams[taskIdx] ), taskIdx, numberOfTasks, queueIdx, nQueues );
} );
}
}
}
// wait for all queues to finish
for ( size_t queueIdx = 0; queueIdx < nQueues; ++queueIdx )
{
dispatch_sync( this->m_Queues[queueIdx], ^{} );
}
}
ThreadPoolGCD&
ThreadPoolGCD::GetGlobalThreadPool()
{
static ThreadPoolGCD globalThreadPoolGCD;
return globalThreadPoolGCD;
}
}
|
