workqueue.c 9.8 KB

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