workqueue.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467
  1. /*
  2. * Copyright (c) 2006-2022, 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. * 2024-12-21 yuqingli delete timer, using list
  14. */
  15. #include <rthw.h>
  16. #include <rtdevice.h>
  17. #ifdef RT_USING_HEAP
  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. rt_tick_t current_tick;
  50. rt_int32_t delay_tick;
  51. void (*work_func)(struct rt_work *work, void *work_data);
  52. void *work_data;
  53. queue = (struct rt_workqueue *)parameter;
  54. RT_ASSERT(queue != RT_NULL);
  55. while (1)
  56. {
  57. level = rt_spin_lock_irqsave(&(queue->spinlock));
  58. /* timer check */
  59. current_tick = rt_tick_get();
  60. delay_tick = RT_WAITING_FOREVER;
  61. while (!rt_list_isempty(&(queue->delayed_list)))
  62. {
  63. work = rt_list_entry(queue->delayed_list.next, struct rt_work, list);
  64. if ((current_tick - work->timeout_tick) < RT_TICK_MAX / 2)
  65. {
  66. rt_list_remove(&(work->list));
  67. rt_list_insert_after(queue->work_list.prev, &(work->list));
  68. work->flags &= ~RT_WORK_STATE_SUBMITTING;
  69. work->flags |= RT_WORK_STATE_PENDING;
  70. }
  71. else
  72. {
  73. delay_tick = work->timeout_tick - current_tick;
  74. break;
  75. }
  76. }
  77. if (rt_list_isempty(&(queue->work_list)))
  78. {
  79. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  80. /* wait for work completion */
  81. rt_completion_wait(&(queue->wakeup_completion), delay_tick);
  82. continue;
  83. }
  84. /* we have work to do with. */
  85. work = rt_list_entry(queue->work_list.next, struct rt_work, list);
  86. rt_list_remove(&(work->list));
  87. queue->work_current = work;
  88. work->flags &= ~RT_WORK_STATE_PENDING;
  89. work->workqueue = RT_NULL;
  90. work_func = work->work_func;
  91. work_data = work->work_data;
  92. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  93. /* do work */
  94. work_func(work, work_data);
  95. /* clean current work */
  96. queue->work_current = RT_NULL;
  97. /* ack work completion */
  98. _workqueue_work_completion(queue);
  99. }
  100. }
  101. static rt_err_t _workqueue_submit_work(struct rt_workqueue *queue,
  102. struct rt_work *work, rt_tick_t ticks)
  103. {
  104. rt_base_t level;
  105. rt_err_t err = RT_EOK;
  106. struct rt_work *work_tmp;
  107. rt_list_t *list_tmp;
  108. level = rt_spin_lock_irqsave(&(queue->spinlock));
  109. /* remove list */
  110. rt_list_remove(&(work->list));
  111. work->flags = 0;
  112. if (ticks == 0)
  113. {
  114. rt_list_insert_after(queue->work_list.prev, &(work->list));
  115. work->flags |= RT_WORK_STATE_PENDING;
  116. work->workqueue = queue;
  117. rt_completion_done(&(queue->wakeup_completion));
  118. err = RT_EOK;
  119. }
  120. else if (ticks < RT_TICK_MAX / 2)
  121. {
  122. /* insert delay work list */
  123. work->flags |= RT_WORK_STATE_SUBMITTING;
  124. work->workqueue = queue;
  125. work->timeout_tick = rt_tick_get() + ticks;
  126. list_tmp = &(queue->delayed_list);
  127. rt_list_for_each_entry(work_tmp, &(queue->delayed_list), list)
  128. {
  129. if ((work_tmp->timeout_tick - work->timeout_tick) < RT_TICK_MAX / 2)
  130. {
  131. list_tmp = &(work_tmp->list);
  132. break;
  133. }
  134. }
  135. rt_list_insert_before(list_tmp, &(work->list));
  136. rt_completion_done(&(queue->wakeup_completion));
  137. err = RT_EOK;
  138. }
  139. else
  140. {
  141. err = -RT_ERROR;
  142. }
  143. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  144. return err;
  145. }
  146. static rt_err_t _workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  147. {
  148. rt_base_t level;
  149. rt_err_t err;
  150. level = rt_spin_lock_irqsave(&(queue->spinlock));
  151. rt_list_remove(&(work->list));
  152. work->flags = 0;
  153. err = queue->work_current != work ? RT_EOK : -RT_EBUSY;
  154. work->workqueue = RT_NULL;
  155. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  156. return err;
  157. }
  158. /**
  159. * @brief Initialize a work item, binding with a callback function.
  160. *
  161. * @param work is a pointer to the work item object.
  162. *
  163. * @param work_func is a callback function that will be called when this work item is executed.
  164. *
  165. * @param work_data is a user data passed to the callback function as the second parameter.
  166. */
  167. void rt_work_init(struct rt_work *work,
  168. void (*work_func)(struct rt_work *work, void *work_data),
  169. void *work_data)
  170. {
  171. RT_ASSERT(work != RT_NULL);
  172. RT_ASSERT(work_func != RT_NULL);
  173. rt_list_init(&(work->list));
  174. work->work_func = work_func;
  175. work->work_data = work_data;
  176. work->workqueue = RT_NULL;
  177. work->flags = 0;
  178. work->type = 0;
  179. }
  180. /**
  181. * @brief Create a work queue with a thread inside.
  182. *
  183. * @param name is a name of the work queue thread.
  184. *
  185. * @param stack_size is stack size of the work queue thread.
  186. *
  187. * @param priority is a priority of the work queue thread.
  188. *
  189. * @return Return a pointer to the workqueue object. It will return RT_NULL if failed.
  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. rt_completion_init(&(queue->wakeup_completion));
  203. /* create the work thread */
  204. queue->work_thread = rt_thread_create(name, _workqueue_thread_entry, queue, stack_size, priority, 10);
  205. if (queue->work_thread == RT_NULL)
  206. {
  207. rt_sem_detach(&(queue->sem));
  208. RT_KERNEL_FREE(queue);
  209. return RT_NULL;
  210. }
  211. rt_spin_lock_init(&(queue->spinlock));
  212. rt_thread_startup(queue->work_thread);
  213. }
  214. return queue;
  215. }
  216. /**
  217. * @brief Destroy a work queue.
  218. *
  219. * @param queue is a pointer to the workqueue object.
  220. *
  221. * @return RT_EOK Success.
  222. */
  223. rt_err_t rt_workqueue_destroy(struct rt_workqueue *queue)
  224. {
  225. RT_ASSERT(queue != RT_NULL);
  226. rt_workqueue_cancel_all_work(queue);
  227. rt_thread_delete(queue->work_thread);
  228. rt_sem_detach(&(queue->sem));
  229. RT_KERNEL_FREE(queue);
  230. return RT_EOK;
  231. }
  232. /**
  233. * @brief Submit a work item to the work queue without delay.
  234. *
  235. * @param queue is a pointer to the workqueue object.
  236. *
  237. * @param work is a pointer to the work item object.
  238. *
  239. * @return RT_EOK Success.
  240. */
  241. rt_err_t rt_workqueue_dowork(struct rt_workqueue *queue, struct rt_work *work)
  242. {
  243. RT_ASSERT(queue != RT_NULL);
  244. RT_ASSERT(work != RT_NULL);
  245. return _workqueue_submit_work(queue, work, 0);
  246. }
  247. /**
  248. * @brief Submit a work item to the work queue with a delay.
  249. *
  250. * @param queue is a pointer to the workqueue object.
  251. *
  252. * @param work is a pointer to the work item object.
  253. *
  254. * @param ticks is the delay ticks for the work item to be submitted to the work queue.
  255. *
  256. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  257. *
  258. * @return RT_EOK Success.
  259. * -RT_ERROR The ticks parameter is invalid.
  260. */
  261. rt_err_t rt_workqueue_submit_work(struct rt_workqueue *queue, struct rt_work *work, rt_tick_t ticks)
  262. {
  263. RT_ASSERT(queue != RT_NULL);
  264. RT_ASSERT(work != RT_NULL);
  265. RT_ASSERT(ticks < RT_TICK_MAX / 2);
  266. return _workqueue_submit_work(queue, work, ticks);
  267. }
  268. /**
  269. * @brief Submit a work item to the work queue without delay. This work item will be executed after the current work item.
  270. *
  271. * @param queue is a pointer to the workqueue object.
  272. *
  273. * @param work is a pointer to the work item object.
  274. *
  275. * @return RT_EOK Success.
  276. */
  277. rt_err_t rt_workqueue_urgent_work(struct rt_workqueue *queue, struct rt_work *work)
  278. {
  279. rt_base_t level;
  280. RT_ASSERT(queue != RT_NULL);
  281. RT_ASSERT(work != RT_NULL);
  282. level = rt_spin_lock_irqsave(&(queue->spinlock));
  283. /* NOTE: the work MUST be initialized firstly */
  284. rt_list_remove(&(work->list));
  285. rt_list_insert_after(&queue->work_list, &(work->list));
  286. rt_completion_done(&(queue->wakeup_completion));
  287. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  288. return RT_EOK;
  289. }
  290. /**
  291. * @brief Cancel a work item in the work queue.
  292. *
  293. * @param queue is a pointer to the workqueue object.
  294. *
  295. * @param work is a pointer to the work item object.
  296. *
  297. * @return RT_EOK Success.
  298. * -RT_EBUSY This work item is executing.
  299. */
  300. rt_err_t rt_workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  301. {
  302. RT_ASSERT(work != RT_NULL);
  303. RT_ASSERT(queue != RT_NULL);
  304. return _workqueue_cancel_work(queue, work);
  305. }
  306. /**
  307. * @brief Cancel a work item in the work queue. If the work item is executing, this function will block until it is done.
  308. *
  309. * @param queue is a pointer to the workqueue object.
  310. *
  311. * @param work is a pointer to the work item object.
  312. *
  313. * @return RT_EOK Success.
  314. */
  315. rt_err_t rt_workqueue_cancel_work_sync(struct rt_workqueue *queue, struct rt_work *work)
  316. {
  317. RT_ASSERT(queue != RT_NULL);
  318. RT_ASSERT(work != RT_NULL);
  319. if (queue->work_current == work) /* it's current work in the queue */
  320. {
  321. /* wait for work completion */
  322. rt_sem_take(&(queue->sem), RT_WAITING_FOREVER);
  323. /* Note that because work items are automatically deleted after execution, they do not need to be deleted again */
  324. }
  325. else
  326. {
  327. _workqueue_cancel_work(queue, work);
  328. }
  329. return RT_EOK;
  330. }
  331. /**
  332. * @brief This function will cancel all work items in work queue.
  333. *
  334. * @param queue is a pointer to the workqueue object.
  335. *
  336. * @return RT_EOK Success.
  337. */
  338. rt_err_t rt_workqueue_cancel_all_work(struct rt_workqueue *queue)
  339. {
  340. struct rt_work *work;
  341. RT_ASSERT(queue != RT_NULL);
  342. /* cancel work */
  343. rt_enter_critical();
  344. while (rt_list_isempty(&queue->work_list) == RT_FALSE)
  345. {
  346. work = rt_list_first_entry(&queue->work_list, struct rt_work, list);
  347. _workqueue_cancel_work(queue, work);
  348. }
  349. /* cancel delay work */
  350. while (rt_list_isempty(&queue->delayed_list) == RT_FALSE)
  351. {
  352. work = rt_list_first_entry(&queue->delayed_list, struct rt_work, list);
  353. _workqueue_cancel_work(queue, work);
  354. }
  355. rt_exit_critical();
  356. return RT_EOK;
  357. }
  358. #ifdef RT_USING_SYSTEM_WORKQUEUE
  359. static struct rt_workqueue *sys_workq; /* system work queue */
  360. /**
  361. * @brief Submit a work item to the system work queue with a delay.
  362. *
  363. * @param work is a pointer to the work item object.
  364. *
  365. * @param ticks is the delay OS ticks for the work item to be submitted to the work queue.
  366. *
  367. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  368. *
  369. * @return RT_EOK Success.
  370. * -RT_ERROR The ticks parameter is invalid.
  371. */
  372. rt_err_t rt_work_submit(struct rt_work *work, rt_tick_t ticks)
  373. {
  374. return rt_workqueue_submit_work(sys_workq, work, ticks);
  375. }
  376. /**
  377. * @brief Submit a work item to the system work queue without delay. This work item will be executed after the current work item.
  378. *
  379. * @param work is a pointer to the work item object.
  380. *
  381. * @return RT_EOK Success.
  382. */
  383. rt_err_t rt_work_urgent(struct rt_work *work)
  384. {
  385. return rt_workqueue_urgent_work(sys_workq, work);
  386. }
  387. /**
  388. * @brief Cancel a work item in the system work queue.
  389. *
  390. * @param work is a pointer to the work item object.
  391. *
  392. * @return RT_EOK Success.
  393. * -RT_EBUSY This work item is executing.
  394. */
  395. rt_err_t rt_work_cancel(struct rt_work *work)
  396. {
  397. return rt_workqueue_cancel_work(sys_workq, work);
  398. }
  399. static int rt_work_sys_workqueue_init(void)
  400. {
  401. if (sys_workq != RT_NULL)
  402. return RT_EOK;
  403. sys_workq = rt_workqueue_create("sys workq", RT_SYSTEM_WORKQUEUE_STACKSIZE,
  404. RT_SYSTEM_WORKQUEUE_PRIORITY);
  405. RT_ASSERT(sys_workq != RT_NULL);
  406. return RT_EOK;
  407. }
  408. INIT_PREV_EXPORT(rt_work_sys_workqueue_init);
  409. #endif /* RT_USING_SYSTEM_WORKQUEUE */
  410. #endif /* RT_USING_HEAP */