[go: up one dir, main page]

File: WorkerPool.cc

package info (click to toggle)
ignition-common 1.1.1-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 1,856 kB
  • sloc: cpp: 22,616; python: 1,595; ansic: 484; sh: 125; makefile: 18
file content (197 lines) | stat: -rw-r--r-- 5,193 bytes parent folder | download
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
/*
 * Copyright (C) 2017 Open Source Robotics Foundation
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
*/


#include <queue>
#include <thread>
#include <utility>

#include "ignition/common/WorkerPool.hh"

namespace igncmn = ignition::common;
using namespace igncmn;

namespace ignition
{
  namespace common
  {
    /// \brief info needed to perform work
    struct WorkOrder
    {
      /// \brief method that does the work
      std::function<void()> work = std::function<void()>();

      /// \brief callback to invoke after working
      std::function<void()> callback = std::function<void()>();
    };

    /// \brief Private implementation
    class WorkerPoolPrivate
    {
      /// \brief Does work until signaled to shut down
      public: void Worker();

      /// \brief threads that do work
      public: std::vector<std::thread> workers;

      /// \brief queue of work for workers
      public: std::queue<WorkOrder> workOrders;

      /// \brief used to count how many threads are actively working
      public: int activeOrders = 0;

      /// \brief lock for workOrders access
      public: std::mutex queueMtx;

      /// \brief used to signal when all work is done
      public: std::condition_variable signalWorkDone;

      /// \brief used to signal when new work is available
      public: std::condition_variable signalNewWork;

      /// \brief used to signal when the pool is being shut down
      public: bool done = false;
    };
  }
}

//////////////////////////////////////////////////
void WorkerPoolPrivate::Worker()
{
  WorkOrder order;

  // Run until pool is destructed, waiting for work
  while (true)
  {
    // Scoped to release lock before doing work
    {
      std::unique_lock<std::mutex> queueLock(this->queueMtx);

      // Wait for a work order
      while (!this->done && this->workOrders.empty())
      {
        this->signalNewWork.wait(queueLock);
      }
      // Destructor may have signaled to shutdown workers
      if (this->done)
        break;

      // Take a work order from the queue
      ++(this->activeOrders);
      order = std::move(workOrders.front());
      workOrders.pop();
    }

    // Do the work
    if (order.work)
      order.work();

    if (order.callback)
      order.callback();

    {
      std::unique_lock<std::mutex> queueLock(this->queueMtx);
      --(this->activeOrders);
    }
    this->signalWorkDone.notify_all();
  }
}

//////////////////////////////////////////////////
WorkerPool::WorkerPool() : dataPtr(new WorkerPoolPrivate)
{
  unsigned int numWorkers = std::max(std::thread::hardware_concurrency(), 1u);

  // create worker threads
  for (unsigned int w = 0; w < numWorkers; ++w)
  {
    this->dataPtr->workers.push_back(
        std::thread(&WorkerPoolPrivate::Worker, this->dataPtr.get()));
  }
}

//////////////////////////////////////////////////
WorkerPool::~WorkerPool()
{
  // shutdown worker threads
  {
    std::unique_lock<std::mutex> queueLock(this->dataPtr->queueMtx);
    this->dataPtr->done = true;
  }
  this->dataPtr->signalNewWork.notify_all();

  for (auto &t : this->dataPtr->workers)
  {
    t.join();
  }

  // Signal in case anyone is still waiting for work to finish
  this->dataPtr->signalWorkDone.notify_all();
}

//////////////////////////////////////////////////
void WorkerPool::AddWork(std::function<void()> _work,
    std::function<void()> _cb)
{
  WorkOrder order;
  order.work = _work;
  order.callback = _cb;
  {
    std::unique_lock<std::mutex> queueLock(this->dataPtr->queueMtx);
    this->dataPtr->workOrders.push(std::move(order));
  }
  this->dataPtr->signalNewWork.notify_one();
}

//////////////////////////////////////////////////
bool WorkerPool::WaitForResults(const Time &_timeout)
{
  bool signaled = true;
  std::unique_lock<std::mutex> queueLock(this->dataPtr->queueMtx);

  // Lambda to keep logic in one place for both cases
  const auto &done = this->dataPtr->done;
  const auto &workOrders = this->dataPtr->workOrders;
  const auto &activeOrders = this->dataPtr->activeOrders;
  std::function<bool()> haveResults =
    [&done, &workOrders, &activeOrders] () -> bool
      {
        return done || (workOrders.empty() && !activeOrders);
      };

  if (Time::Zero == _timeout)
  {
    // Loop for spurious wakeups
    while (!haveResults())
    {
      if (Time::Zero == _timeout)
      {
        // Wait forever
        this->dataPtr->signalWorkDone.wait(queueLock);
      }
    }
  }
  else
  {
    // Wait for timeout
    signaled = this->dataPtr->signalWorkDone.wait_for(queueLock,
        std::chrono::seconds(_timeout.sec) +
        std::chrono::nanoseconds(_timeout.nsec),
        haveResults);
  }
  return signaled && !done;
}