dataqueue.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343
  1. /*
  2. * File : dataqueue.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2012, RT-Thread Development Team
  5. *
  6. * The license and distribution terms for this file may be
  7. * found in the file LICENSE in this distribution or at
  8. * http://www.rt-thread.org/license/LICENSE
  9. *
  10. * Change Logs:
  11. * Date Author Notes
  12. * 2012-09-30 Bernard first version.
  13. */
  14. #include <rtthread.h>
  15. #include <rtdevice.h>
  16. #include <rthw.h>
  17. struct rt_data_item
  18. {
  19. const void *data_ptr;
  20. rt_size_t data_size;
  21. };
  22. rt_err_t
  23. rt_data_queue_init(struct rt_data_queue *queue,
  24. rt_uint16_t size,
  25. rt_uint16_t lwm,
  26. void (*evt_notify)(struct rt_data_queue *queue, rt_uint32_t event))
  27. {
  28. RT_ASSERT(queue != RT_NULL);
  29. queue->evt_notify = evt_notify;
  30. queue->size = size;
  31. queue->lwm = lwm;
  32. queue->waiting_lwm = RT_FALSE;
  33. queue->get_index = 0;
  34. queue->put_index = 0;
  35. rt_list_init(&(queue->suspended_push_list));
  36. rt_list_init(&(queue->suspended_pop_list));
  37. queue->queue = (struct rt_data_item *)rt_malloc(sizeof(struct rt_data_item) * size);
  38. if (queue->queue == RT_NULL)
  39. {
  40. return -RT_ENOMEM;
  41. }
  42. return RT_EOK;
  43. }
  44. RTM_EXPORT(rt_data_queue_init);
  45. rt_err_t rt_data_queue_push(struct rt_data_queue *queue,
  46. const void *data_ptr,
  47. rt_size_t data_size,
  48. rt_int32_t timeout)
  49. {
  50. rt_uint16_t mask;
  51. rt_ubase_t level;
  52. rt_thread_t thread;
  53. rt_err_t result;
  54. RT_ASSERT(queue != RT_NULL);
  55. result = RT_EOK;
  56. thread = rt_thread_self();
  57. mask = queue->size - 1;
  58. level = rt_hw_interrupt_disable();
  59. while (queue->put_index - queue->get_index == queue->size)
  60. {
  61. queue->waiting_lwm = RT_TRUE;
  62. /* queue is full */
  63. if (timeout == 0)
  64. {
  65. result = -RT_ETIMEOUT;
  66. goto __exit;
  67. }
  68. /* current context checking */
  69. RT_DEBUG_NOT_IN_INTERRUPT;
  70. /* reset thread error number */
  71. thread->error = RT_EOK;
  72. /* suspend thread on the push list */
  73. rt_thread_suspend(thread);
  74. rt_list_insert_before(&(queue->suspended_push_list), &(thread->tlist));
  75. /* start timer */
  76. if (timeout > 0)
  77. {
  78. /* reset the timeout of thread timer and start it */
  79. rt_timer_control(&(thread->thread_timer),
  80. RT_TIMER_CTRL_SET_TIME,
  81. &timeout);
  82. rt_timer_start(&(thread->thread_timer));
  83. }
  84. /* enable interrupt */
  85. rt_hw_interrupt_enable(level);
  86. /* do schedule */
  87. rt_schedule();
  88. /* thread is waked up */
  89. result = thread->error;
  90. level = rt_hw_interrupt_disable();
  91. if (result != RT_EOK) goto __exit;
  92. }
  93. queue->queue[queue->put_index & mask].data_ptr = data_ptr;
  94. queue->queue[queue->put_index & mask].data_size = data_size;
  95. queue->put_index += 1;
  96. if (!rt_list_isempty(&(queue->suspended_pop_list)))
  97. {
  98. /* there is at least one thread in suspended list */
  99. /* get thread entry */
  100. thread = rt_list_entry(queue->suspended_pop_list.next,
  101. struct rt_thread,
  102. tlist);
  103. /* resume it */
  104. rt_thread_resume(thread);
  105. rt_hw_interrupt_enable(level);
  106. /* perform a schedule */
  107. rt_schedule();
  108. return result;
  109. }
  110. __exit:
  111. rt_hw_interrupt_enable(level);
  112. if ((result == RT_EOK) && queue->evt_notify != RT_NULL)
  113. {
  114. queue->evt_notify(queue, RT_DATAQUEUE_EVENT_PUSH);
  115. }
  116. return result;
  117. }
  118. RTM_EXPORT(rt_data_queue_push);
  119. rt_err_t rt_data_queue_pop(struct rt_data_queue *queue,
  120. const void** data_ptr,
  121. rt_size_t *size,
  122. rt_int32_t timeout)
  123. {
  124. rt_ubase_t level;
  125. rt_thread_t thread;
  126. rt_err_t result;
  127. rt_uint16_t mask;
  128. RT_ASSERT(queue != RT_NULL);
  129. RT_ASSERT(data_ptr != RT_NULL);
  130. RT_ASSERT(size != RT_NULL);
  131. result = RT_EOK;
  132. thread = rt_thread_self();
  133. mask = queue->size - 1;
  134. level = rt_hw_interrupt_disable();
  135. while (queue->get_index == queue->put_index)
  136. {
  137. /* queue is empty */
  138. if (timeout == 0)
  139. {
  140. result = -RT_ETIMEOUT;
  141. goto __exit;
  142. }
  143. /* current context checking */
  144. RT_DEBUG_NOT_IN_INTERRUPT;
  145. /* reset thread error number */
  146. thread->error = RT_EOK;
  147. /* suspend thread on the pop list */
  148. rt_thread_suspend(thread);
  149. rt_list_insert_before(&(queue->suspended_pop_list), &(thread->tlist));
  150. /* start timer */
  151. if (timeout > 0)
  152. {
  153. /* reset the timeout of thread timer and start it */
  154. rt_timer_control(&(thread->thread_timer),
  155. RT_TIMER_CTRL_SET_TIME,
  156. &timeout);
  157. rt_timer_start(&(thread->thread_timer));
  158. }
  159. /* enable interrupt */
  160. rt_hw_interrupt_enable(level);
  161. /* do schedule */
  162. rt_schedule();
  163. /* thread is waked up */
  164. result = thread->error;
  165. level = rt_hw_interrupt_disable();
  166. if (result != RT_EOK)
  167. goto __exit;
  168. }
  169. *data_ptr = queue->queue[queue->get_index & mask].data_ptr;
  170. *size = queue->queue[queue->get_index & mask].data_size;
  171. queue->get_index += 1;
  172. if ((queue->waiting_lwm == RT_TRUE) &&
  173. (queue->put_index - queue->get_index) <= queue->lwm)
  174. {
  175. queue->waiting_lwm = RT_FALSE;
  176. /*
  177. * there is at least one thread in suspended list
  178. * and less than low water mark
  179. */
  180. if (!rt_list_isempty(&(queue->suspended_push_list)))
  181. {
  182. /* get thread entry */
  183. thread = rt_list_entry(queue->suspended_push_list.next,
  184. struct rt_thread,
  185. tlist);
  186. /* resume it */
  187. rt_thread_resume(thread);
  188. rt_hw_interrupt_enable(level);
  189. /* perform a schedule */
  190. rt_schedule();
  191. }
  192. if (queue->evt_notify != RT_NULL)
  193. queue->evt_notify(queue, RT_DATAQUEUE_EVENT_LWM);
  194. return result;
  195. }
  196. __exit:
  197. rt_hw_interrupt_enable(level);
  198. if ((result == RT_EOK) && (queue->evt_notify != RT_NULL))
  199. {
  200. queue->evt_notify(queue, RT_DATAQUEUE_EVENT_POP);
  201. }
  202. return result;
  203. }
  204. RTM_EXPORT(rt_data_queue_pop);
  205. rt_err_t rt_data_queue_peak(struct rt_data_queue *queue,
  206. const void** data_ptr,
  207. rt_size_t *size)
  208. {
  209. rt_ubase_t level;
  210. rt_uint16_t mask;
  211. RT_ASSERT(queue != RT_NULL);
  212. mask = queue->size - 1;
  213. level = rt_hw_interrupt_disable();
  214. if (queue->get_index == queue->put_index)
  215. {
  216. rt_hw_interrupt_enable(level);
  217. return -RT_EEMPTY;
  218. }
  219. *data_ptr = queue->queue[queue->get_index & mask].data_ptr;
  220. *size = queue->queue[queue->get_index & mask].data_size;
  221. rt_hw_interrupt_enable(level);
  222. return RT_EOK;
  223. }
  224. RTM_EXPORT(rt_data_queue_peak);
  225. void rt_data_queue_reset(struct rt_data_queue *queue)
  226. {
  227. struct rt_thread *thread;
  228. register rt_ubase_t temp;
  229. rt_enter_critical();
  230. /* wakeup all suspend threads */
  231. /* resume on pop list */
  232. while (!rt_list_isempty(&(queue->suspended_pop_list)))
  233. {
  234. /* disable interrupt */
  235. temp = rt_hw_interrupt_disable();
  236. /* get next suspend thread */
  237. thread = rt_list_entry(queue->suspended_pop_list.next,
  238. struct rt_thread,
  239. tlist);
  240. /* set error code to RT_ERROR */
  241. thread->error = -RT_ERROR;
  242. /*
  243. * resume thread
  244. * In rt_thread_resume function, it will remove current thread from
  245. * suspend list
  246. */
  247. rt_thread_resume(thread);
  248. /* enable interrupt */
  249. rt_hw_interrupt_enable(temp);
  250. }
  251. /* resume on push list */
  252. while (!rt_list_isempty(&(queue->suspended_push_list)))
  253. {
  254. /* disable interrupt */
  255. temp = rt_hw_interrupt_disable();
  256. /* get next suspend thread */
  257. thread = rt_list_entry(queue->suspended_push_list.next,
  258. struct rt_thread,
  259. tlist);
  260. /* set error code to RT_ERROR */
  261. thread->error = -RT_ERROR;
  262. /*
  263. * resume thread
  264. * In rt_thread_resume function, it will remove current thread from
  265. * suspend list
  266. */
  267. rt_thread_resume(thread);
  268. /* enable interrupt */
  269. rt_hw_interrupt_enable(temp);
  270. }
  271. rt_exit_critical();
  272. rt_schedule();
  273. }
  274. RTM_EXPORT(rt_data_queue_reset);