git.sesse.net Git - casparcg/blob - common/executor.h

   1 /*\r
   2 * Copyright (c) 2011 Sveriges Television AB <info@casparcg.com>\r
   3 *\r
   4 * This file is part of CasparCG (www.casparcg.com).\r
   5 *\r
   6 * CasparCG is free software: you can redistribute it and/or modify\r
   7 * it under the terms of the GNU General Public License as published by\r
   8 * the Free Software Foundation, either version 3 of the License, or\r
   9 * (at your option) any later version.\r
  10 *\r
  11 * CasparCG is distributed in the hope that it will be useful,\r
  12 * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
  13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r
  14 * GNU General Public License for more details.\r
  15 *\r
  16 * You should have received a copy of the GNU General Public License\r
  17 * along with CasparCG. If not, see <http://www.gnu.org/licenses/>.\r
  18 *\r
  19 * Author: Robert Nagy, ronag89@gmail.com\r
  20 */\r
  21 \r
  22 #pragma once\r
  23 \r
  24 #include "except.h"\r
  25 #include "enum_class.h"\r
  26 #include "log.h"\r
  27 \r
  28 #include <tbb/atomic.h>\r
  29 #include <tbb/concurrent_priority_queue.h>\r
  30 #include <tbb/concurrent_queue.h>\r
  31 \r
  32 #include <boost/thread.hpp>\r
  33 \r
  34 #include <functional>\r
  35 \r
  36 namespace caspar {\r
  37                 \r
  38 struct task_priority_def\r
  39 {\r
  40         enum type\r
  41         {\r
  42                 lowest_priority = 0,\r
  43                 lower_priority,\r
  44                 low_priority,\r
  45                 normal_priority,\r
  46                 high_priority,\r
  47                 higher_priority\r
  48         };\r
  49 };\r
  50 typedef enum_class<task_priority_def> task_priority;\r
  51 \r
  52 class executor\r
  53 {       \r
  54         struct priority_function\r
  55         {\r
  56                 int                                             priority;\r
  57                 std::function<void()>   func;\r
  58 \r
  59                 priority_function()\r
  60                 {\r
  61                 }\r
  62 \r
  63                 template<typename F>\r
  64                 priority_function(int priority, F&& func)\r
  65                         : priority(priority)\r
  66                         , func(std::forward<F>(func))\r
  67                 {\r
  68                 }\r
  69 \r
  70                 void operator()()\r
  71                 {\r
  72                         func();\r
  73                 }\r
  74 \r
  75                 bool operator<(const priority_function& other) const\r
  76                 {\r
  77                         return priority < other.priority;\r
  78                 }\r
  79         };\r
  80 \r
  81         executor(const executor&);\r
  82         executor& operator=(const executor&);\r
  83         \r
  84         typedef tbb::concurrent_priority_queue<priority_function>       function_queue_t;\r
  85         \r
  86         const std::wstring                                                                                      name_;\r
  87         tbb::atomic<bool>                                                                                       is_running_;\r
  88         boost::thread                                                                                           thread_;        \r
  89         function_queue_t                                                                                        execution_queue_;\r
  90         tbb::concurrent_bounded_queue<int>                                                      semaphore_;\r
  91                 \r
  92 public:         \r
  93         executor(const std::wstring& name)\r
  94                 : name_(name)\r
  95         {\r
  96                 is_running_ = true;\r
  97                 thread_ = boost::thread([this]{run();});\r
  98         }\r
  99         \r
 100         virtual ~executor()\r
 101         {\r
 102                 stop();\r
 103                 thread_.join();\r
 104         }\r
 105                                                 \r
 106         template<typename Func>\r
 107         auto begin_invoke(Func&& func, task_priority priority = task_priority::normal_priority) -> boost::unique_future<decltype(func())> // noexcept\r
 108         {       \r
 109                 if(execution_queue_.size() > 128)\r
 110                         BOOST_THROW_EXCEPTION(invalid_operation() << msg_info("executor overflow.") << source_info(name_));\r
 111 \r
 112                 if(!is_running_)\r
 113                         BOOST_THROW_EXCEPTION(invalid_operation() << msg_info("executor not running.") << source_info(name_));\r
 114                                 \r
 115                 typedef typename std::remove_reference<Func>::type      function_type;\r
 116                 typedef decltype(func())                                                        result_type;\r
 117                 typedef boost::packaged_task<result_type>                       task_type;\r
 118                                                                 \r
 119                 std::unique_ptr<task_type> task;\r
 120 \r
 121                 // Use pointers since the boost thread library doesn't fully support move semantics.\r
 122 \r
 123                 auto raw_func2 = new function_type(std::forward<Func>(func));\r
 124                 try\r
 125                 {\r
 126                         task.reset(new task_type([raw_func2]() -> result_type\r
 127                         {\r
 128                                 std::unique_ptr<function_type> func2(raw_func2);\r
 129                                 return (*func2)();\r
 130                         }));\r
 131                 }\r
 132                 catch(...)\r
 133                 {\r
 134                         delete raw_func2;\r
 135                         throw;\r
 136                 }\r
 137                 \r
 138                 task->set_wait_callback(std::function<void(task_type&)>([=](task_type& my_task) // The std::function wrapper is required in order to add ::result_type to functor class.\r
 139                 {\r
 140                         try\r
 141                         {\r
 142                                 if(is_current())  // Avoids potential deadlock.\r
 143                                         my_task();\r
 144                         }\r
 145                         catch(boost::task_already_started&){}\r
 146                 }));\r
 147                                 \r
 148                 auto future = task->get_future();\r
 149 \r
 150                 auto raw_task = task.release();\r
 151                 priority_function prio_func(priority.value(), [raw_task]\r
 152                 {\r
 153                         std::unique_ptr<task_type> task(raw_task);\r
 154                         try\r
 155                         {\r
 156                                 (*task)();\r
 157                         }\r
 158                         catch(boost::task_already_started&){}\r
 159                 });\r
 160 \r
 161                 execution_queue_.push(prio_func);\r
 162                 semaphore_.push(0);\r
 163                                                         \r
 164                 return std::move(future);               \r
 165         }\r
 166         \r
 167         template<typename Func>\r
 168         auto invoke(Func&& func, task_priority prioriy = task_priority::normal_priority) -> decltype(func()) // noexcept\r
 169         {\r
 170                 if(is_current())  // Avoids potential deadlock.\r
 171                         return func();\r
 172                 \r
 173                 return begin_invoke(std::forward<Func>(func), prioriy).get();\r
 174         }\r
 175 \r
 176         void yield()\r
 177         {\r
 178                 if(!is_current())\r
 179                         BOOST_THROW_EXCEPTION(invalid_operation() << msg_info("Executor can only yield inside of thread context.")  << source_info(name_));\r
 180 \r
 181                 int dummy;\r
 182                 semaphore_.pop(dummy);\r
 183 \r
 184                 priority_function func;\r
 185                 if(execution_queue_.try_pop(func))\r
 186                         func();\r
 187         }\r
 188 \r
 189         void set_capacity(std::size_t capacity)\r
 190         {\r
 191                 semaphore_.set_capacity(capacity);\r
 192         }\r
 193 \r
 194         std::size_t capacity() const\r
 195         {\r
 196                 return semaphore_.capacity();\r
 197         }\r
 198         \r
 199         void clear()\r
 200         {               \r
 201                 priority_function func;\r
 202                 while(execution_queue_.try_pop(func));\r
 203         }\r
 204                                 \r
 205         void stop()\r
 206         {\r
 207                 invoke([this]\r
 208                 {\r
 209                         is_running_ = false;\r
 210                 });\r
 211         }\r
 212 \r
 213         void wait()\r
 214         {\r
 215                 invoke([]{}, task_priority::lowest_priority);\r
 216         }\r
 217                 \r
 218         function_queue_t::size_type size() const \r
 219         {\r
 220                 return execution_queue_.size(); \r
 221         }\r
 222                 \r
 223         bool is_running() const\r
 224         {\r
 225                 return is_running_; \r
 226         }       \r
 227 \r
 228         bool is_current() const\r
 229         {\r
 230                 return boost::this_thread::get_id() == thread_.get_id();\r
 231         }\r
 232                 \r
 233 private:        \r
 234 \r
 235         void run() // noexcept\r
 236         {\r
 237                 win32_exception::install_handler();             \r
 238                 while(is_running_)\r
 239                 {\r
 240                         try\r
 241                         {\r
 242                                 yield();\r
 243                         }\r
 244                         catch(...)\r
 245                         {\r
 246                                 CASPAR_LOG_CURRENT_EXCEPTION();\r
 247                         }\r
 248                 }\r
 249         }       \r
 250 };\r
 251 \r
 252 }