bypass.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355
  1. /*
  2. * Copyright (c) 2006-2024 RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2024-11-20 zhujiale the first version
  9. */
  10. #include<rtdevice.h>
  11. #define DBG_TAG "UART"
  12. #define DBG_LVL DBG_INFO
  13. #include <rtdbg.h>
  14. static struct rt_serial_bypass_func* rt_bypass_alloc_func(const char* name, rt_uint8_t level, bypass_function_t func, void* data)
  15. {
  16. struct rt_serial_bypass_func* bypass;
  17. if (!func)
  18. return RT_NULL;
  19. bypass = rt_malloc(sizeof(struct rt_serial_bypass_func));
  20. rt_memset(bypass, 0, sizeof(struct rt_serial_bypass_func));
  21. if (rt_strlen(name) > RT_NAME_MAX - 1)
  22. rt_memcpy(bypass->name, name, RT_NAME_MAX);
  23. else
  24. rt_memcpy(bypass->name, name, rt_strlen(name) + 1);
  25. bypass->level = level;
  26. rt_list_init(&bypass->node);
  27. bypass->bypass = func;
  28. bypass->data = data;
  29. return bypass;
  30. }
  31. rt_err_t rt_serial_bypass_init(struct rt_serial_device* serial)
  32. {
  33. serial->bypass = rt_malloc(sizeof(struct rt_serial_bypass));
  34. rt_memset(serial->bypass, 0, sizeof(struct rt_serial_bypass));
  35. serial->bypass->pipe = rt_ringbuffer_create(serial->config.bufsz);
  36. serial->bypass->mutex = rt_mutex_create("serial_bypass", RT_IPC_FLAG_FIFO);
  37. return RT_EOK;
  38. }
  39. static rt_err_t rt_bypass_register(struct rt_serial_bypass_head* bypass, const char* name, rt_uint8_t level, bypass_function_t func, void* data)
  40. {
  41. struct rt_serial_bypass_func* pass = RT_NULL;
  42. struct rt_list_node* node;
  43. int flags;
  44. RT_DEBUG_NOT_IN_INTERRUPT;
  45. pass = rt_bypass_alloc_func(name, level, func, data);
  46. RT_ASSERT(bypass != RT_NULL);
  47. node = bypass->head.next;
  48. if (node == &bypass->head)
  49. {
  50. rt_list_insert_before(&pass->node, node);
  51. return RT_EOK;
  52. }
  53. flags = rt_spin_lock_irqsave(&(bypass->spinlock));
  54. do {
  55. struct rt_serial_bypass_func* temp_curr;
  56. temp_curr = rt_container_of(node, struct rt_serial_bypass_func, node);
  57. if (level < temp_curr->level)
  58. {
  59. rt_list_insert_before(node, &pass->node);
  60. rt_spin_unlock_irqrestore(&(bypass->spinlock), flags);
  61. return RT_EOK;
  62. }
  63. else if (level == temp_curr->level)
  64. {
  65. rt_spin_unlock_irqrestore(&(bypass->spinlock), flags);
  66. LOG_E("Conflict: bypass [%s] level conflicts with [%s] at level [%d]\n", name, temp_curr->name, level);
  67. rt_free(pass);
  68. return -RT_ERROR;
  69. }
  70. node = node->next;
  71. } while (node != &bypass->head);
  72. rt_list_insert_before(&bypass->head, &pass->node);
  73. rt_spin_unlock_irqrestore(&(bypass->spinlock), flags);
  74. return RT_EOK;
  75. }
  76. rt_err_t rt_bypass_upper_register(struct rt_serial_device* serial, const char* name, rt_uint8_t level, bypass_function_t func, void* data)
  77. {
  78. if (!serial->bypass)
  79. rt_serial_bypass_init(serial);
  80. if (!serial->bypass->upper_h)
  81. {
  82. serial->bypass->upper_h = rt_malloc(sizeof(struct rt_serial_bypass_head));
  83. rt_spin_lock_init(&serial->bypass->upper_h->spinlock);
  84. rt_list_init(&serial->bypass->upper_h->head);
  85. }
  86. return rt_bypass_register(serial->bypass->upper_h, name, level, func, data);
  87. }
  88. void rt_bypass_putchar(struct rt_serial_device* serial, rt_uint8_t ch)
  89. {
  90. rt_mutex_take(serial->bypass->mutex, RT_WAITING_FOREVER);
  91. rt_ringbuffer_putchar(serial->bypass->pipe, ch);
  92. rt_mutex_release(serial->bypass->mutex);
  93. }
  94. rt_size_t rt_bypass_getchar(struct rt_serial_device* serial, rt_uint8_t* ch)
  95. {
  96. int flags;
  97. rt_mutex_take(serial->bypass->mutex, RT_WAITING_FOREVER);
  98. flags = rt_ringbuffer_getchar(serial->bypass->pipe, ch);
  99. rt_mutex_release(serial->bypass->mutex);
  100. return flags;
  101. }
  102. static inline rt_err_t _bypass_getchar_form_serial_fifo(struct rt_serial_device* serial, char* ch)
  103. {
  104. rt_base_t level;
  105. struct rt_serial_rx_fifo* rx_fifo;
  106. rx_fifo = (struct rt_serial_rx_fifo*)serial->serial_rx;
  107. /* disable interrupt */
  108. level = rt_spin_lock_irqsave(&(serial->spinlock));
  109. /* there's no data: */
  110. if ((rx_fifo->get_index == rx_fifo->put_index) && (rx_fifo->is_full == RT_FALSE))
  111. {
  112. /* no data, enable interrupt and break out */
  113. rt_spin_unlock_irqrestore(&(serial->spinlock), level);
  114. return -RT_EEMPTY;
  115. }
  116. /* otherwise there's the data: */
  117. *ch = rx_fifo->buffer[rx_fifo->get_index];
  118. rx_fifo->get_index += 1;
  119. if (rx_fifo->get_index >= serial->config.bufsz) rx_fifo->get_index = 0;
  120. if (rx_fifo->is_full == RT_TRUE)
  121. {
  122. rx_fifo->is_full = RT_FALSE;
  123. }
  124. /* enable interrupt */
  125. rt_spin_unlock_irqrestore(&(serial->spinlock), level);
  126. return RT_EOK;
  127. }
  128. static void _lower_work(struct rt_serial_device* serial)
  129. {
  130. struct rt_list_node* node;
  131. struct rt_serial_bypass_func* temp_curr = RT_NULL;
  132. if (serial->bypass && serial->bypass->lower_h)
  133. {
  134. while (1)
  135. {
  136. char ch;
  137. if (_bypass_getchar_form_serial_fifo(serial, &ch))
  138. return;
  139. node = serial->bypass->lower_h->head.next;
  140. while (node != &serial->bypass->lower_h->head)
  141. {
  142. temp_curr = rt_container_of(node, struct rt_serial_bypass_func, node);
  143. if (!temp_curr->bypass(serial, ch, temp_curr->data))
  144. {
  145. break;
  146. }
  147. node = node->next;
  148. }
  149. if (node == &serial->bypass->lower_h->head)
  150. {
  151. rt_bypass_putchar(serial, ch);
  152. }
  153. }
  154. }
  155. }
  156. static void rt_lower_work(struct rt_work* work, void* work_data)
  157. {
  158. struct rt_serial_device* serial = (struct rt_serial_device*)work_data;
  159. RT_ASSERT(serial != RT_NULL);
  160. _lower_work(serial);
  161. }
  162. rt_err_t rt_bypass_lower_register(struct rt_serial_device* serial, const char* name, rt_uint8_t level, bypass_function_t func, void* data)
  163. {
  164. if (!serial->bypass)
  165. rt_serial_bypass_init(serial);
  166. if (!serial->bypass->lower_h)
  167. {
  168. serial->bypass->lower_workq = rt_workqueue_create("serial bypass", RT_SYSTEM_WORKQUEUE_STACKSIZE,
  169. RT_SYSTEM_WORKQUEUE_PRIORITY);
  170. rt_work_init(&serial->bypass->work, rt_lower_work, (void*)serial);
  171. serial->bypass->lower_h = rt_malloc(sizeof(struct rt_serial_bypass_head));
  172. rt_spin_lock_init(&serial->bypass->lower_h->spinlock);
  173. rt_list_init(&serial->bypass->lower_h->head);
  174. }
  175. return rt_bypass_register(serial->bypass->lower_h, name, level, func, data);
  176. }
  177. void rt_bypass_work_straight(struct rt_serial_device* serial)
  178. {
  179. if (serial->bypass && serial->bypass->lower_h)
  180. {
  181. _lower_work(serial);
  182. return;
  183. }
  184. while (1)
  185. {
  186. char ch;
  187. if (_bypass_getchar_form_serial_fifo(serial, &ch))
  188. return;
  189. rt_bypass_putchar(serial, ch);
  190. }
  191. }
  192. rt_err_t rt_bypass_unregister(struct rt_serial_bypass_head* bypass, rt_uint8_t level)
  193. {
  194. struct rt_list_node* node;
  195. struct rt_serial_bypass_func* temp_curr = RT_NULL;
  196. int flags;
  197. /*Can not unregister protect level in bypass it general be msh or tty*/
  198. if (level > RT_BYPASS_PROTECT_LEVEL_1)
  199. return -RT_ERROR;
  200. if (!bypass)
  201. return -RT_ERROR;
  202. node = bypass->head.next;
  203. flags = rt_spin_lock_irqsave(&(bypass->spinlock));
  204. do {
  205. temp_curr = rt_container_of(node, struct rt_serial_bypass_func, node);
  206. if (level == temp_curr->level)
  207. {
  208. rt_list_remove(node);
  209. rt_spin_unlock_irqrestore(&(bypass->spinlock), flags);
  210. rt_free(temp_curr);
  211. return RT_EOK;
  212. }
  213. node = node->next;
  214. } while (node != &bypass->head);
  215. LOG_E("Can't find bypass with level [%d]", level);
  216. rt_spin_unlock_irqrestore(&(bypass->spinlock), flags);
  217. return -RT_ERROR;
  218. }
  219. rt_err_t rt_bypass_upper_unregister(struct rt_serial_device* serial, rt_uint8_t level)
  220. {
  221. if (!serial->bypass || !serial->bypass->upper_h)
  222. return -RT_ERROR;
  223. return rt_bypass_unregister(serial->bypass->upper_h, level);
  224. }
  225. rt_err_t rt_bypass_lower_unregister(struct rt_serial_device* serial, rt_uint8_t level)
  226. {
  227. if (!serial->bypass || !serial->bypass->lower_h)
  228. return -RT_ERROR;
  229. return rt_bypass_unregister(serial->bypass->lower_h, level);
  230. }
  231. int serial_bypass_list(int argc, char** argv)
  232. {
  233. struct rt_serial_device* serial = RT_NULL;
  234. struct rt_serial_bypass_func* current;
  235. struct rt_list_node* node;
  236. int flags;
  237. serial = (struct rt_serial_device*)rt_console_get_device();
  238. if (!serial || !serial->bypass)
  239. {
  240. rt_kprintf("Serial bypass not initialized.\n");
  241. return -1;
  242. }
  243. /* 遍历 Upper Bypass 链表 */
  244. if (serial->bypass->upper_h)
  245. {
  246. rt_kprintf("Upper bypass chain:\n");
  247. node = serial->bypass->upper_h->head.next;
  248. flags = rt_spin_lock_irqsave(&(serial->bypass->upper_h->spinlock)); /* 加锁*/
  249. while (node != &serial->bypass->upper_h->head)
  250. {
  251. current = rt_container_of(node, struct rt_serial_bypass_func, node);
  252. rt_kprintf(" - Name: [%s], Level: [%d]\n", current->name, current->level);
  253. node = node->next;
  254. }
  255. rt_spin_unlock_irqrestore(&(serial->bypass->upper_h->spinlock), flags); /* 解锁*/
  256. }
  257. else
  258. {
  259. rt_kprintf("Upper bypass chain is empty.\n");
  260. }
  261. /* 遍历 Lower Bypass 链表 */
  262. if (serial->bypass->lower_h)
  263. {
  264. rt_kprintf("Lower bypass chain:\n");
  265. node = serial->bypass->lower_h->head.next;
  266. flags = rt_spin_lock_irqsave(&(serial->bypass->lower_h->spinlock)); /* 加锁*/
  267. while (node != &serial->bypass->lower_h->head)
  268. {
  269. current = rt_container_of(node, struct rt_serial_bypass_func, node);
  270. rt_kprintf(" - Name: [%s], Level: [%d]\n", current->name, current->level);
  271. node = node->next;
  272. }
  273. rt_spin_unlock_irqrestore(&(serial->bypass->lower_h->spinlock), flags); /* 解锁*/
  274. }
  275. else
  276. {
  277. rt_kprintf("Lower bypass chain is empty.\n");
  278. }
  279. return 0;
  280. }
  281. MSH_CMD_EXPORT(serial_bypass_list, serial bypass list)