workqueue.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  1. /*
  2. * Copyright (c) 2006-2023, 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. * 2021-08-14 Jackistang add comments for function interface
  11. * 2022-01-16 Meco Man add rt_work_urgent()
  12. * 2023-09-15 xqyjlj perf rt_hw_interrupt_disable/enable
  13. */
  14. #include <rthw.h>
  15. #include <rtdevice.h>
  16. #ifdef RT_USING_HEAP
  17. static void _delayed_work_timeout_handler(void *parameter);
  18. rt_inline rt_err_t _workqueue_work_completion(struct rt_workqueue *queue)
  19. {
  20. rt_err_t result;
  21. while (1)
  22. {
  23. /* try to take condition semaphore */
  24. result = rt_sem_trytake(&(queue->sem));
  25. if (result == -RT_ETIMEOUT)
  26. {
  27. /* it's timeout, release this semaphore */
  28. rt_sem_release(&(queue->sem));
  29. }
  30. else if (result == RT_EOK)
  31. {
  32. /* keep the sem value = 0 */
  33. result = RT_EOK;
  34. break;
  35. }
  36. else
  37. {
  38. result = -RT_ERROR;
  39. break;
  40. }
  41. }
  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_spin_lock_irqsave(&(queue->spinlock));
  54. if (rt_list_isempty(&(queue->work_list)))
  55. {
  56. /* no software timer exist, suspend self. */
  57. rt_thread_suspend_with_flag(rt_thread_self(), RT_UNINTERRUPTIBLE);
  58. /* release lock after suspend so we will not lost any wakeups */
  59. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  60. rt_schedule();
  61. continue;
  62. }
  63. /* we have work to do with. */
  64. work = rt_list_entry(queue->work_list.next, struct rt_work, list);
  65. rt_list_remove(&(work->list));
  66. queue->work_current = work;
  67. work->flags &= ~RT_WORK_STATE_PENDING;
  68. work->workqueue = RT_NULL;
  69. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  70. /* do work */
  71. work->work_func(work, work->work_data);
  72. /* clean current work */
  73. queue->work_current = RT_NULL;
  74. /* ack work completion */
  75. _workqueue_work_completion(queue);
  76. }
  77. }
  78. static rt_err_t _workqueue_submit_work(struct rt_workqueue *queue,
  79. struct rt_work *work, rt_tick_t ticks)
  80. {
  81. rt_base_t level;
  82. rt_err_t err = RT_EOK;
  83. level = rt_spin_lock_irqsave(&(queue->spinlock));
  84. /* remove list */
  85. rt_list_remove(&(work->list));
  86. work->flags &= ~RT_WORK_STATE_PENDING;
  87. if (ticks == 0)
  88. {
  89. rt_list_insert_after(queue->work_list.prev, &(work->list));
  90. work->flags |= RT_WORK_STATE_PENDING;
  91. work->workqueue = queue;
  92. /* whether the workqueue is doing work */
  93. if (queue->work_current == RT_NULL)
  94. {
  95. /* resume work thread, and do a re-schedule if succeed */
  96. rt_thread_resume(queue->work_thread);
  97. }
  98. }
  99. else if (ticks < RT_TICK_MAX / 2)
  100. {
  101. /* Timer started */
  102. if (work->flags & RT_WORK_STATE_SUBMITTING)
  103. {
  104. rt_timer_control(&work->timer, RT_TIMER_CTRL_SET_TIME, &ticks);
  105. }
  106. else
  107. {
  108. rt_timer_init(&(work->timer), "work", _delayed_work_timeout_handler,
  109. work, ticks, RT_TIMER_FLAG_ONE_SHOT | RT_TIMER_FLAG_SOFT_TIMER);
  110. work->flags |= RT_WORK_STATE_SUBMITTING;
  111. }
  112. work->workqueue = queue;
  113. /* insert delay work list */
  114. rt_list_insert_after(queue->delayed_list.prev, &(work->list));
  115. err = rt_timer_start(&(work->timer));
  116. }
  117. else
  118. {
  119. err = - RT_ERROR;
  120. }
  121. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  122. return err;
  123. }
  124. static rt_err_t _workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  125. {
  126. rt_base_t level;
  127. rt_err_t err;
  128. level = rt_spin_lock_irqsave(&(queue->spinlock));
  129. rt_list_remove(&(work->list));
  130. work->flags &= ~RT_WORK_STATE_PENDING;
  131. /* Timer started */
  132. if (work->flags & RT_WORK_STATE_SUBMITTING)
  133. {
  134. if ((err = rt_timer_stop(&(work->timer))) != RT_EOK)
  135. {
  136. goto exit;
  137. }
  138. rt_timer_detach(&(work->timer));
  139. work->flags &= ~RT_WORK_STATE_SUBMITTING;
  140. }
  141. err = queue->work_current != work ? RT_EOK : -RT_EBUSY;
  142. work->workqueue = RT_NULL;
  143. exit:
  144. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  145. return err;
  146. }
  147. static void _delayed_work_timeout_handler(void *parameter)
  148. {
  149. struct rt_work *work;
  150. struct rt_workqueue *queue;
  151. rt_base_t level;
  152. work = (struct rt_work *)parameter;
  153. queue = work->workqueue;
  154. RT_ASSERT(work->flags & RT_WORK_STATE_SUBMITTING);
  155. RT_ASSERT(queue != RT_NULL);
  156. level = rt_spin_lock_irqsave(&(queue->spinlock));
  157. rt_timer_detach(&(work->timer));
  158. work->flags &= ~RT_WORK_STATE_SUBMITTING;
  159. /* remove delay list */
  160. rt_list_remove(&(work->list));
  161. /* insert work queue */
  162. if (queue->work_current != work)
  163. {
  164. rt_list_insert_after(queue->work_list.prev, &(work->list));
  165. work->flags |= RT_WORK_STATE_PENDING;
  166. }
  167. /* whether the workqueue is doing work */
  168. if (queue->work_current == RT_NULL)
  169. {
  170. /* resume work thread, and do a re-schedule if succeed */
  171. rt_thread_resume(queue->work_thread);
  172. }
  173. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  174. }
  175. /**
  176. * @brief Initialize a work item, binding with a callback function.
  177. *
  178. * @param work is a pointer to the work item object.
  179. *
  180. * @param work_func is a callback function that will be called when this work item is executed.
  181. *
  182. * @param work_data is a user data passed to the callback function as the second parameter.
  183. */
  184. void rt_work_init(struct rt_work *work,
  185. void (*work_func)(struct rt_work *work, void *work_data),
  186. void *work_data)
  187. {
  188. RT_ASSERT(work != RT_NULL);
  189. RT_ASSERT(work_func != RT_NULL);
  190. rt_list_init(&(work->list));
  191. work->work_func = work_func;
  192. work->work_data = work_data;
  193. work->workqueue = RT_NULL;
  194. work->flags = 0;
  195. work->type = 0;
  196. }
  197. /**
  198. * @brief Create a work queue with a thread inside.
  199. *
  200. * @param name is a name of the work queue thread.
  201. *
  202. * @param stack_size is stack size of the work queue thread.
  203. *
  204. * @param priority is a priority of the work queue thread.
  205. *
  206. * @return Return a pointer to the workqueue object. It will return RT_NULL if failed.
  207. */
  208. struct rt_workqueue *rt_workqueue_create(const char *name, rt_uint16_t stack_size, rt_uint8_t priority)
  209. {
  210. struct rt_workqueue *queue = RT_NULL;
  211. queue = (struct rt_workqueue *)RT_KERNEL_MALLOC(sizeof(struct rt_workqueue));
  212. if (queue != RT_NULL)
  213. {
  214. /* initialize work list */
  215. rt_list_init(&(queue->work_list));
  216. rt_list_init(&(queue->delayed_list));
  217. queue->work_current = RT_NULL;
  218. rt_sem_init(&(queue->sem), "wqueue", 0, RT_IPC_FLAG_FIFO);
  219. /* create the work thread */
  220. queue->work_thread = rt_thread_create(name, _workqueue_thread_entry, queue, stack_size, priority, 10);
  221. if (queue->work_thread == RT_NULL)
  222. {
  223. rt_sem_detach(&(queue->sem));
  224. RT_KERNEL_FREE(queue);
  225. return RT_NULL;
  226. }
  227. rt_spin_lock_init(&(queue->spinlock));
  228. rt_thread_startup(queue->work_thread);
  229. }
  230. return queue;
  231. }
  232. /**
  233. * @brief Destroy a work queue.
  234. *
  235. * @param queue is a pointer to the workqueue object.
  236. *
  237. * @return RT_EOK Success.
  238. */
  239. rt_err_t rt_workqueue_destroy(struct rt_workqueue *queue)
  240. {
  241. RT_ASSERT(queue != RT_NULL);
  242. rt_workqueue_cancel_all_work(queue);
  243. rt_thread_delete(queue->work_thread);
  244. rt_sem_detach(&(queue->sem));
  245. RT_KERNEL_FREE(queue);
  246. return RT_EOK;
  247. }
  248. /**
  249. * @brief Submit a work item to the work queue without delay.
  250. *
  251. * @param queue is a pointer to the workqueue object.
  252. *
  253. * @param work is a pointer to the work item object.
  254. *
  255. * @return RT_EOK Success.
  256. * -RT_EBUSY This work item is executing.
  257. */
  258. rt_err_t rt_workqueue_dowork(struct rt_workqueue *queue, struct rt_work *work)
  259. {
  260. RT_ASSERT(queue != RT_NULL);
  261. RT_ASSERT(work != RT_NULL);
  262. return _workqueue_submit_work(queue, work, 0);
  263. }
  264. /**
  265. * @brief Submit a work item to the work queue with a delay.
  266. *
  267. * @param queue is a pointer to the workqueue object.
  268. *
  269. * @param work is a pointer to the work item object.
  270. *
  271. * @param ticks is the delay ticks for the work item to be submitted to the work queue.
  272. *
  273. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  274. *
  275. * @return RT_EOK Success.
  276. * -RT_EBUSY This work item is executing.
  277. * -RT_ERROR The ticks parameter is invalid.
  278. */
  279. rt_err_t rt_workqueue_submit_work(struct rt_workqueue *queue, struct rt_work *work, rt_tick_t ticks)
  280. {
  281. RT_ASSERT(queue != RT_NULL);
  282. RT_ASSERT(work != RT_NULL);
  283. RT_ASSERT(ticks < RT_TICK_MAX / 2);
  284. return _workqueue_submit_work(queue, work, ticks);
  285. }
  286. /**
  287. * @brief Submit a work item to the work queue without delay. This work item will be executed after the current work item.
  288. *
  289. * @param queue is a pointer to the workqueue object.
  290. *
  291. * @param work is a pointer to the work item object.
  292. *
  293. * @return RT_EOK Success.
  294. */
  295. rt_err_t rt_workqueue_urgent_work(struct rt_workqueue *queue, struct rt_work *work)
  296. {
  297. rt_base_t level;
  298. RT_ASSERT(queue != RT_NULL);
  299. RT_ASSERT(work != RT_NULL);
  300. level = rt_spin_lock_irqsave(&(queue->spinlock));
  301. /* NOTE: the work MUST be initialized firstly */
  302. rt_list_remove(&(work->list));
  303. rt_list_insert_after(&queue->work_list, &(work->list));
  304. /* whether the workqueue is doing work */
  305. if (queue->work_current == RT_NULL)
  306. {
  307. /* resume work thread, and do a re-schedule if succeed */
  308. rt_thread_resume(queue->work_thread);
  309. }
  310. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  311. return RT_EOK;
  312. }
  313. /**
  314. * @brief Cancel a work item in the work queue.
  315. *
  316. * @param queue is a pointer to the workqueue object.
  317. *
  318. * @param work is a pointer to the work item object.
  319. *
  320. * @return RT_EOK Success.
  321. * -RT_EBUSY This work item is executing.
  322. */
  323. rt_err_t rt_workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  324. {
  325. RT_ASSERT(work != RT_NULL);
  326. RT_ASSERT(queue != RT_NULL);
  327. return _workqueue_cancel_work(queue, work);
  328. }
  329. /**
  330. * @brief Cancel a work item in the work queue. If the work item is executing, this function will block until it is done.
  331. *
  332. * @param queue is a pointer to the workqueue object.
  333. *
  334. * @param work is a pointer to the work item object.
  335. *
  336. * @return RT_EOK Success.
  337. */
  338. rt_err_t rt_workqueue_cancel_work_sync(struct rt_workqueue *queue, struct rt_work *work)
  339. {
  340. RT_ASSERT(queue != RT_NULL);
  341. RT_ASSERT(work != RT_NULL);
  342. if (queue->work_current == work) /* it's current work in the queue */
  343. {
  344. /* wait for work completion */
  345. rt_sem_take(&(queue->sem), RT_WAITING_FOREVER);
  346. /* Note that because work items are automatically deleted after execution, they do not need to be deleted again */
  347. }
  348. else
  349. {
  350. _workqueue_cancel_work(queue, work);
  351. }
  352. return RT_EOK;
  353. }
  354. /**
  355. * @brief This function will cancel all work items in work queue.
  356. *
  357. * @param queue is a pointer to the workqueue object.
  358. *
  359. * @return RT_EOK Success.
  360. */
  361. rt_err_t rt_workqueue_cancel_all_work(struct rt_workqueue *queue)
  362. {
  363. struct rt_work *work;
  364. RT_ASSERT(queue != RT_NULL);
  365. /* cancel work */
  366. rt_enter_critical();
  367. while (rt_list_isempty(&queue->work_list) == RT_FALSE)
  368. {
  369. work = rt_list_first_entry(&queue->work_list, struct rt_work, list);
  370. _workqueue_cancel_work(queue, work);
  371. }
  372. /* cancel delay work */
  373. while (rt_list_isempty(&queue->delayed_list) == RT_FALSE)
  374. {
  375. work = rt_list_first_entry(&queue->delayed_list, struct rt_work, list);
  376. _workqueue_cancel_work(queue, work);
  377. }
  378. rt_exit_critical();
  379. return RT_EOK;
  380. }
  381. #ifdef RT_USING_SYSTEM_WORKQUEUE
  382. static struct rt_workqueue *sys_workq; /* system work queue */
  383. /**
  384. * @brief Submit a work item to the system work queue with a delay.
  385. *
  386. * @param work is a pointer to the work item object.
  387. *
  388. * @param ticks is the delay OS ticks for the work item to be submitted to the work queue.
  389. *
  390. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  391. *
  392. * @return RT_EOK Success.
  393. * -RT_EBUSY This work item is executing.
  394. * -RT_ERROR The ticks parameter is invalid.
  395. */
  396. rt_err_t rt_work_submit(struct rt_work *work, rt_tick_t ticks)
  397. {
  398. return rt_workqueue_submit_work(sys_workq, work, ticks);
  399. }
  400. /**
  401. * @brief Submit a work item to the system work queue without delay. This work item will be executed after the current work item.
  402. *
  403. * @param work is a pointer to the work item object.
  404. *
  405. * @return RT_EOK Success.
  406. */
  407. rt_err_t rt_work_urgent(struct rt_work *work)
  408. {
  409. return rt_workqueue_urgent_work(sys_workq, work);
  410. }
  411. /**
  412. * @brief Cancel a work item in the system work queue.
  413. *
  414. * @param work is a pointer to the work item object.
  415. *
  416. * @return RT_EOK Success.
  417. * -RT_EBUSY This work item is executing.
  418. */
  419. rt_err_t rt_work_cancel(struct rt_work *work)
  420. {
  421. return rt_workqueue_cancel_work(sys_workq, work);
  422. }
  423. static int rt_work_sys_workqueue_init(void)
  424. {
  425. if (sys_workq != RT_NULL)
  426. return RT_EOK;
  427. sys_workq = rt_workqueue_create("sys workq", RT_SYSTEM_WORKQUEUE_STACKSIZE,
  428. RT_SYSTEM_WORKQUEUE_PRIORITY);
  429. RT_ASSERT(sys_workq != RT_NULL);
  430. return RT_EOK;
  431. }
  432. INIT_PREV_EXPORT(rt_work_sys_workqueue_init);
  433. #endif /* RT_USING_SYSTEM_WORKQUEUE */
  434. #endif /* RT_USING_HEAP */