workqueue.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  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;
  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. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  98. }
  99. else
  100. {
  101. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  102. }
  103. return RT_EOK;
  104. }
  105. else if (ticks < RT_TICK_MAX / 2)
  106. {
  107. /* Timer started */
  108. if (work->flags & RT_WORK_STATE_SUBMITTING)
  109. {
  110. rt_timer_control(&work->timer, RT_TIMER_CTRL_SET_TIME, &ticks);
  111. }
  112. else
  113. {
  114. rt_timer_init(&(work->timer), "work", _delayed_work_timeout_handler,
  115. work, ticks, RT_TIMER_FLAG_ONE_SHOT | RT_TIMER_FLAG_SOFT_TIMER);
  116. work->flags |= RT_WORK_STATE_SUBMITTING;
  117. }
  118. work->workqueue = queue;
  119. /* insert delay work list */
  120. rt_list_insert_after(queue->delayed_list.prev, &(work->list));
  121. err = rt_timer_start(&(work->timer));
  122. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  123. return err;
  124. }
  125. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  126. return -RT_ERROR;
  127. }
  128. static rt_err_t _workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  129. {
  130. rt_base_t level;
  131. rt_err_t err;
  132. level = rt_spin_lock_irqsave(&(queue->spinlock));
  133. rt_list_remove(&(work->list));
  134. work->flags &= ~RT_WORK_STATE_PENDING;
  135. /* Timer started */
  136. if (work->flags & RT_WORK_STATE_SUBMITTING)
  137. {
  138. if ((err = rt_timer_stop(&(work->timer))) != RT_EOK)
  139. {
  140. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  141. return err;
  142. }
  143. rt_timer_detach(&(work->timer));
  144. work->flags &= ~RT_WORK_STATE_SUBMITTING;
  145. }
  146. err = queue->work_current != work ? RT_EOK : -RT_EBUSY;
  147. work->workqueue = RT_NULL;
  148. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  149. return err;
  150. }
  151. static void _delayed_work_timeout_handler(void *parameter)
  152. {
  153. struct rt_work *work;
  154. struct rt_workqueue *queue;
  155. rt_base_t level;
  156. work = (struct rt_work *)parameter;
  157. queue = work->workqueue;
  158. RT_ASSERT(work->flags & RT_WORK_STATE_SUBMITTING);
  159. RT_ASSERT(queue != RT_NULL);
  160. level = rt_spin_lock_irqsave(&(queue->spinlock));
  161. rt_timer_detach(&(work->timer));
  162. work->flags &= ~RT_WORK_STATE_SUBMITTING;
  163. /* remove delay list */
  164. rt_list_remove(&(work->list));
  165. /* insert work queue */
  166. if (queue->work_current != work)
  167. {
  168. rt_list_insert_after(queue->work_list.prev, &(work->list));
  169. work->flags |= RT_WORK_STATE_PENDING;
  170. }
  171. /* whether the workqueue is doing work */
  172. if (queue->work_current == RT_NULL)
  173. {
  174. /* resume work thread, and do a re-schedule if succeed */
  175. rt_thread_resume(queue->work_thread);
  176. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  177. }
  178. else
  179. {
  180. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  181. }
  182. }
  183. /**
  184. * @brief Initialize a work item, binding with a callback function.
  185. *
  186. * @param work is a pointer to the work item object.
  187. *
  188. * @param work_func is a callback function that will be called when this work item is executed.
  189. *
  190. * @param work_data is a user data passed to the callback function as the second parameter.
  191. */
  192. void rt_work_init(struct rt_work *work,
  193. void (*work_func)(struct rt_work *work, void *work_data),
  194. void *work_data)
  195. {
  196. RT_ASSERT(work != RT_NULL);
  197. RT_ASSERT(work_func != RT_NULL);
  198. rt_list_init(&(work->list));
  199. work->work_func = work_func;
  200. work->work_data = work_data;
  201. work->workqueue = RT_NULL;
  202. work->flags = 0;
  203. work->type = 0;
  204. }
  205. /**
  206. * @brief Create a work queue with a thread inside.
  207. *
  208. * @param name is a name of the work queue thread.
  209. *
  210. * @param stack_size is stack size of the work queue thread.
  211. *
  212. * @param priority is a priority of the work queue thread.
  213. *
  214. * @return Return a pointer to the workqueue object. It will return RT_NULL if failed.
  215. */
  216. struct rt_workqueue *rt_workqueue_create(const char *name, rt_uint16_t stack_size, rt_uint8_t priority)
  217. {
  218. struct rt_workqueue *queue = RT_NULL;
  219. queue = (struct rt_workqueue *)RT_KERNEL_MALLOC(sizeof(struct rt_workqueue));
  220. if (queue != RT_NULL)
  221. {
  222. /* initialize work list */
  223. rt_list_init(&(queue->work_list));
  224. rt_list_init(&(queue->delayed_list));
  225. queue->work_current = RT_NULL;
  226. rt_sem_init(&(queue->sem), "wqueue", 0, RT_IPC_FLAG_FIFO);
  227. /* create the work thread */
  228. queue->work_thread = rt_thread_create(name, _workqueue_thread_entry, queue, stack_size, priority, 10);
  229. if (queue->work_thread == RT_NULL)
  230. {
  231. rt_sem_detach(&(queue->sem));
  232. RT_KERNEL_FREE(queue);
  233. return RT_NULL;
  234. }
  235. rt_spin_lock_init(&(queue->spinlock));
  236. rt_thread_startup(queue->work_thread);
  237. }
  238. return queue;
  239. }
  240. /**
  241. * @brief Destroy a work queue.
  242. *
  243. * @param queue is a pointer to the workqueue object.
  244. *
  245. * @return RT_EOK Success.
  246. */
  247. rt_err_t rt_workqueue_destroy(struct rt_workqueue *queue)
  248. {
  249. RT_ASSERT(queue != RT_NULL);
  250. rt_workqueue_cancel_all_work(queue);
  251. rt_thread_delete(queue->work_thread);
  252. rt_sem_detach(&(queue->sem));
  253. RT_KERNEL_FREE(queue);
  254. return RT_EOK;
  255. }
  256. /**
  257. * @brief Submit a work item to the work queue without delay.
  258. *
  259. * @param queue is a pointer to the workqueue object.
  260. *
  261. * @param work is a pointer to the work item object.
  262. *
  263. * @return RT_EOK Success.
  264. * -RT_EBUSY This work item is executing.
  265. */
  266. rt_err_t rt_workqueue_dowork(struct rt_workqueue *queue, struct rt_work *work)
  267. {
  268. RT_ASSERT(queue != RT_NULL);
  269. RT_ASSERT(work != RT_NULL);
  270. return _workqueue_submit_work(queue, work, 0);
  271. }
  272. /**
  273. * @brief Submit a work item to the work queue with a delay.
  274. *
  275. * @param queue is a pointer to the workqueue object.
  276. *
  277. * @param work is a pointer to the work item object.
  278. *
  279. * @param ticks is the delay ticks for the work item to be submitted to the work queue.
  280. *
  281. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  282. *
  283. * @return RT_EOK Success.
  284. * -RT_EBUSY This work item is executing.
  285. * -RT_ERROR The ticks parameter is invalid.
  286. */
  287. rt_err_t rt_workqueue_submit_work(struct rt_workqueue *queue, struct rt_work *work, rt_tick_t ticks)
  288. {
  289. RT_ASSERT(queue != RT_NULL);
  290. RT_ASSERT(work != RT_NULL);
  291. RT_ASSERT(ticks < RT_TICK_MAX / 2);
  292. return _workqueue_submit_work(queue, work, ticks);
  293. }
  294. /**
  295. * @brief Submit a work item to the work queue without delay. This work item will be executed after the current work item.
  296. *
  297. * @param queue is a pointer to the workqueue object.
  298. *
  299. * @param work is a pointer to the work item object.
  300. *
  301. * @return RT_EOK Success.
  302. */
  303. rt_err_t rt_workqueue_urgent_work(struct rt_workqueue *queue, struct rt_work *work)
  304. {
  305. rt_base_t level;
  306. RT_ASSERT(queue != RT_NULL);
  307. RT_ASSERT(work != RT_NULL);
  308. level = rt_spin_lock_irqsave(&(queue->spinlock));
  309. /* NOTE: the work MUST be initialized firstly */
  310. rt_list_remove(&(work->list));
  311. rt_list_insert_after(&queue->work_list, &(work->list));
  312. /* whether the workqueue is doing work */
  313. if (queue->work_current == RT_NULL)
  314. {
  315. /* resume work thread, and do a re-schedule if succeed */
  316. rt_thread_resume(queue->work_thread);
  317. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  318. }
  319. else
  320. {
  321. rt_spin_unlock_irqrestore(&(queue->spinlock), level);
  322. }
  323. return RT_EOK;
  324. }
  325. /**
  326. * @brief Cancel a work item in the work queue.
  327. *
  328. * @param queue is a pointer to the workqueue object.
  329. *
  330. * @param work is a pointer to the work item object.
  331. *
  332. * @return RT_EOK Success.
  333. * -RT_EBUSY This work item is executing.
  334. */
  335. rt_err_t rt_workqueue_cancel_work(struct rt_workqueue *queue, struct rt_work *work)
  336. {
  337. RT_ASSERT(work != RT_NULL);
  338. RT_ASSERT(queue != RT_NULL);
  339. return _workqueue_cancel_work(queue, work);
  340. }
  341. /**
  342. * @brief Cancel a work item in the work queue. If the work item is executing, this function will block until it is done.
  343. *
  344. * @param queue is a pointer to the workqueue object.
  345. *
  346. * @param work is a pointer to the work item object.
  347. *
  348. * @return RT_EOK Success.
  349. */
  350. rt_err_t rt_workqueue_cancel_work_sync(struct rt_workqueue *queue, struct rt_work *work)
  351. {
  352. RT_ASSERT(queue != RT_NULL);
  353. RT_ASSERT(work != RT_NULL);
  354. if (queue->work_current == work) /* it's current work in the queue */
  355. {
  356. /* wait for work completion */
  357. rt_sem_take(&(queue->sem), RT_WAITING_FOREVER);
  358. }
  359. else
  360. {
  361. _workqueue_cancel_work(queue, work);
  362. }
  363. return RT_EOK;
  364. }
  365. /**
  366. * @brief This function will cancel all work items in work queue.
  367. *
  368. * @param queue is a pointer to the workqueue object.
  369. *
  370. * @return RT_EOK Success.
  371. */
  372. rt_err_t rt_workqueue_cancel_all_work(struct rt_workqueue *queue)
  373. {
  374. struct rt_work *work;
  375. RT_ASSERT(queue != RT_NULL);
  376. /* cancel work */
  377. rt_enter_critical();
  378. while (rt_list_isempty(&queue->work_list) == RT_FALSE)
  379. {
  380. work = rt_list_first_entry(&queue->work_list, struct rt_work, list);
  381. _workqueue_cancel_work(queue, work);
  382. }
  383. /* cancel delay work */
  384. while (rt_list_isempty(&queue->delayed_list) == RT_FALSE)
  385. {
  386. work = rt_list_first_entry(&queue->delayed_list, struct rt_work, list);
  387. _workqueue_cancel_work(queue, work);
  388. }
  389. rt_exit_critical();
  390. return RT_EOK;
  391. }
  392. #ifdef RT_USING_SYSTEM_WORKQUEUE
  393. static struct rt_workqueue *sys_workq; /* system work queue */
  394. /**
  395. * @brief Submit a work item to the system work queue with a delay.
  396. *
  397. * @param work is a pointer to the work item object.
  398. *
  399. * @param ticks is the delay OS ticks for the work item to be submitted to the work queue.
  400. *
  401. * NOTE: The max timeout tick should be no more than (RT_TICK_MAX/2 - 1)
  402. *
  403. * @return RT_EOK Success.
  404. * -RT_EBUSY This work item is executing.
  405. * -RT_ERROR The ticks parameter is invalid.
  406. */
  407. rt_err_t rt_work_submit(struct rt_work *work, rt_tick_t ticks)
  408. {
  409. return rt_workqueue_submit_work(sys_workq, work, ticks);
  410. }
  411. /**
  412. * @brief Submit a work item to the system work queue without delay. This work item will be executed after the current work item.
  413. *
  414. * @param work is a pointer to the work item object.
  415. *
  416. * @return RT_EOK Success.
  417. */
  418. rt_err_t rt_work_urgent(struct rt_work *work)
  419. {
  420. return rt_workqueue_urgent_work(sys_workq, work);
  421. }
  422. /**
  423. * @brief Cancel a work item in the system work queue.
  424. *
  425. * @param work is a pointer to the work item object.
  426. *
  427. * @return RT_EOK Success.
  428. * -RT_EBUSY This work item is executing.
  429. */
  430. rt_err_t rt_work_cancel(struct rt_work *work)
  431. {
  432. return rt_workqueue_cancel_work(sys_workq, work);
  433. }
  434. static int rt_work_sys_workqueue_init(void)
  435. {
  436. if (sys_workq != RT_NULL)
  437. return RT_EOK;
  438. sys_workq = rt_workqueue_create("sys workq", RT_SYSTEM_WORKQUEUE_STACKSIZE,
  439. RT_SYSTEM_WORKQUEUE_PRIORITY);
  440. RT_ASSERT(sys_workq != RT_NULL);
  441. return RT_EOK;
  442. }
  443. INIT_PREV_EXPORT(rt_work_sys_workqueue_init);
  444. #endif /* RT_USING_SYSTEM_WORKQUEUE */
  445. #endif /* RT_USING_HEAP */