fifo.h 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. #ifndef __fifo_h__
  2. #define __fifo_h__
  3. #include <stdbool.h>
  4. #include <stdint.h>
  5. #include <string.h>
  6. #define FIFO_BUF_LEN 512
  7. typedef struct
  8. {
  9. uint8_t buf[FIFO_BUF_LEN];
  10. uint32_t start_idx;
  11. uint32_t end_idx;
  12. uint32_t free_items;
  13. } fifo_t;
  14. static inline void fifo_init(fifo_t * p_fifo)
  15. {
  16. memset(p_fifo, 0, sizeof(fifo_t));
  17. p_fifo->free_items = FIFO_BUF_LEN;
  18. }
  19. static inline uint32_t fifo_num_elem_get(fifo_t * p_fifo)
  20. {
  21. return (FIFO_BUF_LEN - p_fifo->free_items);
  22. }
  23. static inline void fifo_get_pkt(fifo_t * p_fifo, uint8_t * p_buf, uint32_t * p_buf_len)
  24. {
  25. uint32_t num_items;
  26. if (p_fifo->free_items == sizeof(p_fifo->buf))
  27. {
  28. *p_buf_len = 0;
  29. return;
  30. }
  31. if (p_fifo->start_idx < p_fifo->end_idx)
  32. {
  33. num_items = p_fifo->end_idx - p_fifo->start_idx;
  34. }
  35. else
  36. {
  37. num_items = p_fifo->end_idx + (sizeof(p_fifo->buf) - p_fifo->start_idx);
  38. }
  39. // Truncating elements to get from fifo
  40. if (num_items > *p_buf_len)
  41. {
  42. num_items = *p_buf_len;
  43. }
  44. *p_buf_len = num_items;
  45. if (p_fifo->start_idx + num_items > sizeof(p_fifo->buf))
  46. {
  47. uint32_t bytes_to_copy;
  48. // Wrap around
  49. bytes_to_copy = sizeof(p_fifo->buf) - p_fifo->start_idx;
  50. memcpy(p_buf, &p_fifo->buf[p_fifo->start_idx], bytes_to_copy);
  51. p_buf += bytes_to_copy;
  52. p_fifo->free_items += bytes_to_copy;
  53. p_fifo->start_idx = 0;
  54. num_items -= bytes_to_copy;
  55. }
  56. memcpy(p_buf, &p_fifo->buf[p_fifo->start_idx], num_items);
  57. p_fifo->start_idx += num_items;
  58. p_fifo->free_items += num_items;
  59. }
  60. static inline void fifo_peek_pkt(fifo_t * p_fifo, uint8_t * p_buf, uint32_t * p_buf_len)
  61. {
  62. uint32_t num_items, start_idx;
  63. if (p_fifo->free_items == sizeof(p_fifo->buf))
  64. {
  65. *p_buf_len = 0;
  66. return;
  67. }
  68. start_idx = p_fifo->start_idx;
  69. if (p_fifo->start_idx < p_fifo->end_idx)
  70. {
  71. num_items = p_fifo->end_idx - p_fifo->start_idx;
  72. }
  73. else
  74. {
  75. num_items = p_fifo->end_idx + (sizeof(p_fifo->buf) - p_fifo->start_idx);
  76. }
  77. // Truncating elements to get from fifo
  78. if (num_items > *p_buf_len)
  79. {
  80. num_items = *p_buf_len;
  81. }
  82. *p_buf_len = num_items;
  83. if (start_idx + num_items > sizeof(p_fifo->buf))
  84. {
  85. uint32_t bytes_to_copy;
  86. // Wrap around
  87. bytes_to_copy = sizeof(p_fifo->buf) - start_idx;
  88. memcpy(p_buf, &p_fifo->buf[start_idx], bytes_to_copy);
  89. p_buf += bytes_to_copy;
  90. start_idx = 0;
  91. num_items -= bytes_to_copy;
  92. }
  93. memcpy(p_buf, &p_fifo->buf[start_idx], num_items);
  94. }
  95. static inline bool fifo_put_pkt(fifo_t * p_fifo, uint8_t * p_buf, uint32_t p_buf_len)
  96. {
  97. if (p_fifo->free_items < p_buf_len)
  98. {
  99. return false;
  100. }
  101. for (int i = 0; i < p_buf_len; ++i)
  102. {
  103. p_fifo->buf[p_fifo->end_idx] = p_buf[i];
  104. ++p_fifo->end_idx;
  105. if (p_fifo->end_idx == sizeof(p_fifo->buf))
  106. {
  107. p_fifo->end_idx = 0;
  108. }
  109. }
  110. p_fifo->free_items -= p_buf_len;
  111. return true;
  112. }
  113. static inline bool fifo_put_char(fifo_t * p_fifo, uint8_t p_char)
  114. {
  115. if (p_fifo->free_items == 0)
  116. {
  117. return false;
  118. }
  119. p_fifo->buf[p_fifo->end_idx++] = p_char;
  120. if (p_fifo->end_idx == sizeof(p_fifo->buf))
  121. {
  122. p_fifo->end_idx = 0;
  123. }
  124. p_fifo->free_items -= 1;
  125. return true;
  126. }
  127. #endif /* __fifo_h__ */