workqueue.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405
  1. /*
  2. * Copyright (c) 2006-2018, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2017-02-27 bernard fix the re-work issue.
  9. */
  10. #include <rthw.h>
  11. #include <rtthread.h>
  12. #include <rtdevice.h>
  13. #ifdef RT_USING_HEAP
  14. rt_inline rt_err_t _workqueue_work_completion(struct rt_workqueue *queue)
  15. {
  16. rt_err_t result;
  17. rt_enter_critical();
  18. while (1)
  19. {
  20. /* try to take condition semaphore */
  21. result = rt_sem_trytake(&(queue->sem));
  22. if (result == -RT_ETIMEOUT)
  23. {
  24. /* it's timeout, release this semaphore */
  25. rt_sem_release(&(queue->sem));
  26. }
  27. else if (result == RT_EOK)
  28. {
  29. /* keep the sem value = 0 */
  30. result = RT_EOK;
  31. break;
  32. }
  33. else
  34. {
  35. result = -RT_ERROR;
  36. break;
  37. }
  38. }
  39. rt_exit_critical();
  40. return result;
  41. }
  42. static void _workqueue_thread_entry(void *parameter)
  43. {
  44. rt_base_t level;
  45. struct rt_work *work;
  46. struct rt_workqueue *queue;
  47. queue = (struct rt_workqueue *) parameter;
  48. RT_ASSERT(queue != RT_NULL);
  49. while (1)
  50. {
  51. if (rt_list_isempty(&(queue->work_list)))
  52. {
  53. /* no software timer exist, suspend self. */
  54. rt_thread_suspend(rt_thread_self());
  55. rt_schedule();
  56. }
  57. /* we have work to do with. */
  58. level = rt_hw_interrupt_disable();
  59. work = rt_list_entry(queue->work_list.next, struct rt_work, list);
  60. rt_list_remove(&(work->list));
  61. queue->work_current = work;
  62. work->flags &= ~RT_WORK_STATE_PENDING;
  63. rt_hw_interrupt_enable(level);
  64. /* do work */
  65. work->work_func(work, work->work_data);
  66. level = rt_hw_interrupt_disable();
  67. /* clean current work */
  68. queue->work_current = RT_NULL;
  69. rt_hw_interrupt_enable(level);
  70. /* ack work completion */
  71. _workqueue_work_completion(queue);
  72. }
  73. }
  74. static rt_err_t _workqueue_submit_work(struct rt_workqueue *queue, struct rt_work *work)
  75. {
  76. rt_base_t level;
  77. level = rt_hw_interrupt_disable();
  78. if (work->flags & RT_WORK_STATE_PENDING)
  79. {
  80. rt_hw_interrupt_enable(level);
  81. return -RT_EBUSY;
  82. }
  83. if (queue->work_current == work)
  84. {
  85. rt_hw_interrupt_enable(level);
  86. return -RT_EBUSY;
  87. }
  88. /* NOTE: the work MUST be initialized firstly */
  89. rt_list_remove(&(work->list));
  90. rt_list_insert_after(queue->work_list.prev, &(work->list));
  91. work->flags |= RT_WORK_STATE_PENDING;
  92. /* whether the workqueue is doing work */
  93. if (queue->work_current == RT_NULL)
  94. {
  95. rt_hw_interrupt_enable(level);
  96. /* resume work thread */
  97. rt_thread_resume(queue->work_thread);
  98. rt_schedule();
  99. }
  100. else
  101. {
  102. rt_hw_interrupt_enable(level);
  103. }
  104. return RT_EOK;
  105. }
  106. static rt_err_t _workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  107. {
  108. rt_base_t level;
  109. level = rt_hw_interrupt_disable();
  110. if (queue->work_current == work)
  111. {
  112. rt_hw_interrupt_enable(level);
  113. return -RT_EBUSY;
  114. }
  115. rt_list_remove(&(work->list));
  116. work->flags &= ~RT_WORK_STATE_PENDING;
  117. rt_hw_interrupt_enable(level);
  118. return RT_EOK;
  119. }
  120. static rt_err_t _workqueue_cancel_delayed_work(struct rt_delayed_work *work)
  121. {
  122. rt_base_t level;
  123. int ret = RT_EOK;
  124. if (!work->workqueue)
  125. {
  126. ret = -EINVAL;
  127. goto __exit;
  128. }
  129. if (work->work.flags & RT_WORK_STATE_PENDING)
  130. {
  131. /* Remove from the queue if already submitted */
  132. ret = rt_workqueue_cancel_work(work->workqueue, &(work->work));
  133. if (ret)
  134. {
  135. goto __exit;
  136. }
  137. }
  138. else
  139. {
  140. rt_timer_stop(&(work->timer));
  141. }
  142. level = rt_hw_interrupt_disable();
  143. /* Detach from workqueue */
  144. work->workqueue = RT_NULL;
  145. work->work.flags &= ~(RT_WORK_STATE_PENDING);
  146. rt_hw_interrupt_enable(level);
  147. __exit:
  148. return ret;
  149. }
  150. static rt_err_t _workqueue_submit_delayed_work(struct rt_workqueue *queue,
  151. struct rt_delayed_work *work, rt_tick_t ticks)
  152. {
  153. rt_base_t level;
  154. int ret = RT_EOK;
  155. /* Work cannot be active in multiple queues */
  156. if (work->workqueue && work->workqueue != queue)
  157. {
  158. ret = -RT_EINVAL;
  159. goto __exit;
  160. }
  161. /* Cancel if work has been submitted */
  162. if (work->workqueue == queue)
  163. {
  164. ret = _workqueue_cancel_delayed_work(work);
  165. if (ret < 0)
  166. {
  167. goto __exit;
  168. }
  169. }
  170. level = rt_hw_interrupt_disable();
  171. /* Attach workqueue so the timeout callback can submit it */
  172. work->workqueue = queue;
  173. rt_hw_interrupt_enable(level);
  174. if (!ticks)
  175. {
  176. /* Submit work if no ticks is 0 */
  177. _workqueue_submit_work(work->workqueue, &(work->work));
  178. }
  179. else
  180. {
  181. /* Add timeout */
  182. rt_timer_control(&(work->timer), RT_TIMER_CTRL_SET_TIME, &ticks);
  183. rt_timer_start(&(work->timer));
  184. }
  185. __exit:
  186. return ret;
  187. }
  188. static void _delayed_work_timeout_handler(void *parameter)
  189. {
  190. struct rt_delayed_work *delayed_work;
  191. delayed_work = (struct rt_delayed_work *)parameter;
  192. rt_timer_stop(&(delayed_work->timer));
  193. _workqueue_submit_work(delayed_work->workqueue, &(delayed_work->work));
  194. }
  195. struct rt_workqueue *rt_workqueue_create(const char *name, rt_uint16_t stack_size, rt_uint8_t priority)
  196. {
  197. struct rt_workqueue *queue = RT_NULL;
  198. queue = (struct rt_workqueue *)RT_KERNEL_MALLOC(sizeof(struct rt_workqueue));
  199. if (queue != RT_NULL)
  200. {
  201. /* initialize work list */
  202. rt_list_init(&(queue->work_list));
  203. queue->work_current = RT_NULL;
  204. rt_sem_init(&(queue->sem), "wqueue", 0, RT_IPC_FLAG_FIFO);
  205. /* create the work thread */
  206. queue->work_thread = rt_thread_create(name, _workqueue_thread_entry, queue, stack_size, priority, 10);
  207. if (queue->work_thread == RT_NULL)
  208. {
  209. RT_KERNEL_FREE(queue);
  210. return RT_NULL;
  211. }
  212. rt_thread_startup(queue->work_thread);
  213. }
  214. return queue;
  215. }
  216. rt_err_t rt_workqueue_destroy(struct rt_workqueue *queue)
  217. {
  218. RT_ASSERT(queue != RT_NULL);
  219. rt_thread_delete(queue->work_thread);
  220. RT_KERNEL_FREE(queue);
  221. return RT_EOK;
  222. }
  223. rt_err_t rt_workqueue_dowork(struct rt_workqueue *queue, struct rt_work *work)
  224. {
  225. RT_ASSERT(queue != RT_NULL);
  226. RT_ASSERT(work != RT_NULL);
  227. return _workqueue_submit_work(queue, work);
  228. }
  229. rt_err_t rt_workqueue_submit_work(struct rt_workqueue *queue, struct rt_work *work, rt_tick_t time)
  230. {
  231. RT_ASSERT(queue != RT_NULL);
  232. RT_ASSERT(work != RT_NULL);
  233. if (work->type & RT_WORK_TYPE_DELAYED)
  234. {
  235. return _workqueue_submit_delayed_work(queue, (struct rt_delayed_work *)work, time);
  236. }
  237. else
  238. {
  239. return _workqueue_submit_work(queue, work);
  240. }
  241. }
  242. rt_err_t rt_workqueue_critical_work(struct rt_workqueue *queue, struct rt_work *work)
  243. {
  244. rt_base_t level;
  245. RT_ASSERT(queue != RT_NULL);
  246. RT_ASSERT(work != RT_NULL);
  247. level = rt_hw_interrupt_disable();
  248. if (queue->work_current == work)
  249. {
  250. rt_hw_interrupt_enable(level);
  251. return -RT_EBUSY;
  252. }
  253. /* NOTE: the work MUST be initialized firstly */
  254. rt_list_remove(&(work->list));
  255. rt_list_insert_after(queue->work_list.prev, &(work->list));
  256. if (queue->work_current == RT_NULL)
  257. {
  258. rt_hw_interrupt_enable(level);
  259. /* resume work thread */
  260. rt_thread_resume(queue->work_thread);
  261. rt_schedule();
  262. }
  263. else rt_hw_interrupt_enable(level);
  264. return RT_EOK;
  265. }
  266. rt_err_t rt_workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  267. {
  268. RT_ASSERT(queue != RT_NULL);
  269. RT_ASSERT(work != RT_NULL);
  270. if (work->type & RT_WORK_TYPE_DELAYED)
  271. {
  272. return _workqueue_cancel_delayed_work((struct rt_delayed_work *)work);
  273. }
  274. else
  275. {
  276. return _workqueue_cancel_work(queue, work);
  277. }
  278. }
  279. rt_err_t rt_workqueue_cancel_work_sync(struct rt_workqueue *queue, struct rt_work *work)
  280. {
  281. rt_base_t level;
  282. RT_ASSERT(queue != RT_NULL);
  283. RT_ASSERT(work != RT_NULL);
  284. level = rt_hw_interrupt_disable();
  285. if (queue->work_current == work) /* it's current work in the queue */
  286. {
  287. /* wait for work completion */
  288. rt_sem_take(&(queue->sem), RT_WAITING_FOREVER);
  289. }
  290. else
  291. {
  292. rt_list_remove(&(work->list));
  293. }
  294. work->flags &= ~RT_WORK_STATE_PENDING;
  295. rt_hw_interrupt_enable(level);
  296. return RT_EOK;
  297. }
  298. rt_err_t rt_workqueue_cancel_all_work(struct rt_workqueue *queue)
  299. {
  300. struct rt_list_node *node, *next;
  301. RT_ASSERT(queue != RT_NULL);
  302. rt_enter_critical();
  303. for (node = queue->work_list.next; node != &(queue->work_list); node = next)
  304. {
  305. next = node->next;
  306. rt_list_remove(node);
  307. }
  308. rt_exit_critical();
  309. return RT_EOK;
  310. }
  311. void rt_delayed_work_init(struct rt_delayed_work *work, void (*work_func)(struct rt_work *work,
  312. void *work_data), void *work_data)
  313. {
  314. rt_work_init(&(work->work), work_func, work_data);
  315. work->work.type = RT_WORK_TYPE_DELAYED;
  316. rt_timer_init(&(work->timer), "work", _delayed_work_timeout_handler, work, 0,
  317. RT_TIMER_FLAG_ONE_SHOT | RT_TIMER_FLAG_SOFT_TIMER);
  318. }
  319. #ifdef RT_USING_SYSTEM_WORKQUEUE
  320. static struct rt_workqueue *sys_workq;
  321. rt_err_t rt_work_submit(struct rt_work *work, rt_tick_t time)
  322. {
  323. return rt_workqueue_submit_work(sys_workq, work, time);
  324. }
  325. rt_err_t rt_work_cancel(struct rt_work *work)
  326. {
  327. return rt_workqueue_cancel_work(sys_workq, work);
  328. }
  329. static int rt_work_sys_workqueue_init(void)
  330. {
  331. sys_workq = rt_workqueue_create("sys_work", RT_SYSTEM_WORKQUEUE_STACKSIZE,
  332. RT_SYSTEM_WORKQUEUE_PRIORITY);
  333. return RT_EOK;
  334. }
  335. INIT_DEVICE_EXPORT(rt_work_sys_workqueue_init);
  336. #endif
  337. #endif