WorkQueue.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411
  1. //
  2. // Copyright (c) 2008-2015 the Urho3D project.
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to deal
  6. // in the Software without restriction, including without limitation the rights
  7. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  8. // copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  19. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  20. // THE SOFTWARE.
  21. //
  22. #include "Precompiled.h"
  23. #include "../Core/CoreEvents.h"
  24. #include "../IO/Log.h"
  25. #include "../Core/ProcessUtils.h"
  26. #include "../Core/Profiler.h"
  27. #include "../Core/Thread.h"
  28. #include "../Core/Timer.h"
  29. #include "../Core/WorkQueue.h"
  30. namespace Atomic
  31. {
  32. /// Worker thread managed by the work queue.
  33. class WorkerThread : public Thread, public RefCounted
  34. {
  35. public:
  36. /// Construct.
  37. WorkerThread(WorkQueue* owner, unsigned index) :
  38. owner_(owner),
  39. index_(index)
  40. {
  41. }
  42. /// Process work items until stopped.
  43. virtual void ThreadFunction()
  44. {
  45. // Init FPU state first
  46. InitFPU();
  47. owner_->ProcessItems(index_);
  48. }
  49. /// Return thread index.
  50. unsigned GetIndex() const { return index_; }
  51. private:
  52. /// Work queue.
  53. WorkQueue* owner_;
  54. /// Thread index.
  55. unsigned index_;
  56. };
  57. WorkQueue::WorkQueue(Context* context) :
  58. Object(context),
  59. shutDown_(false),
  60. pausing_(false),
  61. paused_(false),
  62. tolerance_(10),
  63. lastSize_(0),
  64. maxNonThreadedWorkMs_(5)
  65. {
  66. SubscribeToEvent(E_BEGINFRAME, HANDLER(WorkQueue, HandleBeginFrame));
  67. }
  68. WorkQueue::~WorkQueue()
  69. {
  70. // Stop the worker threads. First make sure they are not waiting for work items
  71. shutDown_ = true;
  72. Resume();
  73. for (unsigned i = 0; i < threads_.Size(); ++i)
  74. threads_[i]->Stop();
  75. }
  76. void WorkQueue::CreateThreads(unsigned numThreads)
  77. {
  78. // Other subsystems may initialize themselves according to the number of threads.
  79. // Therefore allow creating the threads only once, after which the amount is fixed
  80. if (!threads_.Empty())
  81. return;
  82. // Start threads in paused mode
  83. Pause();
  84. for (unsigned i = 0; i < numThreads; ++i)
  85. {
  86. SharedPtr<WorkerThread> thread(new WorkerThread(this, i + 1));
  87. thread->Run();
  88. threads_.Push(thread);
  89. }
  90. }
  91. SharedPtr<WorkItem> WorkQueue::GetFreeItem()
  92. {
  93. if (poolItems_.Size() > 0)
  94. {
  95. SharedPtr<WorkItem> item = poolItems_.Front();
  96. poolItems_.PopFront();
  97. return item;
  98. }
  99. else
  100. {
  101. // No usable items found, create a new one set it as pooled and return it.
  102. SharedPtr<WorkItem> item(new WorkItem());
  103. item->pooled_ = true;
  104. return item;
  105. }
  106. }
  107. void WorkQueue::AddWorkItem(SharedPtr<WorkItem> item)
  108. {
  109. if (!item)
  110. {
  111. LOGERROR("Null work item submitted to the work queue");
  112. return;
  113. }
  114. // Check for duplicate items.
  115. assert(!workItems_.Contains(item));
  116. // Push to the main thread list to keep item alive
  117. // Clear completed flag in case item is reused
  118. workItems_.Push(item);
  119. item->completed_ = false;
  120. // Make sure worker threads' list is safe to modify
  121. if (threads_.Size() && !paused_)
  122. queueMutex_.Acquire();
  123. // Find position for new item
  124. if (queue_.Empty())
  125. queue_.Push(item);
  126. else
  127. {
  128. for (List<WorkItem*>::Iterator i = queue_.Begin(); i != queue_.End(); ++i)
  129. {
  130. if ((*i)->priority_ <= item->priority_)
  131. {
  132. queue_.Insert(i, item);
  133. break;
  134. }
  135. }
  136. }
  137. if (threads_.Size())
  138. {
  139. queueMutex_.Release();
  140. paused_ = false;
  141. }
  142. }
  143. bool WorkQueue::RemoveWorkItem(SharedPtr<WorkItem> item)
  144. {
  145. if (!item)
  146. return false;
  147. MutexLock lock(queueMutex_);
  148. // Can only remove successfully if the item was not yet taken by threads for execution
  149. List<WorkItem*>::Iterator i = queue_.Find(item.Get());
  150. if (i != queue_.End())
  151. {
  152. List<SharedPtr<WorkItem> >::Iterator j = workItems_.Find(item);
  153. if (j != workItems_.End())
  154. {
  155. queue_.Erase(i);
  156. ReturnToPool(item);
  157. workItems_.Erase(j);
  158. return true;
  159. }
  160. }
  161. return false;
  162. }
  163. unsigned WorkQueue::RemoveWorkItems(const Vector<SharedPtr<WorkItem> >& items)
  164. {
  165. MutexLock lock(queueMutex_);
  166. unsigned removed = 0;
  167. for (Vector<SharedPtr<WorkItem> >::ConstIterator i = items.Begin(); i != items.End(); ++i)
  168. {
  169. List<WorkItem*>::Iterator j = queue_.Find(i->Get());
  170. if (j != queue_.End())
  171. {
  172. List<SharedPtr<WorkItem> >::Iterator k = workItems_.Find(*i);
  173. if (k != workItems_.End())
  174. {
  175. queue_.Erase(j);
  176. ReturnToPool(*k);
  177. workItems_.Erase(k);
  178. ++removed;
  179. }
  180. }
  181. }
  182. return removed;
  183. }
  184. void WorkQueue::Pause()
  185. {
  186. if (!paused_)
  187. {
  188. pausing_ = true;
  189. queueMutex_.Acquire();
  190. paused_ = true;
  191. pausing_ = false;
  192. }
  193. }
  194. void WorkQueue::Resume()
  195. {
  196. if (paused_)
  197. {
  198. queueMutex_.Release();
  199. paused_ = false;
  200. }
  201. }
  202. void WorkQueue::Complete(unsigned priority)
  203. {
  204. if (threads_.Size())
  205. {
  206. Resume();
  207. // Take work items also in the main thread until queue empty or no high-priority items anymore
  208. while (!queue_.Empty())
  209. {
  210. queueMutex_.Acquire();
  211. if (!queue_.Empty() && queue_.Front()->priority_ >= priority)
  212. {
  213. WorkItem* item = queue_.Front();
  214. queue_.PopFront();
  215. queueMutex_.Release();
  216. item->workFunction_(item, 0);
  217. item->completed_ = true;
  218. }
  219. else
  220. {
  221. queueMutex_.Release();
  222. break;
  223. }
  224. }
  225. // Wait for threaded work to complete
  226. while (!IsCompleted(priority))
  227. {
  228. }
  229. // If no work at all remaining, pause worker threads by leaving the mutex locked
  230. if (queue_.Empty())
  231. Pause();
  232. }
  233. else
  234. {
  235. // No worker threads: ensure all high-priority items are completed in the main thread
  236. while (!queue_.Empty() && queue_.Front()->priority_ >= priority)
  237. {
  238. WorkItem* item = queue_.Front();
  239. queue_.PopFront();
  240. item->workFunction_(item, 0);
  241. item->completed_ = true;
  242. }
  243. }
  244. PurgeCompleted(priority);
  245. }
  246. bool WorkQueue::IsCompleted(unsigned priority) const
  247. {
  248. for (List<SharedPtr<WorkItem> >::ConstIterator i = workItems_.Begin(); i != workItems_.End(); ++i)
  249. {
  250. if ((*i)->priority_ >= priority && !(*i)->completed_)
  251. return false;
  252. }
  253. return true;
  254. }
  255. void WorkQueue::ProcessItems(unsigned threadIndex)
  256. {
  257. bool wasActive = false;
  258. for (;;)
  259. {
  260. if (shutDown_)
  261. return;
  262. if (pausing_ && !wasActive)
  263. Time::Sleep(0);
  264. else
  265. {
  266. queueMutex_.Acquire();
  267. if (!queue_.Empty())
  268. {
  269. wasActive = true;
  270. WorkItem* item = queue_.Front();
  271. queue_.PopFront();
  272. queueMutex_.Release();
  273. item->workFunction_(item, threadIndex);
  274. item->completed_ = true;
  275. }
  276. else
  277. {
  278. wasActive = false;
  279. queueMutex_.Release();
  280. Time::Sleep(0);
  281. }
  282. }
  283. }
  284. }
  285. void WorkQueue::PurgeCompleted(unsigned priority)
  286. {
  287. // Purge completed work items and send completion events. Do not signal items lower than priority threshold,
  288. // as those may be user submitted and lead to eg. scene manipulation that could happen in the middle of the
  289. // render update, which is not allowed
  290. for (List<SharedPtr<WorkItem> >::Iterator i = workItems_.Begin(); i != workItems_.End();)
  291. {
  292. if ((*i)->completed_ && (*i)->priority_ >= priority)
  293. {
  294. if ((*i)->sendEvent_)
  295. {
  296. using namespace WorkItemCompleted;
  297. VariantMap& eventData = GetEventDataMap();
  298. eventData[P_ITEM] = i->Get();
  299. SendEvent(E_WORKITEMCOMPLETED, eventData);
  300. }
  301. ReturnToPool(*i);
  302. i = workItems_.Erase(i);
  303. }
  304. else
  305. ++i;
  306. }
  307. }
  308. void WorkQueue::PurgePool()
  309. {
  310. unsigned currentSize = poolItems_.Size();
  311. int difference = lastSize_ - currentSize;
  312. // Difference tolerance, should be fairly significant to reduce the pool size.
  313. for (unsigned i = 0; poolItems_.Size() > 0 && difference > tolerance_ && i < (unsigned)difference; i++)
  314. poolItems_.PopFront();
  315. lastSize_ = currentSize;
  316. }
  317. void WorkQueue::ReturnToPool(SharedPtr<WorkItem>& item)
  318. {
  319. // Check if this was a pooled item and set it to usable
  320. if (item->pooled_)
  321. {
  322. // Reset the values to their defaults. This should
  323. // be safe to do here as the completed event has
  324. // already been handled and this is part of the
  325. // internal pool.
  326. item->start_ = 0;
  327. item->end_ = 0;
  328. item->aux_ = 0;
  329. item->workFunction_ = 0;
  330. item->priority_ = M_MAX_UNSIGNED;
  331. item->sendEvent_ = false;
  332. item->completed_ = false;
  333. poolItems_.Push(item);
  334. }
  335. }
  336. void WorkQueue::HandleBeginFrame(StringHash eventType, VariantMap& eventData)
  337. {
  338. // If no worker threads, complete low-priority work here
  339. if (threads_.Empty() && !queue_.Empty())
  340. {
  341. PROFILE(CompleteWorkNonthreaded);
  342. HiresTimer timer;
  343. while (!queue_.Empty() && timer.GetUSec(false) < maxNonThreadedWorkMs_ * 1000)
  344. {
  345. WorkItem* item = queue_.Front();
  346. queue_.PopFront();
  347. item->workFunction_(item, 0);
  348. item->completed_ = true;
  349. }
  350. }
  351. // Complete and signal items down to the lowest priority
  352. PurgeCompleted(0);
  353. PurgePool();
  354. }
  355. }