fb_queue.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270
  1. #include <stdio.h>
  2. #include "rtos.h"
  3. #include "xm_base.h"
  4. #include "board.h"
  5. #include "fb_queue.h"
  6. #define MAX_FB_COUONT 4
  7. typedef struct fb_queue_info {
  8. queue_s ready_list; // 已准备好的LCD帧链表
  9. queue_s free_list; // 空闲链表
  10. void *fb_buf;
  11. int fb_count;
  12. fb_queue_s frames[MAX_FB_COUONT];
  13. } fb_queue_t;
  14. static fb_queue_t *g_fq = NULL;
  15. void queue_initialize(queue_s *queue)
  16. {
  17. queue->prev = queue;
  18. queue->next = queue;
  19. }
  20. void queue_insert(queue_s *entry, queue_s *queue)
  21. {
  22. entry->prev = queue->prev;
  23. entry->next = queue;
  24. queue->prev->next = entry;
  25. queue->prev = entry;
  26. }
  27. void queue_delete(queue_s *entry)
  28. {
  29. if (entry->prev == entry || entry->next == entry)
  30. {
  31. //assert(0);
  32. printf("%s, assert\n", __func__);
  33. }
  34. if (entry->next != entry)
  35. {
  36. entry->prev->next = entry->next;
  37. entry->next->prev = entry->prev;
  38. entry->prev = entry;
  39. entry->next = entry;
  40. }
  41. }
  42. queue_s * queue_head(queue_s *queue)
  43. {
  44. if (queue->next == queue)
  45. {
  46. //assert(0);
  47. printf("%s, assert\n", __func__);
  48. }
  49. return (queue_s *)queue->next;
  50. }
  51. queue_s * queue_tail(queue_s *queue)
  52. {
  53. if (queue->next == queue)
  54. {
  55. //assert(0);
  56. printf("%s, assert\n", __func__);
  57. }
  58. return (queue_s *)queue->prev;
  59. }
  60. queue_s * queue_delete_next(queue_s *queue)
  61. {
  62. volatile queue_s *entry;
  63. if (queue->next == queue || queue->prev == queue)
  64. {
  65. //assert(0);
  66. printf("%s, assert\n", __func__);
  67. }
  68. entry = queue->next;
  69. queue->next = entry->next;
  70. entry->next->prev = queue;
  71. entry->prev = (queue_s *)entry;
  72. entry->next = (queue_s *)entry;
  73. return((queue_s *)entry);
  74. }
  75. queue_s * queue_next(queue_s *queue)
  76. {
  77. return (queue_s *)queue->next;
  78. }
  79. queue_s * queue_prev(queue_s *queue)
  80. {
  81. return (queue_s *)queue->prev;
  82. }
  83. int queue_empty(queue_s *queue)
  84. {
  85. if (queue->next == queue)
  86. {
  87. if (queue->prev != queue)
  88. {
  89. //assert(0);
  90. printf("%s, assert\n", __func__);
  91. }
  92. return(1);
  93. }
  94. return(0);
  95. }
  96. fb_queue_s *fb_queue_get_free_unit(void)
  97. {
  98. fb_queue_s *unit = NULL;
  99. if (g_fq)
  100. {
  101. XM_lock();
  102. if(!queue_empty (&g_fq->free_list))
  103. {
  104. unit = (fb_queue_s *)queue_delete_next (&g_fq->free_list);
  105. }
  106. XM_unlock();
  107. }
  108. return unit;
  109. }
  110. void fb_queue_set_free (fb_queue_s *unit)
  111. {
  112. if (g_fq)
  113. {
  114. XM_lock();
  115. queue_insert ((queue_s *)unit, &g_fq->free_list);
  116. XM_unlock();
  117. }
  118. }
  119. void fb_queue_set_free_isr (fb_queue_s *unit)
  120. {
  121. if (g_fq)
  122. queue_insert ((queue_s *)unit, &g_fq->free_list);
  123. }
  124. void fb_queue_set_ready (fb_queue_s *unit)
  125. {
  126. if (g_fq)
  127. {
  128. XM_lock();
  129. queue_insert ((queue_s *)unit, &g_fq->ready_list);
  130. XM_unlock();
  131. }
  132. }
  133. fb_queue_s *fb_queue_get_ready_unit_isr(void)
  134. {
  135. fb_queue_s *unit = NULL;
  136. if (g_fq)
  137. {
  138. if(!queue_empty (&g_fq->ready_list))
  139. {
  140. unit = (fb_queue_s *)queue_delete_next (&g_fq->ready_list);
  141. }
  142. }
  143. return unit;
  144. }
  145. fb_queue_s *fb_queue_get_ready_unit(void)
  146. {
  147. fb_queue_s *unit = NULL;
  148. if (g_fq)
  149. {
  150. XM_lock();
  151. if(!queue_empty (&g_fq->ready_list))
  152. {
  153. unit = (fb_queue_s *)queue_delete_next (&g_fq->ready_list);
  154. }
  155. XM_unlock();
  156. }
  157. return unit;
  158. }
  159. fb_queue_s *fb_queue_get_unit_from_base(unsigned int base)
  160. {
  161. if (g_fq)
  162. {
  163. for (int i = 0; i < g_fq->fb_count; i ++)
  164. {
  165. if(g_fq->frames[i].fb_base == base)
  166. return g_fq->frames + i;
  167. }
  168. }
  169. return NULL;
  170. }
  171. void *fb_queue_init(uint32_t fb_count, uint32_t fb_size)
  172. {
  173. fb_queue_t *fq;
  174. if (!fb_count || !fb_size) {
  175. printf("ERR: %s, Invalid fb count:%d or size:%d.\n", __func__, fb_count, fb_size);
  176. return NULL;
  177. }
  178. if (fb_count > MAX_FB_COUONT) {
  179. printf("Warnning: %s, Invalid fb count:%d.\n", __func__, fb_count);
  180. }
  181. fq = pvPortMalloc(sizeof(fb_queue_t));
  182. if (!fq)
  183. {
  184. printf("ERR: %s, malloc fq fail.\n", __func__);
  185. return NULL;
  186. }
  187. queue_initialize (&fq->ready_list);
  188. queue_initialize (&fq->free_list);
  189. memset (fq->frames, 0, sizeof(fq->frames));
  190. fq->fb_count = fb_count;
  191. fq->fb_buf = pvPortMalloc(fb_size * fb_count);
  192. if (!fq->fb_buf)
  193. {
  194. printf("ERR: %s, malloc framebuffer fail.\n", __func__);
  195. return NULL;
  196. }
  197. memset(fq->fb_buf, 0, fb_size * fb_count);
  198. for (int i = 0; i < fb_count; i ++)
  199. {
  200. fq->frames[i].fb_base = i * fb_size + (unsigned int)fq->fb_buf;
  201. queue_insert ((queue_s *)(fq->frames + i), &fq->free_list);
  202. }
  203. g_fq = fq;
  204. return fq->fb_buf;
  205. exit:
  206. if (fq) {
  207. if (fq->fb_buf)
  208. vPortFree(fq->fb_buf);
  209. vPortFree(fq);
  210. }
  211. g_fq = NULL;
  212. return NULL;
  213. }
  214. void fb_queue_exit (void)
  215. {
  216. fb_queue_t *fq = g_fq;
  217. if (fq) {
  218. if (fq->fb_buf)
  219. vPortFree(fq->fb_buf);
  220. vPortFree(fq);
  221. }
  222. g_fq = NULL;
  223. }